{"meta":{"query_hash":"c746e7dad116","filters":{"topic":"Vehicle Routing Optimization Methods"},"cohort_total":1187,"direct_labels_cover":1,"predictions_cover":1187,"exported":1187,"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/c746e7dad116","api":"https://metacan.xera.ac/api/v1/cohort?topic=Vehicle+Routing+Optimization+Methods"},"results":[{"id":"W1006079010","doi":"","title":"Specific Multi-trip Operators for Vehicle Routing Problems","year":2014,"lang":"en","type":"article","venue":"ORBi (University of Liège)","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":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Transport engineering; Computer network; Engineering","score_opus":0.023581155891998794,"score_gpt":0.21911758689420915,"score_spread":0.19553643100221035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1006079010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18654528,0.00004126407,0.8114757,0.000103721606,0.00016645162,0.00021384757,0.000008339209,0.00025348234,0.0011919184],"genre_scores_gemma":[0.7368139,0.00001906593,0.26268157,0.000009138177,0.00004085409,3.7337364e-7,0.0000053747904,0.000024837453,0.00040489837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999315,0.000053946213,0.00012775049,0.00017831137,0.00010171772,0.00022323172],"domain_scores_gemma":[0.99946475,0.00010373759,0.00005502239,0.00021059114,0.000090028,0.0000758631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044389928,0.00011272099,0.00019655908,0.000092831426,0.00015254228,0.000018299186,0.00022267859,0.0000932382,0.00006297283],"category_scores_gemma":[0.000015755,0.00014930591,0.00007659318,0.00022699326,0.00004360983,0.00017558783,0.000045589422,0.000103479906,0.000025040508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034907393,0.00011492094,0.025739128,0.0004002881,0.000121614474,0.0000037525358,0.0047630155,0.86723626,0.063718446,0.004064846,0.002005817,0.03179698],"study_design_scores_gemma":[0.0012766427,0.000046826997,0.0047705276,0.000052183015,0.000020694397,0.0000012374778,0.00038789908,0.9822331,0.0031307284,0.000037550122,0.0078041186,0.00023848598],"about_ca_topic_score_codex":0.000051748742,"about_ca_topic_score_gemma":0.000011314387,"teacher_disagreement_score":0.5502686,"about_ca_system_score_codex":0.000057531262,"about_ca_system_score_gemma":0.000011324456,"threshold_uncertainty_score":0.60885185},"labels":[],"label_agreement":null},{"id":"W101593720","doi":"","title":"Le problème d'approvisionnement des stations d'essence","year":2000,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Heuristic; Welfare economics; Operations research; Computer science; Engineering; Economics; Artificial intelligence","score_opus":0.021054518884501036,"score_gpt":0.26712978482939653,"score_spread":0.24607526594489548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101593720","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08902017,0.014494941,0.85974115,0.002429183,0.0015284194,0.00065778027,0.000066374894,0.0009747749,0.031087214],"genre_scores_gemma":[0.15006629,0.0035957077,0.8174964,0.00008483465,0.00056032516,0.000027603553,0.000010636049,0.0002400232,0.027918167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531084,0.0011189762,0.0014407946,0.00041190625,0.0006954861,0.0010220198],"domain_scores_gemma":[0.9978737,0.00032440512,0.00037020777,0.0004672708,0.00043125323,0.00053312257],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016309782,0.00051726145,0.0005673353,0.00029780625,0.0015587397,0.0009011396,0.00056413806,0.00021277468,0.004867301],"category_scores_gemma":[0.0004204246,0.00056475436,0.00024916723,0.0010504677,0.00044149527,0.0013354693,0.000080058846,0.0008084606,0.0010188097],"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.0000074413733,0.00014770465,0.00026837742,0.0004397736,0.00014205828,0.00011049653,0.0026570582,0.41630378,0.00051100255,0.010602303,0.0029008412,0.56590915],"study_design_scores_gemma":[0.0014005005,0.00029869878,0.07124524,0.002429711,0.00021305123,0.0039787157,0.0006147222,0.8687515,0.00046340693,0.020955052,0.028667394,0.0009819972],"about_ca_topic_score_codex":0.00022729064,"about_ca_topic_score_gemma":0.00004744094,"teacher_disagreement_score":0.56492716,"about_ca_system_score_codex":0.0007358337,"about_ca_system_score_gemma":0.0005430013,"threshold_uncertainty_score":0.999759},"labels":[],"label_agreement":null},{"id":"W104314163","doi":"10.1023/a:1020759332183","title":"Minmax p-Traveling Salesmen Location Problems on a Tree","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Theory of computation; Order (exchange); Time complexity; Mathematics; Combinatorics; Mathematical optimization; Computer science; Tree (set theory); Algorithm","score_opus":0.31706850734061026,"score_gpt":0.4308538352548084,"score_spread":0.11378532791419815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104314163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6126227,0.0023276377,0.18642215,0.008453355,0.0003229359,0.0021974258,0.000042713422,0.00068653043,0.18692456],"genre_scores_gemma":[0.98167664,0.0004886012,0.015682481,0.000042149502,0.000069343616,0.00006960019,0.000009835118,0.00003281801,0.0019285367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848366,0.00020540763,0.00029757098,0.00016312294,0.00055431575,0.00029590065],"domain_scores_gemma":[0.99841857,0.00016790297,0.000010753546,0.00031406092,0.001014542,0.000074171745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016275024,0.00009112819,0.00012217741,0.00029357141,0.00017701784,0.00007422885,0.0001879121,0.00007625607,0.00026502163],"category_scores_gemma":[0.00061088294,0.000094081915,0.00003181607,0.0008994789,0.00006284735,0.00017068091,0.00002370264,0.00027095363,0.0001723501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021474461,0.000062335544,0.000042032967,0.000050568146,0.00001831699,6.5315385e-7,0.00087996334,0.9753057,0.005289101,0.0011767541,0.0058970507,0.011275407],"study_design_scores_gemma":[0.00013634711,0.000095267074,0.00040829112,0.00007637763,0.0000017711425,0.0000014075899,0.00009826066,0.9787734,0.018764632,0.00004154825,0.0015079384,0.00009476833],"about_ca_topic_score_codex":0.00003022619,"about_ca_topic_score_gemma":0.00004310748,"teacher_disagreement_score":0.36905396,"about_ca_system_score_codex":0.000038903432,"about_ca_system_score_gemma":0.000028463595,"threshold_uncertainty_score":0.38365492},"labels":[],"label_agreement":null},{"id":"W106072245","doi":"10.1007/978-3-319-13132-0_9","title":"Investigating Metaheuristics Applications for Capacitated Location Allocation Problem on Logistics Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Metaheuristic; Tabu search; Computer science; Simulated annealing; Operations research; Ant colony optimization algorithms; Facility location problem; Genetic algorithm; Service (business); Service provider; Revenue; Mathematical optimization; Business; Engineering; Artificial intelligence; Mathematics","score_opus":0.12223287670963154,"score_gpt":0.35506640463304245,"score_spread":0.23283352792341092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106072245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010826977,0.0011308447,0.984863,0.000084131636,0.00042314862,0.0012449529,0.00003828545,0.00026329877,0.011951272],"genre_scores_gemma":[0.0700299,0.0008847787,0.9205542,0.0002955101,0.0006557633,0.0009424406,0.0009569398,0.00022506852,0.005455382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796766,0.000050684437,0.00096874085,0.00045220822,0.00030000068,0.00026069593],"domain_scores_gemma":[0.99537796,0.0028339878,0.00031856427,0.00025976557,0.0011472788,0.00006243907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000729635,0.00041374666,0.00048255431,0.00027344207,0.00017664401,0.00004090491,0.00025439163,0.0002593591,0.000005823076],"category_scores_gemma":[0.0006644448,0.0004748699,0.00007242254,0.0002292125,0.0003256123,0.000041278126,0.000050822666,0.00046100962,0.000027528344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021339706,0.00000586745,0.0000034276338,0.00032036006,0.000096855154,2.3979356e-7,0.00016162416,0.6763775,4.469328e-7,0.31116307,0.00045355587,0.011414921],"study_design_scores_gemma":[0.0000615205,0.000043632794,0.0000036175018,0.000422881,0.00005476526,0.0000018454452,0.000046291556,0.78665537,0.000013048147,0.20960629,0.0027589372,0.00033179973],"about_ca_topic_score_codex":0.0000016493052,"about_ca_topic_score_gemma":0.000010395786,"teacher_disagreement_score":0.11027788,"about_ca_system_score_codex":0.00042558613,"about_ca_system_score_gemma":0.00006339584,"threshold_uncertainty_score":0.9997703},"labels":[],"label_agreement":null},{"id":"W1063455699","doi":"10.1007/s10601-015-9196-8","title":"A hybrid constraint programming approach to a wood procurement problem with bucking decisions","year":2015,"lang":"en","type":"article","venue":"Constraints","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"FPInnovations","keywords":"Procurement; Flexibility (engineering); Constraint (computer-aided design); Constraint programming; Integer programming; Mathematical optimization; Computer science; Set (abstract data type); Programming paradigm; Operations research; Mathematics; Stochastic programming; Business","score_opus":0.05045296916200682,"score_gpt":0.2725449922231356,"score_spread":0.2220920230611288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1063455699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024818081,0.00004753101,0.9393479,0.00008283277,0.00011065398,0.0013286393,0.000012729968,0.00081013195,0.033441454],"genre_scores_gemma":[0.4981526,8.448012e-7,0.5015552,0.00004117919,0.000033532157,0.0001480677,0.000008614995,0.00004042156,0.00001955326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812865,0.00006945366,0.000393779,0.00039833703,0.00044401528,0.00056575506],"domain_scores_gemma":[0.9987638,0.00007965096,0.00006072765,0.00033182753,0.00025016072,0.0005138144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008934242,0.0002877047,0.0002950614,0.00018355045,0.00008977031,0.0001557313,0.00025231246,0.000067829555,0.000018198636],"category_scores_gemma":[0.00031506352,0.00026075475,0.00004678478,0.0004312084,0.0001844324,0.00012833877,0.000067327004,0.00026299115,0.00003616283],"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.00003126297,0.00020950094,0.00091643207,0.00010263599,0.00017629661,0.00004566624,0.0034887216,0.42112875,0.000569575,0.0029296067,0.00095936283,0.56944215],"study_design_scores_gemma":[0.016461484,0.0017245628,0.0010094516,0.0038675454,0.0005318577,0.004890864,0.016701316,0.8715587,0.017508768,0.0031338488,0.055824813,0.006786759],"about_ca_topic_score_codex":0.0000027892909,"about_ca_topic_score_gemma":0.0000018701297,"teacher_disagreement_score":0.56265545,"about_ca_system_score_codex":0.00019310771,"about_ca_system_score_gemma":0.0002215112,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W115258892","doi":"10.1007/978-94-017-8899-1_8","title":"Transportation and Routing","year":2014,"lang":"en","type":"book-chapter","venue":"Managing forest ecosystems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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é Laval","funders":"","keywords":"Procurement; Operations research; Vehicle routing problem; Mode (computer interface); Transport engineering; Routing (electronic design automation); Selection (genetic algorithm); Computer science; Flow network; Transportation planning; Strategic planning; Business; Engineering; Marketing","score_opus":0.010805493972880869,"score_gpt":0.20601056618323377,"score_spread":0.1952050722103529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115258892","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010118408,0.0009888161,0.47347033,0.000049724906,0.0012554552,0.000495174,0.000037329315,0.0014627683,0.52122855],"genre_scores_gemma":[0.81857955,0.00042016688,0.014031389,0.00006313591,0.0010517144,0.000038542697,0.00041282448,0.00070326537,0.16469944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988009,0.000018418592,0.0004637246,0.00029911945,0.00017644434,0.00024139041],"domain_scores_gemma":[0.99937844,0.000078956815,0.00013655359,0.0002857402,0.000035899287,0.00008442374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042136153,0.00033226717,0.00041325396,0.00019787221,0.00008405801,0.00009140482,0.00012608505,0.00024899744,0.000036542504],"category_scores_gemma":[0.0000100137995,0.00038588402,0.00007647533,0.00003162421,0.00002062326,0.00006245666,0.000012094297,0.00027087526,0.000054694796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004403674,0.000002352443,0.0022866884,0.0027576068,0.00024533388,0.000030258505,0.00054214115,0.58961743,0.000020071775,0.3762605,0.0019107593,0.026322484],"study_design_scores_gemma":[0.00022550563,0.000015086548,0.00021265901,0.00086736085,0.000094364565,0.000011678993,0.000012686068,0.88086426,0.0000072768826,0.0033772427,0.113751635,0.0005602537],"about_ca_topic_score_codex":0.000023532282,"about_ca_topic_score_gemma":0.00028512272,"teacher_disagreement_score":0.8175677,"about_ca_system_score_codex":0.00007894893,"about_ca_system_score_gemma":0.0000064734704,"threshold_uncertainty_score":0.99985933},"labels":[],"label_agreement":null},{"id":"W1153261897","doi":"10.71781/10668","title":"Models and algorithms for the capacitated location-routing problem","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Routing (electronic design automation); Vehicle routing problem; Algorithm; Mathematical optimization; Mathematics; Computer network","score_opus":0.05035413735251719,"score_gpt":0.28820919084725705,"score_spread":0.23785505349473984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1153261897","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000690524,0.0007138883,0.9791794,0.000015499745,0.00042725977,0.0008659213,0.000010862183,0.00046247372,0.017634187],"genre_scores_gemma":[0.08198285,0.00039535668,0.9005807,0.000044255452,0.0001822142,0.00060806295,0.0006026842,0.00026783242,0.015336022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991212,0.000027378324,0.00031856055,0.00021189536,0.000105905085,0.00021506345],"domain_scores_gemma":[0.99913913,0.00027955958,0.000083833715,0.00019865253,0.0002563372,0.000042476244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512878,0.00022558685,0.00020447248,0.00007722158,0.00015834198,0.00006822308,0.00014413585,0.00022040593,0.000022526487],"category_scores_gemma":[0.00006677779,0.00017675717,0.00004351154,0.00018535578,0.000016845283,0.00012595719,0.0000075980006,0.00019689862,0.0000033057893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001310969,0.00001010864,0.000009987458,0.000721238,0.00020744411,2.2163053e-7,0.0066532646,0.9047956,0.00016203888,0.009618002,0.0006899696,0.07711903],"study_design_scores_gemma":[0.00016459975,0.000009598241,0.000051966243,0.00008237853,0.00007679058,0.000001498292,0.00096106454,0.99501574,0.00077381113,0.0024869335,0.00014502597,0.00023059714],"about_ca_topic_score_codex":0.00007790019,"about_ca_topic_score_gemma":0.000066704466,"teacher_disagreement_score":0.09022015,"about_ca_system_score_codex":0.00002840174,"about_ca_system_score_gemma":0.00003386959,"threshold_uncertainty_score":0.7207948},"labels":[],"label_agreement":null},{"id":"W117190991","doi":"10.1007/978-0-387-77778-8_16","title":"One-to-Many-to-One Single Vehicle Pickup and Delivery Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"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":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Pickup; Computer science; Artificial intelligence","score_opus":0.0818470942801059,"score_gpt":0.3078218029519631,"score_spread":0.2259747086718572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117190991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013433357,0.0006965609,0.900299,0.0015595243,0.0008860768,0.0020410023,0.00006419557,0.0006973674,0.08032291],"genre_scores_gemma":[0.088563904,0.0009159908,0.80173033,0.00022629967,0.00052192144,0.00012780903,0.000017202907,0.00023005175,0.1076665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965361,0.00009267993,0.0005323051,0.00090641197,0.001156243,0.000776296],"domain_scores_gemma":[0.99738973,0.00011848761,0.000027179407,0.0007939542,0.0011604122,0.00051022926],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011669724,0.00037724886,0.00043491393,0.0012339742,0.0011055064,0.0012738802,0.0010091465,0.0001956116,0.00021484443],"category_scores_gemma":[0.0001245587,0.00043468244,0.000053428044,0.00073662406,0.0009980447,0.0010323047,0.0012161607,0.0007637337,0.00031031363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013296719,0.000042308428,0.000004742061,0.00008458181,0.00005253607,0.000007036106,0.0040376,0.9422831,0.020584457,0.0028062759,0.00354951,0.026534583],"study_design_scores_gemma":[0.0003081138,0.0011934241,0.00012324724,0.0010428283,0.000016590811,0.000060829207,0.000064744134,0.9016399,0.026237361,0.00039661236,0.06776901,0.0011473441],"about_ca_topic_score_codex":0.000054624445,"about_ca_topic_score_gemma":0.00021229933,"teacher_disagreement_score":0.09856869,"about_ca_system_score_codex":0.00045387205,"about_ca_system_score_gemma":0.00029820445,"threshold_uncertainty_score":0.9998105},"labels":[],"label_agreement":null},{"id":"W120760926","doi":"10.1007/978-1-4419-1306-7_10","title":"Variable Intensity Local Search","year":2009,"lang":"en","type":"book-chapter","venue":"Annals of information systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Solver; Variable neighborhood search; Local search (optimization); Mathematical optimization; Heuristic; Variable (mathematics); Guided Local Search; Mathematics; Computer science; Integer (computer science); Metaheuristic","score_opus":0.04959168020910995,"score_gpt":0.2827534968050394,"score_spread":0.23316181659592947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120760926","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066919847,0.00020550599,0.4188501,0.0000212536,0.00033087961,0.00020499858,0.00004435458,0.00019850262,0.5801377],"genre_scores_gemma":[0.26058447,0.0037691414,0.15250944,0.003333469,0.0022234758,0.000074409014,0.0033457668,0.00066297106,0.5734969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983891,0.000021166235,0.0008990674,0.00008004891,0.0004094284,0.00020117444],"domain_scores_gemma":[0.99838537,0.000054877342,0.00023231603,0.00033137904,0.0009111528,0.00008491406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800795,0.00022097304,0.00046975352,0.00033407984,0.0000371082,0.00006874731,0.00018530837,0.00037625566,0.000059621674],"category_scores_gemma":[0.00003819525,0.00023473639,0.00008956295,0.00008094181,0.000037948732,0.00053850625,0.000031805368,0.00030710327,0.00024910504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009415917,0.0000020338903,0.0000018093316,0.00059041916,0.00008095054,6.087473e-7,0.00027779353,0.8886653,0.000004693127,0.07638206,0.011923698,0.022061218],"study_design_scores_gemma":[0.00017068915,0.000058133865,0.00001727039,0.0008164085,0.000018144958,0.00002678055,0.00012216547,0.56006277,0.00037813824,0.0006389294,0.43728608,0.00040446056],"about_ca_topic_score_codex":0.000023617342,"about_ca_topic_score_gemma":1.9805476e-7,"teacher_disagreement_score":0.42536238,"about_ca_system_score_codex":0.000049456023,"about_ca_system_score_gemma":0.000051618703,"threshold_uncertainty_score":0.95722723},"labels":[],"label_agreement":null},{"id":"W1421911707","doi":"10.1016/j.ejor.2015.07.048","title":"The traveling salesman problem with time-dependent service times","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Service (business); Computer science; Mathematical optimization; Quadratic equation; Duration (music); Computation; Measure (data warehouse); Mathematics; Algorithm; Data mining","score_opus":0.07773001912674993,"score_gpt":0.3329230441880737,"score_spread":0.2551930250613238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1421911707","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2123403,0.0024947128,0.3272483,0.017849615,0.00067852426,0.0011262421,0.000013390458,0.00030209406,0.43794683],"genre_scores_gemma":[0.8264925,0.00010873778,0.16628739,0.00012502518,0.00090823113,0.000004440597,0.000007395097,0.00014599529,0.00592027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969228,0.0012227421,0.00038256738,0.00009194282,0.001129745,0.00025020746],"domain_scores_gemma":[0.99739236,0.000344601,0.00005545294,0.00014761409,0.0018647127,0.00019523331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0116045615,0.00009451428,0.000107608874,0.00009658013,0.00026574897,0.00031428935,0.0004299384,0.00001629604,0.000050963954],"category_scores_gemma":[0.00034993177,0.00005962073,0.00002445893,0.0003410661,0.000056740766,0.00022970725,0.000055827946,0.00057295285,0.00023272532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006817397,0.000016824053,0.000096509175,0.0000101637925,0.00005581217,0.00006698537,0.0007915073,0.9881149,0.0019189746,0.00046637226,0.0046882876,0.0037055034],"study_design_scores_gemma":[0.0035839484,0.0011166917,0.0022011502,0.00037741452,0.00003364043,0.0012315528,0.0015514831,0.91302514,0.0048099947,0.00040995126,0.07114409,0.0005149333],"about_ca_topic_score_codex":0.0000011679914,"about_ca_topic_score_gemma":0.0000026394853,"teacher_disagreement_score":0.6141522,"about_ca_system_score_codex":0.0001049166,"about_ca_system_score_gemma":0.00027003547,"threshold_uncertainty_score":0.40219325},"labels":[],"label_agreement":null},{"id":"W1428828117","doi":"10.1016/j.ejor.2015.06.073","title":"The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Mathematical optimization; Pairwise comparison; Vehicle routing problem; Purchasing; Computer science; Branch and bound; Scheduling (production processes); Traveling purchaser problem; Shortest path problem; Branch and price; Branch and cut; Integer programming; Graph; Operations research; Routing (electronic design automation); Mathematics; Combinatorial optimization; 2-opt; Economics","score_opus":0.10674453579939322,"score_gpt":0.3311792832241026,"score_spread":0.2244347474247094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1428828117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70553726,0.0009521126,0.28906062,0.00064774894,0.000035558278,0.00028869757,0.0000047986646,0.000028556804,0.003444635],"genre_scores_gemma":[0.8393401,0.00007439858,0.16039313,0.000020984768,0.0000838201,0.0000024557473,0.0000021301207,0.000026766347,0.000056225257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997067,0.0015356295,0.0004004412,0.00014199098,0.00061820814,0.00023673086],"domain_scores_gemma":[0.9981752,0.00047309074,0.000054300028,0.00013035322,0.0008999282,0.00026714362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012803467,0.00010895785,0.00014182024,0.00009333423,0.00031347183,0.00021165585,0.00020220135,0.00002134224,0.000006456668],"category_scores_gemma":[0.0007514131,0.000070807226,0.00001911974,0.00025283045,0.0003685008,0.00026049916,0.000074993004,0.0006213302,0.0000031053867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041299697,0.0001965793,0.024978727,0.00015562851,0.00022340956,0.00010919056,0.008634395,0.9092954,0.0028653615,0.0013595616,0.0006865383,0.05108225],"study_design_scores_gemma":[0.0035966148,0.00045111444,0.038199697,0.00014648552,0.000015683014,0.0005014853,0.0022462916,0.95294845,0.00036767113,0.00014811385,0.0011391559,0.00023922633],"about_ca_topic_score_codex":0.0000031462887,"about_ca_topic_score_gemma":0.0000025998388,"teacher_disagreement_score":0.13380283,"about_ca_system_score_codex":0.00006124356,"about_ca_system_score_gemma":0.00017710259,"threshold_uncertainty_score":0.4437452},"labels":[],"label_agreement":null},{"id":"W1446708373","doi":"10.1016/j.ifacol.2015.06.122","title":"A Column Generation Based Heuristic for the Capacitated Vehicle Routing Problem with Three-dimensional Loading Constraints","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Vehicle routing problem; Column generation; Tabu search; FIFO and LIFO accounting; Heuristic; Mathematical optimization; Routing (electronic design automation); Computer science; Shortest path problem; Cuboid; Path (computing); Algorithm; Mathematics; FIFO (computing and electronics); Theoretical computer science","score_opus":0.0472159441833659,"score_gpt":0.2604255402504211,"score_spread":0.2132095960670552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1446708373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18738607,0.00013619344,0.80987,0.00067262753,0.00027015057,0.00087779295,0.000082059996,0.0004732166,0.00023186016],"genre_scores_gemma":[0.4489097,6.1265206e-7,0.55055314,0.00014614727,0.0001645983,0.000057439596,0.00007760913,0.000050973664,0.000039783416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998649,0.00007479735,0.000324228,0.0002718391,0.00030109705,0.0003790145],"domain_scores_gemma":[0.99879575,0.0004486345,0.000091035916,0.0002238548,0.00029759537,0.00014313745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008577483,0.0002327814,0.00022522654,0.0000615145,0.00024274013,0.0000924985,0.00014363497,0.00009858335,0.000035566027],"category_scores_gemma":[0.00031153366,0.0001816667,0.000054295215,0.0003098989,0.00012397041,0.00012293099,0.000016474,0.00021175924,0.000010322864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040205006,0.000026031497,0.0007111435,0.00003264565,0.000065573004,0.000004745714,0.00033516856,0.9836927,0.011034434,0.000092109265,0.000054683784,0.0039105504],"study_design_scores_gemma":[0.0017322428,0.00010240091,0.0001870951,0.0000673925,0.00006684864,0.000017765906,0.00016141587,0.9951951,0.0021223894,0.000022232625,0.00007165741,0.00025345976],"about_ca_topic_score_codex":0.00003833455,"about_ca_topic_score_gemma":0.00017311517,"teacher_disagreement_score":0.26152363,"about_ca_system_score_codex":0.00014918746,"about_ca_system_score_gemma":0.00014834026,"threshold_uncertainty_score":0.7408153},"labels":[],"label_agreement":null},{"id":"W1481088856","doi":"10.1016/s0927-0507(06)14006-2","title":"Chapter 6 Vehicle Routing","year":2006,"lang":"en","type":"book-chapter","venue":"Handbooks in operations research and management science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":257,"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":"Computer science; Computer network","score_opus":0.0595897319446535,"score_gpt":0.3357477211135783,"score_spread":0.2761579891689248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481088856","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005212852,0.00038986493,0.02525808,0.000082836814,0.00012216538,0.0006605998,0.000006282376,0.00012924083,0.97282964],"genre_scores_gemma":[0.13669465,0.0037129857,0.061156616,0.00007200819,0.00016926193,0.00014132209,0.000024310999,0.00012147064,0.79790735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979862,0.000021048605,0.00030876108,0.0004689205,0.00071240956,0.00050265656],"domain_scores_gemma":[0.99930495,0.000049932372,0.000013007911,0.00037517736,0.00014752132,0.00010939945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020786664,0.0001871111,0.00016711235,0.0010547097,0.00056314806,0.00043769248,0.00037314626,0.000088546134,0.00008968946],"category_scores_gemma":[0.00003458623,0.00019690466,0.000021561245,0.00022451005,0.0006192462,0.00027054746,0.00033658653,0.00043828474,0.000051886178],"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.0000033781575,0.000012430707,0.000042686643,0.000106200576,0.0000151725535,0.00003457181,0.00017461625,0.21466589,0.0006164707,0.7622906,0.00062858145,0.021409417],"study_design_scores_gemma":[0.00052058185,0.00006949342,0.00029061266,0.0006744452,0.000010727588,0.0000052832156,0.000070545546,0.9573606,0.00080782187,0.0055069895,0.03411439,0.0005684584],"about_ca_topic_score_codex":0.000034345783,"about_ca_topic_score_gemma":0.00013345917,"teacher_disagreement_score":0.7567836,"about_ca_system_score_codex":0.00018725517,"about_ca_system_score_gemma":0.000032124684,"threshold_uncertainty_score":0.8029539},"labels":[],"label_agreement":null},{"id":"W1488405589","doi":"10.1007/3-540-45105-6_80","title":"A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Vehicle routing problem; Computer science; Benchmark (surveying); Genetic algorithm; Mathematical optimization; Diversification (marketing strategy); Key (lock); Routing (electronic design automation); Mathematics; Machine learning; Computer network","score_opus":0.01650154669074892,"score_gpt":0.23885929483689414,"score_spread":0.22235774814614523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488405589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038435355,0.00055709935,0.9967839,0.00012434326,0.00095660676,0.0006892388,0.00001324905,0.00022172366,0.00061541394],"genre_scores_gemma":[0.0059518707,0.000034449535,0.9930877,0.0004092579,0.00026687936,0.000028035913,0.00000400632,0.00008747976,0.00013030795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811804,0.000030089106,0.00040270836,0.0005601828,0.00035972413,0.00052928197],"domain_scores_gemma":[0.99838823,0.0007507167,0.000105498766,0.0005125693,0.00016792526,0.00007508843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092482276,0.00035643767,0.00030386032,0.00021844372,0.0002570154,0.00021184796,0.0007277642,0.0001518173,0.000012247306],"category_scores_gemma":[0.000092471375,0.0002951481,0.00009029913,0.0002677919,0.00027415148,0.00009388556,0.000102454214,0.0005333789,0.000006303431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.617697e-7,0.000001651663,0.0000028778995,0.00001598889,0.000008532817,0.0000032481016,0.00012817208,0.5796538,0.000045131976,0.00006957375,0.000014173556,0.4200565],"study_design_scores_gemma":[0.00019006526,0.000032864056,0.00001328393,0.00012760443,0.000017149314,0.00003810426,1.8482356e-7,0.9873408,0.0014621335,0.009488253,0.0009400947,0.0003494456],"about_ca_topic_score_codex":0.0000057008897,"about_ca_topic_score_gemma":0.0000037909156,"teacher_disagreement_score":0.41970706,"about_ca_system_score_codex":0.00021607398,"about_ca_system_score_gemma":0.00009467599,"threshold_uncertainty_score":0.99995005},"labels":[],"label_agreement":null},{"id":"W1493213455","doi":"10.1111/j.1538-4632.2009.00746.x","title":"The Maximal Covering Problem with Some Negative Weights","year":2009,"lang":"en","type":"article","venue":"Geographical Analysis","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simulated annealing; Integer programming; Heuristic; Mathematical optimization; Computer science; Integer (computer science); Algorithm; Set (abstract data type); Mathematics","score_opus":0.004907159280361349,"score_gpt":0.2124023879436228,"score_spread":0.20749522866326145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493213455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4750168,0.00064762495,0.5153171,0.00199559,0.00006850348,0.0003246367,0.000010354247,0.0010928259,0.005526572],"genre_scores_gemma":[0.92922205,0.00023517126,0.07029397,0.00009597802,0.000057292906,0.000012766853,0.000007112984,0.000016093121,0.000059577786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998845,0.00007281542,0.00023832488,0.00022363183,0.00027688016,0.00034334426],"domain_scores_gemma":[0.99931866,0.00016421189,0.00004562803,0.0002963216,0.00006967467,0.00010552929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031139088,0.00017025167,0.00024684667,0.0002759982,0.00027037674,0.00012375505,0.00020494968,0.00007191567,0.00002710739],"category_scores_gemma":[0.000024741235,0.00010697541,0.00021274187,0.002916559,0.00008652099,0.00014378437,0.000017983446,0.00023626587,0.0000065895333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030327043,0.000028847737,0.013096534,0.000008933846,0.0014601039,0.000010172653,0.00012948216,0.9613598,0.000089597765,0.008460761,0.000036849822,0.015288563],"study_design_scores_gemma":[0.00046993836,0.00012287234,0.13413288,0.000018825038,0.0013343778,0.0000066442803,0.000052376156,0.8463476,0.0006111619,0.015475551,0.0009445956,0.00048322044],"about_ca_topic_score_codex":0.000018425004,"about_ca_topic_score_gemma":0.000033424905,"teacher_disagreement_score":0.45420524,"about_ca_system_score_codex":0.00002090342,"about_ca_system_score_gemma":0.000006843924,"threshold_uncertainty_score":0.43623307},"labels":[],"label_agreement":null},{"id":"W1498455135","doi":"10.1109/icec.1994.350017","title":"Improving a vehicle routing heuristic through genetic search","year":2002,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Computer science; Heuristic; Genetic algorithm; Routing (electronic design automation); Mathematical optimization; Computer network; Artificial intelligence; Machine learning; Mathematics","score_opus":0.0310083192560953,"score_gpt":0.2584753643480404,"score_spread":0.22746704509194512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498455135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12381769,0.00033990783,0.8503433,0.00008455159,0.0001869266,0.00014252168,0.0000015008113,0.0011284358,0.02395517],"genre_scores_gemma":[0.7126274,0.000021990936,0.28636765,0.00006477879,0.00009451346,0.0000060174207,7.448419e-7,0.000050826256,0.0007660895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988393,0.00006852441,0.00026754302,0.0002110626,0.00019253581,0.00042098982],"domain_scores_gemma":[0.9994547,0.00012601043,0.00001992122,0.00027949724,0.00004404839,0.000075869895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020967305,0.00014912096,0.00014672942,0.0000514033,0.000112401176,0.00007897126,0.00016465604,0.000075640746,0.00077115785],"category_scores_gemma":[0.00011334485,0.00015665819,0.000046215602,0.00033163378,0.000026064388,0.00014193116,0.000054402983,0.00021072147,0.0002843696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012716794,0.000025613064,0.002647073,0.00009337929,0.000027416409,0.000017964223,0.0012764176,0.9046548,0.010460667,0.0004936009,0.0008181595,0.07948361],"study_design_scores_gemma":[0.00022018755,0.000014872725,0.00081971294,0.000011396829,0.000008919219,0.000012403591,0.00007358022,0.99446493,0.0038884096,0.000035728415,0.00025730813,0.0001925218],"about_ca_topic_score_codex":0.000051692314,"about_ca_topic_score_gemma":0.0000022630275,"teacher_disagreement_score":0.58880967,"about_ca_system_score_codex":0.00007141424,"about_ca_system_score_gemma":0.0000053609074,"threshold_uncertainty_score":0.84436375},"labels":[],"label_agreement":null},{"id":"W1503619557","doi":"10.1007/978-3-540-28646-2_1","title":"A Comparison Between ACO Algorithms for the Set Covering Problem","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":113,"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":"Benchmark (surveying); Computer science; Ant colony optimization algorithms; Set (abstract data type); Heuristic; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.04490335325099004,"score_gpt":0.3128812745333813,"score_spread":0.2679779212823913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503619557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031704254,0.00035790057,0.997023,0.00017973634,0.00080385286,0.00069503114,0.000026327858,0.00026262386,0.0006198317],"genre_scores_gemma":[0.063108966,0.000023162016,0.93586665,0.00013376056,0.0006889876,0.000023701945,0.00001463405,0.00008139243,0.00005875842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811757,0.000014550794,0.00044323673,0.0005330744,0.00042384412,0.00046775152],"domain_scores_gemma":[0.9981773,0.001009225,0.000121204925,0.00050780404,0.00010696871,0.000077501354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093727454,0.0003677181,0.00045020442,0.00023789525,0.00022188181,0.00023793105,0.0009987969,0.00025633996,0.000010644532],"category_scores_gemma":[0.00006290367,0.00030210786,0.00009756332,0.00029067593,0.00025311238,0.00013466319,0.00022611152,0.0006641922,0.0000068246327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.986336e-7,0.0000016302334,0.00008794546,0.000055340384,0.000014422631,0.0000010395972,0.00039053516,0.76559013,0.000014889024,0.00026641667,0.000009261292,0.2335675],"study_design_scores_gemma":[0.00022768645,0.000048294467,0.00011152732,0.0002824908,0.000024341864,0.000005254345,2.679785e-7,0.9812844,0.00087954244,0.015211033,0.0015502869,0.0003748741],"about_ca_topic_score_codex":0.000008605766,"about_ca_topic_score_gemma":0.000007788197,"teacher_disagreement_score":0.23319264,"about_ca_system_score_codex":0.00037076147,"about_ca_system_score_gemma":0.00014811418,"threshold_uncertainty_score":0.9999431},"labels":[],"label_agreement":null},{"id":"W1504989502","doi":"10.1007/0-306-48058-1_13","title":"Long-Haul Freight Transportation","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":202,"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":"Business; Product (mathematics); Consumption (sociology); Production (economics); Transport engineering; Commerce; Industrial organization; Economics; Engineering; Microeconomics","score_opus":0.016011050632956377,"score_gpt":0.22887835145311022,"score_spread":0.21286730082015384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504989502","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100896985,0.00088572706,0.044651005,0.00007780161,0.0014035415,0.0004954081,0.00010675653,0.001748327,0.9505305],"genre_scores_gemma":[0.0041845236,0.000051049614,0.0084727155,0.00031321944,0.0012263653,0.00005704182,0.0010238521,0.0006556204,0.9840156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696654,0.000034638626,0.0010550391,0.0006444007,0.00067802914,0.0006213778],"domain_scores_gemma":[0.99863315,0.00011410492,0.000268008,0.0005740726,0.00016369832,0.00024697083],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0005340235,0.0007654412,0.00066663156,0.000539339,0.00009925258,0.00024053502,0.00070189906,0.0022500951,0.00061743456],"category_scores_gemma":[0.00003171995,0.0008800161,0.00029246608,0.00006419611,0.00013620958,0.00064723514,0.000026999905,0.0028271028,0.00011059504],"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.000021658456,0.000008390636,0.00030633254,0.0005059706,0.0004724958,0.00010013638,0.0005877153,0.076522745,0.00023273584,0.02221911,0.85922045,0.03980225],"study_design_scores_gemma":[0.0007557981,0.000022043712,0.00030905625,0.00036925412,0.00030175672,0.000020329551,0.000010397846,0.0075883297,0.00041366054,0.010430024,0.9781215,0.0016578159],"about_ca_topic_score_codex":0.000014872622,"about_ca_topic_score_gemma":0.000014930488,"teacher_disagreement_score":0.118901074,"about_ca_system_score_codex":0.00033416232,"about_ca_system_score_gemma":0.000105133244,"threshold_uncertainty_score":0.9994734},"labels":[],"label_agreement":null},{"id":"W1506688052","doi":"10.3233/fi-2014-990","title":"Heuristics to Solve a Real-world Asymmetric Vehicle Routing Problem with Side Constraints","year":2014,"lang":"en","type":"article","venue":"Fundamenta Informaticae","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Heuristics; Vehicle routing problem; Computer science; Routing (electronic design automation); Mathematical optimization; Mathematics; Computer network","score_opus":0.013558364460848333,"score_gpt":0.25216539241031305,"score_spread":0.23860702794946473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506688052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031304263,0.0000040758027,0.71822184,0.00010147818,0.00016409799,0.0006896558,0.00001800697,0.00078231684,0.24871424],"genre_scores_gemma":[0.5717153,0.0000036951897,0.42759508,0.00038746116,0.000060593327,0.00005644337,0.000016560256,0.000046845627,0.00011806044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981526,0.00004068454,0.00068288087,0.00016978213,0.00038042484,0.0005736293],"domain_scores_gemma":[0.9987693,0.00033314226,0.00012536638,0.0003912489,0.00009876815,0.00028218675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007819809,0.00027347155,0.00032762467,0.00039402005,0.00015144603,0.0002175888,0.00025774393,0.00006712192,0.0000832939],"category_scores_gemma":[0.00023172685,0.0002569943,0.000045829085,0.0011543923,0.00007717412,0.00033444545,0.00009391862,0.00026365687,0.00032854333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046073135,0.00010376828,0.020601446,0.0007484017,0.00025345906,0.000010619253,0.005479844,0.71370655,0.00045609797,0.0330214,0.003593711,0.22197863],"study_design_scores_gemma":[0.0013737038,0.00025346357,0.008500695,0.00027842753,0.00007884534,0.000026795506,0.00066235545,0.97545725,0.0019079396,0.00017468802,0.010498654,0.00078720634],"about_ca_topic_score_codex":0.000027701755,"about_ca_topic_score_gemma":0.000027434498,"teacher_disagreement_score":0.540411,"about_ca_system_score_codex":0.00022203544,"about_ca_system_score_gemma":0.000038149155,"threshold_uncertainty_score":0.99998826},"labels":[],"label_agreement":null},{"id":"W1513860408","doi":"10.1016/j.scient.2013.04.010","title":"The incomplete hub-covering location problem considering imprecise location of demands","year":2013,"lang":"en","type":"article","venue":"ORCA Online Research @Cardiff (Cardiff University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"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 Toronto","funders":"","keywords":"Facility location problem; Computer science; Variable neighborhood search; Location model; Fuzzy logic; 1-center problem; Variable (mathematics); Operations research; Order (exchange); Mathematical optimization; Covering problems; Metaheuristic; Mathematics; Set (abstract data type); Artificial intelligence; Business","score_opus":0.039065567892745706,"score_gpt":0.2893826163711615,"score_spread":0.25031704847841585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513860408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57338846,0.0014403216,0.39741457,0.000999033,0.000508719,0.002673568,0.000057071677,0.00096098054,0.022557268],"genre_scores_gemma":[0.9689517,0.0008071054,0.02911679,0.000007696741,0.00015757453,0.000012854512,0.000040082417,0.00007434257,0.0008318301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971454,0.0005711389,0.00042472652,0.00036524516,0.0007515085,0.0007419413],"domain_scores_gemma":[0.9964376,0.0008182314,0.0001045101,0.00072052935,0.001650599,0.00026851258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015518401,0.00024353646,0.00037684402,0.0006143728,0.00051502266,0.00013282409,0.00059126294,0.00016896255,0.000024718714],"category_scores_gemma":[0.0007822098,0.00023689892,0.0001327671,0.0026472106,0.0003016789,0.0005445627,0.0003740188,0.0006083207,0.000042631415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050453873,0.00008234166,0.0035573097,0.00062666606,0.00041256117,0.00001543189,0.0004892703,0.9306615,0.01812518,0.0034266207,0.0015098127,0.04104288],"study_design_scores_gemma":[0.0020926034,0.00017693145,0.017478932,0.0005809338,0.00011195808,0.000026970269,0.0035499034,0.93013173,0.008348154,0.0013154831,0.03534975,0.0008366749],"about_ca_topic_score_codex":0.00025953437,"about_ca_topic_score_gemma":0.000052104704,"teacher_disagreement_score":0.39556324,"about_ca_system_score_codex":0.0005392503,"about_ca_system_score_gemma":0.0002627619,"threshold_uncertainty_score":0.96604574},"labels":[],"label_agreement":null},{"id":"W1515177345","doi":"10.1023/a:1009621410177","title":"Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics","year":2000,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":178,"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":"European Commission","keywords":"Guided Local Search; Mathematical optimization; Tabu search; Local search (optimization); Constraint programming; Maxima and minima; Computer science; Hill climbing; Heuristics; Iterated local search; Benchmark (surveying); Local optimum; Beam search; Search algorithm; Algorithm; Mathematics","score_opus":0.023579582177976975,"score_gpt":0.26421585828604544,"score_spread":0.24063627610806845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515177345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4922488,0.0012170237,0.5050896,0.00003928661,0.00036578608,0.00014864831,0.000005683218,0.00012761369,0.000757554],"genre_scores_gemma":[0.61664975,0.00018097016,0.382922,0.0000156792,0.00017373751,4.272322e-7,5.1844637e-7,0.000038375256,0.00001853225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842715,0.00008993466,0.0007865925,0.00011099726,0.00026492358,0.00032042485],"domain_scores_gemma":[0.9990805,0.00021913469,0.00021880674,0.00012320167,0.00019987614,0.00015849902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015245,0.00018120756,0.00034797014,0.00011434889,0.00013172875,0.00014044209,0.00013030789,0.00009124875,0.000052025676],"category_scores_gemma":[0.0003216853,0.0001786945,0.000071695344,0.00020909695,0.00008563602,0.0001640764,0.000022857275,0.00042856412,0.000002170511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009850206,0.000037785252,0.0034607975,0.00016688509,0.0001178888,0.00008510362,0.0007677027,0.8669691,0.0034272051,0.00018429845,0.0000664462,0.12470692],"study_design_scores_gemma":[0.0004902911,0.00006868417,0.00043118923,0.00022814609,0.00015115541,0.0006687663,0.0001613983,0.9945974,0.00055471796,0.00022461251,0.0021826196,0.00024102579],"about_ca_topic_score_codex":0.0000031987565,"about_ca_topic_score_gemma":4.8046905e-7,"teacher_disagreement_score":0.12762827,"about_ca_system_score_codex":0.000081397426,"about_ca_system_score_gemma":0.000049007478,"threshold_uncertainty_score":0.72869503},"labels":[],"label_agreement":null},{"id":"W1527580169","doi":"","title":"Optimization of forest vehicle routing using the metaheuristics: Reactive tabu search and extended great deluge","year":2013,"lang":"en","type":"article","venue":"International Conference on Industrial Engineering and Systems Management","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue; École de Technologie Supérieure","funders":"","keywords":"Tabu search; Metaheuristic; Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Guided Local Search; Algorithm; Mathematics; Computer network","score_opus":0.07620791561631605,"score_gpt":0.28324155534683326,"score_spread":0.2070336397305172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527580169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39955503,0.00007310672,0.5954602,0.00012205484,0.001022233,0.00079820026,0.000015972053,0.00014964858,0.002803583],"genre_scores_gemma":[0.9939189,0.00005579199,0.005739715,0.0000044099493,0.00012478513,0.000036842957,0.0000073914025,0.000023986833,0.000088186076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990073,0.000060746243,0.00033190806,0.00017383059,0.00026480661,0.0001614027],"domain_scores_gemma":[0.9994823,0.0001076941,0.00006500704,0.00014054813,0.00015134558,0.000053153206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044319557,0.00015114943,0.00017880643,0.00016212776,0.00005795767,0.00018112756,0.00014327002,0.00007723354,0.00001854795],"category_scores_gemma":[0.00007796068,0.00012880203,0.00002277337,0.00012663465,0.000030497373,0.00014675199,0.00007055295,0.00018876501,0.000001218455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062501626,0.0000067460114,0.0002814643,0.00003993914,0.00013120756,0.0000014333259,0.00011000965,0.97968096,0.00044682669,0.01722905,0.000013260276,0.0020528305],"study_design_scores_gemma":[0.00039290648,0.000023894547,0.000527817,0.00019759893,0.000028813163,0.000005229048,0.0005051482,0.9979795,0.00015756261,0.000019314306,0.000043050906,0.00011912912],"about_ca_topic_score_codex":0.00020063239,"about_ca_topic_score_gemma":7.6078385e-7,"teacher_disagreement_score":0.59436387,"about_ca_system_score_codex":0.00007859437,"about_ca_system_score_gemma":0.000008857216,"threshold_uncertainty_score":0.5252394},"labels":[],"label_agreement":null},{"id":"W1528193418","doi":"10.1002/9780470400531.eorms0863","title":"Symmetry Handling in Mixed‐Integer Programming","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management 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":"University of Waterloo","funders":"","keywords":"Integer programming; Integer (computer science); Symmetry (geometry); Branch and cut; Linear programming; Set (abstract data type); Branch and bound; Mathematics; Mathematical optimization; Integer points in convex polyhedra; Branch and price; Computer science; Combinatorics; Discrete mathematics; Geometry","score_opus":0.03418941115303403,"score_gpt":0.32785334334267485,"score_spread":0.2936639321896408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528193418","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004225278,0.0014139548,0.04933845,0.000021848378,0.0003406232,0.0010273987,0.000007844253,0.00017028462,0.94725704],"genre_scores_gemma":[0.00872815,0.057943713,0.6011433,0.000012633687,0.00018021319,0.00047020483,0.00002628372,0.00035747423,0.331138],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981584,0.00007086632,0.00028698897,0.00040208772,0.00057970244,0.00050196354],"domain_scores_gemma":[0.9993469,0.000041826683,0.000021892383,0.00037115638,0.00009579365,0.00012239974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019983381,0.00016372668,0.00020598617,0.0020749164,0.00014328957,0.00012131908,0.0004831634,0.000091671674,0.00019938636],"category_scores_gemma":[0.00016947418,0.00016141795,0.000019196641,0.0018850768,0.0005459134,0.00021828934,0.00027277615,0.00030247204,0.000024550862],"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.00002388,0.00074287463,0.005936706,0.00537057,0.0002611772,0.00011781056,0.0035982304,0.083075225,0.00051833363,0.09398702,0.15151793,0.65485024],"study_design_scores_gemma":[0.001125254,0.00023837668,0.002184468,0.003923491,0.000042352745,0.0000071366458,0.0015383088,0.26426113,0.0004500847,0.00041123317,0.72456765,0.0012505032],"about_ca_topic_score_codex":0.00025870185,"about_ca_topic_score_gemma":0.00043273674,"teacher_disagreement_score":0.65359974,"about_ca_system_score_codex":0.00006990625,"about_ca_system_score_gemma":0.000060437545,"threshold_uncertainty_score":0.6582433},"labels":[],"label_agreement":null},{"id":"W1533840006","doi":"10.1007/978-3-540-24664-0_26","title":"Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"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; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Integer programming; Constraint programming; Constraint (computer-aided design); Routing (electronic design automation); Mathematical optimization; Linear programming; Parallel computing; Theoretical computer science; Algorithm; Embedded system; Mathematics; Stochastic programming","score_opus":0.020408232098208974,"score_gpt":0.2582533827822211,"score_spread":0.23784515068401213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533840006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011779541,0.00042630878,0.9855458,0.000046749705,0.00028845793,0.0006862229,0.000007435427,0.0008203861,0.0003990566],"genre_scores_gemma":[0.48474613,0.00001373605,0.5151021,0.000025317639,0.00004150434,0.000008296484,0.0000073270885,0.00005223406,0.000003344155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971356,0.00005545849,0.00083201035,0.0008533559,0.00049949245,0.0006241013],"domain_scores_gemma":[0.9983443,0.0004300914,0.00030808809,0.00055672927,0.00019107736,0.00016970553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016203619,0.00055620883,0.0007556643,0.0005166205,0.00020143822,0.0003870388,0.0006436153,0.00026304566,0.0000022171025],"category_scores_gemma":[0.00033134385,0.000563775,0.00007282439,0.0003466213,0.0010896572,0.00024569567,0.00065303274,0.0008490088,3.0016332e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038322546,0.000016790616,0.00027823343,0.00046174775,0.000040503055,0.00002183333,0.003391949,0.55143154,0.00039323728,0.0017288728,0.0000012512068,0.4422302],"study_design_scores_gemma":[0.0006965818,0.00006561139,0.0000767719,0.0016131517,0.000030349032,0.00018880561,0.000011451056,0.99303514,0.0013505508,0.0023431564,0.000028654576,0.0005597874],"about_ca_topic_score_codex":0.00003461445,"about_ca_topic_score_gemma":0.0000062619742,"teacher_disagreement_score":0.4729666,"about_ca_system_score_codex":0.00021236208,"about_ca_system_score_gemma":0.00016144497,"threshold_uncertainty_score":0.99968135},"labels":[],"label_agreement":null},{"id":"W1539384798","doi":"10.1007/978-1-4615-1507-4_26","title":"Analysing the Run-Time Behaviour of Iterated Local Search for the Travelling Salesman Problem","year":2002,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"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 British Columbia","funders":"","keywords":"Travelling salesman problem; Iterated function; Iterated local search; Computer science; Mathematical optimization; Local search (optimization); Mathematics; Algorithm","score_opus":0.06213274038974058,"score_gpt":0.3305188659932833,"score_spread":0.2683861256035427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539384798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006215576,0.00035672216,0.98521143,0.00072859635,0.00024337869,0.0013126339,0.000059882816,0.00013329615,0.011332486],"genre_scores_gemma":[0.28824466,0.0007566289,0.46653038,0.000054833476,0.0007682516,0.00022705838,0.00007407559,0.00034556809,0.24299854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681866,0.00018698836,0.00068557455,0.0005552303,0.0011050857,0.00064843986],"domain_scores_gemma":[0.99663186,0.00054907816,0.000054215227,0.00086864375,0.0017776877,0.000118512784],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0040845876,0.00034100164,0.00039439613,0.00064859074,0.0017723286,0.0011987172,0.0016837984,0.00017525128,0.00039899012],"category_scores_gemma":[0.00004678392,0.00023234506,0.00015102219,0.0008204658,0.002515129,0.00056786754,0.0004156676,0.0009964393,0.000039760638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007638613,0.000011739406,0.000001676357,0.00004784526,0.0000805549,0.0000014372895,0.0022599346,0.9811593,0.0014040213,0.005015536,0.0005757258,0.009434546],"study_design_scores_gemma":[0.00011106428,0.00015243681,0.000007206394,0.00023190804,0.000035327554,0.000019530798,0.00014741549,0.9842674,0.012423075,0.00012354263,0.0022435593,0.00023751233],"about_ca_topic_score_codex":0.000036723264,"about_ca_topic_score_gemma":0.00005209104,"teacher_disagreement_score":0.51868105,"about_ca_system_score_codex":0.0002583013,"about_ca_system_score_gemma":0.00029290465,"threshold_uncertainty_score":0.9998381},"labels":[],"label_agreement":null},{"id":"W1547752062","doi":"10.1023/a:1009609820093","title":"An Evolution Program for Non-Linear Transportation Problems","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"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 Manitoba","funders":"","keywords":"Initialization; Heuristic; Mathematical optimization; Computer science; Mating; Fitness function; Function (biology); Convergence (economics); Flow network; Integer (computer science); Genetic algorithm; Mathematics; Biology; Genetics","score_opus":0.019223679010467735,"score_gpt":0.30678315734194855,"score_spread":0.2875594783314808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547752062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10566591,0.0000577269,0.8935599,0.000028053752,0.00033730318,0.00020118055,0.0000071557847,0.0000801396,0.00006268019],"genre_scores_gemma":[0.54346305,0.000051055355,0.4561628,0.000005848461,0.00026334266,0.0000054283673,0.000010442456,0.00002432485,0.000013661283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.00002007666,0.00042762907,0.000055957,0.00014669301,0.00014091251],"domain_scores_gemma":[0.9993405,0.000046039397,0.00014066794,0.00008242798,0.00031134996,0.000079068006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041179676,0.00008311823,0.00014627996,0.00008948958,0.000040836672,0.000021738746,0.000091117465,0.000066594315,0.0000057693346],"category_scores_gemma":[0.00007156933,0.000080791404,0.0000610485,0.00015401533,0.000012179109,0.00016142646,8.0761606e-7,0.00013455494,0.000001060058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022897855,0.00008544747,0.0027234587,0.00007829239,0.000021096967,0.0000061063283,0.00017043004,0.98199093,0.0014987903,0.00007475206,0.00029389205,0.01303389],"study_design_scores_gemma":[0.00055800023,0.00038293266,0.0058664493,0.00004303734,0.000054447115,0.00003233009,0.00003681734,0.9874023,0.00032188246,0.00038722908,0.0048128837,0.00010168637],"about_ca_topic_score_codex":0.0000010505188,"about_ca_topic_score_gemma":0.0000028018999,"teacher_disagreement_score":0.43779716,"about_ca_system_score_codex":0.000061415936,"about_ca_system_score_gemma":0.000028671493,"threshold_uncertainty_score":0.3294578},"labels":[],"label_agreement":null},{"id":"W1549969148","doi":"10.1007/978-3-540-45198-3_10","title":"Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"Minimum spanning tree; Spanning tree; Combinatorics; Gomory–Hu tree; Degree (music); k-minimum spanning tree; Bounded function; Steiner tree problem; Kruskal's algorithm; Node (physics); Mathematics; Approximation algorithm; Discrete mathematics; Graph; Distributed minimum spanning tree; Undirected graph; Minimum degree spanning tree; Shortest-path tree; Enhanced Data Rates for GSM Evolution; Tree (set theory); Computer science; K-ary tree; Tree structure; Binary tree; Artificial intelligence","score_opus":0.03657327550404496,"score_gpt":0.2512355080131645,"score_spread":0.21466223250911956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549969148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010810965,0.00036922548,0.98060906,0.00020694495,0.0009012582,0.0004418283,0.0000020743234,0.00028044518,0.017081056],"genre_scores_gemma":[0.0112315295,0.00001415485,0.98747706,0.00059511664,0.00028542214,0.000016142436,0.0000032594817,0.00010380478,0.0002735237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974591,0.000066917906,0.00057863625,0.0006978452,0.00058143004,0.00061605196],"domain_scores_gemma":[0.99810565,0.0007495199,0.00018042976,0.00076170807,0.00011126514,0.00009142702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016083834,0.0004886973,0.00043940297,0.00037267758,0.00026881997,0.00040130076,0.0010444607,0.00028956812,0.00002523726],"category_scores_gemma":[0.00019474591,0.00038481265,0.00010987091,0.00049789815,0.00043984494,0.00019626647,0.00023585085,0.00097556075,0.000013536447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010260751,0.0000037248499,0.00004327659,0.000060966824,0.00001359065,0.0000074938653,0.0007531206,0.63857824,0.00015602622,0.0005220427,0.00002181477,0.35983866],"study_design_scores_gemma":[0.00016127118,0.00002859389,0.00002702283,0.00034329662,0.000015812977,0.00003877653,5.54251e-7,0.9781695,0.001065458,0.018802673,0.0008418608,0.0005051624],"about_ca_topic_score_codex":0.000003518359,"about_ca_topic_score_gemma":0.000017874641,"teacher_disagreement_score":0.35933352,"about_ca_system_score_codex":0.0002584404,"about_ca_system_score_gemma":0.000097148666,"threshold_uncertainty_score":0.9998604},"labels":[],"label_agreement":null},{"id":"W1554092380","doi":"10.1023/a:1021953714975","title":"Near-optimal design of Global Positioning System (GPS) networks using the Tabu Search technique","year":2003,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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 New Brunswick","funders":"European Commission","keywords":"Tabu search; Global Positioning System; Flexibility (engineering); Schedule; Mathematical optimization; Heuristic; Computer science; Mathematics","score_opus":0.01881942778388785,"score_gpt":0.28006170985629253,"score_spread":0.2612422820724047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554092380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063879597,0.0004827528,0.9915925,0.000019481562,0.00035829638,0.00034400882,0.000007449332,0.000086840024,0.00072068826],"genre_scores_gemma":[0.46141183,0.000026913182,0.53847176,0.000009316543,0.000058254358,0.0000019811366,0.0000011540267,0.000017789902,0.0000010086463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759895,0.00066492485,0.000842866,0.00012850172,0.00045200126,0.00031278963],"domain_scores_gemma":[0.99853677,0.000107123706,0.00041520558,0.00020715852,0.0006260983,0.000107621636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208411,0.00020422398,0.0003489905,0.000043859363,0.00020766184,0.00013964156,0.0002647077,0.00019504674,0.00001737238],"category_scores_gemma":[0.00016124715,0.00017486764,0.00012673365,0.0011833722,0.00007437867,0.00034271248,0.00002850261,0.00027302824,6.218609e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039245853,0.000020121162,0.0014054053,0.000035742734,0.000076712706,0.000009452424,0.000033179113,0.9963685,0.00023430667,0.0015268321,0.000055590135,0.00019487963],"study_design_scores_gemma":[0.0004000523,0.000083616746,0.0001350159,0.0002274306,0.0000957429,0.0008121104,0.00016497534,0.99736524,0.00054241985,0.000019017933,0.00000765822,0.00014673772],"about_ca_topic_score_codex":0.000007908292,"about_ca_topic_score_gemma":2.3804873e-7,"teacher_disagreement_score":0.45502388,"about_ca_system_score_codex":0.0010008862,"about_ca_system_score_gemma":0.0002124435,"threshold_uncertainty_score":0.7130896},"labels":[],"label_agreement":null},{"id":"W1559962598","doi":"10.1002/9780470400531.eorms1034","title":"The Vehicle Routing Problem with Time Windows: State‐of‐the‐Art Exact Solution Methods","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Solver; Benchmark (surveying); Integer programming; Mathematical optimization; Set (abstract data type); Computer science; Integer (computer science); Variable (mathematics); State (computer science); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.0235637405185882,"score_gpt":0.318285204207394,"score_spread":0.2947214636888058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559962598","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001726741,0.00056156726,0.16453393,0.00012000765,0.00016487218,0.0017846285,0.000014791032,0.00012689238,0.8325206],"genre_scores_gemma":[0.0011120006,0.008861876,0.5667086,0.000008545867,0.000059092887,0.00020349467,0.0000064691335,0.00016486316,0.42287502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781984,0.00029548272,0.00032329492,0.00033344503,0.00075551734,0.00047243483],"domain_scores_gemma":[0.9988958,0.00013686687,0.00007327305,0.00059934193,0.00020428786,0.00009040234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004099854,0.00016964856,0.00018956381,0.00039263265,0.0005929753,0.00012481406,0.0007731134,0.00005170239,0.000088540226],"category_scores_gemma":[0.00016262474,0.00010739239,0.000027202575,0.0014759251,0.001210845,0.00022155372,0.00038210233,0.0002744581,0.00001858586],"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.00006811001,0.00033103704,0.00127156,0.0017337424,0.00055870897,0.0000076484075,0.0035084868,0.22164837,0.007212256,0.017908664,0.1999124,0.545839],"study_design_scores_gemma":[0.0008488231,0.00037498423,0.0021156266,0.0019318305,0.000088689834,0.0000064643937,0.00033839783,0.60247654,0.0032908516,0.00050877087,0.38725019,0.0007688611],"about_ca_topic_score_codex":0.000113759066,"about_ca_topic_score_gemma":0.0001559095,"teacher_disagreement_score":0.5450702,"about_ca_system_score_codex":0.00006795426,"about_ca_system_score_gemma":0.00013225086,"threshold_uncertainty_score":0.45607466},"labels":[],"label_agreement":null},{"id":"W1566150287","doi":"10.1007/978-3-642-04244-7_28","title":"Solving a Location-Allocation Problem with Logic-Based Benders’ Decomposition","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"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 Toronto","funders":"","keywords":"Integer programming; Mathematical optimization; Tabu search; Computer science; Benders' decomposition; Constraint programming; Decomposition; Truck; Integer (computer science); Set (abstract data type); Facility location problem; Constraint (computer-aided design); Stochastic programming; Mathematics; Programming language; Engineering","score_opus":0.015102974138954636,"score_gpt":0.2520780912799707,"score_spread":0.23697511714101607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566150287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039027607,0.00016718185,0.9953354,0.0002972824,0.00020389855,0.0003804253,0.0000016624039,0.00037665767,0.0031984474],"genre_scores_gemma":[0.17859015,0.000008755426,0.82073224,0.000425486,0.00012851007,0.000008289098,0.00002867763,0.00004375707,0.00003412293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822843,0.000025540192,0.0003391967,0.0005819369,0.00047961914,0.00034529218],"domain_scores_gemma":[0.99885994,0.0002012464,0.00012959291,0.0004396468,0.00028867973,0.00008090026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052622135,0.00035160084,0.00027521586,0.000525222,0.00015402661,0.00020234137,0.00045784056,0.00023324297,0.000017487911],"category_scores_gemma":[0.000030659114,0.0003363959,0.00003811164,0.0005205062,0.00017830505,0.00023318703,0.00004142237,0.0004576278,0.000011204862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032664109,0.0000073201554,0.000020013402,0.000051741572,0.0000046600953,0.000004357086,0.000132886,0.8409003,0.0001582562,0.0005821121,0.0000038287317,0.15813123],"study_design_scores_gemma":[0.00021452243,0.00009789421,0.000115245755,0.0005984296,0.000012794353,0.000016631406,1.5501094e-7,0.98598105,0.0015461913,0.010941956,0.000066781366,0.00040835678],"about_ca_topic_score_codex":0.000004703881,"about_ca_topic_score_gemma":0.000036597183,"teacher_disagreement_score":0.17855112,"about_ca_system_score_codex":0.00045156715,"about_ca_system_score_gemma":0.0002444934,"threshold_uncertainty_score":0.9999088},"labels":[],"label_agreement":null},{"id":"W1574334008","doi":"10.1007/978-3-642-13036-6_27","title":"On Column-Restricted and Priority Covering Integer Programs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"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":"Integer (computer science); Column (typography); Cover (algebra); Computer science; Column generation; Omega; Tree (set theory); Approximation algorithm; Combinatorics; Logical matrix; Matrix (chemical analysis); Constraint (computer-aided design); Type (biology); Discrete mathematics; Mathematics; Mathematical optimization; Group (periodic table); Programming language","score_opus":0.013578718181496757,"score_gpt":0.2464335359269424,"score_spread":0.23285481774544564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574334008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040842555,0.000083414896,0.9919602,0.000043420212,0.0011912964,0.00032947786,0.0000027571825,0.00032448175,0.0019806903],"genre_scores_gemma":[0.2893928,0.00003462139,0.7098964,0.00018250915,0.00029903685,0.000008438375,0.0000066708703,0.000079722515,0.000099808465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846035,0.000015734751,0.00026471203,0.0005489272,0.0003662334,0.00034405102],"domain_scores_gemma":[0.99898446,0.00032434368,0.0000702346,0.00043414428,0.00007412325,0.00011272726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037588688,0.0003169809,0.00030458794,0.00032903088,0.000111199384,0.0002593943,0.00043963065,0.00036856902,0.000015053807],"category_scores_gemma":[0.0001445827,0.00031929425,0.000038670096,0.00029016408,0.00034603267,0.000119778626,0.00020804281,0.0012094473,0.0000069836033],"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.0000044440803,0.000010321877,0.00017021233,0.000065758504,0.0000088955485,0.000018336848,0.000346102,0.41324246,0.00047554358,0.0012489293,0.000002244232,0.58440673],"study_design_scores_gemma":[0.00022917484,0.00010489473,0.0005189821,0.00036744858,0.000008443055,0.00002159221,6.002765e-8,0.98006356,0.0012405616,0.015864763,0.0010548243,0.0005257189],"about_ca_topic_score_codex":0.000009279306,"about_ca_topic_score_gemma":0.00004044128,"teacher_disagreement_score":0.583881,"about_ca_system_score_codex":0.00014621453,"about_ca_system_score_gemma":0.00007831353,"threshold_uncertainty_score":0.9999259},"labels":[],"label_agreement":null},{"id":"W1581729816","doi":"10.1007/s10107-015-0947-5","title":"On integrality ratios for asymmetric TSP in the Sherali–Adams hierarchy","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Travelling salesman problem; Digraph; Linear programming relaxation; Relaxation (psychology); Linear programming; Discrete mathematics; Algorithm","score_opus":0.06647276221161304,"score_gpt":0.3280434873934523,"score_spread":0.26157072518183927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581729816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020781707,0.00006553439,0.9715898,0.00047817393,0.000109513865,0.0011040113,0.0000019114816,0.0003339926,0.0055353474],"genre_scores_gemma":[0.5292319,0.0000011629718,0.47014922,0.00013929572,0.00006666469,0.00030953018,0.000009318658,0.000039833536,0.000053038166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864626,0.00016405902,0.0003836969,0.00016742261,0.00029784962,0.000340715],"domain_scores_gemma":[0.99850065,0.0010306078,0.000035394776,0.00028790333,0.00005571044,0.00008975383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002630654,0.00016224923,0.00022781207,0.000110390974,0.000050799506,0.00013820894,0.00026175388,0.00008862231,0.000011042043],"category_scores_gemma":[0.0023030648,0.00011320266,0.00007448733,0.0006744168,0.000040092964,0.000092678594,0.00002210089,0.0002670194,0.000029680323],"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.00005930748,0.00063908834,0.0004789025,0.0008163821,0.00007492417,0.000013902167,0.009595347,0.09110161,0.00004316099,0.3544263,0.0044164537,0.5383346],"study_design_scores_gemma":[0.00097519095,0.0001953445,0.00006333788,0.00008883726,0.000023608201,0.000010750352,0.0008681924,0.8788089,0.00030089563,0.11298227,0.005368716,0.00031392332],"about_ca_topic_score_codex":0.0000038619924,"about_ca_topic_score_gemma":0.0000027016367,"teacher_disagreement_score":0.7877073,"about_ca_system_score_codex":0.00010943968,"about_ca_system_score_gemma":0.000015817599,"threshold_uncertainty_score":0.46162704},"labels":[],"label_agreement":null},{"id":"W1583403835","doi":"10.1016/j.ejor.2015.06.082","title":"The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":97,"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":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Vehicle routing problem; Benchmark (surveying); Mathematical optimization; Metaheuristic; Routing (electronic design automation); Heuristic; Dimensioning; Integer programming; Algorithm; Mathematics; Engineering; Computer network","score_opus":0.05021214779436636,"score_gpt":0.32654926189105693,"score_spread":0.2763371140966906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583403835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11679239,0.0025738825,0.8518676,0.0043850346,0.00014335837,0.0008306072,0.00001560168,0.000102921054,0.023288608],"genre_scores_gemma":[0.70046985,0.0000732187,0.29846263,0.000024561354,0.00024848568,0.0000032785072,0.0000030957951,0.00004262887,0.00067223114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980632,0.0006948264,0.00035012656,0.000099005265,0.00059155613,0.00020128513],"domain_scores_gemma":[0.9972821,0.0010582941,0.00005994552,0.00010232914,0.0013121879,0.00018513812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065737073,0.00008956523,0.00010638483,0.00009458298,0.00039905912,0.00036200281,0.00014721569,0.000015894699,0.0000097904185],"category_scores_gemma":[0.0016005659,0.00006061998,0.000012443731,0.0003099634,0.00013266152,0.00028644872,0.000057041132,0.00036443278,0.000014367083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001270309,0.000052747364,0.001703732,0.00005109901,0.00019357802,0.00009730475,0.0036406496,0.91600686,0.0013827013,0.0035578387,0.0043237214,0.06886272],"study_design_scores_gemma":[0.0013928515,0.00038332844,0.010084873,0.00015139775,0.000016461343,0.0005115024,0.0004996706,0.98181427,0.00009435395,0.00034520507,0.0045434046,0.00016269305],"about_ca_topic_score_codex":0.0000017309774,"about_ca_topic_score_gemma":0.0000010636552,"teacher_disagreement_score":0.5836775,"about_ca_system_score_codex":0.000062446416,"about_ca_system_score_gemma":0.00018289154,"threshold_uncertainty_score":0.34908015},"labels":[],"label_agreement":null},{"id":"W1583951675","doi":"10.1007/978-3-540-73545-8_54","title":"Approximation Algorithms for the Black and White Traveling Salesman Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Combinatorics; Triangle inequality; Bounded function; Approximation algorithm; Mathematics; Undirected graph; Hamiltonian (control theory); Hamiltonian path; Graph; Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.03269764042657921,"score_gpt":0.27462067247672894,"score_spread":0.24192303205014973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583951675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034146895,0.00018498128,0.9972056,0.00013250402,0.00040292388,0.00059731107,0.0000040004343,0.00013768137,0.0013008107],"genre_scores_gemma":[0.00962299,0.00005270512,0.9896861,0.00014305957,0.00034471875,0.000008844656,0.00000550505,0.000048782484,0.00008732351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986996,0.000010161078,0.00030223318,0.00041134423,0.00027217233,0.00030449426],"domain_scores_gemma":[0.99893135,0.000544931,0.00007926426,0.00028834507,0.0001046668,0.000051473395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013624638,0.00024806816,0.00021316204,0.00020566955,0.00015137695,0.00017546263,0.00037961802,0.00019936694,0.00000387451],"category_scores_gemma":[0.00004652188,0.00020000702,0.000042568958,0.00020390662,0.0002994762,0.00011384228,0.00008561948,0.00038005423,0.000001756287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.558489e-7,0.0000010194067,0.00000987665,0.000054726446,0.0000045383963,5.5151884e-7,0.0004978011,0.6226964,0.000022998162,0.000328497,0.0000021063363,0.37638053],"study_design_scores_gemma":[0.00013563092,0.00002163755,0.00007363254,0.00014627393,0.000011655649,0.000010840539,4.469497e-7,0.9881417,0.00032281427,0.010616891,0.00028613303,0.00023234596],"about_ca_topic_score_codex":0.0000013450202,"about_ca_topic_score_gemma":0.000010273486,"teacher_disagreement_score":0.37614816,"about_ca_system_score_codex":0.00009795597,"about_ca_system_score_gemma":0.000040922467,"threshold_uncertainty_score":0.815605},"labels":[],"label_agreement":null},{"id":"W1588856286","doi":"10.1023/a:1013661617536","title":"Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Pruning; Mathematical optimization; Computer science; Reduction (mathematics); Descent (aeronautics); Constraint programming; Variable neighborhood search; Constraint (computer-aided design); Mathematics; Metaheuristic; Stochastic programming","score_opus":0.0272116258951607,"score_gpt":0.2542900346914363,"score_spread":0.2270784087962756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588856286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15360653,0.00010383758,0.8443575,0.00037050893,0.00017316341,0.00019558334,0.000006926968,0.00007387778,0.0011120499],"genre_scores_gemma":[0.5533728,0.0000031348245,0.4462563,0.00016141475,0.00014591716,7.3791426e-7,2.5350093e-7,0.00003925694,0.000020201524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881667,0.000070518814,0.00047752322,0.00008516777,0.0002937492,0.00025637192],"domain_scores_gemma":[0.99906516,0.00022176164,0.00016479331,0.00016047082,0.00025306767,0.00013477077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006885387,0.0001514473,0.00023655703,0.00009861797,0.00013457217,0.00010530355,0.00020572003,0.000054759912,0.00008809378],"category_scores_gemma":[0.00022280106,0.00010516148,0.000056305413,0.0003226629,0.000052181476,0.000089726265,0.000018309369,0.0003532529,0.000017152308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008523463,0.000019525964,0.0007235043,0.000015533762,0.000040277595,0.000034860812,0.0003184587,0.9930303,0.0036861016,0.000048762897,0.0005937984,0.0014803166],"study_design_scores_gemma":[0.0004937506,0.00011009379,0.00009621133,0.00014108725,0.000060539136,0.00015002346,0.00009209427,0.99559164,0.002456726,0.00001056581,0.00064271403,0.00015453935],"about_ca_topic_score_codex":0.0000015688379,"about_ca_topic_score_gemma":5.5702424e-7,"teacher_disagreement_score":0.39976624,"about_ca_system_score_codex":0.00010712271,"about_ca_system_score_gemma":0.00005099099,"threshold_uncertainty_score":0.42883608},"labels":[],"label_agreement":null},{"id":"W1590764060","doi":"10.15837/ijccc.2011.1.2210","title":"Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Computers Communications & Control","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Vehicle routing problem; Computer science; Constructive; Generalization; Mathematical optimization; Heuristic; Partition (number theory); Routing (electronic design automation); Combinatorial optimization; Node (physics); Algorithm; Mathematics; Combinatorics; Process (computing)","score_opus":0.04705773568698275,"score_gpt":0.2997911099384948,"score_spread":0.25273337425151204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590764060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027729692,0.0005574279,0.9929189,0.0017539277,0.00095639226,0.00025636068,0.00001185179,0.000085342996,0.00068683684],"genre_scores_gemma":[0.58893794,0.00008382367,0.41054618,0.00020747136,0.000173028,0.000017029966,0.0000037385541,0.000021213846,0.000009545323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985929,0.00016891543,0.0007233691,0.000082304774,0.00025531484,0.00017715289],"domain_scores_gemma":[0.99731094,0.0009463153,0.000365438,0.0004676146,0.00084806513,0.00006160816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011330057,0.00013256092,0.00021784136,0.00015219724,0.00017488791,0.00011634928,0.0020249884,0.000048015932,0.0000125260985],"category_scores_gemma":[0.00017079826,0.000110336296,0.00017849651,0.00011998326,0.0000788456,0.00023187102,0.00012024246,0.0002845629,0.0000031083155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022501196,0.0003344299,0.0030300717,0.000032053013,0.002671767,0.00001414486,0.0074402234,0.7083317,0.0048509142,0.041140523,0.003437452,0.22849171],"study_design_scores_gemma":[0.0016910818,0.00004062438,0.0008116139,0.0000705008,0.000063413216,0.00006197206,0.00006896925,0.9917941,0.00025302483,0.00187272,0.0031517136,0.00012027243],"about_ca_topic_score_codex":0.000012700081,"about_ca_topic_score_gemma":0.0000033423114,"teacher_disagreement_score":0.586165,"about_ca_system_score_codex":0.00011460879,"about_ca_system_score_gemma":0.00005131361,"threshold_uncertainty_score":0.44993836},"labels":[],"label_agreement":null},{"id":"W159706599","doi":"","title":"A Hyper-heuristic Approach to the Home Care Scheduling Problem","year":2009,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Vehicle routing problem; Scheduling (production processes); Heuristic; Computer science; Job shop scheduling; Nurse scheduling problem; Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Artificial intelligence; Computer network; Flow shop scheduling","score_opus":0.015172345127862091,"score_gpt":0.2429631302065686,"score_spread":0.2277907850787065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159706599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015240099,0.0002789855,0.9095028,0.00028059757,0.00009216849,0.00030399486,0.0000015227563,0.0007253873,0.07357442],"genre_scores_gemma":[0.5185081,0.0000038687485,0.48108408,0.00017400653,0.000064765285,0.000011421309,0.0000029575529,0.000016480728,0.00013433665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929786,0.000035980673,0.00015543192,0.0001539439,0.00012927734,0.00022749764],"domain_scores_gemma":[0.99956864,0.00003486583,0.000011175862,0.00026150054,0.000050933555,0.00007287085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019398342,0.00011805601,0.00011401724,0.00005613424,0.00008392027,0.0000645622,0.00020141713,0.000049339516,0.000014381913],"category_scores_gemma":[0.000045998368,0.0000863805,0.00003414383,0.00035027624,0.0000067723877,0.000048698377,0.000020263158,0.00014408861,0.00005247231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010489541,0.0000071484337,0.000079652156,0.000021965601,0.000004750592,2.6308643e-7,0.0010569782,0.98021203,0.0002450892,0.0010215725,0.00025537508,0.01709414],"study_design_scores_gemma":[0.00018286688,0.000031168693,0.0012118586,0.00002021173,0.000015540825,0.000010407881,0.00062818895,0.9938022,0.0005100879,0.00014243036,0.0031871567,0.000257871],"about_ca_topic_score_codex":0.0000029871087,"about_ca_topic_score_gemma":7.5320554e-7,"teacher_disagreement_score":0.503268,"about_ca_system_score_codex":0.00004802325,"about_ca_system_score_gemma":0.000010578892,"threshold_uncertainty_score":0.35224947},"labels":[],"label_agreement":null},{"id":"W1601807516","doi":"10.1007/978-3-642-17514-5_17","title":"Approximation Algorithms for the Multi-Vehicle Scheduling Problem","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Algorithm; Mathematical optimization; Mathematics","score_opus":0.029951197751429275,"score_gpt":0.2773958598174451,"score_spread":0.2474446620660158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601807516","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028727209,0.00024553883,0.99710286,0.00019926259,0.0011729618,0.00075137714,0.000005730274,0.00025517706,0.0002383575],"genre_scores_gemma":[0.0049934657,0.000018801284,0.99422973,0.00013325686,0.00043858163,0.00003471722,0.0000058939568,0.000063115454,0.00008241992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985107,0.000012550539,0.00032756757,0.00047411444,0.00031915025,0.00035586944],"domain_scores_gemma":[0.9985581,0.000626955,0.00010145011,0.00048721707,0.00016820566,0.000058063175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011771874,0.00028298274,0.00023510646,0.00022003966,0.00026229126,0.0002268973,0.0007578938,0.00030937875,0.000009637639],"category_scores_gemma":[0.00013210665,0.00022528124,0.000074743024,0.00023173876,0.00025682084,0.00016825028,0.00013952664,0.0007965339,0.0000066255625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.197576e-7,0.0000028015484,0.000004489043,0.00003709889,0.0000049377104,4.0748455e-7,0.00021053008,0.6824508,0.0007198582,0.0003156403,6.2530086e-7,0.3162521],"study_design_scores_gemma":[0.0002031836,0.000016055232,0.00001237408,0.000106986234,0.000010194202,0.0000062973427,1.9116509e-7,0.98602146,0.004897437,0.007931527,0.0005251964,0.0002690993],"about_ca_topic_score_codex":0.0000033540878,"about_ca_topic_score_gemma":0.000016219588,"teacher_disagreement_score":0.31598303,"about_ca_system_score_codex":0.000114101065,"about_ca_system_score_gemma":0.00008374472,"threshold_uncertainty_score":0.91867024},"labels":[],"label_agreement":null},{"id":"W1601856531","doi":"10.1007/s00453-002-0986-1","title":"TSP Heuristics: Domination Analysis and Complexity","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"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 New Brunswick","funders":"","keywords":"Combinatorics; Travelling salesman problem; Mathematics; Heuristics; Digraph; Heuristic; Theory of computation; Time complexity; Constant (computer programming); Discrete mathematics; Graph; Mathematical optimization; Algorithm; Computer science","score_opus":0.029251424219865128,"score_gpt":0.25060173871491265,"score_spread":0.22135031449504752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601856531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023526452,0.00019207793,0.9712534,0.00011596429,0.00010484142,0.00006913297,0.000014970201,0.00031572315,0.0044074184],"genre_scores_gemma":[0.6111605,0.0000617982,0.38849264,0.000028105189,0.00006057275,0.000004185521,0.000013407863,0.000016475342,0.00016228187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994417,0.000041590756,0.00015379435,0.00013041112,0.00009896262,0.00013355917],"domain_scores_gemma":[0.9996451,0.00008671176,0.000022848164,0.00015008927,0.000037292168,0.000057927704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014300324,0.000089151814,0.00015290067,0.00015489562,0.000058778027,0.00003614025,0.00006227556,0.000048980583,0.00028170974],"category_scores_gemma":[0.000054973596,0.00009863104,0.000038692466,0.0004965999,0.00004323509,0.00006277916,0.000019010735,0.00008434087,0.00002913216],"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.0000049247365,0.0001173006,0.0071298117,0.00011801026,0.0014243125,0.000022200034,0.0017854929,0.22491474,0.0014075342,0.003217864,0.0037627867,0.756095],"study_design_scores_gemma":[0.00014298002,0.0000066425832,0.006356933,0.00000219065,0.00012373122,0.0000031167824,0.000011877144,0.99164456,0.00054430193,0.00027477855,0.0007762235,0.000112640286],"about_ca_topic_score_codex":0.000010297083,"about_ca_topic_score_gemma":0.000003382565,"teacher_disagreement_score":0.76672983,"about_ca_system_score_codex":0.000028843517,"about_ca_system_score_gemma":9.901552e-7,"threshold_uncertainty_score":0.4022057},"labels":[],"label_agreement":null},{"id":"W1602449607","doi":"10.1109/icec.1995.489116","title":"Generalization and refinement of route construction heuristics using genetic algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"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":"Heuristics; Generalization; Computer science; Genetic algorithm; Algorithm; Theoretical computer science; Machine learning; Mathematics","score_opus":0.030225867247348527,"score_gpt":0.25142448154052444,"score_spread":0.22119861429317592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602449607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16705662,0.00021690338,0.83175206,0.000008403001,0.00013321836,0.000051938616,0.0000028876734,0.00008687756,0.0006910797],"genre_scores_gemma":[0.16350813,0.00022774682,0.83614707,0.000009559055,0.00003527022,9.586878e-7,0.0000024194524,0.000014795661,0.000054036926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995261,0.00002386191,0.00020594854,0.00008066164,0.0000804672,0.00008296976],"domain_scores_gemma":[0.9997884,0.000013396143,0.000034501758,0.00008927018,0.000045790046,0.000028647708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000622682,0.000069230904,0.00009075849,0.000059630172,0.000027820162,0.000012683691,0.000025100593,0.00004015265,0.000113725],"category_scores_gemma":[0.000017774628,0.00007391183,0.000011423195,0.00013309717,0.00002535383,0.000038003487,0.000012125692,0.000030624,0.0000010162719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.06242e-7,0.000004732213,0.0025815822,0.00003460271,0.000011827609,4.200393e-7,0.00009044074,0.96597284,0.0033969441,0.00025788334,0.000047655718,0.027600756],"study_design_scores_gemma":[0.00015254854,0.000008462588,0.0008732191,0.00000927913,0.000017125973,0.000015330483,0.00001545756,0.9946049,0.0040178127,0.000035543093,0.00017343578,0.00007691237],"about_ca_topic_score_codex":0.000012767144,"about_ca_topic_score_gemma":5.860744e-7,"teacher_disagreement_score":0.028632022,"about_ca_system_score_codex":0.00002805447,"about_ca_system_score_gemma":0.0000021647272,"threshold_uncertainty_score":0.3014037},"labels":[],"label_agreement":null},{"id":"W1605874004","doi":"10.1002/9780470400531.eorms0118","title":"Branch‐Price‐and‐Cut Algorithms","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management 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":"Column generation; Branch and cut; Linear programming relaxation; Discretization; Branch and bound; Branch and price; Integer programming; Relaxation (psychology); Branching (polymer chemistry); Integer (computer science); Cutting-plane method; Mathematics; Tree (set theory); Polyhedron; Column (typography); Mathematical optimization; Algorithm; Decomposition; Computer science; Combinatorics; Geometry","score_opus":0.03414338929212809,"score_gpt":0.32532305928127525,"score_spread":0.2911796699891472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605874004","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011440918,0.0014565933,0.052877232,0.0000364705,0.00023921941,0.00067473174,0.000018890054,0.00016540404,0.94441706],"genre_scores_gemma":[0.00097580784,0.14778319,0.34705958,0.000020218738,0.00017169243,0.00018557695,0.000016503347,0.00021966266,0.50356776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983052,0.000054926393,0.00021932377,0.00040707746,0.0005930342,0.00042045402],"domain_scores_gemma":[0.99925816,0.000036130357,0.000020463192,0.0003988191,0.00010783144,0.00017857138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012858496,0.0001661027,0.00019006364,0.0011115436,0.00023127181,0.00011823955,0.0004316167,0.00008379415,0.00048316517],"category_scores_gemma":[0.000090983376,0.00016041409,0.000015726708,0.0010441898,0.0008134784,0.00022110861,0.00033011066,0.00021601563,0.00003591501],"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.000011325286,0.0002599813,0.0006335792,0.002690778,0.00027533536,0.000032362812,0.0022592458,0.012730299,0.0005059223,0.06541675,0.4630406,0.45214382],"study_design_scores_gemma":[0.00066691515,0.00018066978,0.0013340752,0.0008192886,0.000041042258,0.000008721132,0.00024855605,0.13675989,0.00026718096,0.00070568227,0.8581767,0.00079123327],"about_ca_topic_score_codex":0.00014116832,"about_ca_topic_score_gemma":0.00007821556,"teacher_disagreement_score":0.4513526,"about_ca_system_score_codex":0.000034439905,"about_ca_system_score_gemma":0.000049665214,"threshold_uncertainty_score":0.65414965},"labels":[],"label_agreement":null},{"id":"W1606603715","doi":"10.6000/2371-1647.2015.01.02","title":"A Unified Framework for Integer Programming Formulation of Graph Matching Problems","year":2015,"lang":"en","type":"article","venue":"Journal of Advances in Management Sciences & Information Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer programming; Computer science; Matching (statistics); Graph; Mathematical optimization; Theoretical computer science; Mathematics; Algorithm; Statistics","score_opus":0.029323131710985835,"score_gpt":0.31592017883428625,"score_spread":0.2865970471233004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606603715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004960278,0.00049812737,0.99059325,0.000021967047,0.0010133304,0.00055464037,0.0000011806821,0.00003603392,0.0023211928],"genre_scores_gemma":[0.5502371,0.000121637284,0.4495691,0.0000071164072,0.000031417054,0.000021251295,0.0000015884455,0.000005366357,0.00000540589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804837,0.000046572084,0.0011388137,0.0000590667,0.0005255229,0.00018164066],"domain_scores_gemma":[0.998666,0.00012363294,0.00079123327,0.00009086165,0.0002789042,0.000049399227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039920434,0.00010096439,0.00022649796,0.0007330405,0.000051135863,0.00013426754,0.0002779467,0.000047003945,7.6924573e-7],"category_scores_gemma":[0.00014097484,0.000085256084,0.00005334936,0.00092821446,0.000037204136,0.0043541784,0.000024644844,0.0001128787,9.878885e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011576378,0.000007430826,0.0005454489,0.00064137054,0.000012451779,1.7978215e-7,0.0022036515,0.945204,0.0000034888149,0.036812436,0.000015670079,0.014542277],"study_design_scores_gemma":[0.0013295994,0.00031246146,0.00019251354,0.0022463172,0.000031002146,0.000018570692,0.025184315,0.9102798,0.00009708108,0.043072406,0.016947148,0.0002887683],"about_ca_topic_score_codex":0.0000028206412,"about_ca_topic_score_gemma":9.785603e-7,"teacher_disagreement_score":0.5452768,"about_ca_system_score_codex":0.000107807624,"about_ca_system_score_gemma":0.000021595044,"threshold_uncertainty_score":0.3476642},"labels":[],"label_agreement":null},{"id":"W1608301497","doi":"10.1109/ccece.2015.7129191","title":"Generalized formulation for trajectory optimization in patrolling problems","year":2015,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Patrolling; Trajectory; Mathematical optimization; Viewpoints; Sequence (biology); Computer science; Optimization problem; Trajectory optimization; Mathematics; Optimal control","score_opus":0.049368986062342884,"score_gpt":0.28055857626401254,"score_spread":0.23118959020166965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608301497","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023507252,0.00007138097,0.9740355,0.000025341076,0.00018078438,0.00043029716,0.0000016113238,0.0003641683,0.0013836776],"genre_scores_gemma":[0.30731472,0.00000892078,0.6923969,0.000019161127,0.00005073195,0.00006667713,0.000032848777,0.00003159979,0.00007846898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993429,0.000033970744,0.00025788532,0.00010948388,0.00008992242,0.00016581536],"domain_scores_gemma":[0.99970776,0.000046955356,0.00002618448,0.000091504546,0.00007464802,0.0000529789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053631846,0.00009085494,0.00012185954,0.00012770001,0.000019517627,0.00002562134,0.000051277526,0.00007556957,0.000015278089],"category_scores_gemma":[0.00008566083,0.00009426146,0.00002936234,0.00020919515,0.000002692943,0.00019736082,0.000005588782,0.000048678176,0.0000018953865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007908855,0.000006593992,0.00049607083,0.000023134837,0.0000044113094,1.13839974e-7,0.0002690451,0.99711615,0.00034624166,0.0004418404,0.00009165691,0.0011968194],"study_design_scores_gemma":[0.0013713418,0.000017455986,0.000049186445,0.000009671448,0.000004781021,7.428485e-7,0.00003094008,0.9969944,0.0009029895,0.0002525357,0.00024628593,0.00011967686],"about_ca_topic_score_codex":0.000009973637,"about_ca_topic_score_gemma":0.000014614029,"teacher_disagreement_score":0.28380746,"about_ca_system_score_codex":0.000111822184,"about_ca_system_score_gemma":0.000018717772,"threshold_uncertainty_score":0.38438708},"labels":[],"label_agreement":null},{"id":"W163313786","doi":"10.1080/03155986.2005.11732712","title":"Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp<sup>1</sup>","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Travelling salesman problem; Robustness (evolution); Mathematical optimization; Computer science; Heuristic; Algorithm; Variety (cybernetics); Running time; Mathematics; Artificial intelligence","score_opus":0.08325847113931187,"score_gpt":0.3756591253218196,"score_spread":0.2924006541825077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163313786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77730817,0.0024646185,0.08398265,0.0036211638,0.001153664,0.00928005,0.00031480743,0.00031699034,0.12155789],"genre_scores_gemma":[0.99840236,0.00006132635,0.0008553132,0.000082026214,0.00016520492,0.00017187535,0.00002633687,0.000010470866,0.0002250974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961605,0.0005240396,0.0007496981,0.00007847484,0.002250683,0.00023660448],"domain_scores_gemma":[0.9962693,0.00090772467,0.00009857592,0.00028135936,0.0023808733,0.00006219361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011919093,0.00011211689,0.00014836446,0.00028569883,0.00042457093,0.0003916609,0.00026838577,0.000101906444,0.000087103115],"category_scores_gemma":[0.0032916279,0.000064572014,0.00003886304,0.00095773645,0.000096017575,0.0011845744,0.000065333894,0.00031796077,0.00006345508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001117599,0.000005982799,0.00060931436,0.000064975495,0.00003037266,3.421411e-8,0.0015559114,0.9534934,0.000010826322,0.005473952,0.0015193392,0.037224703],"study_design_scores_gemma":[0.00053807884,0.000022416049,0.0047368286,0.000046568206,0.000014962824,0.000015175542,0.0008215924,0.96794903,0.0001532207,0.000019320494,0.025603658,0.0000791526],"about_ca_topic_score_codex":0.00015956549,"about_ca_topic_score_gemma":0.000017338169,"teacher_disagreement_score":0.22109418,"about_ca_system_score_codex":0.00022385521,"about_ca_system_score_gemma":0.00038028904,"threshold_uncertainty_score":0.41309434},"labels":[],"label_agreement":null},{"id":"W1650780448","doi":"10.1109/tase.2015.2461213","title":"Planning Paths for Package Delivery in Heterogeneous Multirobot Teams","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":295,"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":"Travelling salesman problem; Truck; Scheduling (production processes); Computer science; Job shop scheduling; Motion planning; Mathematical optimization; Heuristic; Vehicle routing problem; Traveling purchaser problem; Task (project management); Graph; Shortest path problem; 2-opt; Distributed computing; Operations research; Routing (electronic design automation); Robot; Engineering; Artificial intelligence; Computer network; Theoretical computer science; Mathematics; Algorithm","score_opus":0.03005034896176269,"score_gpt":0.2773482127765395,"score_spread":0.24729786381477678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650780448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29226142,0.000029631283,0.706841,0.000011957855,0.00034185403,0.00013443507,0.0000040407754,0.00034148202,0.000034184122],"genre_scores_gemma":[0.93027925,0.000008992291,0.06959709,0.000019522442,0.00001613662,0.000049376064,8.545602e-7,0.000021915046,0.000006880426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991227,0.000010183125,0.00020640362,0.00018397174,0.00022589629,0.0002508474],"domain_scores_gemma":[0.9995654,0.00008899377,0.000018238494,0.00012278747,0.00008152025,0.00012303483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066342775,0.000122011224,0.00011803316,0.00041883407,0.00008813857,0.00007927127,0.00010032354,0.000055995533,0.0000018391396],"category_scores_gemma":[0.000050777606,0.00013501,0.00002264136,0.00056408,0.00003393228,0.00041502865,0.0000011596803,0.000110549,0.00000391003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037508448,0.000008156988,0.000016482849,0.0000218293,0.0000030465058,0.0000012038342,0.0007051574,0.97330564,0.0121254595,0.0000057790626,0.000005335812,0.013798143],"study_design_scores_gemma":[0.00038077915,0.000035245168,0.00021869027,0.000045303554,0.000004198312,0.000010041026,0.00011458359,0.96926904,0.029710941,0.000005977557,0.00005912634,0.00014608284],"about_ca_topic_score_codex":0.0000049175032,"about_ca_topic_score_gemma":0.000001790924,"teacher_disagreement_score":0.63801783,"about_ca_system_score_codex":0.00019899616,"about_ca_system_score_gemma":0.0000423548,"threshold_uncertainty_score":0.5505548},"labels":[],"label_agreement":null},{"id":"W166422795","doi":"10.1007/978-0-387-71722-7_1","title":"Planned Route Optimization For Real-Time Vehicle Routing","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"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; Computer Research Institute of Montréal; Université Laval","funders":"","keywords":"Vehicle routing problem; Anticipation (artificial intelligence); Computer science; Consolidation (business); Focus (optics); Operations research; Routing (electronic design automation); Work (physics); Transport engineering; Engineering; Computer network; Artificial intelligence; Business","score_opus":0.021255838836052872,"score_gpt":0.24185218910682443,"score_spread":0.22059635027077157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166422795","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015817686,0.00006701538,0.4247737,0.000031567775,0.00025195608,0.0005080303,0.00007728319,0.0015786246,0.57269603],"genre_scores_gemma":[0.00022347417,0.00071870076,0.5751937,0.000052530973,0.00041663402,0.000030734962,0.00062112615,0.0004125764,0.42233053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983291,0.000019817617,0.00060998276,0.00040739618,0.00023803757,0.0003956549],"domain_scores_gemma":[0.99888617,0.00025948026,0.00015766796,0.00041793217,0.00015701007,0.000121731246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028905208,0.0004742742,0.00053523184,0.0001944022,0.00016162437,0.00005962156,0.00022394565,0.00058476895,0.0008003359],"category_scores_gemma":[0.00006666084,0.00053842633,0.00019745165,0.000057047724,0.00003403388,0.00014535966,0.00004816581,0.00025779047,0.00013344851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016645028,0.0000039222205,0.0000042026336,0.00006164553,0.00009254655,0.000004411067,0.000082822764,0.9852943,0.0000895747,0.0025327331,0.009059179,0.0027580536],"study_design_scores_gemma":[0.00046422664,0.000046804686,0.0000033382698,0.00010708936,0.000060901788,0.0000117858835,0.0000037105124,0.9805356,0.00022825862,0.000117920186,0.017824104,0.00059622247],"about_ca_topic_score_codex":0.0000064787732,"about_ca_topic_score_gemma":0.0000018842683,"teacher_disagreement_score":0.15042002,"about_ca_system_score_codex":0.00021953904,"about_ca_system_score_gemma":0.000048702164,"threshold_uncertainty_score":0.99970675},"labels":[],"label_agreement":null},{"id":"W1696028247","doi":"10.5267/j.ijiec.2015.8.003","title":"A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Pareto principle; Ant colony optimization algorithms; Mathematical optimization; Depot; ANT; Computer science; Algorithm; Multi-objective optimization; Mathematics; Engineering; Routing (electronic design automation); Computer network","score_opus":0.05743903590744473,"score_gpt":0.3045569092903155,"score_spread":0.24711787338287075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1696028247","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009242821,0.00009946244,0.9877009,0.00044122117,0.0019250261,0.00040135067,0.000042475567,0.0001323727,0.000014385791],"genre_scores_gemma":[0.3211373,0.0000068137156,0.6778805,0.000024432298,0.00083491905,0.000030057774,0.00001034879,0.00005493192,0.000020679141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857074,0.000053864842,0.0005610356,0.00013427768,0.0004442983,0.00023577812],"domain_scores_gemma":[0.99749774,0.0007636035,0.00025826946,0.00010103875,0.0012304834,0.00014886289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086526177,0.0001997526,0.00024820335,0.00023272105,0.00008254,0.00016508714,0.00041701013,0.00010995302,0.0000027296824],"category_scores_gemma":[0.00065371004,0.00015846394,0.00010575303,0.0003185481,0.000033490815,0.00028278088,0.00004201734,0.00047373123,0.000002303822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029911607,0.000047156118,0.00035409734,0.0000033983326,0.00040554453,0.000014336723,0.000696438,0.98100084,0.00021725653,0.000052072148,0.00030045855,0.016878515],"study_design_scores_gemma":[0.00408634,0.00013081558,0.00032259966,0.00015410919,0.00006283701,0.00013710994,0.00039706405,0.9928158,0.00051558623,0.000011906653,0.0011823266,0.00018349274],"about_ca_topic_score_codex":0.000020185467,"about_ca_topic_score_gemma":0.0000062157196,"teacher_disagreement_score":0.3118945,"about_ca_system_score_codex":0.0003822008,"about_ca_system_score_gemma":0.00022419018,"threshold_uncertainty_score":0.6461972},"labels":[],"label_agreement":null},{"id":"W1699895247","doi":"10.1007/s10696-015-9222-6","title":"The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers","year":2015,"lang":"en","type":"article","venue":"Flexible Services and Manufacturing Journal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"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":"Workload; Set (abstract data type); Computer science; Health care; Service (business); Value (mathematics); Operations research; Mathematics; Machine learning; Business; Marketing","score_opus":0.029536877569350705,"score_gpt":0.32930822289301415,"score_spread":0.29977134532366345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1699895247","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51190096,0.01244694,0.46970475,0.0020969566,0.001130147,0.0015891814,0.000119489596,0.00018848357,0.0008231004],"genre_scores_gemma":[0.4676874,0.00015667402,0.53189576,0.00012261176,0.00007162989,0.0000060504212,0.000011010816,0.000039596343,0.000009275161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986162,0.00020915206,0.00039966765,0.00016978578,0.00028560267,0.00031959437],"domain_scores_gemma":[0.99922454,0.000081207116,0.00016347939,0.0002906023,0.00006410009,0.00017605186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089483004,0.00015918267,0.00023504121,0.00010153954,0.00025837932,0.00015858178,0.0004011654,0.000040522285,0.000003898874],"category_scores_gemma":[0.0000053089284,0.000102187456,0.000028692197,0.00011268376,0.000018662433,0.00018809052,0.00021788148,0.00025207078,6.7965635e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021498665,0.000004585855,0.00012167958,0.00021621776,0.00003088744,0.0000022387953,0.018525941,0.9420013,0.000038356502,0.000013427422,0.000050756484,0.038973115],"study_design_scores_gemma":[0.0013579016,0.00036782929,0.0028895645,0.0007852987,0.00007465713,0.00013552378,0.053371295,0.9224703,0.010556684,0.00033269773,0.007210286,0.00044799788],"about_ca_topic_score_codex":0.0002427131,"about_ca_topic_score_gemma":0.00011898424,"teacher_disagreement_score":0.06219098,"about_ca_system_score_codex":0.00023634416,"about_ca_system_score_gemma":0.000092557275,"threshold_uncertainty_score":0.41670835},"labels":[],"label_agreement":null},{"id":"W1783225223","doi":"10.1023/a:1013613701606","title":"Constraint Programming Based Column Generation for Crew Assignment","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Column generation; Constraint (computer-aided design); Shortest path problem; Domain (mathematical analysis); Limit (mathematics); Path (computing); Computer science; Space (punctuation); Mathematics; Theoretical computer science","score_opus":0.0538748117578501,"score_gpt":0.2743114601091357,"score_spread":0.22043664835128562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783225223","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036795086,0.0002697796,0.99499106,0.0001277808,0.0005240183,0.00014686714,0.0000071244535,0.000040887622,0.00021295373],"genre_scores_gemma":[0.38733426,0.00003101454,0.61221427,0.000043898046,0.0003169649,0.0000040500986,0.0000021819546,0.000020525144,0.000032847092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915045,0.000041071922,0.00042841746,0.00005545875,0.00017922159,0.00014540055],"domain_scores_gemma":[0.9993358,0.00015393346,0.00015227358,0.00007865123,0.00020086099,0.000078472025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511071,0.000084384745,0.00015803074,0.00007096895,0.000055193366,0.00006112627,0.000072270435,0.00005494164,0.00006721961],"category_scores_gemma":[0.0003647014,0.00008525193,0.00007106482,0.000078548095,0.000020405929,0.000050891416,0.000004055379,0.00012784122,0.0000019933925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004816007,0.00006148835,0.00019857919,0.00007165494,0.00004217449,0.000013283997,0.00009056876,0.92407393,0.003820978,0.00013138591,0.0126976445,0.05879348],"study_design_scores_gemma":[0.0005406823,0.00012275181,0.000028217928,0.00002999178,0.00004300257,0.000028353481,0.000019206836,0.97932476,0.0024195143,0.000018707477,0.017332792,0.000092028204],"about_ca_topic_score_codex":1.6719413e-7,"about_ca_topic_score_gemma":3.1543516e-7,"teacher_disagreement_score":0.38365474,"about_ca_system_score_codex":0.00010248866,"about_ca_system_score_gemma":0.000020024148,"threshold_uncertainty_score":0.34764728},"labels":[],"label_agreement":null},{"id":"W1823652951","doi":"10.1007/3-540-45724-0_5","title":"An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"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":"Vehicle routing problem; Metaheuristic; Computer science; Heuristics; Ant colony optimization algorithms; Ant colony; Mathematical optimization; Scheduling (production processes); Parallel metaheuristic; Job shop scheduling; Set (abstract data type); Ranging; Routing (electronic design automation); Operations research; Artificial intelligence; Mathematics; Computer network; Meta-optimization","score_opus":0.018252130103274436,"score_gpt":0.25866336348018026,"score_spread":0.24041123337690584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823652951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014515672,0.00011175388,0.983059,0.000010432309,0.00017231386,0.0015890162,0.0000074974573,0.00019623594,0.00033808697],"genre_scores_gemma":[0.82525766,6.816487e-7,0.1744868,0.00001945605,0.00012114502,0.000036617697,0.0000019689057,0.0000540203,0.000021631615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983118,0.000042104948,0.0003933261,0.0004920148,0.0004285609,0.00033215518],"domain_scores_gemma":[0.9986274,0.0004653853,0.00016311012,0.00056376087,0.00012064958,0.0000596781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007729281,0.00029761353,0.00039167213,0.00016772942,0.00020690553,0.00012566912,0.00072204974,0.00011448043,0.0000090079375],"category_scores_gemma":[0.000016104374,0.00021604044,0.000042039024,0.00026246105,0.00016330197,0.00014028928,0.00011466232,0.00027071554,0.0000018309931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010456315,0.00005238331,0.00010049779,0.000050423067,0.000020426762,0.000004805153,0.002794635,0.98435956,0.0012457155,0.00006636233,0.0000020363182,0.011292678],"study_design_scores_gemma":[0.0005349315,0.0008139667,0.000031758256,0.00018378858,0.000021106827,0.000015891897,0.000014251233,0.9931345,0.0049288855,0.00004525932,0.000019908457,0.0002557751],"about_ca_topic_score_codex":0.000016327627,"about_ca_topic_score_gemma":0.000013551514,"teacher_disagreement_score":0.810742,"about_ca_system_score_codex":0.00023355619,"about_ca_system_score_gemma":0.000050758157,"threshold_uncertainty_score":0.88098735},"labels":[],"label_agreement":null},{"id":"W1823906467","doi":"10.1016/j.ejor.2015.10.058","title":"A two-stage solution method for the annual dairy transportation problem","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Mitacs","keywords":"Computer science; Transportation theory; Operations research; Cluster analysis; Stage (stratigraphy); Order (exchange); Phase (matter); Operations management; Mathematical optimization; Mathematics; Business; Economics; Artificial intelligence","score_opus":0.13481051807414288,"score_gpt":0.41495660487977276,"score_spread":0.2801460868056299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823906467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002725488,0.00031462937,0.9915999,0.0013692488,0.00021152015,0.0002849011,0.000038775444,0.000027930857,0.0034275658],"genre_scores_gemma":[0.21809374,0.00003620671,0.78016376,0.000055992397,0.0007067015,0.000011589139,0.0000216244,0.000056024914,0.0008543476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972243,0.0011960806,0.00047836828,0.00010153287,0.0007717029,0.00022806948],"domain_scores_gemma":[0.99697053,0.0006719463,0.00007167937,0.00011851938,0.0020281586,0.00013913258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017890954,0.00008828137,0.00011620373,0.00017495049,0.00021173536,0.00012795963,0.00030081868,0.000019902047,0.000032785505],"category_scores_gemma":[0.0007241408,0.00006509253,0.00006850448,0.00030923207,0.000049009737,0.0004018278,0.0000140588445,0.00043099967,0.000015501499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008823481,0.000019519637,0.000049371734,0.000018291214,0.000044357108,0.000012580665,0.0020706279,0.97098875,0.0023322557,0.0032657827,0.010192034,0.010918198],"study_design_scores_gemma":[0.0023943267,0.0004264912,0.0020342355,0.00005597938,0.000026199436,0.00005572436,0.0019408567,0.9117861,0.0014505896,0.00028036587,0.079380475,0.00016865185],"about_ca_topic_score_codex":0.000005085978,"about_ca_topic_score_gemma":0.000005657351,"teacher_disagreement_score":0.21536824,"about_ca_system_score_codex":0.00011277608,"about_ca_system_score_gemma":0.00022318287,"threshold_uncertainty_score":0.6200683},"labels":[],"label_agreement":null},{"id":"W1832376799","doi":"10.1287/trsc.2015.0635","title":"A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Branch and cut; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Branch and price; Computer science; Vehicle routing problem; Set (abstract data type); State (computer science); Algorithm; Operations research; Integer programming; Mathematics","score_opus":0.0419161086913205,"score_gpt":0.2980385804930498,"score_spread":0.2561224718017293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832376799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024546813,0.00010070853,0.97402453,0.00013891519,0.00021454184,0.0003017112,0.0000074082564,0.00019863386,0.0004667279],"genre_scores_gemma":[0.6549415,0.000013223396,0.34480557,0.00006546065,0.000043738997,0.00004826787,0.0000040952123,0.000016054211,0.00006208447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991134,0.000012714698,0.0002032779,0.00017225312,0.00028122377,0.00021716281],"domain_scores_gemma":[0.99946475,0.000096110176,0.000041624935,0.00012554819,0.00016515864,0.00010678064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015510046,0.00008313928,0.0000818292,0.00006599062,0.0001799866,0.00007186536,0.00019419039,0.000027854545,0.000004372064],"category_scores_gemma":[0.000066914574,0.00006704798,0.000022451262,0.000572955,0.00015060164,0.0003300714,0.0000032870985,0.00007045136,0.0000031927254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066189245,0.000015978636,0.0042067845,0.00006220444,0.000019519754,9.76394e-7,0.015792534,0.6754132,0.0032118503,0.0058575086,0.00023542192,0.29517743],"study_design_scores_gemma":[0.00033888273,0.000014558861,0.004133115,0.000012864294,0.000013546833,0.000001514479,0.0002679592,0.99137205,0.0019100715,0.00075230066,0.0010731057,0.00011004818],"about_ca_topic_score_codex":0.000013794685,"about_ca_topic_score_gemma":0.000011789414,"teacher_disagreement_score":0.6303947,"about_ca_system_score_codex":0.000040666084,"about_ca_system_score_gemma":0.00007661812,"threshold_uncertainty_score":0.27341372},"labels":[],"label_agreement":null},{"id":"W1839817983","doi":"10.1002/atr.1237","title":"A differential evolution approach for the vehicle routing problem with backhauls and time windows","year":2013,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Backhaul (telecommunications); Mathematical optimization; Benchmark (surveying); Computer science; Extension (predicate logic); Integer programming; Operations research; Routing (electronic design automation); Mathematics; Computer network","score_opus":0.0069416682432794745,"score_gpt":0.21626474240693105,"score_spread":0.2093230741636516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839817983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3139522,0.00008740459,0.6854542,0.000044964083,0.000040597824,0.0003567261,0.0000026570835,0.00002902898,0.00003223078],"genre_scores_gemma":[0.7121539,0.000017593584,0.2876936,0.0000053833573,0.000062316765,0.00002402928,0.000007297265,0.000020691265,0.000015201778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927306,0.00002189844,0.00033335565,0.00008185393,0.0001507331,0.00013911116],"domain_scores_gemma":[0.9994207,0.0001107065,0.00017321124,0.000064850436,0.00018413283,0.000046386478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017388865,0.00010451812,0.0001560515,0.000052038893,0.00008388993,0.00003717858,0.00006661096,0.000042517953,0.000012620194],"category_scores_gemma":[0.000012802192,0.000070604234,0.000045067798,0.00012313889,0.000023967053,0.0004600468,0.0000010227087,0.00013770905,5.9375117e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005442726,0.0000143597745,0.00089054945,0.00005257622,0.00004803383,2.705777e-7,0.00056611456,0.96600366,0.023168385,0.000106050495,0.000015084156,0.009080486],"study_design_scores_gemma":[0.0021758834,0.00019176827,0.11669102,0.00008094123,0.00013890551,0.000015605212,0.00051912485,0.8775607,0.002112153,0.0003033045,0.000041431114,0.00016916507],"about_ca_topic_score_codex":0.0000026018733,"about_ca_topic_score_gemma":0.000001291822,"teacher_disagreement_score":0.3982017,"about_ca_system_score_codex":0.000037229296,"about_ca_system_score_gemma":0.0000144854275,"threshold_uncertainty_score":0.2879157},"labels":[],"label_agreement":null},{"id":"W1843716693","doi":"10.1016/j.ejor.2016.04.065","title":"Large neighborhood search for multi-trip vehicle routing","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"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":"Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Heuristics; Computer science; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Heuristic; Set (abstract data type); Local search (optimization); Artificial intelligence; Mathematics; Computer network","score_opus":0.13418820472179713,"score_gpt":0.3940342656961502,"score_spread":0.25984606097435303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843716693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06560527,0.00019081807,0.92957115,0.00096854765,0.00023388078,0.00021760225,0.000029549887,0.000046671565,0.0031364919],"genre_scores_gemma":[0.9160451,0.00006536191,0.08231664,0.000040142277,0.000654998,0.0000034420036,0.0000029205778,0.00007540903,0.0007959526],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680334,0.0011802525,0.000572143,0.00015536435,0.0007813974,0.00050749566],"domain_scores_gemma":[0.9971993,0.00086255145,0.000053762313,0.00017162944,0.0015076438,0.00020509375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013230037,0.00011654838,0.0001696063,0.00030377888,0.00029269513,0.00014921892,0.00042233118,0.000033115255,0.00019286822],"category_scores_gemma":[0.0018069575,0.000084201856,0.0000986112,0.0003263177,0.000057330737,0.00037833108,0.000088586174,0.00041512624,0.000112607144],"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.00050879346,0.0006172917,0.017608875,0.0002112379,0.00051796646,0.00038663513,0.0044014393,0.2580922,0.49422354,0.04016167,0.017704686,0.16556567],"study_design_scores_gemma":[0.009397608,0.0007531164,0.019701468,0.00043908335,0.00001797943,0.00014842892,0.0005851103,0.9023869,0.044876073,0.00011216476,0.021090688,0.00049139577],"about_ca_topic_score_codex":3.5816936e-7,"about_ca_topic_score_gemma":4.381891e-7,"teacher_disagreement_score":0.85043985,"about_ca_system_score_codex":0.00016181465,"about_ca_system_score_gemma":0.00015807462,"threshold_uncertainty_score":0.4585293},"labels":[],"label_agreement":null},{"id":"W1847516220","doi":"10.1007/978-0-387-77778-8_15","title":"Recent Models and Algorithms for One-to-One Pickup and Delivery Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"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":"Heuristics; Pickup; Set (abstract data type); Heuristic; Computer science; Algorithm; Mathematical optimization; Order (exchange); Operations research; Engineering; Mathematics; Artificial intelligence; Business; Programming language","score_opus":0.14587001360493643,"score_gpt":0.3417906010138803,"score_spread":0.19592058740894389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847516220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005957263,0.0016669412,0.98237497,0.00075302244,0.0003465148,0.0015598608,0.00007118194,0.00020042318,0.012431364],"genre_scores_gemma":[0.0022229634,0.015203105,0.95001364,0.000060727412,0.0002276644,0.0001607957,0.000018342505,0.00010683623,0.031985957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974774,0.00005976816,0.00043322283,0.0007679598,0.00070023234,0.00056138606],"domain_scores_gemma":[0.9977645,0.00014326304,0.000025746556,0.00047345238,0.0012827051,0.0003102922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013427888,0.0003156076,0.00038910203,0.0007415664,0.0009874646,0.0009123167,0.00052267074,0.00017472307,0.00005567791],"category_scores_gemma":[0.000076056436,0.00033680012,0.000035678,0.0003153387,0.000989623,0.0010828439,0.00068557524,0.00049371127,0.000012187557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011826827,0.00001532956,4.9691334e-7,0.00010127346,0.00004575223,0.000001512433,0.0023244093,0.8992146,0.0007078204,0.0044788285,0.0016334231,0.09146471],"study_design_scores_gemma":[0.0001981193,0.00033261286,0.0000042192514,0.00030187814,0.000008439699,0.000031551725,0.000028257466,0.96553993,0.001575964,0.0012649095,0.030343179,0.00037092142],"about_ca_topic_score_codex":0.00001839686,"about_ca_topic_score_gemma":0.000080746286,"teacher_disagreement_score":0.09109379,"about_ca_system_score_codex":0.00023345917,"about_ca_system_score_gemma":0.00027624916,"threshold_uncertainty_score":0.9999084},"labels":[],"label_agreement":null},{"id":"W1848719272","doi":"10.1016/j.ejor.2015.10.046","title":"Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"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":"Pickup; FIFO and LIFO accounting; Benchmark (surveying); Computer science; Stack (abstract data type); Vehicle routing problem; Mathematical optimization; Travelling salesman problem; Position (finance); Shortest path problem; Path (computing); Algorithm; Routing (electronic design automation); Mathematics; Economics; FIFO (computing and electronics); Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.08679891004603106,"score_gpt":0.3286413364171116,"score_spread":0.2418424263710805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848719272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4769251,0.0042726733,0.510889,0.0027196144,0.00011987068,0.0010254922,0.00003121392,0.00004839282,0.003968616],"genre_scores_gemma":[0.73824215,0.0003578822,0.26024055,0.00006319056,0.00037423847,0.000004961522,0.0000041380454,0.000060290553,0.00065259944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867165,0.0003951192,0.00023223065,0.00010482116,0.0004216095,0.00017458454],"domain_scores_gemma":[0.99820375,0.00077121943,0.00003780011,0.00007840151,0.0007424372,0.00016641193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005060589,0.00008507576,0.00011488241,0.00010352253,0.00019906796,0.00022560694,0.00012332002,0.000016566288,0.000011200062],"category_scores_gemma":[0.0004771974,0.000055123688,0.000014252742,0.00012140482,0.00011619272,0.00025467706,0.000062860236,0.00030236,0.0000045514153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005453875,0.000053529686,0.004911725,0.00010472792,0.00029242272,0.000064062486,0.0041654417,0.8995574,0.0057525835,0.00037750544,0.008710803,0.07546442],"study_design_scores_gemma":[0.0031148372,0.00068253704,0.0074497242,0.000091751295,0.000019582258,0.0003539593,0.0002827639,0.9742057,0.00054889853,0.00008676143,0.013001113,0.00016238172],"about_ca_topic_score_codex":0.000002301379,"about_ca_topic_score_gemma":0.0000012535492,"teacher_disagreement_score":0.26131704,"about_ca_system_score_codex":0.00003364956,"about_ca_system_score_gemma":0.000096504795,"threshold_uncertainty_score":0.22478788},"labels":[],"label_agreement":null},{"id":"W1853087932","doi":"10.1016/j.ejor.2015.08.040","title":"Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":97,"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":"TRIPS architecture; Vehicle routing problem; Computer science; Mutual exclusion; Discretization; Set (abstract data type); Branch and price; Contrast (vision); Duration (music); Mathematical optimization; Dynamic programming; Routing (electronic design automation); Sequence (biology); Operations research; Algorithm; Integer programming; Mathematics; Theoretical computer science; Artificial intelligence; Parallel computing","score_opus":0.1111965887103439,"score_gpt":0.34816726863885056,"score_spread":0.23697067992850668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853087932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07417467,0.0007371271,0.9193482,0.0026122825,0.000158865,0.00072758907,0.000011412419,0.000026178424,0.0022036943],"genre_scores_gemma":[0.84267986,0.000020556694,0.15643334,0.00003023928,0.00026535187,0.0000048781953,0.0000013225457,0.000040170627,0.00052427483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978564,0.0008137525,0.00037008585,0.000090067566,0.0006671921,0.00020250237],"domain_scores_gemma":[0.9978849,0.00057391665,0.00010154138,0.00014041534,0.0012108231,0.00008840073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00966566,0.00008168927,0.00011960017,0.00007948889,0.00025772708,0.000099139055,0.00033410112,0.000018901517,0.000009811237],"category_scores_gemma":[0.0010165124,0.000045502755,0.000043148793,0.0003154542,0.000119262164,0.00020128708,0.000079307756,0.00039583858,0.000006248651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000925451,0.00003642259,0.0009931052,0.000026727064,0.00008228731,0.000003847543,0.001422594,0.97030216,0.014806491,0.0002421793,0.0012790681,0.010712575],"study_design_scores_gemma":[0.0016270085,0.00021801544,0.007770737,0.00010231785,0.000014970586,0.00007990412,0.00014519738,0.9846857,0.0032813412,0.000026523998,0.0019676504,0.0000805942],"about_ca_topic_score_codex":0.0000033119795,"about_ca_topic_score_gemma":9.577672e-7,"teacher_disagreement_score":0.7685052,"about_ca_system_score_codex":0.000073784395,"about_ca_system_score_gemma":0.00017623504,"threshold_uncertainty_score":0.3349944},"labels":[],"label_agreement":null},{"id":"W1876351940","doi":"10.1287/trsc.2014.0581","title":"Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Probability distribution; Set (abstract data type); Mathematics","score_opus":0.08101912272087147,"score_gpt":0.2989574792719695,"score_spread":0.217938356551098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876351940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32309464,0.000042580697,0.6765633,0.000029743125,0.00003207725,0.0001154449,0.000005383373,0.00008463965,0.000032162814],"genre_scores_gemma":[0.6890135,0.0000025761615,0.3109294,0.000011396941,0.000011599302,0.000010752867,0.0000028455152,0.000010087162,0.000007886822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932265,0.000006515533,0.0001364771,0.00018569207,0.00018473275,0.00016391704],"domain_scores_gemma":[0.9995535,0.000062430794,0.000027044607,0.000070019814,0.00016506188,0.000121963276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006124677,0.00008003444,0.0000924327,0.00006952761,0.000101700054,0.000057936366,0.00006323298,0.000023035538,5.204721e-7],"category_scores_gemma":[0.000038213322,0.00007243631,0.0000062965864,0.00030925713,0.00013751583,0.0005017748,0.0000020540506,0.0000411855,2.0785208e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005962385,0.0000022218508,0.0005309915,0.000013917251,0.0000018283134,3.0441961e-7,0.0014689974,0.9941004,0.000339338,0.0006636663,0.0000015715825,0.0028708258],"study_design_scores_gemma":[0.00045688922,0.000030863386,0.0034097577,0.000017976308,0.000011581677,0.0000026350804,0.00032329137,0.99482685,0.00045019423,0.00036387614,0.0000028413658,0.00010321562],"about_ca_topic_score_codex":0.000010554728,"about_ca_topic_score_gemma":0.000016283593,"teacher_disagreement_score":0.36591884,"about_ca_system_score_codex":0.000017292597,"about_ca_system_score_gemma":0.00004431998,"threshold_uncertainty_score":0.2953867},"labels":[],"label_agreement":null},{"id":"W1894418030","doi":"10.1002/atr.1235","title":"Multi‐objective airport gate assignment problem in planning and operations","year":2013,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maximization; Towing; Mathematical optimization; Computer science; Robustness (evolution); Assignment problem; Minification; Operations research; Function (biology); Engineering; Mathematics","score_opus":0.012207055737945564,"score_gpt":0.27083250160535066,"score_spread":0.2586254458674051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894418030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6331966,0.00014979456,0.36629453,0.00004132457,0.00008464168,0.00016778341,0.0000014882405,0.000022868766,0.00004093521],"genre_scores_gemma":[0.6223571,0.00004400532,0.37754303,0.000008811367,0.000013490887,0.00001036734,0.0000036732888,0.000011191107,0.000008357403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992522,0.000023775488,0.00043364323,0.00007111036,0.00011433685,0.000104913874],"domain_scores_gemma":[0.9996824,0.00003160552,0.00008276745,0.00004056513,0.00011015938,0.00005248304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018998861,0.00008503038,0.00014466066,0.00013687558,0.000029656558,0.0000208714,0.000036591708,0.000039232847,0.0000123720565],"category_scores_gemma":[0.000015282358,0.00008267741,0.000023870498,0.00013592608,0.000011231398,0.0006372572,8.0754e-7,0.00016793955,8.9694066e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006298964,0.000016274646,0.008349776,0.000020681635,0.000013482132,0.000006981971,0.0029151856,0.967757,0.016661987,0.00001453515,0.0000035102114,0.0042343247],"study_design_scores_gemma":[0.0013724919,0.00007347926,0.81341875,0.00018433903,0.000019315898,0.000011495545,0.0012516478,0.18016072,0.0031676027,0.00015880812,0.000034376404,0.00014695094],"about_ca_topic_score_codex":0.000006177052,"about_ca_topic_score_gemma":0.000017391703,"teacher_disagreement_score":0.80506897,"about_ca_system_score_codex":0.000060071798,"about_ca_system_score_gemma":0.000017451433,"threshold_uncertainty_score":0.3371487},"labels":[],"label_agreement":null},{"id":"W1895919608","doi":"10.1002/atr.1333","title":"A case study of Beijing bus crew scheduling: a variable neighborhood‐based approach","year":2015,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Beijing; Crew scheduling; Crew; Scheduling (production processes); Computer science; Variable (mathematics); Transport engineering; Operations research; Engineering; Aeronautics; Operations management; Mathematics; Geography; China","score_opus":0.03597201242362363,"score_gpt":0.2867550210488242,"score_spread":0.2507830086252006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895919608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51084775,0.00011315139,0.48865443,0.0000032906023,0.00014585102,0.00011787549,0.0000020302975,0.000031975127,0.000083644205],"genre_scores_gemma":[0.6121443,0.0000031783716,0.38778606,0.0000044223225,0.0000305586,0.0000033346748,0.000003961995,0.000022369035,0.0000018548646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985837,0.00006962315,0.0007648916,0.000105818006,0.00033236408,0.00014365626],"domain_scores_gemma":[0.9988411,0.00007996278,0.000357578,0.00013639756,0.00047608852,0.00010885988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066150184,0.00013669787,0.00032307772,0.00020679337,0.000032975244,0.000014681276,0.00009745416,0.00006221171,0.000004449524],"category_scores_gemma":[0.00009384998,0.00013633749,0.000061117855,0.0005044966,0.000011775379,0.00038850933,0.0000012744842,0.00023473823,2.1983537e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007855566,0.00024710695,0.0023374713,0.000090445574,0.00006203359,0.00022168891,0.0042316313,0.9891966,0.0015887031,0.000037747515,0.0000017803452,0.0019062639],"study_design_scores_gemma":[0.009699726,0.0010167147,0.002993532,0.00018381147,0.00040529633,0.0005827956,0.025845291,0.95689523,0.0017517075,0.00019377978,0.000051649273,0.00038048232],"about_ca_topic_score_codex":0.000011093871,"about_ca_topic_score_gemma":0.000004755614,"teacher_disagreement_score":0.10129653,"about_ca_system_score_codex":0.00006462662,"about_ca_system_score_gemma":0.00009413793,"threshold_uncertainty_score":0.55596817},"labels":[],"label_agreement":null},{"id":"W1902275675","doi":"10.1002/mcda.1516","title":"Multicriteria Optimization of A Long‐Haul Routing and Scheduling Problem","year":2014,"lang":"en","type":"article","venue":"Journal of Multi-Criteria Decision Analysis","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"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é du Québec à Montréal","funders":"HEC Montréal","keywords":"Tabu search; Scheduling (production processes); Truck; Vehicle routing problem; Computer science; Operations research; Economic shortage; Routing (electronic design automation); Job shop scheduling; Transport engineering; Engineering; Operations management; Computer network; Automotive engineering; Artificial intelligence","score_opus":0.020336022246136443,"score_gpt":0.3098093942348946,"score_spread":0.28947337198875817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902275675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25415996,0.00021880941,0.7452874,0.00002590736,0.00017256082,0.000066909626,0.0000034305867,0.000036850943,0.000028137069],"genre_scores_gemma":[0.4908423,0.00009800704,0.5089642,0.000012235042,0.00004978689,7.2923365e-7,0.0000029566786,0.000023603918,0.000006156551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973269,0.0002819873,0.001517482,0.00021338543,0.0004257329,0.00023450759],"domain_scores_gemma":[0.9977508,0.00051163463,0.0006196986,0.00028630896,0.00065264094,0.00017891859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027140183,0.00023251315,0.0008248511,0.00110835,0.0000800841,0.0001478507,0.0002516866,0.00014702734,0.00012141342],"category_scores_gemma":[0.0013083945,0.00021239846,0.0003046847,0.001214635,0.000045590245,0.00038303953,0.00007296658,0.00023031281,0.0000016236913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039481773,0.000052030267,0.0048343525,0.000047784713,0.00041122953,0.000005063846,0.00040748707,0.95981765,0.006989615,0.00000620807,0.000010261888,0.027378833],"study_design_scores_gemma":[0.0013140212,0.000051486648,0.0046475227,0.00019422774,0.0007160925,0.00003526291,0.00011349978,0.9909683,0.001719513,0.000021383574,0.000024383071,0.00019430248],"about_ca_topic_score_codex":0.0000065998615,"about_ca_topic_score_gemma":0.000005475062,"teacher_disagreement_score":0.23668236,"about_ca_system_score_codex":0.000059788683,"about_ca_system_score_gemma":0.000018409437,"threshold_uncertainty_score":0.8661358},"labels":[],"label_agreement":null},{"id":"W1925566585","doi":"10.1007/978-3-642-34413-8_19","title":"Vehicle Routing and Adaptive Iterated Local Search within the HyFlex Hyper-heuristic Framework","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"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":"Engineering and Physical Sciences Research Council","keywords":"Heuristics; Computer science; Iterated local search; Vehicle routing problem; Domain (mathematical analysis); Heuristic; Routing (electronic design automation); Incremental heuristic search; Local search (optimization); Mathematical optimization; Search algorithm; Artificial intelligence; Beam search; Algorithm; Mathematics","score_opus":0.024266817398528522,"score_gpt":0.26166402899121416,"score_spread":0.23739721159268565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1925566585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014205148,0.00095243746,0.9957475,0.00011812694,0.0007218563,0.0002505111,0.0000043137384,0.00019371179,0.0005910429],"genre_scores_gemma":[0.67265236,0.000018678487,0.32669446,0.00021242164,0.0003370916,0.0000029045382,0.0000017064791,0.00005029321,0.00003007979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801856,0.00008613542,0.0003578369,0.00052924064,0.00049490586,0.00051331596],"domain_scores_gemma":[0.99792624,0.0012287906,0.00008294909,0.00049071916,0.00013734479,0.00013393727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014260006,0.00036434218,0.00032734318,0.00022212893,0.00026956532,0.00025822004,0.00061387505,0.0003325301,0.00002030929],"category_scores_gemma":[0.00018213356,0.0002883949,0.000041544572,0.0004213003,0.00074500864,0.00017421992,0.0003501996,0.001505108,0.000016527481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037948641,0.000003042885,0.00015051184,0.000020162186,0.000009076029,0.0000061349438,0.0015487362,0.8037772,0.000060806957,0.0021483835,0.0000012668684,0.19227083],"study_design_scores_gemma":[0.00008908401,0.000036088797,0.00023480848,0.00034654266,0.000012639848,0.000034744782,0.000001903338,0.99152225,0.0006008961,0.0067510204,0.000038688344,0.00033132834],"about_ca_topic_score_codex":0.000012384701,"about_ca_topic_score_gemma":0.000006941444,"teacher_disagreement_score":0.67123187,"about_ca_system_score_codex":0.00019763637,"about_ca_system_score_gemma":0.00010137191,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W1931616235","doi":"10.1287/opre.2015.1401","title":"Benders Decomposition for Production Routing Under Demand Uncertainty","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":214,"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; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematical optimization; Production (economics); Routing (electronic design automation); Generalization; Branch and cut; Stochastic programming; Computer science; Pareto principle; Benders' decomposition; Upper and lower bounds; Exploit; Decomposition method (queueing theory); Decomposition; Time horizon; Mathematics; Linear programming; Economics","score_opus":0.16131367666491017,"score_gpt":0.438498401075115,"score_spread":0.2771847244102048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1931616235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1363008,0.00006988941,0.8594272,0.001142014,0.00032555414,0.0006708321,0.0000062433587,0.00021959085,0.0018378438],"genre_scores_gemma":[0.8794162,0.000013264602,0.119468175,0.000015929103,0.00023272149,0.00016691082,0.00007651555,0.00003226972,0.000577968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878865,0.0002226903,0.00019026348,0.00020036616,0.00029836988,0.0002996728],"domain_scores_gemma":[0.99888754,0.000121253564,0.0000061447076,0.00020604496,0.00066953845,0.000109490735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025238812,0.00008183222,0.00008827205,0.00018881644,0.00040138405,0.00015029384,0.00010351436,0.00007124522,0.000017138245],"category_scores_gemma":[0.0006600243,0.000085680564,0.000025531102,0.0004707755,0.000058285044,0.00026484035,0.000026003478,0.00019983154,0.000026131253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007723458,0.0000151619315,0.000053455442,0.000013537885,0.000013620351,1.5570659e-7,0.0005959082,0.9890614,0.0047064694,0.0022039101,0.0019479342,0.0013807017],"study_design_scores_gemma":[0.0002925481,0.000037966285,0.00008591691,0.00001503056,0.000005127246,0.0000044669064,0.001270547,0.99117357,0.0059747063,0.0004792334,0.00055955193,0.00010135937],"about_ca_topic_score_codex":0.000042035943,"about_ca_topic_score_gemma":0.00011805701,"teacher_disagreement_score":0.7431154,"about_ca_system_score_codex":0.00032903408,"about_ca_system_score_gemma":0.0001106096,"threshold_uncertainty_score":0.34939522},"labels":[],"label_agreement":null},{"id":"W1942124306","doi":"","title":"Moving freight inside cross docking terminals","year":2010,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Transshipment (information security); Consolidation (business); Computer science; Transport engineering; Business; Engineering; Computer security","score_opus":0.010702323404576953,"score_gpt":0.2574174238216123,"score_spread":0.24671510041703537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1942124306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50450546,0.00021851563,0.48942608,0.00021136498,0.00042914823,0.00029339062,0.000014962107,0.0023198857,0.0025812087],"genre_scores_gemma":[0.6622913,0.000040716437,0.33648136,0.00039881494,0.000258376,0.00013558366,0.000009786912,0.00013333008,0.00025072802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975968,0.000101103054,0.0006344497,0.00042641634,0.0003455167,0.00089568907],"domain_scores_gemma":[0.9981484,0.00022767951,0.00014215725,0.0010020446,0.00013326442,0.00034649333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011176699,0.0004222313,0.0003956385,0.00046264654,0.0003089869,0.00042691245,0.00061391195,0.00046976723,0.0001492387],"category_scores_gemma":[0.00054279185,0.0004671767,0.00016551057,0.00061967137,0.00009814432,0.00057082745,0.00018796393,0.0011272876,0.00003617351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021311671,0.000089479465,0.1343917,0.000120144476,0.00007471811,0.00012548086,0.0005660593,0.5743056,0.2281294,0.0066566477,0.0010121905,0.0545073],"study_design_scores_gemma":[0.0003525629,0.000024132758,0.047701485,0.000051308467,0.000022259479,0.00019401367,0.000029186875,0.8424141,0.10441374,0.00095476274,0.003233222,0.00060925394],"about_ca_topic_score_codex":0.0008250057,"about_ca_topic_score_gemma":0.0007816365,"teacher_disagreement_score":0.26810852,"about_ca_system_score_codex":0.00022916491,"about_ca_system_score_gemma":0.00008858072,"threshold_uncertainty_score":0.999778},"labels":[],"label_agreement":null},{"id":"W1963745567","doi":"10.1002/atr.5670430205","title":"A multiobjective model for maximizing fleet availability under the presence of flight and maintenance requirements","year":2009,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"State Scholarships Foundation","keywords":"Heuristics; Aircraft maintenance; Operations research; Heuristic; Unit (ring theory); Computer science; Engineering; Reliability engineering; Aeronautics; Artificial intelligence; Mathematics","score_opus":0.02348607832181985,"score_gpt":0.2932145094591439,"score_spread":0.26972843113732403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963745567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31272516,0.00012050444,0.6867497,0.00012838938,0.000069646434,0.00016829224,0.0000081067665,0.0000125859315,0.000017622588],"genre_scores_gemma":[0.7248165,0.000090557856,0.27503622,0.00002185504,0.000013304245,0.000003016442,0.0000016568039,0.000007686222,0.000009217749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918306,0.00002374688,0.000451001,0.00008277301,0.0001500328,0.00010940216],"domain_scores_gemma":[0.9992453,0.00012329969,0.00023166838,0.00008911805,0.00027877244,0.000031843098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043764687,0.000084099556,0.00016458749,0.00004834101,0.00004260019,0.0000076183646,0.00007771237,0.000035086505,0.0000012215387],"category_scores_gemma":[0.000075198666,0.00006511526,0.000057411547,0.00010770411,0.000030147548,0.00037225708,8.286327e-7,0.00010223091,3.9534363e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116751435,0.000017441596,0.0001555132,0.000040724666,0.000018583758,3.6470868e-7,0.0017641,0.969456,0.02263904,0.00034496182,0.000007757471,0.005438723],"study_design_scores_gemma":[0.001389895,0.00012400984,0.06057522,0.00013913999,0.000056867986,0.000003403007,0.00061574037,0.91932005,0.0116788065,0.0059712697,0.000020524965,0.000105071005],"about_ca_topic_score_codex":5.7358e-7,"about_ca_topic_score_gemma":0.000005413288,"teacher_disagreement_score":0.41209134,"about_ca_system_score_codex":0.00004415062,"about_ca_system_score_gemma":0.000019892292,"threshold_uncertainty_score":0.2655323},"labels":[],"label_agreement":null},{"id":"W1964030714","doi":"10.3166/jesa.41.515-539","title":"Plateforme de simulation pour la gestion dynamique de tournées de véhicules","year":2007,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.018759304805718056,"score_gpt":0.2875165309613185,"score_spread":0.26875722615560044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964030714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31319645,0.002105555,0.67969596,0.00070238905,0.00052935246,0.00014870432,0.000010305738,0.00045545178,0.003155808],"genre_scores_gemma":[0.55546755,0.0005836097,0.44130325,0.0000519014,0.0006810169,0.0000027947078,0.000003928767,0.00013959379,0.001766371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951073,0.0016963427,0.0011907174,0.00026822963,0.00043952974,0.0012978653],"domain_scores_gemma":[0.9963093,0.0019302042,0.00054091046,0.0002597213,0.00034566261,0.00061423593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008365417,0.00047181384,0.00048007397,0.00046347803,0.00055451895,0.0005903731,0.0003498866,0.0006764968,0.00028285568],"category_scores_gemma":[0.0024478422,0.00051578,0.00024964422,0.00054245704,0.00013420625,0.0007824299,0.000068669215,0.0013555551,0.00011891645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021950815,0.000059665756,0.008620568,0.00041196242,0.00012471108,0.00047001944,0.0024175365,0.7005588,0.0034450903,0.001705536,0.00023548192,0.2819287],"study_design_scores_gemma":[0.00048032813,0.00005747801,0.3254616,0.0012944948,0.00011461154,0.005676325,0.0001700452,0.6610884,0.0008400527,0.0035391767,0.0009369833,0.00034051604],"about_ca_topic_score_codex":0.00020089027,"about_ca_topic_score_gemma":0.00008078091,"teacher_disagreement_score":0.31684104,"about_ca_system_score_codex":0.0037914487,"about_ca_system_score_gemma":0.00042356184,"threshold_uncertainty_score":0.9997294},"labels":[],"label_agreement":null},{"id":"W1965407067","doi":"10.1139/x04-043","title":"An optimization model for annual harvest planning","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Production (economics); Integer programming; Operations research; Variable (mathematics); Computer science; Operations management; Mathematics; Engineering; Economics","score_opus":0.0747447326903002,"score_gpt":0.36674385567754997,"score_spread":0.2919991229872498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965407067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12021614,0.00015876582,0.87885725,0.00015171428,0.00013270223,0.00014071123,0.00003561817,0.000020893805,0.0002862168],"genre_scores_gemma":[0.67292696,0.0000070767396,0.32676968,0.000015115207,0.00017196932,0.000005201017,0.000010150149,0.000040982985,0.000052849846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877816,0.000063545405,0.00029552917,0.0000985389,0.00025952808,0.0005046814],"domain_scores_gemma":[0.99819607,0.000084877356,0.0000441657,0.00015812334,0.0007768599,0.0007399101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017349343,0.00009239229,0.00014194564,0.00071359973,0.00023571833,0.00014997809,0.00033204962,0.00010224466,0.000014027545],"category_scores_gemma":[0.00042713038,0.00009793661,0.000049234655,0.000360105,0.000075867974,0.0005418432,0.000005283073,0.00039548465,0.0000018975711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008836923,0.0000055350843,0.0027291735,0.000020462074,0.000012687001,0.000023882607,0.0011447587,0.9942984,0.000037238227,0.00083298184,0.00045155143,0.00043448637],"study_design_scores_gemma":[0.0005233718,0.00013981538,0.0014021304,0.00007160578,0.000005168198,0.000040794373,0.00023285254,0.99598014,0.00010099742,0.0011718123,0.00022910297,0.000102223225],"about_ca_topic_score_codex":0.00037768285,"about_ca_topic_score_gemma":0.005560887,"teacher_disagreement_score":0.55271083,"about_ca_system_score_codex":0.00041968134,"about_ca_system_score_gemma":0.0012938193,"threshold_uncertainty_score":0.3993739},"labels":[],"label_agreement":null},{"id":"W1965882376","doi":"10.1016/j.cor.2013.08.016","title":"An adaptive large neighborhood search for a vehicle routing problem with multiple routes","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":183,"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; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Operations research; Computer network; Mathematics","score_opus":0.04793811169959512,"score_gpt":0.336181081294404,"score_spread":0.2882429695948089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965882376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118853204,0.00004093297,0.8780819,0.00027585955,0.000058308065,0.0018230686,0.000025212736,0.00039022308,0.00045128362],"genre_scores_gemma":[0.62039495,0.0000039554848,0.3788465,0.000026819158,0.00011353369,0.00043459955,0.000047267196,0.000060672774,0.000071727605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750674,0.000417494,0.00030561493,0.000431734,0.00046276642,0.00087565795],"domain_scores_gemma":[0.9975402,0.00060075044,0.000011986489,0.00048000022,0.0011192346,0.000247825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014686998,0.00020074322,0.00021695375,0.00030397673,0.00082405633,0.00068991404,0.0004556966,0.00010366245,0.000054658685],"category_scores_gemma":[0.00008252114,0.00018511181,0.00004464507,0.0008439549,0.00008453708,0.0008378802,0.00011488696,0.0004897107,0.000070136506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017772181,0.00010821918,0.0024665317,0.000035212914,0.000050295104,0.0000014520947,0.0018882275,0.9772924,0.0043412186,0.003312479,0.00039544486,0.010090713],"study_design_scores_gemma":[0.0010172294,0.00040937675,0.0016382858,0.00005469389,0.0000050564568,0.0000037085047,0.000904181,0.9921572,0.0034341186,0.000046169054,0.00009431607,0.00023564977],"about_ca_topic_score_codex":0.00019639308,"about_ca_topic_score_gemma":0.00011962113,"teacher_disagreement_score":0.50154173,"about_ca_system_score_codex":0.0001795378,"about_ca_system_score_gemma":0.00013945595,"threshold_uncertainty_score":0.7548641},"labels":[],"label_agreement":null},{"id":"W1965979685","doi":"10.1002/net.21519","title":"The split delivery capacitated team orienteering problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Orienteering; Computer science; Operations research; Profit (economics); Mathematical optimization; Set (abstract data type); Benchmark (surveying); Mathematics; Economics; Microeconomics","score_opus":0.006827192193179859,"score_gpt":0.197415121976764,"score_spread":0.19058792978358413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965979685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1389006,0.0013795935,0.82063824,0.0001470975,0.0014300597,0.0007371715,0.0000013564253,0.0017059325,0.035059933],"genre_scores_gemma":[0.9245048,0.00023177746,0.073979,0.00006689265,0.000293876,0.00010209844,0.0000067312476,0.00007308194,0.00074170256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991633,0.000048637598,0.00020971007,0.00011920116,0.00010567656,0.00035343936],"domain_scores_gemma":[0.99942714,0.00016485184,0.000027478478,0.00023480518,0.00007605836,0.00006967076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028111847,0.00012335423,0.0000978355,0.000024262286,0.00016766888,0.0001260699,0.00016918567,0.00008733561,0.000058734466],"category_scores_gemma":[0.00002723935,0.00009697633,0.00003542706,0.0002493503,0.000033489112,0.0001318767,0.000033783286,0.00026124818,0.00008009373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010005143,0.0000025557192,0.00040677117,0.000006498534,0.000019601956,3.680266e-7,0.00009935925,0.9555528,0.00011976691,0.00024796516,0.009038494,0.03450478],"study_design_scores_gemma":[0.00010158613,0.0000072806856,0.00076129194,0.000020878488,0.000005635731,0.0000030902386,0.000051650717,0.9891948,0.000078517005,0.000121388926,0.009532026,0.000121815756],"about_ca_topic_score_codex":0.000024364837,"about_ca_topic_score_gemma":0.000005468794,"teacher_disagreement_score":0.78560424,"about_ca_system_score_codex":0.00005686497,"about_ca_system_score_gemma":0.000006091879,"threshold_uncertainty_score":0.395458},"labels":[],"label_agreement":null},{"id":"W1966716113","doi":"10.1016/j.ejor.2006.02.019","title":"An exact algorithm for a single-vehicle routing problem with time windows and multiple routes","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":203,"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":"Vehicle routing problem; Benchmark (surveying); Computer science; Set (abstract data type); Shortest path problem; Routing (electronic design automation); Mathematical optimization; Path (computing); Algorithm; Euclidean geometry; Mathematics; Theoretical computer science; Graph","score_opus":0.04058463769978288,"score_gpt":0.30744635570674017,"score_spread":0.2668617180069573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966716113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22839937,0.00019251627,0.7662514,0.00024377438,0.000044577013,0.00044030274,0.000022622058,0.0000757535,0.0043297037],"genre_scores_gemma":[0.58465,0.0000037438538,0.41473514,0.0000102138865,0.0003741667,0.000002078308,0.000011780658,0.000052462365,0.00016045145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979326,0.0006426281,0.000428427,0.00015961191,0.00053135294,0.00030538783],"domain_scores_gemma":[0.9983571,0.0005001691,0.00007268193,0.00011390698,0.00082382275,0.00013228823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004591458,0.00012499117,0.00016669635,0.00020274031,0.00026316952,0.0003546281,0.00019845417,0.000024718369,0.000026119767],"category_scores_gemma":[0.00021362015,0.000104035746,0.00003385892,0.0002364915,0.00007356752,0.0005160838,0.000029163652,0.00032552634,0.000008615417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006902608,0.000118747674,0.0017875623,0.000024244497,0.000046515503,0.000059634087,0.0003243655,0.8313988,0.1244668,0.00015253609,0.0005174119,0.041034393],"study_design_scores_gemma":[0.0014070156,0.0006896286,0.0035187134,0.00008316957,0.000008242731,0.0001600176,0.00006427254,0.9861697,0.0068179048,0.000035100322,0.00089754496,0.00014868514],"about_ca_topic_score_codex":0.000005752064,"about_ca_topic_score_gemma":0.0000019793229,"teacher_disagreement_score":0.3562506,"about_ca_system_score_codex":0.00008045208,"about_ca_system_score_gemma":0.00007121646,"threshold_uncertainty_score":0.42424548},"labels":[],"label_agreement":null},{"id":"W1967987311","doi":"10.1016/j.cor.2010.01.004","title":"The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Galatasaray Üniversitesi","keywords":"Bounding overwatch; Minimum spanning tree; Tabu search; Spanning tree; Mathematics; Quadratic equation; k-minimum spanning tree; Heuristic; Mathematical optimization; Euclidean minimum spanning tree; Relaxation (psychology); Distributed minimum spanning tree; Local search (optimization); Algorithm; Kruskal's algorithm; Combinatorics; Computer science; Tree structure; Binary tree; Artificial intelligence","score_opus":0.0356672783289809,"score_gpt":0.36152426615279576,"score_spread":0.32585698782381484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967987311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46145228,0.0001403681,0.53544754,0.0008331046,0.0004904706,0.00082382077,0.000003325977,0.00024876508,0.00056035543],"genre_scores_gemma":[0.5878951,0.000022295071,0.41139385,0.000016509899,0.00027151318,0.000097151664,0.000010326209,0.00005140859,0.00024182709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977743,0.000370332,0.00030579267,0.00035944473,0.00056114985,0.00062898523],"domain_scores_gemma":[0.9984013,0.00048580187,0.000010242639,0.0004699593,0.00040517093,0.00022751288],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003257831,0.00016620728,0.0001478937,0.00027523967,0.0017373157,0.0013712826,0.00043175978,0.00010763323,0.00001434065],"category_scores_gemma":[0.00020994058,0.00013564108,0.00002985284,0.00078655157,0.00028712294,0.00022590603,0.00018170722,0.0010449376,0.000019637164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054798747,0.0000629436,0.000111749025,0.000050128227,0.0000263504,0.000009282191,0.003574192,0.9156355,0.009653236,0.0015941713,0.00044335664,0.068833575],"study_design_scores_gemma":[0.00023643885,0.000085435364,0.00033465412,0.000039663668,0.0000040887044,0.00003080897,0.00041538372,0.99746895,0.0006518,0.000035349658,0.00053932547,0.00015810056],"about_ca_topic_score_codex":0.000027983422,"about_ca_topic_score_gemma":0.0001553344,"teacher_disagreement_score":0.12644282,"about_ca_system_score_codex":0.00007954199,"about_ca_system_score_gemma":0.00017431969,"threshold_uncertainty_score":0.9996654},"labels":[],"label_agreement":null},{"id":"W1969119890","doi":"10.1016/j.orl.2014.10.001","title":"Decomposition theorems for linear programs","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Linear programming; Bounded function; Decomposition; Residual; Class (philosophy); Applied mathematics; Combinatorics; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis","score_opus":0.05506757424898105,"score_gpt":0.39056686560416604,"score_spread":0.33549929135518497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969119890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11100874,0.000010334332,0.88494676,0.002184267,0.00011663838,0.0005454686,0.00000392196,0.00023461385,0.0009492801],"genre_scores_gemma":[0.5528152,0.0000075114044,0.44599116,0.00021539316,0.00031347378,0.0003879057,0.00011329101,0.000046951685,0.00010912489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989036,0.0002407847,0.0001572113,0.00015554459,0.00022078113,0.00032207847],"domain_scores_gemma":[0.99930125,0.00021051918,0.00000436454,0.00023133277,0.00017856558,0.00007398139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016442754,0.00008033437,0.00008488332,0.00015574579,0.00032995397,0.0001675522,0.00015658945,0.00004795761,0.00002583593],"category_scores_gemma":[0.00024277325,0.000079495505,0.000038611706,0.0003108595,0.00007153864,0.00015365769,0.000020252248,0.00019303217,0.000052168205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037227835,0.000015902067,0.000046818124,0.000022715532,0.000011891488,2.0814748e-7,0.00015033287,0.9198787,0.057268817,0.0043551023,0.0014485976,0.016797177],"study_design_scores_gemma":[0.00022433484,0.000044126846,0.000046609755,0.000015485364,0.000002746924,0.0000015216425,0.000021053736,0.9821484,0.007610175,0.000081432045,0.00970979,0.000094312934],"about_ca_topic_score_codex":0.000010168614,"about_ca_topic_score_gemma":0.000013699363,"teacher_disagreement_score":0.44180644,"about_ca_system_score_codex":0.00007106422,"about_ca_system_score_gemma":0.000012625024,"threshold_uncertainty_score":0.32417327},"labels":[],"label_agreement":null},{"id":"W1969420428","doi":"10.4236/ti.2013.41b013","title":"Heterogeneous Fleet Vehicle Routing Problem with Selec-tion of Inter-Depots","year":2013,"lang":"en","type":"article","venue":"Technology and Investment","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Routing (electronic design automation); Vehicle routing problem; Operations research; Transport engineering; Computer network; Mathematics; Engineering","score_opus":0.007930304799182148,"score_gpt":0.21131050886032393,"score_spread":0.2033802040611418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969420428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.957033,0.00020051531,0.040718254,0.0001968585,0.000026794143,0.0002728541,8.4981224e-7,0.0005603514,0.0009905527],"genre_scores_gemma":[0.9050645,0.00001429662,0.0947415,0.000073699535,0.0000064755227,0.00005235513,0.0000018612476,0.00001929621,0.000026012069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994215,0.000021417463,0.00019406664,0.00013594994,0.000052393953,0.0001747054],"domain_scores_gemma":[0.9996978,0.000014983855,0.00005111544,0.00015822986,0.00004390215,0.000033937642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009551648,0.00010990882,0.00014574372,0.00016413604,0.000040594437,0.000010972805,0.00007713805,0.00012944793,0.000019443049],"category_scores_gemma":[0.000013298621,0.000096199044,0.000011943946,0.00026756607,0.00010280079,0.00007985253,0.000042869757,0.00012559112,0.00000846224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039894698,0.00028480616,0.077804595,0.0007012862,0.0006808507,0.000022869828,0.0022063148,0.43242577,0.25094408,0.08994264,0.0007576047,0.14418931],"study_design_scores_gemma":[0.0010613875,0.0006477068,0.0026542165,0.00022142782,0.000049282822,0.00013812809,0.00026261492,0.606511,0.3731173,0.014442356,0.00044423674,0.00045034706],"about_ca_topic_score_codex":0.000009044139,"about_ca_topic_score_gemma":0.000002598339,"teacher_disagreement_score":0.17408524,"about_ca_system_score_codex":0.000031746826,"about_ca_system_score_gemma":0.0000069702455,"threshold_uncertainty_score":0.3922883},"labels":[],"label_agreement":null},{"id":"W1969471641","doi":"10.1016/j.orl.2006.11.004","title":"Interior point stabilization for column generation","year":2006,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":112,"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; Polytechnique Montréal","funders":"","keywords":"Column generation; Degeneracy (biology); Convergence (economics); Interior point method; Acceleration; Point (geometry); Mathematical optimization; Column (typography); Vehicle routing problem; Computer science; Dual (grammatical number); Space (punctuation); Extreme point; Mathematics; Routing (electronic design automation); Algorithm; Control theory (sociology); Combinatorics; Physics; Geometry; Artificial intelligence; Telecommunications; Classical mechanics","score_opus":0.06313064214832748,"score_gpt":0.35427776294184643,"score_spread":0.29114712079351895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969471641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25048763,0.000029339762,0.7460912,0.0019392547,0.00018691731,0.0006539669,0.00002042088,0.0001735461,0.00041771235],"genre_scores_gemma":[0.7853243,0.000013049751,0.2123996,0.0001953456,0.000593296,0.000571277,0.000386643,0.00006547832,0.00045102063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874103,0.00019320744,0.00027958388,0.00020404015,0.00026385084,0.00031826418],"domain_scores_gemma":[0.9992762,0.00011249329,0.00000817448,0.00023366089,0.00032163327,0.000047842677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010740784,0.00009833364,0.00009917281,0.0002475362,0.00038136225,0.00032076373,0.00012663037,0.000057692178,0.00010492085],"category_scores_gemma":[0.00024090277,0.000110403154,0.00003892825,0.00043805336,0.000060589475,0.00032572917,0.000023285893,0.00015263517,0.000028919147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018731488,0.000007935354,0.00005009962,0.000013111255,0.0000048115876,3.1864468e-7,0.0000765884,0.6526779,0.32870495,0.00085179356,0.016939392,0.000671241],"study_design_scores_gemma":[0.0002651889,0.000024427878,0.00014757598,0.000008796923,0.0000034233515,0.0000015335396,0.000039989554,0.9556984,0.03907451,0.000025529183,0.004591843,0.00011882346],"about_ca_topic_score_codex":0.00008696848,"about_ca_topic_score_gemma":0.00037780797,"teacher_disagreement_score":0.53483665,"about_ca_system_score_codex":0.00025261374,"about_ca_system_score_gemma":0.00003548001,"threshold_uncertainty_score":0.45021102},"labels":[],"label_agreement":null},{"id":"W1969506670","doi":"10.1016/j.dam.2015.01.035","title":"The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian path; Mathematics; Minimum-cost flow problem; Hamiltonian (control theory); Hamiltonian path problem; Combinatorics; Integer programming; Shortest path problem; Graph; Mathematical optimization; Flow network; Discrete mathematics","score_opus":0.036546015957150124,"score_gpt":0.3037352396843029,"score_spread":0.26718922372715276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969506670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01617683,0.000091561575,0.93344134,0.00009154057,0.000099204604,0.0007576565,0.000020949656,0.00030039335,0.049020514],"genre_scores_gemma":[0.44304246,0.0000052005284,0.55674607,0.0000066942644,0.000022087732,0.000072157294,0.0000145678505,0.00004163827,0.000049132675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887013,0.000015705842,0.0005141003,0.00010211028,0.00025902013,0.00023893258],"domain_scores_gemma":[0.9990587,0.000246679,0.00012642215,0.00039429063,0.00007651916,0.00009736907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654545,0.00015102679,0.00026008007,0.00004355664,0.00011040036,0.000050101706,0.00022997249,0.00007334437,0.000005975341],"category_scores_gemma":[0.000077782235,0.0001171672,0.000047868158,0.00024046964,0.000064906846,0.000053733726,0.000052641084,0.00012976612,0.000026231119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006322064,0.000048914244,0.00010176707,0.00016718304,0.000053480704,1.6810796e-7,0.007872124,0.93767875,0.0012615955,0.044510797,0.0011294171,0.0071694893],"study_design_scores_gemma":[0.00033260818,0.000012179763,0.000039131228,0.000026318612,0.000032288073,0.0000011515756,0.0013380283,0.9797326,0.002481117,0.014814863,0.001047066,0.0001426788],"about_ca_topic_score_codex":0.0000014796577,"about_ca_topic_score_gemma":0.000008987568,"teacher_disagreement_score":0.42686564,"about_ca_system_score_codex":0.000048448546,"about_ca_system_score_gemma":0.00002624474,"threshold_uncertainty_score":0.47779396},"labels":[],"label_agreement":null},{"id":"W1969579058","doi":"10.1287/trsc.1040.0106","title":"The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Arc routing; Column generation; Mathematical optimization; Minimum-cost flow problem; Profit (economics); Integer programming; Limiting; Directed graph; Arc (geometry); Branch and price; Mathematics; Graph; Computer science; Flow network; Algorithm; Routing (electronic design automation); Economics; Engineering; Combinatorics","score_opus":0.011446536960808825,"score_gpt":0.249086160234552,"score_spread":0.23763962327374316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969579058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08145272,0.000118653275,0.91601783,0.00042424575,0.000053494292,0.00024577562,0.000003560614,0.00024123039,0.0014425017],"genre_scores_gemma":[0.63497657,0.00003645447,0.36470237,0.000030731753,0.00002627518,0.000027805327,0.0000023541263,0.000011485729,0.00018592867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990262,0.000014206403,0.00018003181,0.00018367429,0.00032663025,0.00026926718],"domain_scores_gemma":[0.9995896,0.000048222275,0.00003879891,0.00013368175,0.00011875179,0.00007093185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007940785,0.00008845321,0.000070002905,0.00006058588,0.00036710245,0.00009386145,0.00015524752,0.000023964436,0.000010782356],"category_scores_gemma":[0.000013024006,0.0000639808,0.000011511157,0.00070453517,0.00019245481,0.0005811567,0.000002431368,0.000094046016,0.000007334153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011628413,0.000017643008,0.0027875688,0.000040527117,0.000011221155,0.0000011231589,0.0031815127,0.6802675,0.017119529,0.0026082455,0.00009373059,0.29385975],"study_design_scores_gemma":[0.00040079313,0.000033467706,0.057564545,0.000030195375,0.000014431053,0.00000769164,0.00010730801,0.9277228,0.010916169,0.00021646504,0.0027752283,0.00021091568],"about_ca_topic_score_codex":0.000012670316,"about_ca_topic_score_gemma":0.00008075431,"teacher_disagreement_score":0.55352384,"about_ca_system_score_codex":0.00004570938,"about_ca_system_score_gemma":0.00006245802,"threshold_uncertainty_score":0.28234923},"labels":[],"label_agreement":null},{"id":"W1969909704","doi":"10.1016/j.ejor.2012.02.010","title":"A new exact discrete linear reformulation of the quadratic assignment problem","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Academy of Finland; Polytechnique Montréal; University of Pennsylvania","keywords":"Quadratic assignment problem; Linear programming; Mathematical optimization; Integer programming; Mathematics; Quadratic equation; Quadratic programming; Combinatorial optimization; Assignment problem; Computer science","score_opus":0.08035879040295515,"score_gpt":0.3671476523560229,"score_spread":0.28678886195306774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969909704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14570971,0.0005570773,0.8246397,0.0015819778,0.00050532265,0.00043562343,0.0000056676577,0.000029681143,0.026535252],"genre_scores_gemma":[0.8757239,0.000021884329,0.12309303,0.000012934314,0.00048578926,7.4299453e-7,0.0000017120344,0.000028584556,0.0006314344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708164,0.0011637191,0.0005376035,0.000057005607,0.0009391898,0.00022085193],"domain_scores_gemma":[0.99900824,0.00018861507,0.00010754657,0.00016428264,0.00038653417,0.0001448003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064693037,0.000079732294,0.000118359836,0.00013224037,0.000120855526,0.000047400532,0.00029048423,0.000019320907,0.00017041193],"category_scores_gemma":[0.0005021537,0.00005132693,0.00006783713,0.00033108154,0.000036621124,0.00038985914,0.00006716674,0.00042906636,0.000025645959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032110067,0.00003972838,0.0033919015,0.00004223644,0.00006241017,0.000002930698,0.0016369028,0.9535112,0.02887193,0.0020893547,0.0028441045,0.0074752173],"study_design_scores_gemma":[0.0037451908,0.0010028216,0.25058874,0.001151692,0.00008428235,0.00029924163,0.0007472865,0.6235558,0.08027538,0.0005641452,0.03727231,0.0007131194],"about_ca_topic_score_codex":0.0000022725292,"about_ca_topic_score_gemma":3.604747e-7,"teacher_disagreement_score":0.73001415,"about_ca_system_score_codex":0.00012932613,"about_ca_system_score_gemma":0.00014137852,"threshold_uncertainty_score":0.22421445},"labels":[],"label_agreement":null},{"id":"W1970355999","doi":"10.1287/opre.1050.0234","title":"Selected Topics in Column Generation","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1084,"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":"Column generation; Column (typography); Perspective (graphical); Integer programming; Computer science; Dual (grammatical number); Linear programming; Decomposition; Point (geometry); Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Algorithm","score_opus":0.08886315424571074,"score_gpt":0.393188984849525,"score_spread":0.3043258306038143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970355999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8878965,0.00019493903,0.095174156,0.0019945889,0.00013622786,0.00051372265,0.0000050609947,0.00026100286,0.01382385],"genre_scores_gemma":[0.84629667,0.00007394569,0.1492654,0.00002663841,0.00041238486,0.0000882588,0.0000391667,0.00002269407,0.0037748846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990349,0.00020893157,0.00017928099,0.00012200078,0.00021770144,0.0002371774],"domain_scores_gemma":[0.9994796,0.000040061223,0.000002208469,0.0001693464,0.00026382162,0.00004496438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078355893,0.000054552267,0.000066657674,0.00024607196,0.00015194686,0.00012602189,0.00010183201,0.00006981999,0.00026230206],"category_scores_gemma":[0.00028149862,0.000063129315,0.000009377187,0.0011237588,0.000020997839,0.00019315613,0.000020324442,0.00028865633,0.00011838752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.6544826e-7,0.00001710715,0.0004029769,0.0000035929063,0.0000026267476,6.6794706e-7,0.0002772106,0.96837544,0.016759647,0.00062135473,0.0020490289,0.0114897825],"study_design_scores_gemma":[0.00015168157,0.000009975788,0.0015445488,0.00000409481,5.749879e-7,0.000001464266,0.00002119201,0.97894037,0.010235224,0.0000040896025,0.009021394,0.00006537659],"about_ca_topic_score_codex":0.000048499205,"about_ca_topic_score_gemma":0.002064953,"teacher_disagreement_score":0.054091226,"about_ca_system_score_codex":0.0002127083,"about_ca_system_score_gemma":0.00007154743,"threshold_uncertainty_score":0.28720236},"labels":[],"label_agreement":null},{"id":"W1970402125","doi":"10.1016/j.disopt.2013.07.005","title":"A computational comparison of flow formulations for the capacitated location-routing problem","year":2013,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":58,"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; HEC Montréal; Transport Canada; École de Technologie Supérieure; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Flow (mathematics); Mathematical optimization; Index (typography); Routing (electronic design automation); Mathematics; Flow routing; Scale (ratio); Computer science; Algorithm; Engineering","score_opus":0.023063067758610504,"score_gpt":0.2875200500293179,"score_spread":0.2644569822707074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970402125","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012497966,0.000075727614,0.9964208,0.00022000128,0.00011517401,0.0010774598,0.000024791128,0.00021397122,0.00060225074],"genre_scores_gemma":[0.48658404,0.0000031371358,0.51294005,0.000012727146,0.00002356248,0.00014212121,0.0002438014,0.000027239064,0.000023321516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989101,0.00004645019,0.00052845076,0.0001415244,0.00018055766,0.0001928876],"domain_scores_gemma":[0.99853694,0.0004973196,0.00015346838,0.00017609374,0.00059461227,0.000041540254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025006925,0.00014213669,0.000180123,0.00009081279,0.00022878057,0.00007661102,0.0001408366,0.00007495007,0.000083541134],"category_scores_gemma":[0.00017875578,0.0001212481,0.00005866179,0.00051795604,0.00005014903,0.00032611552,0.000016338092,0.00008891718,0.000006358015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003121528,0.000013143418,0.0005822707,0.000055235043,0.000043676355,7.604618e-9,0.0010742933,0.9928979,0.00006160797,0.0015846838,0.000372073,0.003311959],"study_design_scores_gemma":[0.00035256188,0.000019777857,0.00069570955,0.000035098594,0.00003708344,6.0468244e-7,0.00032657187,0.9975382,0.00021966423,0.00060341065,0.000032782762,0.00013852808],"about_ca_topic_score_codex":0.00002155626,"about_ca_topic_score_gemma":0.0000032573082,"teacher_disagreement_score":0.48533422,"about_ca_system_score_codex":0.000051904357,"about_ca_system_score_gemma":0.000029294499,"threshold_uncertainty_score":0.4944354},"labels":[],"label_agreement":null},{"id":"W1970712172","doi":"10.1016/j.ejor.2015.04.017","title":"Exact and heuristic algorithms for the design of hub networks with multiple lines","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Benchmark (surveying); Mathematical optimization; Heuristic; Variable neighborhood search; Set (abstract data type); Computer science; Algorithm; Greedy algorithm; Network planning and design; Greedy randomized adaptive search procedure; Descent (aeronautics); Constraint (computer-aided design); Mathematics; Metaheuristic","score_opus":0.18330858125461627,"score_gpt":0.37627837588089164,"score_spread":0.19296979462627536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970712172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004685864,0.00092618883,0.9937073,0.00022503825,0.00008356983,0.00018453374,0.0000029852413,0.000007771847,0.0001767231],"genre_scores_gemma":[0.6546224,0.00014438314,0.34471455,0.0000117962045,0.0003759032,0.0000028673835,0.0000016495203,0.000032036492,0.00009439973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837196,0.0007076655,0.00028886017,0.000066119384,0.00042160554,0.00014381054],"domain_scores_gemma":[0.99660397,0.0019148004,0.000053065978,0.000091719696,0.0012346603,0.00010180263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008039289,0.00006781811,0.00011413239,0.00009384745,0.00010651538,0.000082660204,0.00018381419,0.000013727072,0.0000067300634],"category_scores_gemma":[0.0018371849,0.000041668107,0.000020083065,0.00017680718,0.00009486705,0.00011411237,0.000029316987,0.00026164972,0.000001186876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109106615,0.000011152035,0.0003344639,0.000009996078,0.000038852853,0.0000094934585,0.00020411193,0.99231195,0.00035572718,0.000044547105,0.0015853631,0.004985242],"study_design_scores_gemma":[0.00080353016,0.0003746131,0.0017789362,0.000043473337,0.000008777372,0.000059430346,0.00012064083,0.99544424,0.00023646932,0.000013001622,0.0010677689,0.00004912678],"about_ca_topic_score_codex":0.00000116293,"about_ca_topic_score_gemma":3.9641523e-7,"teacher_disagreement_score":0.64993656,"about_ca_system_score_codex":0.000025231686,"about_ca_system_score_gemma":0.00010075101,"threshold_uncertainty_score":0.27862734},"labels":[],"label_agreement":null},{"id":"W1970974711","doi":"10.1287/opre.1050.0218","title":"The Black and White Traveling Salesman Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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":"Ministero dell'Università e della Ricerca","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Combinatorics; Mathematics; Vertex (graph theory); Traveling purchaser problem; 2-opt; Bounded function; Vehicle routing problem; Branch and cut; Mathematical optimization; Hamiltonian path; Integer programming; Discrete mathematics; Graph; Computer science; Routing (electronic design automation)","score_opus":0.03776718920947337,"score_gpt":0.3386011763200925,"score_spread":0.30083398711061915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970974711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60639584,0.0005715982,0.25531736,0.003973988,0.0001333338,0.0011404842,0.000011823109,0.0004756237,0.13197994],"genre_scores_gemma":[0.91453683,0.00016417695,0.079707086,0.000005981811,0.00012095613,0.000049016027,0.0000097981165,0.000029384199,0.005376789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990836,0.00016876763,0.00015796731,0.000116454234,0.00021437574,0.00025886676],"domain_scores_gemma":[0.99945927,0.00015771565,0.0000030418103,0.00018015219,0.00016093848,0.000038871352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013861149,0.000060693274,0.000053794498,0.00006402884,0.00067352934,0.00037030567,0.000114622395,0.000042999392,0.0000237422],"category_scores_gemma":[0.00007362287,0.0000478117,0.000011796398,0.0003660653,0.00012622417,0.00009562285,0.000034746183,0.0002558414,0.000040859977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.4359484e-7,0.000005584778,0.0006479214,0.000011133975,0.000004854232,6.62577e-7,0.00024133269,0.98660064,0.002928578,0.0050381846,0.0012576887,0.0032625038],"study_design_scores_gemma":[0.00010856617,0.000009590062,0.0032650302,0.0000101070755,0.0000016370813,0.000002907762,0.00015234077,0.9910462,0.0008904777,0.00028225954,0.0041625896,0.00006829453],"about_ca_topic_score_codex":0.00004929995,"about_ca_topic_score_gemma":0.00032448338,"teacher_disagreement_score":0.308141,"about_ca_system_score_codex":0.000039449103,"about_ca_system_score_gemma":0.000028569215,"threshold_uncertainty_score":0.5180311},"labels":[],"label_agreement":null},{"id":"W1971036791","doi":"10.1002/net.21580","title":"Branch‐and‐cut and Branch‐and‐cut‐and‐price algorithms for the adjacent only quadratic minimum spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","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":"Polytechnique Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Spanning tree; Branch and cut; Maximum cut; Mathematics; Minimum spanning tree; Linear programming relaxation; Integer programming; Linear programming; Linearization; Branch and bound; Cutting-plane method; Quadratic equation; Combinatorics; Relaxation (psychology); Branch and price; Mathematical optimization; Algorithm; Graph; Nonlinear system","score_opus":0.02871880323920883,"score_gpt":0.266627552590149,"score_spread":0.23790874935094014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971036791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045297526,0.012449489,0.9391783,0.00068606774,0.0004944864,0.0008325143,0.0000058494925,0.0002869427,0.0007688603],"genre_scores_gemma":[0.86768246,0.0013814564,0.12922683,0.00031626123,0.0007571138,0.00011304697,0.000013245131,0.00013081994,0.00037875443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859416,0.00009825999,0.00034662386,0.0003391014,0.0001685052,0.0004533688],"domain_scores_gemma":[0.99864984,0.00072054256,0.00008300285,0.00024107851,0.00007699999,0.0002285408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009944804,0.00027937203,0.0003345717,0.0000578592,0.00020228808,0.00017685292,0.00012468253,0.00018995856,0.000004100369],"category_scores_gemma":[0.00011845767,0.00023129866,0.00003851625,0.0002033672,0.00009651738,0.00016765171,0.00009919971,0.00031491503,0.0000011611396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060339247,0.000022566128,0.0054752775,0.00024700307,0.00016562101,0.0000030064534,0.0034135394,0.5613912,0.00007273372,0.0004503326,0.0024679275,0.4262305],"study_design_scores_gemma":[0.0012958859,0.0000808118,0.0030962871,0.000117863136,0.000091351496,0.000048081798,0.00016342763,0.9905593,0.000031094358,0.00037317458,0.003850709,0.00029201928],"about_ca_topic_score_codex":0.000020333311,"about_ca_topic_score_gemma":0.00004828378,"teacher_disagreement_score":0.82238495,"about_ca_system_score_codex":0.000039854887,"about_ca_system_score_gemma":0.000030083746,"threshold_uncertainty_score":0.9432086},"labels":[],"label_agreement":null},{"id":"W1971063635","doi":"10.1007/s10479-011-0991-3","title":"A dynamic vehicle routing problem with multiple delivery routes","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":182,"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; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Heuristic; Theory of computation; Routing (electronic design automation); Operations research; Service (business); Mathematical optimization; Computer network; Artificial intelligence","score_opus":0.1498618087874064,"score_gpt":0.3781981942429519,"score_spread":0.22833638545554552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971063635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380337,0.00020000417,0.0535023,0.00017652259,0.00002535252,0.00044507338,0.000016451726,0.00020396753,0.0073966426],"genre_scores_gemma":[0.82378006,0.00009028037,0.17577183,0.000014303019,0.000011251141,0.00005218336,0.000009643157,0.000036064645,0.00023440563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985647,0.00020626701,0.00028779104,0.00018897082,0.00035264244,0.0003996003],"domain_scores_gemma":[0.9985849,0.00016942549,0.000015025203,0.0003145337,0.00082554936,0.00009052547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013089542,0.000111050314,0.00015279955,0.00026510644,0.00022964002,0.0000615829,0.00024085051,0.000067564884,0.00009800335],"category_scores_gemma":[0.0002220907,0.00010124648,0.000035010882,0.0007264388,0.00011034035,0.00034680686,0.00006638523,0.00029000806,0.000033959714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042137563,0.00013225165,0.010110918,0.00008675145,0.0000990384,0.00000765259,0.0040483293,0.957653,0.018490013,0.0012430453,0.00022948375,0.007857374],"study_design_scores_gemma":[0.00023581611,0.00012472457,0.005924395,0.000068912836,0.0000038434123,0.0000034444856,0.00043636214,0.96013814,0.032820333,0.000050453466,0.00006094195,0.00013261843],"about_ca_topic_score_codex":0.00034773332,"about_ca_topic_score_gemma":0.0003078342,"teacher_disagreement_score":0.122269526,"about_ca_system_score_codex":0.000026853693,"about_ca_system_score_gemma":0.00007843526,"threshold_uncertainty_score":0.41287115},"labels":[],"label_agreement":null},{"id":"W1971150951","doi":"10.1109/icsmc.2011.6083801","title":"An interactive heuristic approach for the P-forest problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Heuristics; GRASP; Greedy randomized adaptive search procedure; Computer science; Exploit; Heuristic; Domain (mathematical analysis); Greedy algorithm; Process (computing); Artificial intelligence; Mathematical optimization; Machine learning; Algorithm; Mathematics; Software engineering","score_opus":0.040203528840614004,"score_gpt":0.27576353239718027,"score_spread":0.23556000355656626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971150951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011378679,0.000016153126,0.95998746,0.0000067238925,0.00008259307,0.00032885085,0.0000023621403,0.00033760205,0.038100407],"genre_scores_gemma":[0.47203714,0.0000021048775,0.5276861,0.000018900448,0.00003153608,0.00007063939,0.000004200101,0.00002074544,0.00012863813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957514,0.000026884509,0.00011425157,0.00010268813,0.00004535372,0.00013567752],"domain_scores_gemma":[0.9995876,0.000121586,0.000017288618,0.00019749277,0.000041534015,0.00003452559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024617795,0.00008003414,0.00007075503,0.000026027768,0.000054696182,0.000024395988,0.00016004515,0.000033583772,0.00005844731],"category_scores_gemma":[0.000036059835,0.000053970616,0.000027586768,0.00008057062,0.00001866793,0.0001131682,0.000011767593,0.000080609556,0.0000056488648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019966621,0.000059286405,0.0011782213,0.000051673553,0.00006002122,2.8854393e-7,0.0025637462,0.975874,0.00017762354,0.007216281,0.0006674737,0.012131393],"study_design_scores_gemma":[0.00011856033,0.000030180458,0.0014146195,0.000002477865,0.000014391761,0.000002522851,0.00025505293,0.9967274,0.0007115403,0.0003763687,0.0002620764,0.000084804415],"about_ca_topic_score_codex":0.000017842738,"about_ca_topic_score_gemma":0.000004719944,"teacher_disagreement_score":0.47089925,"about_ca_system_score_codex":0.00001786055,"about_ca_system_score_gemma":0.0000052165965,"threshold_uncertainty_score":0.22008578},"labels":[],"label_agreement":null},{"id":"W1971529341","doi":"10.1142/s0217984900001105","title":"FINITE SIZE SCALING AND CRITICAL TRANSITION IN CONSTRAINED TRAVELING SALESMAN PROBLEM","year":2000,"lang":"en","type":"article","venue":"Modern Physics Letters B","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":"University of Lethbridge","funders":"","keywords":"Travelling salesman problem; Scaling; Function (biology); Mathematical optimization; Bottleneck traveling salesman problem; Statistical physics; Mathematics; Computer science; Physics; Geometry; Biology","score_opus":0.011900910847733787,"score_gpt":0.23593291920144047,"score_spread":0.22403200835370668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971529341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4216462,0.000018400573,0.5772286,0.00052249135,0.000018985718,0.00007571558,0.000005231266,0.00013408376,0.0003502667],"genre_scores_gemma":[0.90244323,0.000011228576,0.09686467,0.0005432454,0.00007947055,0.00000947998,0.000006980357,0.000037903992,0.000003812424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999173,0.000059513695,0.0002176443,0.0001914582,0.00010690827,0.00025149848],"domain_scores_gemma":[0.99955755,0.00026825402,0.000009793757,0.000099406534,0.000012270564,0.000052734147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016727934,0.00014245769,0.00016645408,0.00002600236,0.00005137271,0.000049114715,0.000052203264,0.000058758447,0.000024787607],"category_scores_gemma":[0.000018008845,0.00017485255,0.000033754524,0.00013109454,0.00006911301,0.00016285697,0.0000044525304,0.00021298509,0.0000047443637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006091787,0.000014168665,0.000064438376,0.000069633425,0.0000075823136,0.0000073150836,0.0020319568,0.9202462,0.028775223,0.000119616554,0.000004917616,0.048652854],"study_design_scores_gemma":[0.00045142058,0.0000051740644,0.0003198706,0.00008121465,0.000012023369,0.000004531745,0.000017023203,0.9950814,0.0016218069,0.0022047663,0.0000066907387,0.00019403036],"about_ca_topic_score_codex":0.0000047377107,"about_ca_topic_score_gemma":8.790497e-7,"teacher_disagreement_score":0.480797,"about_ca_system_score_codex":0.000031150335,"about_ca_system_score_gemma":0.0000058223713,"threshold_uncertainty_score":0.713028},"labels":[],"label_agreement":null},{"id":"W1972280695","doi":"10.1007/s10479-011-0876-5","title":"The Robust Set Covering Problem with interval data","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Regret; Benders' decomposition; Mathematical optimization; Interval (graph theory); Theory of computation; Mathematics; Heuristic; Set (abstract data type); Genetic algorithm; Minimax; Context (archaeology); Algorithm; Heuristics; Computer science; Statistics; Combinatorics","score_opus":0.5469561555470586,"score_gpt":0.4569992869582814,"score_spread":0.08995686858877716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972280695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2545023,0.0011312796,0.6657859,0.0028262064,0.00021871037,0.0017181361,0.00024512003,0.0004511564,0.07312116],"genre_scores_gemma":[0.81155455,0.00045525565,0.1871365,0.000020322339,0.000049656017,0.00004776836,0.00004832796,0.000042464802,0.0006451794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988598,0.0001980241,0.00021070291,0.00014989606,0.00030823256,0.00027333188],"domain_scores_gemma":[0.99855244,0.00015643265,0.000009747456,0.00074040215,0.00048611747,0.000054833705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025697132,0.00006989946,0.000088887806,0.00009566716,0.00028882222,0.00011169267,0.0006727024,0.00003421288,0.0000758285],"category_scores_gemma":[0.0002557077,0.00004868869,0.000013566605,0.00044138625,0.00013394946,0.00036146492,0.00022955047,0.0002595482,0.000019238094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025399753,0.00003036002,0.00045682542,0.000044545974,0.00008317834,0.000002704811,0.0015929029,0.98225653,0.0005344023,0.0026291306,0.005917246,0.006426791],"study_design_scores_gemma":[0.00012069097,0.00010083589,0.0006922479,0.00005853547,0.0000035450128,0.0000056217077,0.000532489,0.98575693,0.009023359,0.000059707774,0.0035471043,0.00009895168],"about_ca_topic_score_codex":0.00014090067,"about_ca_topic_score_gemma":0.00026284816,"teacher_disagreement_score":0.5570522,"about_ca_system_score_codex":0.00001038187,"about_ca_system_score_gemma":0.000067806395,"threshold_uncertainty_score":0.22214162},"labels":[],"label_agreement":null},{"id":"W1973979653","doi":"10.1109/scis.2007.367696","title":"Structured Neighborhood Tabu Search for Assigning Judges to Competitions","year":2007,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"Tabu search; Metaheuristic; Guided Local Search; Diversification (marketing strategy); Computer science; Mathematical optimization; Contiguity; Competition (biology); Hill climbing; Simulated annealing; Operations research; Algorithm; Mathematics","score_opus":0.023868962353607005,"score_gpt":0.3069418959008773,"score_spread":0.28307293354727026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973979653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01301496,0.000015186809,0.96398836,0.00017542474,0.00020389211,0.00028658254,0.000012560307,0.0005520735,0.021750947],"genre_scores_gemma":[0.5132592,8.1233003e-7,0.48631722,0.00011452584,0.000093834555,0.000008845507,0.000012354486,0.000028841016,0.00016442256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992029,0.000018635159,0.00018969321,0.00014007425,0.00012290422,0.0003257987],"domain_scores_gemma":[0.99932873,0.00027197445,0.000009759716,0.00016326513,0.00009280487,0.00013346909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052349764,0.0001037114,0.0001179146,0.00014703242,0.000100396566,0.00004554183,0.000113878894,0.000064959924,0.0002559415],"category_scores_gemma":[0.00007779989,0.000106659645,0.00003868181,0.00032009857,0.000010495474,0.000066260574,0.000024112653,0.00010196164,0.000021404778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008856139,0.000011618596,0.0038658057,0.000044686825,0.000037115875,0.0000013189828,0.0004847953,0.921983,0.03206787,0.021548515,0.001646526,0.018299917],"study_design_scores_gemma":[0.0010114613,0.00009702444,0.023506053,0.000034828616,0.000027446626,0.000009912092,0.00088332425,0.75767183,0.20881663,0.00069935527,0.006621871,0.000620287],"about_ca_topic_score_codex":0.0000030128615,"about_ca_topic_score_gemma":0.000015724117,"teacher_disagreement_score":0.5002442,"about_ca_system_score_codex":0.00006552736,"about_ca_system_score_gemma":0.000012193753,"threshold_uncertainty_score":0.4349454},"labels":[],"label_agreement":null},{"id":"W1974436345","doi":"10.1016/j.jom.2004.10.017","title":"Analysis and improvement of delivery operations at the San Francisco Public Library","year":2005,"lang":"en","type":"article","venue":"Journal of Operations Management","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":"Tellabs (Canada)","funders":"","keywords":"Workload; Computer science; Heuristics; Service delivery framework; Operations research; Delivery Performance; Library management; Delivery system; Operations management; Service (business); World Wide Web; Business; Process management; Operating system; Engineering; Marketing","score_opus":0.01055823925243723,"score_gpt":0.236586939338591,"score_spread":0.22602870008615378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974436345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.592311,0.0008028489,0.40107402,0.0028280506,0.0001244566,0.00024900198,0.000011994492,0.000034627945,0.0025639525],"genre_scores_gemma":[0.86221206,0.0006886372,0.13595298,0.00019170943,0.00007945969,0.0000098403325,0.000008831623,0.000015070073,0.0008414033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989971,0.000053541607,0.00054203457,0.00008252799,0.000212898,0.00011192917],"domain_scores_gemma":[0.9995316,0.000034635123,0.00006196858,0.00021512508,0.00009755111,0.000059093287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043135145,0.000095240815,0.00017533678,0.0003831714,0.00017864475,0.00015362953,0.00017224617,0.000026272812,0.00045615918],"category_scores_gemma":[0.0000159263,0.000070994865,0.000083110484,0.00060934847,0.000032878175,0.00063180865,0.00009829156,0.000100888996,0.000003595558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023931586,0.000035651,0.0012120038,0.000014259703,0.00067032524,0.0000012720968,0.00021227413,0.97378105,0.0013122488,0.00052293227,0.0010117174,0.021223867],"study_design_scores_gemma":[0.0005084155,0.00007136242,0.01169573,0.000017312357,0.0006430147,0.000007825339,0.00040036484,0.97429943,0.0038793196,0.000009206886,0.008326738,0.00014126099],"about_ca_topic_score_codex":0.0000035492258,"about_ca_topic_score_gemma":0.00008014879,"teacher_disagreement_score":0.269901,"about_ca_system_score_codex":0.00006431195,"about_ca_system_score_gemma":0.000016968012,"threshold_uncertainty_score":0.4994623},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028451525478535144,"score_gpt":0.2688076632308992,"score_spread":0.24035613775236409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974861471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04088952,0.0000667962,0.9582531,0.000029688883,0.00028954822,0.00008279174,0.000016086306,0.00008234808,0.00029011563],"genre_scores_gemma":[0.9508703,0.000023658027,0.048814904,0.000053686184,0.00016803484,0.0000026670803,0.000014813256,0.00003105346,0.000020881696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935627,0.000021500511,0.00022341662,0.00006474929,0.000116995114,0.00021705989],"domain_scores_gemma":[0.9994627,0.00022454468,0.00007802802,0.000043701017,0.000059116934,0.00013186128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033147694,0.000107378095,0.000110488756,0.00006601057,0.00014527228,0.00003777313,0.000036233105,0.000035538473,0.0000068971717],"category_scores_gemma":[0.00010532333,0.00009185658,0.000026029918,0.00010949393,0.000022033038,0.00010007854,4.0716938e-7,0.00019759829,0.0000012671761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029348523,0.000014988917,0.0027215884,0.00003098034,0.000022299735,0.000003062866,0.00063930685,0.98877275,0.00012492319,0.0028991483,0.00003431176,0.0047072833],"study_design_scores_gemma":[0.0038583083,0.00059575506,0.09877473,0.00028950837,0.00046518605,0.00018337046,0.0018086483,0.88765657,0.00074538856,0.00018486871,0.0043862164,0.0010514766],"about_ca_topic_score_codex":3.756689e-7,"about_ca_topic_score_gemma":6.6473956e-7,"teacher_disagreement_score":0.9099808,"about_ca_system_score_codex":0.000025754764,"about_ca_system_score_gemma":0.000008843631,"threshold_uncertainty_score":0.37458023},"labels":[],"label_agreement":null},{"id":"W1975388745","doi":"10.1016/j.cor.2014.09.006","title":"Model-based automatic neighborhood design by unsupervised learning","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"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":"Heuristic; Computer science; Integer programming; Space (punctuation); Key (lock); Domain (mathematical analysis); Unsupervised learning; Combinatorial optimization; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Algorithm","score_opus":0.06769736086838636,"score_gpt":0.33860306439854077,"score_spread":0.2709057035301544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975388745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007951181,0.00007529865,0.989566,0.00029269204,0.000104304236,0.00037358515,0.0000021367246,0.0007475937,0.00088719506],"genre_scores_gemma":[0.57007176,0.0000070703545,0.4295498,0.000055681616,0.000043054144,0.00005796883,0.000029577017,0.000049121296,0.00013593848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729776,0.0011568533,0.00030111775,0.0002887476,0.00046421346,0.0004912787],"domain_scores_gemma":[0.99841565,0.0007137524,0.000009296402,0.00040280577,0.00028450417,0.0001740108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002215759,0.00017104662,0.00019671224,0.0003228281,0.00055249286,0.00036431957,0.00040628263,0.00010648224,0.00006958276],"category_scores_gemma":[0.00040759964,0.00018443436,0.000045608096,0.0007479528,0.00007398864,0.00019867999,0.00006668191,0.0005836606,0.00010765478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016151866,0.000026606813,0.000040469113,0.000031094743,0.000013396794,5.077971e-7,0.00025207817,0.9701933,0.004239032,0.00034630852,0.00295178,0.02190379],"study_design_scores_gemma":[0.00045438163,0.00007273245,0.000025140533,0.000038380946,0.000004818538,0.0000010693119,0.000020809548,0.99661845,0.0022294938,0.00006078301,0.00028163037,0.00019228249],"about_ca_topic_score_codex":0.0000084994535,"about_ca_topic_score_gemma":0.0000017476186,"teacher_disagreement_score":0.5621206,"about_ca_system_score_codex":0.00014878732,"about_ca_system_score_gemma":0.00011571719,"threshold_uncertainty_score":0.7521015},"labels":[],"label_agreement":null},{"id":"W1976305426","doi":"10.1111/itor.12050","title":"Searching for optimal integer solutions to set partitioning problems using column generation","year":2013,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"Université Laval","funders":"","keywords":"Column generation; Subgradient method; Integer programming; Mathematical optimization; Linear programming relaxation; Integer (computer science); Heuristics; Lagrangian relaxation; Mathematics; Relaxation (psychology); Branch and price; Column (typography); Linear programming; Algorithm; Computer science","score_opus":0.23892640465991966,"score_gpt":0.4353722400366696,"score_spread":0.19644583537674992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976305426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07225315,0.000025472562,0.9227878,0.0019456341,0.0005613358,0.0012510727,0.000079873906,0.000108320106,0.0009873349],"genre_scores_gemma":[0.76362664,0.000019978721,0.2334646,0.00007830143,0.00032107456,0.001580328,0.00014771943,0.00004884659,0.0007125078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976599,0.00020962239,0.00051552284,0.000347916,0.0007287509,0.00053828396],"domain_scores_gemma":[0.99803144,0.00045555294,0.000021240405,0.00016907907,0.0011729562,0.00014974734],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018544117,0.00015546374,0.0001450807,0.0008682949,0.0005922124,0.0005150452,0.00029728192,0.00011274079,0.0013199473],"category_scores_gemma":[0.00035798398,0.000185186,0.00007080606,0.00073366886,0.000071304166,0.00091703766,0.000026618443,0.00050807284,0.0001058379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073632955,0.000049974227,0.00010147228,0.00001602521,0.00003859326,5.1521386e-7,0.0006330184,0.96597767,0.027231801,0.0023594864,0.00056262035,0.0030214326],"study_design_scores_gemma":[0.00037079438,0.000036950096,0.00034679787,0.00006270536,0.0000038189423,0.0000113392025,0.0002684982,0.99308664,0.0025285273,0.00039104765,0.0027076236,0.00018525842],"about_ca_topic_score_codex":0.00040367187,"about_ca_topic_score_gemma":0.00029285115,"teacher_disagreement_score":0.69137347,"about_ca_system_score_codex":0.000827908,"about_ca_system_score_gemma":0.00019316003,"threshold_uncertainty_score":0.99959296},"labels":[],"label_agreement":null},{"id":"W1976370345","doi":"10.1109/mis.2005.71","title":"Guest Editors' Introduction: Advanced Heuristics in Transportation and Logistics","year":2005,"lang":"en","type":"article","venue":"IEEE Intelligent Systems","topic":"Vehicle Routing Optimization Methods","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":"Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Metaheuristic; Heuristic; Constructive; Quality (philosophy); Exploit; Hyper-heuristic; Artificial intelligence; Mathematical optimization; Operations research; Management science; Robot; Mathematics; Engineering","score_opus":0.014684641173514134,"score_gpt":0.2577644374988316,"score_spread":0.24307979632531745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976370345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027075041,0.00085459807,0.9410168,0.00015472101,0.029922036,0.0003382226,0.000019643912,0.00035464938,0.00026428307],"genre_scores_gemma":[0.95960975,0.00040735464,0.01809159,0.0000111198115,0.021470571,0.000032256623,0.000029468541,0.000050145503,0.00029773562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892473,0.000049980397,0.00049222785,0.00019206728,0.00015161281,0.00018936074],"domain_scores_gemma":[0.99955326,0.000086559616,0.000054499735,0.00016860254,0.00007209417,0.00006499793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003086727,0.000146947,0.00019850895,0.00011914285,0.000029868626,0.000038000526,0.00007373249,0.000104556406,0.000009192068],"category_scores_gemma":[0.00006941288,0.00016292608,0.000020572026,0.00019443536,0.000030898682,0.00011614632,0.0000023258572,0.00016867302,0.000028083361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005017178,0.000015188152,0.00068693684,0.00010821379,0.000009055137,0.0000030323235,0.0003112506,0.9906465,0.0006096196,0.00020408168,0.0048397756,0.0025613457],"study_design_scores_gemma":[0.00023948414,0.000033175125,0.0003130355,0.00009035328,0.000018094444,0.000014669385,0.0002501388,0.7941706,0.008486495,0.000016509515,0.19606103,0.00030638342],"about_ca_topic_score_codex":0.000017916333,"about_ca_topic_score_gemma":0.000031722037,"teacher_disagreement_score":0.9325347,"about_ca_system_score_codex":0.00013197908,"about_ca_system_score_gemma":0.00000862844,"threshold_uncertainty_score":0.66439325},"labels":[],"label_agreement":null},{"id":"W1976836184","doi":"10.1007/s12532-014-0076-9","title":"The strength of multi-row models","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"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":"Row; Cutting-plane method; Intersection (aeronautics); Theory of computation; Integer programming; Facet (psychology); Mathematics; Integer (computer science); Row and column spaces; Set (abstract data type); Relaxation (psychology); Mathematical optimization; Combinatorics; Algorithm; Computer science","score_opus":0.030477581354009544,"score_gpt":0.28848244266485273,"score_spread":0.2580048613108432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976836184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009897942,0.000036161262,0.98851883,0.000037406342,0.000072263036,0.00018409056,3.69268e-7,0.00032283572,0.0009301134],"genre_scores_gemma":[0.51662487,0.0000014813666,0.4833145,0.0000028207994,0.0000144535525,0.000010391854,0.0000021549824,0.000016214346,0.00001308025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914604,0.00008688009,0.00033165462,0.00009164027,0.00017434821,0.00016945785],"domain_scores_gemma":[0.99905705,0.00062472577,0.00006168519,0.00014173883,0.00007248954,0.000042291136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000716851,0.00009577681,0.00014189068,0.000033678527,0.00008369556,0.00005724465,0.00011454861,0.000047704823,0.0000031696834],"category_scores_gemma":[0.00022345192,0.000072943614,0.00004521989,0.0001352178,0.000055654375,0.000069094385,0.000022159245,0.000094299474,0.000012239442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010003057,0.00002838318,0.0000075219436,0.000099068035,0.00001192912,6.603559e-8,0.000278442,0.6579093,0.000040278883,0.01592158,0.000015215961,0.32568723],"study_design_scores_gemma":[0.00017011318,0.000019402525,0.000020556008,0.00002965794,0.000010780839,0.0000014061358,0.000045433855,0.97617185,0.00031477356,0.02299393,0.00014599813,0.00007607861],"about_ca_topic_score_codex":8.2357684e-7,"about_ca_topic_score_gemma":5.8862236e-7,"teacher_disagreement_score":0.506727,"about_ca_system_score_codex":0.000018799885,"about_ca_system_score_gemma":0.0000047070994,"threshold_uncertainty_score":0.2974554},"labels":[],"label_agreement":null},{"id":"W1977973577","doi":"10.3138/infor.51.1.41","title":"Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique","year":2013,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Physics; Vehicle routing problem; Philosophy; Computer science; Routing (electronic design automation)","score_opus":0.09913689856119007,"score_gpt":0.39497984875318554,"score_spread":0.29584295019199547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977973577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0518145,0.0003793217,0.9286192,0.00719429,0.00022679179,0.0014341543,0.00019369094,0.00015335907,0.00998467],"genre_scores_gemma":[0.42757416,0.0025727188,0.56139463,0.00061177585,0.00057641655,0.0011213033,0.00061356474,0.00008942438,0.0054459767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99258465,0.0041321507,0.0011289516,0.00023908923,0.00084888894,0.0010662479],"domain_scores_gemma":[0.9939037,0.0030312322,0.00021231051,0.0002747665,0.0020928811,0.00048513713],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.02772421,0.0003317523,0.00034178773,0.0006009139,0.0005981782,0.0022953062,0.00029345023,0.0008596813,0.00016790583],"category_scores_gemma":[0.005137139,0.00037117614,0.00008059912,0.0006865899,0.00016748229,0.0043891454,0.0001245221,0.001552544,0.00020430643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005083378,0.00006620376,0.0021657967,0.001255434,0.00011995067,0.000011644431,0.01874569,0.81340694,0.0011285412,0.10674744,0.009214053,0.047087446],"study_design_scores_gemma":[0.0010840603,0.000092703536,0.009261996,0.00036486538,0.000016471507,0.0006415778,0.0017191718,0.9549825,0.00057303364,0.002169637,0.02874415,0.0003498112],"about_ca_topic_score_codex":0.0072536487,"about_ca_topic_score_gemma":0.000113133676,"teacher_disagreement_score":0.37575966,"about_ca_system_score_codex":0.0038525523,"about_ca_system_score_gemma":0.0030143885,"threshold_uncertainty_score":0.9999715},"labels":[],"label_agreement":null},{"id":"W1978433263","doi":"10.1016/j.comcom.2004.07.006","title":"Assigning cells to switches in mobile networks using an ant colony optimization heuristic","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"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":"Computer science; Ant colony optimization algorithms; Heuristic; Mathematical optimization; Optimization problem; Metaheuristic; Algorithm; Artificial intelligence; Mathematics","score_opus":0.04141503808203103,"score_gpt":0.29967456980762996,"score_spread":0.25825953172559896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978433263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03093136,0.0002569944,0.9677058,0.000056230907,0.0002204346,0.0003568086,0.0000027549893,0.00035431475,0.000115288174],"genre_scores_gemma":[0.43954954,0.000060726994,0.5601937,0.00006586768,0.000043323515,0.000031691663,0.0000226084,0.000030967236,0.0000015782374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989638,0.00015294031,0.00036324674,0.00018526964,0.0000888204,0.00024597472],"domain_scores_gemma":[0.9985299,0.00015620759,0.0000513271,0.001071324,0.000078992576,0.000112235786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034800504,0.00015176626,0.00018906382,0.00019985785,0.00018177163,0.000105866726,0.0006574664,0.00008993626,0.000006235828],"category_scores_gemma":[0.00001809565,0.00019019561,0.000029977979,0.0006971029,0.000035965877,0.00020863402,0.00024787587,0.00025691988,0.0000065635704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011256261,0.000075732896,0.00019117858,0.0000070797314,0.0000075035396,8.927619e-7,0.00069749536,0.9957139,0.00068561133,0.0000700581,0.000017992777,0.0025314142],"study_design_scores_gemma":[0.00025305888,0.00003600076,0.00033288257,0.00008522469,0.000009807359,0.0000042986608,0.00004408381,0.9985409,0.00029269527,0.00003591691,0.00016197104,0.00020320027],"about_ca_topic_score_codex":0.000036893274,"about_ca_topic_score_gemma":0.00003473529,"teacher_disagreement_score":0.40861815,"about_ca_system_score_codex":0.00026375396,"about_ca_system_score_gemma":0.00003778802,"threshold_uncertainty_score":0.77559525},"labels":[],"label_agreement":null},{"id":"W1979700544","doi":"10.1023/b:anor.0000032576.73681.29","title":"Solving VRPTWs with Constraint Programming Based Column Generation","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"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":"Column generation; Constraint programming; Theory of computation; Mathematical optimization; Computer science; Scheduling (production processes); Concurrent constraint logic programming; Constraint logic programming; Constraint satisfaction; Constraint (computer-aided design); Directed graph; Directed acyclic graph; Mathematics; Stochastic programming; Algorithm; Artificial intelligence","score_opus":0.20972328302259866,"score_gpt":0.42493952686567527,"score_spread":0.2152162438430766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979700544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31630823,0.00013227118,0.6797941,0.0013160574,0.00004732997,0.0006200702,0.000011072517,0.00017123153,0.0015996575],"genre_scores_gemma":[0.7111902,0.000023043674,0.28853273,0.0000337927,0.000053256626,0.00007373083,0.00002825917,0.000024698207,0.000040281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985859,0.00015547745,0.00027742537,0.00017703413,0.00045459843,0.0003495979],"domain_scores_gemma":[0.9985893,0.000084487365,0.00001357812,0.0002611583,0.000956889,0.00009463444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015617257,0.00010029714,0.0001370393,0.00027906758,0.00029740424,0.00017655684,0.00014197483,0.00006926497,0.000071206465],"category_scores_gemma":[0.0003063041,0.00009834172,0.000032108117,0.000752272,0.00016598625,0.00023414928,0.000020561454,0.00025717905,0.0000120431905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042674574,0.00004753126,0.00010309322,0.000032797587,0.000020144204,0.0000032262642,0.00027976098,0.97234726,0.01806441,0.0018921056,0.00012410463,0.00708131],"study_design_scores_gemma":[0.00043117293,0.00016751865,0.00017128728,0.00007829342,0.0000037411392,0.000004969437,0.00019579261,0.86998034,0.12828623,0.00002406838,0.0005169489,0.00013961621],"about_ca_topic_score_codex":0.000109012,"about_ca_topic_score_gemma":0.00026819896,"teacher_disagreement_score":0.39488196,"about_ca_system_score_codex":0.000052072122,"about_ca_system_score_gemma":0.00028943617,"threshold_uncertainty_score":0.4010259},"labels":[],"label_agreement":null},{"id":"W1979906780","doi":"10.1287/inte.1110.0544","title":"Designing New Electoral Districts for the City of Edmonton","year":2011,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","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":true,"ca_institutions":"HEC Montréal; University of Alberta","funders":"","keywords":"Redistricting; Contiguity; Plan (archaeology); Heuristic; Operations research; Population; Computer science; Process (computing); Transport engineering; Tabu search; Engineering; Geography; Legislature; Sociology; Artificial intelligence","score_opus":0.062465748116388636,"score_gpt":0.27094747060065544,"score_spread":0.2084817224842668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979906780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007467648,0.000042003943,0.9855805,0.000017389986,0.00015079923,0.0001517102,0.000002670184,0.000058513317,0.006528786],"genre_scores_gemma":[0.8298822,0.00005180974,0.16969709,0.000068371126,0.00017282242,0.0000033110896,0.0000017452355,0.000027167882,0.00009547767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905443,0.000005983178,0.00043742705,0.00005984816,0.00020499698,0.0002372897],"domain_scores_gemma":[0.99925387,0.00019427047,0.00018766201,0.00016422108,0.00008262802,0.00011734389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005405441,0.00013497222,0.00019316551,0.000109503504,0.000104657025,0.000046899426,0.0002483232,0.000074714626,0.000043158758],"category_scores_gemma":[0.00010274739,0.0000903037,0.00010513343,0.00028184627,0.000024909787,0.000093431314,0.000014686465,0.00029443557,0.0000036584754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019559698,0.00004582891,0.002442139,0.000059798727,0.00040031923,0.0000025893746,0.0013477848,0.8861067,0.0023817504,0.009102204,0.0024932225,0.09542202],"study_design_scores_gemma":[0.002830347,0.00042355372,0.0104589565,0.00010582011,0.00039055105,0.000050212322,0.00044985232,0.8451977,0.12391708,0.0075374306,0.00786624,0.00077230384],"about_ca_topic_score_codex":0.000005527853,"about_ca_topic_score_gemma":0.0000023650218,"teacher_disagreement_score":0.8224146,"about_ca_system_score_codex":0.00007827838,"about_ca_system_score_gemma":0.00006107858,"threshold_uncertainty_score":0.3682478},"labels":[],"label_agreement":null},{"id":"W1980175144","doi":"10.1016/j.trb.2003.09.002","title":"Waiting strategies for the dynamic pickup and delivery problem with time windows","year":2003,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":229,"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; Simon Fraser University","funders":"","keywords":"Pickup; Computer science; Dynamic problem; Algorithm; Artificial intelligence","score_opus":0.19768793239961463,"score_gpt":0.3989842575124488,"score_spread":0.20129632511283418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980175144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23084605,0.00029897955,0.76675767,0.00022240497,0.0000283342,0.00092417817,0.000014396995,0.00021992734,0.00068804604],"genre_scores_gemma":[0.39638624,0.0001534692,0.6028509,0.00003187635,0.00002554036,0.00032581048,0.000025507305,0.000036197463,0.00016442644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751437,0.0011357061,0.00029537987,0.00027973796,0.00032616255,0.00044862434],"domain_scores_gemma":[0.9937834,0.005709461,0.000035661145,0.00016534897,0.00021421011,0.00009187684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064531467,0.0001537957,0.00022343334,0.000083454426,0.00031864425,0.00010021678,0.00013299314,0.00011729579,0.00011631132],"category_scores_gemma":[0.00031434026,0.00010005304,0.00004383753,0.00035529587,0.00022788397,0.00016533308,0.0000033124218,0.00039617775,0.000005376117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018158334,0.000036623922,0.0016631145,0.00024953985,0.00013479538,0.000012500574,0.0013040106,0.951036,0.008396451,0.02599743,0.00030876833,0.010679226],"study_design_scores_gemma":[0.002003425,0.0006172723,0.018423725,0.0001190551,0.00011374332,0.000017771605,0.004481223,0.9471421,0.0033167007,0.011867628,0.011279427,0.00061791093],"about_ca_topic_score_codex":0.000008814767,"about_ca_topic_score_gemma":0.000039909246,"teacher_disagreement_score":0.16554019,"about_ca_system_score_codex":0.000029391214,"about_ca_system_score_gemma":0.0000679719,"threshold_uncertainty_score":0.40800446},"labels":[],"label_agreement":null},{"id":"W1980495840","doi":"10.1109/cec.2010.5586036","title":"The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":54,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Computer science; Mathematical optimization; Ant colony optimization algorithms; Heuristic; Spare part; Extremal optimization; Traveling purchaser problem; Convergence (economics); 2-opt; Optimization problem; Artificial intelligence; Engineering; Mathematics; Operations management; Multi-swarm optimization; Economics","score_opus":0.015808267299622446,"score_gpt":0.2290344006878308,"score_spread":0.21322613338820834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980495840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7166607,0.000021504213,0.27252865,0.000051233736,0.000053959415,0.00034355882,0.0000030512044,0.00041093482,0.009926448],"genre_scores_gemma":[0.6301059,0.000011723373,0.36972767,0.000015617738,0.000039361876,0.000018990168,0.000004639588,0.000026522877,0.000049568498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991832,0.00008144208,0.00015070266,0.0002066464,0.00012995904,0.00024807872],"domain_scores_gemma":[0.9994168,0.00013904691,0.000030853545,0.0002290443,0.00008906024,0.00009514402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006252887,0.00014460649,0.00014150413,0.000028759092,0.00028247837,0.00011323509,0.0001439965,0.00009173682,0.0000057086268],"category_scores_gemma":[0.000023967496,0.00010108701,0.000014628233,0.00018167828,0.00008562856,0.00015632447,0.00002567681,0.00041596591,0.0000014857742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020972725,0.0003914501,0.03717342,0.00023963004,0.00048773873,0.0000058158544,0.010858881,0.7927605,0.05521272,0.022041354,0.0005664519,0.080052316],"study_design_scores_gemma":[0.00043740871,0.000094304465,0.012134993,0.000008226116,0.000027516904,0.000027489488,0.00026445507,0.9821198,0.0041377866,0.00021138783,0.00029009694,0.00024654134],"about_ca_topic_score_codex":0.000052059888,"about_ca_topic_score_gemma":0.00048201965,"teacher_disagreement_score":0.18935929,"about_ca_system_score_codex":0.000027239996,"about_ca_system_score_gemma":0.000030421708,"threshold_uncertainty_score":0.41222087},"labels":[],"label_agreement":null},{"id":"W1981172686","doi":"10.4018/ijoris.2014010106","title":"Modeling and Simulation Analyses of Healthcare Delivery Operations for Inter-Hospital Patient Transfers","year":2014,"lang":"en","type":"article","venue":"International Journal of Operations Research and Information Systems","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":true,"ca_institutions":"Queen's University","funders":"","keywords":"Sizing; Health care; Operations research; Transfer (computing); Computer science; Operations management; Quality (philosophy); Engineering; Economics","score_opus":0.07347885653805221,"score_gpt":0.4028758624374857,"score_spread":0.3293970058994335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981172686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35054547,0.00014201265,0.6484112,0.00026003263,0.00029469674,0.00023357966,0.00004376542,0.0000109726025,0.000058284542],"genre_scores_gemma":[0.9869272,0.00025803113,0.012612868,0.000020797666,0.00010508558,0.00002068781,0.000042276857,0.000008851444,0.0000042022957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983388,0.000124108,0.00089149416,0.00006229987,0.00046493817,0.000118342956],"domain_scores_gemma":[0.99592835,0.00019039246,0.000050120325,0.00007561204,0.003664488,0.000091018504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010732011,0.00008464886,0.00017590156,0.0006506274,0.00013764192,0.00029371987,0.00012788486,0.00006041852,0.0000030987499],"category_scores_gemma":[0.00042598715,0.00007666984,0.000043375825,0.000156838,0.000042520714,0.00212701,0.000021484022,0.00015230385,7.828545e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025768084,0.0000144060905,0.000050224047,0.00006498982,0.00007039678,1.1090802e-7,0.0018602079,0.98620105,0.0004836248,0.0022943458,0.000017488155,0.008917401],"study_design_scores_gemma":[0.00049846806,0.00037547585,0.000033360157,0.00012150789,0.0000074576733,0.000011202031,0.0018044405,0.9960851,0.00050022063,0.000020695661,0.00047403635,0.00006800392],"about_ca_topic_score_codex":0.00012570871,"about_ca_topic_score_gemma":0.000014806941,"teacher_disagreement_score":0.63638175,"about_ca_system_score_codex":0.000083697145,"about_ca_system_score_gemma":0.00006420663,"threshold_uncertainty_score":0.31265056},"labels":[],"label_agreement":null},{"id":"W1981626956","doi":"10.4018/jsds.2010040104","title":"The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization","year":2010,"lang":"en","type":"article","venue":"International Journal of Strategic Decision Sciences","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":"","keywords":"Travelling salesman problem; Vehicle routing problem; Combinatorial optimization; Metaheuristic; Heuristics; Mathematical optimization; Extremal optimization; 2-opt; Lin–Kernighan heuristic; Quadratic assignment problem; Computer science; Traveling purchaser problem; Routing (electronic design automation); Heuristic; Optimization problem; Bottleneck traveling salesman problem; Mathematics; Meta-optimization","score_opus":0.03393817514350536,"score_gpt":0.3286185773359895,"score_spread":0.29468040219248415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981626956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90719485,0.000089090296,0.08380406,0.0008641346,0.0030544454,0.00015077725,0.000003914712,0.00003740788,0.004801335],"genre_scores_gemma":[0.9632788,0.00010038695,0.036224872,0.00002904023,0.00034664228,0.000001984523,5.030201e-7,0.0000119740835,0.0000058526516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982496,0.000084162064,0.0005848304,0.00013976391,0.0007477719,0.00019390462],"domain_scores_gemma":[0.99756575,0.0014777107,0.00031133913,0.00011625178,0.0004517418,0.00007723067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00426317,0.00015228982,0.00014394177,0.00012081614,0.0004441932,0.00092722784,0.0008920379,0.00006522022,0.000022009774],"category_scores_gemma":[0.00028431605,0.000068277914,0.00008828592,0.00030582573,0.00023734584,0.0003859341,0.000049066246,0.00049351546,0.0000019421982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000401723,0.000017362889,0.00040008622,9.85762e-7,0.000037888884,0.0000024406843,0.00037846246,0.95516884,0.0018686262,0.01959041,0.00003935151,0.022455346],"study_design_scores_gemma":[0.00062426034,0.00018266287,0.0010422175,0.000094134,0.000008040465,0.00017259094,0.00085989677,0.9339492,0.00087225175,0.061887905,0.00017340285,0.00013347015],"about_ca_topic_score_codex":0.000006262289,"about_ca_topic_score_gemma":0.000004198776,"teacher_disagreement_score":0.056083914,"about_ca_system_score_codex":0.000044631444,"about_ca_system_score_gemma":0.00011740718,"threshold_uncertainty_score":0.8941279},"labels":[],"label_agreement":null},{"id":"W1983050889","doi":"10.1016/j.ejor.2013.08.034","title":"Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":93,"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":"Schedule; Computer science; Heuristic; Operations research; Context (archaeology); Mathematical optimization; Incremental heuristic search; Order (exchange); Search algorithm; Beam search; Engineering; Artificial intelligence; Algorithm; Mathematics","score_opus":0.05616401818405493,"score_gpt":0.3486139602267212,"score_spread":0.2924499420426663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983050889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.295144,0.00011937806,0.69980305,0.00097330613,0.00017632007,0.0010582831,0.00004320032,0.000048771988,0.0026336834],"genre_scores_gemma":[0.7956084,0.000038968643,0.20326695,0.00012851616,0.0002953416,0.000024603556,0.000018780991,0.00007653406,0.0005418818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973897,0.0009306332,0.0004988287,0.00018201649,0.00059048965,0.0004083591],"domain_scores_gemma":[0.9972685,0.00034194533,0.000036337482,0.0001499518,0.0018569368,0.00034632778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006430839,0.00012732603,0.00016997923,0.00037594204,0.00020392737,0.0004219416,0.00027621625,0.00002963104,0.0001875924],"category_scores_gemma":[0.00087553123,0.00010963126,0.0000403178,0.0003467442,0.000030398412,0.00056349044,0.00008399945,0.00049955165,0.00006582768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000441741,0.0006079851,0.0031995673,0.00039503392,0.0004349915,0.00008158492,0.0040275995,0.54632705,0.16540274,0.0024060588,0.05302394,0.22365172],"study_design_scores_gemma":[0.0037922591,0.004789202,0.03126719,0.0003365054,0.000022883984,0.00010219231,0.0012932917,0.9367345,0.0033420264,0.00059269427,0.017130008,0.00059723045],"about_ca_topic_score_codex":0.0000057141597,"about_ca_topic_score_gemma":0.0000021796288,"teacher_disagreement_score":0.50046444,"about_ca_system_score_codex":0.00010803056,"about_ca_system_score_gemma":0.00014052443,"threshold_uncertainty_score":0.44706333},"labels":[],"label_agreement":null},{"id":"W1983755208","doi":"10.1504/ijbpscm.2010.036202","title":"Checking the feasibility of a vehicle route in integrated supply chain transportation model","year":2010,"lang":"en","type":"article","venue":"International Journal of Business Performance and Supply Chain Modelling","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":"McMaster University","funders":"","keywords":"Pickup; Vehicle routing problem; Supply chain; Computer science; Routing (electronic design automation); Service (business); Flow network; Operations research; Business; Mathematical optimization; Computer network; Engineering; Marketing","score_opus":0.024609862953461868,"score_gpt":0.26169077053549994,"score_spread":0.23708090758203806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983755208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65147865,0.000055390785,0.34785226,0.00021521418,0.00027584977,0.00007149084,0.000012504646,0.000013135123,0.000025482701],"genre_scores_gemma":[0.9712626,0.0005166732,0.028028877,0.000030322444,0.000108048596,0.000004075877,0.00001634822,0.000022906199,0.000010148226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998595,0.000030078321,0.0007250618,0.000119252465,0.0003647838,0.0001657959],"domain_scores_gemma":[0.9988765,0.000082078615,0.00021690951,0.000119173965,0.00066292065,0.000042429743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011424827,0.00015052204,0.0002459067,0.0002792148,0.000047227684,0.000048838825,0.0003201225,0.000097028336,0.000013031853],"category_scores_gemma":[0.000045016266,0.000120268785,0.000060125938,0.0003146554,0.000068136535,0.00056596677,0.000013049221,0.00051535026,2.6249023e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008274529,0.000028829863,0.06269886,0.000042769458,0.000024115106,0.0000034817342,0.0016717945,0.9219978,0.008028252,0.00011193028,0.0000036706065,0.005305771],"study_design_scores_gemma":[0.0006793909,0.0000141700475,0.025456944,0.00019214848,0.000012581714,0.000019422994,0.0001452572,0.9705644,0.0025527638,0.00023159817,0.000017576891,0.00011370188],"about_ca_topic_score_codex":0.00005596111,"about_ca_topic_score_gemma":0.00006564926,"teacher_disagreement_score":0.31982338,"about_ca_system_score_codex":0.00006230941,"about_ca_system_score_gemma":0.00008828881,"threshold_uncertainty_score":0.4904419},"labels":[],"label_agreement":null},{"id":"W1983758874","doi":"10.1007/s10479-011-0895-2","title":"The orienteering problem with stochastic travel and service times","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":133,"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":"Orienteering; Heuristics; Theory of computation; Computer science; Variety (cybernetics); Service (business); Mathematical optimization; Operations research; Stochastic programming; Mathematics; Marketing; Artificial intelligence; Algorithm; Business","score_opus":0.17549393651751152,"score_gpt":0.38041133706969343,"score_spread":0.2049174005521819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983758874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5011655,0.0012366676,0.46362054,0.0032695695,0.000079091944,0.0013924734,0.000021336919,0.00021653133,0.028998306],"genre_scores_gemma":[0.9536431,0.00011669154,0.045740765,0.000021154485,0.000017012862,0.000058585865,0.0000022092433,0.00002406962,0.00037640258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992293,0.00009121944,0.00014533108,0.00009788669,0.00021669714,0.00021954493],"domain_scores_gemma":[0.9990437,0.00013646732,0.0000065468016,0.00018693671,0.00057028,0.000056081062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280021,0.00006299858,0.000075493495,0.000090323774,0.00028149263,0.00006238904,0.0001406003,0.000028401186,0.00003212049],"category_scores_gemma":[0.00009214088,0.000043902346,0.000008764245,0.00044680707,0.00008898552,0.00013674708,0.000040543215,0.00016572105,0.0000070118754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030066385,0.000034590903,0.00010887721,0.00008409882,0.000074010226,0.0000013435068,0.0068366244,0.9686763,0.0023810484,0.016235514,0.00030176903,0.005235742],"study_design_scores_gemma":[0.0001656429,0.000118278454,0.0016873062,0.00006368992,0.000004502732,0.000007796644,0.0011639349,0.984895,0.011381926,0.0002595223,0.00014636006,0.00010602667],"about_ca_topic_score_codex":0.00009867478,"about_ca_topic_score_gemma":0.000121992154,"teacher_disagreement_score":0.45247763,"about_ca_system_score_codex":0.0000058645696,"about_ca_system_score_gemma":0.000039664013,"threshold_uncertainty_score":0.21650422},"labels":[],"label_agreement":null},{"id":"W1985290529","doi":"10.1016/s0191-2615(02)00045-0","title":"A tabu search heuristic for the static multi-vehicle dial-a-ride problem","year":2003,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":676,"is_retracted":false,"has_abstract":false,"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":"Tabu search; Heuristic; Computer science; Duration (music); Set (abstract data type); Mathematical optimization; Vehicle routing problem; Operations research; Transport engineering; Engineering; Routing (electronic design automation); Mathematics; Computer network; Algorithm; Artificial intelligence","score_opus":0.4602205926685543,"score_gpt":0.47685575810679187,"score_spread":0.016635165438237565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985290529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053348742,0.0002806599,0.9433785,0.0003988748,0.00017810476,0.0017507615,0.000065275264,0.00033842193,0.00026065053],"genre_scores_gemma":[0.24890427,0.00025459434,0.7492056,0.00006211994,0.00007860465,0.00095387705,0.00004859882,0.00007000002,0.00042233808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99378407,0.003486276,0.0006264859,0.00044792186,0.00072957145,0.0009256756],"domain_scores_gemma":[0.98468775,0.014203583,0.000045904555,0.00038784076,0.00044705567,0.00022789607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016544683,0.00022966127,0.00035849994,0.0001614785,0.00048178155,0.00009602624,0.00035845547,0.00018469288,0.0003674778],"category_scores_gemma":[0.0035743562,0.00016760621,0.0001422126,0.00088510604,0.0002953094,0.000122036174,0.000008302298,0.0008052832,0.000042815343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014577094,0.00016890644,0.004414084,0.000418674,0.0001325383,0.000024779145,0.0022360885,0.95849967,0.0061054584,0.015982006,0.0018387625,0.010033292],"study_design_scores_gemma":[0.0035301212,0.00046890994,0.044315383,0.000096007076,0.00012224574,0.000008458177,0.002267803,0.8897229,0.021641139,0.0070188628,0.029989662,0.00081854034],"about_ca_topic_score_codex":0.000033110537,"about_ca_topic_score_gemma":0.000049200215,"teacher_disagreement_score":0.19555554,"about_ca_system_score_codex":0.000078940284,"about_ca_system_score_gemma":0.000102314065,"threshold_uncertainty_score":0.6834783},"labels":[],"label_agreement":null},{"id":"W1985833421","doi":"10.1287/mnsc.47.9.1290.9780","title":"An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem","year":2001,"lang":"en","type":"article","venue":"Management Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"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; Group for Research in Decision Analysis","funders":"","keywords":"Mathematical optimization; Computer science; Scheduling (production processes); Schedule; Integer programming; Branch and bound; Column generation; Operations research; Job shop scheduling; Optimization problem; Branch and cut; Flow network; Linear programming; Mathematics","score_opus":0.024481551444291677,"score_gpt":0.2811633431568842,"score_spread":0.25668179171259253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985833421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041694534,0.00003207019,0.993615,0.0002342699,0.000068708716,0.00045593004,0.0000012578013,0.00015987329,0.0012634621],"genre_scores_gemma":[0.43582842,0.00005242384,0.5637999,0.000081228354,0.000017801125,0.000033859626,0.0000020826326,0.0000089923515,0.00017527804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924946,0.000010670665,0.0001274091,0.00021468088,0.00020376187,0.0001940417],"domain_scores_gemma":[0.999624,0.00006917479,0.000018500485,0.00017744856,0.00006327317,0.000047566617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076553924,0.000081204154,0.00005125933,0.00008490751,0.00044475007,0.00024405587,0.00025637393,0.0000130570925,0.000008250871],"category_scores_gemma":[0.000040771753,0.00006599156,0.000008189859,0.00038104135,0.000083343286,0.000400593,0.00004590468,0.000038865517,0.0000012878004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036065692,0.000010510273,0.000053453918,0.000013397248,0.0000042884653,4.6044588e-7,0.00011644459,0.99047095,0.00033513785,0.0044806586,0.000008260811,0.0045028296],"study_design_scores_gemma":[0.00016577423,0.000021986454,0.00003525083,0.0000071146846,0.000010623384,0.0000019021616,0.00004672892,0.999267,0.000063850355,0.00016969802,0.00011699959,0.00009311616],"about_ca_topic_score_codex":0.0000010384817,"about_ca_topic_score_gemma":0.0000013903705,"teacher_disagreement_score":0.43165898,"about_ca_system_score_codex":0.000040516356,"about_ca_system_score_gemma":0.000009492577,"threshold_uncertainty_score":0.34207028},"labels":[],"label_agreement":null},{"id":"W1985971056","doi":"10.1287/trsc.2015.0593","title":"A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and cut; Mathematical optimization; Branch and price; Integer programming; Linear programming; Arc (geometry); Branch and bound; Column generation; Mathematics; Minification; Integer (computer science); Set (abstract data type); Vehicle routing problem; Routing (electronic design automation); Algorithm; Computer science","score_opus":0.027579331617463003,"score_gpt":0.2762793489469292,"score_spread":0.24870001732946617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985971056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013054153,0.000104027735,0.9858073,0.00015031302,0.00018466495,0.00019555005,0.000010469172,0.0002120658,0.0002814278],"genre_scores_gemma":[0.7288464,0.000026955759,0.27083644,0.000090431415,0.00004807549,0.000051416697,0.000011326913,0.000019921375,0.000069026435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898607,0.000019551184,0.00024602044,0.00021036011,0.0003041997,0.0002337991],"domain_scores_gemma":[0.99929523,0.00015635211,0.000056487734,0.00013752964,0.00024860888,0.00010576529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088043755,0.00009952846,0.00009371846,0.000078649864,0.0002200335,0.000090310095,0.00019326143,0.00003792555,0.000004343045],"category_scores_gemma":[0.00006875512,0.00008401774,0.000022799994,0.0008048132,0.00012905757,0.00043645286,0.000004040137,0.000054818953,0.0000013915235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055823302,0.000010237203,0.00073220057,0.000018746312,0.000009374803,3.948316e-7,0.0040320302,0.83575183,0.003149986,0.004377481,0.0001250332,0.1517871],"study_design_scores_gemma":[0.00037375066,0.000016727377,0.0030267066,0.000010453955,0.000014983496,0.0000013336398,0.0002148483,0.988463,0.0060808565,0.00036410254,0.0013157754,0.000117470125],"about_ca_topic_score_codex":0.000030066052,"about_ca_topic_score_gemma":0.000018980449,"teacher_disagreement_score":0.71579224,"about_ca_system_score_codex":0.00004572792,"about_ca_system_score_gemma":0.00008139785,"threshold_uncertainty_score":0.34261438},"labels":[],"label_agreement":null},{"id":"W1986520459","doi":"10.1007/s10479-005-3445-y","title":"Depth-Optimized Convexity Cuts","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Convexity; Theory of computation; Intersection (aeronautics); Mathematics; Set (abstract data type); Computation; Mathematical optimization; Integer programming; Regular polygon; Function (biology); Order (exchange); Convex function; Integer (computer science); Linear programming; Algorithm; Computer science; Geometry","score_opus":0.24676143754847643,"score_gpt":0.4702200630803455,"score_spread":0.22345862553186904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986520459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45872465,0.0015864435,0.39849108,0.010976616,0.0002505415,0.0011460008,0.000053022985,0.00070285157,0.12806877],"genre_scores_gemma":[0.80894274,0.00045026574,0.1888357,0.00008727252,0.000116872056,0.000039473915,0.000015010478,0.000029699306,0.0014829533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998519,0.00028125523,0.00031315308,0.00014608778,0.00040187375,0.00033860822],"domain_scores_gemma":[0.99857986,0.0001966521,0.000008697627,0.00034030247,0.000765957,0.000108541215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001926734,0.0000884436,0.00016170285,0.00027552983,0.00017279157,0.00007132868,0.00023377102,0.00008253978,0.00052223494],"category_scores_gemma":[0.0005568069,0.00009139159,0.0000515685,0.0005923336,0.00011147838,0.00027981945,0.000053294974,0.00030158155,0.0001720903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069999414,0.000037954185,0.00009162462,0.000016744336,0.000023986604,6.791924e-7,0.00028339386,0.97880334,0.0033654901,0.0012382627,0.0067693368,0.009362206],"study_design_scores_gemma":[0.0002517535,0.00002705519,0.0005190633,0.000015068828,0.0000019810702,0.0000020304942,0.000057966394,0.92214465,0.0694387,0.00004525501,0.007398505,0.000097946766],"about_ca_topic_score_codex":0.000035756377,"about_ca_topic_score_gemma":0.000051618554,"teacher_disagreement_score":0.3502181,"about_ca_system_score_codex":0.00002482605,"about_ca_system_score_gemma":0.000070998954,"threshold_uncertainty_score":0.57181066},"labels":[],"label_agreement":null},{"id":"W1987114813","doi":"10.1080/18756891.2012.670526","title":"Commercial Territory Design for a Distribution Firm with New Constructive and Destructive Heuristics","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence Systems","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":"HEC Montréal","funders":"Universidad Autónoma de Nuevo León; Consejo Nacional de Ciencia y Tecnología","keywords":"Heuristics; Constructive; Distribution (mathematics); Computer science; Operations research; Mathematics; Programming language","score_opus":0.035840868423751795,"score_gpt":0.30499818292496284,"score_spread":0.26915731450121105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987114813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02425823,0.00043892674,0.9727772,0.00006316846,0.0021190546,0.00020891371,0.0000658366,0.000028985609,0.000039687195],"genre_scores_gemma":[0.80566084,0.000016431031,0.19342592,0.000013301158,0.0008288503,0.0000058323626,0.000023350545,0.000017387452,0.00000805303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876887,0.00007963113,0.0005118203,0.00008312873,0.00039772555,0.00015883514],"domain_scores_gemma":[0.9977777,0.00081651227,0.00028253466,0.000044137112,0.0009318293,0.00014727045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054202,0.00014080334,0.00020800102,0.00012472336,0.00005373037,0.00009165701,0.00017833369,0.00006228319,0.0000054370103],"category_scores_gemma":[0.00017419962,0.00012818901,0.000047545298,0.00008285202,0.000089302885,0.00039007657,0.000016319978,0.00015103487,0.0000015958801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012782137,0.000021347696,0.0033905196,0.000018204357,0.00022706525,0.0000025008278,0.0005012474,0.9781749,0.00002133541,0.006213203,0.0004962573,0.010805594],"study_design_scores_gemma":[0.000831793,0.00028193946,0.010903995,0.0003229067,0.00009141784,0.0020928,0.00080576655,0.97391194,0.0012465497,0.0076337587,0.001517471,0.0003596322],"about_ca_topic_score_codex":0.0000120184,"about_ca_topic_score_gemma":6.1908736e-7,"teacher_disagreement_score":0.78140265,"about_ca_system_score_codex":0.0002188957,"about_ca_system_score_gemma":0.000118915304,"threshold_uncertainty_score":0.5227396},"labels":[],"label_agreement":null},{"id":"W1988046523","doi":"10.1016/j.trb.2005.05.005","title":"An extended branch-and-bound method for locomotive assignment","year":2005,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"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; Group for Research in Decision Analysis","funders":"","keywords":"Backtracking; Branch and bound; Mathematical optimization; Computer science; Heuristic; Node (physics); Integer programming; Branch and cut; Set (abstract data type); Branch and price; Operations research; Mathematics; Engineering","score_opus":0.29082360243951133,"score_gpt":0.49626654877510373,"score_spread":0.2054429463355924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988046523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05970383,0.00014664374,0.9379455,0.0005157872,0.0000939612,0.00086529914,0.000049103797,0.0003850965,0.00029476342],"genre_scores_gemma":[0.19309376,0.000099034114,0.80591476,0.000086246764,0.00020835311,0.00036699988,0.00007832677,0.00004288213,0.00010961621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995252,0.002607153,0.0005090815,0.0005047779,0.00051108026,0.0006158804],"domain_scores_gemma":[0.9948059,0.004300167,0.00004593808,0.0002834515,0.00026305855,0.000301503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0122687435,0.00021471975,0.00038612197,0.00019360817,0.00025005333,0.000078515004,0.00022448621,0.00023684921,0.00032296815],"category_scores_gemma":[0.00058418274,0.00019522227,0.00009185762,0.00037214928,0.00016202297,0.00026381595,0.000006702639,0.0004874486,0.000012267306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002554586,0.00021660085,0.0010874072,0.00015236645,0.000107055945,0.0000067420747,0.0018309761,0.66036665,0.042734675,0.014291508,0.00071776763,0.27823278],"study_design_scores_gemma":[0.002169084,0.00079221977,0.064357914,0.0000458148,0.00007246063,0.0000046918317,0.00058466743,0.8266446,0.06822737,0.0125465905,0.023884168,0.00067042524],"about_ca_topic_score_codex":0.000009976967,"about_ca_topic_score_gemma":0.000036250825,"teacher_disagreement_score":0.27756235,"about_ca_system_score_codex":0.00009071784,"about_ca_system_score_gemma":0.00003383786,"threshold_uncertainty_score":0.7960933},"labels":[],"label_agreement":null},{"id":"W1988125100","doi":"10.3138/infor.50.4.195","title":"A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations","year":2012,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Norges Forskningsråd","keywords":"Heuristic; Neighbourhood (mathematics); Submarine pipeline; Mathematical optimization; Time horizon; Computer science; Offshore oil and gas; Operations research; Engineering; Mathematics","score_opus":0.04873724817383932,"score_gpt":0.34939307179331064,"score_spread":0.3006558236194713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988125100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7811808,0.0023006906,0.2028833,0.0006690527,0.00035873312,0.0016426777,0.00034274452,0.00019830331,0.010423696],"genre_scores_gemma":[0.9867573,0.00014222322,0.012061737,0.000046461697,0.00015030174,0.00043019303,0.00025063087,0.000020784728,0.00014040036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801177,0.00013162593,0.0006408314,0.00011399645,0.00052443385,0.00057735556],"domain_scores_gemma":[0.9987963,0.00036664135,0.00002816853,0.00012567957,0.0004951007,0.00018812365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038953368,0.00015048902,0.00020651786,0.00057091523,0.00057618803,0.0009362268,0.00009956611,0.00013483012,0.000019126583],"category_scores_gemma":[0.00039890324,0.00014573672,0.000021430791,0.0004159218,0.00005530099,0.00254054,0.00007037575,0.00035391023,0.0000144732785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052945627,0.00004125011,0.025591051,0.0015575463,0.00004333464,8.532201e-7,0.04676291,0.85491717,0.00025278315,0.057737306,0.00076298584,0.012279863],"study_design_scores_gemma":[0.00093914894,0.000044024095,0.006303553,0.00021160037,0.0000037714742,0.000035693418,0.006884112,0.9735055,0.00005851465,0.00001690564,0.011810405,0.00018680132],"about_ca_topic_score_codex":0.00008996252,"about_ca_topic_score_gemma":0.000012246247,"teacher_disagreement_score":0.20557646,"about_ca_system_score_codex":0.0001390226,"about_ca_system_score_gemma":0.00015911991,"threshold_uncertainty_score":0.9028057},"labels":[],"label_agreement":null},{"id":"W1988297777","doi":"10.1287/opre.51.2.228.12786","title":"An Oil Pipeline Design Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":64,"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; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Port (circuit theory); Integer programming; Pipeline (software); Mathematical optimization; Set (abstract data type); Integer (computer science); Computer science; Connection (principal bundle); Variable (mathematics); Submarine pipeline; Branch and cut; Mathematics; Engineering; Geometry","score_opus":0.11329738327680722,"score_gpt":0.4025412408418159,"score_spread":0.2892438575650087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988297777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004635239,0.00010561262,0.9577064,0.00011520781,0.000060737075,0.00016544899,0.0000029953533,0.00025940212,0.036948994],"genre_scores_gemma":[0.22809768,0.000081373415,0.7665103,0.000015050924,0.00005561471,0.000110481014,0.000012785683,0.0000439027,0.0050728014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981393,0.0008667905,0.00018403432,0.00017415715,0.0003045348,0.0003311449],"domain_scores_gemma":[0.9990566,0.00012512846,0.0000028781205,0.00035394193,0.0003383741,0.00012310335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029571464,0.000082551414,0.00008326778,0.00020047011,0.00032755875,0.00020581612,0.00017158163,0.00006989285,0.00048415404],"category_scores_gemma":[0.00038419268,0.00008348073,0.000015286663,0.0007446233,0.00004277921,0.0002482697,0.000011613277,0.00030756596,0.00020455598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011412185,0.00003116938,0.000022192773,0.000010231389,0.0000039682955,0.0000014962716,0.00021757431,0.97222185,0.014683233,0.0037776905,0.0012100842,0.007819363],"study_design_scores_gemma":[0.00015650124,0.00003202013,0.000011121499,0.00000810573,0.0000016592244,0.000005217528,0.000090432855,0.9747919,0.019123541,0.000096515825,0.0055803256,0.000102655045],"about_ca_topic_score_codex":0.000016438169,"about_ca_topic_score_gemma":0.000022421786,"teacher_disagreement_score":0.22346243,"about_ca_system_score_codex":0.00008130896,"about_ca_system_score_gemma":0.000110337,"threshold_uncertainty_score":0.5301147},"labels":[],"label_agreement":null},{"id":"W1988416901","doi":"10.1016/j.cor.2008.08.010","title":"Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Kronos (Canada)","funders":"","keywords":"Computer science; Depot; Scheduling (production processes); Reduction (mathematics); Mathematical optimization; Window (computing); Dynamic programming; Real-time computing; Algorithm; Mathematics; Operating system","score_opus":0.04590354069195404,"score_gpt":0.32038094198709677,"score_spread":0.27447740129514275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988416901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18512201,0.00015861413,0.8123127,0.0006008228,0.000122112,0.0012716962,0.0000060749157,0.0002796061,0.00012631484],"genre_scores_gemma":[0.53684217,0.00004800648,0.4623868,0.000011764799,0.00009602004,0.00023645093,0.000026451005,0.000047625534,0.00030470503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984609,0.00019372888,0.00025118698,0.00028761174,0.0003674965,0.00043910366],"domain_scores_gemma":[0.9985127,0.0005343774,0.000013848748,0.00039872565,0.00045110408,0.00008923945],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00090532156,0.00014815835,0.00015056475,0.00020145846,0.0013804013,0.00018193659,0.00032800113,0.000076454984,0.000015028711],"category_scores_gemma":[0.0001209953,0.0001173072,0.000047100668,0.0007569652,0.00017913437,0.00028528832,0.00006688035,0.00041774017,0.000047868245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019592768,0.00002698302,0.00011422217,0.000020795305,0.000046279678,0.0000019882918,0.00068295054,0.9786927,0.01384945,0.00004786148,0.00029314344,0.0062039993],"study_design_scores_gemma":[0.0006776015,0.00008401829,0.00060009694,0.000037503447,0.000007923545,0.00006220561,0.00010360364,0.9950774,0.0028083795,0.00000977344,0.00038328895,0.00014821957],"about_ca_topic_score_codex":0.000032424083,"about_ca_topic_score_gemma":0.000029524344,"teacher_disagreement_score":0.35172015,"about_ca_system_score_codex":0.00017702596,"about_ca_system_score_gemma":0.00013097339,"threshold_uncertainty_score":0.99991965},"labels":[],"label_agreement":null},{"id":"W1989080137","doi":"10.1057/palgrave.jors.2602305","title":"Solving school bus routing problems through integer programming","year":2006,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":101,"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; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Integer programming; Routing (electronic design automation); Mathematical optimization; Purchasing; Computer science; Integer (computer science); Linear programming; Scheduling (production processes); Operations research; Mathematics; Engineering; Computer network; Operations management","score_opus":0.05082829012856907,"score_gpt":0.35152154272370767,"score_spread":0.30069325259513857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989080137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21956629,0.0023039335,0.75826293,0.0077293436,0.0013944461,0.0011758852,0.00000851567,0.00020995145,0.009348728],"genre_scores_gemma":[0.68963,0.00009279543,0.30813923,0.000089477704,0.0010647061,0.0000137625575,0.0000024236394,0.00004412321,0.000923515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974034,0.00029960962,0.0005734067,0.00011867578,0.0011916789,0.00041323708],"domain_scores_gemma":[0.9981661,0.000381597,0.000115126684,0.00017811304,0.0010831539,0.00007595222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049402234,0.00012326654,0.0001699653,0.00004698829,0.0005924508,0.00037505873,0.00045560865,0.00010301887,0.00007778617],"category_scores_gemma":[0.001115635,0.00008624888,0.00025658045,0.0007040255,0.00011549976,0.0005957288,0.00012598644,0.0012638762,0.000009540065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004282629,0.000039896575,0.002683036,0.00004321626,0.00007146976,0.0000015851222,0.00081707374,0.9640953,0.013537849,0.001589481,0.016041938,0.0010748608],"study_design_scores_gemma":[0.0010836056,0.00008299608,0.0045076404,0.0005704562,0.000028202974,0.00013694004,0.001355917,0.951883,0.009341685,0.003106412,0.02756874,0.00033436206],"about_ca_topic_score_codex":0.000037322134,"about_ca_topic_score_gemma":0.0000061789733,"teacher_disagreement_score":0.4700637,"about_ca_system_score_codex":0.00050759234,"about_ca_system_score_gemma":0.00030647375,"threshold_uncertainty_score":0.5490984},"labels":[],"label_agreement":null},{"id":"W1989456306","doi":"10.1016/j.trc.2010.02.003","title":"A dynamic capacitated arc routing problem with time-dependent service costs","year":2010,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"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é de Montréal","funders":"","keywords":"Piecewise linear function; Service (business); Computer science; Arc routing; Mathematical optimization; Interval (graph theory); Heuristic; Routing (electronic design automation); Variable (mathematics); Function (biology); Piecewise; Arc (geometry); Operations research; Mathematics; Computer network; Economics","score_opus":0.023770545874777185,"score_gpt":0.3093435218559584,"score_spread":0.28557297598118125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989456306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93921983,0.00006650391,0.045755707,0.0021338845,0.00014013208,0.0010098391,0.00004316996,0.009926975,0.0017039323],"genre_scores_gemma":[0.87949234,0.000067877416,0.11980778,0.000010563122,0.000011007815,0.00023674745,0.000093994015,0.00009305125,0.0001866226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975715,0.00008907425,0.0004340491,0.00042073062,0.00071805646,0.0007665586],"domain_scores_gemma":[0.9985378,0.00022729351,0.000071065806,0.00053817435,0.0005452859,0.000080378966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014131289,0.00025927194,0.00025373613,0.00053051795,0.00031480743,0.000092089234,0.00051562587,0.0002663378,0.00008805106],"category_scores_gemma":[0.00016790452,0.00024523813,0.00003674743,0.0018136061,0.00021390965,0.0002885865,0.000021446633,0.0015035471,0.00007737052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009878234,0.00013740832,0.012200137,0.0006040646,0.0002716872,0.00010913543,0.0035876276,0.62537175,0.30288282,0.0045747054,0.00075024046,0.04941162],"study_design_scores_gemma":[0.0015030979,0.00018161493,0.004401817,0.00049825816,0.000054290438,0.000016069436,0.005236347,0.916557,0.065072946,0.0016954523,0.0036982184,0.0010848476],"about_ca_topic_score_codex":0.000108071596,"about_ca_topic_score_gemma":0.0019643432,"teacher_disagreement_score":0.29118526,"about_ca_system_score_codex":0.000113790426,"about_ca_system_score_gemma":0.00006501663,"threshold_uncertainty_score":1},"labels":[],"label_agreement":null},{"id":"W1989850675","doi":"10.1002/net.3","title":"The capacitated arc routing problem with intermediate facilities","year":2001,"lang":"en","type":"article","venue":"Networks","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; Université de Montréal","funders":"","keywords":"Arc routing; Benchmark (surveying); Arc (geometry); Mathematical optimization; Routing (electronic design automation); Computer science; Relaxation (psychology); Set (abstract data type); Integer programming; Integer (computer science); Upper and lower bounds; Mathematics; Computer network; Geography","score_opus":0.011514392974517382,"score_gpt":0.2159405566209453,"score_spread":0.2044261636464279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989850675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10141757,0.0003711052,0.8774716,0.0001228698,0.00037886057,0.00024558062,0.0000022339218,0.0009640518,0.019026121],"genre_scores_gemma":[0.9842566,0.00020235003,0.014054942,0.00004143091,0.00017376115,0.000029611921,0.0000068267746,0.00004400046,0.0011904723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991213,0.00006961032,0.00019728372,0.000119290926,0.000115835035,0.000376678],"domain_scores_gemma":[0.99944454,0.0002188825,0.000035067205,0.00019564202,0.00005087586,0.000054967462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840531,0.00013573638,0.00011311554,0.00002554972,0.00018019743,0.00009906384,0.00014901954,0.00006622713,0.000022208107],"category_scores_gemma":[0.000032903863,0.00009327234,0.000025448544,0.00025478943,0.00007618181,0.00008623182,0.000022191243,0.0002872861,0.000009596825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010559767,0.0000021419664,0.0023019603,0.0000068393765,0.000027444257,0.000004189709,0.00055713777,0.9732297,0.000010961584,0.0001438853,0.0005394293,0.023165742],"study_design_scores_gemma":[0.00019788131,0.000021524927,0.0007849363,0.000047082725,0.0000073307187,0.000016151173,0.00033868648,0.9915153,0.000027845148,0.00007576241,0.0068247803,0.00014274815],"about_ca_topic_score_codex":0.000011341772,"about_ca_topic_score_gemma":0.000050963845,"teacher_disagreement_score":0.882839,"about_ca_system_score_codex":0.00004704496,"about_ca_system_score_gemma":0.000008662758,"threshold_uncertainty_score":0.38035357},"labels":[],"label_agreement":null},{"id":"W1990619572","doi":"10.1080/00207543.2014.986299","title":"An optimised target-level inventory replenishment policy for vendor-managed inventory systems","year":2014,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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":"Vendor; Benchmark (surveying); Context (archaeology); Vendor-managed inventory; Operations research; Inventory theory; Perpetual inventory; Order (exchange); Inventory management; Business; Inventory control; Computer science; Economic order quantity; Operations management; Supply chain; Marketing; Economics; Supply chain management; Engineering","score_opus":0.12116858708444392,"score_gpt":0.41696922488686344,"score_spread":0.2958006378024195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990619572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17066944,0.00073781755,0.8021223,0.006920213,0.015534001,0.0013269838,0.0000378438,0.00030374038,0.0023476672],"genre_scores_gemma":[0.92730963,0.00012898381,0.06482132,0.00004493393,0.0065792147,0.000059994767,0.000024575747,0.00007119926,0.00096013624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969297,0.0006161177,0.00066813006,0.00023455956,0.0012381951,0.0003132722],"domain_scores_gemma":[0.9967642,0.00014785024,0.00021515125,0.00031278637,0.0023699224,0.0001901142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007651888,0.00013133176,0.00021130191,0.0011687767,0.00012687873,0.00018018155,0.00068295194,0.00008406923,0.000031975826],"category_scores_gemma":[0.0028127385,0.00013449696,0.00010483686,0.00032870763,0.000079742116,0.00048635897,0.000048436486,0.00046779957,0.000009520048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014886362,0.0001249751,0.00060083816,0.00010743687,0.00021735702,0.000005498357,0.0004832009,0.96241176,0.013023831,0.0029385919,0.012674363,0.007263311],"study_design_scores_gemma":[0.0018689373,0.00044782457,0.0007943867,0.00024012086,0.000020952077,0.000165361,0.00055689656,0.8881598,0.020275848,0.0026018887,0.08455035,0.000317641],"about_ca_topic_score_codex":0.000025973553,"about_ca_topic_score_gemma":0.0000016587536,"teacher_disagreement_score":0.7566402,"about_ca_system_score_codex":0.00072461116,"about_ca_system_score_gemma":0.00018566252,"threshold_uncertainty_score":0.5484627},"labels":[],"label_agreement":null},{"id":"W1991149726","doi":"10.1287/trsc.1030.0079","title":"Traveling Salesman Problems with Profits","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":617,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Profit (economics); Generalization; Vertex (graph theory); Heuristic; Traveling purchaser problem; Operations research; Computer science; Combinatorial optimization; Bottleneck traveling salesman problem; Mathematics; Economics; Combinatorics; Microeconomics; Graph","score_opus":0.01684428022553878,"score_gpt":0.25274875513127243,"score_spread":0.23590447490573366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991149726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52301276,0.00002080558,0.473717,0.000077835546,0.00004963461,0.00015503776,0.0000026112225,0.00037770142,0.0025866106],"genre_scores_gemma":[0.8000012,0.0000062867184,0.19985498,0.000025750254,0.000024722023,0.000011817866,0.000004395094,0.000014225081,0.000056622295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908215,0.000006995478,0.00018647707,0.00018388328,0.00032331454,0.00021716133],"domain_scores_gemma":[0.9996554,0.000016761678,0.00002804415,0.00012397328,0.00009792182,0.00007786317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004343075,0.000088311455,0.0000764706,0.000085542866,0.00010934228,0.0000419231,0.00015936897,0.000024192035,0.00002867898],"category_scores_gemma":[0.0000083344885,0.00007925955,0.000012800543,0.00081532187,0.00011423368,0.00050804357,8.120352e-7,0.00008166708,0.000019363688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016008504,0.000005534977,0.0029370098,0.000018030296,0.0000019333042,5.562813e-7,0.0016039703,0.9713183,0.015270063,0.00054845156,0.00000401386,0.008290523],"study_design_scores_gemma":[0.00051881943,0.000036403435,0.106189474,0.0000694744,0.000015871321,0.000005470345,0.00012971881,0.83133197,0.059997763,0.000043902455,0.0013198981,0.0003412364],"about_ca_topic_score_codex":0.0000023819562,"about_ca_topic_score_gemma":0.00003660411,"teacher_disagreement_score":0.27698845,"about_ca_system_score_codex":0.000040771574,"about_ca_system_score_gemma":0.000048423426,"threshold_uncertainty_score":0.32321107},"labels":[],"label_agreement":null},{"id":"W1992769367","doi":"10.1016/j.disopt.2014.03.001","title":"A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints","year":2014,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":212,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Mathematics; Upper and lower bounds; Algorithm; Branch and cut; Computer science; Linear programming","score_opus":0.02244022931863883,"score_gpt":0.25673848990929843,"score_spread":0.2342982605906596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992769367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006707916,0.00007005527,0.9973019,0.00020997037,0.00018110804,0.00063727295,0.000025256524,0.00037809002,0.00052555674],"genre_scores_gemma":[0.15943478,0.000042758133,0.8400558,0.000076867145,0.00012520114,0.00003826369,0.00003975519,0.000071759634,0.00011478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876416,0.000112671216,0.0003349766,0.0002926137,0.00015612211,0.00033945256],"domain_scores_gemma":[0.9990881,0.00035519167,0.00010133899,0.0002453136,0.00008818936,0.00012183157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728916,0.00023351592,0.00021322364,0.000058031903,0.00028168038,0.00017793804,0.00014909197,0.00013027534,0.00003126754],"category_scores_gemma":[0.00016333476,0.00019849106,0.00006194803,0.00020565744,0.00008324117,0.00027502817,0.00004001522,0.00017399789,0.0000024156209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027419078,0.0000051891902,0.00018357612,0.000020229238,0.000040915802,8.7676625e-8,0.0003288847,0.889507,0.00012564917,0.00078396645,0.00003766554,0.1089641],"study_design_scores_gemma":[0.0010876169,0.0000252518,0.0004906297,0.000037769438,0.000058094833,0.0000057035,0.00014312375,0.99711734,0.00048569235,0.00012161497,0.00017230565,0.0002548579],"about_ca_topic_score_codex":0.00004917153,"about_ca_topic_score_gemma":0.000011204293,"teacher_disagreement_score":0.15876399,"about_ca_system_score_codex":0.00006732005,"about_ca_system_score_gemma":0.000027112901,"threshold_uncertainty_score":0.809423},"labels":[],"label_agreement":null},{"id":"W1995340813","doi":"10.1057/jors.2013.170","title":"A column generation algorithm for tactical timber transportation planning","year":2014,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","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":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Operations research; Truck; Computer science; Time horizon; Scheduling (production processes); Flow network; Heuristics; Engineering; Operations management; Economics; Finance; Mathematical optimization","score_opus":0.08738142139463055,"score_gpt":0.39749695608852875,"score_spread":0.3101155346938982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995340813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03530289,0.000051225637,0.9628641,0.0010775095,0.0003307087,0.00019159733,0.000011249729,0.000014268143,0.00015646179],"genre_scores_gemma":[0.29186904,0.000027617683,0.70591354,0.00019355884,0.0014952862,0.000024299436,0.000020146137,0.00003225805,0.00042421662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985199,0.00021360084,0.0003259734,0.000078710465,0.0006774539,0.00018434951],"domain_scores_gemma":[0.9984297,0.00052277633,0.00005806847,0.00009229381,0.0008265729,0.00007058387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037059868,0.000069176895,0.00011550111,0.000035992867,0.0003437377,0.00011794423,0.00017160014,0.00008484248,0.0000314551],"category_scores_gemma":[0.0004966834,0.000052620195,0.0001701605,0.00021085437,0.00005181127,0.00024576084,0.00000817224,0.00040968612,0.0000018893686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047178078,0.000020927533,0.00018525784,0.000016315702,0.000059022892,2.4350223e-7,0.0007049784,0.95049095,0.0095782345,0.0005946489,0.03181213,0.0065325885],"study_design_scores_gemma":[0.0004238955,0.000052722702,0.0011894004,0.00002391773,0.000012089303,0.0000073640267,0.00008127376,0.985816,0.0032530476,0.00020579503,0.008876183,0.000058326892],"about_ca_topic_score_codex":0.0000016196472,"about_ca_topic_score_gemma":0.0000014479094,"teacher_disagreement_score":0.25695053,"about_ca_system_score_codex":0.00017325931,"about_ca_system_score_gemma":0.0001269847,"threshold_uncertainty_score":0.26437873},"labels":[],"label_agreement":null},{"id":"W1995945236","doi":"10.1007/s10732-012-9194-6","title":"Experimental analysis of heuristics for the bottleneck traveling salesman problem","year":2012,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"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 New Brunswick; Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Heuristics; Bottleneck; Mathematical optimization; Heuristic; Computer science; Lin–Kernighan heuristic; Bottleneck traveling salesman problem; Graph; Mathematics; Algorithm; Theoretical computer science","score_opus":0.028921182188774822,"score_gpt":0.30402834232860165,"score_spread":0.27510716013982683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995945236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07220146,0.0023960713,0.92436963,0.000035088313,0.00061101414,0.00011985893,0.000030074178,0.000023800902,0.00021297544],"genre_scores_gemma":[0.74216515,0.00010376816,0.25737703,0.000014785865,0.00028433168,0.0000021974565,0.0000030887195,0.000029335439,0.000020305557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863183,0.000056050238,0.0007521365,0.000057111156,0.00026184498,0.00024104008],"domain_scores_gemma":[0.9984632,0.0006833628,0.00034532184,0.00017324682,0.00023541004,0.000099422745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010897716,0.00013308831,0.00038416064,0.00016914851,0.00007251645,0.000023724273,0.00021401771,0.00006900636,0.000023548202],"category_scores_gemma":[0.0003153435,0.00010201395,0.00024709463,0.00038498722,0.000042343865,0.000084195504,0.000020601969,0.00019339201,8.000429e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027601638,0.00010892294,0.005116494,0.0000832238,0.0012075723,0.0000017295256,0.001247709,0.9833485,0.0056562517,0.00070549716,0.0010793298,0.0014171939],"study_design_scores_gemma":[0.0006137888,0.00012762743,0.005745048,0.00005156055,0.0026529278,0.000034433666,0.00061531516,0.96521276,0.021597313,0.00008657298,0.0030336387,0.00022902066],"about_ca_topic_score_codex":0.0000011854742,"about_ca_topic_score_gemma":4.225303e-7,"teacher_disagreement_score":0.6699637,"about_ca_system_score_codex":0.000067960085,"about_ca_system_score_gemma":0.000024284844,"threshold_uncertainty_score":0.41600084},"labels":[],"label_agreement":null},{"id":"W1997194016","doi":"10.1016/j.cor.2005.05.024","title":"Arcs-states models for the vehicle routing problem with time windows and related problems","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","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":"Université de Montréal","funders":"","keywords":"Column generation; Benchmark (surveying); Vehicle routing problem; Upper and lower bounds; Branch and bound; Relaxation (psychology); Routing (electronic design automation); Arc routing; Linear programming relaxation; Computer science; Arc (geometry); Mathematical optimization; Time complexity; Mathematics; Algorithm; Linear programming","score_opus":0.039670149775145915,"score_gpt":0.30868088785053627,"score_spread":0.26901073807539033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997194016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023666967,0.00040405995,0.9703326,0.002712411,0.000036038935,0.0016707925,0.000009088916,0.00031326344,0.0008547727],"genre_scores_gemma":[0.60290384,0.000091469534,0.3956331,0.000044233,0.000095380165,0.00029348585,0.000032090666,0.00006937498,0.0008370027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858236,0.00017388296,0.00027502584,0.00026371246,0.00027157564,0.0004334128],"domain_scores_gemma":[0.99866,0.0006351694,0.000013049211,0.00028160232,0.000321271,0.00008889178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015995123,0.000139055,0.00014332752,0.00014302769,0.00074162916,0.00038579834,0.00025026855,0.00006580903,0.00001641481],"category_scores_gemma":[0.00004139206,0.000102837854,0.000026156891,0.00051568693,0.00012921331,0.00038513087,0.000093214774,0.00036456352,0.00001979336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004938232,0.00001609147,0.000028725572,0.000025484005,0.00004851596,4.0408742e-7,0.002030422,0.9795497,0.000682008,0.0011299672,0.00053595606,0.015947802],"study_design_scores_gemma":[0.00056029495,0.00007090446,0.000057640504,0.0000632834,0.000009217322,0.000012394699,0.00008857863,0.9976456,0.00036216946,0.00023560273,0.0007565203,0.0001378052],"about_ca_topic_score_codex":0.000022767023,"about_ca_topic_score_gemma":0.000026454327,"teacher_disagreement_score":0.5792369,"about_ca_system_score_codex":0.0000926802,"about_ca_system_score_gemma":0.000057403784,"threshold_uncertainty_score":0.5704087},"labels":[],"label_agreement":null},{"id":"W1998193115","doi":"10.1007/s10479-010-0715-0","title":"Using local search to speed up filtering algorithms for some NP-hard constraints","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Theory of computation; Local search (optimization); Algorithm; Computer science; Local consistency; Filter (signal processing); Consistency (knowledge bases); Computational complexity theory; Graph; Search tree; Search algorithm; Substructure; Constraint (computer-aided design); Guided Local Search; Mathematical optimization; Mathematics; Constraint satisfaction problem; Theoretical computer science; Artificial intelligence","score_opus":0.40089166799307197,"score_gpt":0.5075783819447462,"score_spread":0.10668671395167428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998193115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34739488,0.000022972617,0.65055156,0.0006641248,0.00027784257,0.000592547,0.000085884385,0.00007366141,0.00033649954],"genre_scores_gemma":[0.66262835,0.000018626444,0.33666623,0.00006096606,0.0002082636,0.00003343333,0.000018871628,0.00005001391,0.00031525813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981779,0.00014442603,0.00036098587,0.00025209115,0.00047697386,0.00058761565],"domain_scores_gemma":[0.99798614,0.00029945688,0.000008898757,0.00037537672,0.001100267,0.00022988216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029894079,0.00012711177,0.00020871076,0.00050023384,0.0002996888,0.00015882395,0.00032277982,0.000102923164,0.0002443507],"category_scores_gemma":[0.0007633409,0.0001396348,0.000067059846,0.00061050616,0.00024752584,0.0002956628,0.000112151574,0.0004945618,0.000037137346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000886413,0.00001872524,0.00002046934,0.000045593828,0.000024546625,0.0000013972483,0.00031784878,0.7112515,0.26734957,0.0014687419,0.000563349,0.018929392],"study_design_scores_gemma":[0.00017762701,0.00004986934,0.00008467542,0.00002317267,0.000002039705,0.000007821751,0.00016821634,0.736266,0.2625711,0.000042417807,0.0004942075,0.000112811125],"about_ca_topic_score_codex":0.00007749744,"about_ca_topic_score_gemma":0.0000225085,"teacher_disagreement_score":0.31523347,"about_ca_system_score_codex":0.00003137809,"about_ca_system_score_gemma":0.00016090782,"threshold_uncertainty_score":0.5694142},"labels":[],"label_agreement":null},{"id":"W1998243034","doi":"10.1016/j.dam.2003.09.012","title":"Variable neighborhood search for the maximum clique","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Clique; Heuristic; Variable neighborhood search; Clique problem; Vertex (graph theory); Greedy algorithm; Mathematical optimization; Simplicity; Combinatorics; Variable (mathematics); Algorithm; Metaheuristic; Graph; Chordal graph","score_opus":0.019684030115138522,"score_gpt":0.26877238570278233,"score_spread":0.2490883555876438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998243034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006037512,0.00005001035,0.9717149,0.00015133142,0.0001029619,0.000740184,0.000017906388,0.00036810833,0.026250832],"genre_scores_gemma":[0.123817086,0.000022506882,0.8755813,0.00008722643,0.000104194434,0.00022329712,0.0000143024645,0.00009758905,0.000052465206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902755,0.000007584381,0.0002904553,0.00015070115,0.00018142673,0.00034225805],"domain_scores_gemma":[0.9990101,0.0004030047,0.000038131482,0.0004423522,0.000043944303,0.00006245692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059963926,0.00017604101,0.00020086093,0.00004041966,0.00015029637,0.000078343626,0.0002935613,0.000099827,0.00003738424],"category_scores_gemma":[0.00004671484,0.0001331332,0.00006022155,0.00024712135,0.000039790037,0.000049240905,0.000049420156,0.00018398101,0.00003636561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029242613,0.000015664542,0.0000013560868,0.00018231882,0.00004111444,2.070718e-7,0.0006687192,0.5281119,0.002306528,0.4674951,0.000062929816,0.0011112799],"study_design_scores_gemma":[0.0010420704,0.000024244056,0.000010996695,0.000051658022,0.00008787603,0.000007658733,0.0009725495,0.70189947,0.023401527,0.27101988,0.0011164269,0.00036561143],"about_ca_topic_score_codex":0.0000022405684,"about_ca_topic_score_gemma":6.1047274e-7,"teacher_disagreement_score":0.19647522,"about_ca_system_score_codex":0.000066776265,"about_ca_system_score_gemma":0.00003688776,"threshold_uncertainty_score":0.54290146},"labels":[],"label_agreement":null},{"id":"W1999614211","doi":"10.1057/palgrave.jors.2601590","title":"Exact solution of the generalized routing problem through graph transformations","year":2003,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Graph traversal; Vehicle routing problem; Mathematical optimization; Computer science; Graph; Tree traversal; Scheduling (production processes); Routing (electronic design automation); Mathematics; Combinatorics; Theoretical computer science; Algorithm","score_opus":0.06518996431258268,"score_gpt":0.35665408507138946,"score_spread":0.2914641207588068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999614211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25277025,0.0008789525,0.7270448,0.007870351,0.00087579736,0.0009817462,0.000027021331,0.000042895063,0.009508182],"genre_scores_gemma":[0.84294814,0.00030683543,0.15631004,0.00008271962,0.00009788688,0.000008042282,0.000001176602,0.00001878052,0.0002264032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974033,0.00076003635,0.00053928106,0.0000656486,0.000998244,0.00023345476],"domain_scores_gemma":[0.9986029,0.00026971602,0.00012722246,0.00018337683,0.0007749162,0.000041817184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045948424,0.00008752468,0.00014337296,0.00003471109,0.0006072943,0.00007009522,0.00036964208,0.00007921074,0.000057406633],"category_scores_gemma":[0.0005681177,0.00005151903,0.00035734585,0.0007575324,0.00013541243,0.00041244025,0.000032898424,0.0006614179,0.0000011027846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004911621,0.00003687574,0.0005009025,0.00004033314,0.00011071747,9.349337e-8,0.003250176,0.936942,0.036630176,0.0154928295,0.006804238,0.00018677693],"study_design_scores_gemma":[0.0029575306,0.00011637206,0.0059643593,0.0005007114,0.0001006721,0.00014737333,0.002269519,0.7826799,0.1695546,0.02112997,0.014181809,0.0003971398],"about_ca_topic_score_codex":0.000009071856,"about_ca_topic_score_gemma":0.000003147205,"teacher_disagreement_score":0.59017783,"about_ca_system_score_codex":0.00020448555,"about_ca_system_score_gemma":0.00032345,"threshold_uncertainty_score":0.46708786},"labels":[],"label_agreement":null},{"id":"W1999715008","doi":"10.1016/j.cor.2013.01.022","title":"An adaptive evolutionary approach for real-time vehicle routing and dispatching","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"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é Laval","funders":"","keywords":"Robustness (evolution); Computer science; Mathematical optimization; Vehicle routing problem; Evolutionary algorithm; Genetic algorithm; Convergence (economics); Adaptation (eye); Routing (electronic design automation); Artificial intelligence; Mathematics; Machine learning","score_opus":0.046476274989404244,"score_gpt":0.3361941171643727,"score_spread":0.28971784217496843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999715008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15345405,0.000055510012,0.8443838,0.00011275921,0.000053227643,0.00082642806,0.000009936339,0.00027848303,0.00082583993],"genre_scores_gemma":[0.4681247,0.000014787764,0.5313926,0.000010216266,0.00011071091,0.00017529284,0.00005352033,0.000032062857,0.000086106265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.0003407397,0.00023571645,0.0003295767,0.00024960635,0.0004298528],"domain_scores_gemma":[0.99877375,0.00036885167,0.000009570703,0.00029661943,0.00037962454,0.00017157501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010011933,0.00013473628,0.00015670511,0.00020689965,0.0007131371,0.00035924822,0.00023777307,0.00008512891,0.000024573594],"category_scores_gemma":[0.00009149194,0.0001418877,0.00003066311,0.00036977112,0.00009376496,0.0006578788,0.00010171492,0.00027241115,0.000023567081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004640755,0.000036628488,0.00019703315,0.000021231866,0.000020199224,3.2492548e-7,0.00077372266,0.9739021,0.011355708,0.0014210865,0.00088347035,0.01138385],"study_design_scores_gemma":[0.00025042307,0.00009426936,0.0028764105,0.000018303153,0.00000366094,0.000004001348,0.000313588,0.99592865,0.00022934447,0.00009983928,0.000024153822,0.00015735967],"about_ca_topic_score_codex":0.00021804591,"about_ca_topic_score_gemma":0.0000031784152,"teacher_disagreement_score":0.31467065,"about_ca_system_score_codex":0.00013506039,"about_ca_system_score_gemma":0.00004970426,"threshold_uncertainty_score":0.57860124},"labels":[],"label_agreement":null},{"id":"W1999987607","doi":"10.1007/s10479-014-1527-4","title":"Flow-based integer linear programs to solve the weekly log-truck scheduling problem","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":27,"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":"Truck; Theory of computation; Integer programming; Computer science; Scheduling (production processes); Linear programming; Integer (computer science); Mathematical optimization; Operations research; Mathematics; Algorithm; Engineering","score_opus":0.16754097586295918,"score_gpt":0.4287448416465164,"score_spread":0.2612038657835572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999987607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06393562,0.00008026179,0.921912,0.01042772,0.000083084706,0.0009214433,0.0000070877145,0.00018193667,0.0024508408],"genre_scores_gemma":[0.4582037,0.000014560749,0.5410337,0.00017547721,0.00012984312,0.00017019396,0.00002003659,0.000041457333,0.00021105824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807215,0.0003374669,0.00037720974,0.00022250159,0.00052253006,0.00046811503],"domain_scores_gemma":[0.9977619,0.00033384864,0.00001354823,0.00052362325,0.0012277581,0.00013933658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043415623,0.00012971545,0.00017664224,0.00027601206,0.0003268251,0.00017640759,0.00044324435,0.000092178314,0.00007406664],"category_scores_gemma":[0.001182636,0.00010100366,0.00006797482,0.0010840389,0.00011860362,0.0001425453,0.00009065086,0.0004840866,0.00012506454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075513085,0.00004105625,0.0001068019,0.000046558333,0.000021404801,3.1355202e-7,0.00046510913,0.9798982,0.0019997684,0.0018205935,0.0008175937,0.014775016],"study_design_scores_gemma":[0.0001337125,0.00014308057,0.000080722864,0.00008196259,0.0000029978903,7.3720366e-7,0.00015062426,0.9790105,0.016296368,0.00009856295,0.0038886403,0.0001120477],"about_ca_topic_score_codex":0.000059761005,"about_ca_topic_score_gemma":0.000062216925,"teacher_disagreement_score":0.39426807,"about_ca_system_score_codex":0.000024367086,"about_ca_system_score_gemma":0.00010821616,"threshold_uncertainty_score":0.41188097},"labels":[],"label_agreement":null},{"id":"W2000702178","doi":"10.1016/j.cor.2007.01.007","title":"The single vehicle routing problem with deliveries and selective pickups","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":false,"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; Norges Forskningsråd","keywords":"Heuristics; Pickup; Mathematical optimization; Computer science; Vehicle routing problem; Tabu search; Vertex (graph theory); Routing (electronic design automation); Integer programming; Mathematics; Graph; Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.03535149278004031,"score_gpt":0.3189383663021784,"score_spread":0.2835868735221381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000702178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2520946,0.00021727856,0.7447394,0.0003394475,0.00006118256,0.00036883343,0.0000014221987,0.00019650925,0.001981328],"genre_scores_gemma":[0.82788235,0.000030355744,0.17181785,0.000017233282,0.00006878545,0.000017898807,0.0000029246291,0.000026205063,0.00013635936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987288,0.00017574022,0.00018676829,0.00018863041,0.0002871339,0.0004329127],"domain_scores_gemma":[0.9986473,0.0006514496,0.000008431774,0.00019107053,0.00041356558,0.00008819912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018787952,0.000100882266,0.000090097914,0.00012129694,0.0011656497,0.00043618685,0.00017146273,0.00004630113,0.0000027076412],"category_scores_gemma":[0.00010022625,0.000076687626,0.000012655453,0.00069478777,0.0002030628,0.00020337562,0.00009469709,0.00035586118,0.000005313149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023882643,0.000027288052,0.0014977215,0.000019202202,0.0000536134,0.00000682663,0.003585364,0.9111179,0.006021969,0.003467273,0.0004497743,0.073729195],"study_design_scores_gemma":[0.00028860552,0.00015664361,0.003947477,0.00004015699,0.000004334072,0.00001984553,0.00068944244,0.9850713,0.008334643,0.000051447863,0.0012458222,0.0001502936],"about_ca_topic_score_codex":0.000053327534,"about_ca_topic_score_gemma":0.00043100864,"teacher_disagreement_score":0.5757878,"about_ca_system_score_codex":0.00014381178,"about_ca_system_score_gemma":0.00005065815,"threshold_uncertainty_score":0.89653534},"labels":[],"label_agreement":null},{"id":"W2001465411","doi":"10.1016/j.cor.2004.07.006","title":"A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Snow removal; Truck; Snow; Plough; Sizing; Computer science; Routing (electronic design automation); Transport engineering; Operations research; Algorithm; Meteorology; Engineering","score_opus":0.19652052242196252,"score_gpt":0.38302933976129844,"score_spread":0.18650881733933591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001465411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01878899,0.00022590773,0.9796063,0.00006664694,0.00013610875,0.0010357951,0.000039169146,0.00007621044,0.000024903811],"genre_scores_gemma":[0.4853481,0.000026391062,0.5143869,0.0000045234106,0.00003605425,0.00013361259,0.000012926048,0.000026300642,0.00002518494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883753,0.00020571488,0.00027920914,0.00023134501,0.00014542909,0.00030074656],"domain_scores_gemma":[0.9985706,0.00068669947,0.000011674381,0.00016750213,0.00048173018,0.000081750746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002999371,0.00010499442,0.00021760531,0.00018827553,0.00024077583,0.0001534084,0.00012254636,0.00006262261,5.593766e-7],"category_scores_gemma":[0.0002396773,0.00010557728,0.000027292557,0.00023401195,0.00006678712,0.0002263337,0.000059372156,0.00011027142,3.656847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013322548,0.000008816846,0.000027019392,0.00017252266,0.000034578337,4.7573573e-7,0.00063365354,0.99061316,0.00042119008,0.0009252623,0.0001774764,0.0069725276],"study_design_scores_gemma":[0.00077267503,0.00008807142,0.00019547604,0.00026634312,0.0000060343677,0.000005577885,0.00013311897,0.99699974,0.0013294083,0.00008173277,0.000019533012,0.00010231518],"about_ca_topic_score_codex":0.00009690196,"about_ca_topic_score_gemma":0.000026783804,"teacher_disagreement_score":0.4665591,"about_ca_system_score_codex":0.00011962732,"about_ca_system_score_gemma":0.000061455205,"threshold_uncertainty_score":0.43053165},"labels":[],"label_agreement":null},{"id":"W2002282904","doi":"10.1023/b:jmma.0000038618.37710.f8","title":"Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Modelling and Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"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":"Ministero dell'Università e della Ricerca","keywords":"Arc routing; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Routing (electronic design automation); Constructive; Set (abstract data type); Computer science; Upper and lower bounds; Arc (geometry); Vehicle routing problem; Mathematics; Algorithm; Process (computing)","score_opus":0.05607874453509868,"score_gpt":0.2693621043498414,"score_spread":0.21328335981474275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002282904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095672764,0.00019493428,0.9036165,0.00027202614,0.000040135077,0.0001247212,0.0000073843207,0.000030141564,0.000041378244],"genre_scores_gemma":[0.4248149,0.0002384707,0.5748173,0.000008181838,0.00007691964,0.0000038199887,2.4221944e-7,0.000017046963,0.000023114078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999159,0.000030581497,0.0003537951,0.00008277765,0.00018943349,0.00018443524],"domain_scores_gemma":[0.9988587,0.0007609819,0.000074644115,0.000078421,0.00013804635,0.0000892198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085391605,0.000114982715,0.00021485868,0.000062041785,0.0001667547,0.0000921647,0.000073830815,0.000050281968,0.0000015055072],"category_scores_gemma":[0.000085630476,0.00007112728,0.00003826251,0.000083066814,0.00010973516,0.0001009155,0.00001617142,0.0003275996,2.9273113e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075732673,0.000017946748,0.000010208231,0.0001655613,0.000054403336,0.0000012511834,0.0016469571,0.99225974,0.000013362619,0.004081399,0.0000037721643,0.0017378102],"study_design_scores_gemma":[0.0004566442,0.00009455271,0.000014513218,0.00022172215,0.00005374218,0.00012833402,0.0010228723,0.96579427,0.00012430124,0.03198336,0.000018641864,0.000087039334],"about_ca_topic_score_codex":0.000005009373,"about_ca_topic_score_gemma":5.503065e-7,"teacher_disagreement_score":0.32914215,"about_ca_system_score_codex":0.000038230017,"about_ca_system_score_gemma":0.00002741103,"threshold_uncertainty_score":0.29004863},"labels":[],"label_agreement":null},{"id":"W2002507421","doi":"10.1287/inte.1110.0611","title":"A Strategic Empty Container Logistics Optimization in a Major Shipping Company","year":2012,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Booth University College","funders":"","keywords":"Operations research; Container (type theory); Stock (firearms); Safety stock; Business; Profit (economics); Service (business); Computer science; Operations management; Transport engineering; Marketing; Supply chain; Engineering; Economics","score_opus":0.04407673720646854,"score_gpt":0.28347552139311916,"score_spread":0.23939878418665061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002507421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02738197,0.00009523916,0.94137895,0.00004482422,0.00036150162,0.00018619622,0.000005028254,0.0001774625,0.03036885],"genre_scores_gemma":[0.92333275,0.00009894792,0.07598775,0.00022555352,0.00025486993,0.000004802322,0.0000132316145,0.000044131724,0.000037956157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982901,0.000025361958,0.00073535694,0.00009262938,0.0003179696,0.0005385445],"domain_scores_gemma":[0.9991875,0.00011915099,0.00018534753,0.00018429861,0.00008169624,0.0002419566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009814635,0.00024146202,0.0003294938,0.00040472977,0.00009578598,0.00016747731,0.0001885807,0.00016255057,0.00009989936],"category_scores_gemma":[0.00006568317,0.00021263507,0.00007041595,0.0005576549,0.00003655319,0.00026761644,0.000025046667,0.0007210419,0.00003919832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021892807,0.000037971575,0.0020296166,0.000026052023,0.000042661126,0.000005489,0.00026198363,0.98672605,0.00005303101,0.009557522,0.000057413974,0.0011803193],"study_design_scores_gemma":[0.00096242776,0.000027707198,0.00066565705,0.00005076745,0.000033766708,0.000045585588,0.0005013538,0.9964582,0.000100893805,0.000543193,0.00031486008,0.00029563627],"about_ca_topic_score_codex":0.0000013642212,"about_ca_topic_score_gemma":0.0000024794401,"teacher_disagreement_score":0.8959508,"about_ca_system_score_codex":0.00034560662,"about_ca_system_score_gemma":0.000047459667,"threshold_uncertainty_score":0.86710066},"labels":[],"label_agreement":null},{"id":"W2002602643","doi":"10.1016/j.tre.2014.09.012","title":"A matheuristic for the liner shipping network design problem","year":2014,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":75,"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; Group for Research in Decision Analysis","funders":"","keywords":"Network planning and design; Transport engineering; Flow network; Computer science; Operations research; Business; Marine engineering; Engineering; Computer network; Mathematical optimization; Mathematics","score_opus":0.14312901136925074,"score_gpt":0.37189955162197136,"score_spread":0.22877054025272062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002602643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007487765,0.0128884865,0.98398185,0.00071925827,0.0001249647,0.0018368763,0.000066626795,0.00017605031,0.00013101376],"genre_scores_gemma":[0.20107432,0.17955825,0.6132953,0.0009560146,0.0006284685,0.0028044265,0.0011418785,0.00022116656,0.0003201749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979139,0.00025065927,0.0007054187,0.0002883958,0.00038670568,0.00045491566],"domain_scores_gemma":[0.996973,0.0021597012,0.00009031063,0.00025295603,0.0003982389,0.00012579626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004245106,0.00020389777,0.0003356176,0.00006286164,0.00036457973,0.00006362658,0.000181299,0.000089857065,0.00005875505],"category_scores_gemma":[0.00019996302,0.00015961322,0.00008787947,0.000521197,0.00013999567,0.000082816354,0.0000011390357,0.0003142666,0.000007683471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019700867,0.000018581597,0.00038975416,0.004613271,0.000062230785,0.0000020712635,0.00020220788,0.9285465,0.000014106731,0.041263744,0.0040392694,0.020828547],"study_design_scores_gemma":[0.0009175668,0.00018289036,0.010140767,0.0028761423,0.0004992708,0.0000013253252,0.00004916159,0.71700966,0.00003820589,0.011409088,0.25632116,0.0005547315],"about_ca_topic_score_codex":0.000013933059,"about_ca_topic_score_gemma":0.00009396051,"teacher_disagreement_score":0.37068653,"about_ca_system_score_codex":0.000017397053,"about_ca_system_score_gemma":0.000038010447,"threshold_uncertainty_score":0.65088385},"labels":[],"label_agreement":null},{"id":"W2003793882","doi":"10.1287/trsc.1090.0276","title":"<b>Guest Editorial</b>—Focused Issue on Freight Transportation","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Traffic management; Transport engineering; Business; Transportation planning; Humanitarian Logistics; Transportation industry; Engineering; Industrial organization","score_opus":0.013395566103160445,"score_gpt":0.272174827976024,"score_spread":0.25877926187286354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003793882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55138224,0.00010236688,0.33096796,0.0012205149,0.093835495,0.0012162552,0.0001665105,0.0042313174,0.016877323],"genre_scores_gemma":[0.97070843,0.000024216843,0.021637145,0.00017420606,0.0072752205,0.000010918927,0.00006705579,0.000026594884,0.0000762332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981003,0.000021047319,0.00040253522,0.00034548424,0.00079789315,0.00033276467],"domain_scores_gemma":[0.99926275,0.000059243055,0.00006247182,0.00026677648,0.00018925454,0.0001594952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061476603,0.00018594995,0.00017055286,0.0002532651,0.00018355985,0.00007302244,0.00029933805,0.0000995068,0.000077874836],"category_scores_gemma":[0.00004250645,0.00019300026,0.000051414063,0.0012940335,0.00010373798,0.0006343193,3.2534373e-7,0.00018923396,0.00009139562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004430485,0.00010029544,0.0010333452,0.000037826365,0.000009238441,0.000011489315,0.0044371295,0.90985763,0.054800004,0.0038350113,0.01044943,0.015384294],"study_design_scores_gemma":[0.002970738,0.0005794078,0.47462934,0.00019332727,0.00009987442,0.0000016542508,0.0002611413,0.07517497,0.29238164,0.0012797461,0.15065785,0.0017703023],"about_ca_topic_score_codex":0.000008890308,"about_ca_topic_score_gemma":0.000017118156,"teacher_disagreement_score":0.83468264,"about_ca_system_score_codex":0.000073327625,"about_ca_system_score_gemma":0.00006182807,"threshold_uncertainty_score":0.78703225},"labels":[],"label_agreement":null},{"id":"W2004985180","doi":"10.1287/inte.30.2.41.11673","title":"Air Transat Uses ALTITUDE to Manage Its Aircraft Routing, Crew Pairing, and Work Assignment","year":2000,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Charter; Scheduling (production processes); Operations research; Crew scheduling; Crew; Flexibility (engineering); Navy; Work (physics); Computer science; Operations management; Engineering; Aeronautics","score_opus":0.01623516938582708,"score_gpt":0.24733184391631788,"score_spread":0.2310966745304908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004985180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3454668,0.0002047692,0.58566236,0.000805962,0.0003794413,0.0006921501,0.000011732758,0.000814939,0.065961815],"genre_scores_gemma":[0.9571364,0.000430669,0.039794795,0.0012600195,0.00019879367,0.000009022171,0.0000027378032,0.00007478044,0.0010927668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981722,0.000019603289,0.00065125467,0.00019216588,0.000461879,0.0005028818],"domain_scores_gemma":[0.9991293,0.000084321204,0.000090529116,0.00023952764,0.000042353633,0.00041398083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067209563,0.00032082715,0.00035241028,0.00026351545,0.00019741213,0.00021435373,0.0002563098,0.00013424671,0.00038357015],"category_scores_gemma":[0.000029383562,0.00028339773,0.00009911081,0.0004912704,0.000027023703,0.00018837175,0.00002582426,0.00056176574,0.00019076315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034410856,0.000022472766,0.00043332067,0.000030096753,0.000107129155,0.000017369279,0.0006073304,0.92543274,0.00006077011,0.0004144449,0.0005471307,0.07229279],"study_design_scores_gemma":[0.0057484144,0.0006291596,0.028043708,0.0012398897,0.00054038095,0.0002966562,0.00068238226,0.63751686,0.008345867,0.0007937312,0.31260198,0.0035609854],"about_ca_topic_score_codex":9.3708206e-7,"about_ca_topic_score_gemma":0.0000019295805,"teacher_disagreement_score":0.6116696,"about_ca_system_score_codex":0.00019365942,"about_ca_system_score_gemma":0.00001907077,"threshold_uncertainty_score":0.9999618},"labels":[],"label_agreement":null},{"id":"W2005518909","doi":"10.4271/2013-01-0337","title":"An Application of Ant Colony Optimization to Energy Efficient Routing for Electric Vehicles","year":2013,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","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":"Chrysler (Canada)","funders":"","keywords":"Ant colony optimization algorithms; ANT; Computer science; Routing (electronic design automation); Ant colony; Energy (signal processing); Mathematical optimization; Computer network; Artificial intelligence; Mathematics","score_opus":0.008300266221701944,"score_gpt":0.2499519173500796,"score_spread":0.24165165112837766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005518909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8643458,0.00038561065,0.10635784,0.0022780965,0.0004149379,0.0063285865,0.00010303654,0.009951375,0.009834745],"genre_scores_gemma":[0.84046596,0.000055010703,0.15761971,0.00042549707,0.00009802274,0.0010918564,0.000061853,0.0001510978,0.000031014566],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.996593,0.00014779535,0.0011280057,0.00081586954,0.00054267043,0.0007726764],"domain_scores_gemma":[0.9975486,0.0005520467,0.00021933368,0.0010297855,0.00030144208,0.0003488252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007541156,0.00052991224,0.00070568203,0.0003370869,0.00024910865,0.00009529213,0.00074872095,0.00058452255,0.00007377812],"category_scores_gemma":[0.00067929964,0.0005222017,0.00022355409,0.0013855848,0.00016815243,0.0003013196,0.00012252391,0.00039739825,0.00001820184],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048083508,0.00013217652,0.000035595192,0.000032395994,0.000015246426,4.2142818e-7,0.000019312762,0.3881657,0.5973332,0.004049991,0.0002326987,0.009935169],"study_design_scores_gemma":[0.0016479566,0.0031887477,0.9255944,0.00027577655,0.00018112539,0.00003668342,0.00016005445,0.044478767,0.015878534,0.0011294436,0.005453335,0.0019751873],"about_ca_topic_score_codex":0.000064823944,"about_ca_topic_score_gemma":0.0018909158,"teacher_disagreement_score":0.9255588,"about_ca_system_score_codex":0.00034576815,"about_ca_system_score_gemma":0.000051751587,"threshold_uncertainty_score":0.99972296},"labels":[],"label_agreement":null},{"id":"W2007402232","doi":"10.1016/j.cam.2008.10.055","title":"A capacity scaling heuristic for the multicommodity capacitated network design problem","year":2008,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Education, Culture, Sports, Science and Technology; Mitchell Center for Neurodegenerative Diseases, University of Texas Medical Branch; Université du Québec à Montréal","keywords":"Heuristic; Mathematics; Mathematical optimization; Column generation; Network planning and design; Scaling; Flow network; Multi-commodity flow problem; Algorithm; Computer science","score_opus":0.05912931673790746,"score_gpt":0.25239884197222734,"score_spread":0.1932695252343199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007402232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0408193,0.00007886604,0.958603,0.00006543236,0.000073347175,0.0002476377,0.0000034813759,0.000035266432,0.00007362462],"genre_scores_gemma":[0.32938996,0.000013867548,0.6704497,0.000021155449,0.00010033157,0.0000070135065,9.008627e-7,0.000013685136,0.0000033983094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.000018094152,0.0004431188,0.000052444844,0.00018384616,0.00013028366],"domain_scores_gemma":[0.99747723,0.00204251,0.00019317564,0.000053032472,0.000180964,0.00005309249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007152865,0.00010569943,0.00021710184,0.00003535932,0.00021968754,0.000029174864,0.00009532681,0.00003987915,0.0000024741526],"category_scores_gemma":[0.00006719292,0.000075203854,0.000043691016,0.00011357399,0.000072892966,0.000044157416,0.000010869627,0.00015484242,7.8500557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011546218,0.000031863216,0.000008275613,0.00009110596,0.000060933024,7.068225e-7,0.00091193535,0.9922277,0.00006011137,0.0054070125,0.00046214883,0.0007266709],"study_design_scores_gemma":[0.0004255889,0.0000233006,0.0001784726,0.000037517042,0.000035689085,0.00014569503,0.000054944227,0.917297,0.00013664261,0.08154194,0.000043460295,0.00007976743],"about_ca_topic_score_codex":2.1562093e-7,"about_ca_topic_score_gemma":7.526092e-8,"teacher_disagreement_score":0.28857067,"about_ca_system_score_codex":0.000023800274,"about_ca_system_score_gemma":0.000024155306,"threshold_uncertainty_score":0.30667242},"labels":[],"label_agreement":null},{"id":"W2008806816","doi":"10.1016/s0377-2217(02)00915-3","title":"Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":347,"is_retracted":false,"has_abstract":false,"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":"Computer science; Vehicle routing problem; Fleet management; Time horizon; Field (mathematics); Routing (electronic design automation); Operations research; Routing algorithm; Algorithm; Emphasis (telecommunications); Mathematical optimization; Telecommunications; Computer network; Routing protocol; Engineering","score_opus":0.06723250682678367,"score_gpt":0.36649379506851854,"score_spread":0.29926128824173487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008806816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4498955,0.0006700851,0.484542,0.0004016523,0.00028495767,0.00022802514,0.000004773066,0.00011358963,0.06385941],"genre_scores_gemma":[0.8012952,0.00017486131,0.19804125,0.000011620098,0.00021893947,4.203172e-7,0.0000031992192,0.000038080616,0.00021638266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647146,0.001930306,0.0005198328,0.00014139219,0.0006164682,0.00032056108],"domain_scores_gemma":[0.9985932,0.00040746373,0.00007746373,0.00011002777,0.00065353035,0.00015830893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008181138,0.0001193769,0.00017486095,0.00017691481,0.00031985878,0.00033508785,0.00017903972,0.000031507774,0.0001064494],"category_scores_gemma":[0.0006478077,0.00011403348,0.000041450145,0.00027356434,0.00012856313,0.0004071197,0.00004551709,0.0005212091,0.000043667256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024735626,0.00004150307,0.0005426837,0.000028682427,0.000071716444,0.000105528066,0.0014917835,0.91336703,0.06223197,0.012186822,0.0020691908,0.007838325],"study_design_scores_gemma":[0.0012909315,0.0002636543,0.008963018,0.00011581196,0.000009756664,0.00025705845,0.0009807989,0.98372275,0.0016318632,0.00021316267,0.0023063126,0.00024485867],"about_ca_topic_score_codex":0.00000293289,"about_ca_topic_score_gemma":2.3544762e-7,"teacher_disagreement_score":0.35139975,"about_ca_system_score_codex":0.00009117485,"about_ca_system_score_gemma":0.00016865772,"threshold_uncertainty_score":0.46501502},"labels":[],"label_agreement":null},{"id":"W2009946293","doi":"10.3846/1648-4142.2008.23.230-235","title":"DECISION SUPPORT SYSTEM FOR SOLVING THE STREET ROUTING PROBLEM","year":2008,"lang":"en","type":"article","venue":"Transport","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"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":"Vehicle routing problem; Heuristics; Routing (electronic design automation); Computer science; Key (lock); Software; Operations research; Range (aeronautics); Geographic information system; Path (computing); Engineering; Computer network; Computer security; Geography","score_opus":0.023069283242303097,"score_gpt":0.25007384062112215,"score_spread":0.22700455737881906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009946293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17433265,0.000038608072,0.8215442,0.000022377972,0.00029950432,0.00044464596,0.000017347887,0.0007342229,0.0025664493],"genre_scores_gemma":[0.81897694,0.000013346357,0.18068922,0.0000147626315,0.0000895759,0.00004442308,0.000019674166,0.000053837382,0.000098213524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988964,0.000013827059,0.0003989387,0.00017860392,0.00019903433,0.00031320238],"domain_scores_gemma":[0.99939954,0.00017956848,0.000044130204,0.00025679424,0.000061671206,0.000058318445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006664763,0.00015370114,0.00019478283,0.00004583222,0.00025259532,0.000011486546,0.00020379588,0.00008142146,0.000019530076],"category_scores_gemma":[0.000017768225,0.00012315686,0.00009498995,0.00018258322,0.000027185537,0.00010631624,0.0000058266764,0.00013046924,0.000008928274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024229586,0.000017572223,0.039618157,0.00030598117,0.00005909834,0.000029686442,0.0021700286,0.94530576,0.00084385223,0.0010532187,0.00071715633,0.009855233],"study_design_scores_gemma":[0.0021908858,0.000106979576,0.035598345,0.00041196018,0.00015963805,0.00018413091,0.0008936652,0.94142556,0.011789233,0.000093916016,0.006265365,0.0008803467],"about_ca_topic_score_codex":0.000009648372,"about_ca_topic_score_gemma":0.000018123195,"teacher_disagreement_score":0.6446443,"about_ca_system_score_codex":0.00006415749,"about_ca_system_score_gemma":0.000036085356,"threshold_uncertainty_score":0.50221914},"labels":[],"label_agreement":null},{"id":"W2010102206","doi":"10.1016/j.cor.2008.05.005","title":"The pickup and delivery traveling salesman problem with first-in-first-out loading","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":45,"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":"Travelling salesman problem; Pickup; Tabu search; Heuristics; Iterated local search; Mathematical optimization; Computer science; 2-opt; Bottleneck traveling salesman problem; Integer programming; Iterated function; Probabilistic logic; Metaheuristic; Traveling purchaser problem; Mathematics; Artificial intelligence","score_opus":0.05876710399495647,"score_gpt":0.30697327359526316,"score_spread":0.2482061696003067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010102206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4981586,0.00067091803,0.49804133,0.0009772453,0.00013439306,0.00068188476,0.0000019630697,0.00020509161,0.0011285845],"genre_scores_gemma":[0.8303414,0.00093881885,0.1683559,0.000015453095,0.00007458851,0.00006592408,0.000004787771,0.000037226964,0.00016589907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985873,0.00016842705,0.00024917637,0.0002482191,0.00031185916,0.00043499458],"domain_scores_gemma":[0.9987172,0.0007231882,0.000008364184,0.00026967545,0.00018350233,0.00009807005],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00096049695,0.00013094406,0.00013561828,0.00019225162,0.0014387795,0.00024868193,0.00025529342,0.000059548318,0.0000053220824],"category_scores_gemma":[0.000070626294,0.00010499289,0.000018868379,0.0005373207,0.0001991061,0.00021239319,0.00009512419,0.00044232706,0.000015876698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072958846,0.000013033759,0.0023780724,0.00003357306,0.000018293804,0.000018038032,0.0037077845,0.99075645,0.00014577845,0.00034590287,0.00043410985,0.002141685],"study_design_scores_gemma":[0.00041491186,0.00005050003,0.003071232,0.00011815803,0.0000025000984,0.000041849707,0.00019630183,0.99439484,0.00030222104,0.000014121483,0.0012497881,0.00014359488],"about_ca_topic_score_codex":0.00007594018,"about_ca_topic_score_gemma":0.0018002092,"teacher_disagreement_score":0.3321828,"about_ca_system_score_codex":0.0001398863,"about_ca_system_score_gemma":0.000094813324,"threshold_uncertainty_score":0.99986124},"labels":[],"label_agreement":null},{"id":"W2010203453","doi":"10.1007/s10288-014-0260-9","title":"Approximating the length of Chinese postman tours","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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":"Unit square; Combinatorics; Square (algebra); Simple (philosophy); Mathematics; Function (biology); Planar; Unit (ring theory); Arc length; Computer science; Discrete mathematics; Geometry; Arc (geometry)","score_opus":0.007203520721262863,"score_gpt":0.23812299029064365,"score_spread":0.23091946956938078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010203453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6787324,0.00006473,0.302231,0.00016354393,0.00020509592,0.000104692546,0.0000018172323,0.00024456275,0.018252166],"genre_scores_gemma":[0.89913076,0.0000022712875,0.10065616,0.000035850368,0.000082527666,0.000003944386,0.0000014310231,0.000020075971,0.00006695748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955326,0.000051237814,0.0001508584,0.000058920254,0.000082204926,0.00010353908],"domain_scores_gemma":[0.99958044,0.00014544795,0.000034538123,0.00019737658,0.000021983617,0.000020220703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046959223,0.00006579348,0.0000967266,0.00002454506,0.000036068985,0.00001123998,0.00012698636,0.000028625622,0.000023953562],"category_scores_gemma":[0.00028819745,0.00004482125,0.000029512312,0.00013166857,0.000017563969,0.000037159836,0.00002045103,0.0000820317,0.000008606738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038284547,0.000018915112,0.015140334,0.000157383,0.000043491073,3.3151963e-7,0.0026482635,0.88744754,0.009441249,0.0027274718,0.00034582906,0.082025364],"study_design_scores_gemma":[0.00012192831,0.000010884168,0.0073186494,0.000011476592,0.000005311137,0.0000020418336,0.00004166627,0.9897613,0.0017981115,0.00033354314,0.0005232056,0.000071891074],"about_ca_topic_score_codex":0.0000038486087,"about_ca_topic_score_gemma":0.0000010265416,"teacher_disagreement_score":0.22039841,"about_ca_system_score_codex":0.000007803878,"about_ca_system_score_gemma":0.000002835619,"threshold_uncertainty_score":0.18277575},"labels":[],"label_agreement":null},{"id":"W2010359686","doi":"10.1287/trsc.1110.0387","title":"Robust Inventory Routing Under Demand Uncertainty","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":122,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Robust optimization; Mathematical optimization; Time horizon; Interval (graph theory); Routing (electronic design automation); Operations research; Computer science; Inventory theory; Product (mathematics); Integer programming; Inventory control; Set (abstract data type); Holding cost; Mathematics","score_opus":0.0778347292160422,"score_gpt":0.2723011943071366,"score_spread":0.19446646509109441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010359686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41802981,0.000019452596,0.5769064,0.000009153612,0.00021047417,0.00007105326,0.0000021683595,0.0002969288,0.0044545867],"genre_scores_gemma":[0.9336215,0.000007801909,0.06623831,0.000050781553,0.000016249505,0.0000056200543,0.00000438095,0.000014820158,0.00004049443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899507,0.000019651536,0.00024339398,0.00020712464,0.0002809049,0.00025387105],"domain_scores_gemma":[0.99956983,0.000022434253,0.00004083395,0.00016574156,0.000096549484,0.0001046085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008262208,0.000098056626,0.000090891765,0.00012665651,0.00014648098,0.000027952263,0.0002237921,0.000039414936,0.00014285906],"category_scores_gemma":[0.000026860213,0.000101840385,0.000028346847,0.00075376855,0.00018002954,0.00043459967,0.0000027496937,0.00009560677,0.000018651028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021409617,0.0000072509224,0.009901885,0.000010598694,0.000003526776,0.0000013298994,0.0030035425,0.9797788,0.0026200358,0.0039320923,0.000010848217,0.00072793063],"study_design_scores_gemma":[0.00026211605,0.000013695803,0.2096509,0.000025769727,0.000016440084,0.0000016025266,0.00060034404,0.7781336,0.010336215,0.0006601146,0.00004521861,0.00025402202],"about_ca_topic_score_codex":0.00003646887,"about_ca_topic_score_gemma":0.000042394913,"teacher_disagreement_score":0.51559174,"about_ca_system_score_codex":0.00006229501,"about_ca_system_score_gemma":0.000057184465,"threshold_uncertainty_score":0.41529304},"labels":[],"label_agreement":null},{"id":"W2010740862","doi":"10.5539/jms.v2n2p219","title":"A Heuristic Based Approach to Solve a Capacitated Location-routing Problem","year":2012,"lang":"en","type":"article","venue":"Journal of Management and Sustainability","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Simulated annealing; Computer science; Heuristic; Vehicle routing problem; Greedy algorithm; Set (abstract data type); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.013749781698769786,"score_gpt":0.25083379867266514,"score_spread":0.23708401697389536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010740862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067405835,0.00015932237,0.92849016,0.00014964986,0.00008787432,0.00037987344,4.3962808e-7,0.000055100583,0.003271737],"genre_scores_gemma":[0.7718597,0.0000045766233,0.22798263,0.000037641264,0.000049040635,0.000009856965,8.0631975e-7,0.000013384501,0.00004235217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989262,0.00008764768,0.00040598982,0.00009392234,0.0001946499,0.00029154663],"domain_scores_gemma":[0.9991564,0.00008955409,0.000093267154,0.00014302135,0.00035628295,0.00016146014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023946033,0.00011830092,0.0001869891,0.00019291858,0.00007156364,0.00005024986,0.00010400793,0.000041413252,0.00000496877],"category_scores_gemma":[0.000320945,0.000108721695,0.000043377942,0.00042561928,0.000025795143,0.0002091023,0.00003543863,0.00016088455,7.880729e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040061346,0.00019708612,0.03402879,0.0017686939,0.00009612304,0.0000039160095,0.0023803434,0.9456528,0.000005745409,0.0041879,0.0005888297,0.011049727],"study_design_scores_gemma":[0.0016896981,0.00014736883,0.09501626,0.00013770095,0.00025084746,0.000026971838,0.0111563895,0.8845146,0.00008989409,0.0026213382,0.003788732,0.00056024874],"about_ca_topic_score_codex":0.0000031559518,"about_ca_topic_score_gemma":2.035771e-7,"teacher_disagreement_score":0.7044539,"about_ca_system_score_codex":0.00026631603,"about_ca_system_score_gemma":0.000032026106,"threshold_uncertainty_score":0.44335422},"labels":[],"label_agreement":null},{"id":"W2010898123","doi":"10.1007/s10951-006-8596-4","title":"A case study of mutual routing-scheduling reformulation","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"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 Toronto","funders":"Japan Society for the Promotion of Science; University College Cork; University of Glasgow","keywords":"Computer science; Vehicle routing problem; Scheduling (production processes); Mathematical optimization; Software; Job shop scheduling; Key (lock); Combinatorial optimization; Operations research; Constraint programming; Industrial engineering; Routing (electronic design automation); Mathematics; Algorithm; Engineering","score_opus":0.0248211093843664,"score_gpt":0.28351555630582065,"score_spread":0.25869444692145427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010898123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7849489,0.000108340275,0.21434924,0.000008129392,0.00025572954,0.0000883269,5.2421757e-7,0.000051031588,0.00018979023],"genre_scores_gemma":[0.75848716,0.000003363354,0.24115376,0.000003044901,0.00031427006,7.012995e-7,5.1165193e-7,0.00003032866,0.0000068543136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817926,0.000090888134,0.0010997074,0.00009809036,0.00033615023,0.00019589695],"domain_scores_gemma":[0.9988412,0.00014135944,0.00048712437,0.0001518311,0.0003150085,0.00006347629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013580504,0.00014752164,0.00033897106,0.0002850693,0.0000830278,0.000040084393,0.00012790631,0.00008789086,0.000010962477],"category_scores_gemma":[0.00018669141,0.00014010245,0.000099219964,0.0003888162,0.000014581435,0.0003342,0.000026060256,0.00036192063,0.0000014688668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014811008,0.00010431101,0.009566273,0.000029376954,0.00005098397,0.00037056702,0.0012791742,0.98070896,0.0059649656,0.00004539165,0.000002504125,0.0018626691],"study_design_scores_gemma":[0.0014033436,0.0001941596,0.0011694477,0.000109280736,0.00009220517,0.002740745,0.005139044,0.9848105,0.004096997,0.000066935674,0.0000067901,0.00017059554],"about_ca_topic_score_codex":0.00005141621,"about_ca_topic_score_gemma":0.0000122581505,"teacher_disagreement_score":0.026804522,"about_ca_system_score_codex":0.000106460226,"about_ca_system_score_gemma":0.000034115,"threshold_uncertainty_score":0.5713212},"labels":[],"label_agreement":null},{"id":"W2011987043","doi":"10.4271/2014-01-1815","title":"Energy Efficient Routing for Electric Vehicles using Particle Swarm Optimization","year":2014,"lang":"en","type":"article","venue":"SAE technical papers on CD-ROM/SAE technical paper series","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":"Chrysler (Canada)","funders":"","keywords":"Particle swarm optimization; Computer science; Routing (electronic design automation); Multi-swarm optimization; Energy (signal processing); Mathematical optimization; Computer network; Algorithm; Physics; Mathematics","score_opus":0.014984236407706821,"score_gpt":0.2554483754922992,"score_spread":0.24046413908459238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011987043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89361817,0.00066707813,0.074077725,0.0014340355,0.00082048436,0.002037856,0.0000459595,0.013182498,0.014116221],"genre_scores_gemma":[0.8728042,0.00008316097,0.12582926,0.00054153195,0.00022548955,0.00020043192,0.000028547653,0.0002272163,0.000060130737],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9958369,0.00025551498,0.0011504807,0.00092837366,0.00064064405,0.0011880571],"domain_scores_gemma":[0.9973534,0.00095758145,0.00021177322,0.000957498,0.00017516236,0.00034461427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013303418,0.0006870665,0.00078870746,0.00023182198,0.00052531797,0.00016586421,0.00065963104,0.0006697367,0.00006979828],"category_scores_gemma":[0.0013146098,0.0006826558,0.00035912282,0.0012827486,0.00024832113,0.00028757946,0.00018285216,0.0006167894,0.000013773135],"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.00005327696,0.00008131102,0.000030813208,0.00002984667,0.000020765865,0.0000015072761,0.000012956348,0.4585647,0.530622,0.0060127177,0.000103084094,0.00446702],"study_design_scores_gemma":[0.0064300164,0.0034471464,0.46846926,0.0010234785,0.00079578266,0.00024503822,0.00022156171,0.45075154,0.03761585,0.0032243072,0.021911288,0.0058647254],"about_ca_topic_score_codex":0.000018318147,"about_ca_topic_score_gemma":0.0011933247,"teacher_disagreement_score":0.49300614,"about_ca_system_score_codex":0.0004640457,"about_ca_system_score_gemma":0.000058149628,"threshold_uncertainty_score":0.99956244},"labels":[],"label_agreement":null},{"id":"W2012738417","doi":"10.1007/s10732-007-9033-3","title":"Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"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 Victoria","funders":"Deutsche Forschungsgemeinschaft","keywords":"Travelling salesman problem; Heuristics; Regret; Greedy algorithm; Mathematical optimization; Computer science; Mathematics; Combinatorics; Machine learning","score_opus":0.0272815811744743,"score_gpt":0.28991862336377305,"score_spread":0.26263704218929873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012738417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26440197,0.0005124712,0.73476774,0.000013838394,0.00012668084,0.000095896234,0.00004063589,0.000011970513,0.000028799695],"genre_scores_gemma":[0.57179606,0.00005244047,0.42801297,0.000017236516,0.000075836484,5.759657e-7,0.00000195564,0.00002775394,0.000015193662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859685,0.000036856927,0.000821894,0.00011116226,0.00023346432,0.00019978103],"domain_scores_gemma":[0.99844307,0.00070639356,0.0003428006,0.000109198445,0.00024891435,0.00014959824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101922,0.00015576652,0.0004415754,0.00032340703,0.00006805631,0.000018499075,0.000053035896,0.0000937078,0.0000063538996],"category_scores_gemma":[0.00031951885,0.00014200437,0.00009604445,0.0002779796,0.00006560102,0.000042940017,0.000020224174,0.00019023416,1.0705757e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010639727,0.00012802468,0.034663316,0.0004226447,0.0016920735,0.00041273594,0.0014264525,0.94746244,0.0039749187,0.0012580705,0.00018026133,0.008272674],"study_design_scores_gemma":[0.0011247554,0.00017736171,0.0062917355,0.00012770937,0.0016448726,0.0009888135,0.0002825519,0.9872128,0.0008770084,0.00020528548,0.0008302174,0.00023689309],"about_ca_topic_score_codex":0.000005697679,"about_ca_topic_score_gemma":0.000015905438,"teacher_disagreement_score":0.30739406,"about_ca_system_score_codex":0.000051105162,"about_ca_system_score_gemma":0.000018391653,"threshold_uncertainty_score":0.579077},"labels":[],"label_agreement":null},{"id":"W2013782474","doi":"10.1016/j.cor.2014.05.012","title":"The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Backup; Operations research; Spoke-hub distribution paradigm; Computer science; Linearization; Heuristic; Facility location problem; Function (biology); Mathematical optimization; Natural disaster; Flow network; Mathematical model; Transport engineering; Mathematics; Engineering","score_opus":0.03528771779630964,"score_gpt":0.3742071828086215,"score_spread":0.33891946501231185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013782474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08636761,0.00008225468,0.91261375,0.00027531217,0.000017684042,0.00030858393,0.000001411032,0.0000730997,0.0002603001],"genre_scores_gemma":[0.829331,0.000090272646,0.17045969,0.0000029583002,0.0000401267,0.000034645902,0.0000054846387,0.000014227743,0.000021630998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989511,0.000281442,0.00025405208,0.00012072735,0.00015360396,0.00023910333],"domain_scores_gemma":[0.9988718,0.00069384224,0.000010184196,0.00021652496,0.00014910105,0.000058514746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017914274,0.00008334665,0.00012979087,0.00019669996,0.0003036628,0.00015682782,0.00013112219,0.000075255935,0.0000053261265],"category_scores_gemma":[0.00024028243,0.00006346903,0.00002699921,0.00041514667,0.00013528512,0.00015812954,0.00009749586,0.000271684,0.0000013905789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025449824,0.00001420347,0.0006253689,0.00001807579,0.000012738337,1.5475429e-7,0.00034521063,0.9623902,0.00065567653,0.010743924,0.0003003782,0.024891557],"study_design_scores_gemma":[0.00011710428,0.000048419453,0.0039904085,0.00004747556,0.0000019258753,0.000004687724,0.000026661955,0.99460614,0.00017426925,0.0008495665,0.00007226413,0.000061066065],"about_ca_topic_score_codex":0.000041861018,"about_ca_topic_score_gemma":0.00007725141,"teacher_disagreement_score":0.7429634,"about_ca_system_score_codex":0.0000711545,"about_ca_system_score_gemma":0.000025130286,"threshold_uncertainty_score":0.2588192},"labels":[],"label_agreement":null},{"id":"W2015067034","doi":"10.1007/s10479-010-0806-y","title":"An interior-point Benders based branch-and-cut algorithm for mixed integer programs","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"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":"Benders' decomposition; Branch and cut; Mathematics; Theory of computation; Cutting-plane method; Mathematical optimization; Integer programming; Integer (computer science); Branch and bound; Interior point method; Steiner tree problem; Facility location problem; Algorithm; Point (geometry); Linear programming relaxation; Computer science","score_opus":0.13655247256445424,"score_gpt":0.44150555228973304,"score_spread":0.3049530797252788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015067034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16694309,0.000042906642,0.83047,0.0012674311,0.00016206218,0.0006928781,0.000032971275,0.0001294769,0.00025915887],"genre_scores_gemma":[0.6930179,0.000022223187,0.30648488,0.00003877304,0.00006884748,0.00018847047,0.0000613879,0.000036689034,0.00008084996],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987593,0.0001632411,0.00028270445,0.00021042197,0.00024856688,0.00033573917],"domain_scores_gemma":[0.9984454,0.00017950954,0.000011660943,0.00034951422,0.0008679154,0.0001459795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022244768,0.00011029693,0.00016244223,0.00029178156,0.0001817043,0.00017827321,0.00022215045,0.000110304725,0.00007434417],"category_scores_gemma":[0.00039045396,0.00010852411,0.00005348984,0.00034772925,0.00014359142,0.00029062002,0.00003407482,0.0003919568,0.0000046401938],"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.00002424964,0.00018712852,0.00025207028,0.00014855135,0.00008035546,0.0000012853619,0.0012967142,0.14112549,0.124129556,0.0016139908,0.0013665952,0.729774],"study_design_scores_gemma":[0.00024183677,0.0001762105,0.00015017558,0.000023228566,0.0000029215278,0.0000017594406,0.00018193593,0.90785646,0.09031888,0.000099693316,0.00084007264,0.000106841886],"about_ca_topic_score_codex":0.000074138545,"about_ca_topic_score_gemma":0.00031811782,"teacher_disagreement_score":0.76673096,"about_ca_system_score_codex":0.000013092429,"about_ca_system_score_gemma":0.00008121122,"threshold_uncertainty_score":0.44254848},"labels":[],"label_agreement":null},{"id":"W2015274422","doi":"10.1287/opre.1070.0387","title":"The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"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; Combinatorics; Euclidean geometry; Mathematics; Undirected graph; Bottleneck traveling salesman problem; Disjoint sets; Algorithm; Graph; Computer science; Discrete mathematics","score_opus":0.08440112380429196,"score_gpt":0.384531815803507,"score_spread":0.30013069199921505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015274422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22343856,0.004072683,0.5731156,0.010989378,0.0011009398,0.0033797552,0.000065530185,0.002094026,0.18174353],"genre_scores_gemma":[0.66347826,0.0006831635,0.3197004,0.000032771928,0.0003819476,0.000047096524,0.000048620313,0.00008704119,0.015540691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998379,0.00021772509,0.00031301766,0.00020870616,0.00036695512,0.00051463174],"domain_scores_gemma":[0.9987567,0.00049840397,0.0000075672833,0.00032250187,0.00022027717,0.0001945563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032869643,0.00010644492,0.00009278792,0.00017023564,0.00085210305,0.0003726309,0.00020604365,0.000082394086,0.000017653425],"category_scores_gemma":[0.00050644483,0.00008448668,0.000018123685,0.0008590228,0.00014748004,0.00014098555,0.00007083423,0.00042164265,0.000041841922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012058335,0.00007446804,0.00046755804,0.00005840298,0.000116991534,0.000036919184,0.00608713,0.5703604,0.041883975,0.009652176,0.0154178,0.3557236],"study_design_scores_gemma":[0.0010628045,0.00010027575,0.0035244022,0.00004288017,0.000008317021,0.000046747908,0.0005673905,0.95695806,0.009681721,0.00023108762,0.027481213,0.00029512902],"about_ca_topic_score_codex":0.00023437336,"about_ca_topic_score_gemma":0.00077714445,"teacher_disagreement_score":0.4400397,"about_ca_system_score_codex":0.00009427702,"about_ca_system_score_gemma":0.000105304185,"threshold_uncertainty_score":0.6553774},"labels":[],"label_agreement":null},{"id":"W2016268962","doi":"10.1016/j.cor.2003.11.016","title":"Hub-and-spoke network design with congestion","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":168,"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":"Spoke-hub distribution paradigm; Network planning and design; Computer science; Mathematical optimization; Heuristic; Term (time); Function (biology); Network model; Operations research; Mathematics; Computer network; Artificial intelligence; Transport engineering","score_opus":0.07669300078247837,"score_gpt":0.3428464463994623,"score_spread":0.26615344561698395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016268962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01946427,0.00019038196,0.9788409,0.00046081803,0.00011812282,0.00036822923,9.450674e-7,0.0002518526,0.00030448817],"genre_scores_gemma":[0.3697007,0.00006878149,0.62994355,0.00003165852,0.00012113344,0.000039567814,0.0000081354865,0.00002699501,0.000059460344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.00024264336,0.00014858611,0.00019826148,0.00025962424,0.00033701674],"domain_scores_gemma":[0.9992342,0.00020617162,0.0000049756604,0.0002219849,0.00022137401,0.000111278045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010590163,0.00010462123,0.00011212276,0.00014885134,0.00039442,0.00023684057,0.00014509233,0.00006375989,0.000013990449],"category_scores_gemma":[0.000056786514,0.000098470846,0.000012275265,0.00062760257,0.0001079039,0.00018403216,0.00005127295,0.00031664292,0.000031113443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062379663,0.000010177949,0.00006216154,0.0000123287655,0.000013927264,0.000005553439,0.00027650627,0.99091595,0.00022739962,0.003215274,0.00039725873,0.0048572314],"study_design_scores_gemma":[0.00048665504,0.00010916184,0.0008844936,0.00007396161,0.000004691274,0.000023495086,0.000032032014,0.99716306,0.00061586674,0.00019206532,0.00027862669,0.00013586509],"about_ca_topic_score_codex":0.000025511621,"about_ca_topic_score_gemma":0.000024915924,"teacher_disagreement_score":0.35023645,"about_ca_system_score_codex":0.00012286277,"about_ca_system_score_gemma":0.000087677145,"threshold_uncertainty_score":0.40155244},"labels":[],"label_agreement":null},{"id":"W2016619874","doi":"10.1016/j.ejor.2004.06.016","title":"The single-node dynamic service scheduling and dispatching problem","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"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":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Operations research; Mathematical optimization; Distributed computing; Computer network; Quality of service; Mathematics","score_opus":0.0517134440202458,"score_gpt":0.3366651362674725,"score_spread":0.2849516922472267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016619874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64907926,0.0014519718,0.33530018,0.008045777,0.00020048833,0.00016950456,0.000002583441,0.000048985432,0.005701281],"genre_scores_gemma":[0.8050882,0.0001842189,0.19443503,0.00005862808,0.0001418129,8.595895e-7,0.000001391722,0.000038109534,0.0000517356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812347,0.0005970298,0.00037876674,0.000092642425,0.00057052454,0.00023755322],"domain_scores_gemma":[0.9987526,0.0003556367,0.000048385846,0.00011009353,0.00062196783,0.00011134221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061054663,0.00008468988,0.000090037865,0.00011994953,0.0004874785,0.00039500796,0.00027920865,0.000016409396,0.000008341277],"category_scores_gemma":[0.0005152442,0.00006207406,0.000026545164,0.00030557622,0.00006100195,0.00027501088,0.00008152606,0.00063667004,0.000019173156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012727036,0.000013525417,0.00006713595,0.000020386333,0.000023195933,0.000026800224,0.00057450996,0.97239226,0.016410943,0.0009568561,0.00002409553,0.009477533],"study_design_scores_gemma":[0.0027750505,0.00039024968,0.013746438,0.000860877,0.000021682323,0.00083515013,0.0013383987,0.9672743,0.0031349077,0.0023520675,0.0068082684,0.0004625751],"about_ca_topic_score_codex":0.0000021069245,"about_ca_topic_score_gemma":0.000006545173,"teacher_disagreement_score":0.15600897,"about_ca_system_score_codex":0.00013572379,"about_ca_system_score_gemma":0.000096611184,"threshold_uncertainty_score":0.3809071},"labels":[],"label_agreement":null},{"id":"W2016827346","doi":"10.1016/j.cor.2012.04.010","title":"A branch-price-and-cut algorithm for the workover rig routing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"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; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; National Science Council","keywords":"Workover; Vehicle routing problem; Computer science; Routing (electronic design automation); Mathematical optimization; Set (abstract data type); Algorithm; Mathematics; Engineering; Petroleum engineering; Computer network","score_opus":0.06427568574875933,"score_gpt":0.3626531758041617,"score_spread":0.2983774900554024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016827346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002450752,0.00072793465,0.9942617,0.00057360565,0.000350001,0.00079564325,0.0000068455797,0.00017287531,0.00066067546],"genre_scores_gemma":[0.22487922,0.00008937501,0.77363014,0.00007375951,0.0006068334,0.00022508927,0.000011356238,0.000048955768,0.00043529083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985428,0.00019915882,0.00022400859,0.00017598589,0.00027395668,0.0005841036],"domain_scores_gemma":[0.99834085,0.0010123817,0.000009373944,0.00028884434,0.0002220709,0.00012645805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023890382,0.00012155331,0.00012683382,0.00013843332,0.00078595465,0.0003329752,0.00026338076,0.00007350978,0.000026447393],"category_scores_gemma":[0.00013620163,0.00009795827,0.000042673044,0.0005457737,0.00008468507,0.0003053192,0.00014686654,0.00036782905,0.000026005979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019730812,0.00002657531,0.0001914217,0.000028135886,0.000059013713,2.5050372e-7,0.0019150665,0.6224983,0.0002997473,0.0027771534,0.0034186996,0.36878368],"study_design_scores_gemma":[0.00025338025,0.000016268279,0.0005273468,0.000028390923,0.0000072912967,0.000007234094,0.00008171728,0.99141175,0.0003896854,0.00005104619,0.0071068304,0.00011906644],"about_ca_topic_score_codex":0.00002339992,"about_ca_topic_score_gemma":0.0000070371884,"teacher_disagreement_score":0.36891347,"about_ca_system_score_codex":0.00010156031,"about_ca_system_score_gemma":0.000039041974,"threshold_uncertainty_score":0.6045007},"labels":[],"label_agreement":null},{"id":"W2017602820","doi":"10.1016/j.ejor.2007.08.021","title":"A tabu search heuristic for the generalized minimum spanning tree problem","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"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":"Tabu search; Minimum spanning tree; Guided Local Search; Mathematical optimization; Heuristic; Spanning tree; Beam search; Mathematics; Vertex (graph theory); k-minimum spanning tree; Tree (set theory); Kruskal's algorithm; Set (abstract data type); Computer science; Graph; Algorithm; Search algorithm; Combinatorics; Tree structure; K-ary tree; Binary tree","score_opus":0.11878875091194746,"score_gpt":0.3928427993228669,"score_spread":0.27405404841091946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017602820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06373905,0.0008328063,0.92384857,0.0012622153,0.00026919314,0.00041227907,0.000006251389,0.000034837285,0.009594807],"genre_scores_gemma":[0.7133923,0.00010480461,0.2837881,0.00006860446,0.0012487186,0.0000051437687,0.0000056402914,0.00008292997,0.0013037188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969612,0.0008379927,0.0006430109,0.00012811997,0.000970458,0.00045921552],"domain_scores_gemma":[0.9962199,0.0020242166,0.000059858863,0.0001739667,0.0013573795,0.00016471259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024915202,0.000114727256,0.00015654443,0.0003152395,0.00041382824,0.00023243573,0.0005044133,0.00002601808,0.00009259545],"category_scores_gemma":[0.0013696966,0.00008281819,0.00009550286,0.00046150564,0.00010189138,0.00016612123,0.000066932225,0.00066478335,0.000029287847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002449775,0.000049116494,0.00037939855,0.00006414871,0.00014438514,0.00012260844,0.0017190654,0.9165468,0.02734089,0.002903483,0.013955159,0.03652996],"study_design_scores_gemma":[0.0033204015,0.0006457283,0.014277445,0.00019124706,0.000036363224,0.00033191222,0.0009524938,0.9176417,0.007832399,0.00020305478,0.054211058,0.00035620618],"about_ca_topic_score_codex":0.0000018594948,"about_ca_topic_score_gemma":0.0000020816115,"teacher_disagreement_score":0.64965326,"about_ca_system_score_codex":0.000116180534,"about_ca_system_score_gemma":0.00015910968,"threshold_uncertainty_score":0.8635161},"labels":[],"label_agreement":null},{"id":"W2018660239","doi":"10.1016/j.orl.2008.09.006","title":"Certification of an optimal TSP tour through 85,900 cities","year":2008,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":171,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Travelling salesman problem; Certification; Code (set theory); Traveling purchaser problem; Computer science; Mathematical optimization; Operations research; Bottleneck traveling salesman problem; Mathematics; Programming language; Economics","score_opus":0.12102799807608362,"score_gpt":0.374011808626763,"score_spread":0.25298381055067937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018660239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8182901,0.000051750125,0.17748986,0.0014636563,0.00008579887,0.00023822107,0.00001405084,0.00015482683,0.002211744],"genre_scores_gemma":[0.7716902,0.00007246708,0.22761235,0.000089963294,0.000110412395,0.00006297376,0.000054611523,0.000035724435,0.00027130102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843824,0.00031424538,0.00029166738,0.00019497746,0.00045024444,0.00031062998],"domain_scores_gemma":[0.99913716,0.000099710785,0.00001169903,0.00042025957,0.0002611264,0.00007002623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006290692,0.00010420609,0.00013328821,0.00021526785,0.00038611423,0.00007234568,0.00025290626,0.00006395906,0.00025726613],"category_scores_gemma":[0.00019614045,0.00011153422,0.000036356738,0.0005657591,0.00027615504,0.00061636785,0.000034251294,0.00028883867,0.00004107712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053136155,0.000022949689,0.00005647936,0.000015166946,0.000014001074,0.00000393555,0.002044487,0.87886965,0.11369281,0.00016193405,0.00453419,0.0005790983],"study_design_scores_gemma":[0.00021358604,0.000045613167,0.0010470867,0.000015462077,0.0000037217449,0.000016214071,0.00044975258,0.877345,0.119150005,0.000008702331,0.0015498758,0.00015495965],"about_ca_topic_score_codex":0.000111736095,"about_ca_topic_score_gemma":0.0000137302095,"teacher_disagreement_score":0.050122485,"about_ca_system_score_codex":0.00009976253,"about_ca_system_score_gemma":0.00005871126,"threshold_uncertainty_score":0.45482334},"labels":[],"label_agreement":null},{"id":"W2019515431","doi":"10.1109/cipls.2013.6595205","title":"Discrete PSO for the uncapacitated single allocation hub location problem","year":2013,"lang":"en","type":"article","venue":"","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":"Brock University","funders":"","keywords":"Heuristics; Mathematical optimization; Particle swarm optimization; Computer science; Benchmark (surveying); Node (physics); Metaheuristic; Operations research; Artificial intelligence; Engineering; Mathematics","score_opus":0.021096845887678906,"score_gpt":0.24619580082957948,"score_spread":0.22509895494190058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019515431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032384477,0.00006260116,0.99004644,0.0010638802,0.00014014744,0.0008213601,0.000001297776,0.0005027224,0.004123078],"genre_scores_gemma":[0.70184267,0.000007867431,0.2966405,0.0000865422,0.000057172292,0.00028030665,0.00002492031,0.000035792753,0.00102427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993986,0.000030562336,0.00019825237,0.0001118339,0.00009018432,0.00017058515],"domain_scores_gemma":[0.99931264,0.00021315578,0.000031644602,0.00020105811,0.00020775027,0.00003374409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026901092,0.00009775828,0.000073514944,0.00003718109,0.000095461975,0.0000931617,0.0001156187,0.00005363725,0.00009889437],"category_scores_gemma":[0.000104729756,0.00007010792,0.000026915179,0.0002616895,0.000023385026,0.00022941355,0.000010006842,0.000059998878,0.000050962102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016072603,0.00000984114,0.000053527634,0.000049878083,0.000028222365,1.2947854e-8,0.00032485576,0.9523496,0.018412696,0.002116383,0.0040422073,0.022611173],"study_design_scores_gemma":[0.00016672381,0.000024395607,0.00044605014,0.000012339572,0.000014265064,7.84391e-7,0.00015263673,0.9865122,0.009852768,0.00085644756,0.0018482457,0.00011317017],"about_ca_topic_score_codex":0.000032318952,"about_ca_topic_score_gemma":0.000009740716,"teacher_disagreement_score":0.6986042,"about_ca_system_score_codex":0.00005664009,"about_ca_system_score_gemma":0.00000951013,"threshold_uncertainty_score":0.2858918},"labels":[],"label_agreement":null},{"id":"W2020549453","doi":"10.1007/s10100-006-0169-2","title":"Synchronized routing of seasonal products through a production/distribution network","year":2006,"lang":"en","type":"article","venue":"Central European Journal of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Schedule; Time horizon; Production (economics); Product (mathematics); Routing (electronic design automation); Computer science; Heuristics; Operations research; Total cost; Vehicle routing problem; Scale (ratio); Business; Computer network; Mathematics; Economics; Microeconomics","score_opus":0.04278477667330224,"score_gpt":0.3139369132214654,"score_spread":0.27115213654816317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020549453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5664838,0.0013974496,0.42584983,0.001000157,0.0010825227,0.00046732716,0.000024386258,0.00010089247,0.003593672],"genre_scores_gemma":[0.91869557,0.00013573827,0.07919196,0.0000036539923,0.0016943279,0.0000016405453,0.00003861517,0.00004116398,0.00019733544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665064,0.0012844696,0.00077803084,0.0001634501,0.00061323814,0.00051015336],"domain_scores_gemma":[0.99795014,0.000078670644,0.00008548555,0.00022314148,0.0015803502,0.000082239865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004266451,0.00012489218,0.00021617691,0.00009138087,0.00030231458,0.0001181439,0.00026506942,0.00003062094,0.000049619262],"category_scores_gemma":[0.0011210594,0.00011720802,0.00007332208,0.00107059,0.00013497999,0.0004253948,0.00004897606,0.00057793944,0.00001194985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022196578,0.000060264196,0.0005148689,0.000044580316,0.000034198736,0.000018046661,0.00019106953,0.978412,0.009897995,0.0013617327,0.00773095,0.0017121275],"study_design_scores_gemma":[0.0026692292,0.0004743238,0.05237799,0.0009688455,0.00010071833,0.00060979545,0.00048403756,0.857523,0.0652539,0.00020155715,0.01866406,0.0006725289],"about_ca_topic_score_codex":0.0000096634685,"about_ca_topic_score_gemma":0.000003456191,"teacher_disagreement_score":0.3522118,"about_ca_system_score_codex":0.0002280664,"about_ca_system_score_gemma":0.00022023657,"threshold_uncertainty_score":0.47796044},"labels":[],"label_agreement":null},{"id":"W2020889483","doi":"10.1016/j.ejor.2014.09.015","title":"A column generation approach for a multi-attribute vehicle routing problem","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Column generation; Vehicle routing problem; Column (typography); Computer science; Routing (electronic design automation); Mathematical optimization; Operations research; Mathematics; Computer network","score_opus":0.18071534324525806,"score_gpt":0.37511228400514873,"score_spread":0.19439694075989067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020889483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030571375,0.000077582874,0.9665071,0.00020143787,0.0001156347,0.00031226888,0.000007671555,0.000039888128,0.0021670794],"genre_scores_gemma":[0.5009729,0.000009995284,0.4979878,0.000031254032,0.0006707059,0.0000087066865,0.00002058207,0.00004417743,0.0002538492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685776,0.0014265457,0.00060263317,0.00016286329,0.0006206555,0.00032955108],"domain_scores_gemma":[0.997944,0.00027831254,0.00008942437,0.00014282057,0.001397774,0.00014769356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014061226,0.00011483993,0.0001802136,0.00022352453,0.00034778024,0.00028385062,0.00030346937,0.000034844783,0.000022302844],"category_scores_gemma":[0.0014900434,0.00010974015,0.00008013949,0.00032419158,0.000048553884,0.00029325942,0.000049349586,0.00045987187,0.000016497315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017373197,0.00006449965,0.00048428462,0.000042540516,0.00004204556,0.0000036612012,0.0004030299,0.94979316,0.03771728,0.0013157632,0.0040474026,0.006068981],"study_design_scores_gemma":[0.0011920362,0.0001916927,0.0011706258,0.000028631985,0.0000068119957,0.000029796667,0.000059473427,0.9911352,0.0027023165,0.000008437476,0.0033590314,0.000115985],"about_ca_topic_score_codex":0.0000010813482,"about_ca_topic_score_gemma":6.9319736e-7,"teacher_disagreement_score":0.47040156,"about_ca_system_score_codex":0.00012464834,"about_ca_system_score_gemma":0.00009521577,"threshold_uncertainty_score":0.4873368},"labels":[],"label_agreement":null},{"id":"W2022879582","doi":"10.1016/j.cie.2012.07.006","title":"Relax-and-fix decomposition technique for solving large scale grid-based location problems","year":2012,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Decomposition; Mathematical optimization; Grid; Integer programming; Benders' decomposition; Computer science; Branch and bound; Scale (ratio); Linear programming; Branch and cut; Tree (set theory); Mathematics","score_opus":0.02363982486011327,"score_gpt":0.25562696010428,"score_spread":0.23198713524416673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022879582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012423509,0.00018781352,0.9839427,0.000046479432,0.0017580976,0.00080680236,0.000009881042,0.00080096314,0.000023788783],"genre_scores_gemma":[0.64332,0.0000047042536,0.35530433,0.000022762728,0.0010189743,0.00018625784,0.000058284688,0.00008112209,0.0000035533083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988378,0.00002835706,0.0003421007,0.00019001885,0.0001198497,0.00048184855],"domain_scores_gemma":[0.99931514,0.00023205929,0.000056315206,0.00018329412,0.00006150892,0.00015167725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085363036,0.00022610844,0.00022952985,0.00021000949,0.00010588141,0.00006667077,0.00012238145,0.00026543761,0.0000034825016],"category_scores_gemma":[0.0000977568,0.0002734733,0.000059295948,0.000337853,0.000011936757,0.00030583306,0.000039292525,0.00030386573,0.0000022752731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005736178,0.000019801535,0.00041257977,0.00013380643,0.000020349007,1.8572243e-7,0.00016124806,0.9831172,0.01315835,0.00016436142,0.0002790978,0.0025272847],"study_design_scores_gemma":[0.0009239784,0.0000318373,0.00021777577,0.00026829867,0.000026771986,0.000007958889,0.000009334677,0.97203636,0.023401342,0.000006013516,0.0027715587,0.00029874642],"about_ca_topic_score_codex":0.0000026564842,"about_ca_topic_score_gemma":3.489508e-7,"teacher_disagreement_score":0.6308965,"about_ca_system_score_codex":0.00017956176,"about_ca_system_score_gemma":0.00002134744,"threshold_uncertainty_score":0.99997175},"labels":[],"label_agreement":null},{"id":"W2023445393","doi":"10.1287/trsc.1030.0086","title":"Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":133,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia y Tecnología; Canada Research Chairs","keywords":"Travelling salesman problem; Pickup; Heuristics; Traveling purchaser problem; Mathematical optimization; Heuristic; Product (mathematics); Computer science; Greedy algorithm; 2-opt; Vehicle routing problem; Commodity; Mathematics; Operations research; Routing (electronic design automation); Economics; Artificial intelligence","score_opus":0.03870615525915687,"score_gpt":0.2777857777228835,"score_spread":0.2390796224637266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023445393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21774086,0.000051792682,0.7814001,0.0001774921,0.00011070293,0.00023788036,0.000017754099,0.0001493782,0.00011406535],"genre_scores_gemma":[0.7581933,0.000048272483,0.24164934,0.000041797117,0.00002361908,0.000018681367,0.0000063221455,0.0000114858385,0.000007167987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917066,0.000007581678,0.0002215447,0.00017423791,0.00023002025,0.00019593735],"domain_scores_gemma":[0.99950826,0.00014036219,0.00003564102,0.00014002458,0.00011591402,0.000059815684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007643418,0.000086598426,0.00008892392,0.000047524365,0.00030617812,0.00006064938,0.00019802168,0.000032130763,0.000003905792],"category_scores_gemma":[0.00003875691,0.000075848824,0.000026665142,0.00037093024,0.00019140259,0.00022082741,0.0000024251754,0.000094549396,0.000002099471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003827879,0.000008951968,0.00054962805,0.000043176697,0.000004995566,3.0106216e-7,0.001892517,0.98172265,0.0041462798,0.0069985087,0.0000043645323,0.00462481],"study_design_scores_gemma":[0.0015652216,0.00006959094,0.16252552,0.000104181534,0.00011298014,0.00000422445,0.000493119,0.79891795,0.026364356,0.008659879,0.00066332775,0.00051966304],"about_ca_topic_score_codex":0.000019403251,"about_ca_topic_score_gemma":0.000052461746,"teacher_disagreement_score":0.5404525,"about_ca_system_score_codex":0.00004370357,"about_ca_system_score_gemma":0.000066981615,"threshold_uncertainty_score":0.3093025},"labels":[],"label_agreement":null},{"id":"W2023470442","doi":"10.1016/j.ejor.2015.01.020","title":"The discrete time window assignment vehicle routing problem","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"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; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Heuristics; Mathematical optimization; Computer science; Set (abstract data type); Window (computing); Routing (electronic design automation); Assignment problem; Mathematics","score_opus":0.07976025754685145,"score_gpt":0.34897727786088706,"score_spread":0.2692170203140356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023470442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22893846,0.0025056733,0.402839,0.015528085,0.0013225725,0.0011511688,0.000018099727,0.00027464694,0.3474223],"genre_scores_gemma":[0.95835024,0.000043970773,0.038552042,0.000035071153,0.0006543399,0.0000024919748,0.0000029899986,0.000059645405,0.0022991768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958614,0.0019615435,0.00051736773,0.00009881832,0.0012361042,0.0003247329],"domain_scores_gemma":[0.99810326,0.000490401,0.00007216857,0.00016530734,0.000934299,0.00023455817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017951207,0.00009684251,0.000117117524,0.00010550463,0.00036065426,0.00039660546,0.00045519412,0.000018172279,0.00005028325],"category_scores_gemma":[0.0012205978,0.000066275905,0.000050758383,0.0002942375,0.000091432514,0.00028231076,0.00010613075,0.00062640803,0.00025365144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005253922,0.000022441898,0.00044734013,0.000006546913,0.000068609006,0.00007160947,0.00090670236,0.95610934,0.012613113,0.0012232456,0.016831875,0.011646636],"study_design_scores_gemma":[0.0023277435,0.00072278775,0.0056625055,0.0002032104,0.000017140257,0.00023052927,0.0008616296,0.9053153,0.005784046,0.0005031106,0.077996686,0.0003753235],"about_ca_topic_score_codex":8.2622375e-7,"about_ca_topic_score_gemma":2.5784038e-7,"teacher_disagreement_score":0.7294118,"about_ca_system_score_codex":0.00020632042,"about_ca_system_score_gemma":0.00019601964,"threshold_uncertainty_score":0.62215656},"labels":[],"label_agreement":null},{"id":"W2023482164","doi":"10.1287/opre.50.3.415.7751","title":"An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":282,"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; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Integer (computer science); Mathematical optimization; Computer science; Integer programming; Routing (electronic design automation); Operations research; TRIPS architecture; Mathematics","score_opus":0.07063186204221393,"score_gpt":0.3441733096093075,"score_spread":0.27354144756709353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023482164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007858652,0.000110877125,0.9896825,0.00041773487,0.000048544705,0.00097211404,0.000020812508,0.00024480434,0.00064398843],"genre_scores_gemma":[0.72811407,0.000014475295,0.27034846,0.000028974488,0.00012012701,0.0005377062,0.00002240674,0.00006782935,0.00074593467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842197,0.00022724424,0.0002400555,0.0002456471,0.0003741906,0.0004908951],"domain_scores_gemma":[0.99836767,0.0005438496,0.000010366746,0.00038566158,0.0005829768,0.00010945564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015466877,0.00013895144,0.0001300001,0.00015488012,0.000957034,0.0003677683,0.00030466157,0.0000752634,0.00017168734],"category_scores_gemma":[0.0001873732,0.000099129305,0.0000285006,0.0008448548,0.000121206926,0.0003174107,0.000027495827,0.00045055966,0.000039100123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036326926,0.000036564965,0.000012657253,0.000010203643,0.000034614375,8.9711045e-7,0.0014559464,0.97062725,0.0029868872,0.00032962617,0.00026031685,0.024241399],"study_design_scores_gemma":[0.0004566754,0.00013478815,0.000027828946,0.000026781585,0.00001220868,0.000007830081,0.0006293818,0.99780095,0.0005598681,0.000018066292,0.00018391866,0.00014171256],"about_ca_topic_score_codex":0.000053076667,"about_ca_topic_score_gemma":0.00009989234,"teacher_disagreement_score":0.72025543,"about_ca_system_score_codex":0.000097669144,"about_ca_system_score_gemma":0.000035327983,"threshold_uncertainty_score":0.73608285},"labels":[],"label_agreement":null},{"id":"W2023863254","doi":"10.1057/palgrave.jors.2602469","title":"A tabu search heuristic for a routing problem arising in servicing of offshore oil and gas platforms","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"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":"Tabu search; Heuristics; Pickup; Computer science; Subsea; Vehicle routing problem; Operations research; Submarine pipeline; Heuristic; Routing (electronic design automation); Marine engineering; Engineering; Algorithm; Computer network; Operating system","score_opus":0.055558270644770216,"score_gpt":0.36890622218435587,"score_spread":0.31334795153958567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023863254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92239004,0.00023836587,0.076053545,0.00077537267,0.00006936717,0.00015068664,0.000004995917,0.000008022561,0.0003095785],"genre_scores_gemma":[0.83455926,0.00014323585,0.16500857,0.000029114295,0.0001423035,0.000003031885,0.0000012748392,0.000021476457,0.00009171611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981502,0.00008350855,0.0005803946,0.00009388354,0.00075009215,0.00034190752],"domain_scores_gemma":[0.9978191,0.0011476256,0.000088529436,0.00010031205,0.00076639425,0.00007799384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013075143,0.000085055624,0.00019367183,0.00011670693,0.00023083614,0.000073979005,0.0002259632,0.00008484467,0.000005942545],"category_scores_gemma":[0.0008162279,0.00006171362,0.00011086944,0.00053400383,0.00008489139,0.00022447908,0.00009386655,0.0007121039,1.7775369e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083380655,0.00005202089,0.012508177,0.0005314253,0.00009516111,0.0000027304714,0.010017332,0.9259923,0.035040654,0.001529646,0.00030210434,0.013845083],"study_design_scores_gemma":[0.00093216985,0.00007137058,0.007041941,0.00053643977,0.000009265378,0.000045125103,0.003192895,0.978439,0.008437554,0.0011160689,0.00008159026,0.00009661174],"about_ca_topic_score_codex":0.000020667869,"about_ca_topic_score_gemma":0.000023262168,"teacher_disagreement_score":0.08895503,"about_ca_system_score_codex":0.0002703218,"about_ca_system_score_gemma":0.00022914854,"threshold_uncertainty_score":0.45316097},"labels":[],"label_agreement":null},{"id":"W2024936662","doi":"10.1109/cec.2010.5586382","title":"An efficient genetic algorithm for the uncapacitated single allocation hub location problem","year":2010,"lang":"en","type":"article","venue":"","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":"Brock University","funders":"","keywords":"Crossover; Benchmark (surveying); Genetic algorithm; Encoding (memory); Computer science; Mathematical optimization; Flow network; Simple (philosophy); Chromosome; Facility location problem; Network planning and design; Representation (politics); Algorithm; Mathematics; Computer network; Artificial intelligence","score_opus":0.0141453342209531,"score_gpt":0.25239516910405196,"score_spread":0.23824983488309887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024936662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022053862,0.00002833504,0.9759821,0.00010552825,0.00037648279,0.0005580987,0.0000027138483,0.00048695377,0.0004058709],"genre_scores_gemma":[0.3756954,0.0000016707189,0.6240181,0.00002767161,0.00008011223,0.00007177315,0.000016517663,0.000028676093,0.000060069186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993235,0.0000319307,0.0002005038,0.00015036276,0.00011490901,0.00017881466],"domain_scores_gemma":[0.9992602,0.00013901836,0.00003249216,0.00029568656,0.0002221622,0.00005046771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043542244,0.00010545928,0.00007115808,0.000051587856,0.00011924962,0.00007411471,0.00015351121,0.00007792634,0.000032916374],"category_scores_gemma":[0.000054943943,0.00008281436,0.000022999495,0.00027975545,0.000031405667,0.00006346981,0.0000069859852,0.00011249853,0.0000092546625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3466344e-7,0.00002841338,0.000011000675,0.000011011847,0.000008490505,3.3773684e-8,0.000195562,0.82295835,0.032732755,0.00025692236,0.00006301236,0.14373374],"study_design_scores_gemma":[0.00018277591,0.00003557718,0.00057749083,0.000004143853,0.000016863021,0.0000028514278,0.00007103511,0.97692925,0.021325637,0.0000853056,0.000652828,0.00011625927],"about_ca_topic_score_codex":0.000010787084,"about_ca_topic_score_gemma":0.000016263853,"teacher_disagreement_score":0.35364154,"about_ca_system_score_codex":0.000034600194,"about_ca_system_score_gemma":0.00001810317,"threshold_uncertainty_score":0.33770716},"labels":[],"label_agreement":null},{"id":"W2025149700","doi":"10.1287/trsc.1030.0064","title":"Designing Distribution Networks: Formulations and Solution Heuristic","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transshipment (information security); Tabu search; Computer science; Truck; Metaheuristic; Heuristic; Mathematical optimization; Operations research; Consolidation (business); Context (archaeology); Engineering; Algorithm; Mathematics; Economics; Artificial intelligence","score_opus":0.017720834199634494,"score_gpt":0.2662849077816137,"score_spread":0.24856407358197918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025149700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17106669,0.0000379748,0.82838297,0.000034188826,0.000098130724,0.00008692024,0.0000071818595,0.00021701938,0.000068924914],"genre_scores_gemma":[0.88695645,0.00002279116,0.11292934,0.000010663095,0.000016277118,0.000006907009,0.000046328,0.000007606954,0.0000036461533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999297,0.000008209653,0.00018254672,0.00014871707,0.00017523489,0.00018828032],"domain_scores_gemma":[0.9997039,0.000031734864,0.000028921777,0.000083204795,0.00007839989,0.000073879724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040522267,0.00007306882,0.000064120686,0.00006559192,0.0002628628,0.00005247195,0.00006900531,0.00003224025,0.00000430781],"category_scores_gemma":[0.000042270076,0.00008103037,0.0000136962535,0.0006806051,0.0001240955,0.00051147485,0.000001727255,0.00006755484,0.000002553712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011154021,0.0000034010677,0.0010944096,0.000006866786,0.0000011978352,4.6187446e-7,0.00027038855,0.98726,0.004550957,0.004922122,0.000002487272,0.0018865892],"study_design_scores_gemma":[0.00029161692,0.000013116663,0.1497459,0.00002607511,0.000013710332,0.0000026228413,0.000033252454,0.8440568,0.004467002,0.0011794227,0.000032964886,0.00013755696],"about_ca_topic_score_codex":0.0000102857,"about_ca_topic_score_gemma":0.000012805349,"teacher_disagreement_score":0.71588975,"about_ca_system_score_codex":0.000087373824,"about_ca_system_score_gemma":0.000034548328,"threshold_uncertainty_score":0.33043224},"labels":[],"label_agreement":null},{"id":"W2025661878","doi":"10.1016/j.ejor.2003.09.024","title":"Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"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":"Travelling salesman problem; Undirected graph; Combinatorics; Bottleneck traveling salesman problem; Euclidean geometry; Disjoint sets; Lin–Kernighan heuristic; Mathematics; Algorithm; Branch and cut; Hamiltonian path; Discrete mathematics; Computer science; Graph; Integer programming","score_opus":0.10347229407901987,"score_gpt":0.36713532248867153,"score_spread":0.26366302840965167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025661878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05425559,0.0026726217,0.912051,0.0023201685,0.00058605406,0.0007974455,0.000014304087,0.00008171145,0.02722109],"genre_scores_gemma":[0.82780445,0.00032365607,0.17051436,0.000052610183,0.0003120163,0.0000092722985,0.000003202208,0.0000676595,0.0009127875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779826,0.0010548019,0.00036418415,0.00009845476,0.0004505868,0.0002336955],"domain_scores_gemma":[0.99819076,0.0008497134,0.000040359817,0.000114658986,0.00070232246,0.000102205624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074309004,0.00008911714,0.00011613023,0.00014437882,0.00031238495,0.00018340068,0.00021550943,0.00001891603,0.000081572674],"category_scores_gemma":[0.0011114896,0.00006322371,0.000046628284,0.0002704108,0.00009335148,0.0001392324,0.000022558086,0.0004048208,0.000015965838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082847866,0.000084872576,0.0006620449,0.0001287199,0.00030458038,0.000055805674,0.0020724905,0.88228655,0.020698493,0.017038362,0.011184612,0.06540061],"study_design_scores_gemma":[0.005090247,0.0010435818,0.019075617,0.00032909433,0.00007877154,0.0010961982,0.00060193456,0.67393076,0.015285121,0.0018614745,0.28090006,0.00070712157],"about_ca_topic_score_codex":5.537138e-7,"about_ca_topic_score_gemma":7.8020656e-7,"teacher_disagreement_score":0.77354884,"about_ca_system_score_codex":0.000054357195,"about_ca_system_score_gemma":0.000099443736,"threshold_uncertainty_score":0.25781882},"labels":[],"label_agreement":null},{"id":"W2026522103","doi":"10.3758/bf03211819","title":"A model of human performance on the traveling salesperson problem","year":2000,"lang":"en","type":"article","venue":"Memory & Cognition","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":88,"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 Victoria","funders":"","keywords":"Node (physics); Travelling salesman problem; Range (aeronautics); Heuristic; Variety (cybernetics); Mathematical optimization; Path (computing); Psychology; Algorithm; Mathematics; Computer science; Artificial intelligence; Engineering","score_opus":0.045619251886458365,"score_gpt":0.2545081547099788,"score_spread":0.2088889028235204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026522103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9472295,0.0000126869045,0.009047156,0.00003564507,0.000021436408,0.00018073423,0.000005206808,0.00016059533,0.04330701],"genre_scores_gemma":[0.9908398,0.00003074133,0.008638336,0.00006399375,0.000041286825,0.000021841532,0.000012134742,0.000027041273,0.0003248269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941534,0.000043666885,0.00017869932,0.000098895456,0.00013686986,0.00012653654],"domain_scores_gemma":[0.99974436,0.000042151318,0.000026987074,0.00012765727,0.000038067672,0.000020761365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031848272,0.00009316725,0.000093721654,0.00003744112,0.00009849766,0.000012829847,0.000076262615,0.00004631878,0.0002708888],"category_scores_gemma":[0.000010155707,0.00007976801,0.000034979905,0.0001217908,0.000026290985,0.0000774315,0.0000037684724,0.00013619201,0.000038527643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009081303,0.000016202115,0.000011333714,0.00005684386,0.000009059302,1.7715531e-7,0.0008294733,0.9088823,0.05483672,0.000047054436,0.000044728116,0.03525699],"study_design_scores_gemma":[0.00020248845,0.000035466557,0.0002200044,0.00010819594,0.00001758989,0.0000013970251,0.000068510504,0.93494976,0.06413591,0.00015898094,0.000008565673,0.00009311804],"about_ca_topic_score_codex":0.0000012193411,"about_ca_topic_score_gemma":8.0200067e-7,"teacher_disagreement_score":0.043610267,"about_ca_system_score_codex":0.000023072707,"about_ca_system_score_gemma":0.0000068812224,"threshold_uncertainty_score":0.3252845},"labels":[],"label_agreement":null},{"id":"W2026533796","doi":"10.1002/net.21529","title":"Incomplete service and split deliveries in a routing problem with profits","year":2013,"lang":"en","type":"article","venue":"Networks","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; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Orienteering; Heuristics; Computer science; Vehicle routing problem; Mathematical optimization; Operations research; Profit (economics); Constraint (computer-aided design); Service (business); Routing (electronic design automation); Mathematics; Business; Computer network; Economics; Microeconomics; Marketing","score_opus":0.008552179507714286,"score_gpt":0.19779935634048604,"score_spread":0.18924717683277176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026533796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7698603,0.00026351397,0.22447094,0.00018975527,0.00005755233,0.0006070136,7.689151e-7,0.000421736,0.004128364],"genre_scores_gemma":[0.8154967,0.000018097966,0.18422008,0.000105158775,0.00004832942,0.00005328382,0.0000034834673,0.00003226602,0.000022607663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993257,0.00004072884,0.00016752668,0.00014240839,0.00007021147,0.00025344186],"domain_scores_gemma":[0.9996916,0.000060956067,0.000027709491,0.00011362689,0.000055094504,0.000051028324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017581414,0.00012006572,0.00013736548,0.000041921743,0.000043124175,0.00006924028,0.000070252936,0.00007162486,0.000023645582],"category_scores_gemma":[0.0000074037284,0.00011009814,0.000006926384,0.00033908055,0.000016541644,0.00018766648,0.000043459255,0.00018918213,0.0000070801875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034891307,0.0000029951889,0.025761148,0.000050954393,0.000008737367,0.0000014552737,0.00046726392,0.95964843,0.00004412086,0.00015822133,0.000048684007,0.013804511],"study_design_scores_gemma":[0.00026314656,0.000013976181,0.02581567,0.00011775147,0.000004300911,0.0000076167685,0.000072430375,0.97339064,0.00001730636,0.000052448144,0.000104245795,0.00014049074],"about_ca_topic_score_codex":0.00013132395,"about_ca_topic_score_gemma":0.00011437823,"teacher_disagreement_score":0.04563634,"about_ca_system_score_codex":0.00002844616,"about_ca_system_score_gemma":0.0000060874586,"threshold_uncertainty_score":0.4489672},"labels":[],"label_agreement":null},{"id":"W2027505077","doi":"10.1016/j.dam.2014.10.001","title":"The Capacitated Orienteering Problem","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"Orienteering; Mathematics; Mathematical optimization; Upper and lower bounds; Vehicle routing problem; Generalization; Subroutine; Facility location problem; Combinatorics; Euclidean geometry; Approximation algorithm; Adjacency list; Node (physics); Routing (electronic design automation); Computer science","score_opus":0.009095838749054999,"score_gpt":0.22291782385226225,"score_spread":0.21382198510320724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027505077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008329506,0.000022067614,0.89136803,0.00004083757,0.000113610884,0.00024918892,0.0000018995992,0.00066358567,0.09921126],"genre_scores_gemma":[0.36880094,0.000020517866,0.6307278,0.000023725099,0.000068074136,0.00008845536,0.000007058758,0.000090668174,0.00017271891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910736,0.000015159034,0.00029838932,0.00011571172,0.00017781371,0.00028558882],"domain_scores_gemma":[0.99921817,0.00027487543,0.000053304026,0.00036416904,0.000029566827,0.000059939342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812403,0.00015658743,0.00015717102,0.000029699613,0.00017424862,0.00009156624,0.00021867764,0.000055790966,0.000010506441],"category_scores_gemma":[0.0000746375,0.00011446959,0.000036279525,0.00019787143,0.00004990098,0.000038906805,0.000037487465,0.0001498922,0.000064452724],"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.000004054892,0.000019554978,0.00001543421,0.00039750212,0.000089245674,5.0358824e-7,0.0035795392,0.33563927,0.01686109,0.6248662,0.0010753229,0.017452285],"study_design_scores_gemma":[0.00022975093,0.000008673209,0.000013876514,0.000032458513,0.000022467037,0.0000035291957,0.00045284652,0.96210223,0.007017647,0.021061372,0.008802547,0.00025258958],"about_ca_topic_score_codex":5.1817204e-7,"about_ca_topic_score_gemma":0.0000011706113,"teacher_disagreement_score":0.626463,"about_ca_system_score_codex":0.000030978037,"about_ca_system_score_gemma":0.000004734993,"threshold_uncertainty_score":0.46679345},"labels":[],"label_agreement":null},{"id":"W2028470441","doi":"10.1016/j.cor.2014.07.004","title":"Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Vehicle routing problem; Modular design; Heuristic; Computer science; Sizing; Mathematical optimization; Depot; Algorithm; Routing (electronic design automation); Mathematics","score_opus":0.11255804548950706,"score_gpt":0.3764900752146841,"score_spread":0.26393202972517704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028470441","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10513518,0.00026067736,0.89341515,0.00007562448,0.0001860111,0.00065486383,0.0000074323716,0.00023452146,0.00003053114],"genre_scores_gemma":[0.40581602,0.000016030684,0.5938614,0.000017453249,0.00013939994,0.00005708926,0.000012080815,0.00005057884,0.000029930785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804604,0.00035789082,0.00036218535,0.00038331907,0.0002900643,0.0005605139],"domain_scores_gemma":[0.99879867,0.0003525308,0.000016952736,0.00030870654,0.0003638844,0.00015922943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089779,0.00017748715,0.00023061722,0.00028933352,0.000997117,0.00055362895,0.00022712794,0.000099334655,0.000004759103],"category_scores_gemma":[0.0004263828,0.00019687862,0.000045722758,0.00047370553,0.00011264521,0.0002434249,0.0001536641,0.0003540707,0.00000654528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013199026,0.000020926163,0.00013234778,0.000085751926,0.00002124822,0.0000010523788,0.0008647662,0.9413551,0.010819878,0.00023672069,0.000021435117,0.046439447],"study_design_scores_gemma":[0.00065178657,0.00005390907,0.0002458147,0.00010227016,0.000009423578,0.000012467917,0.00010046629,0.99740326,0.00088705815,0.000028751927,0.00029436251,0.00021043059],"about_ca_topic_score_codex":0.00007143829,"about_ca_topic_score_gemma":0.000016922386,"teacher_disagreement_score":0.30068082,"about_ca_system_score_codex":0.00014743187,"about_ca_system_score_gemma":0.000056933506,"threshold_uncertainty_score":0.8028477},"labels":[],"label_agreement":null},{"id":"W2029341065","doi":"10.1002/net.20033","title":"An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":665,"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":"Column generation; Shortest path problem; Path (computing); Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Computation; K shortest path routing; Longest path problem; Constrained Shortest Path First; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.008733564536156346,"score_gpt":0.2388332489582275,"score_spread":0.23009968442207115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029341065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031012108,0.000113897906,0.99411255,0.00023028681,0.00005529507,0.0016994231,0.000014515074,0.0005013429,0.00017149192],"genre_scores_gemma":[0.5673158,0.000011822864,0.4312564,0.00036029602,0.0004087675,0.0004814431,0.00007564282,0.000082658116,0.000007154552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986975,0.000044279586,0.0003120204,0.00031594848,0.00017594716,0.00045431405],"domain_scores_gemma":[0.9992006,0.00014848394,0.00007014357,0.00038781212,0.00006421468,0.00012877995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007728843,0.00020618246,0.00016828207,0.00004077988,0.00024311073,0.00009913483,0.00026515246,0.000094842384,0.000006740194],"category_scores_gemma":[0.00000908758,0.00016512132,0.000036328238,0.00032877582,0.000053748394,0.00018572954,0.000026368656,0.00024341856,0.000002891615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044991325,0.000020916417,0.00021764223,0.0000072206144,0.00002596023,4.9482964e-7,0.00023629954,0.7256218,0.00018961001,0.00023949209,0.0000664521,0.27336958],"study_design_scores_gemma":[0.0006201129,0.00014818029,0.00037730075,0.0000797341,0.000035418307,0.000007515926,0.00023156636,0.9965013,0.0002178151,0.00014558963,0.0013892818,0.00024617795],"about_ca_topic_score_codex":0.000027513592,"about_ca_topic_score_gemma":0.000019948118,"teacher_disagreement_score":0.5642146,"about_ca_system_score_codex":0.00014279502,"about_ca_system_score_gemma":0.000026037917,"threshold_uncertainty_score":0.6733452},"labels":[],"label_agreement":null},{"id":"W2029570945","doi":"10.1007/s11750-011-0188-6","title":"A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"National University of Defense Technology","keywords":"Heuristics; Vehicle routing problem; Heuristic; Variable neighborhood search; Mathematical optimization; Variable (mathematics); Computer science; Routing (electronic design automation); Local search (optimization); Service (business); Mathematics; Metaheuristic","score_opus":0.03343292112571488,"score_gpt":0.24563083175669856,"score_spread":0.21219791063098367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029570945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024346137,0.000088944165,0.97076166,0.00010192575,0.00009451591,0.0006974816,0.000014960807,0.0004993855,0.003394979],"genre_scores_gemma":[0.71080655,0.0000020014159,0.2884996,0.00010754935,0.00007069117,0.00012596091,0.0000096432495,0.00007811574,0.00029989338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989291,0.0000777426,0.00022386486,0.00020079172,0.00015419688,0.00041432644],"domain_scores_gemma":[0.9990478,0.00033385688,0.00004079589,0.0003051755,0.00019692065,0.00007543998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056874426,0.00017543742,0.00018453455,0.00004949019,0.0001926785,0.000054908218,0.00023653982,0.000067343346,0.00018023448],"category_scores_gemma":[0.00007429517,0.00012874676,0.00002838452,0.0004984835,0.00002804006,0.00010222916,0.00003397669,0.00018057716,0.00002333553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005637811,0.000021825163,0.00013130557,0.00010535748,0.00011125372,0.0000013056051,0.0038957626,0.98772204,0.0010034442,0.005588122,0.000104355495,0.0012588571],"study_design_scores_gemma":[0.00081242097,0.000055669967,0.00016982919,0.00004615004,0.00007426618,0.000009070388,0.00025948725,0.996435,0.001307561,0.00058903836,0.000047495665,0.000194031],"about_ca_topic_score_codex":0.00020651789,"about_ca_topic_score_gemma":0.000010835438,"teacher_disagreement_score":0.6864604,"about_ca_system_score_codex":0.00004709245,"about_ca_system_score_gemma":0.000052729,"threshold_uncertainty_score":0.52501404},"labels":[],"label_agreement":null},{"id":"W2030906319","doi":"10.1057/palgrave.jors.2602361","title":"Impact of the pheromone trail on the performance of ACO algorithms for solving the<i>car-sequencing</i>problem","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Algorithm; Ant colony; Artificial intelligence; Purchasing; Machine learning; Mathematical optimization; Mathematics; Engineering; Operations management","score_opus":0.10655571609995261,"score_gpt":0.37194488080600396,"score_spread":0.26538916470605134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030906319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917686,0.00015888359,0.0049428423,0.0023093724,0.00013891493,0.0004188182,0.000021429913,0.0000062789977,0.00023488632],"genre_scores_gemma":[0.9799526,0.00031445906,0.019094119,0.0000744469,0.00024183265,0.000013549908,5.9274805e-7,0.000023829989,0.00028457178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976981,0.00031599574,0.00047742188,0.000081670805,0.0011625766,0.00026421592],"domain_scores_gemma":[0.9970346,0.001410894,0.00019719401,0.00030141723,0.001011283,0.000044615044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056626904,0.0001129656,0.00018704159,0.000026404072,0.00078828644,0.00004199883,0.00083490013,0.00007041546,0.000034192628],"category_scores_gemma":[0.00076453236,0.00004644367,0.0005463371,0.00047309123,0.00033052536,0.00018198484,0.00008728749,0.0008185771,6.7698414e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024149385,0.00003165708,0.0011872547,0.000031737658,0.00018781157,1.4677856e-7,0.0031159115,0.9199002,0.06790375,0.00019615934,0.007022862,0.00039837687],"study_design_scores_gemma":[0.0005912105,0.00028771232,0.018439641,0.00019990923,0.000021297348,0.000056905883,0.0005788743,0.9229761,0.0564428,0.000179862,0.00013515224,0.00009056911],"about_ca_topic_score_codex":0.000017950722,"about_ca_topic_score_gemma":0.000001221047,"teacher_disagreement_score":0.017252387,"about_ca_system_score_codex":0.00035837013,"about_ca_system_score_gemma":0.00065086706,"threshold_uncertainty_score":0.60629416},"labels":[],"label_agreement":null},{"id":"W2031202838","doi":"10.1287/trsc.2013.0493","title":"Cutting-Plane Matheuristic for Service Network Design with Design-Balanced Requirements","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Montréal; Université du Québec à Montréal","keywords":"Solver; Network planning and design; Cutting-plane method; Dimension (graph theory); Variable (mathematics); Computer science; Mathematical optimization; Service (business); Quality of service; Plane (geometry); Distributed computing; Integer programming; Mathematics; Computer network","score_opus":0.04324152256923113,"score_gpt":0.2835365767714388,"score_spread":0.24029505420220765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031202838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013074686,0.000008914593,0.9857731,0.0000418774,0.00015229672,0.00043110148,0.0000047685003,0.00032882887,0.0001844453],"genre_scores_gemma":[0.43923363,0.0000020551786,0.56055814,0.0000918467,0.00003138409,0.000037641905,0.000010061063,0.00001991864,0.000015333677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987517,0.00004548466,0.00025668088,0.0002625229,0.00032270653,0.00036088526],"domain_scores_gemma":[0.9991359,0.0002887511,0.00007699291,0.00019949774,0.00020657937,0.000092268325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017804571,0.00013541064,0.0001449124,0.000067740235,0.00020328822,0.00005813405,0.00026029756,0.00003580981,0.000011439438],"category_scores_gemma":[0.000059576258,0.00012644555,0.000014921443,0.0008807339,0.00006534799,0.00026352555,0.0000014813269,0.000060220616,0.000009850561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027038006,0.0000052251507,0.0005403163,0.00004476449,0.0000048119896,4.236558e-7,0.0003469298,0.99327236,0.0041252077,0.00045208665,0.000047196325,0.0011336311],"study_design_scores_gemma":[0.0005300824,0.0000810754,0.007442018,0.00006138621,0.00002628466,0.0000013445427,0.000018676681,0.9842376,0.0066400804,0.00063406664,0.00012756702,0.00019978314],"about_ca_topic_score_codex":0.0000038771473,"about_ca_topic_score_gemma":0.0000050372864,"teacher_disagreement_score":0.42615893,"about_ca_system_score_codex":0.00003559978,"about_ca_system_score_gemma":0.000056060228,"threshold_uncertainty_score":0.51562995},"labels":[],"label_agreement":null},{"id":"W2031669620","doi":"10.1002/net.21605","title":"A railroad maintenance problem solved with a cut and column generation matheuristic","year":2015,"lang":"en","type":"article","venue":"Networks","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","funders":"","keywords":"Column generation; Integer programming; Arc routing; Computer science; Scheduling (production processes); Mathematical optimization; Routing (electronic design automation); Schedule; Vehicle routing problem; Heuristic; Graph; Operations research; Artificial intelligence; Algorithm; Mathematics; Theoretical computer science","score_opus":0.021355889310019804,"score_gpt":0.2254491847852068,"score_spread":0.204093295475187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031669620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024341771,0.0003069906,0.9720702,0.000045727826,0.00013126554,0.00020686814,0.0000010043757,0.00028988402,0.0026062545],"genre_scores_gemma":[0.7016188,0.000052169416,0.29755908,0.00006568233,0.00023621494,0.000040371815,0.000011329347,0.000047026417,0.00036935642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993942,0.000042232085,0.00013242855,0.00013866033,0.00009303092,0.00019946629],"domain_scores_gemma":[0.9996439,0.000027912522,0.00003076196,0.00013073871,0.00006952323,0.00009712054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029347275,0.00010574085,0.0001216068,0.000024832092,0.000040604336,0.000063793,0.000051152263,0.0000705099,0.0000056611825],"category_scores_gemma":[0.000026368662,0.000096485295,0.00000993572,0.00014821778,0.00002849252,0.00007609993,0.000016492324,0.00012652756,0.0000040777613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008885131,0.0000048745674,0.0005746852,0.000011347892,0.000012544528,0.000003914269,0.00017191166,0.988535,0.00004916084,0.0001869216,0.0045943214,0.005846419],"study_design_scores_gemma":[0.00048286238,0.00003843098,0.000175518,0.00003393426,0.000013277602,0.000022510843,0.000019727024,0.9976063,0.00002824454,0.00008439265,0.0013653287,0.00012949147],"about_ca_topic_score_codex":0.000006753781,"about_ca_topic_score_gemma":0.000035568155,"teacher_disagreement_score":0.677277,"about_ca_system_score_codex":0.00004358446,"about_ca_system_score_gemma":0.000017131182,"threshold_uncertainty_score":0.39345562},"labels":[],"label_agreement":null},{"id":"W2031935785","doi":"10.1007/s00170-012-4708-9","title":"Solving reverse logistics vehicle routing problems with time windows","year":2013,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Simulated annealing; Mathematical optimization; Heuristic; Reverse logistics; Integer programming; Computer science; Routing (electronic design automation); Mathematics; Supply chain","score_opus":0.008513473753236417,"score_gpt":0.22839699537477223,"score_spread":0.21988352162153582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031935785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7545553,0.0001278144,0.2401036,0.0032078302,0.00054676394,0.00024253306,0.0000022403126,0.0004092341,0.0008047],"genre_scores_gemma":[0.8674528,0.000070501046,0.13208866,0.00009450193,0.00012399924,0.000008383644,0.0000010503355,0.000039419523,0.00012066462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988397,0.000027012304,0.0004463664,0.00011641065,0.00031780408,0.00025271648],"domain_scores_gemma":[0.9989539,0.00016690881,0.00031173546,0.00022424874,0.00029963252,0.000043602922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033827682,0.0001639419,0.00021189738,0.0002708528,0.000074646596,0.00007061762,0.0008655276,0.000095051306,0.00009092474],"category_scores_gemma":[0.00019909491,0.00011567761,0.0000504484,0.0001295084,0.000107364154,0.00033461518,0.00012452908,0.0005433133,0.000041763677],"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.000015379048,0.000012510203,0.00016793882,0.000007805673,0.00012421708,0.000021091453,0.0000960297,0.9325021,0.039956268,0.00018139569,0.00019911223,0.026716186],"study_design_scores_gemma":[0.0023546075,0.0002875407,0.0013933706,0.0005854458,0.00007842204,0.0014492226,0.0006603535,0.28964806,0.68271315,0.015361045,0.0048553506,0.00061341445],"about_ca_topic_score_codex":0.0000057198295,"about_ca_topic_score_gemma":0.000001948315,"teacher_disagreement_score":0.64285403,"about_ca_system_score_codex":0.00017730096,"about_ca_system_score_gemma":0.00002482017,"threshold_uncertainty_score":0.47171962},"labels":[],"label_agreement":null},{"id":"W2032353485","doi":"10.1007/s10489-006-0033-z","title":"Dynamic vehicle routing using genetic algorithms","year":2007,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":158,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Brock University","keywords":"Computer science; Vehicle routing problem; Tabu search; Genetic algorithm; Ant colony optimization algorithms; Mathematical optimization; Routing (electronic design automation); Extension (predicate logic); Set (abstract data type); Algorithm; Machine learning; Mathematics","score_opus":0.022784954628706954,"score_gpt":0.291942552189336,"score_spread":0.26915759756062907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032353485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12525137,0.00014982946,0.8692312,0.0000036590866,0.00025574636,0.00015381898,0.0000011860075,0.00049395557,0.0044591967],"genre_scores_gemma":[0.5756977,0.000018581242,0.42414248,0.000032041276,0.000042103366,0.0000030130493,0.0000015116316,0.000044374734,0.000018206201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857515,0.000015969952,0.0004370273,0.00026736342,0.00020240918,0.00050210126],"domain_scores_gemma":[0.999343,0.00014727989,0.000054248507,0.00030252547,0.000043520133,0.00010944789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064402446,0.00019645876,0.00017111731,0.000118243384,0.000112011425,0.0000442981,0.00025428252,0.00011656051,0.00006504044],"category_scores_gemma":[0.00003619845,0.0002285717,0.000043088345,0.00053431536,0.000053347874,0.000063627806,0.00005465208,0.0002404739,0.00010316861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027915885,0.000008031738,0.00020661046,0.000015394542,0.000013298663,0.0000057218954,0.0002635919,0.7842191,0.030179001,0.00055386795,0.0000036905947,0.1845289],"study_design_scores_gemma":[0.000047199337,0.0000067033116,0.0008037859,0.000015653783,0.00001127613,0.000013105005,0.00020792628,0.9296133,0.06851534,0.00041990212,0.000094575604,0.00025122668],"about_ca_topic_score_codex":0.000012869228,"about_ca_topic_score_gemma":0.0000033714732,"teacher_disagreement_score":0.45044634,"about_ca_system_score_codex":0.00016836546,"about_ca_system_score_gemma":0.000015440424,"threshold_uncertainty_score":0.9320884},"labels":[],"label_agreement":null},{"id":"W2033097589","doi":"10.1016/j.orl.2003.08.005","title":"A bilevel programming approach to the travelling salesman problem","year":2003,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"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; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Travelling salesman problem; Bilevel optimization; Mathematical optimization; Extension (predicate logic); Linear programming relaxation; Computer science; Relaxation (psychology); Toll; Linear programming; Dual (grammatical number); Optimization problem; Mathematics","score_opus":0.07996579037548483,"score_gpt":0.3380938230751212,"score_spread":0.25812803269963636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033097589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022708155,0.00004779713,0.96506345,0.0025282225,0.00007550878,0.0012017287,0.0000032908702,0.00020668584,0.008165152],"genre_scores_gemma":[0.27509806,0.000009502074,0.72354686,0.00026257802,0.000086732936,0.00059323,0.000011431823,0.00005359836,0.00033802187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979907,0.0005305676,0.0002318715,0.00025541775,0.0004402128,0.000551217],"domain_scores_gemma":[0.99921215,0.00012824626,0.0000054006537,0.00038584092,0.00013941187,0.00012893073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027956467,0.00012654997,0.00010504157,0.00025038628,0.00064704503,0.00040687967,0.00031122603,0.000049415492,0.000022466205],"category_scores_gemma":[0.00029412378,0.00010044379,0.00003739996,0.0012681514,0.00006995493,0.00014188518,0.000031058757,0.0004934729,0.00009373141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.150098e-7,0.00002286185,0.00003450424,0.000019707297,0.000016503058,9.135455e-7,0.0015218678,0.9792521,0.008152109,0.0031313556,0.0018054709,0.0060417834],"study_design_scores_gemma":[0.00020801158,0.000022896853,0.000087414075,0.000028036427,0.0000060218576,0.000015396065,0.000530001,0.9336976,0.0038793383,0.000020808278,0.061256222,0.00024827317],"about_ca_topic_score_codex":0.000023347107,"about_ca_topic_score_gemma":0.000022658818,"teacher_disagreement_score":0.2523899,"about_ca_system_score_codex":0.00012331661,"about_ca_system_score_gemma":0.000051463652,"threshold_uncertainty_score":0.49766126},"labels":[],"label_agreement":null},{"id":"W2033241398","doi":"10.3138/infor.52.1.20","title":"Planification des tournées dans le domaine de la messagerie rapide","year":2014,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","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":true,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Humanities; Political science; Philosophy","score_opus":0.0370303201759169,"score_gpt":0.3365988316709486,"score_spread":0.2995685114950317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033241398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035894938,0.00090512075,0.9012094,0.0010408886,0.00033478747,0.0005097331,0.0000687821,0.00010222941,0.0599341],"genre_scores_gemma":[0.92699087,0.00076228956,0.06646078,0.00007972059,0.00046830994,0.00017971365,0.00023496595,0.000033935503,0.004789399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966871,0.0011811138,0.0007998924,0.0001342287,0.0007235059,0.00047412977],"domain_scores_gemma":[0.99720854,0.0014387032,0.00010610267,0.00023454911,0.0007828696,0.0002292391],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011416952,0.00018475864,0.00021890945,0.0003873192,0.0010023357,0.0014902501,0.00020238751,0.00029745352,0.00006064014],"category_scores_gemma":[0.0017948189,0.00019368673,0.000040831907,0.00047747837,0.0004722738,0.0027988176,0.00007408459,0.0004606542,0.00013193401],"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.00001777199,0.000015848675,0.0014390887,0.0006294515,0.000037175367,7.6881787e-7,0.0072061736,0.46379292,0.0010089857,0.50498015,0.0027410998,0.018130576],"study_design_scores_gemma":[0.0007084275,0.000060229624,0.010659372,0.00022786218,0.0000071790428,0.000110804,0.003246573,0.7338547,0.0012649063,0.0008994474,0.2487431,0.00021739026],"about_ca_topic_score_codex":0.0014697261,"about_ca_topic_score_gemma":0.000020600688,"teacher_disagreement_score":0.89109594,"about_ca_system_score_codex":0.00037724167,"about_ca_system_score_gemma":0.00037666623,"threshold_uncertainty_score":0.9995463},"labels":[],"label_agreement":null},{"id":"W2033271291","doi":"10.1016/j.cor.2009.08.003","title":"Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"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":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Travelling salesman problem; Pickup; Branch and cut; FIFO (computing and electronics); Mathematical optimization; Computer science; 2-opt; Traveling purchaser problem; Branch and bound; Bottleneck traveling salesman problem; Algorithm; Combinatorial optimization; Mathematics; Integer programming; Artificial intelligence","score_opus":0.05253349140854373,"score_gpt":0.33150602625391756,"score_spread":0.2789725348453738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033271291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13110419,0.00043461836,0.8664597,0.0010773888,0.000039980885,0.0005922666,0.0000028707138,0.00010426942,0.0001846777],"genre_scores_gemma":[0.7338694,0.0001663022,0.2656736,0.000064248256,0.000085132015,0.000038485552,0.000005855192,0.000018656983,0.0000783225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991117,0.00009172402,0.00015273222,0.00019604675,0.00017119406,0.0002765809],"domain_scores_gemma":[0.9990796,0.0004888178,0.0000062002287,0.0001735702,0.00017974994,0.00007209975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008424767,0.000100987956,0.00010969138,0.00011134149,0.0006511332,0.00033729326,0.00014568008,0.000045233377,0.000003328749],"category_scores_gemma":[0.000041975793,0.00007725584,0.000016647293,0.00028589368,0.00008146104,0.0001666548,0.000035761026,0.00024667376,0.0000018666315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009273736,0.000008633178,0.000097987766,0.00003235048,0.00002587793,9.67104e-7,0.0012552235,0.91877586,0.0020180228,0.0013332523,0.00030788739,0.07613466],"study_design_scores_gemma":[0.00037448024,0.00011640843,0.0011536939,0.00006195624,0.00000830968,0.000015654416,0.000099024764,0.9967667,0.00080695335,0.00008480732,0.00040721055,0.0001048382],"about_ca_topic_score_codex":0.000014251136,"about_ca_topic_score_gemma":0.00003597131,"teacher_disagreement_score":0.6027652,"about_ca_system_score_codex":0.00004203065,"about_ca_system_score_gemma":0.000038626702,"threshold_uncertainty_score":0.5008056},"labels":[],"label_agreement":null},{"id":"W2033855616","doi":"10.1016/j.trb.2009.06.003","title":"Bidline scheduling with equity by heuristic dynamic constraint aggregation","year":2009,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Heuristics; Rounding; Mathematical optimization; Heuristic; Computer science; Scheduling (production processes); Computation; Constraint (computer-aided design); Equity (law); Operations research; Mathematics; Algorithm","score_opus":0.23513138431625571,"score_gpt":0.46314257263806313,"score_spread":0.22801118832180742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033855616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2482769,0.00018906385,0.7495286,0.00046576117,0.000059849885,0.00035387595,0.000037464037,0.00048700062,0.00060150464],"genre_scores_gemma":[0.5990738,0.00013458334,0.40043217,0.000052783562,0.00003370039,0.000028792732,0.00017409216,0.000020189336,0.00004988625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650335,0.0012140259,0.0005086172,0.000407611,0.00075121684,0.00061517314],"domain_scores_gemma":[0.99765444,0.0015037549,0.000060657854,0.00025492933,0.00029534008,0.00023090233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059752637,0.00021653097,0.00034311868,0.00018301886,0.0001935084,0.000070983144,0.00022911919,0.00020917402,0.00024822645],"category_scores_gemma":[0.00081313524,0.00018345714,0.0000613686,0.0008094598,0.00024659705,0.00015812009,0.00000585241,0.0007816625,0.000022138469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002552896,0.00017469861,0.0016719328,0.00013484599,0.00006740999,0.00007953946,0.00042750323,0.8203339,0.054704983,0.0046955394,0.0005835966,0.11687076],"study_design_scores_gemma":[0.0023873826,0.001417187,0.052309383,0.00032085704,0.00009482516,0.000024273311,0.0005943078,0.8929426,0.035471,0.010791232,0.0024817546,0.0011651735],"about_ca_topic_score_codex":0.0000071551963,"about_ca_topic_score_gemma":0.000015192044,"teacher_disagreement_score":0.3507969,"about_ca_system_score_codex":0.000109394525,"about_ca_system_score_gemma":0.000055360313,"threshold_uncertainty_score":0.7481165},"labels":[],"label_agreement":null},{"id":"W2034256646","doi":"10.1016/s0305-0548(03)00073-x","title":"Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"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; Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); Mathematics; Decomposition; Heuristic; Combinatorics; Variable (mathematics); Decomposition method (queueing theory); Variable neighborhood search; Mathematical optimization; Tree (set theory); Graph; Enhanced Data Rates for GSM Evolution; Tree decomposition; Algorithm; Discrete mathematics; Computer science; Metaheuristic; Line graph; Pathwidth","score_opus":0.06097546952554979,"score_gpt":0.36983999250299276,"score_spread":0.308864522977443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034256646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024208638,0.0002657537,0.98735034,0.00059446803,0.00031908375,0.00133513,0.00001599993,0.00021965263,0.007478725],"genre_scores_gemma":[0.3331564,0.000045794735,0.66577905,0.00004509763,0.0001804817,0.00037776268,0.00005532909,0.0000535769,0.0003065162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974909,0.0008443543,0.0003254122,0.00031994117,0.00043854257,0.00058086036],"domain_scores_gemma":[0.9973944,0.0011877784,0.000009150716,0.0005392174,0.0007412632,0.00012820358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038169047,0.00015963403,0.0001827545,0.00022114052,0.0011281352,0.00046684983,0.00041748505,0.00010579025,0.0000798234],"category_scores_gemma":[0.00012348949,0.00013499276,0.000075928016,0.0011702866,0.00010072305,0.00024331253,0.00007588569,0.00048232422,0.000037254056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008070286,0.000053178046,0.00014849071,0.00005383137,0.00008033384,7.6653805e-7,0.00033409087,0.9033836,0.0021079765,0.07962171,0.0032588737,0.010949068],"study_design_scores_gemma":[0.0005101582,0.00006133725,0.00024874572,0.0000265914,0.000014070615,0.000009462725,0.00008566417,0.98759353,0.004963242,0.0008226388,0.005508711,0.00015586773],"about_ca_topic_score_codex":0.000031242493,"about_ca_topic_score_gemma":0.000012618087,"teacher_disagreement_score":0.33073556,"about_ca_system_score_codex":0.00023369846,"about_ca_system_score_gemma":0.00018663447,"threshold_uncertainty_score":0.8676818},"labels":[],"label_agreement":null},{"id":"W2035201919","doi":"10.1057/palgrave.jors.2602603","title":"The capacitated team orienteering and profitable tour problems","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":162,"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; Polytechnique Montréal","funders":"","keywords":"Orienteering; Computer science; Operations research; Heuristic; Heuristics; Project management; Matching (statistics); The Internet; Purchasing; Operations management; Mathematical optimization; Engineering; Artificial intelligence; Mathematics; World Wide Web","score_opus":0.062302060283768806,"score_gpt":0.32529913499987456,"score_spread":0.2629970747161058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035201919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9723146,0.0018569047,0.017684205,0.0044474904,0.00059951394,0.0005530091,0.00000628508,0.0000462991,0.0024916779],"genre_scores_gemma":[0.9550995,0.0015527079,0.03961578,0.000063978194,0.0003420296,0.00001684815,8.0470994e-7,0.00003186789,0.0032764634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844086,0.00020675897,0.00027922713,0.00006700813,0.0007610376,0.00024511482],"domain_scores_gemma":[0.9986048,0.00042785774,0.00004798614,0.000125791,0.0007195813,0.00007403239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035634984,0.00007088262,0.000094715666,0.000025203793,0.0011518237,0.00012510167,0.00026935452,0.00004806614,0.000012398096],"category_scores_gemma":[0.0007592113,0.000039034847,0.000084269646,0.0003502338,0.0002014808,0.00024619713,0.0000773345,0.0006801106,0.00000204796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014881643,0.00003239627,0.00608154,0.000049980998,0.0001838088,0.0000023791154,0.0055734734,0.86359817,0.0251414,0.0011433691,0.097486645,0.0006919382],"study_design_scores_gemma":[0.0008965866,0.00010604869,0.012440088,0.00014005041,0.000012239953,0.00045263334,0.001699703,0.93405586,0.008417182,0.00076269766,0.040826254,0.00019065203],"about_ca_topic_score_codex":0.0000053871586,"about_ca_topic_score_gemma":0.0000022616027,"teacher_disagreement_score":0.070457675,"about_ca_system_score_codex":0.00013343318,"about_ca_system_score_gemma":0.00019254195,"threshold_uncertainty_score":0.8859013},"labels":[],"label_agreement":null},{"id":"W2035888716","doi":"10.1007/s13675-013-0012-1","title":"Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem","year":2013,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Vehicle Routing Optimization Methods","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":"Kronos (Canada); Group for Research in Decision Analysis; Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Depot; Mathematical optimization; Scheduling (production processes); Multi-commodity flow problem; Computer science; Flow network; Column generation; Set (abstract data type); Mathematics; Operations research","score_opus":0.03596227856412682,"score_gpt":0.2892528394277084,"score_spread":0.2532905608635816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035888716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056517575,0.00018829637,0.9412881,0.0008707733,0.00028934097,0.00049378426,0.000011003482,0.00016858689,0.0001725527],"genre_scores_gemma":[0.44658616,0.00004405027,0.5527569,0.00025611385,0.00020585395,0.00003704308,0.00003104835,0.00005123164,0.00003159959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846506,0.0001874301,0.00057066727,0.00018869515,0.00032065558,0.0002674771],"domain_scores_gemma":[0.99731404,0.0018554797,0.00020843236,0.00010419877,0.0004082909,0.000109546796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074998266,0.00020644312,0.00018836457,0.00013888256,0.00059459877,0.00048411358,0.0001491425,0.0000694719,0.000049405488],"category_scores_gemma":[0.0004570101,0.00017493799,0.00006891959,0.00024414208,0.00003857182,0.0005059649,0.000031986834,0.00029175906,0.000011360988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013273493,0.000015427808,0.00043479484,0.000032112326,0.00004589224,7.633175e-7,0.0004667925,0.9946454,0.000091525486,0.0005224018,0.00028719506,0.003444383],"study_design_scores_gemma":[0.00084683584,0.000071723334,0.0009926172,0.000058442078,0.000021419735,0.000042204378,0.00017600282,0.9960214,0.000116221236,0.0012845017,0.00016904643,0.0001996029],"about_ca_topic_score_codex":0.000004180284,"about_ca_topic_score_gemma":5.8950945e-7,"teacher_disagreement_score":0.3900686,"about_ca_system_score_codex":0.00007282359,"about_ca_system_score_gemma":0.00003968032,"threshold_uncertainty_score":0.7133764},"labels":[],"label_agreement":null},{"id":"W2035903817","doi":"10.1016/j.cor.2010.10.019","title":"Online vehicle routing and scheduling with dynamic travel times","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"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":"Computer science; Vehicle routing problem; Scheduling (production processes); Operations research; Adaptive routing; Routing (electronic design automation); Dynamic priority scheduling; Distributed computing; Mathematical optimization; Static routing; Computer network; Routing protocol; Engineering; Mathematics","score_opus":0.02958572442583442,"score_gpt":0.343052482940414,"score_spread":0.3134667585145796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035903817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5848092,0.000045359142,0.41414285,0.00032439802,0.00009632542,0.00016310181,0.0000048563506,0.00014783471,0.00026609164],"genre_scores_gemma":[0.60758525,0.000014973643,0.3921708,0.000015501799,0.000060202612,0.000008792333,0.000017276529,0.000028699249,0.00009853388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988363,0.00011580633,0.00018960302,0.0002452661,0.00026339956,0.0003496578],"domain_scores_gemma":[0.99914026,0.00021911877,0.000007195791,0.00027554357,0.00023028032,0.00012760214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007995171,0.0001230016,0.0001363885,0.00022822309,0.00042682403,0.00028278612,0.00019902125,0.00008110973,0.000032409458],"category_scores_gemma":[0.00011442463,0.00011617974,0.000016696831,0.00050996116,0.00015048326,0.00021260968,0.00009017524,0.00079947995,0.000014070037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032541234,0.00003501278,0.0004111649,0.000020698035,0.000022294913,0.0000045898187,0.00058452634,0.9448624,0.035053078,0.0010535573,0.00002990808,0.01791949],"study_design_scores_gemma":[0.0003115252,0.000037227113,0.003919073,0.0000348451,0.00000391682,0.000019977402,0.00020272087,0.99387264,0.0013889251,0.000017620987,0.00005318017,0.00013832824],"about_ca_topic_score_codex":0.000029915233,"about_ca_topic_score_gemma":0.00018188075,"teacher_disagreement_score":0.049010236,"about_ca_system_score_codex":0.000041428,"about_ca_system_score_gemma":0.000066620814,"threshold_uncertainty_score":0.47376725},"labels":[],"label_agreement":null},{"id":"W2037219660","doi":"10.1016/j.cor.2014.03.027","title":"Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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; Polytechnique Montréal","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; China Scholarship Council","keywords":"Computer science; Heuristic; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Markov chain; Markov decision process; Embedding; Process (computing); Operations research; Sequence (biology); Markov process; Computer network; Mathematics; Artificial intelligence; Machine learning","score_opus":0.0653815366770034,"score_gpt":0.3409312984287469,"score_spread":0.2755497617517435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037219660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058608847,0.000059866103,0.99139124,0.0005903327,0.00009941725,0.001279395,0.0000060907983,0.0002735772,0.00043917872],"genre_scores_gemma":[0.7936772,0.000008767624,0.2054552,0.000041651336,0.00017066592,0.00034511325,0.000040894043,0.00005550514,0.00020498763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981204,0.00043436515,0.0003068683,0.00030914138,0.00035902695,0.00047019293],"domain_scores_gemma":[0.9973689,0.0013012465,0.00001896517,0.00038018826,0.00083286554,0.00009784243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021104484,0.00017596423,0.0001819084,0.00016071169,0.0011956096,0.00051909627,0.00034254394,0.00007977157,0.00001635076],"category_scores_gemma":[0.0002875235,0.00012992368,0.000035664347,0.00082850707,0.00014010891,0.00026845248,0.000066768334,0.00035958338,0.0000118044745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015259868,0.000018971414,0.00002195831,0.00002317563,0.000045161752,2.866276e-7,0.0007176484,0.98274213,0.00029957827,0.004305288,0.0005488253,0.0112616895],"study_design_scores_gemma":[0.0006638298,0.00023687753,0.00013065248,0.000058479323,0.000014452737,0.0000043928317,0.00024088963,0.9978776,0.00039512248,0.000044664113,0.00016227308,0.00017079423],"about_ca_topic_score_codex":0.000025606683,"about_ca_topic_score_gemma":0.00007771277,"teacher_disagreement_score":0.78781635,"about_ca_system_score_codex":0.000120204226,"about_ca_system_score_gemma":0.000119512784,"threshold_uncertainty_score":0.9195783},"labels":[],"label_agreement":null},{"id":"W2037425183","doi":"10.1057/palgrave.jors.2602356","title":"VLSN search algorithms for partitioning problems using matching neighbourhoods","year":2007,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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":"Simon Fraser University; University of New Brunswick","funders":"","keywords":"Neighbourhood (mathematics); Matching (statistics); Computer science; Exponential function; Algorithm; Mathematical optimization; Class (philosophy); Theoretical computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.14358398482718118,"score_gpt":0.4266171361414274,"score_spread":0.2830331513142462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037425183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1583024,0.00018892846,0.83986884,0.00072336284,0.00034226984,0.00029438824,0.0000072362072,0.000020453763,0.00025209042],"genre_scores_gemma":[0.47565934,0.000055473552,0.5230635,0.000082699255,0.00089885795,0.0000055546234,0.000002566268,0.000040729614,0.00019129428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759054,0.00020870096,0.0005173794,0.000107943866,0.0011094043,0.000466018],"domain_scores_gemma":[0.9975907,0.0008447451,0.00007727778,0.00014289438,0.001214922,0.00012944723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014032365,0.00010236865,0.00015700643,0.0000896353,0.00080148433,0.0002262546,0.00035686782,0.0000993955,0.00004112665],"category_scores_gemma":[0.00045463038,0.0000771936,0.0002555991,0.00052618945,0.00009540274,0.00038133172,0.00008280661,0.00083227805,0.000001680559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009310842,0.00002356679,0.00049483014,0.000053733344,0.00008058356,8.0772907e-7,0.0014134446,0.9587601,0.03588764,0.00085038634,0.0009772652,0.0014483689],"study_design_scores_gemma":[0.00050979306,0.000048288177,0.0015587976,0.00014524425,0.000012371138,0.000056413035,0.00089627976,0.9828359,0.011295439,0.0015334514,0.0009971712,0.000110865636],"about_ca_topic_score_codex":0.000010437275,"about_ca_topic_score_gemma":0.0000025421625,"teacher_disagreement_score":0.31735694,"about_ca_system_score_codex":0.000490548,"about_ca_system_score_gemma":0.00029620665,"threshold_uncertainty_score":0.616445},"labels":[],"label_agreement":null},{"id":"W2038039225","doi":"10.1002/net.20383","title":"Modeling and solving a multimodal transportation problem with flexible‐time and scheduled services","year":2010,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":91,"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; Heuristics; Computer science; Flow network; Mathematical optimization; Integer programming; Digraph; Cutting-plane method; Mathematics; Algorithm","score_opus":0.00464616798209775,"score_gpt":0.20868945803766262,"score_spread":0.20404329005556487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038039225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.582849,0.000112407375,0.41650164,0.000012786758,0.000034909728,0.00010627383,0.0000010762561,0.0002548183,0.00012705543],"genre_scores_gemma":[0.6650079,0.000024576544,0.33483785,0.000013859198,0.000058997368,0.00000774284,0.000011845206,0.000028751952,0.000008455158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994122,0.000014359018,0.00014669573,0.00016679685,0.00007486007,0.0001851256],"domain_scores_gemma":[0.9997367,0.000033745095,0.000021662026,0.000095518386,0.000039773782,0.00007259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019786607,0.00012737821,0.0001295051,0.00004301636,0.000082302744,0.000070475944,0.00004625709,0.0001220696,0.000011544407],"category_scores_gemma":[0.000002421294,0.00012030536,0.000010429605,0.00011487287,0.000020301428,0.0002010221,0.0000061826195,0.00027415823,7.581636e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010116384,0.0000034553493,0.0025253966,0.000056586483,0.000015223476,8.245321e-7,0.00042158784,0.9883713,0.0018832147,0.000046510366,7.4184726e-7,0.006665011],"study_design_scores_gemma":[0.00039815504,0.000012498796,0.0014564261,0.00006756106,0.000022720133,0.0000052483642,0.000027695236,0.9977143,0.00010253749,0.00003558272,0.000008161482,0.00014911589],"about_ca_topic_score_codex":0.000028928984,"about_ca_topic_score_gemma":0.00011472727,"teacher_disagreement_score":0.08215888,"about_ca_system_score_codex":0.0000052890305,"about_ca_system_score_gemma":0.0000056744766,"threshold_uncertainty_score":0.49059102},"labels":[],"label_agreement":null},{"id":"W2038160064","doi":"10.1109/ieom.2015.7093720","title":"Forest vehicle routing problem solved by New Insertion and meta-heuristics","year":2015,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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 en Abitibi-Témiscamingue; École de Technologie Supérieure","funders":"","keywords":"Tabu search; Vehicle routing problem; Heuristics; Mathematical optimization; Computer science; Routing (electronic design automation); Mathematics; Computer network","score_opus":0.04826331529118205,"score_gpt":0.2606783955150902,"score_spread":0.21241508022390815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038160064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0475349,0.0004362004,0.9432351,0.00033081244,0.0000996195,0.00020273475,0.0000039012075,0.0008099043,0.007346802],"genre_scores_gemma":[0.62184227,0.000015348813,0.3764474,0.00009684241,0.00004993173,0.000008061175,0.000011644205,0.000045147804,0.0014833376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921703,0.000044080018,0.00023727817,0.00015009695,0.00014101228,0.00021048186],"domain_scores_gemma":[0.99950844,0.00005947772,0.00003408959,0.00013977672,0.000058506514,0.00019971751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004131359,0.00014048688,0.00020072566,0.00003778641,0.000042645504,0.00007427148,0.00007352775,0.00007726316,0.000029207165],"category_scores_gemma":[0.000141916,0.00012736,0.000030367179,0.000153327,0.000015138339,0.0001675689,0.000037814338,0.0001123534,0.000014939761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015475565,0.000036870715,0.010328357,0.00008083357,0.00050923764,0.0000030402675,0.0010752372,0.90846795,0.007857139,0.0027550075,0.058883328,0.009987515],"study_design_scores_gemma":[0.00046547555,0.000031570755,0.0003911431,0.000003904552,0.00029627857,0.0000043063746,0.0000712223,0.99051076,0.003770984,0.0010070499,0.0032216636,0.00022562161],"about_ca_topic_score_codex":0.000098640696,"about_ca_topic_score_gemma":0.000025946809,"teacher_disagreement_score":0.5743074,"about_ca_system_score_codex":0.000042778804,"about_ca_system_score_gemma":0.000024025974,"threshold_uncertainty_score":0.519359},"labels":[],"label_agreement":null},{"id":"W2039059059","doi":"10.1016/j.ejor.2011.02.009","title":"Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"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; Column generation; Computer science; Crew scheduling; Schedule; Scheduling (production processes); Set cover problem; Constraint (computer-aided design); Mathematical optimization; Sequence (biology); Set (abstract data type); Constraint programming; Computational complexity theory; Operations research; Algorithm; Mathematics; Engineering","score_opus":0.15304093307016245,"score_gpt":0.3942011772132707,"score_spread":0.24116024414310824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039059059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037982482,0.0001266548,0.9514358,0.00010353854,0.00022440084,0.000594244,0.000007320455,0.000057059326,0.009468515],"genre_scores_gemma":[0.38993764,0.000023369836,0.6097329,0.000024289375,0.00015353145,0.000006681632,0.0000058875917,0.00005482185,0.000060838527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534535,0.0025058158,0.0008571148,0.00017687211,0.0007768623,0.00033797513],"domain_scores_gemma":[0.9973188,0.00032099738,0.00013914492,0.00019120777,0.0018100484,0.00021978904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010969925,0.00017303503,0.00023628164,0.0006345825,0.00020594042,0.00015570603,0.0003885786,0.000051433362,0.00064359704],"category_scores_gemma":[0.0016651409,0.00015305026,0.00009618116,0.00078428246,0.00012936845,0.00041472583,0.000068238616,0.0010163999,0.00004198888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108248256,0.00009140778,0.00025663,0.000042709882,0.00014248658,0.00019684489,0.0010794948,0.8913208,0.04607142,0.0018695329,0.00014597506,0.05867441],"study_design_scores_gemma":[0.0008123581,0.00018732087,0.0012983646,0.00017741077,0.000014947743,0.00034531986,0.0003009227,0.99094987,0.0048367106,0.00016383604,0.00074573146,0.00016719627],"about_ca_topic_score_codex":0.000006397297,"about_ca_topic_score_gemma":0.0000011210831,"teacher_disagreement_score":0.35195515,"about_ca_system_score_codex":0.0002435854,"about_ca_system_score_gemma":0.0003742358,"threshold_uncertainty_score":0.7046936},"labels":[],"label_agreement":null},{"id":"W2039568841","doi":"10.1007/s10479-005-3971-7","title":"Metaheuristics in Combinatorial Optimization","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2341,"is_retracted":false,"has_abstract":false,"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":"Metaheuristic; Theory of computation; Combinatorial optimization; Vehicle routing problem; Computer science; Scheduling (production processes); Mathematical optimization; Operations research; Job shop scheduling; Parallel metaheuristic; Optimization problem; Management science; Routing (electronic design automation); Mathematics; Artificial intelligence; Algorithm; Engineering; Meta-optimization","score_opus":0.1739552011743806,"score_gpt":0.4498479164768863,"score_spread":0.2758927153025057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039568841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20500639,0.0011639396,0.7450065,0.0046150605,0.0006410421,0.0011232779,0.000043844535,0.00033617995,0.042063773],"genre_scores_gemma":[0.8192676,0.0003657105,0.18004031,0.000019952997,0.00011095738,0.00002476209,0.000018038127,0.000021691101,0.00013100622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998749,0.00024837576,0.00032357968,0.0001098283,0.00032983866,0.0002393589],"domain_scores_gemma":[0.99901825,0.00015846087,0.000007775972,0.00020810367,0.0005536016,0.000053828135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018060205,0.00006721008,0.00012959944,0.00040750453,0.000078606856,0.00005094167,0.00016065277,0.00007223764,0.00012789667],"category_scores_gemma":[0.00074250123,0.00007442567,0.000024676687,0.0008637326,0.000053927826,0.00022945621,0.00003386732,0.00024517748,0.00002360497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037957236,0.000050952905,0.000113121874,0.000012176415,0.000008325391,5.83909e-7,0.00019896385,0.989912,0.0003328483,0.0061376686,0.00070504297,0.002524525],"study_design_scores_gemma":[0.00020822101,0.000024609239,0.00020935366,0.000012899494,0.0000012362542,5.801477e-7,0.00003546771,0.9876408,0.01052601,0.000093386705,0.0011803018,0.00006712203],"about_ca_topic_score_codex":0.000028992255,"about_ca_topic_score_gemma":0.000025647323,"teacher_disagreement_score":0.6142612,"about_ca_system_score_codex":0.00003257729,"about_ca_system_score_gemma":0.000053824075,"threshold_uncertainty_score":0.30349907},"labels":[],"label_agreement":null},{"id":"W2039638040","doi":"10.1016/j.cor.2014.07.001","title":"Heuristics for dynamic and stochastic inventory-routing","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Mathematical optimization; Heuristic; Time horizon; Vendor; Routing (electronic design automation); Context (archaeology); Operations research; Inventory control; Inventory management; Stochastic programming; Dynamic programming; Operations management; Algorithm; Mathematics; Artificial intelligence; Economics","score_opus":0.050700185426448344,"score_gpt":0.36830883582356255,"score_spread":0.3176086503971142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039638040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032741405,0.000069461894,0.96611094,0.00017387242,0.00023807732,0.0003435745,0.0000051393413,0.00016407864,0.0001534587],"genre_scores_gemma":[0.7419662,0.000008726573,0.2576967,0.000023116161,0.00009796492,0.000047513186,0.000018913119,0.000032283075,0.00010858143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893653,0.00017988903,0.00019350591,0.00019564324,0.0001821891,0.0003122539],"domain_scores_gemma":[0.9988736,0.0005659543,0.000006509649,0.00021536731,0.00023440033,0.000104195155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013299352,0.000095121344,0.00012316997,0.0001986948,0.00039927257,0.000210691,0.00016082889,0.000057453504,0.000005282601],"category_scores_gemma":[0.00065267977,0.00010521355,0.000021969972,0.00026098697,0.000080870974,0.00008790102,0.000082953484,0.00022446254,0.000010449454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016205121,0.000007641441,0.00003144834,0.00003918941,0.00001059746,1.9803028e-7,0.00030933876,0.9813403,0.00044524964,0.0037278996,0.00039537647,0.013691128],"study_design_scores_gemma":[0.0002694242,0.000044876408,0.00014473688,0.00003189762,0.000004214879,0.0000032946716,0.000041013347,0.99866736,0.000052469662,0.00020961635,0.0004248603,0.000106214095],"about_ca_topic_score_codex":0.0000064904943,"about_ca_topic_score_gemma":0.000014752181,"teacher_disagreement_score":0.7092248,"about_ca_system_score_codex":0.0000846489,"about_ca_system_score_gemma":0.000029758326,"threshold_uncertainty_score":0.4290484},"labels":[],"label_agreement":null},{"id":"W2040075495","doi":"10.1016/j.ejor.2013.08.002","title":"The bi-objective Pollution-Routing Problem","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":442,"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":"University of Southampton","keywords":"Weighting; Mathematical optimization; Computer science; Normalization (sociology); Vehicle routing problem; Set (abstract data type); Routing (electronic design automation); Minification; Constraint (computer-aided design); Extension (predicate logic); Mathematics","score_opus":0.05395561392824383,"score_gpt":0.3389584209137308,"score_spread":0.28500280698548697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040075495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3036712,0.0022062089,0.3461417,0.015259035,0.0014723833,0.0014764286,0.000010816222,0.00023945808,0.32952276],"genre_scores_gemma":[0.9555721,0.00010779996,0.04275326,0.000046366575,0.00051184144,0.000004924719,0.0000011003401,0.000041326435,0.00096124853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683136,0.0015064236,0.00049275643,0.00008983911,0.0007661122,0.0003134969],"domain_scores_gemma":[0.99757236,0.0005902085,0.00006715637,0.0001386328,0.0015079952,0.00012366078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008382143,0.00008873171,0.00009838456,0.00017006084,0.00060114375,0.0004516336,0.00039356863,0.000018500039,0.00016855437],"category_scores_gemma":[0.0012870118,0.000060470033,0.000055910237,0.0004279917,0.00011139398,0.00038004096,0.00007039839,0.0007000036,0.00029550013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027860826,0.00004409257,0.0006712497,0.000019615969,0.00016527053,0.000041053412,0.0018188871,0.85236216,0.025773298,0.01098735,0.04111831,0.06697085],"study_design_scores_gemma":[0.002657887,0.0009014104,0.13043207,0.00043934435,0.000025807576,0.0006667879,0.0038593072,0.76901495,0.011142984,0.0030065116,0.07705238,0.0008005665],"about_ca_topic_score_codex":0.000004609836,"about_ca_topic_score_gemma":7.9786105e-7,"teacher_disagreement_score":0.6519009,"about_ca_system_score_codex":0.00013792448,"about_ca_system_score_gemma":0.00013185908,"threshold_uncertainty_score":0.46235725},"labels":[],"label_agreement":null},{"id":"W2041088973","doi":"10.1016/j.cor.2014.06.007","title":"A decomposition-based heuristic for the multiple-product inventory-routing problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":false,"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":"Heuristic; Vendor; Computer science; Vehicle routing problem; Operations research; Routing (electronic design automation); Integer programming; Decomposition; Time horizon; Mathematical optimization; Product (mathematics); Linear programming; Mathematics; Algorithm; Business; Artificial intelligence; Marketing","score_opus":0.06450626381469744,"score_gpt":0.37307536225457844,"score_spread":0.308569098439881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041088973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009215952,0.00009573189,0.9875649,0.0012197089,0.00033127493,0.001056286,0.000006915332,0.00028445764,0.00022477949],"genre_scores_gemma":[0.667274,0.0000044528206,0.33194774,0.000076370634,0.00028336258,0.00028252896,0.00003606312,0.000039859784,0.000055616365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981829,0.00046149228,0.0003044914,0.00029300002,0.0003216067,0.00043649523],"domain_scores_gemma":[0.9965743,0.0023418404,0.000013911082,0.00049023057,0.00048400188,0.000095714444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027440258,0.00013895474,0.00014426178,0.00020465233,0.0010327655,0.0003577368,0.00043015202,0.000049416383,0.000014689027],"category_scores_gemma":[0.00093247247,0.00011933444,0.00006513168,0.0005470371,0.000107858374,0.0001085326,0.00006905111,0.0003405092,0.000029207804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053674044,0.000023565239,0.00025459036,0.00005432309,0.000021410671,2.617626e-7,0.00028200977,0.9834431,0.0011973834,0.0013738207,0.0017929343,0.011551231],"study_design_scores_gemma":[0.0004755252,0.000045975572,0.00031687302,0.00004963322,0.000008279071,0.0000019591564,0.00003396109,0.99506676,0.0013498109,0.0000655215,0.0024495746,0.0001361344],"about_ca_topic_score_codex":0.000038982347,"about_ca_topic_score_gemma":0.000044569493,"teacher_disagreement_score":0.65805805,"about_ca_system_score_codex":0.0001388028,"about_ca_system_score_gemma":0.00008407062,"threshold_uncertainty_score":0.7943301},"labels":[],"label_agreement":null},{"id":"W2041183433","doi":"10.1287/opre.48.1.129.12455","title":"A Tabu Search Heuristic for the Capacitated arc Routing Problem","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":278,"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; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Routing (electronic design automation); Computer science; Heuristic; Arc (geometry); Vehicle routing problem; Guided Local Search; Operations research; Mathematics; Computer network","score_opus":0.09081247834877422,"score_gpt":0.38017269494339595,"score_spread":0.28936021659462174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041183433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17461358,0.0005036002,0.78360546,0.0033695903,0.00018284042,0.004075391,0.00010051074,0.0007646176,0.03278438],"genre_scores_gemma":[0.8628458,0.00015202504,0.12674232,0.000029872894,0.00018711406,0.0006285801,0.00003909149,0.00007428656,0.009300929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981822,0.00033758994,0.0002649246,0.00021801952,0.00042109942,0.00057616294],"domain_scores_gemma":[0.99811333,0.00096807437,0.0000039505635,0.00037871944,0.0004454508,0.00009046114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030296147,0.00011151667,0.000114192124,0.0001462669,0.0011260549,0.0003552973,0.0003313551,0.00007057533,0.0008759877],"category_scores_gemma":[0.00045446065,0.00008892971,0.00004319878,0.00095667416,0.00012341567,0.00014570326,0.00003152834,0.0005158729,0.00020639504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072271373,0.000016439839,0.000031715157,0.000027976788,0.000024878898,9.068692e-7,0.0013877356,0.97107303,0.0018806739,0.0014989581,0.0011928924,0.022857562],"study_design_scores_gemma":[0.00025253074,0.000033319517,0.00015283607,0.00002237306,0.0000057326824,0.0000056230106,0.0003644028,0.99342775,0.0011934448,0.0000698679,0.004365942,0.00010620001],"about_ca_topic_score_codex":0.00017074293,"about_ca_topic_score_gemma":0.00009223954,"teacher_disagreement_score":0.6882322,"about_ca_system_score_codex":0.00012127246,"about_ca_system_score_gemma":0.00011257996,"threshold_uncertainty_score":0.9591451},"labels":[],"label_agreement":null},{"id":"W2041485345","doi":"10.1016/j.orl.2005.01.009","title":"The multiple TSP with time windows: vehicle bounds based on precedence graphs","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Combinatorics; Traveling purchaser problem; Mathematics; Computer science; Similarity (geometry); Mathematical optimization; 2-opt; Routing (electronic design automation); Artificial intelligence","score_opus":0.025797792919006197,"score_gpt":0.3082450610410842,"score_spread":0.282447268122078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041485345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81089646,0.00010429926,0.1385361,0.039702065,0.00015020277,0.0016109704,0.00002975057,0.0007958612,0.008174285],"genre_scores_gemma":[0.9476478,0.000016563157,0.05068595,0.00064416917,0.000110834604,0.0002085554,0.000016987187,0.0000562481,0.0006128723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980717,0.00039778606,0.00018676442,0.00022999286,0.0006229552,0.00049082836],"domain_scores_gemma":[0.9983967,0.0007968874,0.000008530838,0.0005230504,0.00016530082,0.00010956292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013766937,0.00013516344,0.000095743344,0.00019386462,0.0010602142,0.00047449642,0.00035346334,0.00004877028,0.00009443751],"category_scores_gemma":[0.0003743923,0.000099333025,0.00003411314,0.0007578642,0.00021179646,0.00026130624,0.000028478195,0.00049764034,0.00026852702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001952618,0.00002178082,0.0003249563,0.000004384004,0.000013958905,0.000001745787,0.00015805835,0.96562976,0.026682328,0.00008644521,0.004226022,0.0028310071],"study_design_scores_gemma":[0.00041437955,0.000059069618,0.00076930795,0.000028075505,0.0000027996412,0.0000015661957,0.000030595624,0.9840193,0.007808084,0.0000021604585,0.006733983,0.00013072438],"about_ca_topic_score_codex":0.000031187912,"about_ca_topic_score_gemma":0.00016725439,"teacher_disagreement_score":0.13675134,"about_ca_system_score_codex":0.00017916839,"about_ca_system_score_gemma":0.00006583147,"threshold_uncertainty_score":0.81544185},"labels":[],"label_agreement":null},{"id":"W2041825410","doi":"10.1016/j.ejor.2014.02.056","title":"Operational transportation planning of freight forwarding companies in horizontal coalitions","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"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; Computer Research Institute of Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Profitability index; Order (exchange); Computer science; Operational planning; Process (computing); Business; Traffic management; Routing (electronic design automation); Transportation planning; Operations research; Transport engineering; Industrial organization; Marketing; Finance; Computer network; Engineering","score_opus":0.08032545244081116,"score_gpt":0.3588431303229579,"score_spread":0.27851767788214676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041825410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63039565,0.00016255744,0.36030793,0.00023471264,0.00017361616,0.000108604465,0.000022077114,0.000018768786,0.008576079],"genre_scores_gemma":[0.9331874,0.000020777225,0.06643512,0.0000146830525,0.00024301127,0.000001866909,0.000036010137,0.00002814916,0.00003293897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730664,0.0009407747,0.0007383857,0.000099592646,0.0007218745,0.00019270535],"domain_scores_gemma":[0.99864656,0.00046124976,0.00007571908,0.00008912831,0.0006427443,0.000084595886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005463177,0.00009344408,0.00019882688,0.00048032936,0.00013186979,0.00007479126,0.00021838112,0.000026189691,0.000108047694],"category_scores_gemma":[0.00046482327,0.000091349895,0.00006060843,0.00037136694,0.000070954105,0.00039069136,0.000012506635,0.0004585914,0.000008882158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029079452,0.000034530767,0.0059116553,0.00002940078,0.000026778407,0.00001896738,0.0011958296,0.97070456,0.011054067,0.009709166,0.0005229287,0.00076304947],"study_design_scores_gemma":[0.00271486,0.00060199667,0.24676907,0.0006401727,0.000018553983,0.00008343773,0.0012241796,0.73145133,0.0100227,0.00059921265,0.0055237412,0.0003507305],"about_ca_topic_score_codex":0.000004043173,"about_ca_topic_score_gemma":0.00000461003,"teacher_disagreement_score":0.3027918,"about_ca_system_score_codex":0.00008306656,"about_ca_system_score_gemma":0.00009095879,"threshold_uncertainty_score":0.37251407},"labels":[],"label_agreement":null},{"id":"W2043074264","doi":"10.1016/j.trc.2011.08.001","title":"Optimal shipment decisions for an airfreight forwarder: Formulation and solution methods","year":2011,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"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":"Mathematical optimization; Knapsack problem; Lagrangian relaxation; Integer programming; Heuristic; Heuristics; Computer science; Operations research; Set (abstract data type); Flow network; Set cover problem; Linear programming; Covering problems; Mathematics","score_opus":0.21478446497749762,"score_gpt":0.4287674817910912,"score_spread":0.21398301681359358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043074264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12424893,0.00030931015,0.8723007,0.00015613074,0.00010743448,0.00067610596,0.0000220859,0.001963131,0.00021619],"genre_scores_gemma":[0.3860174,0.00047840344,0.61305904,0.000002814442,0.000012971736,0.00030783267,0.0000623506,0.0000340943,0.000025062265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982756,0.00012459552,0.00043599826,0.00034994318,0.0003004702,0.000513442],"domain_scores_gemma":[0.998865,0.00037637964,0.000051371615,0.00035366378,0.00027609072,0.00007747473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288472,0.00017816806,0.00020235426,0.000551966,0.00039888473,0.000041899682,0.00025378523,0.00022797576,0.000024119227],"category_scores_gemma":[0.00040771475,0.00018121746,0.00005577768,0.00046351392,0.00013089445,0.00048675225,0.000018681882,0.00030716392,0.0000026337227],"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.00019601536,0.00016871541,0.004476897,0.00027579896,0.00017035325,0.0000056177296,0.008526108,0.15117288,0.01541748,0.0472963,0.0012626536,0.7710312],"study_design_scores_gemma":[0.0008780783,0.00041035083,0.008256283,0.00010672775,0.000052171268,0.0000015453113,0.0035490096,0.8564933,0.096197896,0.022678245,0.010871005,0.0005054057],"about_ca_topic_score_codex":0.000030413737,"about_ca_topic_score_gemma":0.0000977279,"teacher_disagreement_score":0.77052575,"about_ca_system_score_codex":0.00006489676,"about_ca_system_score_gemma":0.000024306006,"threshold_uncertainty_score":0.73898333},"labels":[],"label_agreement":null},{"id":"W2043131887","doi":"10.1007/s10898-014-0222-y","title":"The robust crew pairing problem: model and solution methodology","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"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":"Crew; Mathematical optimization; Nonlinear system; Mathematics; Pairing; Interval (graph theory); Relaxation (psychology); Engineering","score_opus":0.03915311288015694,"score_gpt":0.27883241837956735,"score_spread":0.2396793054994104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043131887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028529398,0.0003688258,0.99445885,0.0004645526,0.0002575041,0.00007540132,9.866228e-7,0.00006426494,0.0014566673],"genre_scores_gemma":[0.09169588,0.00038032976,0.9077361,0.000044778182,0.00010385504,0.0000015278519,9.764207e-7,0.000016535163,0.000020000265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880826,0.0002962289,0.0004527746,0.000084798754,0.00017240363,0.00018555055],"domain_scores_gemma":[0.99915534,0.00021239088,0.00022300682,0.00010602705,0.00022629318,0.00007694287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021768922,0.00011243438,0.00018786143,0.000040512783,0.00015430173,0.000079831596,0.00013203107,0.00009687433,0.0000030508577],"category_scores_gemma":[0.000498585,0.00008739976,0.00004952214,0.00020926236,0.00004342032,0.0002599466,0.000030603,0.0001543278,6.4116796e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146179,0.0000049324353,0.00029793096,0.0000144500245,0.000023819799,3.2978565e-7,0.000039176874,0.98513263,0.000099957106,0.0022323832,0.000269684,0.011870101],"study_design_scores_gemma":[0.000316113,0.000043303316,0.00025387647,0.000027590499,0.000038226557,0.00007213365,0.000017096892,0.99747896,0.00004297044,0.0014530156,0.00016975543,0.00008694203],"about_ca_topic_score_codex":0.0000021167907,"about_ca_topic_score_gemma":0.0000043914742,"teacher_disagreement_score":0.08884294,"about_ca_system_score_codex":0.00013437241,"about_ca_system_score_gemma":0.000028975446,"threshold_uncertainty_score":0.35640588},"labels":[],"label_agreement":null},{"id":"W2043340090","doi":"10.1007/s10107-006-0011-6","title":"On the domino-parity inequalities for the STSP","year":2006,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"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 Ottawa","funders":"Southern Taiwan Science Park","keywords":"Domino; Travelling salesman problem; Separation (statistics); Polytope; Parity (physics); Mathematics; Mathematical optimization; Inequality; Class (philosophy); Algorithm; Computer science; Artificial intelligence; Combinatorics; Statistics","score_opus":0.036752343997007414,"score_gpt":0.28565320145190704,"score_spread":0.24890085745489962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043340090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01775366,0.00008788382,0.9759695,0.0008620484,0.0001053957,0.0007787341,0.000003257288,0.00041937293,0.0040201796],"genre_scores_gemma":[0.7746847,0.000001580317,0.22407833,0.000112483125,0.00019365276,0.00045132235,0.0000038838434,0.000054495296,0.0004195421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907285,0.00006521193,0.0002903524,0.00010656741,0.0001805946,0.0002844034],"domain_scores_gemma":[0.9957164,0.0038948827,0.0000341684,0.0002944078,0.00003460867,0.000025545032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012508259,0.00013450278,0.00015224527,0.00002237882,0.00022528393,0.00015004005,0.00021624961,0.00005714106,0.00005666761],"category_scores_gemma":[0.00061846443,0.00007268621,0.00008982872,0.00013093122,0.00007975244,0.000038458213,0.000028467766,0.00016906386,0.000026569387],"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.000006956674,0.00006287962,0.00003885059,0.0002281005,0.000036072783,5.444948e-7,0.0004949025,0.0397324,0.00006163512,0.93399477,0.0015873875,0.023755489],"study_design_scores_gemma":[0.0002534964,0.000030410412,0.000045149267,0.000057722147,0.000039953426,0.0000036780639,0.0003533108,0.82814133,0.0012694969,0.16136754,0.008248812,0.00018911103],"about_ca_topic_score_codex":0.0000070983215,"about_ca_topic_score_gemma":0.0000033002586,"teacher_disagreement_score":0.78840894,"about_ca_system_score_codex":0.00003231467,"about_ca_system_score_gemma":0.0000054294137,"threshold_uncertainty_score":0.29640576},"labels":[],"label_agreement":null},{"id":"W2044126714","doi":"10.1007/s10696-012-9169-9","title":"Heuristics for an oil delivery vehicle routing problem","year":2012,"lang":"en","type":"article","venue":"Flexible Services and Manufacturing Journal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"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; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Vehicle routing problem; Computer science; Routing (electronic design automation); Operations research; Computer network; Mathematics","score_opus":0.02221163774678293,"score_gpt":0.2610785118972925,"score_spread":0.23886687415050956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044126714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297426,0.0010561271,0.06669568,0.000046543235,0.0007052405,0.000091595786,0.0000101915075,0.00037511706,0.001276935],"genre_scores_gemma":[0.83933306,0.00032996462,0.15902956,0.00012894909,0.0009440841,0.0000072393996,0.000009127131,0.00006583008,0.00015219662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988328,0.000045856443,0.00031268544,0.00013144656,0.00014354502,0.0005336408],"domain_scores_gemma":[0.9993431,0.000075027936,0.00009562246,0.00013538828,0.000054608274,0.00029626957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071182474,0.00019038237,0.00018704508,0.00009912047,0.00036314334,0.0002470586,0.00016088045,0.00009568662,0.000022587148],"category_scores_gemma":[0.000005999076,0.00018350162,0.00005220006,0.00005113274,0.000013369445,0.0007604967,0.000048725764,0.0002608875,0.000004724779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007152239,0.00010036824,0.0047008116,0.0018766705,0.00018048461,0.0000042975703,0.0045508645,0.6956419,0.004537809,0.00037078452,0.00031422343,0.28765026],"study_design_scores_gemma":[0.0020377592,0.00020111416,0.008279059,0.0004188458,0.00018057338,0.00040935725,0.0015509864,0.88603246,0.065739274,0.0010254036,0.033049732,0.0010754277],"about_ca_topic_score_codex":0.000013764614,"about_ca_topic_score_gemma":0.000005283615,"teacher_disagreement_score":0.28657484,"about_ca_system_score_codex":0.000050019877,"about_ca_system_score_gemma":0.000010856159,"threshold_uncertainty_score":0.74829787},"labels":[],"label_agreement":null},{"id":"W2045466512","doi":"10.1287/trsc.1070.0197","title":"A Theoretical Comparison of Feasibility Cuts for the Integrated Aircraft-Routing and Crew-Pairing Problem","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Routing (electronic design automation); Pairing; Set (abstract data type); Decomposition; Computer science; Benders' decomposition; Mathematical optimization; Crew scheduling; Engineering; Operations research; Aeronautics; Computer network; Mathematics","score_opus":0.048540676101435594,"score_gpt":0.3307044574312802,"score_spread":0.2821637813298446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045466512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5211246,0.00003607673,0.47830102,0.000041810366,0.000036887875,0.00023616804,0.0000060491975,0.000083803396,0.00013361704],"genre_scores_gemma":[0.8673841,0.000008223887,0.13256226,0.000008809061,0.0000065895792,0.00001414116,0.0000030803583,0.000008742806,0.000004097002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990275,0.000024591965,0.00034578535,0.00018608489,0.00023542022,0.00018062643],"domain_scores_gemma":[0.99922353,0.00033821823,0.00005748132,0.00014345754,0.00018528325,0.000052012267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011493906,0.00008661394,0.00014633972,0.000057907426,0.00024932544,0.000018506713,0.00017104621,0.000033190787,0.000013089481],"category_scores_gemma":[0.00016465879,0.0000656791,0.000031217412,0.0005659867,0.0008014246,0.00017612318,0.00000349826,0.000100375095,3.6400527e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043502543,0.000050820363,0.21725515,0.00014859266,0.000015371294,6.7018675e-7,0.017891949,0.6857549,0.030458648,0.040354557,0.000018110177,0.008007709],"study_design_scores_gemma":[0.00023707034,0.000026569642,0.15083069,0.000027099606,0.000013693041,0.0000016932686,0.00044867472,0.83309036,0.014853569,0.00037705345,0.000012365328,0.0000811764],"about_ca_topic_score_codex":0.000009650801,"about_ca_topic_score_gemma":0.000011526214,"teacher_disagreement_score":0.34625947,"about_ca_system_score_codex":0.00002752585,"about_ca_system_score_gemma":0.000059948114,"threshold_uncertainty_score":0.29528823},"labels":[],"label_agreement":null},{"id":"W2045593082","doi":"10.5539/cis.v6n3p28","title":"Vehicle Routing in Multi-Echelon Distribution Systems with Cross-Docking: A Systematic Lexical-Metanarrative Analysis","year":2013,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Vehicle routing problem; Unification; Notation; Heuristic; Metaheuristic; Operations research; Routing (electronic design automation); Artificial intelligence","score_opus":0.01749190093161343,"score_gpt":0.2714827123427632,"score_spread":0.25399081141114976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045593082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2561534,0.000021141626,0.7432276,0.000009790883,0.0000725782,0.00030005263,0.0000025191823,0.00010065035,0.00011226294],"genre_scores_gemma":[0.9807654,0.0000051721713,0.01913709,0.000026543821,0.000008827372,0.00003661518,0.000012786336,0.000003718998,0.0000038549288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987894,0.000058782574,0.0004966677,0.00013494949,0.0002895351,0.00023064406],"domain_scores_gemma":[0.9992476,0.000080419864,0.00012213562,0.00017207956,0.00029191928,0.00008586297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948442,0.0001174506,0.00024544052,0.00033940715,0.0001791141,0.00087510655,0.00017039465,0.00004139583,0.0000030671422],"category_scores_gemma":[0.000096318,0.00009276744,0.000023562332,0.0023396555,0.00011790932,0.0049533476,0.000049994418,0.000104811596,0.000014653203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.42283e-7,0.000004684826,0.0117420945,0.0005180956,0.000019879404,1.9045052e-7,0.0018785625,0.98466873,0.00003858084,0.0005280166,0.0000031112772,0.00059721776],"study_design_scores_gemma":[0.00021163088,0.0000144071155,0.085060015,0.0002276172,0.000014370436,0.0000042132883,0.00029466758,0.9139515,0.000102014725,0.0000020606622,0.000003321746,0.00011413855],"about_ca_topic_score_codex":0.000040903476,"about_ca_topic_score_gemma":0.0000017777608,"teacher_disagreement_score":0.724612,"about_ca_system_score_codex":0.00013228571,"about_ca_system_score_gemma":0.000025593385,"threshold_uncertainty_score":0.8438673},"labels":[],"label_agreement":null},{"id":"W2045902051","doi":"10.5267/j.ijiec.2011.08.015","title":"Modeling a four-layer location-routing problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transshipment (information security); Integer programming; Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Product (mathematics); Layer (electronics); Operations research; Distribution (mathematics); Supply chain; Computer network; Engineering; Mathematics; Business","score_opus":0.09533972141092655,"score_gpt":0.28932847398911915,"score_spread":0.1939887525781926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045902051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050156537,0.00005019675,0.946441,0.00014604979,0.0024286625,0.00009440904,0.000004224138,0.00018713184,0.00049179705],"genre_scores_gemma":[0.7927297,0.000009432767,0.20651044,0.000015201784,0.0006813063,0.0000037485272,0.0000041003477,0.000039285664,0.000006801004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985558,0.000034996203,0.00071650674,0.00010457409,0.0003959602,0.00019216423],"domain_scores_gemma":[0.9986443,0.000125499,0.00015445297,0.000095680036,0.00086830324,0.00011175301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005285617,0.00016675693,0.00020364019,0.0004736443,0.000039846134,0.00007825258,0.00041245334,0.00011864933,0.000035715268],"category_scores_gemma":[0.00038523605,0.00018148737,0.000103471306,0.00037421816,0.000012858824,0.00038788587,0.000037705442,0.0004580816,0.000009101637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010082631,0.000021846296,0.00021406588,0.00000538359,0.00019115467,0.000017604194,0.00077107485,0.9922208,0.00028923134,0.0008735552,0.00009587681,0.005289291],"study_design_scores_gemma":[0.00069236674,0.000028285454,0.00007871183,0.00019989855,0.0000301877,0.00014776026,0.00008467523,0.9976625,0.00056093826,0.0002038101,0.00014327459,0.00016763485],"about_ca_topic_score_codex":0.000013202345,"about_ca_topic_score_gemma":8.1336987e-7,"teacher_disagreement_score":0.74257314,"about_ca_system_score_codex":0.000189947,"about_ca_system_score_gemma":0.00010650223,"threshold_uncertainty_score":0.740084},"labels":[],"label_agreement":null},{"id":"W2046064436","doi":"10.1016/j.cor.2011.09.021","title":"A parallel iterated tabu search heuristic for vehicle routing problems","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":228,"is_retracted":false,"has_abstract":false,"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":"Tabu search; Vehicle routing problem; Mathematical optimization; Heuristics; Guided Local Search; Iterated local search; Heuristic; Incremental heuristic search; Computer science; Mathematics; Algorithm; Routing (electronic design automation); Beam search; Search algorithm","score_opus":0.15695137458492678,"score_gpt":0.3647560928907695,"score_spread":0.2078047183058427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046064436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05789894,0.00011902308,0.93867683,0.000121825266,0.00023295268,0.0011214699,0.000014804645,0.00043873952,0.0013753994],"genre_scores_gemma":[0.6178319,0.000022732114,0.38133317,0.000026370812,0.000114423376,0.00023378723,0.000045445642,0.000063577616,0.00032860303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771225,0.0003910021,0.00040683284,0.00037167073,0.0003763614,0.0007418652],"domain_scores_gemma":[0.9982624,0.00036620445,0.000010694509,0.00042497067,0.0007500992,0.00018564252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020387676,0.00017801722,0.00020933313,0.00036565296,0.0006431495,0.00032583636,0.0004535939,0.00011114052,0.00008561829],"category_scores_gemma":[0.00023433242,0.00018804365,0.000061921004,0.00097542506,0.00010664567,0.00027478777,0.00014196865,0.00048621098,0.000091853544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013398269,0.000062697945,0.00025160448,0.000085377724,0.000042628853,0.000004245191,0.004324763,0.9836853,0.002419654,0.0024878276,0.0010215208,0.0056009972],"study_design_scores_gemma":[0.00057210034,0.00010623437,0.00063633564,0.000064543805,0.0000054958673,0.0000060164,0.00015977703,0.9959787,0.0018143571,0.000095708434,0.00035704672,0.00020366802],"about_ca_topic_score_codex":0.00009551538,"about_ca_topic_score_gemma":0.000026188145,"teacher_disagreement_score":0.55993295,"about_ca_system_score_codex":0.00015135248,"about_ca_system_score_gemma":0.00011074437,"threshold_uncertainty_score":0.7668197},"labels":[],"label_agreement":null},{"id":"W2046280257","doi":"10.1002/nav.20261","title":"What you should know about the vehicle routing problem","year":2007,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":324,"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; Metaheuristic; Computer science; Set (abstract data type); Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Algorithm; Computer network","score_opus":0.15094007849475852,"score_gpt":0.42007919479346856,"score_spread":0.26913911629871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046280257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023020493,0.0048142676,0.9003319,0.0018086213,0.001851382,0.0014271046,0.000022154834,0.0012895023,0.065434575],"genre_scores_gemma":[0.9477387,0.0012921192,0.04750071,0.00011569208,0.0007446971,0.000036080823,0.000016116619,0.00013868457,0.002417191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957039,0.00044544996,0.0005861902,0.00040850628,0.0014004845,0.0014554674],"domain_scores_gemma":[0.99550724,0.0027510154,0.00006227359,0.00073483685,0.0006627813,0.000281855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014300492,0.00025712664,0.0002589873,0.00024941386,0.00059133273,0.0006333965,0.0008330612,0.0002909801,0.00008531537],"category_scores_gemma":[0.0043247817,0.00020793818,0.00009169793,0.0012487964,0.00040915565,0.00030984276,0.000315441,0.001830959,0.00020880217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010204171,0.00014047661,0.003928984,0.0003043136,0.00014009228,0.00014938547,0.0029298707,0.5787121,0.012165396,0.035919245,0.007047293,0.3584608],"study_design_scores_gemma":[0.00078397995,0.000171486,0.0038983284,0.00037562105,0.00003119236,0.0000241601,0.0022273455,0.9255081,0.0133074755,0.0052879583,0.04774976,0.0006346184],"about_ca_topic_score_codex":0.00008059432,"about_ca_topic_score_gemma":0.00007257233,"teacher_disagreement_score":0.9247182,"about_ca_system_score_codex":0.00039420195,"about_ca_system_score_gemma":0.00011830845,"threshold_uncertainty_score":0.8479473},"labels":[],"label_agreement":null},{"id":"W2046744595","doi":"10.1007/s10732-013-9229-7","title":"Less-Than-Truckload carrier collaboration problem: modeling framework and solution approach","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"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":"Heuristics; Computer science; Vehicle routing problem; Local search (optimization); Transshipment (information security); Integer programming; Heuristic; Routing (electronic design automation); Mathematical optimization; Truck; Integer (computer science); Operations research; Mathematics; Computer network; Engineering; Artificial intelligence; Algorithm; Computer security","score_opus":0.01924323567560286,"score_gpt":0.2557735676930304,"score_spread":0.23653033201742754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046744595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15981942,0.0005008538,0.8388294,0.000087223336,0.00026065673,0.00010850528,0.00000338199,0.000040868905,0.00034970726],"genre_scores_gemma":[0.527042,0.00013698869,0.472614,0.00001235187,0.00015580253,0.0000023208604,0.0000013629392,0.000019530973,0.000015697658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990059,0.00006719059,0.0004657171,0.000081379585,0.00021765986,0.00016211715],"domain_scores_gemma":[0.9991136,0.00007447035,0.00014911358,0.0001040125,0.00045551083,0.00010328402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041819274,0.00011638338,0.00020364042,0.00011112207,0.000077080265,0.00012826371,0.00008505581,0.00013937058,0.0000073656547],"category_scores_gemma":[0.0002876456,0.00011100177,0.000031354735,0.00021643743,0.000022503285,0.00028261528,0.000018545637,0.00034488007,0.0000016860483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000445745,0.000012804745,0.0007239643,0.00007981629,0.000027769247,0.0000014625643,0.0005194802,0.9936055,0.0007417782,0.0004651308,0.00047766248,0.003340186],"study_design_scores_gemma":[0.00018237911,0.000029948784,0.00017907529,0.000066033186,0.000035881458,0.000046133777,0.0004009747,0.9956913,0.00012918698,0.0030424932,0.00007944375,0.00011715675],"about_ca_topic_score_codex":0.000006207043,"about_ca_topic_score_gemma":6.230964e-7,"teacher_disagreement_score":0.36722252,"about_ca_system_score_codex":0.000073001625,"about_ca_system_score_gemma":0.000041419706,"threshold_uncertainty_score":0.45265207},"labels":[],"label_agreement":null},{"id":"W2046798010","doi":"10.1016/j.cor.2010.12.008","title":"An interior point cutting plane heuristic for mixed integer programming","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"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":"Cutting-plane method; Integer programming; Integer (computer science); Mathematical optimization; Point (geometry); Heuristic; Plane (geometry); Interior point method; Mathematics; Branch and price; Computer science; Geometry","score_opus":0.046283844041415535,"score_gpt":0.38598582486289673,"score_spread":0.3397019808214812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046798010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13728012,0.000017417922,0.86048657,0.0002102039,0.00082789524,0.0006599192,0.000009890214,0.00038252719,0.00012548131],"genre_scores_gemma":[0.50855726,0.000002069985,0.4908875,0.000015827754,0.00023836202,0.00014572048,0.000061606595,0.000042026735,0.00004959513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984192,0.0002005051,0.00032945105,0.00030679884,0.00024546348,0.0004985504],"domain_scores_gemma":[0.99848324,0.00043493288,0.000011613924,0.0004442763,0.0004453938,0.00018052016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019023217,0.00014814608,0.00017151634,0.00033155584,0.000452763,0.00058093894,0.0004269176,0.0001059101,0.0000461001],"category_scores_gemma":[0.0005606999,0.00015359039,0.00004755328,0.0004098294,0.00009908645,0.00028596437,0.00009310132,0.0007059623,0.000029063087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001665903,0.00008084796,0.0001573031,0.00013040628,0.000046788595,0.0000073151004,0.0024273975,0.7608274,0.057140313,0.0023553693,0.001960557,0.17484964],"study_design_scores_gemma":[0.00027391076,0.000109483844,0.00009829206,0.00003873052,0.000004461079,0.000016677115,0.00024292801,0.9904994,0.005324185,0.00003430194,0.0031911454,0.000166509],"about_ca_topic_score_codex":0.000027204964,"about_ca_topic_score_gemma":0.000097350014,"teacher_disagreement_score":0.37127715,"about_ca_system_score_codex":0.0000737218,"about_ca_system_score_gemma":0.00006675342,"threshold_uncertainty_score":0.62632346},"labels":[],"label_agreement":null},{"id":"W2047226187","doi":"10.1002/net.21525","title":"Solving the close‐enough arc routing problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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":"Arc routing; Computer science; Routing (electronic design automation); Arc (geometry); Mathematical optimization; Mathematics; Computer network","score_opus":0.010267781984480634,"score_gpt":0.22271240807114842,"score_spread":0.21244462608666778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047226187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022603981,0.0006174801,0.9312925,0.0005671347,0.00069796725,0.00054309785,5.211692e-7,0.0011295477,0.042547815],"genre_scores_gemma":[0.9007443,0.000050464016,0.09804305,0.00018983307,0.0005572788,0.000053813783,0.0000035397213,0.000061662504,0.00029605645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896586,0.00008463229,0.00025087726,0.00015256256,0.0001256358,0.00042045474],"domain_scores_gemma":[0.99932104,0.00022632512,0.00004450372,0.00029805268,0.000051390012,0.000058678914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048784402,0.00014569299,0.00013140666,0.000024882635,0.00018259289,0.00014865688,0.00023432785,0.00010876558,0.0001751158],"category_scores_gemma":[0.000046356552,0.00011335603,0.00005001235,0.00026049127,0.000028615,0.00015575174,0.000062024534,0.0003887114,0.0000824768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.769687e-7,0.0000032841901,0.00065981335,0.000008184337,0.000016313465,5.054964e-7,0.0002793224,0.9410161,0.00009425016,0.00073885545,0.0039458135,0.053237185],"study_design_scores_gemma":[0.000099170225,0.000005855019,0.0012617311,0.00003652665,0.000008718599,0.000004873366,0.00005766189,0.995132,0.00006456494,0.0003745863,0.002809799,0.00014447724],"about_ca_topic_score_codex":0.000033322984,"about_ca_topic_score_gemma":0.0000048129095,"teacher_disagreement_score":0.87814033,"about_ca_system_score_codex":0.000044395016,"about_ca_system_score_gemma":0.000007629469,"threshold_uncertainty_score":0.46225247},"labels":[],"label_agreement":null},{"id":"W2048940061","doi":"10.1016/j.jmp.2006.01.001","title":"Facets of the linear ordering polytope: A unification for the fence family through weighted graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Mathematical Psychology","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"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":"Polytope; Mathematics; Fence (mathematics); Combinatorics; Class (philosophy); Unification; Facet (psychology); Inequality; Binary number; Birkhoff polytope; Stability (learning theory); Discrete mathematics; Computer science; Geometry; Arithmetic; Artificial intelligence","score_opus":0.04045050360672561,"score_gpt":0.3367207538973854,"score_spread":0.2962702502906598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048940061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094550535,0.00036220683,0.9015638,0.0013945359,0.00036387114,0.00020554922,0.0000027012325,0.000024858684,0.0015318897],"genre_scores_gemma":[0.69152045,0.00007928542,0.30805564,0.00015221765,0.00010576804,0.0000074699133,3.8705485e-7,0.000027546781,0.0000512221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883974,0.000089846144,0.0006588428,0.0000772273,0.00017723309,0.00015712171],"domain_scores_gemma":[0.9986625,0.00059451145,0.0002810949,0.00028250588,0.00015800072,0.00002143404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075918855,0.000102704966,0.00023981773,0.00005028175,0.00006375244,0.000011242473,0.00037932096,0.00009458351,0.000021232356],"category_scores_gemma":[0.00021950867,0.00005796071,0.0001416297,0.0002959252,0.000111064124,0.00007184177,0.000017796609,0.00023119403,0.0000029541454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024392245,0.00087604625,0.0012333866,0.00086369185,0.00060251553,0.0000060773655,0.002734763,0.42948547,0.2913729,0.23897618,0.015437246,0.018167796],"study_design_scores_gemma":[0.0030490365,0.0002909308,0.025764728,0.00039963174,0.00031379252,0.00041964994,0.00042805768,0.6153826,0.019885238,0.32468748,0.008938102,0.00044073875],"about_ca_topic_score_codex":0.0000013069722,"about_ca_topic_score_gemma":4.557959e-7,"teacher_disagreement_score":0.5969699,"about_ca_system_score_codex":0.000017274671,"about_ca_system_score_gemma":0.0000147585515,"threshold_uncertainty_score":0.23635691},"labels":[],"label_agreement":null},{"id":"W2050001280","doi":"10.1016/j.cor.2005.05.011","title":"Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"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; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Column generation; Scheduling (production processes); Computer science; Mathematical optimization; Linear programming; Relaxation (psychology); Preprocessor; Degenerate energy levels; Column (typography); Linear programming relaxation; Mathematics; Algorithm; Artificial intelligence","score_opus":0.09169753236726466,"score_gpt":0.34373809634236985,"score_spread":0.2520405639751052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050001280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36328894,0.000206647,0.6344214,0.0002574075,0.000333459,0.0010255247,0.000018758587,0.0003479278,0.00009990858],"genre_scores_gemma":[0.59001154,0.000019849145,0.40858006,0.000019613753,0.0005012099,0.00039314636,0.00019079077,0.00006412268,0.00021967331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765617,0.00032609666,0.00053297187,0.00044332785,0.00042705017,0.0006143621],"domain_scores_gemma":[0.99814206,0.00043185925,0.000020255322,0.00041902543,0.0008680218,0.0001187668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016767444,0.00020040682,0.00023171704,0.0003368576,0.0008939931,0.0006461569,0.00030331413,0.00014138641,0.000019770412],"category_scores_gemma":[0.00025506484,0.00022597244,0.000075248354,0.00081639376,0.00008797069,0.00035565393,0.00008175923,0.00032636165,0.000033564695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051545776,0.000042694825,0.00021138144,0.000041327236,0.000015798383,7.7454763e-7,0.00011343272,0.7532574,0.24227059,0.00073217123,0.0014590065,0.0018502829],"study_design_scores_gemma":[0.0010591663,0.00005888014,0.00014199708,0.00002525933,0.000006637489,0.0000023408713,0.000024794508,0.9416209,0.05540092,0.000056995017,0.0013696136,0.00023250797],"about_ca_topic_score_codex":0.0001773579,"about_ca_topic_score_gemma":0.00061903504,"teacher_disagreement_score":0.2267226,"about_ca_system_score_codex":0.00028061017,"about_ca_system_score_gemma":0.00013393456,"threshold_uncertainty_score":0.9214889},"labels":[],"label_agreement":null},{"id":"W2050999462","doi":"10.1007/s10732-014-9244-3","title":"A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows","year":2014,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université de Montréal; Transport Canada","funders":"Université de Montréal","keywords":"Crossover; Vehicle routing problem; Mathematical optimization; Population; Heuristics; Computer science; Local search (optimization); Genetic algorithm; Heuristic; Metaheuristic; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","score_opus":0.0087929748759454,"score_gpt":0.22447127078058876,"score_spread":0.21567829590464335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050999462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012052948,0.0002823558,0.9869998,0.00014751997,0.00018558228,0.00016603724,0.00001101508,0.000039533104,0.000115200244],"genre_scores_gemma":[0.12910926,0.000029157396,0.8697643,0.00008078374,0.0008675567,0.0000069648972,0.0000029397274,0.000049577327,0.000089438436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998929,0.00007254755,0.00043940006,0.00008431046,0.00027092732,0.00020379202],"domain_scores_gemma":[0.9988432,0.00044259324,0.00019770309,0.0001355939,0.00030702486,0.00007390576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007897754,0.00013078778,0.0002031574,0.00005696172,0.00017636393,0.000103188766,0.00018522027,0.00003561764,0.00002052719],"category_scores_gemma":[0.00015793623,0.000090223475,0.00006972111,0.000087088454,0.00003973012,0.00006871133,0.000015376574,0.00021335662,0.0000056284925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008889097,0.000013567236,0.00020736294,0.000018173198,0.00006558594,0.0000049946207,0.00009307862,0.9253827,0.0005877521,0.00005727001,0.0011186226,0.072442055],"study_design_scores_gemma":[0.00065772375,0.00015468865,0.0005575954,0.00003297683,0.000085333435,0.0002438549,0.00001101139,0.99234563,0.0007218332,0.00014868028,0.004920268,0.00012039617],"about_ca_topic_score_codex":6.710193e-7,"about_ca_topic_score_gemma":2.3269412e-7,"teacher_disagreement_score":0.1172355,"about_ca_system_score_codex":0.000053062657,"about_ca_system_score_gemma":0.000065709,"threshold_uncertainty_score":0.36792064},"labels":[],"label_agreement":null},{"id":"W2051358678","doi":"10.1287/opre.1060.0283","title":"A Branch-and-Cut Algorithm for the Dial-a-Ride Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":672,"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":"Branch and cut; Travelling salesman problem; Vehicle routing problem; Computer science; Integer programming; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Branch and price; 2-opt; Traveling purchaser problem; Algorithm; Mathematics; Computer network","score_opus":0.044993797217322926,"score_gpt":0.3588639218862965,"score_spread":0.31387012466897357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051358678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041259467,0.00040897675,0.9898782,0.0011480595,0.000073257484,0.00082602253,0.000024578887,0.00012990882,0.0033850938],"genre_scores_gemma":[0.21456799,0.00018959008,0.7757881,0.00003309386,0.00058664434,0.0011161393,0.000043183896,0.00007318611,0.0076020337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909866,0.00010996548,0.00016061135,0.0001387428,0.00021305717,0.0002789523],"domain_scores_gemma":[0.9990296,0.0005066628,0.0000037320729,0.00020319784,0.00021923071,0.00003757239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013196903,0.00007237522,0.00007705641,0.000100170255,0.00057860004,0.00024746236,0.00013909917,0.00005021537,0.000041482886],"category_scores_gemma":[0.00012690864,0.000055945322,0.000025143827,0.00036829917,0.00007633612,0.00011551698,0.00003906368,0.00020535958,0.000021535152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015121934,0.000015294867,0.000043253294,0.000019842786,0.000015617734,5.008947e-7,0.00017327207,0.87141883,0.0028532785,0.0038937354,0.003926619,0.11763823],"study_design_scores_gemma":[0.00021144692,0.000015390193,0.00026274534,0.000007405521,0.0000043457694,0.000004332659,0.000033976503,0.9854132,0.0028670093,0.0003565242,0.010752422,0.00007120999],"about_ca_topic_score_codex":0.00020521387,"about_ca_topic_score_gemma":0.00020835568,"teacher_disagreement_score":0.21409002,"about_ca_system_score_codex":0.00004661217,"about_ca_system_score_gemma":0.000042831478,"threshold_uncertainty_score":0.44501823},"labels":[],"label_agreement":null},{"id":"W2051767752","doi":"10.1016/j.ejor.2004.04.051","title":"Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":75,"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; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Schedule; Computer science; Flow network; Operations research; Assignment problem; Mathematical optimization; Integer (computer science); Revenue; Integer programming; Branch and bound; Mathematics; Economics; Algorithm; Finance","score_opus":0.03351273727517879,"score_gpt":0.3092219762336378,"score_spread":0.275709238958459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051767752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6910428,0.0025776303,0.24338678,0.0072541074,0.00017507498,0.00072773045,0.00006226692,0.00014902146,0.054624636],"genre_scores_gemma":[0.9035721,0.00009548565,0.094332926,0.000052952804,0.0005178607,0.0000012343721,0.0000069815032,0.000049379996,0.0013710881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975825,0.0008526367,0.00039079384,0.00013024661,0.0007992437,0.00024460792],"domain_scores_gemma":[0.99909526,0.0002035006,0.000060529208,0.000114191986,0.00034587528,0.00018066897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053592087,0.00011752411,0.00017264155,0.00020635349,0.00018512442,0.0002004676,0.00016915139,0.000021477408,0.0006703857],"category_scores_gemma":[0.00027007508,0.00009790162,0.000027439866,0.00015172869,0.00015856771,0.0002753042,0.000051307165,0.00050546805,0.00019449346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008438884,0.000054377433,0.00055070064,0.00002447607,0.00011767273,0.00023937416,0.00083540066,0.9220105,0.042035274,0.00016060927,0.0037221208,0.030165102],"study_design_scores_gemma":[0.0076115592,0.0022510558,0.016372867,0.0013719092,0.000089189394,0.0049458193,0.00054963614,0.8938156,0.02265769,0.00005811552,0.04913928,0.0011372989],"about_ca_topic_score_codex":3.7243205e-7,"about_ca_topic_score_gemma":3.692526e-7,"teacher_disagreement_score":0.21252933,"about_ca_system_score_codex":0.0001362092,"about_ca_system_score_gemma":0.00012723736,"threshold_uncertainty_score":0.73402536},"labels":[],"label_agreement":null},{"id":"W2053226773","doi":"","title":"The Single-Vehicle Routing Problem with Unrestricted Backhauls","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","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":"University of Waterloo","funders":"","keywords":"Solver; Backhaul (telecommunications); Vehicle routing problem; Mathematical optimization; Computer science; Revenue; Set (abstract data type); Routing (electronic design automation); Operations research; Mathematics; Economics; Computer network; Finance","score_opus":0.015601314730342668,"score_gpt":0.23194090896135408,"score_spread":0.2163395942310114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053226773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2323564,0.0042515285,0.75018233,0.0011319851,0.00042045506,0.00037341713,0.000001371901,0.0007762115,0.0105063245],"genre_scores_gemma":[0.98333126,0.00044859672,0.015109398,0.000025375306,0.00026996093,0.000006807784,0.0000018639691,0.00008358665,0.0007231408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698234,0.00017973814,0.0003328838,0.00014032963,0.0003599636,0.0020047433],"domain_scores_gemma":[0.99917746,0.00014233915,0.00011637365,0.00020596797,0.00019905365,0.00015881246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027843497,0.00018657513,0.00015424473,0.000069604714,0.0003147572,0.00021337983,0.00032764048,0.00007486638,0.0000032129233],"category_scores_gemma":[0.00016564198,0.00012687681,0.000046431,0.00052486267,0.00004574324,0.0002258305,0.000029295657,0.0015806919,0.000019220714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011951017,0.000065064356,0.0051693004,0.000011827348,0.00043789978,0.00001366162,0.00079169293,0.8106304,0.0020268995,0.030108616,0.0006101484,0.15001501],"study_design_scores_gemma":[0.008742143,0.0026467044,0.001613674,0.0002752031,0.0002900718,0.0046177637,0.011189544,0.81849515,0.004827886,0.11948245,0.025633186,0.0021862292],"about_ca_topic_score_codex":0.000011163401,"about_ca_topic_score_gemma":0.00017292392,"teacher_disagreement_score":0.7509749,"about_ca_system_score_codex":0.0011467,"about_ca_system_score_gemma":0.0008631487,"threshold_uncertainty_score":0.68674076},"labels":[],"label_agreement":null},{"id":"W2053944393","doi":"10.1007/s101070050007","title":"A branch-and-cut algorithm for the Undirected Rural Postman Problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Binary number; Undirected graph; Combinatorics; Mathematical optimization; Graph; Arithmetic","score_opus":0.012956686533581226,"score_gpt":0.26001142746504663,"score_spread":0.2470547409314654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053944393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006513885,0.00024900783,0.98925817,0.00027381422,0.000044405333,0.0010046513,0.0000038076835,0.0008523359,0.0017999283],"genre_scores_gemma":[0.04152529,0.00001975715,0.95740265,0.000045006756,0.00009669993,0.0002843125,0.0000064296764,0.00006891181,0.000550929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908185,0.00003452073,0.00027401934,0.00012948998,0.00013487268,0.00034525653],"domain_scores_gemma":[0.99920225,0.0004864395,0.000022071707,0.00017984863,0.000032162552,0.000077218254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046550288,0.00015645195,0.0001917784,0.000030056222,0.00016340794,0.00013486006,0.00013252112,0.00007420282,0.00015961693],"category_scores_gemma":[0.000070194495,0.000113131515,0.00006649002,0.00019147119,0.00006639097,0.000077562756,0.000018812338,0.00014270542,0.000032699245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025393051,0.000021861231,0.0000068500512,0.00012538487,0.000040526884,5.069689e-7,0.00048440255,0.0022159389,0.000049348793,0.0009985202,0.000049475828,0.99600464],"study_design_scores_gemma":[0.00033249895,0.00003434038,0.000033965734,0.000069649745,0.00005337523,0.000031156116,0.00008045428,0.98650223,0.0002473292,0.006034335,0.006394921,0.00018577173],"about_ca_topic_score_codex":0.0000026477283,"about_ca_topic_score_gemma":9.337284e-7,"teacher_disagreement_score":0.99581885,"about_ca_system_score_codex":0.000024223556,"about_ca_system_score_gemma":0.0000060539323,"threshold_uncertainty_score":0.46133694},"labels":[],"label_agreement":null},{"id":"W2054151210","doi":"10.1016/j.orl.2004.11.011","title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":196,"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":"Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematical optimization; Node (physics); Computer science; Algorithm; Longest path problem; K shortest path routing; Repetition (rhetorical device); Widest path problem; Mathematics; Theoretical computer science; Graph","score_opus":0.07945066765209823,"score_gpt":0.36972095527867616,"score_spread":0.2902702876265779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054151210","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055941127,0.0002675346,0.87473947,0.06303556,0.00012623152,0.0033003408,0.00017811473,0.0006403624,0.0017712681],"genre_scores_gemma":[0.18241856,0.000045275578,0.813144,0.002030786,0.00065284665,0.00090880453,0.00024063983,0.0001026854,0.00045638715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981119,0.00027166246,0.00035479674,0.0002609044,0.00040221895,0.00059853686],"domain_scores_gemma":[0.99859846,0.0007253788,0.000013164495,0.00033594278,0.00023111457,0.00009595731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025684661,0.00015514581,0.00012493688,0.00016370951,0.0009643737,0.00038704093,0.00035566223,0.000059846334,0.00013329738],"category_scores_gemma":[0.00023871331,0.00012997651,0.000040839266,0.0006025989,0.0001386273,0.0002716691,0.000063909356,0.0004876012,0.000024828052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004202593,0.000019597524,0.00005605896,0.000011637857,0.0000528439,0.0000015457151,0.00040255682,0.89926493,0.034566633,0.00015188575,0.022309916,0.04315817],"study_design_scores_gemma":[0.0005328845,0.000026024325,0.000061105886,0.000022111968,0.000010268992,0.000005410705,0.00031089422,0.9639624,0.0037843436,0.0000032119417,0.031130971,0.00015040475],"about_ca_topic_score_codex":0.000033962675,"about_ca_topic_score_gemma":0.00004965158,"teacher_disagreement_score":0.12647744,"about_ca_system_score_codex":0.00019453451,"about_ca_system_score_gemma":0.00006819993,"threshold_uncertainty_score":0.741728},"labels":[],"label_agreement":null},{"id":"W2054669984","doi":"10.1057/palgrave.jors.2601420","title":"Some applications of the clustered travelling salesman problem","year":2002,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Computer science; Vehicle routing problem; Purchasing; Operations research; Scheduling (production processes); Traveling purchaser problem; Lin–Kernighan heuristic; Routing (electronic design automation); Mathematical optimization; Bottleneck traveling salesman problem; Engineering; Operations management; Algorithm; Computer network; Mathematics","score_opus":0.07207568656996226,"score_gpt":0.34042582006238425,"score_spread":0.268350133492422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054669984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28432262,0.008688932,0.6149587,0.07064986,0.0019009595,0.005338081,0.000121727615,0.00017174352,0.0138473585],"genre_scores_gemma":[0.88856137,0.0007876664,0.10754166,0.00019316179,0.00073583674,0.000027605656,0.0000010504114,0.000036916103,0.0021147276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982001,0.0002728288,0.00041184045,0.00006950199,0.00086942565,0.00017626531],"domain_scores_gemma":[0.9987128,0.00031845583,0.00010527139,0.00022971282,0.000580537,0.00005321653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023399326,0.00006985118,0.00011771362,0.00003770692,0.0003746184,0.000059374,0.00059215684,0.00006801683,0.00006675775],"category_scores_gemma":[0.00016806785,0.000041632222,0.00023283999,0.0005135805,0.00014563273,0.00017710096,0.00008309222,0.0006697426,0.000004573612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002694164,0.000057495086,0.00038378843,0.000061174425,0.000095393654,1.2929966e-7,0.0016676362,0.96159184,0.016482908,0.002600824,0.015592214,0.0014639163],"study_design_scores_gemma":[0.00054009777,0.000030322746,0.0018130493,0.00012789288,0.000021406455,0.000031227653,0.00039690666,0.97465193,0.011413245,0.00301713,0.007848187,0.00010858334],"about_ca_topic_score_codex":0.0000014522161,"about_ca_topic_score_gemma":9.866288e-7,"teacher_disagreement_score":0.60423875,"about_ca_system_score_codex":0.00015286937,"about_ca_system_score_gemma":0.000089888454,"threshold_uncertainty_score":0.29097354},"labels":[],"label_agreement":null},{"id":"W2055819286","doi":"10.1007/s00291-008-0135-6","title":"Dynamic transportation of patients in hospitals","year":2008,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":224,"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":"Computer science; Heuristic; Context (archaeology); Scheme (mathematics); Tabu search; Service (business); Quality (philosophy); Operations research; Simple (philosophy); Phase (matter); Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.006537182786802548,"score_gpt":0.2320161659181334,"score_spread":0.22547898313133086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055819286","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98718184,0.000023234674,0.012071303,0.0000099848585,0.00010118285,0.00009948211,0.000009964706,0.000075732794,0.00042724394],"genre_scores_gemma":[0.98238486,0.00009278028,0.017411705,0.0000035543787,0.0000040492228,0.0000050847625,0.000017127293,0.00001773586,0.00006312845],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99954665,0.000011236373,0.00018723315,0.000067638466,0.00008246595,0.000104773506],"domain_scores_gemma":[0.99984574,0.000017393708,0.000025268646,0.00008343591,0.000009949457,0.000018194058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004853898,0.000058917994,0.00010388203,0.0000789831,0.000011008804,0.0000016124519,0.0000496866,0.000035411307,0.00007870727],"category_scores_gemma":[0.000011901249,0.000058713413,0.000020416062,0.00022429136,0.000012897942,0.00006274759,0.0000014496518,0.00005345307,0.0000054930097],"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.000022621987,0.000060013368,0.54480433,0.00006164886,0.000012349166,0.000013189569,0.0015217905,0.45032448,0.00042315928,0.000089087036,0.00004892938,0.0026183787],"study_design_scores_gemma":[0.00039087012,0.000049045022,0.9405306,0.0000131785755,0.0000027256353,5.25233e-7,0.000016311902,0.05602889,0.002790213,0.000044415636,0.000046562913,0.00008664486],"about_ca_topic_score_codex":0.000013670745,"about_ca_topic_score_gemma":0.00008445877,"teacher_disagreement_score":0.39572626,"about_ca_system_score_codex":0.000040113246,"about_ca_system_score_gemma":0.000007972475,"threshold_uncertainty_score":0.23942634},"labels":[],"label_agreement":null},{"id":"W2056059863","doi":"10.1016/j.endm.2012.10.032","title":"MPI Parallelization of Variable Neighborhood Search","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"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":"Computer science; Benchmark (surveying); Generality; Parallel computing; Asynchronous communication; Variable neighborhood search; Scheduling (production processes); Variable (mathematics); Automatic parallelization; Multiprocessing; Heuristic; Metaheuristic; Algorithm; Mathematical optimization; Programming language; Mathematics; Artificial intelligence","score_opus":0.016105917460154974,"score_gpt":0.2769799389609048,"score_spread":0.2608740215007498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056059863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05807973,0.0006539834,0.9370629,0.000018854967,0.000072334464,0.00018834235,0.000003010793,0.00012829668,0.003792548],"genre_scores_gemma":[0.8018292,0.00008499323,0.19793572,0.0000066237394,0.000044553297,0.0000117991585,0.000009972886,0.000043901746,0.000033228636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986812,0.0000660721,0.00039025157,0.000093975745,0.0001997391,0.0005687544],"domain_scores_gemma":[0.9992812,0.00029431036,0.00005422263,0.0002810406,0.000036358444,0.000052847838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019467,0.0001410603,0.00023765142,0.00011425128,0.000024173523,0.000013484406,0.0001666623,0.000094762065,0.00012737745],"category_scores_gemma":[0.00026403763,0.00014236332,0.00003613869,0.00049458764,0.000026044012,0.00017230636,0.000038653176,0.00022127251,0.000013026511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004840912,0.00012282097,0.0068976968,0.00052398496,0.00005806293,2.538875e-7,0.0023829541,0.7920881,0.005257353,0.19060321,0.0000231087,0.0020376213],"study_design_scores_gemma":[0.0003106295,0.00003046305,0.00039499873,0.000083695566,0.0000219526,0.0000051176003,0.00008181886,0.9692826,0.01706877,0.012444237,0.00006452931,0.00021119016],"about_ca_topic_score_codex":0.0000053532463,"about_ca_topic_score_gemma":0.0000019483919,"teacher_disagreement_score":0.7437495,"about_ca_system_score_codex":0.00013836724,"about_ca_system_score_gemma":0.000040836054,"threshold_uncertainty_score":0.5805408},"labels":[],"label_agreement":null},{"id":"W2057459863","doi":"10.1007/s10107-008-0254-5","title":"Multi-phase dynamic constraint aggregation for set partitioning type problems","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"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":"Mathematical optimization; Constraint (computer-aided design); Disjoint sets; Computation; Relaxation (psychology); Set (abstract data type); Computer science; Mathematics; Local consistency; Scheduling (production processes); Algorithm; Constraint satisfaction problem; Probabilistic logic","score_opus":0.06582903588106113,"score_gpt":0.33703000503881686,"score_spread":0.2712009691577557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057459863","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045297958,0.00007061542,0.95286167,0.000037008987,0.000095228985,0.0007540706,0.000005852877,0.00072213233,0.00015547534],"genre_scores_gemma":[0.37876996,0.0000052268006,0.6209518,0.000008289862,0.000020569878,0.00012486102,0.00003006415,0.00003748826,0.0000517847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895835,0.000032537275,0.0003800118,0.00017206685,0.00013305419,0.00032399967],"domain_scores_gemma":[0.9994086,0.00018726179,0.000056029243,0.00015993034,0.000094552954,0.00009360432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041980523,0.00015270856,0.00020676185,0.00006139293,0.00017175377,0.000051535735,0.000083741565,0.00009123457,0.000046835496],"category_scores_gemma":[0.00045881397,0.00015386018,0.00006494767,0.00021537379,0.00008929833,0.000113486545,0.000016100044,0.00012744099,0.00003889615],"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.00005043673,0.0011839994,0.00042481563,0.004568772,0.00033370688,0.000044682827,0.012117631,0.45203245,0.0147908665,0.011270195,0.00032120006,0.50286126],"study_design_scores_gemma":[0.00082811364,0.00006719124,0.000010417302,0.00012135972,0.000021714442,0.00005211833,0.000101330894,0.9958166,0.00070636754,0.0013711477,0.00071296305,0.00019069988],"about_ca_topic_score_codex":5.5572355e-7,"about_ca_topic_score_gemma":9.783391e-7,"teacher_disagreement_score":0.54378414,"about_ca_system_score_codex":0.000067107394,"about_ca_system_score_gemma":0.000018496698,"threshold_uncertainty_score":0.62742364},"labels":[],"label_agreement":null},{"id":"W2057635030","doi":"10.1007/s10589-013-9544-9","title":"A cutting plane algorithm for the Capacitated Connected Facility Location Problem","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"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; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Facility location problem; 1-center problem; Integer programming; Mathematical optimization; Network planning and design; Branch and cut; Set (abstract data type); Set cover problem; Integer (computer science); Mathematics; Cutting-plane method; Theory of computation; Cover (algebra); Computer science; Algorithm; Computer network; Engineering","score_opus":0.014384514747038524,"score_gpt":0.2430500121766642,"score_spread":0.22866549742962566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057635030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015386034,0.00014853796,0.9967517,0.00043707178,0.00003966841,0.0017424169,0.00008319603,0.00039974513,0.00024375344],"genre_scores_gemma":[0.05044626,0.000033552013,0.9462709,0.0001560659,0.00006705113,0.002020869,0.0009115725,0.000024986264,0.00006878628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991594,0.000039483544,0.0003207044,0.00020371735,0.00011971289,0.00015700255],"domain_scores_gemma":[0.9985257,0.0006611241,0.00007141746,0.0001356556,0.0005376098,0.00006849453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000201763,0.00013644109,0.000119047654,0.00006991196,0.00038336372,0.00013524818,0.000104597915,0.00006578862,0.000065922955],"category_scores_gemma":[0.000047168833,0.00012252307,0.000026881546,0.0004581875,0.00007086427,0.00017919029,0.00001614864,0.000090735266,0.000021288499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9543686e-7,0.000013585217,0.000029992341,0.000025610745,0.000025097946,1.2034473e-8,0.000101293044,0.9319238,0.000021527421,0.0015966776,0.000464714,0.065797076],"study_design_scores_gemma":[0.00033292724,0.000008369966,0.00039796595,0.000007411652,0.000020252834,0.0000047810513,0.00011074988,0.99591625,0.000033735043,0.0016640718,0.0013634533,0.00014004348],"about_ca_topic_score_codex":0.000009828112,"about_ca_topic_score_gemma":6.4768136e-7,"teacher_disagreement_score":0.065657035,"about_ca_system_score_codex":0.0000410341,"about_ca_system_score_gemma":0.000029419043,"threshold_uncertainty_score":0.4996346},"labels":[],"label_agreement":null},{"id":"W2059252479","doi":"10.4171/owr/2012/19","title":"Mini-Workshop: Hypergraph Turán Problem","year":2013,"lang":"en","type":"article","venue":"Oberwolfach Reports","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":"University of Waterloo","funders":"","keywords":"Hypergraph; Computer science; Mathematics; Combinatorics","score_opus":0.012014865303501536,"score_gpt":0.23025278736930344,"score_spread":0.2182379220658019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059252479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7163491,0.0010292359,0.084288016,0.0007175107,0.0022237685,0.0015493188,0.0000036623192,0.003900131,0.18993925],"genre_scores_gemma":[0.78667617,0.000036791473,0.20909101,0.00008543471,0.0001461462,0.00015296043,0.000019873958,0.00010059253,0.0036910535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983305,0.00004877315,0.0005967317,0.00032918452,0.00026978142,0.0004250795],"domain_scores_gemma":[0.9989279,0.00007524198,0.000110274326,0.000593004,0.00011748562,0.00017611089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041177598,0.00023707542,0.00025198847,0.00012376561,0.0000817696,0.00011375426,0.000120974124,0.00017101574,0.0006850798],"category_scores_gemma":[0.00012974774,0.0002337781,0.000102687816,0.00040085267,0.000036377045,0.0002769809,0.000045741,0.00024658444,0.00015662832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003457828,0.00015880048,0.06869814,0.0003216263,0.00026945173,0.00053165085,0.0010404792,0.6343554,0.020114517,0.00044539376,0.12804615,0.14601488],"study_design_scores_gemma":[0.0014656571,0.00014651171,0.122188896,0.00052095397,0.00027013742,0.0051522152,0.00064356806,0.48129296,0.035741918,0.01391441,0.33365905,0.0050037256],"about_ca_topic_score_codex":0.000047657748,"about_ca_topic_score_gemma":0.000005234262,"teacher_disagreement_score":0.2056129,"about_ca_system_score_codex":0.000053964828,"about_ca_system_score_gemma":0.000020920796,"threshold_uncertainty_score":0.95331943},"labels":[],"label_agreement":null},{"id":"W2059559546","doi":"10.1287/trsc.35.4.375.10432","title":"Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":308,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew scheduling; Crew; Column generation; Scheduling (production processes); Integer programming; Mathematical optimization; Benders' decomposition; Engineering; Routing (electronic design automation); Branch and bound; Decomposition; Heuristic; Computer science; Iterated local search; Operations research; Metaheuristic; Aeronautics; Mathematics; Computer network","score_opus":0.020126917279569764,"score_gpt":0.30792374553360674,"score_spread":0.28779682825403696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059559546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42903775,0.00002539646,0.5704123,0.000041192558,0.000073397314,0.00010642,0.0000031924524,0.00016689459,0.00013350965],"genre_scores_gemma":[0.73442626,0.000021990594,0.2654615,0.00003385512,0.00001873677,0.0000073026645,0.000009227675,0.000012043567,0.0000090760095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915826,0.000008387513,0.00021324062,0.00021046316,0.00018045877,0.0002291606],"domain_scores_gemma":[0.99951017,0.00017701286,0.000034037665,0.00008591256,0.00010915908,0.00008369231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005019603,0.00009001057,0.00009012685,0.00011171194,0.00023906915,0.000066169065,0.00009685444,0.000036342062,0.000009207227],"category_scores_gemma":[0.000089629495,0.00010254354,0.000022196718,0.00047164314,0.00008984158,0.00037416193,0.0000016063029,0.000059319576,0.0000017261268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053472013,0.0000038910316,0.0020274224,0.000018781224,0.000002525111,0.000001771205,0.0007489995,0.9693616,0.016736036,0.00049784454,8.1549814e-7,0.01059494],"study_design_scores_gemma":[0.00026312843,0.000015764224,0.0063472628,0.000022207922,0.000011727838,0.00000498601,0.00021811711,0.9878444,0.004919173,0.00015969346,0.0000630818,0.00013043093],"about_ca_topic_score_codex":0.000005764126,"about_ca_topic_score_gemma":0.0000139287595,"teacher_disagreement_score":0.3053885,"about_ca_system_score_codex":0.000039891926,"about_ca_system_score_gemma":0.000026156142,"threshold_uncertainty_score":0.4181604},"labels":[],"label_agreement":null},{"id":"W2059760003","doi":"10.1007/s10732-014-9273-y","title":"Time-window relaxations in vehicle routing heuristics","year":2014,"lang":"fr","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":58,"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":"Iterated local search; Vehicle routing problem; Heuristics; Computer science; Mathematical optimization; Relaxation (psychology); Scalability; Heuristic; Local search (optimization); Metaheuristic; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.012152139364092714,"score_gpt":0.25583713383890005,"score_spread":0.24368499447480735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059760003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10035925,0.0028074402,0.8829877,0.0027926944,0.00479047,0.00018235327,0.00003400944,0.000087202905,0.0059588784],"genre_scores_gemma":[0.5426098,0.0005331232,0.45266533,0.0001298107,0.0018358656,0.0000011939649,0.0000056501844,0.00013683063,0.0020823888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962577,0.00069159904,0.0017661322,0.00019271552,0.00050875143,0.0005830919],"domain_scores_gemma":[0.99622434,0.0017311005,0.00087592687,0.00034289545,0.00054994115,0.0002757693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032843973,0.00031581026,0.00067593635,0.00039237447,0.000129792,0.000119992335,0.00038053305,0.00033665198,0.00018638393],"category_scores_gemma":[0.008083252,0.00036701493,0.00018715073,0.0006935166,0.00013280149,0.00026855353,0.00007847216,0.0013580906,0.00017484005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019867739,0.00016459741,0.011975569,0.00017524652,0.000072341034,0.00010897488,0.00087961514,0.96243,0.00073110097,0.0040366524,0.0041513504,0.015254705],"study_design_scores_gemma":[0.0012630895,0.00019404107,0.012112098,0.0007126402,0.00018007739,0.00022546212,0.00011354903,0.9649797,0.00038852377,0.0020576527,0.017390957,0.00038218644],"about_ca_topic_score_codex":0.000021465385,"about_ca_topic_score_gemma":0.000006334123,"teacher_disagreement_score":0.44225058,"about_ca_system_score_codex":0.00046994674,"about_ca_system_score_gemma":0.00017511446,"threshold_uncertainty_score":0.99987817},"labels":[],"label_agreement":null},{"id":"W2059816321","doi":"10.1287/ijoc.1040.0117","title":"The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada)","funders":"","keywords":"Shortest path problem; Mathematical optimization; Vehicle routing problem; Benchmark (surveying); Mathematics; Column generation; Relaxation (psychology); Integer (computer science); Path (computing); Scheduling (production processes); Routing (electronic design automation); Computer science; Combinatorics; Graph","score_opus":0.006429132118342962,"score_gpt":0.22400800837229531,"score_spread":0.21757887625395236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059816321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11205155,0.00011379935,0.87469405,0.00032698113,0.00015874083,0.00036659022,0.0000036071497,0.00022675372,0.012057957],"genre_scores_gemma":[0.8709671,0.000013268905,0.12855987,0.00012472473,0.00025040406,0.000004244282,0.000004096568,0.00003510058,0.00004121979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894243,0.000024649715,0.0004073178,0.000097223,0.00021528463,0.0003130837],"domain_scores_gemma":[0.99901307,0.00053099456,0.00015955966,0.000100369674,0.0001280634,0.000067961984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011057296,0.00015032366,0.00013953705,0.00007030197,0.0005817477,0.000332141,0.00012550557,0.000053540854,0.0000013187476],"category_scores_gemma":[0.00006630085,0.00009794606,0.000037505444,0.00014716969,0.000080444814,0.00016984991,0.000019771414,0.00029268945,0.0000011531428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002062001,0.0000068817544,0.00049216003,0.000015233681,0.000017924142,0.0000026961075,0.00013190298,0.838854,0.000084195046,0.0017852613,0.00053559267,0.15805353],"study_design_scores_gemma":[0.00092543254,0.00017461293,0.0016529381,0.00018323668,0.000017107359,0.00038609188,0.00019023159,0.98245233,0.00041244872,0.0007665737,0.012617556,0.00022145922],"about_ca_topic_score_codex":0.0000010611344,"about_ca_topic_score_gemma":0.0000016885675,"teacher_disagreement_score":0.75891554,"about_ca_system_score_codex":0.00006365768,"about_ca_system_score_gemma":0.000026844138,"threshold_uncertainty_score":0.4474392},"labels":[],"label_agreement":null},{"id":"W2059958986","doi":"10.1007/s10732-008-9097-8","title":"Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions","year":2008,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"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":"Arc routing; Arc (geometry); Heuristics; Ant colony optimization algorithms; Mathematical optimization; Routing (electronic design automation); Computer science; Mathematics; Computer network","score_opus":0.03496000000940143,"score_gpt":0.24365280378072676,"score_spread":0.20869280377132532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059958986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10478375,0.0001366018,0.8944769,0.00016127696,0.00017546781,0.00013325541,0.000016072718,0.000035375477,0.00008133093],"genre_scores_gemma":[0.6611332,0.0005770866,0.3380717,0.000020930036,0.000118130156,0.000003950624,0.0000011676692,0.000019466232,0.00005434125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926907,0.00004632607,0.000336543,0.00006143977,0.00014542119,0.00014120871],"domain_scores_gemma":[0.99888706,0.0005626824,0.00016290686,0.00008229691,0.00025233353,0.000052721316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003680857,0.00009766041,0.00015621442,0.00007525193,0.00022661647,0.000037015063,0.00007987563,0.000045210552,0.0000040404425],"category_scores_gemma":[0.00030745214,0.00006719565,0.00003139049,0.0001231963,0.00009741666,0.00011184537,0.000013052747,0.00022699364,1.638133e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019720414,0.000010520459,0.0013653347,0.000037860813,0.000052852924,0.000003352631,0.0008161145,0.99673945,0.000025863807,0.00016031794,0.00043721995,0.00033141268],"study_design_scores_gemma":[0.00051774975,0.00015472114,0.0028323203,0.000054419754,0.000066830005,0.0003096752,0.0004979327,0.9944806,0.00010077497,0.00012883115,0.0007546844,0.00010147041],"about_ca_topic_score_codex":0.000005603952,"about_ca_topic_score_gemma":0.0000042073325,"teacher_disagreement_score":0.5564052,"about_ca_system_score_codex":0.00006864885,"about_ca_system_score_gemma":0.000048429778,"threshold_uncertainty_score":0.2740159},"labels":[],"label_agreement":null},{"id":"W2060597711","doi":"10.1016/j.cor.2012.06.011","title":"Heuristics for dynamic and stochastic routing in industrial shipping","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"Heuristics; Computer science; Operations research; Routing (electronic design automation); Vehicle routing problem; Metaheuristic; Key (lock); Mathematical optimization; Set (abstract data type); Engineering; Mathematics; Algorithm; Computer security; Computer network","score_opus":0.13374856411112754,"score_gpt":0.39890553355726316,"score_spread":0.26515696944613565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060597711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16993101,0.000115391376,0.82896924,0.00010384669,0.00032767237,0.000418105,0.000005488455,0.00007504249,0.000054227516],"genre_scores_gemma":[0.86775446,0.0000083167615,0.13190629,0.000008752305,0.0001950377,0.00005452277,0.00001638287,0.000026879346,0.000029345001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988074,0.00018328577,0.0002355431,0.0001429997,0.00016430228,0.00046648216],"domain_scores_gemma":[0.9989219,0.0007148817,0.000006663921,0.00014408736,0.000105407526,0.00010707697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018923512,0.00009189903,0.00012875765,0.00031135208,0.00023825238,0.00015198298,0.00012348172,0.000090879126,0.0000048725033],"category_scores_gemma":[0.0007348353,0.00010507574,0.00001647203,0.0004496803,0.000049769616,0.00019905368,0.000086297405,0.0003889477,0.0000045590164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000358749,0.000016209926,0.0006193696,0.000020124791,0.000008315224,3.544134e-7,0.000997586,0.982344,0.00034054427,0.0013192189,0.00010044136,0.014230295],"study_design_scores_gemma":[0.00042381976,0.000019377047,0.000833415,0.000053050037,0.0000028657357,0.0000036177516,0.00016906335,0.9982534,0.00004599459,0.000026612794,0.00006459775,0.00010418013],"about_ca_topic_score_codex":0.0000142612525,"about_ca_topic_score_gemma":0.000021351258,"teacher_disagreement_score":0.69782346,"about_ca_system_score_codex":0.00017096185,"about_ca_system_score_gemma":0.000043159147,"threshold_uncertainty_score":0.42848644},"labels":[],"label_agreement":null},{"id":"W2060706020","doi":"10.1109/wmnc.2011.6097256","title":"An ant colony optimization metaheuristic for solving bi-objective multi-sources multicommodity communication flow problem","year":2011,"lang":"en","type":"article","venue":"","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":"University of Victoria","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Metaheuristic; Mathematical optimization; Multicast; Node (physics); Relay; Path (computing); Optimization problem; Ant colony; Transmission (telecommunications); Computer network; Mathematics; Engineering; Algorithm; Telecommunications","score_opus":0.04895965192047832,"score_gpt":0.28591206624698196,"score_spread":0.23695241432650363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060706020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007769251,0.000103783204,0.9890194,0.000014053285,0.00012238353,0.00090062834,0.00002359777,0.0009979206,0.0010489983],"genre_scores_gemma":[0.34934777,0.000028474135,0.6503053,0.000020098863,0.000021223508,0.00011885646,0.0000655847,0.00005600835,0.0000367368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869716,0.00020016875,0.00041424987,0.0002670556,0.000121814264,0.00029955403],"domain_scores_gemma":[0.998657,0.0003107595,0.00011013554,0.00054005627,0.00027242844,0.00010960257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008669047,0.00022582898,0.00026884518,0.00014623906,0.00027219686,0.000077406876,0.00033999246,0.00014220031,0.00009158717],"category_scores_gemma":[0.00026262898,0.00022942641,0.00006921789,0.00024110258,0.000058770634,0.00045449458,0.000050702067,0.00016874565,0.000005994774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001856381,0.00013116065,0.00071490766,0.00005617156,0.000054713833,2.5683445e-7,0.003027562,0.9924206,0.00081819436,0.00017860951,0.00004757077,0.0025316847],"study_design_scores_gemma":[0.00071298424,0.000069381575,0.0012030146,0.000026480373,0.0000664486,0.0000022336892,0.0002961061,0.9904745,0.006713817,0.00010085451,0.000045124194,0.00028903075],"about_ca_topic_score_codex":0.00011819776,"about_ca_topic_score_gemma":0.0000872258,"teacher_disagreement_score":0.3415785,"about_ca_system_score_codex":0.00011246575,"about_ca_system_score_gemma":0.000022509706,"threshold_uncertainty_score":0.93557376},"labels":[],"label_agreement":null},{"id":"W2061091622","doi":"10.1016/j.ejor.2009.07.007","title":"Heuristics for the Stochastic Eulerian Tour Problem","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Université de Montréal","funders":"","keywords":"Heuristics; Eulerian path; Concatenation (mathematics); Mathematical optimization; Heuristic; Computer science; Grid; Probabilistic logic; Mathematics; Enhanced Data Rates for GSM Evolution; Algorithm; Combinatorics; Artificial intelligence; Applied mathematics; Lagrangian","score_opus":0.08847412350347472,"score_gpt":0.3704656567390892,"score_spread":0.2819915332356145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061091622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028125115,0.00034600467,0.98866564,0.002574684,0.00020246542,0.00025376154,0.000006814874,0.000024429253,0.005113699],"genre_scores_gemma":[0.8327964,0.00004076276,0.16543435,0.00011658283,0.0010143154,0.0000026275918,0.0000030923657,0.00003668655,0.0005551722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829566,0.00045461007,0.00039384988,0.00007649896,0.000548692,0.00023066657],"domain_scores_gemma":[0.9980135,0.00075752096,0.000046763136,0.00012793404,0.0009577574,0.00009655298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064512338,0.00008029381,0.00010441664,0.00013496622,0.00027641392,0.000198629,0.0003743991,0.000015600252,0.00007229518],"category_scores_gemma":[0.0013788972,0.000056791057,0.00005703067,0.0002290362,0.00004484162,0.00012721615,0.000022128559,0.00043499033,0.00002312437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031540727,0.000019471756,0.0000048282177,0.000007848531,0.00002502041,0.000012554269,0.00023251718,0.9635044,0.0022679206,0.0026899953,0.014786878,0.016417032],"study_design_scores_gemma":[0.0012640574,0.0008207581,0.00581123,0.00011527133,0.00002291998,0.00017894313,0.00018336393,0.9570192,0.00052827137,0.0010945174,0.03275062,0.00021082597],"about_ca_topic_score_codex":1.8718453e-7,"about_ca_topic_score_gemma":2.2450061e-7,"teacher_disagreement_score":0.8299839,"about_ca_system_score_codex":0.0000608346,"about_ca_system_score_gemma":0.000100438156,"threshold_uncertainty_score":0.23158722},"labels":[],"label_agreement":null},{"id":"W2061568192","doi":"10.1007/s10589-011-9432-0","title":"An exact method with variable fixing for solving the generalized assignment problem","year":2011,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"Mathematics; Mathematical optimization; Simple (philosophy); Variable (mathematics); Weapon target assignment problem; Generalized assignment problem; Sequence (biology); Branch and cut; Branch and bound; Optimization problem; Augmented Lagrangian method; Lagrangian relaxation; Linear programming","score_opus":0.025524929425743054,"score_gpt":0.2797806794497151,"score_spread":0.25425575002397205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061568192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008342813,0.00004470912,0.99710613,0.00008314512,0.000020647767,0.00088117184,0.00001709723,0.00026138168,0.0015023075],"genre_scores_gemma":[0.023545371,0.000012531735,0.9751324,0.00015085183,0.000058945097,0.0008561236,0.00016198147,0.000041319712,0.000040448573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992174,0.0000539873,0.00023889139,0.00021933453,0.00011796094,0.00015245864],"domain_scores_gemma":[0.999283,0.00021756707,0.000076798555,0.00016892706,0.00017853403,0.00007513295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000390677,0.00013406039,0.0001169621,0.00006275239,0.000369091,0.0000908328,0.00013028429,0.000048668968,0.0000619299],"category_scores_gemma":[0.000009234234,0.00010768029,0.000020564838,0.00029035786,0.000036074664,0.00019151802,0.000014560351,0.00007042364,0.0000011837192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058364203,0.000029778013,0.000067550005,0.000019614323,0.000029214985,4.0479538e-8,0.0003139293,0.960906,0.00009433165,0.03564287,0.000060875038,0.0028299198],"study_design_scores_gemma":[0.00039431738,0.000028790717,0.0001332388,0.000009523391,0.00003712344,0.0000068024865,0.00007133238,0.99338824,0.00016577676,0.004674435,0.00093779917,0.00015264843],"about_ca_topic_score_codex":0.0000044007493,"about_ca_topic_score_gemma":6.80802e-7,"teacher_disagreement_score":0.03248217,"about_ca_system_score_codex":0.0000338805,"about_ca_system_score_gemma":0.000036900317,"threshold_uncertainty_score":0.43910748},"labels":[],"label_agreement":null},{"id":"W2062485877","doi":"10.1080/0740817x.2012.705452","title":"Solving a stochastic facility location/fleet management problem with logic-based Benders' decomposition","year":2013,"lang":"en","type":"article","venue":"IIE Transactions","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":"University of Toronto","funders":"","keywords":"Benders' decomposition; Decomposition; Facility location problem; Fleet management; Mathematical optimization; Computer science; Operations research; Engineering; Mathematics; Telecommunications","score_opus":0.013953868420819715,"score_gpt":0.2429219763353642,"score_spread":0.22896810791454447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062485877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033230418,0.000025038094,0.99338233,0.0002632935,0.00006554443,0.00065048155,0.000017463026,0.00073165493,0.0015411539],"genre_scores_gemma":[0.731225,0.0000023812431,0.26836517,0.000041668925,0.000007924788,0.00024763195,0.00002407988,0.00001950998,0.00006658593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991096,0.000047689504,0.00022283338,0.0002117116,0.00016052848,0.00024761521],"domain_scores_gemma":[0.9995063,0.00006703375,0.00002954016,0.0001956003,0.00011428741,0.000087216795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012598275,0.00016678055,0.00012724145,0.00013605457,0.0001966848,0.000075912845,0.00009409881,0.000062690866,0.00053374167],"category_scores_gemma":[0.000002818089,0.00016613265,0.0000410266,0.00038657937,0.000038473758,0.00025464167,0.0000022180884,0.00016084945,0.00012059728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069196785,0.00005087959,0.00001627793,0.000116569296,0.000056667726,7.747391e-7,0.00013718072,0.9928017,0.00039822212,0.0000616597,0.000057239562,0.006295882],"study_design_scores_gemma":[0.00059815584,0.0000397933,0.001482663,0.00006617533,0.000082946906,0.000006218634,0.00019598087,0.9962481,0.0006926262,0.0002838406,0.000050590465,0.00025289287],"about_ca_topic_score_codex":0.000034702534,"about_ca_topic_score_gemma":0.00003184181,"teacher_disagreement_score":0.727902,"about_ca_system_score_codex":0.00014292295,"about_ca_system_score_gemma":0.000020169817,"threshold_uncertainty_score":0.6774693},"labels":[],"label_agreement":null},{"id":"W2063718148","doi":"10.4067/s0718-33052009000300013","title":"MULTIPLE ANT COLONY SYSTEM FOR A VRP WITH TIME WINDOWS AND SCHEDULED LOADING","year":2009,"lang":"en","type":"article","venue":"Ingeniare. Revista chilena de ingeniería","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"Université de Montréal","funders":"Universidad Católica de la Santísima Concepción","keywords":"Computer science","score_opus":0.008246315451688555,"score_gpt":0.22502577299219015,"score_spread":0.2167794575405016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063718148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7516507,0.0023513644,0.24225,0.00011754399,0.00012360785,0.0014011635,0.000065433225,0.0013520098,0.00068820623],"genre_scores_gemma":[0.81662434,0.000039453265,0.18271792,0.000087103144,0.00025083445,0.00008495865,0.000022979055,0.000109310946,0.0000630854],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797827,0.000120944096,0.0005364307,0.0004715767,0.0002209751,0.0006718203],"domain_scores_gemma":[0.9987282,0.00029944567,0.0001520686,0.0004268935,0.00013983935,0.00025354273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008276589,0.00041735047,0.0005947697,0.00020099361,0.00030667696,0.00028858642,0.00025410255,0.00019976828,0.000010837952],"category_scores_gemma":[0.00031163316,0.00040680965,0.00010123043,0.0004010654,0.00005732333,0.00021145551,0.000037815065,0.00028186926,0.000013272286],"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.001190735,0.00028143922,0.022708844,0.005893867,0.001411344,0.00024531575,0.01006508,0.422452,0.45345706,0.002986717,0.00202557,0.077282056],"study_design_scores_gemma":[0.002924149,0.00034087032,0.0022155298,0.0011613221,0.00022803634,0.0002812274,0.00014116525,0.9635589,0.019251913,0.000030346224,0.008824309,0.0010422133],"about_ca_topic_score_codex":0.000004516334,"about_ca_topic_score_gemma":0.0000020280183,"teacher_disagreement_score":0.54110694,"about_ca_system_score_codex":0.00034531413,"about_ca_system_score_gemma":0.00006793915,"threshold_uncertainty_score":0.99983835},"labels":[],"label_agreement":null},{"id":"W2064035628","doi":"10.1287/opre.51.4.655.16098","title":"Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":193,"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é du Québec à Montréal; Université de Montréal","funders":"","keywords":"Neighbourhood (mathematics); Tabu search; Mathematical optimization; Fixed charge; Network planning and design; Metaheuristic; Flow network; Computer science; Simple (philosophy); Flow (mathematics); Multi-commodity flow problem; Mathematics","score_opus":0.12441746632498082,"score_gpt":0.37505291087653597,"score_spread":0.2506354445515552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064035628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005515533,0.00009806172,0.9904651,0.00024103042,0.00021902494,0.0010358577,0.000028786764,0.00026234772,0.0021342558],"genre_scores_gemma":[0.38130862,0.0000125964925,0.61766064,0.00004566898,0.0000958299,0.00040382057,0.000043311626,0.000060793827,0.00036874053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746144,0.0010176143,0.0002924229,0.0002496893,0.0003156968,0.0006631611],"domain_scores_gemma":[0.997775,0.0011341514,0.000009602235,0.00041395516,0.0005092947,0.00015799461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037525422,0.00015247599,0.00017561785,0.00018519291,0.00077746034,0.00022092332,0.00020612999,0.00013663704,0.00040526773],"category_scores_gemma":[0.0017379248,0.00016101787,0.00005745428,0.0008424799,0.00007368735,0.00016695722,0.000015292673,0.0004027746,0.0000939937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009134175,0.000042274136,0.00007439404,0.000022635322,0.000019187068,9.17448e-7,0.00010135939,0.98707694,0.0027531711,0.0040538386,0.005155132,0.00069101795],"study_design_scores_gemma":[0.0006465916,0.000051234816,0.00005007425,0.000015032765,0.0000061259498,0.0000013106239,0.000022027087,0.9808561,0.014160385,0.00020245426,0.0038146295,0.00017401489],"about_ca_topic_score_codex":0.000023253817,"about_ca_topic_score_gemma":0.000028543647,"teacher_disagreement_score":0.37579307,"about_ca_system_score_codex":0.00016725429,"about_ca_system_score_gemma":0.00017002206,"threshold_uncertainty_score":0.6566118},"labels":[],"label_agreement":null},{"id":"W2064073889","doi":"10.1007/bf02579017","title":"Tabu Search heuristics for the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"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":"Vehicle routing problem; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Set (abstract data type); Point (geometry); Routing (electronic design automation); Interval (graph theory); Metaheuristic; Mathematics","score_opus":0.024233844463323818,"score_gpt":0.2493872648064071,"score_spread":0.22515342034308328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064073889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031986177,0.00033132397,0.9502391,0.0008089262,0.00011873733,0.0009719498,0.000016616581,0.0008050103,0.014722111],"genre_scores_gemma":[0.7343801,0.000023395763,0.26047015,0.00010367796,0.00027138312,0.00006623803,0.0000053841936,0.000101517115,0.0045781685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992626,0.000034985256,0.00014727235,0.00012524807,0.00014222806,0.00028771773],"domain_scores_gemma":[0.99930596,0.00033667812,0.000021763877,0.00022651337,0.00006300286,0.00004610383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039526648,0.00010604446,0.00011055618,0.000027828999,0.00015106855,0.0000582756,0.00015696208,0.000046402474,0.00018138885],"category_scores_gemma":[0.00006134572,0.000077357414,0.000028124858,0.00020649836,0.000029619501,0.000057914134,0.000023813684,0.00015319258,0.00009006178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062077474,0.000013088542,0.00077082147,0.000041835076,0.000035812187,0.0000017648192,0.0008035445,0.9721953,0.00084284774,0.00032288724,0.0018600016,0.023105891],"study_design_scores_gemma":[0.00033224368,0.00003361114,0.00023960535,0.000017985662,0.000018340024,0.0000055884398,0.000039363378,0.99363494,0.0014964769,0.000021250611,0.004042822,0.00011778705],"about_ca_topic_score_codex":0.0000052126834,"about_ca_topic_score_gemma":0.0000010000678,"teacher_disagreement_score":0.70239395,"about_ca_system_score_codex":0.000036716552,"about_ca_system_score_gemma":0.000007290779,"threshold_uncertainty_score":0.31545436},"labels":[],"label_agreement":null},{"id":"W2064155562","doi":"10.1109/jproc.2011.2158181","title":"Dynamic Vehicle Routing for Robotic Systems","year":2011,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":222,"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":"Computer science; Robotics; Variety (cybernetics); Routing (electronic design automation); Queueing theory; Distributed computing; Process (computing); Service (business); Vehicle routing problem; Quality of service; Mathematical optimization; Robot; Operations research; Artificial intelligence; Computer network; Engineering","score_opus":0.02758031398550404,"score_gpt":0.24068281340754125,"score_spread":0.2131024994220372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064155562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8644464,0.00019031501,0.1224329,0.000046552566,0.0020022262,0.0008991036,0.000004620643,0.0005996985,0.009378201],"genre_scores_gemma":[0.9561261,0.0000045596457,0.04349413,0.000008125245,0.000038946688,0.000031531017,1.8611209e-7,0.000046325342,0.00025007877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928164,0.0000042649476,0.00025978906,0.000120044606,0.00011603009,0.00021820981],"domain_scores_gemma":[0.9995803,0.000042875603,0.00010613994,0.00009149273,0.00014501298,0.000034173325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040831615,0.000111158144,0.00016949486,0.000045207664,0.00007137437,0.000024878243,0.0003177385,0.00006599206,0.0000023504517],"category_scores_gemma":[0.00012029328,0.000091480215,0.00007435703,0.0001981154,0.000028567974,0.00012816214,0.000028534432,0.000096644966,0.0000028252393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003393582,0.00005756506,0.011053123,0.0018171164,0.00017246821,1.8352759e-7,0.003812344,0.7200807,0.25334015,0.00675919,0.0011162718,0.0017569921],"study_design_scores_gemma":[0.000184325,0.000017960332,0.0010684333,0.0001103068,0.000034587778,0.000004039343,0.00019204225,0.956552,0.041415654,0.00027877348,0.000024962565,0.00011690794],"about_ca_topic_score_codex":0.000008605955,"about_ca_topic_score_gemma":3.6585143e-7,"teacher_disagreement_score":0.23647134,"about_ca_system_score_codex":0.00005371203,"about_ca_system_score_gemma":0.0000070243977,"threshold_uncertainty_score":0.37304547},"labels":[],"label_agreement":null},{"id":"W2065109168","doi":"10.1007/s10288-006-0009-1","title":"An exact algorithm for team orienteering problems","year":2006,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":219,"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":"Orienteering; Vehicle routing problem; Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Operations research; Work (physics); Artificial intelligence; Mathematics; Engineering; Computer network","score_opus":0.010941555900898292,"score_gpt":0.2544370093960222,"score_spread":0.24349545349512391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065109168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009668559,0.00007010685,0.9866262,0.000009031806,0.00027430532,0.00023616654,0.000013710152,0.00067593646,0.0024259626],"genre_scores_gemma":[0.101093486,0.000003805939,0.89793646,0.000013324872,0.00035071833,0.000073036885,0.00003845947,0.0000684939,0.0004222315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994071,0.000013391071,0.000157053,0.00013193644,0.00007611054,0.00021438731],"domain_scores_gemma":[0.9997081,0.000031671385,0.000018662598,0.00016415952,0.000035400793,0.00004196636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020429684,0.000098073826,0.00010032638,0.000049661852,0.00005116448,0.00004037285,0.00009135233,0.00005285738,0.000020216376],"category_scores_gemma":[0.000013638947,0.000104423896,0.000032576016,0.000119228214,0.000008448051,0.00012747612,0.000007440984,0.000060190116,0.000008888351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.511787e-7,0.000025256093,0.0003116299,0.000043674772,0.000008379337,5.1533635e-7,0.00008591337,0.8910508,0.0057480233,0.00018675636,0.00091022643,0.101627946],"study_design_scores_gemma":[0.00025360176,0.000028094018,0.00036639065,0.000012006774,0.0000064491114,0.000002649645,0.00001393211,0.9738943,0.006445786,0.00015126374,0.018686755,0.00013876501],"about_ca_topic_score_codex":0.000014690233,"about_ca_topic_score_gemma":0.0000026683529,"teacher_disagreement_score":0.10148919,"about_ca_system_score_codex":0.000044366992,"about_ca_system_score_gemma":0.0000064739347,"threshold_uncertainty_score":0.42582828},"labels":[],"label_agreement":null},{"id":"W2065275668","doi":"10.1109/ictai.2006.34","title":"Ant Colony with Stochastic Local Search for the Quadratic Assignment Problem","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"University of Regina","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Ant colony optimization algorithms; Ant colony; Computer science; Quadratic equation; Local search (optimization); ANT; Quadratic programming; Mathematics; Combinatorial optimization; Computer network","score_opus":0.0709008042347709,"score_gpt":0.3054271221474704,"score_spread":0.2345263179126995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065275668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011583166,0.000014909066,0.9758209,0.0012239099,0.00020097909,0.0011798209,0.000028599934,0.00023887678,0.009708834],"genre_scores_gemma":[0.9722158,0.0000076226484,0.026533157,0.00006838402,0.00026402934,0.00054892944,0.00002565308,0.00005878693,0.00027764007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788636,0.00001626538,0.0005053803,0.000414013,0.00071705563,0.00046093683],"domain_scores_gemma":[0.99839616,0.00034623803,0.00013034334,0.00013142088,0.0009055643,0.0000902993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005659182,0.0003161005,0.0002386637,0.00017196171,0.0002512201,0.0006285136,0.00051272265,0.00009378924,0.0001518971],"category_scores_gemma":[0.00006996701,0.0002131605,0.000051229716,0.0003692768,0.00025799408,0.00032351894,0.000038027425,0.00035039955,0.000039350518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030236007,0.000084994695,0.000127668,0.000037388443,0.0000828514,0.0000017496568,0.0002849959,0.6926553,0.0010007598,0.28526428,0.0001367948,0.020020848],"study_design_scores_gemma":[0.00013880366,0.00051609863,0.000081956685,0.00018394657,0.00004125851,0.00001579453,0.001684952,0.9704519,0.019852716,0.006476485,0.00022046265,0.0003356314],"about_ca_topic_score_codex":0.000045740722,"about_ca_topic_score_gemma":0.000046626643,"teacher_disagreement_score":0.9606326,"about_ca_system_score_codex":0.0002481045,"about_ca_system_score_gemma":0.00013021307,"threshold_uncertainty_score":0.86924326},"labels":[],"label_agreement":null},{"id":"W2066066208","doi":"10.1007/s10732-013-9221-2","title":"A path relinking algorithm for a multi-depot periodic vehicle routing problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Benchmark (surveying); Vehicle routing problem; Mathematical optimization; Path (computing); Computer science; Homogeneous; Algorithm; Routing (electronic design automation); Mathematics","score_opus":0.02416431381556332,"score_gpt":0.2740220169103621,"score_spread":0.24985770309479877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066066208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022369584,0.00033996935,0.97632575,0.00006603748,0.00044774692,0.00024979757,0.0000071190466,0.00010413991,0.000089831585],"genre_scores_gemma":[0.15603466,0.000061567385,0.8433801,0.00004555031,0.0003479332,0.000009863676,0.0000016735643,0.00006388684,0.00005475993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985162,0.0000602786,0.0007678647,0.0001057054,0.00023229381,0.00031762943],"domain_scores_gemma":[0.998727,0.00020982085,0.0003018808,0.00013405064,0.00049491035,0.00013231834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007795549,0.00016367165,0.00030785232,0.00011702681,0.00012351578,0.00013651377,0.00019326208,0.00010487578,0.00002126047],"category_scores_gemma":[0.00045483655,0.0001533477,0.00012973747,0.0001611255,0.000023837953,0.00019016227,0.00002932328,0.0003677566,0.000010682108],"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.000017683356,0.00022956105,0.004856831,0.0006165637,0.00029248346,0.00008043641,0.003324204,0.4620448,0.012475832,0.00020825252,0.005658797,0.51019454],"study_design_scores_gemma":[0.0008591382,0.00009585451,0.00063641596,0.00016047135,0.000045055705,0.000091010785,0.00014280932,0.9962287,0.00056149194,0.00021233744,0.00079260656,0.0001741016],"about_ca_topic_score_codex":0.0000052002288,"about_ca_topic_score_gemma":4.1533855e-7,"teacher_disagreement_score":0.5341839,"about_ca_system_score_codex":0.000104688006,"about_ca_system_score_gemma":0.000053510463,"threshold_uncertainty_score":0.6253338},"labels":[],"label_agreement":null},{"id":"W2066086285","doi":"10.1287/trsc.1030.0056","title":"Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Emil Aaltosen Säätiö","keywords":"Vehicle routing problem; Heuristic; Benchmark (surveying); Pareto principle; Mathematical optimization; Set (abstract data type); Metaheuristic; Point (geometry); Routing (electronic design automation); Computer science; Interval (graph theory); Local search (optimization); Algorithm; Mathematics","score_opus":0.0132602200802881,"score_gpt":0.2520301703643327,"score_spread":0.23876995028404457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066086285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40345886,0.000022205839,0.59522957,0.000108926215,0.000036648224,0.00016146996,0.000008547915,0.00027117084,0.00070259447],"genre_scores_gemma":[0.6993262,0.000009007581,0.30053136,0.000020729709,0.000033754794,0.0000064568744,0.0000083385285,0.0000145226795,0.000049632145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987337,0.000023887946,0.00024679702,0.0002811087,0.00041328993,0.00030119935],"domain_scores_gemma":[0.99954194,0.000037194113,0.00003737911,0.0001255969,0.00013107252,0.00012679493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007404433,0.000120108896,0.000120438555,0.00011332133,0.00020952252,0.000084791456,0.00011745941,0.00004272021,0.000042224114],"category_scores_gemma":[0.000006815329,0.000113955524,0.00001391182,0.00076503254,0.00043581225,0.0007519018,0.0000036388094,0.00013943067,0.000019279772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065762774,0.000006806341,0.0069754487,0.000015836382,0.0000052608902,0.0000016227805,0.0011444127,0.87748104,0.0049848966,0.00040441414,0.00000449177,0.1089692],"study_design_scores_gemma":[0.00045465204,0.000031247175,0.021318605,0.000041008574,0.000012791558,0.000014405188,0.00024636718,0.96176505,0.015600466,0.00001719409,0.0003091231,0.0001890893],"about_ca_topic_score_codex":0.000016440328,"about_ca_topic_score_gemma":0.00001874969,"teacher_disagreement_score":0.29586735,"about_ca_system_score_codex":0.000075821925,"about_ca_system_score_gemma":0.00008055997,"threshold_uncertainty_score":0.46469715},"labels":[],"label_agreement":null},{"id":"W2066938616","doi":"10.1016/j.cor.2011.12.020","title":"The inventory-routing problem with transshipment","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":223,"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":"Transshipment (information security); Heuristics; Computer science; Routing (electronic design automation); Heuristic; Mathematical optimization; Vehicle routing problem; Operations research; Vendor; Mathematics; Artificial intelligence; Computer network; Business","score_opus":0.06979017429723672,"score_gpt":0.3511868917928779,"score_spread":0.28139671749564116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066938616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062593944,0.00050697394,0.93023455,0.0009336831,0.0003023884,0.00067895855,0.0000015344083,0.00031584184,0.0044320957],"genre_scores_gemma":[0.8431851,0.00004499146,0.15610555,0.000023376546,0.00018867235,0.00011046049,0.0000064373976,0.000036454116,0.0002989571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983196,0.0003595218,0.00019848385,0.00012792343,0.00041138995,0.000583084],"domain_scores_gemma":[0.99913305,0.00024723553,0.000006193519,0.00029067966,0.00017779008,0.00014505546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023934953,0.00010391326,0.00008633692,0.00010552596,0.0009079303,0.00029885868,0.00028559484,0.000042447457,0.000017307784],"category_scores_gemma":[0.00004038697,0.000073419564,0.00002380578,0.0005582574,0.000108431756,0.00024890093,0.000054361408,0.00039193712,0.000046522924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041684834,0.000029219596,0.0013796852,0.000019416655,0.000039404367,7.729826e-7,0.0030025246,0.9705636,0.00044811252,0.006649754,0.0013073608,0.016555993],"study_design_scores_gemma":[0.00023078412,0.000038807644,0.00068291184,0.000040904466,0.000004431152,0.000008355743,0.00033245055,0.9893927,0.0011531791,0.000017010647,0.007964102,0.00013438355],"about_ca_topic_score_codex":0.000015574635,"about_ca_topic_score_gemma":0.000031436768,"teacher_disagreement_score":0.7805912,"about_ca_system_score_codex":0.0001527745,"about_ca_system_score_gemma":0.000055062093,"threshold_uncertainty_score":0.6983158},"labels":[],"label_agreement":null},{"id":"W2067136846","doi":"10.1002/net.20471","title":"Cutting planes for branch‐and‐price algorithms","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Algorithm; Computer science; Cutting-plane method; Mathematical optimization; Mathematics; Integer programming","score_opus":0.028313248287365478,"score_gpt":0.24163975919374486,"score_spread":0.21332651090637939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067136846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005077,0.0005308903,0.98820305,0.000007745218,0.00043319236,0.00012701115,0.000001953772,0.00037207996,0.005247101],"genre_scores_gemma":[0.47417343,0.00009919937,0.5249508,0.000077390185,0.00048247658,0.000030409583,0.000009097786,0.00005734147,0.00011983904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994718,0.00001771488,0.00013497326,0.00011423164,0.000042106098,0.0002191877],"domain_scores_gemma":[0.99966115,0.00013769722,0.00002274174,0.00010372683,0.000022488111,0.000052182117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002503724,0.00009287934,0.000108997345,0.000027738111,0.00006019205,0.00001795972,0.000070002134,0.000091994305,0.000026894171],"category_scores_gemma":[0.000029612811,0.00009778143,0.000023754792,0.00008910058,0.000013631084,0.000061300445,0.000016670952,0.00010366221,0.0000026974308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009695559,0.000008279873,0.003209676,0.000059874055,0.000041440322,0.0000016135668,0.00075619644,0.7653989,0.000048593633,0.00055004033,0.0010654823,0.2288502],"study_design_scores_gemma":[0.00019561268,0.000012783694,0.0015821625,0.000017917528,0.000010520115,0.00000656966,0.00001433517,0.9955596,0.0001931171,0.00017187999,0.0021143155,0.00012121177],"about_ca_topic_score_codex":0.0000043724503,"about_ca_topic_score_gemma":8.4245374e-7,"teacher_disagreement_score":0.46909642,"about_ca_system_score_codex":0.000010309472,"about_ca_system_score_gemma":0.0000026526454,"threshold_uncertainty_score":0.3987411},"labels":[],"label_agreement":null},{"id":"W2068123526","doi":"10.1007/s10951-008-0072-x","title":"A comparison of five heuristics for the multiple depot vehicle scheduling problem","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":124,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Giro (Canada)","funders":"","keywords":"Heuristics; Column generation; Mathematical optimization; Tabu search; Scheduling (production processes); Computer science; Heuristic; Set (abstract data type); Job shop scheduling; Mathematics; Schedule","score_opus":0.05247880305225816,"score_gpt":0.31949700150722377,"score_spread":0.2670181984549656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068123526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43823433,0.0011171759,0.56016934,0.00006781455,0.00022226445,0.00012525078,0.000002581686,0.000029200335,0.00003201853],"genre_scores_gemma":[0.5402675,0.000077612305,0.45945615,0.0000095670175,0.00015567774,0.0000025923578,4.8197955e-7,0.000024067147,0.000006341884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.000051392857,0.000898475,0.00008887474,0.00028526306,0.00023015532],"domain_scores_gemma":[0.99768376,0.0011702038,0.00045949803,0.00015298386,0.00045331343,0.00008020899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088115863,0.00014051585,0.00039621873,0.00011221425,0.00019163423,0.000024477593,0.00027569482,0.000090163056,0.0000050631884],"category_scores_gemma":[0.0010116408,0.000111791196,0.00017043173,0.00024688864,0.00006185064,0.00014897925,0.000029853956,0.0004143817,0.0000013009287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003852585,0.000041323514,0.01391152,0.00009746661,0.0000960727,0.000003195708,0.0012957113,0.97136253,0.011205411,0.000039460014,0.000048830756,0.0018599242],"study_design_scores_gemma":[0.00085657224,0.00007532014,0.0012671353,0.00014657577,0.00006773813,0.00005554605,0.00068234204,0.9718888,0.024632612,0.00006584848,0.0001453653,0.00011618583],"about_ca_topic_score_codex":0.0000036783515,"about_ca_topic_score_gemma":0.0000015528539,"teacher_disagreement_score":0.10203318,"about_ca_system_score_codex":0.00005630381,"about_ca_system_score_gemma":0.00006797487,"threshold_uncertainty_score":0.45587125},"labels":[],"label_agreement":null},{"id":"W2068748054","doi":"10.1016/j.disopt.2011.05.002","title":"Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"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 Ottawa","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Matching (statistics); Integer (computer science); Graph; Constructive; Mathematical optimization; Discrete mathematics; Graph coloring; Computer science; Statistics","score_opus":0.05271715870122828,"score_gpt":0.27900776822092493,"score_spread":0.22629060951969665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068748054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035883848,0.00013529838,0.9603801,0.00002908441,0.00027137084,0.00025318906,0.000009183523,0.0003765376,0.002661397],"genre_scores_gemma":[0.6282443,0.000074192656,0.371456,0.000024177873,0.00004829127,0.000013332101,0.000037638638,0.00006570903,0.000036379213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987544,0.000108932894,0.00033413534,0.000260067,0.00015274767,0.00038975652],"domain_scores_gemma":[0.9994308,0.000074197684,0.00008597912,0.00021336057,0.000076679986,0.00011903116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038168253,0.00022267015,0.00020228662,0.00018731649,0.0003151978,0.00012065222,0.00012404336,0.00013024078,0.00016285504],"category_scores_gemma":[0.00010812444,0.00024203972,0.00004950493,0.00034356464,0.000051300194,0.0006269599,0.00006282007,0.00017930164,0.000006673576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008812529,0.000009882788,0.0007133554,0.000049358317,0.000028220815,0.00000231801,0.001660003,0.9954739,0.0006251348,0.0005663254,0.000014132662,0.00084851345],"study_design_scores_gemma":[0.00027104546,0.000011184008,0.0003237609,0.000109626664,0.00005105129,0.000010883935,0.00045996025,0.9973753,0.00097207195,0.00010533846,0.000020876243,0.00028887144],"about_ca_topic_score_codex":0.000114918425,"about_ca_topic_score_gemma":0.000014323525,"teacher_disagreement_score":0.59236044,"about_ca_system_score_codex":0.00010915653,"about_ca_system_score_gemma":0.000021732307,"threshold_uncertainty_score":0.98700935},"labels":[],"label_agreement":null},{"id":"W2069090104","doi":"10.1007/s10732-014-9262-1","title":"Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon","year":2014,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Workover; Heuristics; Heuristic; Mathematical optimization; Vehicle routing problem; Time horizon; Genetic algorithm; Routing (electronic design automation); Computer science; Variable neighborhood search; Deck; Marine engineering; Operations research; Engineering; Metaheuristic; Mathematics; Petroleum engineering; Computer network; Structural engineering","score_opus":0.010517163735105747,"score_gpt":0.23276165718691072,"score_spread":0.22224449345180497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069090104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039387763,0.00036149548,0.95947325,0.000093212104,0.00030416605,0.00018199418,0.000009053423,0.000042262887,0.00014677907],"genre_scores_gemma":[0.7212005,0.000051960527,0.27833134,0.0000368053,0.00030872575,0.0000031988827,6.9590243e-7,0.000045786383,0.000020938114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988599,0.00007184009,0.00046815054,0.00010333032,0.00024436475,0.00025242052],"domain_scores_gemma":[0.997764,0.001465125,0.00025686962,0.00016839837,0.00024745456,0.000098186094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000997803,0.00016813476,0.00026581893,0.00007178447,0.00014592115,0.00010043285,0.00015479988,0.00006724188,0.000002935824],"category_scores_gemma":[0.0007391563,0.00011126581,0.00006162788,0.00014390612,0.00005150622,0.000022238826,0.000029180112,0.0002831477,8.3586235e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004739274,0.00001834914,0.00036367003,0.00007420876,0.00006992709,0.000007871973,0.00018858549,0.9907059,0.00005274849,0.00023743899,0.00022504388,0.008008867],"study_design_scores_gemma":[0.0006892518,0.00038490014,0.00015937116,0.00012949035,0.00014949401,0.00018525403,0.000032743694,0.99411803,0.0001681436,0.00017095826,0.003662591,0.0001497734],"about_ca_topic_score_codex":7.906258e-7,"about_ca_topic_score_gemma":0.0000012513657,"teacher_disagreement_score":0.68181276,"about_ca_system_score_codex":0.00004702495,"about_ca_system_score_gemma":0.000026475936,"threshold_uncertainty_score":0.4537288},"labels":[],"label_agreement":null},{"id":"W2069736946","doi":"10.1007/s10288-013-0238-z","title":"A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration","year":2013,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"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":"TRIPS architecture; Vehicle routing problem; Duration (music); Column generation; Computer science; Set (abstract data type); Routing (electronic design automation); Mathematical optimization; Time complexity; Variable (mathematics); Algorithm; Mathematics; Parallel computing; Computer network","score_opus":0.011790345112066511,"score_gpt":0.22661559542183235,"score_spread":0.21482525030976585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069736946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051210616,0.00005507725,0.9462666,0.00069552293,0.000045876925,0.00087156275,0.0000025901586,0.00040763614,0.00044450827],"genre_scores_gemma":[0.07440457,0.000004355293,0.9244876,0.00015493575,0.000113075104,0.00006101099,0.0000061036617,0.000055050517,0.00071332516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991913,0.00004045445,0.00020695697,0.00018148073,0.00013094067,0.0002489034],"domain_scores_gemma":[0.99946946,0.00010197556,0.00004390033,0.00019553197,0.00006552569,0.0001235804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025707332,0.00014789571,0.00013424584,0.00005543892,0.00011173377,0.000154648,0.00010398037,0.00006159545,0.00008062124],"category_scores_gemma":[0.00006653072,0.00010653874,0.00001926038,0.00030230437,0.000015015493,0.00022471375,0.000036283942,0.00014147861,0.00014036532],"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.000014825771,0.000031877982,0.0016616759,0.000041742067,0.0001049079,0.000004608669,0.004588134,0.4235827,0.033072162,0.00005501843,0.002610543,0.5342318],"study_design_scores_gemma":[0.000564494,0.00004740663,0.006275844,0.000040032704,0.00001592698,0.00001089877,0.00007816911,0.9891842,0.0030802817,0.000014952584,0.0005166891,0.00017109873],"about_ca_topic_score_codex":0.000101533646,"about_ca_topic_score_gemma":0.000007636083,"teacher_disagreement_score":0.56560147,"about_ca_system_score_codex":0.000041233856,"about_ca_system_score_gemma":0.000020508445,"threshold_uncertainty_score":0.43445238},"labels":[],"label_agreement":null},{"id":"W2069850304","doi":"10.1007/s10732-005-5431-6","title":"Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows","year":2004,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":119,"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":"Vehicle routing problem; Benchmark (surveying); Evolutionary algorithm; Set (abstract data type); Computer science; Interval (graph theory); Point (geometry); Mathematical optimization; Routing (electronic design automation); Genetic algorithm; Algorithm; Mathematics; Combinatorics","score_opus":0.014545897641903893,"score_gpt":0.25012543441681245,"score_spread":0.23557953677490856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069850304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061269496,0.00043413276,0.9922119,0.00045011286,0.00021381892,0.00019740307,0.000009604633,0.000064045686,0.00029205228],"genre_scores_gemma":[0.23234792,0.000041442516,0.76694995,0.000050238483,0.00047128717,0.000004615996,0.0000016729313,0.000048940223,0.00008394536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907863,0.000027665317,0.00038739693,0.00006658102,0.00023720515,0.00020254805],"domain_scores_gemma":[0.9990209,0.00033598914,0.00017463532,0.00012207635,0.00028259598,0.0000638575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006042543,0.000113801034,0.00017579689,0.000056170444,0.0001393996,0.00004020792,0.00018234512,0.000051648938,0.000008747935],"category_scores_gemma":[0.00017706562,0.00007631243,0.000068452144,0.00017170593,0.000038589817,0.000110786554,0.000015509138,0.00025446943,0.0000056900303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022632696,0.000020988204,0.00020323067,0.000022775002,0.00007060078,0.0000105774725,0.00015855454,0.9953305,0.0003779161,0.00024371709,0.00069890195,0.0028395858],"study_design_scores_gemma":[0.0015422617,0.00024749426,0.001266884,0.00013465458,0.00012610083,0.00033737812,0.00008523654,0.9908339,0.000797107,0.0012068074,0.0032462734,0.00017591527],"about_ca_topic_score_codex":0.0000015470981,"about_ca_topic_score_gemma":3.5477333e-7,"teacher_disagreement_score":0.22622097,"about_ca_system_score_codex":0.0001340508,"about_ca_system_score_gemma":0.00009080511,"threshold_uncertainty_score":0.31119305},"labels":[],"label_agreement":null},{"id":"W206996077","doi":"10.1023/a:1012248319870","title":"High performing evolutionary techniques for solving complex location problems in industrial system design","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"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":"Crossover; Genetic algorithm; Computer science; Workstation; Mathematical optimization; Class (philosophy); Convergence (economics); Scheme (mathematics); Mathematics; Artificial intelligence; Machine learning; Operating system","score_opus":0.06924656915657545,"score_gpt":0.2756523450357274,"score_spread":0.20640577587915193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206996077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089542374,0.0001667577,0.9091022,0.000037526574,0.000473915,0.00046044306,9.682899e-7,0.00013780074,0.00007799074],"genre_scores_gemma":[0.7731727,0.00008593349,0.22626592,0.000007061243,0.00039736574,0.000017898676,0.0000028217519,0.000036312274,0.0000140303555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983214,0.00007539621,0.0009555719,0.00012263513,0.00023744059,0.00028755554],"domain_scores_gemma":[0.99907076,0.0002671455,0.00029962763,0.000119503464,0.00017129967,0.0000716379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015646353,0.00018102987,0.00031762436,0.00049907435,0.00008790989,0.000057188463,0.00021469049,0.0001443882,0.00001944026],"category_scores_gemma":[0.00013864931,0.000177112,0.00008680286,0.00019050202,0.000015568103,0.00035168315,0.000025332109,0.00036598396,0.000002205673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003935185,0.00001948282,0.00045026964,0.00016510783,0.00003237673,0.0000069058538,0.00020522298,0.96521884,0.0019891672,0.00003962465,0.00016370082,0.031669974],"study_design_scores_gemma":[0.000559323,0.00014304153,0.00066903536,0.0013269936,0.000035317542,0.00030571411,0.00047825294,0.71832895,0.276405,0.00018075798,0.0012762848,0.0002912964],"about_ca_topic_score_codex":0.000014373942,"about_ca_topic_score_gemma":0.0000020414925,"teacher_disagreement_score":0.6836303,"about_ca_system_score_codex":0.00084637816,"about_ca_system_score_gemma":0.000049733557,"threshold_uncertainty_score":0.72224176},"labels":[],"label_agreement":null},{"id":"W2069990196","doi":"10.1016/j.tre.2014.02.002","title":"Optimizing road network daily maintenance operations with stochastic service and travel times","year":2014,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Arc routing; Mathematical optimization; Stochastic programming; Computer science; Vehicle routing problem; Service (business); Routing (electronic design automation); Operations research; Flow network; Transport engineering; Engineering; Mathematics; Computer network","score_opus":0.05113434303327717,"score_gpt":0.3229365592133214,"score_spread":0.2718022161800442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069990196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005241392,0.008146586,0.9839826,0.0008650391,0.000073710384,0.000982208,0.000118678196,0.00018690067,0.00040287286],"genre_scores_gemma":[0.8379139,0.040249407,0.11908016,0.0007220865,0.0001298836,0.00034671067,0.0012780667,0.00011510348,0.00016472778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793947,0.00017144631,0.0006178166,0.00039038179,0.00042679324,0.0004541207],"domain_scores_gemma":[0.99871457,0.00025681575,0.00006127119,0.0002372737,0.0005045792,0.00022549818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001332142,0.0002586189,0.00044331266,0.00009545574,0.00031565264,0.000080382415,0.000121134784,0.000094181974,0.00007070068],"category_scores_gemma":[0.00006099022,0.00023264755,0.00003585018,0.0007041431,0.0001809622,0.00020072355,0.0000018285069,0.00037378844,0.00000878529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017735938,0.0000187269,0.00036820315,0.0021976505,0.000047470814,0.000006046128,0.000484793,0.97680944,0.000027173193,0.014915664,0.00033541914,0.0047716484],"study_design_scores_gemma":[0.0016062019,0.00023188838,0.058424044,0.005105147,0.00040073186,0.0000070395263,0.00026381132,0.9251015,0.000025784586,0.000700493,0.007307242,0.0008260832],"about_ca_topic_score_codex":0.0000870364,"about_ca_topic_score_gemma":0.0013403216,"teacher_disagreement_score":0.86490244,"about_ca_system_score_codex":0.000019013381,"about_ca_system_score_gemma":0.00004889765,"threshold_uncertainty_score":0.9487092},"labels":[],"label_agreement":null},{"id":"W2070134421","doi":"10.1016/j.disopt.2010.09.002","title":"Strengthening lattice-free cuts using non-negativity","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"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":"Mathematics; Negativity effect; Lattice (music); Algorithm; Cognitive psychology; Psychology; Physics","score_opus":0.013313346936846226,"score_gpt":0.2658952204674746,"score_spread":0.2525818735306284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070134421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10494244,0.000012428805,0.8870531,0.000038718474,0.0006417223,0.00018364539,0.000017246097,0.00041645815,0.006694266],"genre_scores_gemma":[0.385296,0.000008692391,0.61436874,0.000015905198,0.00013530925,0.000007107777,0.00003655844,0.00006977809,0.00006190988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881065,0.000057814723,0.00033311007,0.00025332693,0.0002258604,0.0003192316],"domain_scores_gemma":[0.99904203,0.00010494564,0.00009204416,0.0005437571,0.00010318103,0.00011403293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003803287,0.00022752552,0.00020340385,0.00014432122,0.0001739052,0.00012180242,0.0002672225,0.00017776119,0.00020264921],"category_scores_gemma":[0.0003743549,0.00024991995,0.00006347978,0.00044507044,0.000050383307,0.0005040528,0.00008008471,0.000371314,0.000009517537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035571927,0.000008318727,0.0008038559,0.000023472521,0.00001912487,0.000001168057,0.00024092369,0.98724955,0.010337116,0.00017995831,0.000063457934,0.0010695003],"study_design_scores_gemma":[0.0004028547,0.000008804565,0.00027233697,0.000025754463,0.000033252374,0.000006219895,0.00003992092,0.9914193,0.0072940877,0.00010414452,0.00010321988,0.0002900806],"about_ca_topic_score_codex":0.000018217215,"about_ca_topic_score_gemma":0.000012409378,"teacher_disagreement_score":0.28035355,"about_ca_system_score_codex":0.00004780588,"about_ca_system_score_gemma":0.000027329823,"threshold_uncertainty_score":0.9999953},"labels":[],"label_agreement":null},{"id":"W2070349606","doi":"10.1016/j.dam.2011.05.014","title":"The periodic capacitated arc routing problem with irregular services","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"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; Transport Canada","funders":"","keywords":"Arc routing; Heuristic; Arc (geometry); Routing (electronic design automation); Hierarchy; Time horizon; Mathematics; Cover (algebra); Set (abstract data type); Mathematical optimization; Vehicle routing problem; Computer science; Computer network; Engineering","score_opus":0.014794452863391894,"score_gpt":0.21091339920184088,"score_spread":0.19611894633844898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070349606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13368769,0.00017939569,0.7131158,0.000044295997,0.000102325415,0.0011304441,0.000010858444,0.0016497419,0.15007941],"genre_scores_gemma":[0.48107988,0.00001841983,0.51861966,0.000016679782,0.000022571212,0.000083171,0.000007692389,0.000086879,0.000065059234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880683,0.000019665054,0.00036045557,0.00017916625,0.00024408607,0.00038977657],"domain_scores_gemma":[0.9991836,0.00010338553,0.00011636393,0.0004651302,0.000052005904,0.000079502155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046230774,0.00024821857,0.00022736764,0.000041605566,0.00028019206,0.00011664056,0.0003323549,0.00007630418,0.000029788092],"category_scores_gemma":[0.000008107505,0.00016359372,0.000039140406,0.00027189782,0.00010559358,0.00008270726,0.0000486944,0.00019594151,0.00003972749],"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.00012270876,0.00022980002,0.00081923616,0.005036656,0.0012744088,0.00003159194,0.23773219,0.15455,0.03063909,0.5419831,0.00026049887,0.02732071],"study_design_scores_gemma":[0.0009634386,0.00006623276,0.00031243073,0.00035688793,0.00020905622,0.000044465593,0.01831337,0.93744314,0.020405916,0.020024836,0.00080897694,0.0010512389],"about_ca_topic_score_codex":0.0000056752165,"about_ca_topic_score_gemma":0.000010504765,"teacher_disagreement_score":0.7828931,"about_ca_system_score_codex":0.00003364894,"about_ca_system_score_gemma":0.000014134126,"threshold_uncertainty_score":0.66711587},"labels":[],"label_agreement":null},{"id":"W2070595290","doi":"10.1016/j.cor.2009.09.014","title":"Solving a rich vehicle routing and inventory problem using column generation","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"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":"Vehicle routing problem; Column generation; Computer science; Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Column (typography); Production (economics); Work (physics); Sequence (biology); Construct (python library); Operations research; Mathematics; Economics; Engineering","score_opus":0.0986991988754276,"score_gpt":0.36455434726329644,"score_spread":0.26585514838786883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070595290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5303719,0.00018615324,0.46818796,0.00019283965,0.00010920796,0.0003206382,0.0000011358825,0.00019164618,0.00043852875],"genre_scores_gemma":[0.71110284,0.000024425683,0.28850484,0.000054118056,0.00021265101,0.000011607799,0.000009613426,0.000022963926,0.000056913694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830246,0.0003496076,0.0003046195,0.00028878372,0.000333893,0.00042066345],"domain_scores_gemma":[0.9992529,0.00007786851,0.00001308689,0.0002388784,0.00029072256,0.00012653058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014787423,0.00013129634,0.00014909382,0.0003062949,0.00078206067,0.00054533273,0.00016764768,0.00009046993,0.000012681829],"category_scores_gemma":[0.00011023532,0.00015500032,0.000023879413,0.0007284229,0.000059105376,0.00039881302,0.00008387108,0.0003769668,0.000008551506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012071796,0.000017037302,0.0004666933,0.000014665975,0.000011227037,0.0000028257568,0.0012126833,0.9354874,0.051013052,0.0007255323,0.00043072217,0.010616954],"study_design_scores_gemma":[0.00024451583,0.000045510045,0.0007115731,0.00004763928,0.00000487546,0.000010875479,0.00008639994,0.9962073,0.0023666602,0.000039075036,0.00007899207,0.00015656951],"about_ca_topic_score_codex":0.00003777663,"about_ca_topic_score_gemma":0.000022812517,"teacher_disagreement_score":0.18073097,"about_ca_system_score_codex":0.00023664063,"about_ca_system_score_gemma":0.000084458945,"threshold_uncertainty_score":0.632073},"labels":[],"label_agreement":null},{"id":"W2070637511","doi":"10.1007/s10489-006-6926-z","title":"Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows","year":2006,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":510,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Benchmark (surveying); Computer science; Set (abstract data type); Pareto principle; Mathematical optimization; Genetic algorithm; Extension (predicate logic); Ranking (information retrieval); Multi-objective optimization; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","score_opus":0.015973005086232974,"score_gpt":0.2513967951754557,"score_spread":0.23542379008922273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070637511","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009020726,0.00007527585,0.98508793,0.000011034828,0.00005149195,0.00095362775,0.00000978617,0.0005864311,0.004203681],"genre_scores_gemma":[0.38021117,0.0000037062337,0.61920893,0.000020724858,0.00009089439,0.0001916718,0.0000104158535,0.000070211914,0.00019227552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986377,0.000021907448,0.0003616456,0.0003644883,0.00016568096,0.0004485732],"domain_scores_gemma":[0.9993222,0.00018767358,0.000074866206,0.0002523577,0.00010092844,0.00006199565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027266258,0.00024985484,0.00023231478,0.000078319186,0.00012940925,0.00006181784,0.00022033561,0.00010409299,0.000031762254],"category_scores_gemma":[0.000017667116,0.00024349896,0.000045704197,0.00037231142,0.00006199177,0.00007557638,0.000031508804,0.00016838674,0.00010082183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015077581,0.00003227991,0.00022391965,0.000033882257,0.000027667502,0.0000014538033,0.00025123014,0.9470985,0.01742842,0.0005005853,0.000061591614,0.03432541],"study_design_scores_gemma":[0.0002595725,0.000044897562,0.00063706125,0.000026234946,0.000022477576,0.000006240626,0.00007919167,0.89111793,0.10676388,0.0005045849,0.00021107298,0.00032688404],"about_ca_topic_score_codex":0.000031963897,"about_ca_topic_score_gemma":0.00000817078,"teacher_disagreement_score":0.37119043,"about_ca_system_score_codex":0.00010141712,"about_ca_system_score_gemma":0.000026277503,"threshold_uncertainty_score":0.9929599},"labels":[],"label_agreement":null},{"id":"W2070737448","doi":"10.1111/j.1475-3995.2010.00763.x","title":"Exact solution of emerging quadratic assignment problems","year":2010,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"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":"Université de Versailles Saint-Quentin-en-Yvelines; University of Waterloo; Naif Arab University for Security Sciences; U.S. Department of State; National Science Foundation","keywords":"Computer science; Class (philosophy); Quadratic assignment problem; Mathematical optimization; Taxonomy (biology); Management science; Operations research; Optimization problem; Artificial intelligence; Mathematics; Algorithm; Economics","score_opus":0.06427506739875978,"score_gpt":0.3943551422188767,"score_spread":0.3300800748201169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070737448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078269996,0.00003621814,0.9051372,0.0013570202,0.0012244742,0.00038019972,0.000030829837,0.00009092986,0.013473141],"genre_scores_gemma":[0.9585921,0.00006258627,0.04047216,0.000009222258,0.00009578025,0.0001317406,0.000026777812,0.000023815724,0.000585798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981082,0.00012934294,0.0004550907,0.00018926512,0.00088149594,0.00023657945],"domain_scores_gemma":[0.9989644,0.00035085453,0.00002534551,0.00016490502,0.00043700932,0.00005747636],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001773609,0.00010188614,0.00011560254,0.00062366767,0.000119907025,0.00006559038,0.00027216627,0.00010072054,0.0020643063],"category_scores_gemma":[0.00019899872,0.00011175809,0.00004876811,0.00051037094,0.00009999521,0.0003663562,0.000011101898,0.00074503076,0.000029343224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008730678,0.00010873397,0.0006538802,0.000026314658,0.000033450593,0.0000012016998,0.0004369305,0.8675827,0.11968599,0.003174732,0.000059996295,0.008227348],"study_design_scores_gemma":[0.000383932,0.000023352017,0.0021915177,0.000047640948,0.0000028226502,0.000009719566,0.00011671412,0.9751038,0.018903496,0.00063849764,0.002456555,0.00012193824],"about_ca_topic_score_codex":0.0000902998,"about_ca_topic_score_gemma":0.00027363896,"teacher_disagreement_score":0.8803221,"about_ca_system_score_codex":0.00020311167,"about_ca_system_score_gemma":0.00012103443,"threshold_uncertainty_score":0.99884796},"labels":[],"label_agreement":null},{"id":"W2070782744","doi":"10.1287/trsc.35.2.192.10134","title":"Deliveries in an Inventory/Routing Problem Using Stochastic Dynamic Programming","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamic programming; Product (mathematics); Operations research; Computer science; Routing (electronic design automation); Stochastic programming; Mathematical optimization; Point (geometry); Vehicle routing problem; Process (computing); Operations management; Engineering; Mathematics; Computer network","score_opus":0.03205989915677017,"score_gpt":0.31410429240534504,"score_spread":0.2820443932485749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070782744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5715195,0.000013934128,0.42807037,0.00000469162,0.00005692976,0.00012871221,8.8680605e-7,0.00017197033,0.000032987387],"genre_scores_gemma":[0.81408614,0.000002966645,0.18585628,0.000007848591,0.000007907536,0.000010277451,0.000006688552,0.000017734399,0.0000041646167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987268,0.000025637557,0.00032954407,0.00025738555,0.00030741777,0.00035323194],"domain_scores_gemma":[0.9995936,0.00002000522,0.00005270175,0.00013954216,0.000100117366,0.00009400604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007714935,0.000117606905,0.00011572557,0.0002738404,0.00015244949,0.000088118424,0.00020404642,0.00003921718,0.000012942523],"category_scores_gemma":[0.000027876997,0.00013573495,0.000018884562,0.001561387,0.00015123392,0.001036957,0.0000031901,0.00011712017,0.00000217717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030968067,0.000011876567,0.02470156,0.000015136204,0.0000010432716,0.000004445045,0.0031382605,0.9546834,0.008824826,0.00016173099,4.4946432e-8,0.008454545],"study_design_scores_gemma":[0.00017215185,0.0000149994585,0.03500145,0.000052949756,0.000006032474,0.0000036754248,0.0005447089,0.96373856,0.00022657374,0.000074506584,0.0000055493956,0.00015887208],"about_ca_topic_score_codex":0.00004953309,"about_ca_topic_score_gemma":0.00037939046,"teacher_disagreement_score":0.24256663,"about_ca_system_score_codex":0.00015568938,"about_ca_system_score_gemma":0.00007437539,"threshold_uncertainty_score":0.553511},"labels":[],"label_agreement":null},{"id":"W2070890709","doi":"10.1007/s10878-007-9109-x","title":"An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Iran National Science Foundation","keywords":"Arc routing; Subgradient method; Theory of computation; Mathematical optimization; Linear programming relaxation; Integer programming; Mathematics; Context (archaeology); Relaxation (psychology); Extension (predicate logic); Lagrangian relaxation; Algorithm; Linear programming; Branch and cut; Computer science; Routing (electronic design automation)","score_opus":0.015020409437286941,"score_gpt":0.2665742300886776,"score_spread":0.25155382065139065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070890709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09264158,0.0000313686,0.90304184,0.000013744424,0.0038243013,0.0003258294,0.0000051350007,0.000027206317,0.00008901257],"genre_scores_gemma":[0.5733537,0.000011583956,0.42589125,0.0000028340617,0.0007024083,0.000001100627,0.0000039286806,0.000030779,0.0000024259948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981234,0.00011632417,0.0011539994,0.00010217337,0.0003190249,0.00018508309],"domain_scores_gemma":[0.99698734,0.00028542642,0.0011590254,0.00018652162,0.0013125587,0.000069101974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795251,0.00013706415,0.00032259553,0.000224865,0.000110120236,0.00002640782,0.0001620752,0.00015439643,0.000008090428],"category_scores_gemma":[0.00078998297,0.000117820666,0.00013525084,0.00053559185,0.000043719454,0.00041185674,0.000016541284,0.0002134623,6.658638e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050817114,0.000075532254,0.00011448822,0.000047336704,0.000034819393,0.000006064998,0.0011677834,0.9805858,0.007410305,0.0006593871,0.000027903925,0.00981973],"study_design_scores_gemma":[0.0016408209,0.00024649868,0.00015613688,0.00017253059,0.00007720055,0.00013987234,0.00026484704,0.973718,0.022662282,0.00079180265,0.000015307447,0.000114739734],"about_ca_topic_score_codex":0.000008988626,"about_ca_topic_score_gemma":0.0000015432414,"teacher_disagreement_score":0.48071212,"about_ca_system_score_codex":0.00013899167,"about_ca_system_score_gemma":0.00006739046,"threshold_uncertainty_score":0.48045874},"labels":[],"label_agreement":null},{"id":"W2072209462","doi":"10.1103/physreve.63.047103","title":"Critical transition in the constrained traveling salesman problem","year":2001,"lang":"en","type":"article","venue":"Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics","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":"University of Lethbridge","funders":"","keywords":"Travelling salesman problem; Scaling; Bottleneck traveling salesman problem; Function (biology); Combinatorics; Mathematical optimization; Physics; Mathematics; Statistical physics; Computer science; Biology; Geometry","score_opus":0.014523782319159488,"score_gpt":0.3232170729763605,"score_spread":0.308693290657201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072209462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046144374,0.0042969785,0.90187943,0.008949996,0.0007549294,0.0016032511,0.00017942427,0.0005430958,0.03564851],"genre_scores_gemma":[0.976218,0.0043351944,0.018279811,0.00035570737,0.0004556871,0.000068994515,0.00017215397,0.00006807338,0.000046408022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783236,0.00032079106,0.0006997398,0.00039963645,0.00029164678,0.00045579983],"domain_scores_gemma":[0.9985729,0.00089512795,0.000043351327,0.0002637422,0.000074652875,0.0001502106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045321448,0.0003440586,0.00058635,0.000039278853,0.00018692491,0.000070586975,0.00021834124,0.000116301555,0.000043506916],"category_scores_gemma":[0.00017674579,0.00026996885,0.00012966504,0.00032281052,0.00039255267,0.00023483689,0.00007617887,0.0008560508,0.00003258966],"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.00013248743,0.0015692618,0.00028044154,0.0066479556,0.0003165505,0.0005227347,0.0166947,0.043521136,0.0020240399,0.6822558,0.0051665804,0.2408683],"study_design_scores_gemma":[0.0006428562,0.00020592086,0.00071662717,0.0015005828,0.00020842,0.00013198853,0.00030871583,0.764422,0.000077209814,0.23078552,0.0004953442,0.0005047918],"about_ca_topic_score_codex":0.000002607394,"about_ca_topic_score_gemma":0.0000024997753,"teacher_disagreement_score":0.9300736,"about_ca_system_score_codex":0.000057773108,"about_ca_system_score_gemma":0.000022390708,"threshold_uncertainty_score":0.99997526},"labels":[],"label_agreement":null},{"id":"W2074019423","doi":"10.1016/j.ejor.2010.02.022","title":"A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":156,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Science and Engineering Research Board","keywords":"Variable neighborhood search; Heuristics; Variable (mathematics); Mathematical optimization; PlanetLab; Computer science; Descent (aeronautics); Local search (optimization); Mathematics; Metaheuristic","score_opus":0.0700874788475297,"score_gpt":0.33205587870339404,"score_spread":0.26196839985586434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074019423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15574953,0.00015776351,0.8089276,0.005450806,0.00095898745,0.00083235325,0.000022588134,0.000087637345,0.027812727],"genre_scores_gemma":[0.6901949,0.000017865985,0.30809945,0.00005957862,0.0010840639,0.000009623862,0.00001738238,0.0000670511,0.00045009676],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972634,0.0007830662,0.0005469391,0.00014535295,0.00086017075,0.00040107794],"domain_scores_gemma":[0.99652034,0.0008403948,0.0000659669,0.00021102464,0.0021945012,0.00016776226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013851076,0.000120651945,0.00014154184,0.00026110196,0.00044995185,0.00039841892,0.00053350045,0.000043581913,0.00017670525],"category_scores_gemma":[0.0014447523,0.000090759546,0.00006194993,0.00054872537,0.000116984214,0.00036830388,0.00005914099,0.0010986726,0.000021203377],"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.00003728985,0.00006205849,0.00014197762,0.00003514013,0.00007016055,0.0000094479665,0.0011088022,0.46623495,0.50707775,0.013537091,0.004023399,0.007661929],"study_design_scores_gemma":[0.0012125422,0.00039983023,0.0014308683,0.00007959153,0.000016554935,0.00015212604,0.0002732698,0.9564787,0.023802388,0.0008387924,0.015088588,0.00022675804],"about_ca_topic_score_codex":0.000003115999,"about_ca_topic_score_gemma":0.000003970088,"teacher_disagreement_score":0.53444535,"about_ca_system_score_codex":0.00009670507,"about_ca_system_score_gemma":0.00031022285,"threshold_uncertainty_score":0.48005342},"labels":[],"label_agreement":null},{"id":"W2074030523","doi":"10.1007/s11590-014-0788-9","title":"A general variable neighborhood search variants for the travelling salesman problem with draft limits","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"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":"Travelling salesman problem; Traveling purchaser problem; Variable neighborhood search; Descent (aeronautics); 2-opt; Mathematical optimization; Computational intelligence; Variable (mathematics); Set (abstract data type); Computer science; Limit (mathematics); Extension (predicate logic); Bottleneck traveling salesman problem; Context (archaeology); Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.012782624187917832,"score_gpt":0.22573323936400003,"score_spread":0.2129506151760822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074030523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008112057,0.000019316229,0.99470145,0.0014118339,0.00017941746,0.00063566107,0.00000781512,0.00034517178,0.0018881493],"genre_scores_gemma":[0.054074608,0.000022793116,0.9441194,0.0010020552,0.00029427334,0.000118712574,0.000054928998,0.00012612304,0.00018712405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864703,0.00012282736,0.00028585215,0.00028673126,0.00023039134,0.00042718215],"domain_scores_gemma":[0.99903405,0.00037031362,0.00006036071,0.0003327555,0.000118505755,0.00008403919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007428374,0.00022359999,0.0001940331,0.00010384999,0.00028707995,0.00018409392,0.00025635434,0.000089290814,0.00005591437],"category_scores_gemma":[0.00005358359,0.00017736627,0.000044856737,0.0004669531,0.00004568898,0.00021794913,0.000016409342,0.00018799218,0.0000057168604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001630301,0.000012148931,0.0001445841,0.00005069359,0.0000691245,4.0300768e-7,0.00026824675,0.9932187,0.0021387665,0.0020441506,0.00043765112,0.0015991792],"study_design_scores_gemma":[0.00080230366,0.000039052757,0.00010431412,0.000035819186,0.00005534663,0.0000076101082,0.000016872704,0.99729985,0.0005616079,0.00002692202,0.00080069737,0.00024962542],"about_ca_topic_score_codex":0.0000067343326,"about_ca_topic_score_gemma":0.0000013033357,"teacher_disagreement_score":0.053263403,"about_ca_system_score_codex":0.000060334816,"about_ca_system_score_gemma":0.000029990873,"threshold_uncertainty_score":0.72327864},"labels":[],"label_agreement":null},{"id":"W2074193675","doi":"10.3138/infor.51.1.23","title":"Solution Methods for Fuel Supply of Trains","year":2013,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Truck; Tabu search; Computer science; Metaheuristic; Train; Mathematical optimization; Flexibility (engineering); Flow network; Linear programming; Assignment problem; Operations research; Engineering; Automotive engineering; Algorithm; Mathematics","score_opus":0.07749217862021154,"score_gpt":0.40279004517663813,"score_spread":0.32529786655642656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074193675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007126429,0.00030733363,0.98191595,0.00018171922,0.0002301988,0.001428803,0.00005975569,0.00007530783,0.008674498],"genre_scores_gemma":[0.7335241,0.00011148507,0.26501313,0.000042240106,0.00009370789,0.0007303436,0.00017067594,0.000015030543,0.00029929983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866277,0.00011626904,0.0005961338,0.0000630031,0.0003353104,0.00022650046],"domain_scores_gemma":[0.9979536,0.0005255647,0.00005246462,0.000119897806,0.0012654406,0.00008302405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029865624,0.000086552565,0.00015375567,0.00033109647,0.00015191131,0.0002768021,0.0001033877,0.00010403582,0.00005025541],"category_scores_gemma":[0.0005488265,0.00007904605,0.00003234657,0.0002699601,0.00006105155,0.001786747,0.000027723156,0.00012702537,0.000032182517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000398266,0.000026348453,0.0009239711,0.0036651038,0.00013005377,6.273982e-8,0.008341622,0.5376624,0.009455745,0.14691275,0.017630838,0.27521127],"study_design_scores_gemma":[0.00038327073,0.000046096655,0.0015117602,0.00003320647,0.0000020968196,0.0000045106867,0.0006570374,0.94810814,0.00079210027,0.00018723057,0.048184477,0.00009008243],"about_ca_topic_score_codex":0.00012507122,"about_ca_topic_score_gemma":0.0000018203561,"teacher_disagreement_score":0.72639763,"about_ca_system_score_codex":0.00006306153,"about_ca_system_score_gemma":0.00007983386,"threshold_uncertainty_score":0.32234043},"labels":[],"label_agreement":null},{"id":"W2074413296","doi":"10.1002/net.21587","title":"Timing problems and algorithms: Time decisions for sequences of activities","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"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é du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Concatenation (mathematics); Vehicle routing problem; Inference; Combinatorial optimization; Algorithm; Mathematical optimization; Routing (electronic design automation); Artificial intelligence; Mathematics","score_opus":0.06351391128462434,"score_gpt":0.2892708729540661,"score_spread":0.22575696166944176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074413296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022692302,0.00090562226,0.97518736,0.000018533721,0.00015396431,0.00015091545,0.000004923695,0.00012977365,0.000756631],"genre_scores_gemma":[0.36861485,0.000110341905,0.6308483,0.000014029021,0.00016296488,0.000031493,0.000008750154,0.000034979053,0.0001742776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953896,0.000026287084,0.00014292088,0.00008492677,0.00007389356,0.00013302642],"domain_scores_gemma":[0.99938256,0.00039769674,0.000032319567,0.00008610338,0.00004496848,0.00005633849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042337703,0.00007209419,0.00013927241,0.00003694257,0.000030426432,0.00001947136,0.000058139332,0.00006936606,0.000005729735],"category_scores_gemma":[0.000093445095,0.000070036425,0.000020199384,0.00009172564,0.000032849435,0.00009573996,0.000019477677,0.00006302635,7.892072e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023122914,0.0000028214188,0.00007939279,0.000010550718,0.000009947929,1.4543679e-7,0.0002799333,0.9589606,0.00023015359,0.000021354976,0.0006466542,0.039756153],"study_design_scores_gemma":[0.0001763871,0.00002831869,0.000024395606,0.000056132467,0.000010312781,0.0000029979885,0.0000623053,0.99797314,0.0004968798,0.00028812967,0.00080464274,0.000076382385],"about_ca_topic_score_codex":0.0000025507447,"about_ca_topic_score_gemma":0.000001031591,"teacher_disagreement_score":0.34592256,"about_ca_system_score_codex":0.00001815962,"about_ca_system_score_gemma":0.000011103411,"threshold_uncertainty_score":0.28560027},"labels":[],"label_agreement":null},{"id":"W2075642749","doi":"10.1504/ijenm.2009.032395","title":"Saving based algorithm for multi-depot version of vehicle routing problem with simultaneous pickup and delivery","year":2009,"lang":"en","type":"article","venue":"International Journal of Enterprise Network Management","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":"McMaster University","funders":"","keywords":"Pickup; Depot; Vehicle routing problem; Computer science; Algorithm; Routing (electronic design automation); Mathematical optimization; Simulation; Computer network; Mathematics; Artificial intelligence; Geography","score_opus":0.00911554741619326,"score_gpt":0.24856055401140728,"score_spread":0.23944500659521403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075642749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028540865,0.00023817475,0.9703469,0.00007977969,0.0003118498,0.00021663138,0.0000051578827,0.000038797207,0.00022182222],"genre_scores_gemma":[0.4817639,0.00009294067,0.5179253,0.000074247306,0.00010742304,0.0000016909178,0.0000031465884,0.000013929908,0.000017420607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.000037067937,0.0004747309,0.00012091287,0.00033422175,0.00017900439],"domain_scores_gemma":[0.9991052,0.00017108422,0.0002773031,0.00008198953,0.00030406629,0.000060348706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004535833,0.00013669723,0.00019555901,0.00015788616,0.000043001353,0.000051399056,0.00023066433,0.000036666683,0.0000069157545],"category_scores_gemma":[0.000020640457,0.00012762929,0.0000742837,0.00010516303,0.000017945471,0.00015184576,0.000039811544,0.000115988114,4.103204e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011835791,0.00005226674,0.00070320873,0.00002296872,0.00017129687,0.00004623265,0.000070220754,0.7335411,0.00011128074,0.00002625538,0.000113174065,0.26502368],"study_design_scores_gemma":[0.002161358,0.00021397509,0.0010629426,0.0005685739,0.000071594455,0.000019196987,0.000061122104,0.9949149,0.00024111464,0.000044683908,0.00052153383,0.00011902256],"about_ca_topic_score_codex":0.0000019288134,"about_ca_topic_score_gemma":0.0000013383761,"teacher_disagreement_score":0.45322305,"about_ca_system_score_codex":0.00011863122,"about_ca_system_score_gemma":0.0000118498165,"threshold_uncertainty_score":0.52045715},"labels":[],"label_agreement":null},{"id":"W2076332856","doi":"10.1016/j.tre.2013.06.001","title":"An heuristic search for the routing of heterogeneous trucks with single and double container loads","year":2013,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":67,"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":"Truck; Container (type theory); Metaheuristic; Routing (electronic design automation); Computer science; Heuristic; Port (circuit theory); Vehicle routing problem; Mathematical optimization; Operations research; Engineering; Computer network; Algorithm; Mathematics; Automotive engineering; Artificial intelligence","score_opus":0.09280986466183076,"score_gpt":0.3560358834065543,"score_spread":0.2632260187447235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076332856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1820315,0.016736863,0.7960624,0.0005192876,0.000071892224,0.0040572775,0.00025620725,0.00015484598,0.000109722154],"genre_scores_gemma":[0.9775578,0.0124371275,0.009250665,0.000055319597,0.000027343205,0.00032392505,0.00028086727,0.000043642194,0.000023355713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983567,0.00009869521,0.00058072363,0.00026560907,0.00037296498,0.00032529182],"domain_scores_gemma":[0.9983182,0.0005713561,0.00007891518,0.00023176742,0.0006536352,0.00014610594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010754435,0.00017509508,0.00033358022,0.00007920459,0.00019283935,0.00006412791,0.00012411825,0.00006944665,0.00006960062],"category_scores_gemma":[0.00002568781,0.00012797426,0.0000438441,0.0003237614,0.00026084023,0.00015109537,0.0000011116223,0.00020928707,0.000001234963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035171848,0.00032254247,0.041769043,0.024632638,0.0004875116,0.000027425694,0.0035612732,0.817708,0.003389883,0.033457942,0.00039810574,0.07389389],"study_design_scores_gemma":[0.009940036,0.0034751676,0.24176478,0.0068363603,0.0017121093,0.000023351815,0.0021190678,0.7075835,0.011425719,0.0015919318,0.01139569,0.0021323082],"about_ca_topic_score_codex":0.00021451108,"about_ca_topic_score_gemma":0.00032567192,"teacher_disagreement_score":0.79552627,"about_ca_system_score_codex":0.000014809189,"about_ca_system_score_gemma":0.000036073645,"threshold_uncertainty_score":0.5218639},"labels":[],"label_agreement":null},{"id":"W2076697001","doi":"10.1007/s10732-010-9127-1","title":"On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices","year":2010,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Heuristics; Travelling salesman problem; Heuristic; Asymptotically optimal algorithm; Mathematics; Combinatorics; Mathematical optimization; Applied mathematics; Discrete mathematics; Computer science","score_opus":0.013308526026506036,"score_gpt":0.2593656246455304,"score_spread":0.2460570986190244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076697001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808428,0.00010327663,0.017089458,0.00022204535,0.0010897168,0.0001445623,0.0000109378325,0.000029028817,0.00046817257],"genre_scores_gemma":[0.9818636,0.00009973625,0.017660854,0.00006286329,0.00024102918,0.0000024589663,7.9308717e-7,0.000048396272,0.000020256424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982691,0.00017429538,0.00076052226,0.00009347738,0.00046457324,0.0002380313],"domain_scores_gemma":[0.99685216,0.0021577412,0.00040216962,0.00032337825,0.00019803038,0.000066528504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015979352,0.0001826692,0.00029628226,0.00021288396,0.000109835295,0.000067890855,0.00047303957,0.000113238646,0.000039421317],"category_scores_gemma":[0.002178088,0.00011431721,0.00010788561,0.00031444253,0.00006348291,0.000064647014,0.000038243594,0.0014085333,0.000004609516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073321964,0.00033479944,0.023290262,0.00013725091,0.000093709416,0.00018329686,0.0021106233,0.9486289,0.012257082,0.006122363,0.0017144592,0.005053955],"study_design_scores_gemma":[0.0012852977,0.00048154508,0.11114226,0.0006118427,0.0003683726,0.00028253265,0.0007119377,0.87284756,0.009046223,0.0021321569,0.00051553245,0.0005747458],"about_ca_topic_score_codex":0.000008771072,"about_ca_topic_score_gemma":0.0000103626535,"teacher_disagreement_score":0.087852,"about_ca_system_score_codex":0.00006604511,"about_ca_system_score_gemma":0.00004624412,"threshold_uncertainty_score":0.61194545},"labels":[],"label_agreement":null},{"id":"W2078190972","doi":"10.1002/net.20451","title":"The preemptive swapping problem on a tree","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Canada Research Chairs","keywords":"Vertex (graph theory); Object (grammar); Computer science; Tree (set theory); Heuristic; Mathematical optimization; Combinatorics; Mathematics; Routing (electronic design automation); Type (biology); Graph; Computer network; Artificial intelligence","score_opus":0.025470249201273908,"score_gpt":0.22639831072444183,"score_spread":0.20092806152316792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078190972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028016372,0.00030188,0.69540185,0.0000330539,0.00046242165,0.000261906,4.6978855e-7,0.00061608,0.3001207],"genre_scores_gemma":[0.90938044,0.00014053311,0.08903843,0.00009251189,0.00031611387,0.00006763954,0.0000020913003,0.0000683027,0.00089391525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993812,0.000059334463,0.00013666946,0.000105445564,0.00007874237,0.00023863143],"domain_scores_gemma":[0.999551,0.00014829182,0.000026233693,0.00021081736,0.000023015997,0.000040653184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032436257,0.00009832941,0.00007769363,0.000021131076,0.00011808848,0.00002726972,0.00015216248,0.000073239295,0.00003328761],"category_scores_gemma":[0.000022326709,0.000073784686,0.00003331789,0.00015698356,0.000024949852,0.00004258022,0.000022035721,0.00022079797,0.00003095854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012734342,0.00000830071,0.00034505542,0.00000486122,0.000034405533,0.0000016319194,0.00075317675,0.8996783,0.0000121294925,0.0017734044,0.0024775048,0.09489853],"study_design_scores_gemma":[0.0001432056,0.000036131736,0.0023286003,0.000041204825,0.000008289625,0.0000017504384,0.00004160964,0.9932489,0.00018063924,0.00042078868,0.0034236857,0.00012521283],"about_ca_topic_score_codex":0.0000031994564,"about_ca_topic_score_gemma":0.00000927773,"teacher_disagreement_score":0.90657884,"about_ca_system_score_codex":0.000031536863,"about_ca_system_score_gemma":0.0000045986476,"threshold_uncertainty_score":0.3008852},"labels":[],"label_agreement":null},{"id":"W2078227935","doi":"10.1287/opre.1090.0713","title":"Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Operations Research","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Knapsack problem; Mathematical optimization; Computer science; Relaxation (psychology); Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Set (abstract data type); Bounded function; Mathematics; Computer network","score_opus":0.03652744760081844,"score_gpt":0.32538523900211375,"score_spread":0.2888577914012953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078227935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65837157,0.0009707982,0.3207959,0.007080074,0.000051797648,0.0032150387,0.000026580477,0.00046524982,0.009022999],"genre_scores_gemma":[0.9147499,0.00012661472,0.08312275,0.000074551135,0.00010606757,0.00012665981,0.0000085813335,0.000034175282,0.0016507054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988745,0.0001276438,0.00017801051,0.00020972744,0.00024962358,0.0003605163],"domain_scores_gemma":[0.9989249,0.0005055119,0.000008233385,0.00023964018,0.0002412758,0.00008041688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015595258,0.00010890198,0.00012078943,0.000103381615,0.0007565379,0.00032307277,0.00014934198,0.000061009516,0.000035315195],"category_scores_gemma":[0.00016081314,0.0000788769,0.00001950158,0.0004065693,0.000081225204,0.00022793925,0.00004233787,0.00029742162,0.000019201714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003084413,0.000025680374,0.00029036298,0.00003625779,0.000046384466,0.0000012145426,0.0012810288,0.9149184,0.020553825,0.0043800646,0.0005323803,0.057903506],"study_design_scores_gemma":[0.00042716382,0.00012613657,0.0018376483,0.000030989057,0.000009850473,0.000009273521,0.00009307171,0.99474084,0.0017249095,0.00009390914,0.00079008547,0.000116091825],"about_ca_topic_score_codex":0.000029312096,"about_ca_topic_score_gemma":0.000022353992,"teacher_disagreement_score":0.25637832,"about_ca_system_score_codex":0.000052017756,"about_ca_system_score_gemma":0.000055014978,"threshold_uncertainty_score":0.58187544},"labels":[],"label_agreement":null},{"id":"W2078415021","doi":"10.1287/trsc.1110.0398","title":"Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"","keywords":"Mathematical optimization; Robustness (evolution); Benders' decomposition; Benchmark (surveying); Enumeration; Reduction (mathematics); Decomposition; Linear programming; Scale (ratio); Integer programming; Mathematics; Computer science; Algorithm","score_opus":0.038280818502688885,"score_gpt":0.27657885353136896,"score_spread":0.23829803502868008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078415021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.474704,0.000017915001,0.5248524,0.00000809325,0.0000689233,0.00010899818,0.000011970365,0.000089079076,0.00013863671],"genre_scores_gemma":[0.86878157,0.0000029207933,0.13114524,0.0000075105763,0.000016118052,0.000012225108,0.000011159885,0.000012119245,0.000011117339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9989103,0.000022109873,0.00025308758,0.00014384981,0.00037671413,0.00029395003],"domain_scores_gemma":[0.99938697,0.00003742631,0.00008056591,0.00016565989,0.00023742772,0.00009194163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010555951,0.00009345533,0.00010935728,0.00012070552,0.00010915158,0.000013777031,0.00012469053,0.00004074573,0.000024091967],"category_scores_gemma":[0.000035446745,0.000087813736,0.000017782455,0.0010449329,0.00014953864,0.00095388026,0.0000017413375,0.00007646903,0.000005666554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045361976,0.000048003472,0.12757571,0.000106450534,0.0000044559997,5.5273517e-8,0.0074741896,0.7660756,0.09756491,0.0002986738,0.000004443696,0.00084296596],"study_design_scores_gemma":[0.0002951181,0.000017416418,0.62673575,0.000038337294,0.00001181389,9.3705006e-7,0.00016986707,0.28057927,0.09195728,0.000013980986,0.00005483202,0.0001253759],"about_ca_topic_score_codex":0.00002975921,"about_ca_topic_score_gemma":0.000106073734,"teacher_disagreement_score":0.49916005,"about_ca_system_score_codex":0.00005592358,"about_ca_system_score_gemma":0.00004356823,"threshold_uncertainty_score":0.358094},"labels":[],"label_agreement":null},{"id":"W2078701526","doi":"10.1016/j.cor.2010.09.016","title":"The balanced traveling salesmanproblem","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Benchmark (surveying); Computer science; Heuristic; Mathematics","score_opus":0.04331335880890813,"score_gpt":0.3574347166550178,"score_spread":0.3141213578461097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078701526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15727995,0.0001190322,0.83613765,0.0012124256,0.0011764853,0.00039554795,0.0000029256937,0.00040289926,0.00327307],"genre_scores_gemma":[0.7488149,0.00007447847,0.25030252,0.000026316053,0.00026631984,0.00005678411,0.000009530229,0.000035004574,0.00041417082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987641,0.00017516059,0.00021034644,0.00016684072,0.0002995035,0.00038407542],"domain_scores_gemma":[0.9987123,0.0004896493,0.0000048250677,0.00042566977,0.00027548565,0.0000920834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018048334,0.000089947105,0.000083797364,0.00008772539,0.0009773043,0.00045616634,0.0004484303,0.00007124586,0.000030895735],"category_scores_gemma":[0.00020117218,0.00007228792,0.000030968473,0.0005159094,0.00013381678,0.00011913568,0.00008104827,0.00083085557,0.000100481906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014032672,0.0000080413065,0.00007963808,0.0000074323893,0.000013167541,0.0000013113972,0.0003501812,0.93575627,0.022603765,0.0051569887,0.0018614201,0.034160383],"study_design_scores_gemma":[0.000136504,0.00001031386,0.0006717334,0.000008863157,0.000001233515,0.0000060472075,0.000054023545,0.9886696,0.0025987155,0.00008094354,0.0076747853,0.00008727903],"about_ca_topic_score_codex":0.000012690852,"about_ca_topic_score_gemma":0.00012344924,"teacher_disagreement_score":0.5915349,"about_ca_system_score_codex":0.00003993926,"about_ca_system_score_gemma":0.000060469618,"threshold_uncertainty_score":0.75167334},"labels":[],"label_agreement":null},{"id":"W2079586783","doi":"10.1002/atr.5670350104","title":"The planning of aircraft routes and flight frequencies in an airline network operations","year":2001,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Flow network; Operations research; Computer science; Profit (economics); Aviation; Network model; Flow (mathematics); Simulation; Engineering; Mathematical optimization; Aerospace engineering; Economics; Mathematics","score_opus":0.013267852951219591,"score_gpt":0.2755775030962472,"score_spread":0.2623096501450276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079586783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8415423,0.0011935756,0.15694524,0.00008638544,0.00013938664,0.00005362663,0.000001568001,0.000016051363,0.000021841044],"genre_scores_gemma":[0.8545315,0.00060203986,0.14476614,0.000009814713,0.00006670357,0.00000164984,0.000005548716,0.000011064109,0.0000055125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992324,0.000034358854,0.00047324845,0.000048396694,0.000109288274,0.00010228445],"domain_scores_gemma":[0.999595,0.00010285799,0.00009118439,0.000060239407,0.00011601502,0.00003471206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034660933,0.00006805578,0.00013599932,0.00006540755,0.000060261365,0.000016035397,0.00006315772,0.000033649136,0.0000024751778],"category_scores_gemma":[0.00003001935,0.000054578253,0.000024208917,0.00021764738,0.000023109114,0.00046697742,6.603157e-7,0.0001320863,5.887518e-8],"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.000024098503,0.000007395419,0.028558727,0.000008807759,0.000009255496,0.000006745329,0.0014982115,0.96208155,0.003897958,0.0001661615,0.00000320895,0.00373787],"study_design_scores_gemma":[0.0010701881,0.00017470031,0.7940789,0.00024398018,0.00003830759,0.000023724257,0.0015859223,0.19915013,0.0022959714,0.0007437592,0.0004335738,0.00016088007],"about_ca_topic_score_codex":0.000002809022,"about_ca_topic_score_gemma":0.00020673157,"teacher_disagreement_score":0.76552016,"about_ca_system_score_codex":0.000019611858,"about_ca_system_score_gemma":0.000015707888,"threshold_uncertainty_score":0.22256365},"labels":[],"label_agreement":null},{"id":"W2080484716","doi":"10.1007/s12532-012-0047-y","title":"The time dependent traveling salesman problem: polyhedra and algorithm","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"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":"Travelling salesman problem; Polytope; Bottleneck traveling salesman problem; Polyhedron; Theory of computation; Mathematics; Combinatorics; Generalization; Dimension (graph theory); Heuristics; Traveling purchaser problem; Combinatorial optimization; Algorithm; Computer science; Mathematical optimization","score_opus":0.013270643753828533,"score_gpt":0.2620524660477406,"score_spread":0.24878182229391205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080484716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010101285,0.00026441773,0.9878296,0.00008346677,0.00008701938,0.00035348002,6.307391e-7,0.0004938216,0.0007862769],"genre_scores_gemma":[0.25122356,0.0000061915407,0.74853194,0.000009563853,0.00009205664,0.00003174607,0.0000063263305,0.000038332615,0.000060317845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.00008266327,0.00031297278,0.000112639944,0.00020825469,0.0003602461],"domain_scores_gemma":[0.9992922,0.00040617422,0.000047961203,0.00010136992,0.00003768688,0.000114624156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635748,0.00014025645,0.00014255547,0.000033132103,0.00021345257,0.0001747061,0.0000797638,0.000066384826,0.0000069334947],"category_scores_gemma":[0.00007713698,0.00011002968,0.000030935895,0.00013946873,0.000054621043,0.00014736994,0.00003583114,0.00014803099,0.000064797685],"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.0000013707719,0.000041269912,0.000060683833,0.000112417256,0.00003254871,8.6262907e-7,0.0011726065,0.026724866,0.00015549824,0.0015610518,0.000028687282,0.97010815],"study_design_scores_gemma":[0.0001500004,0.000016162146,0.00012646113,0.000035984027,0.000025334477,0.000034658966,0.00008278693,0.99357843,0.00018652917,0.0053558866,0.0002626256,0.00014516157],"about_ca_topic_score_codex":7.894317e-7,"about_ca_topic_score_gemma":1.5945083e-7,"teacher_disagreement_score":0.96996295,"about_ca_system_score_codex":0.000042042935,"about_ca_system_score_gemma":0.000005508367,"threshold_uncertainty_score":0.448688},"labels":[],"label_agreement":null},{"id":"W2080943874","doi":"10.1007/s11590-015-0869-4","title":"Solving the clique partitioning problem as a maximally diverse grouping problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Clique; Heuristic; Variable neighborhood search; Mathematical optimization; Local search (optimization); Computer science; Mathematics; Diversification (marketing strategy); Metaheuristic; Combinatorics","score_opus":0.02134978858238772,"score_gpt":0.2425588380450419,"score_spread":0.22120904946265418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080943874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056961454,0.000044604058,0.98056275,0.0030289432,0.00027239902,0.00046051788,0.0000025598608,0.0008300917,0.009101986],"genre_scores_gemma":[0.12058732,0.00004926907,0.87634563,0.002394625,0.00021876136,0.00012341772,0.00005307517,0.00011494988,0.00011292627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984651,0.00019162292,0.00039978352,0.00023011501,0.0003161139,0.0003972621],"domain_scores_gemma":[0.999212,0.0000969419,0.00011779802,0.0002868251,0.00014490604,0.0001414827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089158997,0.000228101,0.00017656104,0.00013609875,0.0002651015,0.00026210948,0.00025785857,0.00009320794,0.00008887528],"category_scores_gemma":[0.00015014634,0.00020965982,0.00006453193,0.00054881244,0.000066682864,0.00057250593,0.00007942282,0.00026685628,0.00006373005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067579094,0.000009420481,0.0004535528,0.000027478214,0.00003091565,0.0000050467443,0.0017987486,0.99300325,0.0004960313,0.0009239972,0.0026277914,0.0006170052],"study_design_scores_gemma":[0.0004943563,0.000021702526,0.000042658186,0.000077480945,0.000031166506,0.000025898466,0.00042911773,0.9962184,0.00036682968,0.0001641562,0.0018243518,0.0003038721],"about_ca_topic_score_codex":0.000034126224,"about_ca_topic_score_gemma":0.0000049231926,"teacher_disagreement_score":0.11489117,"about_ca_system_score_codex":0.00019891067,"about_ca_system_score_gemma":0.000046885478,"threshold_uncertainty_score":0.85496795},"labels":[],"label_agreement":null},{"id":"W2081363577","doi":"10.1016/j.trb.2014.09.008","title":"The fleet size and mix pollution-routing problem","year":2014,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":false,"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":"Vehicle routing problem; Fuel efficiency; Benchmark (surveying); Routing (electronic design automation); Computer science; Pollution; Homogeneous; Transport engineering; Operations research; Metaheuristic; Environmental economics; Environmental science; Engineering; Economics; Automotive engineering; Mathematics; Computer network","score_opus":0.2067050982487565,"score_gpt":0.4203752284752951,"score_spread":0.21367013022653863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081363577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2506961,0.0003116941,0.7407006,0.0023910876,0.00025429734,0.00069748727,0.000015272208,0.00071569777,0.0042177364],"genre_scores_gemma":[0.62770015,0.00028476116,0.3714009,0.000068402,0.00014529072,0.00009980322,0.000010943434,0.000030569307,0.0002591629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9951538,0.0029832122,0.00045655642,0.00030939956,0.000506502,0.00059054437],"domain_scores_gemma":[0.98912406,0.010224762,0.000044041877,0.0002497468,0.00018416993,0.00017319672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016052417,0.00015644425,0.00023297277,0.00006554272,0.0006147832,0.00010974518,0.00022180364,0.00016426855,0.000081235485],"category_scores_gemma":[0.0034564394,0.000111336405,0.000057359066,0.0004931172,0.0003199139,0.00010328451,0.000013095933,0.0006066613,0.00001768491],"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.00034062777,0.00012286648,0.031362094,0.00045138755,0.00024850058,0.000023634915,0.004188222,0.41757405,0.040330384,0.26619363,0.0060294275,0.23313518],"study_design_scores_gemma":[0.0022408243,0.0005084452,0.5387901,0.00016628503,0.00007396996,0.000014264253,0.0015186301,0.27009258,0.00978567,0.038450852,0.13726363,0.0010947571],"about_ca_topic_score_codex":0.00001778656,"about_ca_topic_score_gemma":0.000038328257,"teacher_disagreement_score":0.507428,"about_ca_system_score_codex":0.00003392423,"about_ca_system_score_gemma":0.000021322918,"threshold_uncertainty_score":0.55634797},"labels":[],"label_agreement":null},{"id":"W2081655128","doi":"10.1080/00207543.2012.757668","title":"A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem","year":2013,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":158,"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":"Vendor-managed inventory; Vehicle routing problem; Routing (electronic design automation); Product (mathematics); Inventory theory; Computer science; Vendor; Mathematical optimization; Inventory control; Operations research; Consistency (knowledge bases); Quality (philosophy); Supply chain; Supply chain management; Engineering; Mathematics; Business; Artificial intelligence; Marketing","score_opus":0.10671239343453276,"score_gpt":0.3979318811228896,"score_spread":0.2912194876883568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081655128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062955834,0.001308097,0.9205338,0.010487373,0.0032799733,0.0012422631,0.000007382252,0.00010633841,0.00007894874],"genre_scores_gemma":[0.5171283,0.0004121255,0.47845277,0.000046486715,0.0023983314,0.000116790216,0.0000032155087,0.000061914616,0.0013800608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798864,0.00021104862,0.00052869396,0.0002164295,0.00075461494,0.0003005472],"domain_scores_gemma":[0.9965322,0.00029297566,0.00015018079,0.00017292367,0.0027554224,0.000096310374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004062732,0.00012271132,0.00015238851,0.00035137244,0.00021197589,0.000242023,0.00048397947,0.000054103522,0.000055361445],"category_scores_gemma":[0.0015289822,0.000094022376,0.000083579966,0.00028941606,0.00013427777,0.0005268847,0.0000931691,0.0006000721,0.000018847722],"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.000035142843,0.00018726893,0.0026550114,0.000076238335,0.0005155781,0.0000044513517,0.0019494187,0.103566125,0.048756726,0.00020488452,0.006648661,0.8354005],"study_design_scores_gemma":[0.0010671844,0.000056457528,0.00275534,0.000097288765,0.000016011709,0.0001491558,0.0004604464,0.968047,0.022177132,0.00040642451,0.004621775,0.00014576348],"about_ca_topic_score_codex":0.00005241289,"about_ca_topic_score_gemma":0.0000068866766,"teacher_disagreement_score":0.8644809,"about_ca_system_score_codex":0.0001850169,"about_ca_system_score_gemma":0.00006903446,"threshold_uncertainty_score":0.38341212},"labels":[],"label_agreement":null},{"id":"W2082772228","doi":"10.1007/s11750-007-0009-0","title":"Static pickup and delivery problems: a classification scheme and survey","year":2007,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":698,"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":"Pickup; Scheme (mathematics); Computer science; Vehicle routing problem; Class (philosophy); Classification scheme; Routing (electronic design automation); Field (mathematics); Operations research; Mathematical optimization; Artificial intelligence; Data science; Computer network; Mathematics","score_opus":0.043283522705910266,"score_gpt":0.2781970216619149,"score_spread":0.23491349895600463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082772228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7882364,0.00020622229,0.21060239,0.000029990153,0.000038561488,0.000088783505,0.0000027442634,0.00012837256,0.00066655444],"genre_scores_gemma":[0.8928355,0.00008988332,0.10691175,0.000031157804,0.000016292775,0.0000029665377,0.000008487296,0.000015646745,0.00008832739],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99956626,0.00003670699,0.00012869308,0.00009534163,0.000056764446,0.00011625674],"domain_scores_gemma":[0.9996618,0.00015169119,0.000018204555,0.000086590626,0.00003348055,0.00004822787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000821259,0.000060363156,0.000069978196,0.00004923469,0.00002987634,0.000024780753,0.000027365464,0.00004146662,0.0000107705455],"category_scores_gemma":[0.00009217707,0.00006434755,0.000004928948,0.00011513008,0.000021870255,0.000072231414,0.000012607693,0.0000645386,0.0000042974502],"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.000041051466,0.000056122113,0.6493103,0.000719587,0.00010190253,0.0000074892782,0.004311624,0.030944014,0.044129636,0.0018017439,0.0013499755,0.26722655],"study_design_scores_gemma":[0.00025303318,0.000015028792,0.57468826,0.000019763795,0.0000058441615,0.0000047899402,0.0000772764,0.42333278,0.00072670705,0.00007691541,0.0006716143,0.00012799392],"about_ca_topic_score_codex":0.00003039256,"about_ca_topic_score_gemma":0.000033511966,"teacher_disagreement_score":0.39238876,"about_ca_system_score_codex":0.000020999785,"about_ca_system_score_gemma":0.000006006006,"threshold_uncertainty_score":0.2624017},"labels":[],"label_agreement":null},{"id":"W2083487387","doi":"10.1016/j.cor.2014.12.001","title":"A hybrid method for the Probabilistic Maximal Covering Location–Allocation Problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Université Laval","keywords":"Mathematical optimization; Benchmark (surveying); Solver; Probabilistic logic; Heuristic; Integer programming; Computer science; Metaheuristic; Linear programming; Mathematics; Algorithm; Artificial intelligence","score_opus":0.05287132260263117,"score_gpt":0.36430405751876127,"score_spread":0.3114327349161301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083487387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012275251,0.00009234402,0.99507004,0.0012101018,0.00024429697,0.0014369506,0.0000054075826,0.00025791515,0.0004554281],"genre_scores_gemma":[0.28503773,0.000013526751,0.713709,0.000059449678,0.00023115623,0.00068670453,0.00003598538,0.000044983863,0.00018144862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981777,0.0004635203,0.00032276515,0.00029532626,0.0003485767,0.00039211585],"domain_scores_gemma":[0.99682647,0.0017347261,0.000014907652,0.00049334974,0.00084799196,0.00008254419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038881402,0.00013860341,0.00014689844,0.00018913922,0.00074779114,0.00040490623,0.00044502987,0.00005123295,0.00001546374],"category_scores_gemma":[0.00081864157,0.000119346536,0.000045496894,0.00060188223,0.000083928935,0.00020499059,0.00009600037,0.00030336465,0.00003259968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004527429,0.000017556104,0.0000068985314,0.000095104646,0.000023575787,1.208213e-7,0.0002846785,0.92992085,0.0007365967,0.014423594,0.0012911304,0.05319537],"study_design_scores_gemma":[0.00027222827,0.00005434301,0.00012039619,0.00003775479,0.000010903497,0.00000788325,0.000035110475,0.99143267,0.0012144255,0.0007744272,0.005905108,0.0001347484],"about_ca_topic_score_codex":0.000042527874,"about_ca_topic_score_gemma":0.000026351954,"teacher_disagreement_score":0.28381023,"about_ca_system_score_codex":0.00019593291,"about_ca_system_score_gemma":0.00011221614,"threshold_uncertainty_score":0.57514805},"labels":[],"label_agreement":null},{"id":"W2085138485","doi":"10.1016/j.mcm.2007.12.025","title":"Optimization of production allocation and transportation of customer orders for a leading forest products company","year":2008,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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 British Columbia","funders":"","keywords":"Production (economics); Order (exchange); Computer science; Process (computing); Operations research; Integer programming; Business; Operations management; Economics; Finance; Engineering","score_opus":0.036020724329612085,"score_gpt":0.23812427682272602,"score_spread":0.20210355249311393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085138485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2879442,0.000038095513,0.7117046,0.000023946011,0.000031044394,0.0002027753,0.0000011587699,0.00004049683,0.000013661151],"genre_scores_gemma":[0.5332349,0.000027922932,0.46668735,0.0000015417854,0.000019250157,0.0000071824697,0.0000070388423,0.000009835022,0.000005013256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993903,0.000012912967,0.00030029396,0.0001308679,0.00008273186,0.00008287736],"domain_scores_gemma":[0.9996558,0.00005837341,0.000062940686,0.00007237908,0.0001271366,0.00002337626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016226861,0.000083616906,0.00019075333,0.00006991705,0.00004361946,0.0000060536886,0.000029822513,0.0000394998,9.722236e-7],"category_scores_gemma":[0.000013325242,0.000082412516,0.000018276289,0.00012238571,0.00004851968,0.00011632562,0.0000042084835,0.00003699839,1.5234717e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007599126,0.00002406678,0.00010327388,0.00084651617,0.000014382097,5.9997454e-8,0.0013396732,0.9928333,0.0003415362,0.0031612385,0.000007090301,0.0013212744],"study_design_scores_gemma":[0.00017938102,0.000024112993,0.000056532943,0.00009746429,0.000023864473,0.000005045931,0.000019274263,0.9964039,0.0022935655,0.00081286253,0.0000052878663,0.00007872875],"about_ca_topic_score_codex":0.0000013035104,"about_ca_topic_score_gemma":2.674313e-7,"teacher_disagreement_score":0.24529068,"about_ca_system_score_codex":0.0000064923956,"about_ca_system_score_gemma":0.0000063008733,"threshold_uncertainty_score":0.33606848},"labels":[],"label_agreement":null},{"id":"W2085285568","doi":"10.1287/trsc.1070.0195","title":"Vehicle Routing for Urban Snow Plowing Operations","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Université de Moncton","keywords":"Routing (electronic design automation); Truck; Vehicle routing problem; Heuristic; Flow network; Transport engineering; Computer science; Snow removal; Set (abstract data type); Class (philosophy); Level of service; Operations research; Fleet management; Snow; Flow routing; Engineering; Mathematical optimization; Computer network; Mathematics; Geography","score_opus":0.03569784321385178,"score_gpt":0.28784008291687985,"score_spread":0.25214223970302807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085285568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46571493,0.000012594274,0.53334886,0.000036920424,0.0001516186,0.00013898997,0.000008732014,0.0002681429,0.000319198],"genre_scores_gemma":[0.8423076,0.0000069429047,0.15745424,0.000045464934,0.000043764296,0.000028392538,0.000015427086,0.000018298819,0.000079838544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899894,0.000010450061,0.00026345468,0.00021016426,0.0002539284,0.00026307945],"domain_scores_gemma":[0.9995086,0.0000809144,0.000018797504,0.00014949677,0.00015670538,0.00008546307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005008678,0.00009306414,0.000100005345,0.00011681979,0.00055877044,0.000043660104,0.00018906283,0.000033379707,0.000018857085],"category_scores_gemma":[0.000121237594,0.000103083235,0.00004116287,0.000758339,0.00012712661,0.000632094,0.0000018565479,0.00007128504,0.000008917749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017817285,0.0000076905235,0.0056392127,0.000009163581,0.0000031891755,0.0000011577582,0.0038078884,0.9526523,0.035235837,0.0016157281,0.000052414267,0.000973681],"study_design_scores_gemma":[0.0003003446,0.000013468062,0.04173888,0.00001622171,0.000007997004,0.0000019475422,0.00013532082,0.9206492,0.036712583,0.000023222115,0.00023756266,0.00016329435],"about_ca_topic_score_codex":0.00000981692,"about_ca_topic_score_gemma":0.000014717638,"teacher_disagreement_score":0.3765927,"about_ca_system_score_codex":0.000051352003,"about_ca_system_score_gemma":0.000083347084,"threshold_uncertainty_score":0.4297667},"labels":[],"label_agreement":null},{"id":"W2085543268","doi":"10.1016/j.cor.2009.05.005","title":"The undirected capacitated arc routing problem with profits","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"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; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Arc routing; Mathematical optimization; Profit (economics); Vehicle routing problem; Computer science; Undirected graph; Graph; Enhanced Data Rates for GSM Evolution; Mathematics; Routing (electronic design automation); Theoretical computer science; Economics; Artificial intelligence; Microeconomics","score_opus":0.045654646211437444,"score_gpt":0.3336104762566733,"score_spread":0.28795583004523584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085543268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095653445,0.00019453448,0.8883883,0.0028927645,0.00018271993,0.0013669349,0.0000041836806,0.001105515,0.010211601],"genre_scores_gemma":[0.7452965,0.000031741773,0.2539176,0.000037480822,0.0000868051,0.000054784483,0.000018061526,0.000032811997,0.00052420463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981263,0.0004207256,0.0002514865,0.00022894124,0.00043707437,0.00053542224],"domain_scores_gemma":[0.9986171,0.00034071069,0.00001071354,0.00036262558,0.0005626158,0.00010624971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014099911,0.00013711938,0.00012363684,0.00017900695,0.0011174824,0.0005581251,0.0003580059,0.000058451853,0.000007963199],"category_scores_gemma":[0.00014164687,0.000098653734,0.000022946573,0.0013878304,0.00011323645,0.00019148467,0.000040406354,0.00053346565,0.000032115295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007536828,0.000018397333,0.00007121544,0.000007720414,0.000027354045,0.00000424691,0.000886133,0.96510756,0.0023838968,0.0033341118,0.0011562114,0.026995616],"study_design_scores_gemma":[0.00026752884,0.000102555845,0.0009592707,0.000060977163,0.0000034307282,0.000012410365,0.00012120333,0.99528164,0.0019938522,0.00007124829,0.0009837225,0.00014216112],"about_ca_topic_score_codex":0.0000206279,"about_ca_topic_score_gemma":0.000045733672,"teacher_disagreement_score":0.64964306,"about_ca_system_score_codex":0.00015315413,"about_ca_system_score_gemma":0.00010063149,"threshold_uncertainty_score":0.85948837},"labels":[],"label_agreement":null},{"id":"W2086399386","doi":"10.1016/j.ejor.2012.02.007","title":"Heuristics for the multi-depot petrol station replenishment problem with time windows","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"TRIPS architecture; Truck; Heuristics; Computer science; Operations research; Heuristic; Set (abstract data type); Depot; Revenue; Vehicle routing problem; Mathematical optimization; Schedule; Gasoline; Transport engineering; Routing (electronic design automation); Engineering; Mathematics; Automotive engineering; Computer network","score_opus":0.08523717946583616,"score_gpt":0.3594690999722097,"score_spread":0.27423192050637357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086399386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012053547,0.0004241228,0.9838054,0.00088562426,0.00014956966,0.00052062253,0.000019879015,0.000031421907,0.002109821],"genre_scores_gemma":[0.5259441,0.00005054989,0.47232026,0.00003970307,0.00062589615,0.000012994244,0.000011453177,0.00006224876,0.0009327915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777544,0.0007100853,0.00040929063,0.00008189485,0.0007205527,0.00030275123],"domain_scores_gemma":[0.997831,0.00080582645,0.00008173733,0.00014547541,0.0010049964,0.00013098761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008881834,0.00009544361,0.00011157673,0.00012639619,0.00028161827,0.00015390976,0.00024114821,0.000015261248,0.0000903418],"category_scores_gemma":[0.00074218045,0.00006182947,0.00004154133,0.0001965115,0.000058582722,0.00028983748,0.00003093473,0.0003963074,0.000049497452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001258452,0.00009203209,0.001074188,0.000037065336,0.00011679191,0.000010317517,0.0010537303,0.97691953,0.0046447897,0.000522283,0.009303622,0.0060998267],"study_design_scores_gemma":[0.002771052,0.0007753313,0.014916664,0.0001220881,0.00004969808,0.0002355327,0.00035456015,0.91837656,0.0031240364,0.00002152574,0.05898652,0.00026645788],"about_ca_topic_score_codex":6.8387027e-7,"about_ca_topic_score_gemma":4.059989e-7,"teacher_disagreement_score":0.51389056,"about_ca_system_score_codex":0.000109790606,"about_ca_system_score_gemma":0.000097345095,"threshold_uncertainty_score":0.30782843},"labels":[],"label_agreement":null},{"id":"W2086411701","doi":"10.1287/trsc.1100.0336","title":"Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"Canada Research Chairs","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Reduction (mathematics); Dynamic programming; Algorithm; Constraint programming; Stochastic programming; Mathematics","score_opus":0.056624502328832,"score_gpt":0.34097344120089756,"score_spread":0.2843489388720656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086411701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7939838,0.00001096083,0.20522316,0.000017812212,0.00026274694,0.00015769765,0.000004300852,0.00009179426,0.00024768987],"genre_scores_gemma":[0.8321443,0.000002026244,0.16781844,0.0000063396515,0.000016167955,0.0000035642008,0.0000011209379,0.000006839378,0.0000011708092],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990136,0.000017113429,0.00030032982,0.00016187821,0.0003207212,0.00018636018],"domain_scores_gemma":[0.99943376,0.0000785212,0.00008147131,0.00020621582,0.00015110732,0.000048954615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015606665,0.00007871571,0.00010151222,0.00006826027,0.00016557323,0.00004366863,0.00025113538,0.000032383665,0.000019585525],"category_scores_gemma":[0.00013542282,0.00006322387,0.00003315037,0.00082807784,0.0007174388,0.00032122392,0.0000028067066,0.00016603297,5.148631e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003849213,0.000015996966,0.072207116,0.000052690953,0.000004727264,9.907056e-7,0.0037998941,0.31876224,0.57456464,0.003257039,4.11155e-7,0.027330426],"study_design_scores_gemma":[0.00037797118,0.000019878802,0.27848777,0.000059050693,0.000031179563,0.00000684266,0.0011486888,0.49997488,0.21906956,0.00041329965,0.00011366282,0.00029724304],"about_ca_topic_score_codex":0.000024909978,"about_ca_topic_score_gemma":0.000104146195,"teacher_disagreement_score":0.35549507,"about_ca_system_score_codex":0.00002346628,"about_ca_system_score_gemma":0.000106017214,"threshold_uncertainty_score":0.26434332},"labels":[],"label_agreement":null},{"id":"W2087852198","doi":"10.1016/j.ejor.2012.03.044","title":"A simple and effective metaheuristic for the Minimum Latency Problem","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":135,"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":"Metaheuristic; Mathematical optimization; Computer science; Travelling salesman problem; Iterated local search; Scheduling (production processes); Benchmark (surveying); Iterated function; Job shop scheduling; Variable neighborhood search; Simple (philosophy); Algorithm; Mathematics","score_opus":0.07068969871385707,"score_gpt":0.37249692924056277,"score_spread":0.3018072305267057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087852198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1813102,0.0056486456,0.7999343,0.0014359967,0.00048207096,0.0013381742,0.000020817386,0.00004586491,0.00978388],"genre_scores_gemma":[0.9527813,0.000093628405,0.04638804,0.00002511149,0.0005146125,0.000011207249,0.000001702107,0.000031879157,0.00015251689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982641,0.000836074,0.00026525935,0.000058571717,0.00034162047,0.00023438939],"domain_scores_gemma":[0.99735785,0.001903829,0.000036507667,0.000079944315,0.00051289157,0.000108965025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009760468,0.000069209505,0.00010115005,0.000107747095,0.00022800786,0.00010103046,0.00015852445,0.000012927064,0.000039281083],"category_scores_gemma":[0.0013866192,0.00004542273,0.00003981698,0.00016469056,0.00006072554,0.00021911,0.000041651838,0.00030969977,0.000012902231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004034032,0.00027059446,0.010813327,0.00044083723,0.0010396357,0.000049885177,0.009124483,0.71255136,0.042229094,0.019379351,0.047239967,0.15645805],"study_design_scores_gemma":[0.004010547,0.0014003334,0.18889053,0.00018774276,0.00016712936,0.0005408425,0.0008208087,0.65275985,0.0053742584,0.0013876813,0.1438799,0.0005803425],"about_ca_topic_score_codex":4.7119266e-7,"about_ca_topic_score_gemma":1.4567313e-7,"teacher_disagreement_score":0.7714711,"about_ca_system_score_codex":0.000037485755,"about_ca_system_score_gemma":0.000032384247,"threshold_uncertainty_score":0.3382803},"labels":[],"label_agreement":null},{"id":"W2088165054","doi":"10.1016/j.disopt.2009.04.004","title":"Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heuristics; Heuristic; Benchmark (surveying); Mathematical optimization; Variable neighborhood search; Mathematics; Local search (optimization); Variable (mathematics); Scale (ratio); Incremental heuristic search; Beam search; Algorithm; Search algorithm; Computer science; Metaheuristic","score_opus":0.022019800699498385,"score_gpt":0.2781955289469787,"score_spread":0.2561757282474803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088165054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016639743,0.0002031214,0.9957844,0.0006144092,0.00014234975,0.0011250497,0.000045074157,0.0004076051,0.001511599],"genre_scores_gemma":[0.12783661,0.00009212217,0.870411,0.00038395848,0.00013979811,0.000115337236,0.0003480818,0.00010617458,0.00056694524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794525,0.00020669677,0.00043035878,0.00038411326,0.00038378834,0.00064981676],"domain_scores_gemma":[0.9989017,0.00021445153,0.00005316631,0.00045630487,0.00023713811,0.00013722424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012283691,0.00027899363,0.00027555818,0.00011999349,0.0003640782,0.00018840986,0.00032420247,0.00018482505,0.00010849772],"category_scores_gemma":[0.000060940733,0.00023193202,0.0001068213,0.00055220246,0.000052548123,0.00023113022,0.00006530378,0.00029805783,0.000008129137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051238174,0.0000512546,0.00006571642,0.00003722892,0.00005255341,6.434843e-7,0.0006749187,0.9923336,0.00052043947,0.001280794,0.0005536294,0.004378011],"study_design_scores_gemma":[0.0015237588,0.00007687167,0.00007790971,0.000039490533,0.000053632866,0.0000033864344,0.00057738036,0.9940298,0.00211534,0.000042140426,0.0011741001,0.0002861613],"about_ca_topic_score_codex":0.000012112501,"about_ca_topic_score_gemma":0.0000018620677,"teacher_disagreement_score":0.12767021,"about_ca_system_score_codex":0.00018947672,"about_ca_system_score_gemma":0.000053583888,"threshold_uncertainty_score":0.9457913},"labels":[],"label_agreement":null},{"id":"W2088243692","doi":"10.1007/s10288-008-0089-1","title":"Variable neighbourhood search: methods and applications","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":false,"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":"Metaheuristic; Heuristics; Neighbourhood (mathematics); Mathematical optimization; Computer science; Variable neighborhood search; Tabu search; Variable (mathematics); Heuristic; Simulated annealing; Local search (optimization); Mathematics","score_opus":0.03730997085608331,"score_gpt":0.31946399162222655,"score_spread":0.28215402076614327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088243692","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016395075,0.00031766557,0.9750223,0.000035395668,0.000046217338,0.00012541724,0.0000037290208,0.00032527136,0.022484465],"genre_scores_gemma":[0.028484428,0.00009282793,0.9707927,0.00004443954,0.000087471286,0.00004008429,0.000003600685,0.000026945056,0.00042748117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950105,0.00006481849,0.00010890336,0.00011267694,0.00006218191,0.00015039554],"domain_scores_gemma":[0.9995874,0.0001250665,0.000009226621,0.00017623657,0.00002874028,0.00007329177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032625906,0.000069923415,0.000093973664,0.00005017252,0.00010245529,0.000014975791,0.00007115699,0.00004964714,0.00013772512],"category_scores_gemma":[0.000041026666,0.00007452644,0.000013865976,0.0002458149,0.000030383646,0.00006337685,0.000026172309,0.00010578874,0.000024029727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055503633,0.00006360917,0.0037680694,0.0002006616,0.00011055433,0.0000059997715,0.0013380861,0.5954016,0.03152893,0.046475854,0.0016283956,0.3194727],"study_design_scores_gemma":[0.00046613274,0.000020493122,0.006489823,0.000012342577,0.000023706378,0.00010126921,0.00006076237,0.9047142,0.013694962,0.0018046302,0.07226645,0.00034520857],"about_ca_topic_score_codex":0.0000059763934,"about_ca_topic_score_gemma":1.3955858e-7,"teacher_disagreement_score":0.3191275,"about_ca_system_score_codex":0.000019327377,"about_ca_system_score_gemma":0.000015614074,"threshold_uncertainty_score":0.30391},"labels":[],"label_agreement":null},{"id":"W2089432311","doi":"10.1016/j.cor.2015.04.002","title":"A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"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; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Metaheuristic; FIFO and LIFO accounting; Crossover; Population; Mathematical optimization; Tabu search; Computer science; Local search (optimization); Vehicle routing problem; Mathematics; Algorithm; Artificial intelligence","score_opus":0.06616750905945257,"score_gpt":0.3289781835126778,"score_spread":0.26281067445322526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089432311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0660934,0.00044961396,0.93170553,0.00059576525,0.00004585167,0.00090459525,0.000007893187,0.000111426794,0.00008591479],"genre_scores_gemma":[0.59077954,0.000011876219,0.40882218,0.00003855,0.00006605026,0.000121690435,0.000024086346,0.000029027933,0.00010701602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904466,0.00017170596,0.00015319821,0.00018456312,0.0002254515,0.00022041355],"domain_scores_gemma":[0.9984823,0.0008847149,0.000008625124,0.00018561134,0.0003241455,0.00011461012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012218426,0.00009862827,0.00012575366,0.00015918104,0.0003986232,0.00033075298,0.00011998259,0.00003941387,0.0000046149958],"category_scores_gemma":[0.00016811662,0.00007355115,0.00001347686,0.00032209448,0.00007191899,0.00014811895,0.000049052105,0.0001661062,0.0000048384773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013009079,0.00000754808,0.0008650233,0.000030148314,0.000029451356,7.82982e-7,0.00031829125,0.9935715,0.0001236224,0.00022836195,0.0005603711,0.004251888],"study_design_scores_gemma":[0.00055801065,0.000081549784,0.0009883855,0.000034760407,0.000015914557,0.0000062234217,0.000048053324,0.9976233,0.000084338775,0.000039881656,0.00042497183,0.00009460262],"about_ca_topic_score_codex":0.000082859275,"about_ca_topic_score_gemma":0.000038221737,"teacher_disagreement_score":0.5246861,"about_ca_system_score_codex":0.00007087915,"about_ca_system_score_gemma":0.000090712994,"threshold_uncertainty_score":0.31894585},"labels":[],"label_agreement":null},{"id":"W2089448602","doi":"10.1007/s12469-012-0058-0","title":"A reduced integer programming model for the ferry scheduling problem","year":2012,"lang":"en","type":"article","venue":"Public Transport","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Integer programming; Crew scheduling; Scheduling (production processes); Solver; Mathematical optimization; Computer science; Job shop scheduling; Integer (computer science); Branch and price; Operations research; Mathematics; Schedule","score_opus":0.053920639627303556,"score_gpt":0.2819119838099116,"score_spread":0.22799134418260805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089448602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022833819,0.0003627574,0.973635,0.0006084195,0.0002550018,0.00063730794,0.0000065140334,0.00074547314,0.0009156818],"genre_scores_gemma":[0.6151639,0.000009230844,0.38422856,0.000033665005,0.00011708565,0.00028326586,0.000014621781,0.00005070166,0.00009897258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988187,0.00001604801,0.0002924427,0.00014550818,0.00015488795,0.00057244103],"domain_scores_gemma":[0.99942756,0.00008278383,0.000035081448,0.0002382992,0.000084368636,0.00013193444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011313342,0.00016228402,0.0001527167,0.00007474163,0.00013763443,0.000051152616,0.0002208208,0.00009761755,0.000016407921],"category_scores_gemma":[0.000046766087,0.00012864967,0.00009752985,0.0002798514,0.000030816027,0.0004180361,0.000007584243,0.00021793185,0.0000037482096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066519056,0.000045519533,0.003380524,0.00012923317,0.000080372156,1.607664e-7,0.0024469951,0.93969536,0.00053680735,0.0061044297,0.000057856523,0.047516067],"study_design_scores_gemma":[0.0002404992,0.0000052010264,0.0008784203,0.000017190678,0.00004322899,0.0000042397273,0.00011215377,0.99034554,0.00030122147,0.000074039046,0.0077919224,0.00018636182],"about_ca_topic_score_codex":0.0000028197423,"about_ca_topic_score_gemma":0.0000043086593,"teacher_disagreement_score":0.5923301,"about_ca_system_score_codex":0.00005316107,"about_ca_system_score_gemma":0.000044516088,"threshold_uncertainty_score":0.52461815},"labels":[],"label_agreement":null},{"id":"W2089725715","doi":"10.1057/jors.2009.83","title":"Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery","year":2009,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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","funders":"","keywords":"Heuristics; Vehicle routing problem; Pickup; Computer science; Heuristic; Routing (electronic design automation); Extension (predicate logic); Mathematical optimization; Algorithm; Mathematics; Embedded system; Artificial intelligence","score_opus":0.04172816528484367,"score_gpt":0.33600109162972863,"score_spread":0.29427292634488494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089725715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5133755,0.00051714294,0.4769649,0.007818444,0.00013367737,0.00085037266,0.000018056102,0.000061893414,0.00025997125],"genre_scores_gemma":[0.68921566,0.000028162065,0.31029093,0.00018996188,0.00016068961,0.0000039039933,0.0000011716219,0.000014716885,0.00009479917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986078,0.00013495018,0.00027021198,0.000099563644,0.0006354581,0.0002520109],"domain_scores_gemma":[0.99782455,0.0009984875,0.00006460621,0.00010375634,0.00092163496,0.000086958455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025386577,0.00009266898,0.00013513911,0.00003806392,0.00043320082,0.0001596989,0.00020729972,0.000064570915,0.0000067231294],"category_scores_gemma":[0.00049033953,0.00006107836,0.00009997586,0.00025890177,0.00007530355,0.00018546889,0.000023523438,0.00046470325,4.1216856e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003382004,0.000026148673,0.00030256892,0.000022425957,0.000039500348,0.0000017709879,0.00039128066,0.9836964,0.008506459,0.0001231186,0.0009212385,0.00593529],"study_design_scores_gemma":[0.00079508807,0.00023034985,0.0009859145,0.000096061885,0.000011676188,0.000023872573,0.00016074801,0.9943893,0.002503943,0.00019724037,0.0005241299,0.00008166846],"about_ca_topic_score_codex":0.0000028256102,"about_ca_topic_score_gemma":0.00000196585,"teacher_disagreement_score":0.17584011,"about_ca_system_score_codex":0.00019377658,"about_ca_system_score_gemma":0.00025738255,"threshold_uncertainty_score":0.33318743},"labels":[],"label_agreement":null},{"id":"W2090118375","doi":"10.1016/j.ejor.2006.05.009","title":"General solutions to the single vehicle routing problem with pickups and deliveries","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":106,"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":"Norges Forskningsråd","keywords":"Vehicle routing problem; Heuristics; Mathematical optimization; Tabu search; Computer science; Integer programming; Pickup; Routing (electronic design automation); Mathematics; Artificial intelligence","score_opus":0.06103351430024579,"score_gpt":0.3031094858809919,"score_spread":0.24207597158074612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090118375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73503137,0.0004282195,0.24704792,0.004342566,0.0000803414,0.00022253774,0.000007970798,0.00004209849,0.012796977],"genre_scores_gemma":[0.8812528,0.000013121701,0.11779565,0.000048752318,0.00043372568,0.0000019739764,0.0000020988962,0.000029237252,0.00042262962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982306,0.0006160886,0.0002975328,0.000092660914,0.00050922355,0.0002539322],"domain_scores_gemma":[0.9989999,0.00016464072,0.000034155557,0.00009719667,0.00061853015,0.00008556121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036324766,0.00007847259,0.000086715365,0.00013139506,0.00045746425,0.0002758043,0.000185555,0.000011731857,0.000025083842],"category_scores_gemma":[0.00016966573,0.00005348637,0.000020241836,0.00032970897,0.0000835852,0.00020981696,0.00007396478,0.00033066142,0.0000139018675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002142202,0.000021514996,0.0008667354,0.0000062658637,0.000018754652,0.000025289606,0.00044149917,0.97272724,0.01572072,0.0028385897,0.0036227354,0.0036892297],"study_design_scores_gemma":[0.0028314572,0.002189079,0.20044214,0.00045567364,0.000050582512,0.0012005926,0.0011734074,0.688609,0.011150192,0.0003917278,0.090683304,0.00082281337],"about_ca_topic_score_codex":0.000012436899,"about_ca_topic_score_gemma":0.000021163272,"teacher_disagreement_score":0.2841182,"about_ca_system_score_codex":0.00007501023,"about_ca_system_score_gemma":0.00006510706,"threshold_uncertainty_score":0.35184914},"labels":[],"label_agreement":null},{"id":"W2090707215","doi":"10.1002/net.21594","title":"Reaching the elementary lower bound in the vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"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; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Vehicle routing problem; Upper and lower bounds; Relaxation (psychology); Routing (electronic design automation); Mathematical optimization; Set (abstract data type); Shortest path problem; State space; Computer science; Mathematics; Tree (set theory); Branch and bound; State (computer science); Space (punctuation); Algorithm; Combinatorics","score_opus":0.015640875985707885,"score_gpt":0.23722605952330764,"score_spread":0.22158518353759976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090707215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58210456,0.00094008376,0.36419132,0.0017818651,0.0005840217,0.001636715,0.0000029027462,0.0008173566,0.047941193],"genre_scores_gemma":[0.9802124,0.0000064371275,0.018792665,0.0004771494,0.00033212447,0.000033760232,0.000009710856,0.000049379192,0.000086355685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874884,0.0002756688,0.00023307205,0.00015146648,0.00023351163,0.00035747053],"domain_scores_gemma":[0.99933136,0.00022445024,0.000047103797,0.00032137256,0.000028609598,0.0000471015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284907,0.0001470896,0.00012827,0.000029130751,0.00012938333,0.0001288551,0.00030363843,0.00006690939,0.000016655116],"category_scores_gemma":[0.000027183722,0.00008713879,0.000025664902,0.00038052085,0.000036449743,0.00014747467,0.00004429199,0.0005232775,0.0000139344465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012932326,0.00001170204,0.0042338623,0.0000031375516,0.000016586182,0.000007035925,0.001560742,0.9861912,0.00001937266,0.00007480071,0.00197118,0.005897464],"study_design_scores_gemma":[0.0004423623,0.000038664282,0.0010914436,0.000049287322,0.000015755391,0.000013639891,0.00035435805,0.9953823,0.000012208443,0.00008979673,0.0023723822,0.00013780106],"about_ca_topic_score_codex":0.00005258194,"about_ca_topic_score_gemma":0.000055028955,"teacher_disagreement_score":0.3981079,"about_ca_system_score_codex":0.000098071636,"about_ca_system_score_gemma":0.000020725825,"threshold_uncertainty_score":0.35534167},"labels":[],"label_agreement":null},{"id":"W2090915089","doi":"10.1016/j.orl.2013.07.007","title":"Routing vehicles to minimize fuel consumption","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"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 Lethbridge","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Routing (electronic design automation); Generalization; Heuristic; Fuel efficiency; Mathematical optimization; Computer science; Mathematics; Engineering; Computer network","score_opus":0.06715273491549184,"score_gpt":0.35207197887978303,"score_spread":0.2849192439642912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090915089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7570183,0.000044776272,0.23314957,0.007304347,0.00016408005,0.0006805596,0.000005954839,0.0003464286,0.0012859469],"genre_scores_gemma":[0.77720743,0.000028200035,0.22117876,0.0007214608,0.00014077376,0.00031312078,0.00001640673,0.000047757836,0.00034606727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998293,0.0003024748,0.0002654884,0.00023498133,0.00040012022,0.0005039375],"domain_scores_gemma":[0.9989981,0.00024035852,0.00000600058,0.00032987932,0.00023159092,0.00019408726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009555464,0.00012298417,0.00012263533,0.00033910217,0.0003148791,0.00045512567,0.00023521128,0.000061974024,0.00057149254],"category_scores_gemma":[0.0004613044,0.00012988126,0.000033216886,0.0005506955,0.00007024899,0.00038946874,0.00007488134,0.0003496872,0.002356117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014120777,0.000009878772,0.0010980695,0.000021172367,0.000014514699,0.0000016272963,0.0005877264,0.7821255,0.20061961,0.00021878244,0.011264186,0.00403755],"study_design_scores_gemma":[0.00027432854,0.000014939652,0.0125053665,0.00004114949,0.0000036460813,0.000004319889,0.00020125798,0.97772545,0.007406302,0.000015215938,0.0015685466,0.0002394896],"about_ca_topic_score_codex":0.00014244716,"about_ca_topic_score_gemma":0.000020558075,"teacher_disagreement_score":0.19559997,"about_ca_system_score_codex":0.00016879305,"about_ca_system_score_gemma":0.000023188903,"threshold_uncertainty_score":0.99842066},"labels":[],"label_agreement":null},{"id":"W2091219277","doi":"10.1016/j.dam.2014.05.040","title":"Partial-route inequalities for the multi-vehicle routing problem with stochastic demands","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Bounding overwatch; Mathematical optimization; Stochastic programming; Integer (computer science); Routing (electronic design automation); Integer programming; Reduction (mathematics); Point (geometry); Mathematics; Computer science","score_opus":0.026159374279052298,"score_gpt":0.2626392306662744,"score_spread":0.23647985638722213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091219277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059814285,0.000026915513,0.99087834,0.00006958783,0.000053219603,0.00088239525,0.000014116152,0.00049878086,0.001595222],"genre_scores_gemma":[0.5127568,0.00000194009,0.48663685,0.000036648413,0.00007553615,0.00032850416,0.000010842416,0.000082674174,0.00007020049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869883,0.000024506071,0.0004410709,0.00020479382,0.00021864093,0.00041214188],"domain_scores_gemma":[0.9983354,0.00097469613,0.00013293166,0.0004287099,0.00005643165,0.00007182912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009655498,0.000263066,0.00031796255,0.000041177995,0.00023842067,0.00011638054,0.00025641397,0.00008185057,0.000009693384],"category_scores_gemma":[0.0001259515,0.00017745324,0.00005983283,0.00017510162,0.00007233861,0.00007114931,0.000050700106,0.00016160765,0.0000110768015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012087344,0.000022627359,0.000023269948,0.00041015542,0.00009351936,1.2618237e-7,0.0040194276,0.8886623,0.0008881684,0.10336899,0.000044546352,0.0024547928],"study_design_scores_gemma":[0.00079512276,0.000027958622,0.000016986965,0.00007635022,0.000108300424,0.0000024265034,0.0011497635,0.99312085,0.0017466827,0.002461174,0.00021203181,0.00028232767],"about_ca_topic_score_codex":0.0000029158018,"about_ca_topic_score_gemma":0.0000064678648,"teacher_disagreement_score":0.5067754,"about_ca_system_score_codex":0.000035921614,"about_ca_system_score_gemma":0.000014986686,"threshold_uncertainty_score":0.72363335},"labels":[],"label_agreement":null},{"id":"W2091480483","doi":"10.5539/cis.v8n2p1","title":"Comparing Algorithms for Minimizing Congestion and Cost in the Multi-Commodity k-Splittable Flow","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Chinese Academy of Sciences; National Science Foundation","keywords":"Computer science; Heuristic; Minimum-cost flow problem; Mathematical optimization; Flow network; Key (lock); Flow (mathematics); Algorithm; Point (geometry); Network congestion; Commodity; Mathematics; Computer network; Economics; Network packet; Artificial intelligence; Computer security","score_opus":0.09686624956856517,"score_gpt":0.3138079726063005,"score_spread":0.21694172303773535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091480483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043329123,0.000028501641,0.95575684,0.000060507275,0.00021605386,0.00022724457,0.000002656744,0.00004970396,0.00032935117],"genre_scores_gemma":[0.47766617,0.000011025421,0.52213264,0.00014043128,0.00002465197,0.000015069538,0.000006922155,0.0000021513329,9.715874e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994726,0.000020498119,0.00017642106,0.000068792615,0.00012769783,0.00013397336],"domain_scores_gemma":[0.9996393,0.00009017693,0.000028745715,0.000085401385,0.0001004055,0.000055997556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016872579,0.000059362523,0.00007884466,0.00011067341,0.00012378315,0.0002912354,0.00012888674,0.000022038235,2.1105298e-7],"category_scores_gemma":[0.000082395454,0.00004853855,0.0000062441723,0.0002741426,0.00008267658,0.0023852496,0.00004808788,0.000063212174,0.0000011942308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025910858,0.000004892554,0.0027646439,0.000029852523,0.0000010710659,6.153738e-8,0.005820413,0.87956244,0.00001003191,0.0005126431,0.00020552837,0.11108581],"study_design_scores_gemma":[0.00053941744,0.000011588559,0.0135687785,0.000013608543,0.0000013174473,0.0000072599537,0.00020946295,0.9831348,0.00005433547,0.000022637438,0.0023726444,0.00006415128],"about_ca_topic_score_codex":0.0000050580716,"about_ca_topic_score_gemma":0.000001390243,"teacher_disagreement_score":0.43433702,"about_ca_system_score_codex":0.000034115514,"about_ca_system_score_gemma":0.000019516025,"threshold_uncertainty_score":0.28083897},"labels":[],"label_agreement":null},{"id":"W2091672956","doi":"10.1002/atr.5670430401","title":"A two‐leveled multi‐objective symbiotic evolutionary algorithm for the hub and spoke location problem","year":2009,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Evolutionary algorithm; Mathematical optimization; Convergence (economics); Computer science; Variety (cybernetics); Set (abstract data type); Pareto principle; Multi-objective optimization; Mathematics; Artificial intelligence; Economics","score_opus":0.010033118997782538,"score_gpt":0.26890895472630255,"score_spread":0.25887583572852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091672956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03829191,0.0008401131,0.9600946,0.00014506515,0.00019627891,0.0003659379,0.0000093377685,0.000046547688,0.00001024221],"genre_scores_gemma":[0.46773028,0.0001325309,0.5320185,0.000020118228,0.000063438936,0.0000057712205,0.000008321695,0.000011962011,0.000009125187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991975,0.000025405201,0.00041092053,0.000091769245,0.00014749661,0.00012692394],"domain_scores_gemma":[0.99916613,0.0001607072,0.00018526742,0.0000668027,0.00037557204,0.000045523484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030966802,0.000111115536,0.00015754443,0.00009577893,0.000091747985,0.000015258316,0.00006737279,0.000046146648,0.000002000638],"category_scores_gemma":[0.000038902563,0.000091823844,0.000057156714,0.00022731889,0.000020566376,0.00037608272,5.643846e-7,0.00015038755,2.7201511e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003551694,0.000024005723,0.00014673274,0.00002499253,0.00003326151,0.0000015318901,0.0008903472,0.8652238,0.0026761256,0.00010612229,0.0000068232403,0.13083073],"study_design_scores_gemma":[0.002979498,0.00024297005,0.3123697,0.00014198714,0.00014906173,0.00003271715,0.00068903837,0.67957443,0.0022928298,0.0012522088,0.00009169202,0.00018386547],"about_ca_topic_score_codex":0.0000013730285,"about_ca_topic_score_gemma":0.0000052052487,"teacher_disagreement_score":0.42943838,"about_ca_system_score_codex":0.00007582016,"about_ca_system_score_gemma":0.000035189176,"threshold_uncertainty_score":0.37444675},"labels":[],"label_agreement":null},{"id":"W2093962234","doi":"10.1007/s10732-015-9281-6","title":"A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints","year":2015,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Duration (music); Vehicle routing problem; Mathematical optimization; GRASP; Heuristics; Metaheuristic; Computer science; Set (abstract data type); Heuristic; Local search (optimization); Constraint (computer-aided design); Greedy randomized adaptive search procedure; Routing (electronic design automation); Mathematics; Greedy algorithm","score_opus":0.024286659983326922,"score_gpt":0.25864225172967015,"score_spread":0.23435559174634324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093962234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036011007,0.00045712345,0.9628684,0.0001517839,0.00018509252,0.00021156226,0.000008509452,0.00003106088,0.00007549327],"genre_scores_gemma":[0.83362347,0.000016490489,0.16614868,0.00002135889,0.00014704681,0.0000039421475,0.0000010044839,0.000025794121,0.00001220618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904954,0.000058786103,0.00044044908,0.00007319333,0.00021447387,0.0001635251],"domain_scores_gemma":[0.9984589,0.0006989537,0.00023773112,0.000092237016,0.00039612845,0.000116043826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305803,0.00011750895,0.0002100546,0.000058108013,0.000091569345,0.000084949505,0.00009672295,0.000029957493,0.0000021370718],"category_scores_gemma":[0.0010616597,0.00007822685,0.000031220636,0.00008131863,0.00008772272,0.00010542239,0.0000140011525,0.00019095212,6.4917424e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067184155,0.000015291773,0.00031458633,0.00006129988,0.00012681994,0.000015801179,0.00044191946,0.99248344,0.00020355202,0.0005268023,0.0006289518,0.005114342],"study_design_scores_gemma":[0.0011951475,0.0002033964,0.00026633887,0.00007922316,0.00024927803,0.0005908151,0.00021398763,0.9956166,0.00026200095,0.0010073324,0.00019456432,0.000121326375],"about_ca_topic_score_codex":7.502027e-7,"about_ca_topic_score_gemma":7.654492e-7,"teacher_disagreement_score":0.7976125,"about_ca_system_score_codex":0.0000482268,"about_ca_system_score_gemma":0.00007791949,"threshold_uncertainty_score":0.31899983},"labels":[],"label_agreement":null},{"id":"W2094626628","doi":"10.1002/net.20485","title":"Branch‐and‐cut and hybrid local search for the multi‐level capacitated minimum spanning tree problem","year":2011,"lang":"en","type":"article","venue":"Networks","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":"University of Waterloo","funders":"","keywords":"Minimum spanning tree; Spanning tree; GRASP; Benchmark (surveying); Mathematical optimization; Branch and cut; Branch and bound; Polyhedron; Mathematics; Tree (set theory); Computer science; Cutting-plane method; Combinatorics; Linear programming; Integer programming","score_opus":0.06862574685694278,"score_gpt":0.26602709596399476,"score_spread":0.19740134910705198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094626628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029600073,0.00072521606,0.9684788,0.000039469498,0.00015630688,0.00036825103,0.0000063877947,0.00017662026,0.00044888782],"genre_scores_gemma":[0.82974815,0.00008478735,0.16981567,0.000043142907,0.00009946162,0.000039832757,0.000005469742,0.000048753256,0.00011470915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916047,0.000056456574,0.00018700132,0.00018216592,0.00007778017,0.00033611554],"domain_scores_gemma":[0.9993471,0.00033723481,0.000023936582,0.00015676166,0.000053693217,0.0000812766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005623307,0.00014367801,0.00015093345,0.000039755047,0.00014468945,0.000039754515,0.000106853775,0.00008561925,0.00001050621],"category_scores_gemma":[0.00002479196,0.000117631,0.000029980269,0.00011837269,0.00010481997,0.0000748354,0.00004095413,0.00024490154,0.000001412752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028607918,0.000010419539,0.0023021365,0.00005856248,0.00006810241,0.0000021149713,0.0016839443,0.78671604,0.000094926276,0.00010785311,0.000493415,0.20843385],"study_design_scores_gemma":[0.0005929145,0.00002727783,0.005061332,0.000038075457,0.000025759038,0.000014293411,0.000112799135,0.9931647,0.00053181825,0.00004287986,0.00024232897,0.00014582904],"about_ca_topic_score_codex":0.00002626531,"about_ca_topic_score_gemma":0.000023355868,"teacher_disagreement_score":0.80014807,"about_ca_system_score_codex":0.000019186285,"about_ca_system_score_gemma":0.000008546754,"threshold_uncertainty_score":0.4796853},"labels":[],"label_agreement":null},{"id":"W2094687245","doi":"10.1139/x07-065","title":"Optimization based planning tools for routing of forwarders at harvest areas","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Global Positioning System; Geographic information system; Forwarder; Computer science; Routing (electronic design automation); Software; Vehicle routing problem; Matching (statistics); Real-time computing; Operations research; Computer network; Geography; Engineering; Remote sensing; Telecommunications; Mathematics","score_opus":0.08491294856966414,"score_gpt":0.3542125831139992,"score_spread":0.2692996345443351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094687245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18754116,0.00019847386,0.8096501,0.00010431926,0.00019164648,0.00022567732,0.000015061478,0.000014471539,0.0020590809],"genre_scores_gemma":[0.8767457,0.000003924784,0.12297633,0.00001429622,0.00012806027,0.0000029842886,0.000014827398,0.000044624074,0.000069226655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982255,0.00008960553,0.00056085724,0.00010371587,0.0003699416,0.00065036234],"domain_scores_gemma":[0.99723434,0.0012238821,0.00013773996,0.00016201724,0.00068388897,0.00055811653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00526849,0.00010943725,0.0002225722,0.00095267175,0.00023438301,0.00010766585,0.00028608795,0.00012112863,0.0000512107],"category_scores_gemma":[0.002988918,0.000116490024,0.00010258043,0.00055493065,0.00010493783,0.00028872967,0.000011342564,0.00033982148,0.000001206432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034885892,0.0000035881721,0.0552557,0.000058651738,0.00002567401,0.000025384925,0.00024777936,0.94150573,0.0001456819,0.00011883904,0.0006743881,0.0019036711],"study_design_scores_gemma":[0.0011166089,0.0002033532,0.029396098,0.00037495675,0.000019203268,0.000041207495,0.00052130525,0.9594242,0.0063849245,0.000087543995,0.0022335162,0.00019711014],"about_ca_topic_score_codex":0.00030358418,"about_ca_topic_score_gemma":0.006171528,"teacher_disagreement_score":0.6892046,"about_ca_system_score_codex":0.0005979407,"about_ca_system_score_gemma":0.0007035954,"threshold_uncertainty_score":0.47503254},"labels":[],"label_agreement":null},{"id":"W2096788301","doi":"10.1287/ijoc.1110.0458","title":"Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Innovation Foundation","keywords":"Mathematical optimization; Benders' decomposition; Integer programming; Tabu search; Decomposition; Set (abstract data type); Branch and cut; Truck; Constraint programming; Computer science; Integer (computer science); Branch and price; Facility location problem; Constraint (computer-aided design); Mathematics; Stochastic programming; Engineering","score_opus":0.06676374751484022,"score_gpt":0.28343941804884426,"score_spread":0.21667567053400405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096788301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18132466,0.000014997671,0.8171858,0.00006834786,0.000197434,0.00015134366,0.0000023327445,0.00009634475,0.0009587046],"genre_scores_gemma":[0.63290113,0.0000017832509,0.36677736,0.00024183499,0.00006182791,8.425804e-7,0.0000018830202,0.000012890225,4.607386e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.000032628224,0.00039982522,0.00009901601,0.00017745594,0.0002602356],"domain_scores_gemma":[0.99939823,0.00012685142,0.00014803636,0.00010606041,0.00010536144,0.000115483504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008031879,0.00015219285,0.00014003714,0.00014217469,0.00036395586,0.00014026032,0.00012991684,0.00005811494,0.000007567314],"category_scores_gemma":[0.000053307405,0.00011104183,0.000037551497,0.00023317954,0.0000412168,0.00018917445,0.000020488724,0.0003391715,0.0000029397759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018919762,0.000008982096,0.0005076252,0.00002800906,0.000021633798,0.0000035297019,0.0019389672,0.983667,0.00033762466,0.0016457357,0.000015496154,0.011806445],"study_design_scores_gemma":[0.00033996385,0.000076224234,0.0015876456,0.0002628824,0.000014056078,0.00017145848,0.00026890705,0.9949323,0.0015348452,0.0005774635,0.00005936419,0.00017491145],"about_ca_topic_score_codex":0.0000082075785,"about_ca_topic_score_gemma":0.000003682422,"teacher_disagreement_score":0.45157647,"about_ca_system_score_codex":0.0001484256,"about_ca_system_score_gemma":0.00003465278,"threshold_uncertainty_score":0.45281544},"labels":[],"label_agreement":null},{"id":"W2096910555","doi":"10.1287/ijoc.2014.0600","title":"Districting for Arc Routing","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Arc routing; Roulette; Tabu search; Social connectedness; Compact space; Mathematical optimization; Subroutine; Routing (electronic design automation); Computer science; Heuristic; Context (archaeology); Vehicle routing problem; Mathematics","score_opus":0.017903501821924746,"score_gpt":0.2714472516494821,"score_spread":0.25354374982755734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096910555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11319316,0.00001243003,0.8779364,0.00005257423,0.000980597,0.00009654349,0.0000010070974,0.0003363547,0.007390883],"genre_scores_gemma":[0.8107804,0.0000031909342,0.18808402,0.00016678286,0.00089641206,0.000001236178,0.0000025265697,0.0000426745,0.0000227789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985714,0.000034127508,0.00061091024,0.00011119052,0.00021823533,0.00045411213],"domain_scores_gemma":[0.9986095,0.00078041194,0.00021083378,0.00014196312,0.00011922034,0.00013809538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019203046,0.00018109234,0.00022525318,0.00015992622,0.00043696162,0.0002537524,0.00022379987,0.00007668334,0.000007979014],"category_scores_gemma":[0.001025416,0.00016188594,0.00012644917,0.00022290512,0.0000131112465,0.00021413516,0.000036314308,0.0004723713,0.000014519219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004545232,0.0000040816344,0.0007231378,0.000023416245,0.000018447176,8.093079e-7,0.00022243123,0.76984775,0.00012346273,0.0013183507,0.00015441867,0.22755916],"study_design_scores_gemma":[0.0005505147,0.00007320651,0.0005426023,0.0001385395,0.000008469851,0.00008043882,0.00007425296,0.9918287,0.0007855752,0.00033907648,0.005365251,0.0002133773],"about_ca_topic_score_codex":6.15337e-7,"about_ca_topic_score_gemma":1.4800221e-7,"teacher_disagreement_score":0.6975872,"about_ca_system_score_codex":0.00012766809,"about_ca_system_score_gemma":0.000017013675,"threshold_uncertainty_score":0.6601517},"labels":[],"label_agreement":null},{"id":"W2098090443","doi":"10.1287/trsc.1040.0103","title":"A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":273,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Benchmark (surveying); Algorithm; Computer science; Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Residual; Route planning; Mathematics; Computer network","score_opus":0.01970802792664043,"score_gpt":0.2744546307225553,"score_spread":0.2547466027959149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098090443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13920365,0.000062392966,0.8595569,0.000088836845,0.00010744612,0.00034373847,0.000020570858,0.00023023009,0.0003862369],"genre_scores_gemma":[0.65739566,0.0000067842698,0.3423711,0.000023643734,0.00005229669,0.00003633793,0.000010282063,0.000016025751,0.00008782493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879557,0.000014905723,0.00026364153,0.00021712859,0.0003740411,0.0003347221],"domain_scores_gemma":[0.9993652,0.00018808915,0.000033953642,0.0001652816,0.00020167472,0.000045798966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306915,0.00009606065,0.000085381624,0.00008284735,0.0003764944,0.00010173165,0.00028364453,0.000033014454,0.000017008942],"category_scores_gemma":[0.000013018266,0.00008097542,0.000042316344,0.0008929421,0.00015399845,0.00034428254,0.0000034687466,0.0000982553,0.000007469143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001896534,0.000008540977,0.0014348266,0.000017327702,0.0000035891462,6.431303e-7,0.00057520735,0.91044915,0.010525182,0.0020381075,0.000035684065,0.07490982],"study_design_scores_gemma":[0.00021792519,0.000009224444,0.039293,0.000010857916,0.0000108612585,7.176306e-7,0.00013592058,0.9496039,0.01018211,0.00014414095,0.00028365717,0.00010765858],"about_ca_topic_score_codex":0.0001197365,"about_ca_topic_score_gemma":0.000033653436,"teacher_disagreement_score":0.51819205,"about_ca_system_score_codex":0.00005569974,"about_ca_system_score_gemma":0.00007224539,"threshold_uncertainty_score":0.33020818},"labels":[],"label_agreement":null},{"id":"W2098400882","doi":"10.1287/opre.1050.0240","title":"A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","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":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Column generation; Linear programming relaxation; Branch and cut; Polytope; Scheduling (production processes); Branch and bound; Mathematical optimization; Mathematics; Variable (mathematics); Computer science; Cutting-plane method; Lagrangian relaxation; Integer programming; Algorithm; Combinatorics","score_opus":0.050032287516005525,"score_gpt":0.34981777819464754,"score_spread":0.299785490678642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098400882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035039425,0.0005422738,0.9619544,0.0006527312,0.000060144655,0.0008220011,0.000017566355,0.00015693193,0.00075452833],"genre_scores_gemma":[0.4590064,0.000048794234,0.539563,0.000012921572,0.00018656056,0.00038931,0.000016007129,0.000035925823,0.00074106845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893725,0.0001164372,0.00019747509,0.00017505958,0.00023615547,0.0003376467],"domain_scores_gemma":[0.9987558,0.0007071099,0.0000055353535,0.0002177663,0.00026692558,0.00004684213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293204,0.000087403474,0.00008944868,0.000107273576,0.000802107,0.00028457443,0.00015672618,0.00006479581,0.000021149377],"category_scores_gemma":[0.00022792113,0.00007120371,0.000029948278,0.00041939426,0.00007711845,0.00015171219,0.000050224822,0.00026870827,0.00001819352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016531084,0.000015344935,0.00020788176,0.000018618153,0.0000127058975,3.388702e-7,0.00012284584,0.93391424,0.00908124,0.0008451438,0.00024520032,0.05553477],"study_design_scores_gemma":[0.00036386485,0.000016034246,0.0004608628,0.000012227713,0.0000047379185,0.000003390074,0.00007708152,0.9892592,0.007669643,0.00014486404,0.0019014972,0.00008664245],"about_ca_topic_score_codex":0.00025829932,"about_ca_topic_score_gemma":0.000353205,"teacher_disagreement_score":0.42396697,"about_ca_system_score_codex":0.00005490217,"about_ca_system_score_gemma":0.00004509345,"threshold_uncertainty_score":0.6169239},"labels":[],"label_agreement":null},{"id":"W2098559645","doi":"10.1142/s0129626403001598","title":"PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","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":"Simon Fraser University","funders":"","keywords":"Computer science; Time complexity; Routing (electronic design automation); Algorithm; Vehicle routing problem; Crew; Parallel algorithm; Routing table; Destination-Sequenced Distance Vector routing; Path (computing); Parallel computing; Computer network; Link-state routing protocol; Routing protocol","score_opus":0.03144977875051786,"score_gpt":0.2734180421681125,"score_spread":0.24196826341759464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098559645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010836979,0.0007301245,0.9847465,0.0005711297,0.0002859141,0.00048809536,0.0000033786116,0.00091953215,0.0014183435],"genre_scores_gemma":[0.29382518,0.000015357838,0.7048976,0.00059693796,0.00013594529,0.0001976184,0.000013108543,0.00013247765,0.00018580847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810916,0.000086872344,0.00046792993,0.00039466334,0.00022954897,0.00071182643],"domain_scores_gemma":[0.99931264,0.00012553381,0.00010909727,0.00024825608,0.0000785725,0.0001259297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007708143,0.00031262665,0.0003022616,0.000110292196,0.0002989438,0.00019323047,0.00023273854,0.00012109276,0.000019095452],"category_scores_gemma":[0.0001758099,0.0003353155,0.00010461363,0.00034836208,0.000059011287,0.0003277342,0.000017921133,0.00024693675,0.00002297225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060614607,0.000020950965,0.00069083663,0.0002683169,0.000032608634,0.0000022747372,0.00063981,0.9780455,0.0077020843,0.00032651197,0.0010867943,0.011178207],"study_design_scores_gemma":[0.0012364474,0.000020679186,0.0001922882,0.00010690257,0.000032456075,0.000014991852,0.000081166305,0.98839515,0.0011259725,0.00037578013,0.007856454,0.0005616991],"about_ca_topic_score_codex":0.0000034401191,"about_ca_topic_score_gemma":8.9788836e-7,"teacher_disagreement_score":0.2829882,"about_ca_system_score_codex":0.00010518259,"about_ca_system_score_gemma":0.000036112786,"threshold_uncertainty_score":0.9999099},"labels":[],"label_agreement":null},{"id":"W2098945664","doi":"10.1109/ccece.2003.1226035","title":"A constraint programming approach for the design problem of cellular wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"Constraint (computer-aided design); Computer science; Heuristic; Base station; Wireless; Transceiver; Computer network; Wireless network; Cellular network; Base transceiver station; Mathematical optimization; Constraint programming; Distributed computing; Wi-Fi array; Engineering; Mathematics; Stochastic programming; Telecommunications; Artificial intelligence","score_opus":0.027904475321195957,"score_gpt":0.23993760439169556,"score_spread":0.2120331290704996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098945664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025799184,0.00014458802,0.99746716,0.000027168491,0.000038693208,0.0011040032,7.635744e-7,0.00026125272,0.00069840305],"genre_scores_gemma":[0.37375194,0.0000060586704,0.6260598,0.000007389605,0.00002655414,0.00010867442,0.0000026637772,0.000022485505,0.000014496823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993058,0.00003445897,0.00023423923,0.0001144934,0.00008490608,0.00022610831],"domain_scores_gemma":[0.99951756,0.00019278271,0.000040257033,0.00015846008,0.000056490368,0.00003444225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007652158,0.00010916391,0.00014222212,0.000026987705,0.00006121312,0.000027927383,0.0001445272,0.000073609604,0.000004828186],"category_scores_gemma":[0.000015485428,0.00007881495,0.000058656147,0.00019273872,0.00006380303,0.00003770065,0.00001457338,0.00010084933,2.9412266e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036995013,0.000019157946,0.000011021495,0.00006700465,0.00003743319,1.811709e-7,0.00017547683,0.9521433,0.0010526294,0.0052524414,0.0000152140465,0.04122242],"study_design_scores_gemma":[0.00038018802,0.000026611346,0.0000030836977,0.000016700722,0.000023809456,0.0000029887933,0.00018192701,0.9872495,0.011788303,0.00013852109,0.00008816381,0.000100189965],"about_ca_topic_score_codex":0.0000064039327,"about_ca_topic_score_gemma":4.4186666e-7,"teacher_disagreement_score":0.37349394,"about_ca_system_score_codex":0.000031947962,"about_ca_system_score_gemma":0.000024079,"threshold_uncertainty_score":0.32139805},"labels":[],"label_agreement":null},{"id":"W2099343322","doi":"10.1287/trsc.1090.0295","title":"A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo method; Vehicle routing problem; Mathematical optimization; Integer programming; Branching (polymer chemistry); Computer science; Routing (electronic design automation); Local search (optimization); Algorithm; Mathematics","score_opus":0.011128396429053071,"score_gpt":0.2433868474478958,"score_spread":0.2322584510188427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099343322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24174315,0.000016241182,0.75743777,0.000051108575,0.00017077717,0.00031553573,0.000012711893,0.00020793601,0.000044769833],"genre_scores_gemma":[0.7485476,5.5463795e-7,0.25129712,0.000025836971,0.000040926712,0.0000456007,0.0000028041404,0.000024585761,0.000014948345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987293,0.000010754309,0.0002653459,0.00027021588,0.00037051496,0.0003538551],"domain_scores_gemma":[0.9992231,0.0002235176,0.000066541055,0.00021068977,0.00018484012,0.00009129624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009933149,0.00014076295,0.00012577804,0.000081384875,0.00043931117,0.00012191941,0.0002960119,0.00003206537,0.0000066022826],"category_scores_gemma":[0.00003940117,0.00010665268,0.000037128317,0.00051507034,0.00027894147,0.0004497027,0.0000035818684,0.00022617764,0.0000016105074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004556594,0.000008796775,0.00014804606,0.000011982044,0.000006178949,8.6806364e-7,0.0010546325,0.89618254,0.009979462,0.00016079479,0.0000024810245,0.092439696],"study_design_scores_gemma":[0.0003911308,0.00003747437,0.0035272127,0.000026035455,0.000027306403,0.0000065017302,0.00014829835,0.987553,0.008030937,0.000055991793,0.000037606464,0.0001584921],"about_ca_topic_score_codex":0.000036684047,"about_ca_topic_score_gemma":0.0001564985,"teacher_disagreement_score":0.50680447,"about_ca_system_score_codex":0.000036065376,"about_ca_system_score_gemma":0.00007391199,"threshold_uncertainty_score":0.434917},"labels":[],"label_agreement":null},{"id":"W2099501018","doi":"10.1287/ijoc.1080.0312","title":"<b>State-of-the Art Review</b>—Evolutionary Algorithms for Vehicle Routing","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"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; Benchmark (surveying); Evolutionary algorithm; Computer science; Particle swarm optimization; Mathematical optimization; Routing (electronic design automation); Metaheuristic; Genetic algorithm; Algorithm; Memetic algorithm; Mathematics","score_opus":0.02023764090783845,"score_gpt":0.28665828310789365,"score_spread":0.2664206422000552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099501018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033364467,0.0016749938,0.9579205,0.0010082707,0.0015336183,0.000569491,0.000006711206,0.0002881844,0.0036337606],"genre_scores_gemma":[0.6602071,0.00052080484,0.33552605,0.0027354036,0.0007043511,0.0000036534993,0.0000064280684,0.000068737834,0.00022747635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832165,0.000044719312,0.00083960046,0.000104711246,0.00032589474,0.00036342719],"domain_scores_gemma":[0.9989054,0.00023990026,0.0003374961,0.00021044328,0.00021584278,0.000090885624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013458662,0.00017720091,0.00028555808,0.00009737837,0.0002998027,0.000051581115,0.00033078814,0.00005304221,0.0000073744686],"category_scores_gemma":[0.0004229566,0.00013250181,0.00022043653,0.0003901091,0.000023774031,0.00021759799,0.000035382294,0.0004660174,0.000010307626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006374539,0.000013407765,0.00023655809,0.0000947403,0.00002099045,0.0000013525863,0.00011002744,0.683602,0.00018968663,0.0001476405,0.003336271,0.31224096],"study_design_scores_gemma":[0.00048342027,0.00011239111,0.003781611,0.0017897591,0.000018999228,0.00012658934,0.000013941665,0.98446053,0.001265919,0.00062231085,0.0071176817,0.00020686604],"about_ca_topic_score_codex":2.68875e-7,"about_ca_topic_score_gemma":6.798577e-8,"teacher_disagreement_score":0.6268426,"about_ca_system_score_codex":0.0001413607,"about_ca_system_score_gemma":0.00005078336,"threshold_uncertainty_score":0.54032665},"labels":[],"label_agreement":null},{"id":"W2099721629","doi":"10.5267/j.ijiec.2010.06.003","title":"A variable neighborhood descent based heuristic to solve the capacitated location-routing problem","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variable neighborhood search; Descent (aeronautics); Heuristic; Variable (mathematics); Mathematical optimization; Computer science; Routing (electronic design automation); Facility location problem; Vehicle routing problem; Mathematics; Metaheuristic; Geography; Computer network","score_opus":0.022228937370306505,"score_gpt":0.25980138173700446,"score_spread":0.23757244436669794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099721629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016012449,0.000012548055,0.9774641,0.0017053747,0.004277058,0.00021048285,0.000014748699,0.0001474766,0.00015578131],"genre_scores_gemma":[0.71020365,7.189173e-7,0.28883994,0.00007856542,0.00081830355,0.000009374977,0.000009414821,0.00003564868,0.000004411482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985087,0.000034464007,0.00064730545,0.000117215444,0.00046739724,0.00022494401],"domain_scores_gemma":[0.9977637,0.00066278444,0.00018706522,0.00014674816,0.0010844684,0.00015521239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008065647,0.00017858788,0.00018987492,0.00037535702,0.00008214615,0.00020700002,0.0005473654,0.00011518714,0.000037595186],"category_scores_gemma":[0.0016759429,0.0001594667,0.000078292855,0.0007022089,0.000022461336,0.00018147155,0.000035004246,0.0008505664,0.00001004303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010491054,0.000030261903,0.00016913621,0.0000057472184,0.00012293455,0.0000059541635,0.00028204452,0.98864156,0.003499489,0.003856248,0.0005646588,0.002811493],"study_design_scores_gemma":[0.0007970838,0.000036924284,0.00028903017,0.00017220424,0.000036635636,0.00007184739,0.00005169167,0.9957208,0.0009429706,0.00020474485,0.0015048815,0.00017116078],"about_ca_topic_score_codex":0.000011138159,"about_ca_topic_score_gemma":0.000002366575,"teacher_disagreement_score":0.69419116,"about_ca_system_score_codex":0.00017069634,"about_ca_system_score_gemma":0.00024577722,"threshold_uncertainty_score":0.6502863},"labels":[],"label_agreement":null},{"id":"W2099860183","doi":"10.1016/j.ejor.2009.06.034","title":"An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":272,"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":"Vehicle routing problem; Column generation; Mathematical optimization; Benchmark (surveying); Computer science; Routing (electronic design automation); Shortest path problem; Lagrangian relaxation; Set (abstract data type); Linear programming; Dynamic programming; Mathematics; Computer network","score_opus":0.06359111993787328,"score_gpt":0.3323522610403489,"score_spread":0.2687611411024756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099860183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60983163,0.000106881525,0.38895342,0.00024879305,0.000021690474,0.0003763297,0.000022120004,0.00003625351,0.00040289262],"genre_scores_gemma":[0.5798408,0.000013742621,0.41992632,0.0000171604,0.00011245318,7.245367e-7,0.0000048643965,0.00002740337,0.00005652455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804664,0.0006389552,0.0004423163,0.00013033676,0.00050475996,0.00023701729],"domain_scores_gemma":[0.9981675,0.00054107775,0.00008691329,0.00012468526,0.0009323222,0.00014750626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041287774,0.00010580657,0.00018566125,0.00020981877,0.00015669645,0.00018961122,0.00017947012,0.000023625184,0.000013655309],"category_scores_gemma":[0.00040040998,0.000087440014,0.000034786437,0.00023192585,0.000065518165,0.00063322793,0.00001916371,0.00030558277,0.000002726229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014582185,0.00010396243,0.0013063278,0.000022511971,0.000055375665,0.000033155477,0.000698733,0.7455714,0.11445777,0.00012515782,0.00031240747,0.13716741],"study_design_scores_gemma":[0.001231776,0.0011297185,0.013494716,0.00011299291,0.000008327923,0.00006293878,0.000059409154,0.97646403,0.006857392,0.000021791244,0.00044746874,0.0001094188],"about_ca_topic_score_codex":0.0000017463523,"about_ca_topic_score_gemma":3.4207832e-7,"teacher_disagreement_score":0.23089267,"about_ca_system_score_codex":0.00004178917,"about_ca_system_score_gemma":0.00008057009,"threshold_uncertainty_score":0.35657004},"labels":[],"label_agreement":null},{"id":"W2100711246","doi":"10.1287/ijoc.1060.0202","title":"Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":139,"is_retracted":false,"has_abstract":true,"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; Pickup; FIFO and LIFO accounting; Variable (mathematics); Mathematical optimization; Variable neighborhood search; Heuristic; 2-opt; Traveling purchaser problem; Heuristics; Computer science; Mathematics; FIFO (computing and electronics); Metaheuristic; Artificial intelligence","score_opus":0.01899676715682416,"score_gpt":0.2579686718548559,"score_spread":0.23897190469803173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100711246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117845766,0.00013594127,0.8790553,0.000048997263,0.00019443853,0.00022579348,9.4446557e-7,0.0001192041,0.0023735876],"genre_scores_gemma":[0.66174436,0.000023906394,0.33772793,0.00012073301,0.00032776874,0.0000010492855,9.52772e-7,0.00003735954,0.000015945247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861705,0.000019636687,0.0004697736,0.000119876466,0.00026122798,0.0005124528],"domain_scores_gemma":[0.99836534,0.0010846679,0.00011487367,0.00012136551,0.00017305806,0.00014071225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031454894,0.00018028899,0.00018599184,0.0001387273,0.00061596953,0.0003053269,0.00019160713,0.00007731019,0.0000054603],"category_scores_gemma":[0.000058986854,0.00011913141,0.000044358865,0.00030156094,0.000031703108,0.0002531056,0.00003941976,0.0006296749,0.000002148698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040828723,0.0000061689425,0.0021588174,0.000055281398,0.0000740258,0.000005285873,0.00091510854,0.8868762,0.00024001296,0.0015756001,0.000020747086,0.108031884],"study_design_scores_gemma":[0.00091071316,0.0001595014,0.0014633049,0.00031888098,0.000026755559,0.0003587965,0.0005191457,0.9940493,0.0011794083,0.00016454297,0.0006352821,0.00021434431],"about_ca_topic_score_codex":0.0000037771224,"about_ca_topic_score_gemma":0.0000014263056,"teacher_disagreement_score":0.5438986,"about_ca_system_score_codex":0.00011040676,"about_ca_system_score_gemma":0.00005689162,"threshold_uncertainty_score":0.48580378},"labels":[],"label_agreement":null},{"id":"W2101137675","doi":"10.1109/hicss.2001.926326","title":"Recent trends in logistics and the need for real-time decision tools in the trucking industry","year":2005,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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":"Global Positioning System; Electronic data interchange; The Internet; Decision support system; Computer science; Order (exchange); Real-time data; Information technology; Operations research; Transport engineering; Telecommunications; Business; Engineering; World Wide Web","score_opus":0.0507097824258726,"score_gpt":0.32338946525950196,"score_spread":0.27267968283362937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101137675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42936647,0.0003883532,0.5125624,0.00705201,0.0002464635,0.0009886872,0.000012993266,0.00034023318,0.049042407],"genre_scores_gemma":[0.70036733,0.00046681383,0.298269,0.0003501722,0.00013353267,0.000047129768,0.000009885595,0.0000334203,0.00032272143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926174,0.00010487232,0.00026749205,0.00010213147,0.0000954501,0.00016834035],"domain_scores_gemma":[0.9983297,0.0014366129,0.00002415317,0.00017324039,0.000017517468,0.000018787552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015859109,0.00008968571,0.00013582448,0.00011181164,0.000036789257,0.000069018664,0.00013590703,0.00014016725,0.00006315528],"category_scores_gemma":[0.00051953347,0.000053433963,0.00002012479,0.00040788794,0.000028612154,0.000076749886,0.000023243687,0.0002455992,0.0000015040913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023407003,0.0000064997853,0.000420727,0.0000021559779,0.0000025215436,4.1166166e-7,0.00048311616,0.51175916,0.00004273116,0.00092349655,0.0004831971,0.48585254],"study_design_scores_gemma":[0.0014475313,0.0000086832015,0.006796457,0.000019048783,0.000006372537,0.0000037522655,0.0002232544,0.98786527,0.00010286704,0.00037410317,0.0030640308,0.000088626686],"about_ca_topic_score_codex":0.000015448637,"about_ca_topic_score_gemma":0.000063700994,"teacher_disagreement_score":0.4857639,"about_ca_system_score_codex":0.000066049986,"about_ca_system_score_gemma":0.0000062929416,"threshold_uncertainty_score":0.21789737},"labels":[],"label_agreement":null},{"id":"W2101182156","doi":"10.1002/j.2158-1592.2002.tb00025.x","title":"MEASURING AND MANAGING THE LEARNING REQUIREMENTS OF ROUTE REOPTIMIZATION ON DELIVERY VEHICLE DRIVERS","year":2002,"lang":"en","type":"article","venue":"Journal of Business Logistics","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":"Wilfrid Laurier University","funders":"","keywords":"Flexibility (engineering); Computer science; Traverse; Key (lock); Vehicle routing problem; Risk analysis (engineering); Fleet management; Routing (electronic design automation); Operations management; Transport engineering; Business; Operations research; Computer security; Engineering; Telecommunications; Economics; Computer network","score_opus":0.07466880390798403,"score_gpt":0.2464278950928287,"score_spread":0.17175909118484467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101182156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10935652,0.00035887936,0.88865256,0.00017924007,0.00035648874,0.00005999471,0.0000011060047,0.00004032633,0.0009948632],"genre_scores_gemma":[0.9777007,0.00125953,0.020882873,0.000022672595,0.000081829065,3.3531794e-7,6.0008114e-7,0.000022478664,0.000028948603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990599,0.000081053295,0.00039051316,0.00006814548,0.00027199512,0.00012837016],"domain_scores_gemma":[0.999067,0.00016526546,0.00027900527,0.00010489129,0.00034780492,0.00003602535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129011,0.00010167947,0.0001821693,0.00014066552,0.00009567948,0.00003953294,0.00012770123,0.000047998983,0.000012410602],"category_scores_gemma":[0.0005074466,0.00008317161,0.000032118398,0.00031086823,0.00004804687,0.00016899759,0.000030313367,0.00022882607,0.0000012081231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009404877,0.000012370762,0.002824749,0.000055941902,0.000036647514,0.000009315729,0.00021634036,0.9863104,0.0006580759,0.00007536933,0.00004773015,0.009743655],"study_design_scores_gemma":[0.00037169326,0.000036939095,0.0068535223,0.0001743431,0.000058651116,0.00001894931,0.00011235122,0.9917102,0.00041097836,0.000055390217,0.00010929396,0.00008769869],"about_ca_topic_score_codex":0.0000025890884,"about_ca_topic_score_gemma":5.569426e-7,"teacher_disagreement_score":0.8683442,"about_ca_system_score_codex":0.00007344836,"about_ca_system_score_gemma":0.00000783923,"threshold_uncertainty_score":0.339164},"labels":[],"label_agreement":null},{"id":"W2102346823","doi":"10.1002/net.21562","title":"Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints","year":2014,"lang":"en","type":"article","venue":"Networks","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":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Routing (electronic design automation); Truck; Traverse; Computer science; Mathematical optimization; Arc routing; Vehicle routing problem; Operations research; Mathematics; Engineering; Automotive engineering; Computer network; Geography","score_opus":0.01909616450260213,"score_gpt":0.23929610966925796,"score_spread":0.22019994516665584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102346823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003058404,0.0001869237,0.99086666,0.00007332864,0.00016449475,0.00057552435,0.0000074520517,0.00032771617,0.0047394866],"genre_scores_gemma":[0.9556692,0.0000146818875,0.043705262,0.00010990812,0.0002808975,0.00008478276,0.000014493535,0.00006976582,0.00005099063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986938,0.0001630224,0.00021952638,0.00020903803,0.00016910011,0.00054549286],"domain_scores_gemma":[0.9989917,0.0005015493,0.0000499754,0.00024131317,0.00012431962,0.0000910974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012827261,0.00018333994,0.0001897201,0.000043144428,0.00028221952,0.00007694108,0.00018944382,0.00011635819,0.00004094675],"category_scores_gemma":[0.000044405057,0.00013701551,0.00005207394,0.00026758047,0.0001380067,0.00007920458,0.000029869092,0.00040881505,0.0000048899005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020159836,0.000010151416,0.0024788645,0.0000221706,0.00007809401,6.518815e-7,0.0009771158,0.9673578,0.000018762985,0.0043434487,0.00023882752,0.024453968],"study_design_scores_gemma":[0.00078235037,0.000080204365,0.0004327581,0.0000771308,0.00003159409,0.0000063535563,0.00045112407,0.997311,0.00004766557,0.000063197615,0.00053427514,0.00018236124],"about_ca_topic_score_codex":0.0000054344446,"about_ca_topic_score_gemma":0.000015018277,"teacher_disagreement_score":0.9526108,"about_ca_system_score_codex":0.00006554981,"about_ca_system_score_gemma":0.000034817665,"threshold_uncertainty_score":0.55873305},"labels":[],"label_agreement":null},{"id":"W2102515551","doi":"10.1007/s00291-010-0229-9","title":"Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints","year":2010,"lang":"en","type":"article","venue":"OR Spectrum","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":"Austrian Science Fund","keywords":"Column generation; Computer science; Variable neighborhood search; Mathematical optimization; Heuristic; Integer programming; Algorithm; Set (abstract data type); Variable (mathematics); Relaxation (psychology); Linear programming; Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.01607248361109651,"score_gpt":0.2482842718808206,"score_spread":0.2322117882697241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102515551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096560866,0.00007294222,0.89957243,0.0006339815,0.00037420617,0.0007996182,0.000027850881,0.00044867193,0.0015094465],"genre_scores_gemma":[0.78259856,0.00003647706,0.21694385,0.000025550155,0.00006905721,0.000045476558,0.0000036963038,0.000055264787,0.00022206624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993011,0.000017202514,0.00015706371,0.00017363355,0.00009351899,0.00025749326],"domain_scores_gemma":[0.99946874,0.00019789742,0.000035837627,0.00020552869,0.000023357463,0.00006864432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022857552,0.00014415882,0.00014357975,0.00003625406,0.00012034525,0.00006269492,0.00011783689,0.00008333259,0.00008382682],"category_scores_gemma":[0.000023799692,0.00009248704,0.000028879162,0.00011259583,0.000129561,0.00008263555,0.000021125461,0.00021455319,0.000003435619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036864716,0.000016651196,0.00020090288,0.000040211617,0.00015758375,0.000018023156,0.0006350752,0.95477945,0.0028995234,0.0027888753,0.00008782815,0.038339008],"study_design_scores_gemma":[0.00064041134,0.000064069005,0.00009247989,0.000013483426,0.000036205955,0.00021297541,0.00001860626,0.9909228,0.0056346296,0.0016700099,0.0005200281,0.00017426371],"about_ca_topic_score_codex":0.000007992927,"about_ca_topic_score_gemma":0.00006740356,"teacher_disagreement_score":0.6860377,"about_ca_system_score_codex":0.000016406366,"about_ca_system_score_gemma":0.000023329298,"threshold_uncertainty_score":0.37715122},"labels":[],"label_agreement":null},{"id":"W2103364890","doi":"10.1287/ijoc.1050.0168","title":"Discrepancy-Based Additive Bounding Procedures","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Université de Montréal","funders":"","keywords":"Bounding overwatch; Search tree; Constraint (computer-aided design); Constraint satisfaction problem; Relaxation (psychology); Mathematical optimization; Mathematics; Branch and bound; Key (lock); Upper and lower bounds; Constraint satisfaction; Local consistency; Computer science; Constraint programming; Node (physics); Simple (philosophy); Search algorithm; Artificial intelligence","score_opus":0.009396840119445738,"score_gpt":0.2564636089048323,"score_spread":0.24706676878538653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103364890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27821663,0.000073626245,0.6991756,0.00009275914,0.00086852186,0.00012719567,0.0000048993998,0.0006145217,0.020826282],"genre_scores_gemma":[0.88163775,0.0000042150778,0.11738871,0.0001567097,0.00071174046,0.0000014421379,0.000008432275,0.000042544252,0.00004843314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986339,0.000028558306,0.0005225122,0.000108790686,0.00030841219,0.00039781115],"domain_scores_gemma":[0.9992888,0.0002201528,0.00017642701,0.000116024734,0.00010385369,0.000094770294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056362577,0.00019637818,0.0001947976,0.00024266992,0.0003482088,0.0003002036,0.00017642905,0.00007357117,0.000037014805],"category_scores_gemma":[0.00020306827,0.00016876552,0.00010251574,0.00030336858,0.000027708445,0.0002664852,0.000021464646,0.0004834718,0.000028478362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080978425,0.000012515781,0.0012066357,0.00002749244,0.000016072825,0.000015989277,0.00010496597,0.978745,0.00010481399,0.00089062983,0.00091162056,0.01795616],"study_design_scores_gemma":[0.0006258485,0.000061457715,0.004620547,0.00039356947,0.00001048166,0.00013025757,0.00007056853,0.9858475,0.003086517,0.00058927,0.0042468696,0.0003171438],"about_ca_topic_score_codex":0.0000032345968,"about_ca_topic_score_gemma":0.0000022721636,"teacher_disagreement_score":0.60342115,"about_ca_system_score_codex":0.00019659012,"about_ca_system_score_gemma":0.00008230718,"threshold_uncertainty_score":0.68820584},"labels":[],"label_agreement":null},{"id":"W2103676410","doi":"10.1016/j.ejor.2013.05.024","title":"Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":163,"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":"Column generation; Vehicle routing problem; Branch and price; Computer science; Mathematical optimization; Column (typography); Operations research; Shortest path problem; Integer programming; Integer (computer science); Set (abstract data type); Routing (electronic design automation); Service (business); Mathematics; Economics","score_opus":0.0456891675178521,"score_gpt":0.28375451622333697,"score_spread":0.23806534870548487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103676410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44945183,0.00033067632,0.54802614,0.00029292866,0.000021898382,0.0002516359,0.0000022399806,0.00001912758,0.0016035095],"genre_scores_gemma":[0.9443302,0.000032285552,0.054991435,0.00003013895,0.00024334858,0.0000049250107,0.000005845319,0.0000394901,0.0003223153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981491,0.0006411482,0.00033519117,0.00016509018,0.0004766422,0.0002328387],"domain_scores_gemma":[0.9989504,0.00022495553,0.000060725622,0.00008146565,0.000511993,0.00017043506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003197468,0.00011613713,0.00016044255,0.00017685513,0.0003035308,0.00037689088,0.00009381967,0.000030178946,0.00005742997],"category_scores_gemma":[0.00034253372,0.00010027608,0.0000151345785,0.0001980217,0.00012989056,0.00052057195,0.00005289943,0.00040813864,0.000018012424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000641708,0.00006002508,0.0006963745,0.000072940325,0.000114602786,0.000014489366,0.0027991598,0.7958131,0.17984527,0.0004375706,0.0015076004,0.018574718],"study_design_scores_gemma":[0.00079129654,0.00019248512,0.015778432,0.000050595867,0.000009555417,0.00023398988,0.000119970886,0.9824321,0.0002344125,0.000016186974,0.000025764737,0.000115174706],"about_ca_topic_score_codex":0.0000054701895,"about_ca_topic_score_gemma":4.884592e-7,"teacher_disagreement_score":0.49487838,"about_ca_system_score_codex":0.000051961684,"about_ca_system_score_gemma":0.00006649751,"threshold_uncertainty_score":0.40891397},"labels":[],"label_agreement":null},{"id":"W2105075386","doi":"10.1016/s0166-218x(00)00283-3","title":"The vehicle routing problem with pickups and deliveries on some special graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"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 British Columbia","funders":"","keywords":"Vehicle routing problem; Pickup; Depot; Mathematics; Combinatorics; Routing (electronic design automation); Tree (set theory); Time complexity; Computer science; Graph; Mathematical optimization; Artificial intelligence; Geography","score_opus":0.012250185658381098,"score_gpt":0.20777666955318044,"score_spread":0.19552648389479935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105075386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65567,0.0004813968,0.12201904,0.0006325226,0.0002974605,0.0020386581,0.00003109344,0.0017542571,0.21707559],"genre_scores_gemma":[0.76170635,0.0002451434,0.237323,0.00007656884,0.00022954831,0.00008287282,0.0000039273277,0.00012452075,0.00020808341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906224,0.000014113418,0.00025327128,0.0001611746,0.00021915704,0.00029001661],"domain_scores_gemma":[0.9993444,0.00023642088,0.000068684436,0.00026667613,0.000020865093,0.0000629219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023405439,0.00019831905,0.00018568212,0.00003933767,0.00029387066,0.00013994689,0.00014187691,0.000058461173,0.000023570867],"category_scores_gemma":[0.00002210541,0.00013552242,0.000026719701,0.00016529007,0.000110790425,0.00008150148,0.000040030933,0.0001825823,0.00002139333],"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.000023502886,0.00005204307,0.00010265898,0.00027857418,0.0001333122,0.000005197779,0.008639575,0.057847217,0.0015124384,0.90700597,0.00087442546,0.023525087],"study_design_scores_gemma":[0.0013788547,0.00014501388,0.00024072775,0.00019669862,0.000110506735,0.000021958303,0.0032451462,0.9291613,0.0054946104,0.05709059,0.0020082395,0.00090633397],"about_ca_topic_score_codex":6.5797803e-7,"about_ca_topic_score_gemma":0.0000026723162,"teacher_disagreement_score":0.8713141,"about_ca_system_score_codex":0.000026177857,"about_ca_system_score_gemma":0.000003262705,"threshold_uncertainty_score":0.55264443},"labels":[],"label_agreement":null},{"id":"W2105277320","doi":"10.3138/infor.45.1.41","title":"Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière","year":2007,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","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":true,"route_about_ca":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Minimisation (clinical trials); Humanities; Computer science; Philosophy; Mathematics","score_opus":0.04160118805698877,"score_gpt":0.32969989694323837,"score_spread":0.2880987088862496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105277320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05110631,0.0008937364,0.9212283,0.0029401036,0.0009907085,0.0014555786,0.00019660634,0.00015560571,0.021033062],"genre_scores_gemma":[0.905413,0.00058850343,0.08768668,0.00027980635,0.0015882341,0.00015700262,0.00073048717,0.000060398463,0.0034958932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996051,0.0002024568,0.0013925717,0.00019431628,0.0013170624,0.00084258534],"domain_scores_gemma":[0.9968651,0.0008488741,0.0001440898,0.00024264373,0.0014706072,0.000428714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.011329429,0.0002752429,0.00028947243,0.0006623829,0.0006620969,0.00062593585,0.00023087079,0.000588118,0.00017080075],"category_scores_gemma":[0.00075176253,0.00030159488,0.00006481877,0.000898538,0.00018989616,0.0029793647,0.000055806635,0.00078463106,0.00019109284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008821896,0.00004019235,0.0097309295,0.0008727733,0.000112091846,0.000011806652,0.009368483,0.67518526,0.00010956414,0.16976878,0.005465067,0.12924682],"study_design_scores_gemma":[0.0009291168,0.00008362266,0.02058035,0.00021189018,0.000015850032,0.0001508362,0.0027135883,0.6334737,0.0006786522,0.00011545114,0.34073836,0.00030858137],"about_ca_topic_score_codex":0.0014355705,"about_ca_topic_score_gemma":0.000037563084,"teacher_disagreement_score":0.8543067,"about_ca_system_score_codex":0.0006987351,"about_ca_system_score_gemma":0.00062335364,"threshold_uncertainty_score":0.9999436},"labels":[],"label_agreement":null},{"id":"W2105559690","doi":"10.1109/mis.2005.58","title":"A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows","year":2005,"lang":"en","type":"article","venue":"IEEE Intelligent Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"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; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Computer science; Metaheuristic; Mechanism (biology); Diversification (marketing strategy); Identification (biology); Search algorithm; Focus (optics); Guided Local Search; Search engine; Data mining; Artificial intelligence; Information retrieval; Algorithm","score_opus":0.03859701775495493,"score_gpt":0.29243788783210617,"score_spread":0.2538408700771512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105559690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023093948,0.0004106834,0.9706562,0.00025947343,0.00035251965,0.0022037926,0.000016329259,0.0004992344,0.00250782],"genre_scores_gemma":[0.9713239,0.000022324546,0.024143679,0.00006207449,0.0006754352,0.00038666636,0.0000072856806,0.00011695846,0.0032616782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836177,0.00015269514,0.0004988025,0.0002547567,0.00028890045,0.0004430538],"domain_scores_gemma":[0.9986522,0.00056246493,0.00006732985,0.00034381426,0.00028664453,0.00008755063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013078876,0.00023023624,0.0002737305,0.000071854396,0.00022599018,0.00018414567,0.000298209,0.00009038956,0.000034210745],"category_scores_gemma":[0.000038502472,0.00015688293,0.000065621585,0.0003142224,0.000048501108,0.00014367356,0.000019327546,0.00021152908,0.00021220173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001638438,0.000014977368,0.00014572473,0.00006587752,0.00012085467,9.844617e-7,0.0015423613,0.9885264,0.0041999537,0.00026750943,0.0017676327,0.003331326],"study_design_scores_gemma":[0.00029021496,0.00006103527,0.0000092119,0.0001339649,0.000026407834,0.000024319112,0.00034484194,0.93674695,0.05333396,0.0000014198986,0.008817241,0.00021041046],"about_ca_topic_score_codex":0.000051409155,"about_ca_topic_score_gemma":0.000009984766,"teacher_disagreement_score":0.94822997,"about_ca_system_score_codex":0.00021452103,"about_ca_system_score_gemma":0.00004895035,"threshold_uncertainty_score":0.63975},"labels":[],"label_agreement":null},{"id":"W2106541949","doi":"10.1287/trsc.37.1.1.12822","title":"Models and Methods for Merge-in-Transit Operations","year":2003,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Rounding; Integer programming; Merge (version control); Linear programming; Cutting-plane method; Computer science; Piecewise linear function; Branch and bound; Mathematics","score_opus":0.038218333922510804,"score_gpt":0.3652933841581758,"score_spread":0.327075050235665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106541949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056836594,0.00010594202,0.9419506,0.00003525378,0.00010816815,0.00020392211,0.0000050925037,0.00008271943,0.0006716806],"genre_scores_gemma":[0.4731925,0.000024530133,0.5267179,0.000016547381,0.0000020755335,0.000022899565,0.0000020891675,0.000007055757,0.000014360282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992991,0.000033183176,0.00021139185,0.0001842144,0.00009888987,0.00017323982],"domain_scores_gemma":[0.9996757,0.00007619391,0.00000946019,0.00009707337,0.000079503276,0.000062054845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013013805,0.00007375949,0.00009635251,0.00014499175,0.00010688421,0.00003685306,0.00007845369,0.000030719104,0.00001245588],"category_scores_gemma":[0.00005870279,0.00007957116,0.000017303231,0.00064095383,0.00007814565,0.0005103981,4.8727946e-7,0.000050301245,5.0016916e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.104475e-7,0.000004017404,0.00015731256,0.000012785732,0.0000012476597,1.2123576e-7,0.0011995642,0.95153314,0.01680601,0.026951343,0.0000011964713,0.0033323755],"study_design_scores_gemma":[0.00025003986,0.000007146253,0.0021549154,0.000006703304,0.0000066640405,7.262161e-7,0.00010333844,0.97616434,0.01888955,0.0021237088,0.00018520941,0.00010763486],"about_ca_topic_score_codex":0.0000067294804,"about_ca_topic_score_gemma":0.00004858137,"teacher_disagreement_score":0.4163559,"about_ca_system_score_codex":0.000021685466,"about_ca_system_score_gemma":0.000045407043,"threshold_uncertainty_score":0.3244818},"labels":[],"label_agreement":null},{"id":"W2106852598","doi":"10.1016/j.cor.2005.07.015","title":"A first multilevel cooperative algorithm for capacitated multicommodity network design","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"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 Manitoba; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Benchmark (surveying); Computer science; Mathematical optimization; Set (abstract data type); Network planning and design; Algorithm; Mathematics; Computer network","score_opus":0.13078813271017706,"score_gpt":0.3751517516909518,"score_spread":0.24436361898077472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106852598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097347103,0.00013637487,0.9960888,0.00047977592,0.00032172582,0.0014880825,0.000046837104,0.0003831083,0.000081837956],"genre_scores_gemma":[0.05110432,0.000040512892,0.94738543,0.000072413124,0.0005760415,0.00044994225,0.00006764007,0.000066121334,0.00023758649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775445,0.0005266124,0.0003755769,0.0003444038,0.00031552548,0.0006834227],"domain_scores_gemma":[0.99707586,0.0014810453,0.000011792241,0.00037257915,0.0008771797,0.0001815459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019167478,0.00020949473,0.00024572283,0.0002175138,0.0010928911,0.00032203906,0.00037816764,0.00013184591,0.000051141982],"category_scores_gemma":[0.00031056677,0.00022020262,0.00006118779,0.00065775844,0.00013539045,0.00032696637,0.000090477566,0.00046285053,0.000080321355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059453578,0.000050802446,0.0000038267785,0.00001302917,0.00004700305,0.0000012210146,0.0009620194,0.91235477,0.00016238059,0.00021679168,0.012880149,0.073302075],"study_design_scores_gemma":[0.0008409924,0.00007386545,0.000062965504,0.000043618358,0.0000064527417,0.0000044671247,0.00004834004,0.9918964,0.0013664837,0.000021796146,0.005397871,0.00023675065],"about_ca_topic_score_codex":0.00003012111,"about_ca_topic_score_gemma":0.00009021634,"teacher_disagreement_score":0.07954164,"about_ca_system_score_codex":0.00032252612,"about_ca_system_score_gemma":0.00010491745,"threshold_uncertainty_score":0.89796025},"labels":[],"label_agreement":null},{"id":"W2107306858","doi":"10.1007/s10732-006-4192-1","title":"Path relinking for the vehicle routing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"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; Computer Research Institute of Montréal","funders":"Norges Forskningsråd","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Path (computing); Vehicle routing problem; Hill climbing; Mathematics; Local search (optimization); Heuristic; Local optimum; Travelling salesman problem; Routing (electronic design automation); Computer science","score_opus":0.012837469884270425,"score_gpt":0.24824476457955647,"score_spread":0.23540729469528604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107306858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012662991,0.00066012493,0.98511267,0.0002178635,0.0005065068,0.00010972966,0.000003929306,0.00005839981,0.0006677684],"genre_scores_gemma":[0.6400168,0.000050788123,0.35907593,0.00003173698,0.0007277335,0.0000017571238,8.6581207e-7,0.000034322715,0.00006008029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990395,0.000034407774,0.00051371485,0.000051340252,0.00017887559,0.00018216665],"domain_scores_gemma":[0.9988367,0.0005984287,0.00020750506,0.00010789396,0.00021924313,0.000030250578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010687532,0.000089234,0.00015028291,0.000046025787,0.00012334697,0.000061711035,0.00016831692,0.000051360905,0.0000042890415],"category_scores_gemma":[0.00028321688,0.00006532668,0.000086672444,0.00012497988,0.00001694735,0.0000648023,0.000015024471,0.00023850439,0.0000014151785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008021782,0.000013767555,0.0014817017,0.00005514925,0.00002661032,0.0000066065436,0.00010192372,0.98535323,0.0011463729,0.0013429122,0.004850187,0.0056134937],"study_design_scores_gemma":[0.00044812943,0.000047889785,0.0012843467,0.00008752912,0.00007077747,0.000052884734,0.000054855496,0.9848622,0.00095164333,0.0025446985,0.009482022,0.00011304324],"about_ca_topic_score_codex":0.0000028415752,"about_ca_topic_score_gemma":8.749541e-7,"teacher_disagreement_score":0.6273538,"about_ca_system_score_codex":0.000055711324,"about_ca_system_score_gemma":0.000025924357,"threshold_uncertainty_score":0.26639447},"labels":[],"label_agreement":null},{"id":"W2107357529","doi":"10.1287/opre.2014.1263","title":"Hub Location as the Minimization of a Supermodular Set Function","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Concordia University","funders":"","keywords":"Solver; Mathematical optimization; Benchmark (surveying); Class (philosophy); Minification; Heuristic; Set (abstract data type); Mathematics; Integer programming; Greedy algorithm; Integer (computer science); Function (biology); Path (computing); Exploit; Computer science; Artificial intelligence","score_opus":0.056461730768427844,"score_gpt":0.36038887978756,"score_spread":0.30392714901913215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107357529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1827278,0.00009409902,0.80963963,0.00069446856,0.0001660428,0.00042892902,0.0000041014205,0.00012292282,0.006121974],"genre_scores_gemma":[0.9881482,0.00003747368,0.010934886,0.000030696814,0.000101829915,0.00007406526,0.000060738734,0.00002625087,0.0005858496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985068,0.00054942333,0.0002310176,0.00013687224,0.00039428374,0.00018160406],"domain_scores_gemma":[0.99866027,0.00021978372,0.000009165693,0.00038401256,0.00068541383,0.000041357576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018604969,0.00007280272,0.00008564279,0.00018704498,0.00031011412,0.00008952854,0.00017370925,0.000073785435,0.00017947285],"category_scores_gemma":[0.00094832544,0.000060516097,0.000022285023,0.0010185444,0.000082690516,0.0001848277,0.000032103602,0.00020844143,0.00010324829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042947095,0.000012061225,0.00011229777,0.000031470536,0.000009109573,5.352724e-8,0.0005566458,0.9779009,0.0076862583,0.0076118805,0.0005210257,0.005553999],"study_design_scores_gemma":[0.00014801577,0.000049504306,0.0014500117,0.00001631038,0.000006789783,0.0000018512387,0.00022846878,0.9878901,0.0073430226,0.00020333611,0.0025984766,0.000064076296],"about_ca_topic_score_codex":0.00007632024,"about_ca_topic_score_gemma":0.000036441503,"teacher_disagreement_score":0.8054204,"about_ca_system_score_codex":0.000055207267,"about_ca_system_score_gemma":0.00006033805,"threshold_uncertainty_score":0.24677747},"labels":[],"label_agreement":null},{"id":"W2108538642","doi":"10.1287/trsc.34.4.426.12325","title":"Diversion Issues in Real-Time Vehicle Dispatching","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":238,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Heuristic; Vehicle routing problem; Operations research; Routing (electronic design automation); Service (business); Engineering; Computer network; Operations management; Algorithm","score_opus":0.011913991363816104,"score_gpt":0.27806692144220835,"score_spread":0.26615293007839225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108538642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921557,0.000016918668,0.0036418498,0.00006745427,0.000051136718,0.00007540004,0.0000041386825,0.0002664549,0.0037209475],"genre_scores_gemma":[0.97521716,0.00012675543,0.024318278,0.000016215527,0.000011942799,0.0000030079427,0.0000075873136,0.00001057609,0.00028847848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991424,0.000018228522,0.00018652328,0.00017872403,0.00027345875,0.00020063327],"domain_scores_gemma":[0.9997445,0.000030557687,0.0000144906735,0.0001237028,0.000027568238,0.000059208513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004779069,0.000074588075,0.000087562374,0.00012223999,0.000094483905,0.000034687757,0.0001747615,0.000028859105,0.0005795666],"category_scores_gemma":[0.000010598161,0.0000804625,0.000017644943,0.00087618176,0.00007470615,0.0005738688,0.000001551604,0.00007043833,0.00011033525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054300776,0.00001094587,0.017223928,0.000010420426,9.577618e-7,0.000004474439,0.0029764324,0.90499544,0.052787356,0.000102806545,0.000024263476,0.021857515],"study_design_scores_gemma":[0.00024528836,0.000009672055,0.4469493,0.000032098014,0.0000033468114,3.6613645e-7,0.00007835457,0.5433169,0.008855324,0.00009483474,0.000261241,0.00015324507],"about_ca_topic_score_codex":0.00013591406,"about_ca_topic_score_gemma":0.000025005507,"teacher_disagreement_score":0.42972538,"about_ca_system_score_codex":0.00004901179,"about_ca_system_score_gemma":0.000017767625,"threshold_uncertainty_score":0.6345848},"labels":[],"label_agreement":null},{"id":"W2108911946","doi":"10.1287/ijoc.2013.0550","title":"Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":true,"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":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Routing (electronic design automation); Index (typography); Production (economics); Branch and cut; Algorithm; Order (exchange); Enumeration; Integer programming; Operations research; Mathematics; Economics","score_opus":0.02831864026295009,"score_gpt":0.2741303086561243,"score_spread":0.24581166839317423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108911946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678395,0.000115546485,0.32047635,0.00014844436,0.00024945935,0.00036777792,8.100854e-7,0.000120189085,0.00012641631],"genre_scores_gemma":[0.89616895,0.0000438473,0.10339541,0.00005942924,0.00026231885,0.000008232647,0.0000015814131,0.000027708162,0.000032544463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905026,0.000025939347,0.00040570114,0.00013569334,0.0001209321,0.0002614694],"domain_scores_gemma":[0.99933636,0.0001822939,0.00014115186,0.00007133682,0.00014360812,0.00012526916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084803894,0.00014786712,0.00016483788,0.00014601195,0.0004954819,0.000253033,0.000050010094,0.00006844722,0.000002869488],"category_scores_gemma":[0.00034177405,0.00013080273,0.000029811274,0.00011415232,0.000036257068,0.0006793909,0.000041128733,0.00032760823,0.0000017386062],"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.000005174528,0.000011485189,0.012324706,0.00013444698,0.00005097962,3.3668343e-7,0.0033545133,0.49133986,0.0010916425,0.00026851802,0.00007746506,0.49134088],"study_design_scores_gemma":[0.000499277,0.00006207439,0.0135707455,0.00019748099,0.000010118767,0.00011668673,0.00016038728,0.9839265,0.00044060993,0.0006668238,0.00018042335,0.00016891574],"about_ca_topic_score_codex":0.000006508903,"about_ca_topic_score_gemma":0.0000014969936,"teacher_disagreement_score":0.4925866,"about_ca_system_score_codex":0.000055952023,"about_ca_system_score_gemma":0.000011728391,"threshold_uncertainty_score":0.53339803},"labels":[],"label_agreement":null},{"id":"W2109346100","doi":"10.5267/j.ijiec.2012.10.001","title":"Differential evolution algorithm for multi-commodity and multi-level of service hub covering location problem","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Punctuality; Commodity; Service (business); Computer science; Reliability (semiconductor); Quality of service; Operations research; Mathematical optimization; Economics; Business; Mathematics; Computer network; Engineering; Marketing; Transport engineering; Finance","score_opus":0.11017214759722337,"score_gpt":0.3225071914205642,"score_spread":0.21233504382334084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109346100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043059744,0.000093622315,0.95429236,0.000102727936,0.0021045431,0.00018878731,0.00010130581,0.00005448549,0.0000024318028],"genre_scores_gemma":[0.52815753,0.0000056991344,0.47129536,0.000004921008,0.00048353153,0.000006147154,0.000021994976,0.000021716902,0.0000030841425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888724,0.000033404176,0.00056956615,0.00007971866,0.00025803363,0.00017202318],"domain_scores_gemma":[0.99851793,0.00022167507,0.0002547319,0.00006332517,0.0008401159,0.000102240636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037152722,0.00014679212,0.00022351512,0.00031845208,0.000038000013,0.000040906205,0.00018911787,0.0001237556,0.000004458239],"category_scores_gemma":[0.00024780008,0.0001628306,0.00006949574,0.00022572411,0.000017391734,0.0004254752,0.00003970509,0.0002457167,6.3727214e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001085282,0.000084799925,0.0005757615,0.00003494686,0.00018255437,3.3363946e-7,0.00034356138,0.9687114,0.0020917743,0.00024115658,0.000040687963,0.027682202],"study_design_scores_gemma":[0.0021482878,0.000027516398,0.004398513,0.0001776576,0.00004925443,0.0000362107,0.00005250427,0.9908442,0.00202092,0.000015933807,0.00009128486,0.00013769865],"about_ca_topic_score_codex":0.000015840253,"about_ca_topic_score_gemma":0.000002168864,"teacher_disagreement_score":0.4850978,"about_ca_system_score_codex":0.00021058119,"about_ca_system_score_gemma":0.000056337765,"threshold_uncertainty_score":0.66400397},"labels":[],"label_agreement":null},{"id":"W2110105948","doi":"10.1002/net.10009","title":"A comparative analysis of several formulations for the generalized minimum spanning tree problem","year":2001,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"Minimum spanning tree; Polytope; Spanning tree; Heuristics; Combinatorics; Mathematics; Tree (set theory); Mathematical optimization; Computer science","score_opus":0.03965971433503258,"score_gpt":0.31007744587188296,"score_spread":0.2704177315368504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110105948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027346566,0.00024762523,0.97010255,0.00005177044,0.00008391028,0.0002964166,0.0000056414233,0.00010175886,0.0017637784],"genre_scores_gemma":[0.79475075,0.00003051234,0.20481881,0.00002808499,0.000093884264,0.000054090062,0.00003876562,0.0000133611375,0.00017174735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929893,0.000045451317,0.00027496542,0.000102438535,0.00008415726,0.00019403221],"domain_scores_gemma":[0.99919707,0.00043923067,0.00007050927,0.00017987475,0.00008286843,0.000030438008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002818847,0.000102007136,0.00027633022,0.000107897074,0.00010339139,0.000022686389,0.000113397335,0.00006391295,0.00003273491],"category_scores_gemma":[0.000014202132,0.00008203496,0.00014791879,0.0010011916,0.000021727987,0.000064172644,0.000014656442,0.00008699585,4.162356e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014678897,0.0000069790417,0.0017144894,0.0000040347086,0.0006213756,1.2488468e-7,0.00060459727,0.99361145,0.000041330415,0.00042095434,0.00064367783,0.002316318],"study_design_scores_gemma":[0.000337079,0.00001142415,0.005938533,0.000007675941,0.00050032313,5.870894e-7,0.000043271226,0.99181217,0.0000263764,0.00006237414,0.0011696339,0.00009054278],"about_ca_topic_score_codex":0.000010288926,"about_ca_topic_score_gemma":0.000069938804,"teacher_disagreement_score":0.7674042,"about_ca_system_score_codex":0.000027729533,"about_ca_system_score_gemma":0.00000712227,"threshold_uncertainty_score":0.33452886},"labels":[],"label_agreement":null},{"id":"W2110620774","doi":"10.1287/opre.1120.1154","title":"An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"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; Benchmark (surveying); Column generation; Mathematical optimization; Routing (electronic design automation); Computer science; Vehicle routing problem; Arc (geometry); Enhanced Data Rates for GSM Evolution; Mathematics; Artificial intelligence","score_opus":0.05729250841713738,"score_gpt":0.3586774357342097,"score_spread":0.3013849273170723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110620774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04350312,0.000049921255,0.9534964,0.00033226315,0.00003522759,0.0014013036,0.000008793168,0.00018795698,0.000985043],"genre_scores_gemma":[0.48094556,0.00001253589,0.5177647,0.000012347869,0.00008536769,0.0007118451,0.000020582023,0.00004592886,0.00040113885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.00025012408,0.00020576835,0.0002077722,0.0003053408,0.00047376336],"domain_scores_gemma":[0.99837434,0.0005444712,0.000008598156,0.0003365917,0.0006281308,0.0001078849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019377356,0.00011595809,0.000109973866,0.00014829503,0.0009898954,0.0006153723,0.0002566644,0.000062078434,0.00010808259],"category_scores_gemma":[0.0001502446,0.00007962452,0.000021411834,0.000608719,0.00008782712,0.00048728526,0.000022582739,0.00034728242,0.00004237916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016001695,0.000016779735,0.00012738087,0.000015067082,0.00003363442,4.744958e-7,0.0010752396,0.94329983,0.008313262,0.0005574081,0.00027556557,0.046283737],"study_design_scores_gemma":[0.00025136044,0.000082409126,0.0003018955,0.000026233067,0.0000065025843,0.0000065743957,0.0008210493,0.99446166,0.003664869,0.0000497719,0.00021076095,0.00011691028],"about_ca_topic_score_codex":0.0002946126,"about_ca_topic_score_gemma":0.00012567652,"teacher_disagreement_score":0.43744245,"about_ca_system_score_codex":0.00009857536,"about_ca_system_score_gemma":0.00007030009,"threshold_uncertainty_score":0.76135755},"labels":[],"label_agreement":null},{"id":"W2111891958","doi":"10.1287/trsc.1110.0379","title":"Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Crew scheduling; Column generation; Set cover problem; Operations research; Computer science; Context (archaeology); Scheduling (production processes); Constraint (computer-aided design); Schedule; Set (abstract data type); Engineering; Mathematical optimization; Aeronautics; Operations management; Mathematics","score_opus":0.022086663682596548,"score_gpt":0.25354447872781116,"score_spread":0.23145781504521462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111891958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3977377,0.00006712984,0.6010334,0.000021295367,0.000090203066,0.00011491752,0.00001558935,0.00023025041,0.0006895247],"genre_scores_gemma":[0.8826872,0.00004744689,0.11715522,0.000028134411,0.0000034729674,0.000009509252,0.00002615451,0.000013364196,0.000029511173],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989925,0.00002281689,0.0002884466,0.00023813848,0.00025355603,0.00020456703],"domain_scores_gemma":[0.99958473,0.00003196447,0.000054177635,0.0001223201,0.00009631609,0.0001104617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064049696,0.000121089506,0.00011094707,0.00012021971,0.000110298315,0.000040191982,0.0001264502,0.00004429717,0.00010840378],"category_scores_gemma":[0.000037259324,0.00012185838,0.000018040566,0.0005417436,0.00026458816,0.00039933276,0.0000025714935,0.00010246933,0.000005482142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037483336,0.00012385167,0.023083936,0.00021450857,0.000051914765,0.000017762028,0.018835336,0.17130738,0.42249426,0.0041313926,0.00013166813,0.3595705],"study_design_scores_gemma":[0.0005356836,0.00005403106,0.08862447,0.00010171938,0.000028388456,0.0000053422928,0.000746094,0.8359214,0.07317291,0.00028133838,0.00016070942,0.0003679128],"about_ca_topic_score_codex":0.000029944003,"about_ca_topic_score_gemma":0.000024283192,"teacher_disagreement_score":0.664614,"about_ca_system_score_codex":0.000073873714,"about_ca_system_score_gemma":0.00004540226,"threshold_uncertainty_score":0.49692407},"labels":[],"label_agreement":null},{"id":"W2111991140","doi":"10.1016/j.cor.2013.07.002","title":"A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","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":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Column generation; Column (typography); Computer science; Operations research; Distribution (mathematics); Algorithm; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.11643665802848882,"score_gpt":0.3754091867212523,"score_spread":0.25897252869276344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111991140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023663653,0.000056358604,0.9748517,0.00034118196,0.00017084711,0.0006503122,0.00009873618,0.000052040676,0.000115152245],"genre_scores_gemma":[0.57218796,0.000025536934,0.4269568,0.00001906962,0.00015825381,0.00015657351,0.00041616088,0.00001892667,0.000060696744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989447,0.00012743504,0.00024587856,0.00016526692,0.00018738925,0.000329329],"domain_scores_gemma":[0.9987726,0.00030633854,0.000010361976,0.00015070091,0.00057995634,0.00018003791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060918863,0.00008704286,0.00013209703,0.0003543056,0.00036962007,0.00023916173,0.00012127922,0.00009364269,0.00002099587],"category_scores_gemma":[0.00032182407,0.000095795636,0.00002321099,0.00051619986,0.0001005939,0.000190589,0.000033805958,0.0001818367,0.000004952897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.383454e-7,0.000011517731,0.00007758757,0.000027453229,0.000024480623,8.336574e-7,0.00030121283,0.9475941,0.0016130181,0.0016637556,0.007650644,0.041034628],"study_design_scores_gemma":[0.00020099572,0.000056717283,0.00042877696,0.000018074294,0.000005613226,0.0000037742986,0.00008615418,0.99607885,0.0018658645,0.00004195159,0.0011201493,0.00009305069],"about_ca_topic_score_codex":0.006500946,"about_ca_topic_score_gemma":0.002395713,"teacher_disagreement_score":0.5485243,"about_ca_system_score_codex":0.00016671025,"about_ca_system_score_gemma":0.00013346624,"threshold_uncertainty_score":0.9827529},"labels":[],"label_agreement":null},{"id":"W2112496246","doi":"10.1016/j.cor.2005.02.033","title":"Variable neighborhood search and local branching","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":188,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Variable neighborhood search; Solver; Mathematical optimization; Integer programming; Local search (optimization); Branching (polymer chemistry); Heuristic; Variable (mathematics); Mathematics; Limit (mathematics); Set (abstract data type); Black box; Computer science; Integer (computer science); Metaheuristic; Algorithm; Artificial intelligence","score_opus":0.03926352547568592,"score_gpt":0.3419667686314819,"score_spread":0.302703243155796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112496246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024294889,0.0003222674,0.97093934,0.0005627503,0.00011249227,0.00022052397,0.0000034090326,0.00023426449,0.003310087],"genre_scores_gemma":[0.603884,0.00004327923,0.39560217,0.000051465875,0.0001886861,0.0000144190235,0.000008377452,0.000027422355,0.0001802425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984638,0.00029179626,0.00020947408,0.00024393479,0.000349728,0.00044124917],"domain_scores_gemma":[0.99909025,0.00025291616,0.0000025419754,0.00028125636,0.00021099864,0.00016205228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014188918,0.00011141747,0.00013116276,0.0002849891,0.00046172747,0.00036149178,0.00022796668,0.000079715566,0.00010050096],"category_scores_gemma":[0.000070113725,0.00011977525,0.000018613488,0.00067640434,0.00011259648,0.0003516903,0.00015774526,0.0005445659,0.00007831847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016621624,0.000016543592,0.00006827213,0.000019577552,0.0000143437555,0.0000012988284,0.00052766217,0.90391797,0.0011365509,0.0075224186,0.0005608739,0.08621283],"study_design_scores_gemma":[0.00027280013,0.000024553614,0.00024680275,0.000026963276,0.0000021619367,0.00001349618,0.00008378068,0.99600554,0.0010494713,0.000057538018,0.0020950846,0.00012179827],"about_ca_topic_score_codex":0.00004765474,"about_ca_topic_score_gemma":0.0000239383,"teacher_disagreement_score":0.57958907,"about_ca_system_score_codex":0.00014006428,"about_ca_system_score_gemma":0.0000787235,"threshold_uncertainty_score":0.4884293},"labels":[],"label_agreement":null},{"id":"W2113574878","doi":"10.1287/opre.2013.1160","title":"Robust Partitioning for Stochastic Multivehicle Routing","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"HEC Montréal","funders":"Boeing","keywords":"Computer science; Partition (number theory); Independent and identically distributed random variables; Vehicle routing problem; Heuristic; Mathematical optimization; Regular polygon; Workload; Order (exchange); Product (mathematics); Service (business); Routing (electronic design automation); Operations research; Random variable; Mathematics; Economics; Artificial intelligence","score_opus":0.1431070788548276,"score_gpt":0.3784082997950221,"score_spread":0.2353012209401945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113574878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08086171,0.000043661363,0.9164227,0.0003000233,0.00009059009,0.000833277,0.000008401941,0.00023180064,0.0012077895],"genre_scores_gemma":[0.7762306,0.0000037243663,0.22190936,0.000013750976,0.00012050475,0.0007833205,0.00002391991,0.000038314607,0.00087653246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987995,0.00013762644,0.00021809901,0.00018452253,0.00022802076,0.00043225766],"domain_scores_gemma":[0.9986657,0.0004220642,0.0000057884145,0.000206419,0.0006016337,0.00009843274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384192,0.00008833797,0.00009880624,0.00016115393,0.000656762,0.0003376132,0.00014259992,0.0000650587,0.00037165196],"category_scores_gemma":[0.00090554886,0.000093243,0.000032129705,0.00043939654,0.00005459979,0.00036475563,0.00004024883,0.0002555219,0.00027903047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0976266e-7,0.00001283261,0.00007213459,0.000012154126,0.0000098249,1.2496572e-7,0.0003269689,0.9868843,0.007270572,0.0010779706,0.0006487751,0.0036834585],"study_design_scores_gemma":[0.00024438213,0.000021467642,0.0006298018,0.000022740298,0.0000025190652,0.0000012546003,0.0003637342,0.9963327,0.002048285,0.00008663684,0.00014062917,0.00010584822],"about_ca_topic_score_codex":0.00010865894,"about_ca_topic_score_gemma":0.000047365946,"teacher_disagreement_score":0.6953689,"about_ca_system_score_codex":0.000112508074,"about_ca_system_score_gemma":0.000042162097,"threshold_uncertainty_score":0.5051349},"labels":[],"label_agreement":null},{"id":"W2113781679","doi":"10.1287/trsc.1100.0322","title":"Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling","year":2010,"lang":"en","type":"article","venue":"EUR Research Repository (Erasmus University Rotterdam)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":95,"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; Computer science; Selection (genetic algorithm); Crew; Computation; Core (optical fiber); Mathematical optimization; Column (typography); Operations research; Crew scheduling; Lagrangian; Engineering; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.02692870416305316,"score_gpt":0.28469859632522826,"score_spread":0.2577698921621751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113781679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78623825,0.00001570453,0.2078824,0.00014962687,0.00047317042,0.00074345054,0.0000075434264,0.00044380318,0.004046014],"genre_scores_gemma":[0.8964979,0.000011315283,0.09904903,0.000011813997,0.0003421028,0.000013004385,0.00002862253,0.00006515163,0.003981043],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802744,0.0003665377,0.00019659029,0.00042922868,0.00046255882,0.000517656],"domain_scores_gemma":[0.99858695,0.00023521285,0.00005434531,0.00035873914,0.00057177886,0.00019299203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011728853,0.00018303328,0.00018492798,0.0004039542,0.001064689,0.00019804235,0.0003069491,0.00019206683,0.000025707071],"category_scores_gemma":[0.00012363668,0.00021248346,0.00006742852,0.00067444117,0.00012610762,0.00041656656,0.000063559186,0.0008940506,0.00001201379],"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.00023917886,0.00005888252,0.0034247022,0.0001220009,0.00009576587,0.0000494431,0.00045357598,0.13846505,0.85289913,0.00040555067,0.0019340776,0.001852638],"study_design_scores_gemma":[0.0015428996,0.00019815836,0.0016948524,0.000035259596,0.000026676042,0.00008754246,0.00016295812,0.92783546,0.058377925,0.000015703547,0.009699084,0.0003235042],"about_ca_topic_score_codex":0.00009490036,"about_ca_topic_score_gemma":0.0003571443,"teacher_disagreement_score":0.7945212,"about_ca_system_score_codex":0.0003714604,"about_ca_system_score_gemma":0.00016186504,"threshold_uncertainty_score":0.8664824},"labels":[],"label_agreement":null},{"id":"W2113900306","doi":"10.1287/trsc.2014.0576","title":"The Hub Line Location Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University; Université de Montréal","funders":"","keywords":"Mathematical optimization; Solver; Benders' decomposition; Benchmark (surveying); Routing (electronic design automation); Path (computing); Computer science; Line (geometry); Minification; Decomposition; Network planning and design; Scheme (mathematics); Set (abstract data type); Mathematics; Computer network","score_opus":0.03745478217311991,"score_gpt":0.3004402146947597,"score_spread":0.26298543252163975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113900306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0934992,0.00012249117,0.9015796,0.0003418726,0.0003528523,0.00017596262,0.0000019233207,0.0003868441,0.003539233],"genre_scores_gemma":[0.93868595,0.000014017157,0.061099596,0.000025220883,0.000025040488,0.00001245183,0.0000047945023,0.000008792877,0.00012413126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991965,0.000014121886,0.00018266811,0.00011222332,0.0003385622,0.00015590293],"domain_scores_gemma":[0.99939394,0.000039094364,0.000028651857,0.00014908075,0.0003021547,0.00008707291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012575994,0.00005636527,0.000044620687,0.00004967719,0.00015535853,0.00006843024,0.0002101895,0.000019689991,0.00000361182],"category_scores_gemma":[0.00007278987,0.000043823347,0.000010105149,0.0010409639,0.00014197291,0.00031910517,0.0000015244264,0.000060792987,0.000025087189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019273134,0.0000031291686,0.00071748183,0.000005793887,0.0000011663814,2.3831124e-7,0.0011034713,0.9849864,0.0013238102,0.0028345399,0.000091233196,0.008930758],"study_design_scores_gemma":[0.0003605176,0.00003182766,0.025685368,0.000018585826,0.000009824133,0.0000016768872,0.00047725465,0.9502971,0.015774854,0.0017173104,0.0054286323,0.00019701383],"about_ca_topic_score_codex":0.000006946537,"about_ca_topic_score_gemma":0.000026739217,"teacher_disagreement_score":0.84518677,"about_ca_system_score_codex":0.00004729875,"about_ca_system_score_gemma":0.000105486084,"threshold_uncertainty_score":0.17870642},"labels":[],"label_agreement":null},{"id":"W2114217004","doi":"10.1287/trsc.1090.0290","title":"An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":127,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Vehicle routing problem; Mathematical optimization; Computer science; Neighbourhood (mathematics); Heuristic; Routing (electronic design automation); Arc (geometry); Context (archaeology); Mathematics; Geography","score_opus":0.023895904420274276,"score_gpt":0.2914730769878286,"score_spread":0.2675771725675543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114217004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14229122,0.000017844986,0.85670435,0.00007490492,0.00004131172,0.00046944528,0.00002747077,0.00023137953,0.00014204421],"genre_scores_gemma":[0.88691163,0.0000015891128,0.11294023,0.000048808688,0.000024667137,0.000029134919,0.000015260748,0.000018556597,0.000010127959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985729,0.000028862012,0.00024900105,0.0002830715,0.00041957543,0.0004465978],"domain_scores_gemma":[0.999125,0.00019997198,0.000050030245,0.00021447639,0.00029338605,0.000117155185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013048947,0.0001411256,0.0001279855,0.000117211806,0.00047315372,0.00009749724,0.0003097841,0.00003438324,0.000013512876],"category_scores_gemma":[0.000042120002,0.00010450398,0.000026223188,0.0010509252,0.00014584011,0.000446797,0.000001181684,0.00015502519,0.0000020563173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032062493,0.000020996613,0.00022888601,0.000010043705,0.000006554916,9.940894e-7,0.0045611276,0.9843597,0.0022915108,0.0053835018,0.000001513205,0.0031031119],"study_design_scores_gemma":[0.00049273035,0.00023499195,0.04416442,0.000032240143,0.0000290821,0.0000023177304,0.0009517677,0.9525621,0.0011053594,0.00026558994,0.000002207985,0.0001571774],"about_ca_topic_score_codex":0.000010451387,"about_ca_topic_score_gemma":0.00004127217,"teacher_disagreement_score":0.7446204,"about_ca_system_score_codex":0.00004915846,"about_ca_system_score_gemma":0.000103553895,"threshold_uncertainty_score":0.42615488},"labels":[],"label_agreement":null},{"id":"W2114675299","doi":"10.1016/j.disopt.2010.06.002","title":"The Delivery Man Problem with time windows","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"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":"Mathematical optimization; Travelling salesman problem; Heuristic; Integer programming; Window (computing); Computer science; Mathematics; Algorithm","score_opus":0.004443702601807077,"score_gpt":0.20733811642787947,"score_spread":0.2028944138260724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114675299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013880298,0.000047713067,0.9590134,0.00030550038,0.00023753512,0.0004991359,0.000008232161,0.0008180517,0.025190106],"genre_scores_gemma":[0.12618151,0.00007392123,0.87189025,0.000063912885,0.00015078986,0.00006991058,0.00010534643,0.0001330401,0.0013313426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915165,0.000047473448,0.00019976651,0.00016786919,0.00018206511,0.0002512075],"domain_scores_gemma":[0.9993715,0.00008424199,0.00005342299,0.0003200938,0.000100918594,0.000069769776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029274903,0.00016083181,0.00010920259,0.00005087367,0.00025529708,0.0001605237,0.00019304671,0.000090353664,0.00013095069],"category_scores_gemma":[0.000035447105,0.00011332545,0.00003154452,0.00028650102,0.00006742566,0.00024569267,0.000026234435,0.00024019304,0.000043422362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010788756,0.000003844435,0.00019393145,0.0000075999174,0.00002070124,8.764058e-7,0.000085704436,0.99525374,0.0011039727,0.00026724374,0.00031840743,0.0027331782],"study_design_scores_gemma":[0.00025847583,0.000021126876,0.00014898992,0.000012304013,0.000019055064,0.00000863436,0.00002173137,0.9962091,0.0009268818,0.000029914716,0.002160989,0.00018278789],"about_ca_topic_score_codex":0.000003712311,"about_ca_topic_score_gemma":0.000011814115,"teacher_disagreement_score":0.11230121,"about_ca_system_score_codex":0.000023270146,"about_ca_system_score_gemma":0.000020666068,"threshold_uncertainty_score":0.46212777},"labels":[],"label_agreement":null},{"id":"W2114778474","doi":"10.1287/trsc.1120.0443","title":"Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":201,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Benchmark (surveying); Routing (electronic design automation); Heuristic; Computer science; Production (economics); Set (abstract data type); Vehicle routing problem; Operations research; Mathematics; Economics","score_opus":0.03499057401878422,"score_gpt":0.29746752266634596,"score_spread":0.26247694864756177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114778474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055413693,0.000059898302,0.99240035,0.00021108547,0.0003969904,0.00068149006,0.000019574922,0.0002737637,0.0004154929],"genre_scores_gemma":[0.76569545,0.0000046554974,0.23403175,0.000036744677,0.000091794784,0.00008215562,0.000015190531,0.000021201267,0.000021068136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863297,0.000030981402,0.00025878276,0.00021170323,0.00039690424,0.00046863122],"domain_scores_gemma":[0.99910975,0.00022916106,0.0000536933,0.00020084312,0.00031655017,0.0000900303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024045557,0.00011636639,0.00009200938,0.00011657426,0.00051947916,0.00005840567,0.0002213267,0.0000396207,0.000033646615],"category_scores_gemma":[0.00010924184,0.00009618169,0.00004085985,0.0011888704,0.00011319648,0.0007353006,0.0000027116157,0.000112994916,0.000004459044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070288065,0.000020212967,0.005418184,0.000018935205,0.0000051377965,3.3194443e-8,0.0017372979,0.98708355,0.00079914776,0.0036720287,0.000013054364,0.0012253645],"study_design_scores_gemma":[0.00019530977,0.000014133483,0.009277255,0.0000184983,0.000020684825,3.698176e-7,0.0004156358,0.97929585,0.010561711,0.000012447507,0.00006210696,0.0001260088],"about_ca_topic_score_codex":0.000004827231,"about_ca_topic_score_gemma":0.0000047203725,"teacher_disagreement_score":0.76015407,"about_ca_system_score_codex":0.000079494195,"about_ca_system_score_gemma":0.00010510822,"threshold_uncertainty_score":0.39954662},"labels":[],"label_agreement":null},{"id":"W2114939271","doi":"10.1111/j.1475-3995.2000.tb00200.x","title":"Classical and modern heuristics for the vehicle routing problem","year":2000,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":705,"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; Group for Research in Decision Analysis; Computer Research Institute of Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Tabu search; Metaheuristic; Mathematical optimization; Vehicle routing problem; Computer science; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.07150300697132775,"score_gpt":0.38650730740420897,"score_spread":0.3150043004328812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114939271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015428844,0.00014186694,0.96979487,0.005813821,0.00020250409,0.0005383169,0.00006353728,0.000087939254,0.007928283],"genre_scores_gemma":[0.94974107,0.0002905143,0.04622711,0.000057654426,0.00016024246,0.00027337877,0.000016322749,0.00002732799,0.0032064153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987934,0.00009152726,0.00026000498,0.00018246353,0.00044483758,0.00022776042],"domain_scores_gemma":[0.99829113,0.0013133753,0.00000749729,0.00010493879,0.00023678003,0.000046296915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011639161,0.000085240536,0.00007718474,0.00013514925,0.00031158587,0.00017316462,0.00021053686,0.00006835868,0.0006134824],"category_scores_gemma":[0.00012122483,0.000075173026,0.000032287786,0.00023410338,0.000105784486,0.0001955254,0.0000071237214,0.0004157814,0.0000144484175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026674852,0.000033320946,0.00014570389,0.00000835779,0.000028043225,7.99019e-7,0.00030386145,0.8876732,0.00040254236,0.0040553794,0.00013224104,0.10718986],"study_design_scores_gemma":[0.00038884493,0.000015286052,0.001001631,0.00001831756,0.0000033446704,0.000008441475,0.00005940757,0.9856815,0.00023362791,0.0017257291,0.010786068,0.000077798526],"about_ca_topic_score_codex":0.000024368579,"about_ca_topic_score_gemma":0.000052532865,"teacher_disagreement_score":0.93431216,"about_ca_system_score_codex":0.00015115707,"about_ca_system_score_gemma":0.000060880193,"threshold_uncertainty_score":0.67172015},"labels":[],"label_agreement":null},{"id":"W2115690509","doi":"10.1139/x07-106","title":"Backhauling in forest transportation: models, methods, and practical usage","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Backhaul (telecommunications); Column generation; Computer science; Transportation theory; Flow network; Operations research; Mathematical optimization; Linear programming; Flow (mathematics); Mathematics; Computer network","score_opus":0.11301015791540846,"score_gpt":0.42411496718166264,"score_spread":0.31110480926625417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115690509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4391804,0.00077892566,0.5575216,0.00030062662,0.00013296875,0.00011082576,0.000003239906,0.00000937425,0.0019620697],"genre_scores_gemma":[0.6606429,0.000058644935,0.3391535,0.0000125442075,0.000082916515,0.000001096189,0.0000016731362,0.000023435525,0.000023292438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826676,0.00023524818,0.0004907388,0.00011279178,0.00030865462,0.0005857813],"domain_scores_gemma":[0.99794346,0.0008355939,0.000046606732,0.0001220877,0.0003023178,0.00074991584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0095334,0.0000970147,0.00019232048,0.000963034,0.000103185645,0.00008624175,0.00013364783,0.00012654114,0.00003648215],"category_scores_gemma":[0.00073709217,0.00010020688,0.000038171645,0.0006849868,0.00012037593,0.0003975787,0.0000034765662,0.0009508815,0.000001842847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031730913,0.000010397959,0.14782895,0.00007821957,0.000027910792,0.0012916896,0.0016393326,0.82842225,0.00015862433,0.007288002,0.000318746,0.012904144],"study_design_scores_gemma":[0.0013331453,0.00018810068,0.4610554,0.0003082964,0.000021684911,0.0005949111,0.0015226819,0.51361436,0.00064966496,0.012862451,0.0074706124,0.00037871912],"about_ca_topic_score_codex":0.0013388923,"about_ca_topic_score_gemma":0.16182944,"teacher_disagreement_score":0.3148079,"about_ca_system_score_codex":0.00024762232,"about_ca_system_score_gemma":0.0005960151,"threshold_uncertainty_score":0.85346496},"labels":[],"label_agreement":null},{"id":"W2115781168","doi":"10.1057/jors.2011.25","title":"An incremental tabu search heuristic for the generalized vehicle routing problem with time windows","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"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; Mathematical optimization; Guided Local Search; Computer science; Neighbourhood (mathematics); Incremental heuristic search; Heuristic; Heuristics; Beam search; Routing (electronic design automation); Algorithm; Search algorithm; Mathematics","score_opus":0.07959455024081594,"score_gpt":0.3510110840672343,"score_spread":0.2714165338264184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115781168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76912457,0.0002944269,0.22508794,0.0022943367,0.0002230714,0.001792012,0.00003838742,0.000068525456,0.0010767068],"genre_scores_gemma":[0.7726311,0.000039260252,0.22641237,0.00011232767,0.00037191008,0.000031129737,0.000003840369,0.000042956948,0.00035510564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976652,0.000483041,0.0003580638,0.00011932418,0.0010190798,0.00035525995],"domain_scores_gemma":[0.9980683,0.0005684239,0.00007283872,0.00023349952,0.0009482423,0.00010872417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00711255,0.00011277715,0.00015090503,0.000038033602,0.00082303735,0.00017753318,0.0006382614,0.00006224902,0.00014515241],"category_scores_gemma":[0.00021909266,0.000060910595,0.00015009745,0.0003568712,0.00016499142,0.00033610364,0.00008079515,0.000660108,0.000005098789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018817997,0.00012012868,0.0025213796,0.000043902513,0.0003698496,0.0000019569904,0.0065565347,0.90977705,0.07205099,0.0012893659,0.00591324,0.0011674409],"study_design_scores_gemma":[0.0009944388,0.00021324934,0.0031004683,0.000047742036,0.000026115827,0.000032216034,0.00075485476,0.98208445,0.012173813,0.00016837503,0.0003025348,0.00010171228],"about_ca_topic_score_codex":0.000028468594,"about_ca_topic_score_gemma":0.0000041720646,"teacher_disagreement_score":0.07230745,"about_ca_system_score_codex":0.00023523266,"about_ca_system_score_gemma":0.00031221,"threshold_uncertainty_score":0.63302207},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023715562606487994,"score_gpt":0.26785541019620596,"score_spread":0.24413984758971796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116517820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08632912,0.0008950102,0.90562534,0.0038642476,0.0006753033,0.00020756973,0.000029774326,0.00021971921,0.002153925],"genre_scores_gemma":[0.98873353,0.0013123673,0.009548638,0.00018409187,0.000093632734,0.000002694958,0.0000064193982,0.000018425008,0.00010020739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99933696,0.00005475315,0.00024630217,0.000100193094,0.00011865903,0.0001431312],"domain_scores_gemma":[0.99937886,0.00011841386,0.00005420782,0.000051373994,0.0002416571,0.00015549577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018842187,0.00010031267,0.00012522795,0.00006285424,0.00014498294,0.00006628008,0.000035347264,0.000055395307,0.000071556584],"category_scores_gemma":[0.00021797372,0.000094706615,0.000022713702,0.00010635832,0.000032536955,0.00008593837,9.725878e-7,0.0003068175,0.000006587493],"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.00013625027,0.00038731287,0.027783524,0.00011347494,0.00030522892,0.00020444163,0.009599621,0.6318665,0.010657354,0.22949438,0.014717447,0.07473445],"study_design_scores_gemma":[0.0040507023,0.00067754067,0.5646937,0.00011409189,0.00023789828,0.00015948601,0.001928704,0.36520287,0.0012023598,0.011836585,0.048862364,0.0010336721],"about_ca_topic_score_codex":0.000010857624,"about_ca_topic_score_gemma":0.0000025953402,"teacher_disagreement_score":0.9024044,"about_ca_system_score_codex":0.00018784727,"about_ca_system_score_gemma":0.000014275997,"threshold_uncertainty_score":0.38620237},"labels":[],"label_agreement":null},{"id":"W2116675171","doi":"10.1287/trsc.1030.0057","title":"Vehicle Routing Problem with Time Windows, Part II: Metaheuristics","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":826,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Metaheuristic; Heuristics; Benchmark (surveying); Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Computer science; Point (geometry); Interval (graph theory); Operations research; Mathematics; Computer network","score_opus":0.014021572184757499,"score_gpt":0.24713416884135248,"score_spread":0.23311259665659498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116675171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6929827,0.000047585945,0.29861128,0.00026616466,0.00010104465,0.00031925394,0.000018577268,0.0009288674,0.0067245187],"genre_scores_gemma":[0.7557557,0.00000676918,0.2438504,0.00005013641,0.00004741929,0.000009840936,0.000010188195,0.000021984559,0.0002475348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986026,0.000017905584,0.00031435338,0.00026117024,0.0004691232,0.00033482898],"domain_scores_gemma":[0.99942154,0.000042913685,0.000062647545,0.00020053446,0.00015331103,0.00011906027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079093274,0.00013731662,0.00014066212,0.00010848509,0.0002946833,0.00006350031,0.00023238914,0.000036755402,0.00011514639],"category_scores_gemma":[0.00002612254,0.00012782622,0.000024316283,0.0010131998,0.00016320999,0.00061530503,0.0000041092567,0.00012613957,0.00005783337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004458878,0.000016074777,0.0018288757,0.000010072606,0.000007027676,0.0000017499744,0.0012422916,0.9810138,0.008563874,0.0008517219,0.000060448732,0.006399646],"study_design_scores_gemma":[0.0005137626,0.000052208365,0.014826594,0.000047515525,0.00003268174,0.0000040894856,0.0000642402,0.9491122,0.029739162,0.000048370424,0.0052072774,0.00035193903],"about_ca_topic_score_codex":0.000004090481,"about_ca_topic_score_gemma":0.00001343158,"teacher_disagreement_score":0.06277303,"about_ca_system_score_codex":0.00006120914,"about_ca_system_score_gemma":0.000076331526,"threshold_uncertainty_score":0.5212602},"labels":[],"label_agreement":null},{"id":"W2116691041","doi":"10.1109/hipc.1997.634485","title":"Parallel algorithms for vehicle routing problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Time complexity; Routing (electronic design automation); Vehicle routing problem; Crew; Algorithm; Routing table; Destination-Sequenced Distance Vector routing; Static routing; Parallel algorithm; Computer network; Link-state routing protocol; Routing protocol; Engineering","score_opus":0.0487229125440266,"score_gpt":0.2695773464828055,"score_spread":0.2208544339387789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116691041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001954896,0.00020753438,0.9816366,0.00016118058,0.0001852123,0.00029575574,0.0000030780288,0.0010223654,0.014533403],"genre_scores_gemma":[0.1929499,0.000030125535,0.8029913,0.0000683377,0.00013336426,0.00007218027,0.000004207792,0.00006158437,0.003688999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922633,0.000018684925,0.00021868819,0.0001483289,0.00009128377,0.00029669938],"domain_scores_gemma":[0.99961066,0.00010258467,0.000021378639,0.00016114686,0.000040777148,0.00006343471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002521011,0.000116258394,0.00012623296,0.00004318588,0.000077502,0.000044078635,0.00010933415,0.00006930072,0.00025964336],"category_scores_gemma":[0.000059472484,0.00011656963,0.00005337245,0.00015956884,0.000011598275,0.00011384072,0.000015885058,0.00008299074,0.0000675212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.164044e-7,0.000015774505,0.0002446015,0.00004023689,0.000020832638,6.745584e-7,0.00029978045,0.95208263,0.00081890664,0.0012961152,0.002952773,0.042226944],"study_design_scores_gemma":[0.0004294129,0.000016814818,0.000063768995,0.000010115417,0.000006446534,0.0000032739927,0.000026913776,0.9930954,0.00068565906,0.0001546719,0.0053438903,0.0001636381],"about_ca_topic_score_codex":0.0000037319992,"about_ca_topic_score_gemma":0.0000013678268,"teacher_disagreement_score":0.19099501,"about_ca_system_score_codex":0.00003482304,"about_ca_system_score_gemma":0.0000019478155,"threshold_uncertainty_score":0.47535715},"labels":[],"label_agreement":null},{"id":"W2117319367","doi":"10.1007/s10107-011-0497-4","title":"Improved lower bounds and exact algorithm for the capacitated arc routing problem","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"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":"Arc routing; Column generation; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Mathematics; Undirected graph; Set (abstract data type); Upper and lower bounds; Algorithm; Vehicle routing problem; Arc (geometry); Routing (electronic design automation); Graph; Computer science; Combinatorics; Artificial intelligence","score_opus":0.03169759203907864,"score_gpt":0.25875518175346096,"score_spread":0.22705758971438234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117319367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030987556,0.00008970134,0.99397695,0.000034690693,0.00010358738,0.0009139939,0.0000027125889,0.000547642,0.0012319394],"genre_scores_gemma":[0.14266455,0.0000037990337,0.8568762,0.000017529768,0.000055067907,0.00022630599,0.0000021850888,0.0000675741,0.00008679146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988196,0.000036136495,0.0003707642,0.00020206203,0.00012086466,0.00045059138],"domain_scores_gemma":[0.9990694,0.0004773428,0.000058711892,0.00022997706,0.000067733425,0.00009686197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412475,0.00019966917,0.00022517804,0.00004214807,0.00020362673,0.00014421272,0.0001574415,0.000096830416,0.000039129183],"category_scores_gemma":[0.00024028936,0.00014501247,0.00007243138,0.00017769082,0.00010955456,0.00011948714,0.00004727764,0.00020127915,0.000005421942],"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.0000081456465,0.00008610311,0.000039907867,0.0003661904,0.00013806712,0.0000027440087,0.00412125,0.00033366244,0.00059806835,0.0041757557,0.00003243864,0.99009764],"study_design_scores_gemma":[0.0003144723,0.000068563924,0.000019323586,0.000062875966,0.0000607372,0.000017897824,0.0003704442,0.99350077,0.0007465067,0.0041209254,0.00050696905,0.00021053398],"about_ca_topic_score_codex":0.0000056828976,"about_ca_topic_score_gemma":0.0000011138363,"teacher_disagreement_score":0.9931671,"about_ca_system_score_codex":0.000034337092,"about_ca_system_score_gemma":0.000009495166,"threshold_uncertainty_score":0.5913437},"labels":[],"label_agreement":null},{"id":"W2117833774","doi":"10.1287/ijoc.1080.0291","title":"Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems","year":2008,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Computer science; Routing (electronic design automation); Operations research; Vendor; Inventory theory; Vehicle routing problem; Time horizon; Markov decision process; Column generation; Markov chain; Inventory management; Inventory control; Markov process; Mathematics; Operations management; Engineering","score_opus":0.03873982677101141,"score_gpt":0.26712172372284937,"score_spread":0.22838189695183797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117833774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10404655,0.00004836214,0.8935875,0.000045315126,0.0009234214,0.00026093633,0.0000026984596,0.00036618533,0.000718989],"genre_scores_gemma":[0.8540584,0.000004849853,0.14504194,0.00021198994,0.0005557106,0.0000041638755,0.0000068236236,0.00007461778,0.000041529132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980346,0.000036829268,0.00083140587,0.0001539062,0.00036594638,0.00057732477],"domain_scores_gemma":[0.9986108,0.00045636715,0.00029639716,0.00018432453,0.00023343106,0.00021866208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010687632,0.00027370965,0.00032289792,0.00028384585,0.0006409473,0.00013793856,0.00027323165,0.00012025338,0.0000092419195],"category_scores_gemma":[0.0006286688,0.00025389032,0.00016836451,0.00030198618,0.000048425474,0.00018429673,0.000031663396,0.0006531325,0.000016213293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015630725,0.000020605732,0.0011330555,0.00005710228,0.000032086347,0.000010221727,0.00054902607,0.9801502,0.000048496546,0.0001166744,0.0002878813,0.017578969],"study_design_scores_gemma":[0.0012974476,0.00015444035,0.00043263772,0.0003207565,0.00001555694,0.00017225239,0.000034908066,0.99620503,0.00017818116,0.00009483297,0.0007861877,0.00030777798],"about_ca_topic_score_codex":0.0000016344634,"about_ca_topic_score_gemma":8.8185345e-7,"teacher_disagreement_score":0.7500118,"about_ca_system_score_codex":0.00028323795,"about_ca_system_score_gemma":0.00013279637,"threshold_uncertainty_score":0.99999136},"labels":[],"label_agreement":null},{"id":"W2118037331","doi":"","title":"Tuning the Parameters of a Memetic Algorithm to Solve Vehicle Routing Problem with Backhauls Using Design of Experiments","year":2007,"lang":"en","type":"article","venue":"","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 Manitoba","funders":"","keywords":"Vehicle routing problem; Heuristics; Mathematical optimization; Memetic algorithm; Computer science; Metaheuristic; Heuristic; Tabu search; Algorithm; Routing (electronic design automation); Mathematics; Local search (optimization)","score_opus":0.04755783648365442,"score_gpt":0.2944235111409095,"score_spread":0.24686567465725506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118037331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13431303,0.000032653395,0.86465204,0.000008722746,0.00003990506,0.00040355686,8.789323e-7,0.0000917489,0.00045745584],"genre_scores_gemma":[0.38260004,9.005378e-7,0.6173261,0.000019706513,0.000008217048,0.000004751498,3.300882e-7,0.00003140562,0.000008558206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867463,0.000069354835,0.00047358937,0.00016494108,0.00027525774,0.0003422472],"domain_scores_gemma":[0.99908465,0.0003506094,0.0001130702,0.0002624151,0.00011238126,0.000076878634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015855395,0.00016209196,0.00024722898,0.0001284803,0.00006290496,0.000020944442,0.00018873898,0.000054371416,0.000017494747],"category_scores_gemma":[0.00006108608,0.00012082582,0.000039551156,0.0006107297,0.000049036567,0.000098903365,0.000049383892,0.00010960374,0.0000013250369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013559625,0.000015581662,0.0002656633,0.000021793814,0.000057652407,0.0000012971777,0.0019201075,0.8570889,0.12933281,0.000038327318,0.0000044067388,0.011239893],"study_design_scores_gemma":[0.00022735183,0.000067368295,0.00007980127,0.00008783162,0.000021682383,0.000004113495,0.0009790596,0.6751589,0.3232499,0.000010595146,0.0000020399834,0.00011132566],"about_ca_topic_score_codex":0.00007223689,"about_ca_topic_score_gemma":0.0000017548775,"teacher_disagreement_score":0.24828699,"about_ca_system_score_codex":0.0000724984,"about_ca_system_score_gemma":0.00002523616,"threshold_uncertainty_score":0.4927134},"labels":[],"label_agreement":null},{"id":"W2118128890","doi":"10.1109/icsssm.2006.320760","title":"Availability Optimization of Series-Parallel Multi-State Systems Using a Tabu Search Meta-heuristic","year":2006,"lang":"en","type":"article","venue":"","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":"Université Laval; Université de Montréal; Queen's University","funders":"","keywords":"Tabu search; Computer science; Redundancy (engineering); Mathematical optimization; Disjoint sets; Meta heuristic; Series (stratigraphy); Heuristic; Incremental heuristic search; Guided Local Search; Best-first search; Beam search; Algorithm; Set (abstract data type); Search algorithm; Mathematics","score_opus":0.0671351408694801,"score_gpt":0.293350252545344,"score_spread":0.22621511167586394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118128890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021037476,0.00034654644,0.97638583,0.0000078894445,0.0001661642,0.00037495286,0.000024665735,0.00040248843,0.0012539596],"genre_scores_gemma":[0.3051437,0.000016797198,0.69388354,0.000002617231,0.000025494372,0.000013992392,0.00001638911,0.00004935791,0.00084806903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829906,0.00024894925,0.0006543626,0.00024305904,0.00025767833,0.0002968623],"domain_scores_gemma":[0.9991194,0.00011723079,0.000083051775,0.00036277118,0.00025593484,0.00006158707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090669753,0.00020886469,0.00045357857,0.00013798858,0.000065121414,0.000056226112,0.00013960803,0.00008631195,0.0001877411],"category_scores_gemma":[0.00008952143,0.00019663999,0.00010708818,0.00046676578,0.00006197251,0.00024137147,0.000040142306,0.00012856243,0.00000816226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007636896,0.000034812634,0.0008590343,0.00021941634,0.00013127884,0.0000015116511,0.000055654273,0.9965345,0.0019163709,0.00017008849,0.000038990744,0.000030677522],"study_design_scores_gemma":[0.00031162662,0.00001274665,0.0002997003,0.000012094811,0.00015061104,0.000009199814,0.00003397776,0.9969761,0.0019590324,0.000012248321,0.00003538746,0.00018728733],"about_ca_topic_score_codex":0.00064625964,"about_ca_topic_score_gemma":0.000015099973,"teacher_disagreement_score":0.28410625,"about_ca_system_score_codex":0.00011091425,"about_ca_system_score_gemma":0.000035380734,"threshold_uncertainty_score":0.80187464},"labels":[],"label_agreement":null},{"id":"W2118493070","doi":"10.1287/trsc.1100.0333","title":"Branch and Price for Service Network Design with Asset Management Constraints","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd; Université de Montréal","keywords":"Column generation; Transshipment (information security); Network planning and design; Integer programming; Computer science; Mathematical optimization; Flow network; Service (business); Operations research; Path (computing); Integer (computer science); Branch and price; Shortest path problem; Engineering; Computer network; Economics; Mathematics; Graph","score_opus":0.018662796349693887,"score_gpt":0.2654168289073473,"score_spread":0.2467540325576534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118493070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13911696,0.000004381867,0.85968906,0.000050836436,0.00011950742,0.00032727065,0.000005574514,0.00012512844,0.0005612897],"genre_scores_gemma":[0.5239498,0.0000030099998,0.4759408,0.00005418114,0.000011115352,0.000020952435,0.0000036009858,0.000007666361,0.000008867524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992946,0.000007706424,0.00012999124,0.00018333015,0.00017433289,0.0002100773],"domain_scores_gemma":[0.9995881,0.00008134823,0.000028605977,0.00011458173,0.00011231898,0.000075054355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008165037,0.0000796364,0.00007284887,0.00005250269,0.00012939525,0.000053398424,0.00012504788,0.000027131819,0.00001558327],"category_scores_gemma":[0.000008294082,0.000075270174,0.000007261023,0.00063836225,0.00013671734,0.0002444319,0.0000015122727,0.00007087333,0.0000014995917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010947616,0.0000052833043,0.002535826,0.00008036677,0.000008399174,0.0000010040443,0.0004683039,0.9769722,0.0068046274,0.004428421,0.000023660905,0.008660912],"study_design_scores_gemma":[0.0011872469,0.000048547387,0.28222385,0.000058215042,0.000052613796,0.00000942902,0.00012423056,0.7078208,0.0063144662,0.0010877997,0.00066787604,0.00040495876],"about_ca_topic_score_codex":0.0000012784587,"about_ca_topic_score_gemma":0.000018042914,"teacher_disagreement_score":0.38483286,"about_ca_system_score_codex":0.00000799063,"about_ca_system_score_gemma":0.000027934053,"threshold_uncertainty_score":0.30694285},"labels":[],"label_agreement":null},{"id":"W2118555996","doi":"10.1002/net.21496","title":"The orienteering problem with variable profits","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"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":"Orienteering; Vertex (graph theory); Profit (economics); Operations research; Mathematical optimization; Mathematics; Graph; Combinatorics; Computer science; Travel time; Time limit; Mathematical economics; Economics; Microeconomics; Transport engineering; Engineering","score_opus":0.005110104516139893,"score_gpt":0.19108211177042117,"score_spread":0.18597200725428129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118555996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004130469,0.00024719382,0.9718151,0.000067695655,0.00025522755,0.00037185862,2.001071e-7,0.000515633,0.022596618],"genre_scores_gemma":[0.47419348,0.000082007144,0.52292633,0.00007554974,0.00037309265,0.00032516793,0.0000050313483,0.0001094773,0.0019098215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935114,0.000028273498,0.00012822496,0.000100410674,0.00009528456,0.00029664152],"domain_scores_gemma":[0.9995697,0.000095417694,0.00002185147,0.00020018019,0.00006196879,0.000050856514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023042393,0.00009854385,0.00007584468,0.000013478529,0.00014061,0.000120887154,0.00012912804,0.00005595121,0.000045583412],"category_scores_gemma":[0.00001250738,0.00006419315,0.000011450186,0.00027132692,0.000020796471,0.000119225835,0.000024049958,0.00018905214,0.000024074105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013383418,0.0000019895929,0.00072366477,0.000007985388,0.000015942258,2.64363e-7,0.00004084035,0.9841194,0.000032114433,0.0011038256,0.00208056,0.011872036],"study_design_scores_gemma":[0.00011610257,0.000013197079,0.00042114485,0.000030033883,0.000005195552,0.0000041136036,0.00001734002,0.98958224,0.000057182468,0.000121393234,0.009531799,0.00010027731],"about_ca_topic_score_codex":0.0000090429385,"about_ca_topic_score_gemma":0.0000025026416,"teacher_disagreement_score":0.47006303,"about_ca_system_score_codex":0.000028508533,"about_ca_system_score_gemma":0.000008613941,"threshold_uncertainty_score":0.26177207},"labels":[],"label_agreement":null},{"id":"W2119097848","doi":"10.1287/trsc.1090.0272","title":"Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":462,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Pickup; Mathematical optimization; Set (abstract data type); Branch and cut; Relaxation (psychology); Linear programming relaxation; Lagrangian relaxation; Computer science; Path (computing); Integer programming; Linear programming; Shortest path problem; Branch and price; Vehicle routing problem; Column (typography); Mathematics; Routing (electronic design automation); Theoretical computer science","score_opus":0.01091285829767171,"score_gpt":0.23968207380273326,"score_spread":0.22876921550506155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119097848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6775494,0.00018329013,0.3215188,0.00019905934,0.000011464541,0.00029670133,0.000004316721,0.000067289686,0.00016962356],"genre_scores_gemma":[0.92288107,0.00006746071,0.07691897,0.000072496485,0.0000075939774,0.000008389613,0.0000014809639,0.0000056628073,0.00003686295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9995002,0.0000055928076,0.000099096265,0.00015093856,0.00011998752,0.0001241826],"domain_scores_gemma":[0.9997118,0.000092391674,0.00002188296,0.00006679288,0.00005803681,0.000049087655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038839265,0.00006603267,0.000066138215,0.000041948857,0.00016096549,0.00006141806,0.00005842203,0.000018126068,0.0000027160302],"category_scores_gemma":[0.000009582536,0.0000475064,0.000005183922,0.00025534345,0.00013955141,0.00030565812,0.0000010716709,0.000040926127,2.8832815e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012152089,0.000032727625,0.0329287,0.00025145346,0.000033076623,0.0000027984256,0.017130813,0.632996,0.095473446,0.0038886087,0.000077862715,0.217063],"study_design_scores_gemma":[0.00073577155,0.0001108025,0.56044465,0.000037190523,0.00003384678,0.000009906421,0.00008122937,0.43415314,0.0035654097,0.00034561648,0.00029517693,0.0001872722],"about_ca_topic_score_codex":0.0000032495695,"about_ca_topic_score_gemma":0.000007943318,"teacher_disagreement_score":0.52751595,"about_ca_system_score_codex":0.0000065628715,"about_ca_system_score_gemma":0.000020665844,"threshold_uncertainty_score":0.19372548},"labels":[],"label_agreement":null},{"id":"W2119601963","doi":"10.1287/opre.1120.1048","title":"A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":685,"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é du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Metaheuristic; Mathematical optimization; Computer science; Population; Genetic algorithm; Routing (electronic design automation); Algorithm; Mathematics; Medicine","score_opus":0.06420246300526486,"score_gpt":0.3580434042946693,"score_spread":0.2938409412894044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119601963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3355439,0.0007417302,0.66238207,0.00008227894,0.0000975229,0.00067614287,0.000019494895,0.00013857338,0.0003182714],"genre_scores_gemma":[0.5581167,0.000060645496,0.44108456,0.000008284718,0.00015796842,0.0002542058,0.000012107833,0.000037294616,0.00026826718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986751,0.00016259994,0.00021736047,0.00017029491,0.00022715853,0.0005474593],"domain_scores_gemma":[0.99923515,0.00019250586,0.000006368768,0.00019851798,0.00020800023,0.00015943217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014455678,0.00010258181,0.00011456363,0.00015372985,0.0005590562,0.000213889,0.00010648524,0.000050705425,0.00004130988],"category_scores_gemma":[0.00028684098,0.000106231746,0.000025228963,0.00024015129,0.0000681301,0.0002522123,0.00006170103,0.000232042,0.000028279394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022392992,0.000069053145,0.003985792,0.00010502245,0.000038980128,0.0000013119143,0.0024842117,0.703074,0.023583867,0.00034243704,0.00034304996,0.26597008],"study_design_scores_gemma":[0.00030090395,0.000027616485,0.0036236965,0.000017771494,0.0000049015107,0.000014461002,0.00012793181,0.9907183,0.003872706,0.000012145859,0.0011562873,0.00012324553],"about_ca_topic_score_codex":0.0000484222,"about_ca_topic_score_gemma":0.000008423943,"teacher_disagreement_score":0.28764436,"about_ca_system_score_codex":0.00007823614,"about_ca_system_score_gemma":0.000037564387,"threshold_uncertainty_score":0.43320048},"labels":[],"label_agreement":null},{"id":"W2119673940","doi":"10.1007/s10107-008-0234-9","title":"The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"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":"Travelling salesman problem; Pickup; Vertex (graph theory); Mathematics; Branch and cut; Bottleneck traveling salesman problem; Algorithm; Dimension (graph theory); Graph; Polytope; Combinatorics; Integer programming; Mathematical optimization; Computer science","score_opus":0.016277189734309045,"score_gpt":0.22943170088497788,"score_spread":0.21315451115066883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119673940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35608217,0.000829045,0.64082724,0.00030347647,0.000027077122,0.00062779017,0.0000034029322,0.0004894725,0.00081033347],"genre_scores_gemma":[0.40951446,0.000107280255,0.59021145,0.000011246308,0.00003290287,0.000026580457,0.0000016201179,0.000035523724,0.000058949554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989334,0.000048739847,0.00030364466,0.00021546165,0.00016939169,0.00032941243],"domain_scores_gemma":[0.9992664,0.000379609,0.00004299599,0.0001493278,0.000034049364,0.00012763262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053669757,0.00017926637,0.0002132627,0.0000320962,0.00035651415,0.00013446147,0.0000700516,0.000070905175,0.0000011338424],"category_scores_gemma":[0.00009357618,0.00012279306,0.000019420731,0.00013800958,0.00025008412,0.00010409215,0.00005007014,0.00020300323,0.0000018965436],"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.000044841567,0.000043452892,0.0005547215,0.00042754447,0.00010884858,0.000032770327,0.0070874235,0.0012965411,0.00019606076,0.0024836347,0.000023835506,0.98770034],"study_design_scores_gemma":[0.0016903218,0.0001866066,0.0010029728,0.0003216783,0.00007580304,0.0009776293,0.0005298785,0.9901802,0.0004469562,0.003088413,0.001004777,0.0004947645],"about_ca_topic_score_codex":0.0000059810473,"about_ca_topic_score_gemma":0.000005017813,"teacher_disagreement_score":0.9888837,"about_ca_system_score_codex":0.000016488792,"about_ca_system_score_gemma":0.000011102984,"threshold_uncertainty_score":0.5007356},"labels":[],"label_agreement":null},{"id":"W2119760912","doi":"10.1109/iccie.2009.5223922","title":"A rolling horizon solution approach for the airline crew pairing problem","year":2009,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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 scheduling; Crew; Column generation; Computer science; Pairing; Schedule; Scheduling (production processes); Mathematical optimization; Heuristic; Job shop scheduling; Set (abstract data type); Process (computing); Time horizon; Operations research; Mathematics; Engineering; Artificial intelligence; Aeronautics","score_opus":0.025674868270813198,"score_gpt":0.2587993696184967,"score_spread":0.2331245013476835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119760912","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056380994,0.00027903536,0.9896659,0.00033909178,0.000076489545,0.00048417292,0.0000010334572,0.0007849098,0.007805549],"genre_scores_gemma":[0.3293002,0.000022735972,0.6702175,0.000051294694,0.00015481905,0.00003558558,0.0000069983116,0.000021226273,0.00018960735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992559,0.000026974009,0.00021207935,0.00014615347,0.00010329434,0.0002556119],"domain_scores_gemma":[0.9995871,0.000121998484,0.000026537307,0.00018017185,0.000047243902,0.000036944228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073131325,0.000119634744,0.00011773262,0.000045426263,0.00015051932,0.000051298746,0.00013020552,0.00006816171,0.000009295769],"category_scores_gemma":[0.000054514654,0.00008923999,0.000064966334,0.00020142342,0.000009224678,0.000104592844,0.000010997817,0.00012057634,0.0000026590124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004769491,0.000011328113,0.000015994234,0.00002544681,0.00001280374,6.295002e-8,0.00007980393,0.9137937,0.0014184492,0.00095611735,0.00039281053,0.08328874],"study_design_scores_gemma":[0.00026372826,0.000051568153,0.00009150643,0.000010191236,0.000019632858,0.000002475826,0.000042658263,0.9962692,0.0019943074,0.0002466926,0.0008850473,0.00012296434],"about_ca_topic_score_codex":0.000003464511,"about_ca_topic_score_gemma":9.1802303e-7,"teacher_disagreement_score":0.3287364,"about_ca_system_score_codex":0.000047403515,"about_ca_system_score_gemma":0.0000082306315,"threshold_uncertainty_score":0.3639101},"labels":[],"label_agreement":null},{"id":"W2119849184","doi":"10.1287/inte.30.2.54.11677","title":"TransAlta Redesigns Its Service-Delivery Network","year":2000,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","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":true,"ca_institutions":"TransAlta (Canada); University of Alberta","funders":"","keywords":"Staffing; Service (business); Heuristics; Service delivery framework; Operations management; Operations research; Business; Engineering; Transport engineering; Computer science; Marketing","score_opus":0.022148449344022318,"score_gpt":0.24065371943035052,"score_spread":0.2185052700863282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119849184","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14503306,0.0004234153,0.390794,0.0009649975,0.0012191938,0.00074823794,0.00002823216,0.0018190851,0.45896974],"genre_scores_gemma":[0.92045987,0.002082974,0.070739806,0.0034634287,0.0015268616,0.000009991961,0.00001964065,0.00018897043,0.0015084505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983399,0.000018094124,0.0006378893,0.000122939,0.0003854844,0.0004956871],"domain_scores_gemma":[0.9992336,0.00008864212,0.00009077146,0.00023692496,0.000094348405,0.0002556833],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006004925,0.0002568846,0.0003006789,0.00014350118,0.00019401264,0.00017654791,0.0003164244,0.00017056064,0.0011816017],"category_scores_gemma":[0.000009306093,0.00022877268,0.00011110767,0.00073274085,0.000015597469,0.00020951316,0.000009100146,0.0007032373,0.0005058047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039743514,0.000012343885,0.000015012211,0.00002205936,0.00008398601,0.000009969509,0.00015524201,0.9525094,0.00012489031,0.0005766593,0.0020166526,0.044434056],"study_design_scores_gemma":[0.00084719795,0.00005547588,0.00011133521,0.00007637664,0.00006832759,0.000073239076,0.00005796552,0.9488401,0.0007041418,0.0005814772,0.048156578,0.00042778486],"about_ca_topic_score_codex":5.810564e-7,"about_ca_topic_score_gemma":0.0000016823277,"teacher_disagreement_score":0.7754268,"about_ca_system_score_codex":0.00012249271,"about_ca_system_score_gemma":0.00004942031,"threshold_uncertainty_score":0.9997315},"labels":[],"label_agreement":null},{"id":"W2120018445","doi":"10.1007/s10479-005-3455-9","title":"On Compact Formulations for Integer Programs Solved by Column Generation","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"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; Group for Research in Decision Analysis; Kronos (Canada); HEC Montréal; St Mary's Hospital Centre","funders":"","keywords":"Column generation; Theory of computation; Diagonal; Mathematical optimization; Mathematics; Integer programming; Integer (computer science); Compatibility (geochemistry); Branching (polymer chemistry); Computer science; Algorithm","score_opus":0.3155450072934694,"score_gpt":0.48209199191541985,"score_spread":0.16654698462195044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120018445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3005428,0.00020641547,0.6891418,0.0045430083,0.00010025306,0.0017970828,0.000119873184,0.00020887538,0.003339913],"genre_scores_gemma":[0.9442317,0.000053183463,0.053871945,0.00008033348,0.0001464968,0.00017864615,0.00036496783,0.000036900925,0.0010358435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987177,0.00012972445,0.00033597002,0.000161854,0.0003301003,0.0003245963],"domain_scores_gemma":[0.99851805,0.00022741902,0.000014538415,0.00025649296,0.0008955899,0.00008792398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012935287,0.000099837845,0.00014255877,0.0002294291,0.00031993893,0.0001440377,0.00015374314,0.00008493963,0.00009850917],"category_scores_gemma":[0.00041355068,0.00010279888,0.0000623434,0.00044115266,0.000057830886,0.00029376833,0.000013899184,0.00019418396,0.000027792026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009025332,0.000120436656,0.000034604378,0.000016187232,0.000028409979,4.6223775e-8,0.00024741114,0.91048944,0.016207546,0.005255244,0.05411803,0.013473638],"study_design_scores_gemma":[0.00024061007,0.00016061738,0.000051664276,0.000018103668,0.000002684963,3.7346823e-7,0.00003163576,0.9363852,0.05362787,0.00009508899,0.009289504,0.00009661381],"about_ca_topic_score_codex":0.000030293224,"about_ca_topic_score_gemma":0.00012569637,"teacher_disagreement_score":0.6436889,"about_ca_system_score_codex":0.00005180259,"about_ca_system_score_gemma":0.000054876433,"threshold_uncertainty_score":0.41920164},"labels":[],"label_agreement":null},{"id":"W2120035164","doi":"10.1504/ijise.2012.048861","title":"A heuristic method for solving reverse logistics vehicle routing problems with time windows","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial and Systems Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Reverse logistics; Heuristic; Computer science; City logistics; Routing (electronic design automation); Transport engineering; Business; Engineering; Supply chain; Embedded system; Artificial intelligence; Marketing","score_opus":0.04019467145360096,"score_gpt":0.2700177521787467,"score_spread":0.22982308072514573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120035164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021164218,0.0003880718,0.9757513,0.000047842022,0.0022435018,0.00022223609,0.000016057913,0.0000747888,0.000091972724],"genre_scores_gemma":[0.9053905,0.000016994583,0.091868825,0.000009682947,0.002591792,0.000011128349,0.000004188186,0.00005264631,0.00005422852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987303,0.000041338037,0.0005875347,0.00008547081,0.00029402116,0.00026134413],"domain_scores_gemma":[0.9988045,0.00047292418,0.0002263495,0.00006872589,0.0002875415,0.00013995038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015977708,0.00016429808,0.0003042751,0.00018611767,0.000039180875,0.00011307738,0.0001671478,0.00012066224,0.0000049249766],"category_scores_gemma":[0.0006404922,0.00014149024,0.000058764694,0.00011014007,0.00001146691,0.0003004833,0.000025373038,0.00029349208,0.0000013202751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000343595,0.000012445127,0.0012545483,0.000046475063,0.00022653354,0.0000067705314,0.00025270524,0.98963535,0.005581589,0.0003265935,0.00021388718,0.0024087252],"study_design_scores_gemma":[0.001316158,0.000067300636,0.00006404349,0.00056098966,0.000059411366,0.00039742052,0.000083724255,0.9940779,0.0006181026,0.0000061000783,0.002562846,0.00018599728],"about_ca_topic_score_codex":0.000009829191,"about_ca_topic_score_gemma":1.677762e-7,"teacher_disagreement_score":0.8842263,"about_ca_system_score_codex":0.0001391473,"about_ca_system_score_gemma":0.000029856234,"threshold_uncertainty_score":0.5769804},"labels":[],"label_agreement":null},{"id":"W2120159299","doi":"10.1023/a:1020325926188","title":"Cooperative Parallel Tabu Search for Capacitated Network Design","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":117,"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":"Tabu search; Computer science; Implementation; Mathematical optimization; Class (philosophy); Algorithm; Mathematics; Artificial intelligence","score_opus":0.07304272904768266,"score_gpt":0.2879784058940713,"score_spread":0.21493567684638865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120159299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020179346,0.00068308157,0.9962392,0.00008919315,0.0004515627,0.00014272788,0.00000647573,0.000042856613,0.00032698744],"genre_scores_gemma":[0.1172742,0.00034691585,0.8815968,0.00005111083,0.00048055637,0.0000028250552,0.0000013317042,0.000043092597,0.00020317598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894965,0.00013898463,0.0004263922,0.00006106491,0.00017388618,0.00025001724],"domain_scores_gemma":[0.9986441,0.0006199848,0.00009211481,0.00009131842,0.00044997173,0.00010250599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081620755,0.00011118357,0.00023581799,0.00006843479,0.00008408253,0.000044221055,0.00013285631,0.00006996929,0.00007102712],"category_scores_gemma":[0.0003560418,0.0001019963,0.00006151725,0.00021176258,0.000029103621,0.00007932071,0.000008118447,0.0002729827,0.0000091691845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019055526,0.000016987082,0.00008085318,0.000020332995,0.000060966762,0.000014569921,0.00030714564,0.96073407,0.00017031269,0.00018700007,0.037309665,0.0010790725],"study_design_scores_gemma":[0.00057951483,0.00016759272,0.00005139827,0.00003666873,0.00003433148,0.000054776883,0.000040418676,0.9953794,0.00060421176,0.00015183311,0.0027838398,0.000116052346],"about_ca_topic_score_codex":3.3421398e-7,"about_ca_topic_score_gemma":1.7700097e-7,"teacher_disagreement_score":0.115256265,"about_ca_system_score_codex":0.000063298845,"about_ca_system_score_gemma":0.000019634861,"threshold_uncertainty_score":0.41592884},"labels":[],"label_agreement":null},{"id":"W2120324231","doi":"10.1287/trsc.1100.0317","title":"A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":137,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Liquefied natural gas; Column generation; Operations research; Variable (mathematics); Routing (electronic design automation); Branch and price; Inventory theory; Natural gas; Computer science; Engineering; Integer programming; Waste management; Inventory control; Mathematical optimization; Mathematics; Computer network","score_opus":0.014639070204195309,"score_gpt":0.30146552957011996,"score_spread":0.28682645936592466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120324231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36586675,0.000020079997,0.63288754,0.0000987526,0.00026941433,0.0002473509,0.0000041051076,0.00024916575,0.00035686372],"genre_scores_gemma":[0.5633854,0.0000029210175,0.4364673,0.000047885453,0.000024532352,0.000027263211,0.0000041333246,0.000012889675,0.000027675158],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989399,0.00001906516,0.0002657166,0.00026819465,0.00022866816,0.0002785101],"domain_scores_gemma":[0.999392,0.00014496328,0.00005904526,0.00014281775,0.00015841732,0.00010279943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016751939,0.000114515205,0.00012608999,0.00013770735,0.00017942941,0.00006855739,0.00019044543,0.000056373963,0.0000119037],"category_scores_gemma":[0.00014940264,0.00011688228,0.000036529877,0.0005923208,0.00011122812,0.0004331852,0.0000035806236,0.00021943946,0.0000016799821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019438807,0.0000174094,0.0053212056,0.00019167538,0.000013511842,0.0000010359746,0.0076564006,0.08667129,0.8380628,0.02357883,0.000029847328,0.038436525],"study_design_scores_gemma":[0.0004533272,0.000016342643,0.020126792,0.000023085686,0.000016560307,0.000004569186,0.00006849939,0.9366684,0.040751226,0.0012614914,0.00037719344,0.0002325324],"about_ca_topic_score_codex":0.000016959291,"about_ca_topic_score_gemma":0.00007221307,"teacher_disagreement_score":0.8499971,"about_ca_system_score_codex":0.000022828188,"about_ca_system_score_gemma":0.00006859994,"threshold_uncertainty_score":0.47663212},"labels":[],"label_agreement":null},{"id":"W2120930954","doi":"10.1287/ijoc.2013.0549","title":"An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem","year":2013,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":true,"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; HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Column generation; Mathematical optimization; Column (typography); Computer science; Routing (electronic design automation); Set (abstract data type); Upper and lower bounds; Path (computing); Shortest path problem; Enumeration; Vehicle routing problem; Mathematics; Algorithm; Theoretical computer science; Combinatorics","score_opus":0.023142711761351704,"score_gpt":0.26970206619011905,"score_spread":0.24655935442876734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120930954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063979745,0.000019520694,0.93432844,0.00021894954,0.00043890838,0.0005103789,0.0000019669076,0.00019784921,0.00030422967],"genre_scores_gemma":[0.7023861,0.0000047873696,0.2966083,0.0004273254,0.00049729494,0.00001619218,0.000010524772,0.000038387312,0.000011091648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986491,0.00006396265,0.0005492037,0.00014383637,0.0002577887,0.00033607165],"domain_scores_gemma":[0.99855655,0.00055541017,0.0002101955,0.0001952953,0.00035635778,0.00012619236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014569184,0.00019631104,0.0001673776,0.00015560945,0.00068998395,0.0006165563,0.00018941962,0.00008825001,0.000017955985],"category_scores_gemma":[0.00020037148,0.00014319738,0.000054591175,0.00027263537,0.000025756228,0.00045703107,0.000011944746,0.00042682272,0.0000120086615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024551143,0.000009389262,0.00009708145,0.000011719733,0.00001726221,3.343767e-7,0.0003654738,0.7539937,0.0002999023,0.00007131263,0.00017393402,0.24495743],"study_design_scores_gemma":[0.00054450403,0.0001689665,0.00078549003,0.0001013458,0.000012424548,0.000025504372,0.00016145925,0.9968854,0.000858458,0.0000681519,0.00019642428,0.00019184356],"about_ca_topic_score_codex":0.0000148928375,"about_ca_topic_score_gemma":0.0000015105167,"teacher_disagreement_score":0.63840634,"about_ca_system_score_codex":0.00014125824,"about_ca_system_score_gemma":0.000048854658,"threshold_uncertainty_score":0.5945467},"labels":[],"label_agreement":null},{"id":"W2121266360","doi":"10.1287/ijoc.1100.0439","title":"A Hybrid Heuristic for an Inventory Routing Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":199,"is_retracted":false,"has_abstract":true,"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":"Stockout; Mathematical optimization; Heuristic; Benchmark (surveying); Computer science; Integer programming; Service level; Inventory control; Operations research; Inventory theory; Routing (electronic design automation); Set (abstract data type); Time horizon; Vehicle routing problem; Tabu search; Mathematics","score_opus":0.05024524965669892,"score_gpt":0.28063752694019994,"score_spread":0.23039227728350103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121266360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24368696,0.000025266803,0.74641174,0.000006841169,0.0007053306,0.00020431109,0.0000019192803,0.00039807332,0.00855958],"genre_scores_gemma":[0.7322289,0.000003936932,0.2672054,0.00012146156,0.0003611852,0.0000029369196,0.0000031400534,0.000052590924,0.000020504021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849004,0.000041664298,0.0006647791,0.00013381432,0.00020419426,0.00046553856],"domain_scores_gemma":[0.9991186,0.00012122547,0.00022456242,0.00017317348,0.00014865518,0.00021374655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014930516,0.00020366347,0.00022731091,0.0002027205,0.00030666945,0.00014415578,0.00028406494,0.000060638413,0.000019689072],"category_scores_gemma":[0.00019663188,0.00018691523,0.00010724302,0.00012742275,0.000021273712,0.0004166116,0.000037226084,0.00046281432,0.000015371863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041916453,0.000051919542,0.0017487889,0.00010905741,0.00008120827,0.000019251114,0.004257629,0.8336111,0.00012185925,0.0021179907,0.0005009239,0.15733838],"study_design_scores_gemma":[0.00059981504,0.0002644311,0.00044049247,0.00017970515,0.000015364238,0.00025231863,0.00014191086,0.9945787,0.0009561811,0.0015560283,0.00073344976,0.00028155863],"about_ca_topic_score_codex":0.0000029804885,"about_ca_topic_score_gemma":4.5858653e-7,"teacher_disagreement_score":0.4885419,"about_ca_system_score_codex":0.00013600118,"about_ca_system_score_gemma":0.00004382889,"threshold_uncertainty_score":0.7622182},"labels":[],"label_agreement":null},{"id":"W2121490839","doi":"10.1016/j.cor.2005.07.002","title":"Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Column generation; Mathematical optimization; Fixed cost; Computer science; Minification; Vehicle routing problem; Scheduling (production processes); Shortest path problem; Lexicographical order; Routing (electronic design automation); Mathematics","score_opus":0.04871979780575466,"score_gpt":0.33819297534956044,"score_spread":0.2894731775438058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121490839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.382472,0.00049680506,0.61513317,0.0008554179,0.000099601515,0.00047227152,0.000005627026,0.00017758559,0.00028748618],"genre_scores_gemma":[0.8104865,0.00013179233,0.18883543,0.0000678726,0.00021008369,0.000064224,0.000054167245,0.000040796418,0.00010912305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800277,0.0003696782,0.0003881023,0.00035053928,0.00032266843,0.0005662238],"domain_scores_gemma":[0.9992831,0.00015398079,0.0000141126775,0.00024408064,0.00018274887,0.00012199139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022038885,0.00014818186,0.00017693591,0.0003330797,0.0005373975,0.00053646305,0.00019761312,0.00010135638,0.000021079402],"category_scores_gemma":[0.0001351309,0.00018090085,0.000022385211,0.0007515256,0.00004839462,0.00047244332,0.0001499491,0.00050169654,0.00002138008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016752525,0.000031218322,0.0009898772,0.000024163326,0.000011608358,0.0000016037939,0.0010424256,0.9520383,0.023592934,0.00027833637,0.00071147806,0.021276396],"study_design_scores_gemma":[0.0006826593,0.000020881324,0.00041414754,0.000081701655,0.0000025361303,0.0000029095759,0.0001566667,0.994784,0.0031336744,0.000006466854,0.000534884,0.00017946826],"about_ca_topic_score_codex":0.00008263541,"about_ca_topic_score_gemma":0.00043772534,"teacher_disagreement_score":0.4280145,"about_ca_system_score_codex":0.00036937487,"about_ca_system_score_gemma":0.00004812058,"threshold_uncertainty_score":0.73769224},"labels":[],"label_agreement":null},{"id":"W2122102418","doi":"10.1109/case.2011.6042475","title":"Maximizing the throughput of multimodal logistic platforms by simulation-optimization: The Duferco case study","year":2011,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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":"Ministero dell'Università e della Ricerca; Canada Research Chairs","keywords":"Schedule; Computer science; Scheduling (production processes); Factory (object-oriented programming); Throughput; Mathematical optimization; Real-time computing; Mathematics","score_opus":0.08324695455072333,"score_gpt":0.3044429500353009,"score_spread":0.22119599548457758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122102418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06603842,0.00007882047,0.9301201,0.000024542946,0.0001854196,0.0005636218,0.000005649831,0.00026402148,0.0027193637],"genre_scores_gemma":[0.8797583,0.000010554411,0.120006114,0.0000503818,0.000036459915,0.000022208014,0.0000036400506,0.000038893762,0.00007346404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998881,0.000082566425,0.00044502897,0.00017161146,0.00020628845,0.00021353325],"domain_scores_gemma":[0.99864066,0.0006095723,0.00008862344,0.0005061793,0.000115033145,0.00003993963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549907,0.00018447354,0.00018505428,0.000041766132,0.00023758503,0.000035726196,0.00027817066,0.000072052615,0.00036649444],"category_scores_gemma":[0.00017471473,0.00010416128,0.0000550369,0.00034629062,0.00009324777,0.00019150454,0.000068525354,0.00018704683,0.0000072856637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062118947,0.0000634248,0.0014907739,0.000008482072,0.00006016514,0.00001849104,0.005533863,0.9913315,0.0000101304195,0.00012741364,0.00009016866,0.001259374],"study_design_scores_gemma":[0.00039726967,0.00004403823,0.00020996202,0.0000050057306,0.00004031634,0.00005311199,0.0055289287,0.99327964,0.00020971203,0.00006497079,0.000025670071,0.0001413636],"about_ca_topic_score_codex":0.00037358922,"about_ca_topic_score_gemma":0.000033739238,"teacher_disagreement_score":0.81371987,"about_ca_system_score_codex":0.00003401281,"about_ca_system_score_gemma":0.00001336029,"threshold_uncertainty_score":0.42475736},"labels":[],"label_agreement":null},{"id":"W2122999407","doi":"10.1287/mnsc.1050.0392","title":"Efficient Production-Distribution System Design","year":2005,"lang":"en","type":"article","venue":"Management Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"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; University of Waterloo","funders":"","keywords":"Column generation; Relaxation (psychology); Mathematical optimization; Context (archaeology); Cutting-plane method; Upper and lower bounds; Branch and bound; Point (geometry); Distribution (mathematics); Production (economics); Plane (geometry); Hierarchy; Interior point method; Mathematics; Linear programming relaxation; Computer science; Supply chain; Applied mathematics; Geometry; Mathematical analysis; Linear programming; Integer programming","score_opus":0.01627386220479309,"score_gpt":0.24489262091747838,"score_spread":0.22861875871268528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122999407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014984555,0.000024535211,0.9747216,0.00012765022,0.0005275452,0.00029120175,8.350565e-7,0.0007052766,0.008616766],"genre_scores_gemma":[0.796871,0.000002947355,0.20280075,0.000010163667,0.000057675097,0.00001994746,0.0000011419585,0.0000074112027,0.00022898069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897563,0.000026301903,0.00014588937,0.00023504099,0.0003669423,0.00025017053],"domain_scores_gemma":[0.99961686,0.00001027861,0.000022506738,0.00025746392,0.000041348616,0.00005154728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016344234,0.000078925674,0.000058446938,0.00011282914,0.0002084651,0.00008274289,0.00026296082,0.000014360515,0.000009296244],"category_scores_gemma":[0.00003471568,0.0000803037,0.000014185443,0.0009840839,0.00007613363,0.00010228903,0.00005619446,0.000044315428,0.00013031828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.9580864e-7,0.00000793981,0.000018426073,0.00003365047,0.000002917724,6.7914345e-7,0.00004147621,0.98372054,0.00058337685,0.0036045373,0.0006148836,0.011370902],"study_design_scores_gemma":[0.00006178699,0.000003896085,0.0008447145,0.000023127506,0.000007124295,0.000003053213,0.000082650404,0.99092656,0.0061062663,0.00000445561,0.0018431258,0.00009325612],"about_ca_topic_score_codex":4.9914667e-7,"about_ca_topic_score_gemma":8.5604704e-8,"teacher_disagreement_score":0.7818864,"about_ca_system_score_codex":0.0004012701,"about_ca_system_score_gemma":0.000007000969,"threshold_uncertainty_score":0.32746896},"labels":[],"label_agreement":null},{"id":"W2123789618","doi":"","title":"Construcción de aplicativo web para la gestión y prestación del servicio de ambulancias en la ciudad de Pereira, utilizando inteligencia artificial","year":2021,"lang":"es","type":"article","venue":"Repository Technological University of Pereira (Technological University of Pereira)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":353,"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; University of New Brunswick","funders":"","keywords":"Arc routing; Arc (geometry); Routing (electronic design automation); Computer science; Mathematical optimization; Operations research; Mathematics; Computer network; Geometry","score_opus":0.026683949259711164,"score_gpt":0.2532070197623499,"score_spread":0.22652307050263873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123789618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8220032,0.0007149459,0.16347012,0.00070685736,0.00005376306,0.00043602206,0.00015953623,0.00190385,0.010551739],"genre_scores_gemma":[0.8799331,0.0020704037,0.11726733,0.000027268343,0.00003766599,9.866786e-7,0.000021572574,0.000058883455,0.00058275793],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.993957,0.0019136681,0.0007716794,0.0013858699,0.00067855185,0.0012932529],"domain_scores_gemma":[0.99520224,0.0015380479,0.0006585103,0.0014763033,0.0006580916,0.0004667762],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0017017795,0.000854505,0.0015356424,0.0005724225,0.0007807665,0.00009796995,0.0025633469,0.0043374933,0.00048548603],"category_scores_gemma":[0.0016684477,0.0010600634,0.0007579528,0.00171954,0.004354479,0.0003044679,0.0018558232,0.0028247992,0.000027491275],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090628606,0.0023010084,0.15264902,0.0014580591,0.0011290859,0.009602267,0.0017977174,0.018296914,0.5258554,0.2363491,0.0003028694,0.04935222],"study_design_scores_gemma":[0.00773279,0.0019167921,0.26491472,0.0031838638,0.00296503,0.0056148963,0.07559165,0.2774247,0.29528156,0.014683378,0.044816863,0.0058737374],"about_ca_topic_score_codex":0.00033700958,"about_ca_topic_score_gemma":0.000049177066,"teacher_disagreement_score":0.2591278,"about_ca_system_score_codex":0.0013219473,"about_ca_system_score_gemma":0.0010432318,"threshold_uncertainty_score":0.9994757},"labels":[],"label_agreement":null},{"id":"W2124521189","doi":"10.1287/trsc.1060.0166","title":"Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":198,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Norges Forskningsråd","keywords":"Vehicle routing problem; Heuristic; Mathematical optimization; Stochastic programming; Routing (electronic design automation); Sample (material); Dynamic programming; Problem statement; Computer science; Statement (logic); Operations research; Mathematics; Engineering; Management science","score_opus":0.007078761078080346,"score_gpt":0.23236681254588554,"score_spread":0.2252880514678052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124521189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40895444,0.000037670863,0.59053016,0.000016579053,0.000027514903,0.00013348942,0.000004301456,0.00020329212,0.00009258614],"genre_scores_gemma":[0.7973598,0.0000020378131,0.20256226,0.000009747837,0.000010917098,0.000012442884,0.000008424914,0.000020221507,0.000014149276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987832,0.000015898751,0.00028051483,0.00029300878,0.0002819829,0.00034542108],"domain_scores_gemma":[0.99953115,0.00012025082,0.00006344202,0.00012970215,0.00007771167,0.00007775576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059059187,0.0001394972,0.00014088648,0.00015762886,0.0002982622,0.00012625512,0.00012497121,0.000029124554,0.0000076032625],"category_scores_gemma":[0.00004705997,0.0001356131,0.000015361551,0.00083518244,0.00019356307,0.000430091,0.000003961273,0.00011917619,0.0000025082163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039868323,0.0000072700113,0.007552402,0.000036991773,0.0000020097175,0.0000021027215,0.0010408034,0.97701234,0.011779529,0.000578828,0.0000011618315,0.001982579],"study_design_scores_gemma":[0.00028495194,0.000017752065,0.075048156,0.000077622295,0.000014937448,0.000004652425,0.00010634858,0.92357314,0.00039675162,0.00028596108,0.000006059617,0.00018367058],"about_ca_topic_score_codex":0.00015246787,"about_ca_topic_score_gemma":0.00027884822,"teacher_disagreement_score":0.38840535,"about_ca_system_score_codex":0.000077597106,"about_ca_system_score_gemma":0.00005781316,"threshold_uncertainty_score":0.55301416},"labels":[],"label_agreement":null},{"id":"W2125126715","doi":"10.1287/ijoc.1110.0489","title":"A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Ministero dell'Università e della Ricerca","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; 2-opt; Traveling purchaser problem; Pickup; Branch and cut; Mathematical optimization; Algorithm; Computer science; Path (computing); Mathematics; Branch and bound; Shortest path problem; Nearest neighbour algorithm; Combinatorial optimization; Hamiltonian path; Stack (abstract data type); Integer programming; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.03182662460064117,"score_gpt":0.25576659836804566,"score_spread":0.2239399737674045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125126715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059733357,0.00006882583,0.937962,0.000028777504,0.00024196971,0.00032427174,0.000002108374,0.00017037078,0.0014683185],"genre_scores_gemma":[0.50771207,0.000020667632,0.49191678,0.00007762592,0.00019913449,0.000005533726,0.0000011666814,0.000041756437,0.00002523882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998905,0.000015169083,0.00041862833,0.00011185088,0.00018809678,0.0003612405],"domain_scores_gemma":[0.99914724,0.00032911403,0.00015543228,0.00013385243,0.00012672784,0.00010762819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096417224,0.00018762582,0.0001927376,0.00008425561,0.00043362254,0.00016777714,0.00019690653,0.000065626446,0.0000072165653],"category_scores_gemma":[0.00002795349,0.0001167311,0.000063037085,0.00015753243,0.000036520625,0.00023464407,0.00003064136,0.0004614228,0.0000031949976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004991664,0.000010704981,0.0010724971,0.000032716278,0.000095811505,0.0000034623133,0.0031044057,0.59243816,0.000023294044,0.0001569635,0.000028848975,0.4029832],"study_design_scores_gemma":[0.0018471689,0.00014598049,0.0012332391,0.00015929264,0.000024460925,0.00023236175,0.00024573528,0.99401724,0.0010373384,0.00011998955,0.0007370047,0.00020016341],"about_ca_topic_score_codex":0.0000075446414,"about_ca_topic_score_gemma":0.000004564747,"teacher_disagreement_score":0.44797873,"about_ca_system_score_codex":0.000052194802,"about_ca_system_score_gemma":0.00003085662,"threshold_uncertainty_score":0.4760156},"labels":[],"label_agreement":null},{"id":"W2125771650","doi":"10.1287/opre.50.3.538.7737","title":"Hybrid Fiber Coaxial Network Design","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Computer science; Heuristics; Network planning and design; Mathematical optimization; Heuristic; Context (archaeology); Tabu search; Exploit; The Internet; Distributed computing; Algorithm; Computer network; Artificial intelligence; Mathematics","score_opus":0.1388816461261699,"score_gpt":0.3622179414103387,"score_spread":0.2233362952841688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125771650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006598993,0.00046272686,0.95211744,0.0004912689,0.0002424408,0.0005293206,0.000007131176,0.00042977094,0.039120927],"genre_scores_gemma":[0.2874268,0.00024736376,0.6885277,0.000044837732,0.0007335914,0.00016318209,0.00001788345,0.00008394546,0.022754675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846894,0.00044751965,0.00017468842,0.00015644173,0.0003282832,0.0004241029],"domain_scores_gemma":[0.9991817,0.00025054015,0.0000030171618,0.0002892411,0.00017836777,0.00009715442],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013492055,0.000084797895,0.000093446695,0.0001196836,0.00043051998,0.00019541112,0.000183972,0.000050816605,0.004964429],"category_scores_gemma":[0.00022988184,0.00008901159,0.000024698078,0.00045976316,0.00005692966,0.00015660038,0.00004228606,0.00035442412,0.0019713726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010983356,0.0000113833075,0.0000087563085,0.000003967291,0.000008999914,0.0000039701927,0.00007655567,0.9233034,0.00030891554,0.00029776452,0.06766396,0.00831123],"study_design_scores_gemma":[0.00013174233,0.000021986953,0.000021833232,0.000008428289,0.0000019827423,0.000007379821,0.000007965586,0.9772532,0.0013602062,0.000048987047,0.021039788,0.000096478616],"about_ca_topic_score_codex":0.000010668468,"about_ca_topic_score_gemma":0.0000044791004,"teacher_disagreement_score":0.28082782,"about_ca_system_score_codex":0.00008204,"about_ca_system_score_gemma":0.000019451685,"threshold_uncertainty_score":0.9988057},"labels":[],"label_agreement":null},{"id":"W2126043710","doi":"10.1111/j.1937-5956.2012.01338.x","title":"Analysis of Travel Times and CO <sub>2</sub> Emissions in Time‐Dependent Vehicle Routing","year":2012,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":319,"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; Fuel efficiency; Greenhouse gas; Context (archaeology); Computer science; Scheduling (production processes); Limiting; Operations research; Environmental economics; Transport engineering; Routing (electronic design automation); Environmental science; Automotive engineering; Operations management; Economics; Engineering","score_opus":0.012473771387788539,"score_gpt":0.25472848918032187,"score_spread":0.24225471779253333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126043710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631579,0.00021822774,0.034373656,0.00021016622,0.00009775695,0.00029617234,0.000004798638,0.00007659285,0.0015647295],"genre_scores_gemma":[0.99137986,0.00029452657,0.007860703,0.000015107243,0.00003244449,0.000023228788,0.000017156273,0.000011869075,0.0003651229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926615,0.000064373446,0.0002490579,0.00015907937,0.00011932187,0.00014202489],"domain_scores_gemma":[0.9997351,0.00001646448,0.000023019047,0.00014323312,0.000027031572,0.000055154083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684029,0.00009008833,0.00015160862,0.0003770051,0.0000993545,0.000037370188,0.00003976201,0.000031683514,0.00003400957],"category_scores_gemma":[0.00004697386,0.00009395393,0.000021569409,0.0005737076,0.000024808554,0.00020881848,0.000034854216,0.000067438414,0.000004543143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041704643,0.000102334525,0.027772402,0.000063174724,0.0003093161,3.6389102e-7,0.0015613824,0.909518,0.043005116,0.00066668284,0.00013105401,0.016866013],"study_design_scores_gemma":[0.00023029611,0.000009501712,0.115658626,0.00003111316,0.00035326293,0.0000020387215,0.0006143521,0.8308186,0.052020255,0.000007790926,0.00007150539,0.00018267642],"about_ca_topic_score_codex":0.00000493853,"about_ca_topic_score_gemma":0.000008259308,"teacher_disagreement_score":0.08788622,"about_ca_system_score_codex":0.000034083198,"about_ca_system_score_gemma":0.0000029047449,"threshold_uncertainty_score":0.383133},"labels":[],"label_agreement":null},{"id":"W2126208553","doi":"10.1287/mnsc.48.11.1446.267","title":"Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures","year":2002,"lang":"en","type":"article","venue":"Management 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":"University of Toronto","funders":"Office of Naval Research","keywords":"Computer science; Holding cost; Warehouse; Mathematical optimization; Heuristic; Time horizon; Piecewise linear function; Inventory control; Supply chain; Total cost; Zero (linguistics); Dynamic programming; Operations research; Inventory theory; Simple (philosophy); Piecewise; Mathematics; Economics; Microeconomics; Business","score_opus":0.027819486697966744,"score_gpt":0.258638289461894,"score_spread":0.23081880276392724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126208553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022209607,0.00014028531,0.9700265,0.00018317126,0.00025799344,0.0023651076,0.0000045575275,0.00057145493,0.0042413096],"genre_scores_gemma":[0.8278437,0.00002519506,0.17122395,0.00009817477,0.000046923837,0.00027967527,8.160908e-7,0.000042010455,0.0004395008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869114,0.000026928112,0.00016553393,0.0003062157,0.00035629707,0.00045388637],"domain_scores_gemma":[0.9993161,0.00012270665,0.000052627336,0.0003703252,0.00006772489,0.000070498616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053174864,0.00018611772,0.00013013092,0.00016869023,0.00046189677,0.00019441529,0.00048842805,0.000026445547,0.000020146013],"category_scores_gemma":[0.00006116239,0.00013126947,0.000035002206,0.00079924706,0.00030038966,0.00027958123,0.00012115305,0.00010175389,0.00000902144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005040129,0.000017170601,0.00065197493,0.000089753856,0.000033854925,0.000001348122,0.00078081846,0.9538114,0.00046441096,0.00080591213,0.00025536426,0.04308296],"study_design_scores_gemma":[0.0005037737,0.000060032955,0.0022842071,0.000043737327,0.00003954282,0.0000021649087,0.00016157964,0.9879457,0.0026553646,0.00007491189,0.0060087116,0.00022031319],"about_ca_topic_score_codex":0.0000087155995,"about_ca_topic_score_gemma":0.00000632195,"teacher_disagreement_score":0.80563414,"about_ca_system_score_codex":0.00012765346,"about_ca_system_score_gemma":0.0000036006047,"threshold_uncertainty_score":0.5353013},"labels":[],"label_agreement":null},{"id":"W2127654349","doi":"10.1287/trsc.2013.0472","title":"Thirty Years of Inventory Routing","year":2013,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":578,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Vehicle routing problem; Operations research; Scheduling (production processes); Computer science; Routing (electronic design automation); Metaheuristic; Class (philosophy); Categorization; Operations management; Engineering; Artificial intelligence; Computer network","score_opus":0.019102653731363887,"score_gpt":0.26441347945848326,"score_spread":0.24531082572711937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127654349","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91944027,0.000012249998,0.07885283,0.0000110752435,0.00012394694,0.000080624704,0.0000015690118,0.00012992207,0.001347537],"genre_scores_gemma":[0.95770264,0.000004924182,0.042229332,0.000015922624,0.000007898501,0.000004871434,0.0000018663037,0.000007554927,0.000024984376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993116,0.000009191207,0.00020256026,0.00010042658,0.00024380133,0.00013236857],"domain_scores_gemma":[0.99967223,0.000025744439,0.00003816839,0.000115865914,0.00009711171,0.000050896422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040521013,0.00004540052,0.00006905553,0.000096259275,0.000033037504,0.00001764358,0.00015527985,0.000021936192,0.000100748206],"category_scores_gemma":[0.00003985066,0.00005104213,0.00001980977,0.0005987892,0.00012305441,0.0003974046,0.0000017025374,0.00005226794,0.000024248948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010286594,0.000015468113,0.08948469,0.00005559321,0.000007088391,9.657416e-7,0.0060970644,0.70415306,0.16138959,0.0035866478,0.00007562576,0.035133183],"study_design_scores_gemma":[0.00011588189,0.0000071227423,0.6794265,0.000018758818,0.000004208225,2.2952216e-7,0.0001766183,0.29834086,0.021559132,0.00020642887,0.000046269484,0.00009797162],"about_ca_topic_score_codex":0.000030819632,"about_ca_topic_score_gemma":0.0000034662626,"teacher_disagreement_score":0.5899418,"about_ca_system_score_codex":0.000020089532,"about_ca_system_score_gemma":0.000030734933,"threshold_uncertainty_score":0.20814376},"labels":[],"label_agreement":null},{"id":"W2128811073","doi":"10.1287/ijoc.1110.0454","title":"A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":true,"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; Computer science; Hybrid algorithm (constraint satisfaction); Algorithm; Mathematical optimization; Constraint programming; Guided Local Search; Scheduling (production processes); Constraint (computer-aided design); Heuristic; Dynamic programming; Constraint logic programming; Mathematics; Stochastic programming","score_opus":0.025654230530110424,"score_gpt":0.2752020308302267,"score_spread":0.24954780030011628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128811073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0588155,0.000108822096,0.9396354,0.000045657598,0.00033958018,0.00043357586,0.000003925754,0.00017481949,0.0004427303],"genre_scores_gemma":[0.39220092,0.000036639212,0.60752255,0.000052522035,0.00013365249,0.000006810636,0.0000014962934,0.00003368752,0.000011729855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987023,0.000031659118,0.00047874058,0.00011845731,0.00021094753,0.00045791097],"domain_scores_gemma":[0.9991105,0.00039048283,0.00010510702,0.00012650513,0.0001344765,0.00013291456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018279253,0.000179404,0.000190743,0.00012888708,0.000430494,0.00024339255,0.00021191634,0.00004893755,0.000009111903],"category_scores_gemma":[0.000088722096,0.00012507667,0.00008188407,0.00012867663,0.00008034277,0.00018809583,0.00006174322,0.0005602496,0.0000034355357],"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.00000603247,0.000008340708,0.00010975471,0.000030046096,0.000056530105,0.000009440409,0.0011143604,0.13085544,0.00002113496,0.0001328344,0.000012875392,0.86764324],"study_design_scores_gemma":[0.0005311032,0.00011317028,0.00042930784,0.00012650114,0.000017177708,0.0006141662,0.00030559528,0.99648947,0.0004041837,0.00018819234,0.00060776854,0.00017338434],"about_ca_topic_score_codex":0.0000063670805,"about_ca_topic_score_gemma":6.612322e-7,"teacher_disagreement_score":0.86746985,"about_ca_system_score_codex":0.00008936616,"about_ca_system_score_gemma":0.000047607184,"threshold_uncertainty_score":0.51004785},"labels":[],"label_agreement":null},{"id":"W2129462568","doi":"10.1287/trsc.1090.0307","title":"The Stochastic Multiperiod Location Transportation Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Mathematical optimization; Scheduling (production processes); Computer science; Heuristic; Operations research; Neighbourhood (mathematics); Mathematics","score_opus":0.01011121697135362,"score_gpt":0.26157433246239836,"score_spread":0.2514631154910447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129462568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41430566,0.000020478154,0.58418065,0.00011431305,0.00052424526,0.00025892092,0.000008172687,0.0003410164,0.00024654958],"genre_scores_gemma":[0.94834,0.0000067708497,0.05146822,0.000019012141,0.000034134307,0.0000485366,0.00002149733,0.000019899335,0.00004193913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987192,0.000012679545,0.0003377644,0.00022330196,0.00043333272,0.0002737265],"domain_scores_gemma":[0.99919724,0.00010076785,0.000060709222,0.00024594725,0.00029793294,0.00009737596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087493367,0.000120162564,0.00008234103,0.000097013275,0.00048191345,0.00011777611,0.0003166667,0.000054355518,0.00002336593],"category_scores_gemma":[0.00006598295,0.000100186735,0.00002827079,0.0011412054,0.00033386963,0.0005153612,7.771945e-7,0.00022535665,0.00002083828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053419326,0.000009731813,0.00093443884,0.000018544068,0.000003576552,4.494641e-7,0.0024212764,0.901996,0.07387009,0.0054391203,0.000015378519,0.015286016],"study_design_scores_gemma":[0.00045583217,0.000021458793,0.27222058,0.00002220787,0.000025102847,0.0000020080747,0.00037176546,0.708971,0.015992623,0.0006103389,0.00097011734,0.00033694712],"about_ca_topic_score_codex":0.000016599271,"about_ca_topic_score_gemma":0.0005270091,"teacher_disagreement_score":0.5340344,"about_ca_system_score_codex":0.0000275802,"about_ca_system_score_gemma":0.000103123755,"threshold_uncertainty_score":0.40854964},"labels":[],"label_agreement":null},{"id":"W2129828643","doi":"10.1287/trsc.1120.0417","title":"Long-Haul Vehicle Routing and Scheduling with Working Hour Rules","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Scheduling (production processes); TRIPS architecture; Operations research; Computer science; Transport engineering; Truck; Job shop scheduling; Engineering; Routing (electronic design automation); Operations management; Computer network; Automotive engineering; Algorithm","score_opus":0.0235828219791595,"score_gpt":0.26791987820707636,"score_spread":0.24433705622791685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129828643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899412,0.00012017161,0.30918935,0.000018217012,0.0000829246,0.00005851181,9.990566e-7,0.00019724327,0.00039135345],"genre_scores_gemma":[0.8253438,0.000012142338,0.17454833,0.000020998672,0.000041925876,0.000004104854,0.0000027002777,0.000017710532,0.000008308773],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989747,0.0000149550715,0.0001836661,0.00017110918,0.0002951757,0.0003603892],"domain_scores_gemma":[0.99958456,0.000055947257,0.00004388988,0.00011739348,0.000056751505,0.00014147094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089667644,0.0001077986,0.00010044103,0.0001103675,0.00021421906,0.00008305161,0.000116837226,0.000033103308,0.0000120346485],"category_scores_gemma":[0.000028607627,0.00010155593,0.000013000352,0.0006348916,0.00013983774,0.00076395064,0.0000035182277,0.000115671886,0.0000062699937],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049240284,0.000009346999,0.5980089,0.000027217353,0.0000061926535,0.0000018259557,0.0036671348,0.37500623,0.0078504095,0.0012752044,5.988562e-7,0.0141420495],"study_design_scores_gemma":[0.0002553549,0.000010087572,0.7591613,0.00007985004,0.000017009936,0.0000054033144,0.00037143653,0.23053318,0.009301357,0.000019951854,0.000028640787,0.00021641227],"about_ca_topic_score_codex":0.0000069128764,"about_ca_topic_score_gemma":0.000009508964,"teacher_disagreement_score":0.16115245,"about_ca_system_score_codex":0.000032081414,"about_ca_system_score_gemma":0.000025761648,"threshold_uncertainty_score":0.41413307},"labels":[],"label_agreement":null},{"id":"W2130189990","doi":"10.1007/978-3-642-02882-3_23","title":"Approximation Algorithms for a Network Design Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Computer science; Path (computing); Tree (set theory); Mathematical optimization; Constraint (computer-aided design); Routing (electronic design automation); Integer (computer science); Class (philosophy); Algorithm; Mathematics; Combinatorics","score_opus":0.03091854809030773,"score_gpt":0.26336024853421175,"score_spread":0.23244170044390403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130189990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.8570555e-7,0.0002755652,0.9965668,0.000076940036,0.0006199683,0.00087771536,0.0000024867145,0.00033397623,0.0012459995],"genre_scores_gemma":[0.00037592556,0.00002149685,0.99853206,0.0001924087,0.00066164165,0.000023986755,0.000009333338,0.00005427488,0.0001289027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983416,0.000024059224,0.00036020682,0.0005147479,0.0003118838,0.00044750381],"domain_scores_gemma":[0.998922,0.00042276864,0.00010110219,0.0003552958,0.00012946966,0.00006939345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012663273,0.00031603227,0.00032252725,0.000258886,0.00012470051,0.0001640146,0.0005128971,0.00027391556,0.0000063633115],"category_scores_gemma":[0.000054524076,0.0003206728,0.00006622598,0.0003216407,0.00010707829,0.0001562625,0.00006190401,0.00035421178,0.0000046143605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013686097,0.0000016873178,4.5669853e-7,0.000024657678,0.0000029894406,8.8976014e-7,0.00007055225,0.56844103,0.000013766715,0.00040910576,0.000023714558,0.4310098],"study_design_scores_gemma":[0.00013718707,0.00006263868,0.0000032791042,0.00020699254,0.000007888527,0.00000854532,1.9700806e-8,0.89253104,0.0003709136,0.10577521,0.0005882797,0.00030799164],"about_ca_topic_score_codex":5.9863424e-7,"about_ca_topic_score_gemma":0.0000014954727,"teacher_disagreement_score":0.43070182,"about_ca_system_score_codex":0.00021495174,"about_ca_system_score_gemma":0.00009866854,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W2130798138","doi":"10.1016/j.cor.2007.10.017","title":"The capacity and distance constrained plant location problem","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"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; Universidad Carlos III de Madrid","keywords":"Tabu search; Mathematical optimization; Computer science; Extension (predicate logic); Heuristic; TRIPS architecture; Operations research; Mathematics","score_opus":0.053392370844684185,"score_gpt":0.33606661152574513,"score_spread":0.28267424068106095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130798138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035657946,0.00020854172,0.96194655,0.00045442188,0.00012323697,0.00032306867,0.000005813904,0.00012697582,0.0011534494],"genre_scores_gemma":[0.83394414,0.0000768048,0.16574433,0.000016500751,0.000069498004,0.000020111338,0.000012428227,0.00001398673,0.00010217208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896604,0.00014831439,0.00020174148,0.00014405297,0.00023715271,0.00030271284],"domain_scores_gemma":[0.9988713,0.00056345394,0.0000065754866,0.00020379221,0.00026990796,0.0000849364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025068226,0.00007467981,0.00006965892,0.00009409278,0.00070636626,0.0002630581,0.00015976849,0.00004490313,0.0000033781232],"category_scores_gemma":[0.00013470024,0.00006128294,0.0000105945255,0.00047450577,0.00024226082,0.00011462606,0.000045287063,0.00027921263,0.000008017737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008107142,0.000016745636,0.00035134624,0.000045670182,0.000023404793,0.000003094967,0.0013332039,0.91214746,0.001758062,0.04010194,0.0012856887,0.042925283],"study_design_scores_gemma":[0.0001471715,0.000017974731,0.0016194447,0.000027547794,0.000001440259,0.000011660501,0.0001426035,0.9933681,0.0010161242,0.00012555564,0.0034420749,0.000080290716],"about_ca_topic_score_codex":0.000026977517,"about_ca_topic_score_gemma":0.00024770823,"teacher_disagreement_score":0.7982862,"about_ca_system_score_codex":0.00009335435,"about_ca_system_score_gemma":0.000042277607,"threshold_uncertainty_score":0.543287},"labels":[],"label_agreement":null},{"id":"W2130863730","doi":"10.1016/j.dam.2006.04.043","title":"Solution techniques for the Large Set Covering Problem","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Mathematics; Set (abstract data type); Set cover problem; Combinatorics; Mathematical optimization; Computer science; Programming language","score_opus":0.014788920217505755,"score_gpt":0.26203942753925386,"score_spread":0.2472505073217481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130863730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006533945,0.00004980451,0.98264664,0.00005289487,0.000041299456,0.00082004647,0.00003569882,0.0007658817,0.0149343535],"genre_scores_gemma":[0.16860916,0.000013450301,0.8307727,0.000024368228,0.000116566334,0.0002452358,0.000042254676,0.000072695955,0.00010359884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919534,0.000005864292,0.00028123622,0.00011512256,0.00012935168,0.00027311087],"domain_scores_gemma":[0.9994247,0.00020194064,0.000064688764,0.00025990224,0.000028305658,0.000020471547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039693,0.00014848544,0.0001556228,0.0000356675,0.00015152016,0.00006051133,0.00015719618,0.000077999954,0.00001082205],"category_scores_gemma":[0.000017800681,0.00011615896,0.000055140274,0.00013193327,0.000022208924,0.000051464027,0.00003899295,0.00009732583,0.000008222204],"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.000011207099,0.00007256729,0.000025676884,0.0015317128,0.0001048278,6.205774e-7,0.0015795632,0.36728674,0.05423439,0.55698466,0.010910233,0.0072577717],"study_design_scores_gemma":[0.00023254871,0.00000793486,0.0000119416845,0.000035695804,0.00004842538,0.000002593235,0.00018303789,0.93521523,0.03141187,0.023580013,0.009045744,0.00022494508],"about_ca_topic_score_codex":0.0000023414486,"about_ca_topic_score_gemma":0.0000030675808,"teacher_disagreement_score":0.5679285,"about_ca_system_score_codex":0.00004655747,"about_ca_system_score_gemma":0.00000678676,"threshold_uncertainty_score":0.4736825},"labels":[],"label_agreement":null},{"id":"W2130923090","doi":"10.1287/trsc.1110.0394","title":"Feasibility of the Pickup and Delivery Problem with Fixed Partial Routes: A Complexity Analysis","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Pickup; Set (abstract data type); Computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.053287495377932294,"score_gpt":0.29179182450612057,"score_spread":0.23850432912818828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130923090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8319748,0.00001932479,0.1676893,0.00001664682,0.000026022444,0.00012214939,0.000011124974,0.000043328153,0.00009733588],"genre_scores_gemma":[0.92406,0.000002175224,0.075907245,0.000009792231,0.000005266518,0.0000043593986,0.00000277024,0.0000039670795,0.0000044231215],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99922097,0.000032756827,0.00019016997,0.00012505277,0.0002722996,0.00015876757],"domain_scores_gemma":[0.9995595,0.000038294696,0.000056853438,0.00018172183,0.000098145996,0.000065445754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000631314,0.00006593266,0.0001169786,0.00006960559,0.000098452045,0.000015864354,0.00012787501,0.000018710783,0.000017214192],"category_scores_gemma":[0.00001659664,0.000046186276,0.000031278178,0.0015233769,0.0003892793,0.00034739313,0.00000352442,0.000054028194,3.568663e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005614508,0.000013201642,0.84544516,0.000019798777,0.000016471398,3.657161e-8,0.0018239307,0.14979218,0.0022385744,0.0003700576,7.5780395e-7,0.00027423067],"study_design_scores_gemma":[0.00013068454,0.0000065075014,0.93309367,0.0000065077365,0.00009287671,2.818067e-7,0.000098787976,0.062150143,0.004333537,0.000023375256,0.0000044416156,0.0000591917],"about_ca_topic_score_codex":0.000049688657,"about_ca_topic_score_gemma":0.00014863822,"teacher_disagreement_score":0.09208522,"about_ca_system_score_codex":0.000024052282,"about_ca_system_score_gemma":0.00003343391,"threshold_uncertainty_score":0.18834217},"labels":[],"label_agreement":null},{"id":"W2132103269","doi":"10.1155/2013/203032","title":"A New Formulation of the Set Covering Problem for Metaheuristic Approaches","year":2013,"lang":"en","type":"article","venue":"ISRN Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"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":"Metaheuristic; Heuristic; Redundancy (engineering); Mathematical optimization; Computer science; Set (abstract data type); Computation; Greedy algorithm; Algorithm; Mathematics","score_opus":0.17930486376530602,"score_gpt":0.37034667105220825,"score_spread":0.19104180728690223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132103269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04797953,0.000054697604,0.9473728,0.00053055485,0.00006974463,0.0017388812,0.000014230598,0.000077976685,0.0021615808],"genre_scores_gemma":[0.70973593,0.0000054783045,0.28860536,0.0000053474782,0.000050598617,0.00026808374,0.000012269634,0.00002476376,0.0012921413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900466,0.00012703106,0.00024174713,0.000120208584,0.00027137436,0.00023497701],"domain_scores_gemma":[0.99913746,0.00024122556,0.000011752983,0.00028025385,0.00027870337,0.000050599836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086405064,0.00007406561,0.00010433287,0.000118367956,0.00022015753,0.00012429367,0.0002189961,0.000077236444,0.00008169025],"category_scores_gemma":[0.0004061116,0.00005743803,0.000045985347,0.00050625607,0.000027022745,0.0002534542,0.000058396945,0.0002320814,0.000019099478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015058379,0.0000069289167,0.00022159691,0.000068232606,0.000019839992,1.4408728e-8,0.0005240815,0.98012394,0.0057262974,0.006580343,0.0011665982,0.0055606463],"study_design_scores_gemma":[0.0001907455,0.000017919483,0.0010688513,0.000019083933,0.0000063734874,9.0000464e-7,0.00012229645,0.98771435,0.009326145,0.0009545517,0.0005143859,0.00006442283],"about_ca_topic_score_codex":0.00017454631,"about_ca_topic_score_gemma":0.000097792035,"teacher_disagreement_score":0.6617564,"about_ca_system_score_codex":0.000069548245,"about_ca_system_score_gemma":0.00009832034,"threshold_uncertainty_score":0.23422548},"labels":[],"label_agreement":null},{"id":"W2132499281","doi":"10.1287/ijoc.1060.0208","title":"The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":173,"is_retracted":false,"has_abstract":true,"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; University of Texas at Dallas","keywords":"Mathematical optimization; Job shop scheduling; Scheduling (production processes); Computer science; Production schedule; Heuristic; Operations research; Schedule; Memetic algorithm; Heuristics; Genetic algorithm; Mathematics","score_opus":0.015318365491527371,"score_gpt":0.2665560813810715,"score_spread":0.25123771588954413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132499281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4595493,0.00005639907,0.53955704,0.00011920461,0.00022908411,0.00028938628,4.4690353e-7,0.000120317905,0.00007881664],"genre_scores_gemma":[0.7094458,0.000017967672,0.2901905,0.000021213504,0.00027968807,0.000003122408,0.0000030012468,0.00002510113,0.000013667967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989302,0.000014217353,0.0004564137,0.00011955821,0.00018736803,0.00029225595],"domain_scores_gemma":[0.9993022,0.000163967,0.000112960224,0.00009093476,0.00025237244,0.000077532015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024878718,0.0001423739,0.00012697803,0.00012018946,0.00047894663,0.0001793918,0.000083661485,0.000040392115,4.0792415e-7],"category_scores_gemma":[0.00020655981,0.00008769022,0.000031318494,0.00029630825,0.000031924385,0.0002505459,0.000003482715,0.00039651492,3.6697315e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009556921,0.0000065374447,0.0024207165,0.000043102424,0.00004321878,0.0000017780353,0.0009219963,0.7891772,0.0006939444,0.000121793615,0.00002022241,0.20645393],"study_design_scores_gemma":[0.00082584366,0.00045758643,0.013888325,0.00092037587,0.000058491125,0.00046622564,0.0014741273,0.96061444,0.01670401,0.00015423803,0.003937664,0.0004986976],"about_ca_topic_score_codex":0.0000011192726,"about_ca_topic_score_gemma":0.000017277143,"teacher_disagreement_score":0.24989645,"about_ca_system_score_codex":0.00007646821,"about_ca_system_score_gemma":0.000038758946,"threshold_uncertainty_score":0.36837187},"labels":[],"label_agreement":null},{"id":"W2132824134","doi":"10.1002/atr.111","title":"Multiple objective optimization of the fleet sizing problem for road freight transportation","year":2011,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sizing; Operations research; Computer science; Transportation theory; Set (abstract data type); Decision maker; Queueing theory; Sample (material); Pareto principle; Transportation planning; Mathematical optimization; Fleet management; Transport engineering; Engineering; Mathematics","score_opus":0.016292504477764987,"score_gpt":0.2413963853853628,"score_spread":0.2251038809075978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132824134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22733311,0.000117930205,0.77157384,0.000013806085,0.00039168823,0.00039702505,0.000038957172,0.000040473726,0.000093166906],"genre_scores_gemma":[0.58064353,0.00004843223,0.41921026,0.000005722642,0.000030109877,0.000011115235,0.00001967629,0.000026579877,0.0000045606685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986802,0.000038885228,0.00081111863,0.00010489417,0.00022173669,0.0001432135],"domain_scores_gemma":[0.9987032,0.0000878639,0.0005616833,0.00011177601,0.00049099757,0.00004447171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030073675,0.00014079845,0.00024561747,0.00012232029,0.00006357723,0.0000063218604,0.00014194325,0.00008561923,0.000014455074],"category_scores_gemma":[0.000055204433,0.00011794139,0.00017864158,0.00032307944,0.000028430717,0.00055491703,5.70476e-7,0.00014926716,1.325221e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013710713,0.00003757368,0.003136746,0.0001167062,0.00005655284,7.50106e-7,0.006654447,0.9758149,0.009246379,0.0001390721,0.0000040474865,0.004655729],"study_design_scores_gemma":[0.005694221,0.00046391774,0.47327107,0.0006231402,0.0005071764,0.0000075914427,0.0025014584,0.2739997,0.24036239,0.0018766063,0.00015936368,0.000533371],"about_ca_topic_score_codex":0.0000068908266,"about_ca_topic_score_gemma":0.000048891292,"teacher_disagreement_score":0.7018152,"about_ca_system_score_codex":0.00005508127,"about_ca_system_score_gemma":0.000040008927,"threshold_uncertainty_score":0.480951},"labels":[],"label_agreement":null},{"id":"W2134125472","doi":"10.1007/s10479-015-1805-9","title":"Multi-period hub network design problems with modular capacities","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"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":"Integer programming; Theory of computation; Modular design; Mathematical optimization; Set (abstract data type); Integer (computer science); Computer science; Relevance (law); Linear programming; Measure (data warehouse); Network planning and design; Facility location problem; Mathematics; Algorithm; Data mining; Telecommunications","score_opus":0.42360263638416223,"score_gpt":0.4270872876495254,"score_spread":0.003484651265363181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134125472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050369635,0.00081974815,0.94641274,0.0005478611,0.0000618069,0.00059420936,0.000008949533,0.00015416513,0.0010308686],"genre_scores_gemma":[0.47294486,0.00009547545,0.5260765,0.000018165481,0.00007373457,0.00010805857,0.000010620495,0.000039844803,0.0006327549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998203,0.00047643733,0.00025149956,0.00016174573,0.00048700054,0.00042032683],"domain_scores_gemma":[0.9981002,0.0000960548,0.000011125467,0.0003346659,0.0013061006,0.00015184839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030305847,0.000112999674,0.00017397167,0.00018537372,0.00019776706,0.000115320305,0.00021680535,0.00007442728,0.000033587643],"category_scores_gemma":[0.00035315566,0.0001001345,0.000024131044,0.0007500416,0.00020739285,0.00028184598,0.000039585873,0.00027608094,0.000025542118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009908865,0.000029561434,0.000103452774,0.000027429067,0.000038025937,0.000002496632,0.0021881915,0.99256676,0.0017508942,0.00033685716,0.0025809004,0.00036554737],"study_design_scores_gemma":[0.00027487535,0.00016406178,0.00009300734,0.000056753986,0.0000027676672,0.000005757058,0.0006774158,0.9898185,0.008012553,0.000078406396,0.00069188414,0.00012399103],"about_ca_topic_score_codex":0.00008129709,"about_ca_topic_score_gemma":0.00004301411,"teacher_disagreement_score":0.42257524,"about_ca_system_score_codex":0.000029240664,"about_ca_system_score_gemma":0.00016824932,"threshold_uncertainty_score":0.40833664},"labels":[],"label_agreement":null},{"id":"W2134381195","doi":"10.1287/trsc.2013.0489","title":"A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Column generation; Vehicle routing problem; Mathematical optimization; Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Computer science; Linear programming relaxation; Set (abstract data type); Relaxation (psychology); Branch and cut; Extension (predicate logic); Linear programming; Path (computing); Integer (computer science); Mathematics; Graph; Theoretical computer science","score_opus":0.012188179354596644,"score_gpt":0.25526921868208735,"score_spread":0.2430810393274907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134381195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12418705,0.00002894073,0.87489146,0.00012572615,0.000071595576,0.0002921944,0.000005372718,0.0002117293,0.00018591904],"genre_scores_gemma":[0.6823589,0.000005652295,0.31747827,0.00005025115,0.000024129573,0.000042211886,0.0000023189652,0.000016425483,0.00002181575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989917,0.000019121471,0.00023191681,0.00024318125,0.00025174126,0.00026229882],"domain_scores_gemma":[0.99921376,0.00035331363,0.000059688147,0.00016182868,0.00014272265,0.00006869759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011213502,0.00011786002,0.00011363518,0.0000645823,0.000300699,0.00010539933,0.00021858038,0.000028057428,0.000004228717],"category_scores_gemma":[0.00006129283,0.00008437414,0.000023504603,0.00052684464,0.0001828128,0.0003618419,0.0000043406644,0.000096065836,0.0000017717242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010510787,0.000013730102,0.009961514,0.00006839611,0.000019139892,4.5536459e-7,0.004938202,0.61266494,0.012840873,0.0019165216,0.000008522016,0.35755718],"study_design_scores_gemma":[0.00040406606,0.000033190332,0.05149225,0.000032373922,0.000017598408,0.0000022363586,0.00013418256,0.9403871,0.0071235257,0.00009106728,0.00015209557,0.000130304],"about_ca_topic_score_codex":0.000026891375,"about_ca_topic_score_gemma":0.00004009479,"teacher_disagreement_score":0.55817187,"about_ca_system_score_codex":0.000023710558,"about_ca_system_score_gemma":0.000026979227,"threshold_uncertainty_score":0.34406775},"labels":[],"label_agreement":null},{"id":"W2134465458","doi":"10.1002/net.20447","title":"A branch‐and‐cut algorithm for the preemptive swapping problem","year":2011,"lang":"en","type":"article","venue":"Networks","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":"Université de Montréal; HEC Montréal","funders":"","keywords":"Vertex (graph theory); Algorithm; Computer science; Graph; Integer programming; Branch and cut; Object (grammar); Combinatorics; Integer (computer science); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.02521659239295936,"score_gpt":0.23731270554829037,"score_spread":0.212096113155331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134465458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002402125,0.00083447987,0.99412817,0.000021090149,0.00025399422,0.0004185401,0.0000022258366,0.00025584173,0.0038454733],"genre_scores_gemma":[0.14659393,0.00023005062,0.852031,0.00010924997,0.00043788692,0.00021752097,0.0000042239562,0.0000695964,0.0003065371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942446,0.00002895199,0.00013947881,0.00012527715,0.000053053343,0.00022875276],"domain_scores_gemma":[0.9995269,0.00022183785,0.000027861077,0.00014643084,0.000036715905,0.00004022043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035404536,0.00010600184,0.00010659557,0.000021659354,0.00010652581,0.000026065949,0.00010970858,0.00008554084,0.000027399745],"category_scores_gemma":[0.000015540858,0.00008400987,0.000036684836,0.00011889358,0.000030758707,0.000067594156,0.00002967991,0.0001532548,0.0000027648996],"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.000005056726,0.0000062511685,0.00018626728,0.000020523512,0.00007800533,4.2495026e-7,0.001405984,0.38858452,0.000010140092,0.0002999984,0.0008937119,0.6085091],"study_design_scores_gemma":[0.00021360177,0.000018387715,0.0006697236,0.000027709524,0.000025080826,0.0000040028613,0.00003653916,0.99678653,0.00009213484,0.00037178732,0.0016454327,0.000109052286],"about_ca_topic_score_codex":0.0000071191394,"about_ca_topic_score_gemma":0.0000042888355,"teacher_disagreement_score":0.60840005,"about_ca_system_score_codex":0.000016275777,"about_ca_system_score_gemma":0.0000051348343,"threshold_uncertainty_score":0.34258232},"labels":[],"label_agreement":null},{"id":"W2135680984","doi":"10.1287/trsc.1070.0223","title":"Tabu Search, Partial Elementarity, and Generalized <i>k</i>-Path Inequalities for the Vehicle Routing Problem with Time Windows","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":227,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Tabu search; Mathematical optimization; Benchmark (surveying); Generalization; Heuristic; Routing (electronic design automation); Path (computing); Set (abstract data type); Computer science; Relaxation (psychology); Shortest path problem; Mathematics; Graph; Theoretical computer science","score_opus":0.035265094387614375,"score_gpt":0.27635904149410156,"score_spread":0.24109394710648718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135680984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7052914,0.00003385648,0.29387394,0.00012733764,0.00003135904,0.00039774695,0.000022747217,0.00013812748,0.00008350238],"genre_scores_gemma":[0.8933262,0.000027347969,0.10638027,0.0000748908,0.000033005173,0.000055132296,0.00001515961,0.000017985873,0.00006997936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988167,0.000031159874,0.00025372868,0.00021620409,0.00037786816,0.0003043029],"domain_scores_gemma":[0.99947345,0.00014466983,0.00004422565,0.00013892558,0.00012531702,0.000073438205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010770439,0.0001123808,0.0001224617,0.000056020024,0.0005357256,0.00006436481,0.00017310673,0.000024295381,0.000021270162],"category_scores_gemma":[0.000018158347,0.000084227875,0.000021621847,0.00044645963,0.00032762208,0.00039358763,0.0000053487247,0.00008619832,0.0000018924928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048959377,0.000018020919,0.035057258,0.000059231326,0.0000224835,0.0000028084407,0.013141322,0.91693735,0.029960055,0.00263386,0.00005571728,0.00206296],"study_design_scores_gemma":[0.0011222685,0.000067668574,0.037175324,0.000023714703,0.000027341286,0.0000061397905,0.0003774705,0.9379273,0.022675969,0.000060401228,0.0003166034,0.00021980543],"about_ca_topic_score_codex":0.00009405001,"about_ca_topic_score_gemma":0.00003777423,"teacher_disagreement_score":0.18803486,"about_ca_system_score_codex":0.000029621688,"about_ca_system_score_gemma":0.00009005233,"threshold_uncertainty_score":0.41204226},"labels":[],"label_agreement":null},{"id":"W2136611127","doi":"10.1287/trsc.1060.0187","title":"Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":260,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Tabu search; Mathematical optimization; Vehicle routing problem; Routing (electronic design automation); Heuristics; Metaheuristic; Computer science; Relaxation (psychology); Heuristic; Local search (optimization); Mathematics; Computer network","score_opus":0.01782215380448123,"score_gpt":0.27707571884409293,"score_spread":0.2592535650396117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136611127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27067736,0.00011271647,0.7273492,0.00013425565,0.000121933874,0.00036067955,0.000013436386,0.0002935267,0.0009368859],"genre_scores_gemma":[0.965493,0.000019601219,0.03420775,0.00007271863,0.000028476874,0.000017685097,0.000051135874,0.000029500328,0.00008010636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979303,0.0000678931,0.000510613,0.00032685182,0.0006841929,0.00048016495],"domain_scores_gemma":[0.9985245,0.00034655872,0.000090113965,0.00024713678,0.00066399673,0.00012772101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003811379,0.00017007234,0.00013860394,0.00017415879,0.0007193388,0.00014780836,0.00036846558,0.000060086113,0.00003418447],"category_scores_gemma":[0.0002262158,0.00014526793,0.00003070006,0.0029861731,0.00039972845,0.000560518,0.0000043332284,0.00028366264,0.000021957774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009718014,0.000023777182,0.00622691,0.00005305617,0.000012693053,0.0000037067184,0.021036599,0.895071,0.0698673,0.0036281215,0.00013668,0.003930387],"study_design_scores_gemma":[0.0007075767,0.000048625854,0.07594886,0.00015178282,0.000045298253,0.0000064588994,0.004665728,0.8582441,0.059132237,0.00017408632,0.00030823462,0.0005670081],"about_ca_topic_score_codex":0.00011164277,"about_ca_topic_score_gemma":0.00014261085,"teacher_disagreement_score":0.69481564,"about_ca_system_score_codex":0.00012985792,"about_ca_system_score_gemma":0.00012533377,"threshold_uncertainty_score":0.5923854},"labels":[],"label_agreement":null},{"id":"W2136708107","doi":"10.1287/trsc.1100.0316","title":"The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Heuristic; Routing (electronic design automation); Mathematical optimization; Computer science; Pickup; Integer programming; Operations research; Linear programming; Material handling; Fixed cost; Integer (computer science); Engineering; Industrial engineering; Mathematics; Economics; Artificial intelligence","score_opus":0.006388144429665132,"score_gpt":0.22850926522083284,"score_spread":0.22212112079116772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136708107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80792886,0.000036399102,0.19107515,0.00006583512,0.00010606487,0.00012156676,0.0000033279402,0.00014410602,0.0005187213],"genre_scores_gemma":[0.8785355,0.000038601098,0.12135842,0.000013183247,0.000013938814,0.000008087142,0.0000026951245,0.000011269769,0.000018302513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992536,0.0000080822765,0.0001554273,0.00015984332,0.00023192546,0.0001911282],"domain_scores_gemma":[0.99957645,0.000079924954,0.000030879193,0.0001256055,0.000112703885,0.000074447715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006985872,0.00008050599,0.00006260693,0.000038748432,0.0004332977,0.00012656926,0.00015036222,0.000027178154,0.0000046955265],"category_scores_gemma":[0.000022854263,0.000058278285,0.0000082134065,0.00042169748,0.00033975445,0.00029426237,0.0000018568431,0.0001580404,0.0000010875966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004225662,0.000018332004,0.07070307,0.00009176637,0.00002431935,0.000008577731,0.0113753285,0.47925156,0.26558477,0.024649732,0.000017032258,0.14823326],"study_design_scores_gemma":[0.0010177599,0.00007407361,0.3636788,0.00009876088,0.000044262117,0.000025835598,0.0010509612,0.5809733,0.04952127,0.00037595967,0.0025334351,0.0006055435],"about_ca_topic_score_codex":0.000019407627,"about_ca_topic_score_gemma":0.00066896726,"teacher_disagreement_score":0.29297575,"about_ca_system_score_codex":0.000015256587,"about_ca_system_score_gemma":0.000055610035,"threshold_uncertainty_score":0.33326194},"labels":[],"label_agreement":null},{"id":"W2136863244","doi":"10.1057/jors.2009.86","title":"An ant colony optimization metaheuristic for single-path multicommodity network flow problems","year":2009,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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":"University of Windsor","funders":"","keywords":"Metaheuristic; Ant colony optimization algorithms; Mathematical optimization; Multi-commodity flow problem; Computer science; Path (computing); Flow network; Ant colony; Node (physics); Minimum-cost flow problem; Parallel metaheuristic; Optimization problem; Flow (mathematics); Mathematics; Computer network; Engineering","score_opus":0.07605495017992003,"score_gpt":0.36306116388250936,"score_spread":0.28700621370258933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136863244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008507897,0.00025468794,0.98832005,0.0017423523,0.0003971191,0.0005704426,0.000019118817,0.00003857134,0.0001497867],"genre_scores_gemma":[0.33103496,0.00008829507,0.6678525,0.00016237504,0.0007527369,0.000011413552,0.000013492505,0.000023628658,0.000060571077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977713,0.00047362558,0.00048013564,0.00012594451,0.0008033081,0.00034565313],"domain_scores_gemma":[0.99762577,0.0005863912,0.00011309089,0.0002195499,0.0013215826,0.00013361035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054551335,0.000121891244,0.00021088946,0.00004136789,0.00057528116,0.00023590637,0.0004381284,0.00010863183,0.000027463426],"category_scores_gemma":[0.0010346383,0.00008894068,0.00022010197,0.0004296013,0.000072151095,0.00040440063,0.00002943748,0.00054654764,8.635269e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020706279,0.000107863416,0.00006505529,0.00001973329,0.00005037926,4.6132058e-7,0.00034072498,0.982503,0.006650887,0.00020147156,0.009118034,0.00092169846],"study_design_scores_gemma":[0.00052388053,0.00025265923,0.00046924152,0.000057589827,0.000022138207,0.000017480192,0.00004397401,0.99621606,0.0006683555,0.0006630126,0.00096893386,0.00009668642],"about_ca_topic_score_codex":0.0000013490314,"about_ca_topic_score_gemma":0.0000011346144,"teacher_disagreement_score":0.32252708,"about_ca_system_score_codex":0.000346811,"about_ca_system_score_gemma":0.00019454137,"threshold_uncertainty_score":0.44246557},"labels":[],"label_agreement":null},{"id":"W2136871443","doi":"10.1287/trsc.1060.0188","title":"A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":426,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Stockout; Integer programming; Operations research; Vendor; Time horizon; Purchasing; Computer science; Economic order quantity; Linear programming; Set (abstract data type); Order (exchange); Vendor-managed inventory; Routing (electronic design automation); Branch and cut; Supply chain; Vehicle routing problem; Product (mathematics); Supply chain management; Mathematics; Operations management; Economics; Business","score_opus":0.02032142200990912,"score_gpt":0.2890078836574357,"score_spread":0.2686864616475266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136871443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13245787,0.00003404282,0.8662319,0.000025804871,0.00013936665,0.00028732332,0.000007614211,0.0002675178,0.00054856803],"genre_scores_gemma":[0.6410026,0.000005742243,0.35885453,0.000034691922,0.000028188866,0.000015501573,0.0000065644676,0.000015712407,0.000036473924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886274,0.000009434393,0.0002996196,0.00023845668,0.00025873358,0.00033102487],"domain_scores_gemma":[0.9995298,0.000089885856,0.000052295603,0.000112864094,0.000105339815,0.00010984676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009491,0.00010413502,0.00011384508,0.00017872415,0.00019622494,0.000051173098,0.00014871267,0.00003984186,0.000006410761],"category_scores_gemma":[0.00004412441,0.00011428561,0.000032021508,0.00072327396,0.00012980665,0.00035446754,0.0000027346564,0.00008608729,0.0000024254775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019901574,0.0000399215,0.0100230165,0.00027908955,0.000030803534,0.000008822553,0.012903701,0.15053801,0.04697737,0.0088030305,0.0000505317,0.7703258],"study_design_scores_gemma":[0.00089059985,0.000036951908,0.03891905,0.000059053997,0.000027221886,0.0000038578337,0.00030341928,0.93320256,0.024643095,0.0008615832,0.0007227837,0.00032983697],"about_ca_topic_score_codex":0.000008994615,"about_ca_topic_score_gemma":0.000030002977,"teacher_disagreement_score":0.78266454,"about_ca_system_score_codex":0.0000484565,"about_ca_system_score_gemma":0.000033120472,"threshold_uncertainty_score":0.4660432},"labels":[],"label_agreement":null},{"id":"W2137507954","doi":"10.1139/x08-017","title":"RuttOpt — a decision support system for routing of logging trucks","year":2008,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Truck; Gantt chart; Computer science; Scheduling (production processes); Logging; Decision support system; Schedule; Database; Range (aeronautics); Vehicle routing problem; Time horizon; Information system; Operations research; Routing (electronic design automation); Data mining; Engineering; Mathematical optimization; Operations management; Systems engineering; Geography; Mathematics","score_opus":0.06825843467581155,"score_gpt":0.33914817182682394,"score_spread":0.2708897371510124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137507954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7737863,0.00026197353,0.22337365,0.000048063688,0.000415466,0.00021323015,0.000016553622,0.000020820311,0.0018639313],"genre_scores_gemma":[0.9355492,0.000016448226,0.06414006,0.0000034852558,0.00017315288,0.0000039080064,0.0000017552246,0.000039674585,0.0000723263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816793,0.0001099206,0.00061994244,0.00010155578,0.0004269484,0.0005736782],"domain_scores_gemma":[0.9976928,0.0006437305,0.000112338384,0.00019843421,0.0008012226,0.00055144366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035123646,0.00010048986,0.00029206995,0.0009299618,0.00026139588,0.00003868112,0.00037326946,0.00010684353,0.000031009768],"category_scores_gemma":[0.0012080899,0.00009906545,0.00012140361,0.00046976036,0.00011497926,0.0001484719,0.000014431588,0.0004121137,0.000004187525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008668166,0.000014044593,0.2103247,0.0006421811,0.00013037048,0.00065220805,0.0027773778,0.75247246,0.0011810277,0.0022790956,0.0071160085,0.022323813],"study_design_scores_gemma":[0.0071941456,0.0017434589,0.14845748,0.0037176132,0.00009870548,0.0073765097,0.0048926347,0.77845454,0.027513651,0.0016484553,0.017727721,0.0011751011],"about_ca_topic_score_codex":0.00055084494,"about_ca_topic_score_gemma":0.001963205,"teacher_disagreement_score":0.16176288,"about_ca_system_score_codex":0.00048325522,"about_ca_system_score_gemma":0.0012153893,"threshold_uncertainty_score":0.4039772},"labels":[],"label_agreement":null},{"id":"W2137944694","doi":"10.1023/a:1009679511137","title":"Tabu Search for a Network Loading Problem with Multiple Facilities","year":2000,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"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; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Computer science; Vertex (graph theory); Mathematical optimization; Network planning and design; Heuristic; Computer network; Mathematics; Algorithm; Theoretical computer science; Graph","score_opus":0.019457902165281662,"score_gpt":0.25524968761737876,"score_spread":0.2357917854520971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137944694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095528066,0.00036025431,0.90196747,0.000051976593,0.0001547401,0.00017418334,0.000020542624,0.00007130461,0.0016714656],"genre_scores_gemma":[0.3353161,0.000115965435,0.66331947,0.00001677929,0.00039207508,0.0000031581512,0.0000019070408,0.00003903367,0.00079551706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910504,0.000039883187,0.00035193245,0.000060960123,0.00018745223,0.0002547219],"domain_scores_gemma":[0.9992327,0.00034395987,0.00006309909,0.00008805638,0.0001892896,0.00008291441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603685,0.00010275483,0.00020597862,0.00005409514,0.00007718257,0.000048818274,0.00011279337,0.000048040176,0.00008147787],"category_scores_gemma":[0.00007159136,0.00008640017,0.000052117543,0.00014071034,0.00002603473,0.00009038774,0.000006161064,0.00021911915,0.0000038639887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000606738,0.000010345004,0.0027513502,0.00010702029,0.000045602188,0.000008708845,0.00034690675,0.98641855,0.000069991416,0.000051934938,0.0017574308,0.00837148],"study_design_scores_gemma":[0.0011778277,0.00028273335,0.0005017794,0.00019717346,0.00004891652,0.0001586662,0.00016563546,0.94742316,0.0007955838,0.00024913586,0.048781425,0.00021797813],"about_ca_topic_score_codex":0.0000019948666,"about_ca_topic_score_gemma":0.0000017690859,"teacher_disagreement_score":0.23978803,"about_ca_system_score_codex":0.000054240885,"about_ca_system_score_gemma":0.00004004395,"threshold_uncertainty_score":0.35232967},"labels":[],"label_agreement":null},{"id":"W2138023714","doi":"10.1057/jors.2010.53","title":"Cost allocation in the establishment of a collaborative transportation agreement—an application in the furniture industry","year":2010,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","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":true,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Purchasing; Supply chain; Cost reduction; Business; Computer science; Key (lock); Operations research; Operations management; Marketing; Economics; Engineering; Computer security","score_opus":0.049066076679056714,"score_gpt":0.3867948432864896,"score_spread":0.3377287666074329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138023714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982916,0.000053053907,0.008439047,0.0074005364,0.00010695854,0.00085192226,0.000019567324,0.0000037640436,0.00020917949],"genre_scores_gemma":[0.991176,0.000056592016,0.008336719,0.00017965614,0.00013931039,0.00007079076,0.00001909891,0.000008083345,0.000013730397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9975534,0.00069203007,0.00044216705,0.0000815289,0.0010851356,0.00014570415],"domain_scores_gemma":[0.9983985,0.00046453724,0.00012638875,0.00022047185,0.00076036964,0.00002974408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0089291325,0.00007503606,0.00010137064,0.000069810485,0.00015882864,0.00010003657,0.0005880308,0.00015444173,0.000020794947],"category_scores_gemma":[0.00033623344,0.000041476087,0.00006042857,0.0011670819,0.000101314436,0.0003828407,0.000009751656,0.0018131819,5.766628e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003314249,0.00027732327,0.013863362,0.000036164645,0.0000384683,0.0000010205288,0.04464396,0.8834912,0.047451787,0.003975394,0.0031507902,0.0030373398],"study_design_scores_gemma":[0.0020296352,0.00018949431,0.5331377,0.00013407343,0.000033722437,0.000021085354,0.068347774,0.3779595,0.010777203,0.0016507914,0.0054953843,0.00022367497],"about_ca_topic_score_codex":0.00004303761,"about_ca_topic_score_gemma":0.00058724236,"teacher_disagreement_score":0.5192743,"about_ca_system_score_codex":0.00012877762,"about_ca_system_score_gemma":0.00029968272,"threshold_uncertainty_score":0.7877474},"labels":[],"label_agreement":null},{"id":"W2138596841","doi":"10.1287/trsc.1100.0328","title":"European Driver Rules in Vehicle Routing with Time Windows","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tabu search; Vehicle routing problem; Heuristics; Column generation; Computer science; Task (project management); Routing (electronic design automation); Heuristic; Mathematical optimization; Operations research; Algorithm; Engineering; Artificial intelligence; Mathematics; Embedded system","score_opus":0.009295564871308826,"score_gpt":0.23761108514239387,"score_spread":0.22831552027108504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138596841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9597995,0.0000023636683,0.03370975,0.000027421449,0.00008078614,0.00009248776,0.0000037184482,0.00024227798,0.006041655],"genre_scores_gemma":[0.9263962,0.0000010026769,0.07348745,0.000022602866,0.000018777131,0.0000025599038,0.000005736511,0.000020110556,0.00004558618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9990824,0.000023383109,0.00019903615,0.00020219952,0.00026316242,0.00022986019],"domain_scores_gemma":[0.99963045,0.000036007572,0.000032883334,0.00016381724,0.00006389544,0.00007295631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285805,0.00009150301,0.00008542114,0.0001428222,0.00008874455,0.000053412874,0.0002229821,0.000023575345,0.00007691323],"category_scores_gemma":[0.00002926317,0.00008656265,0.000013565064,0.0007338507,0.00016171458,0.00046444562,0.0000027047488,0.00019297747,0.00008686992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056871777,0.000015795704,0.08090855,0.000010524855,0.0000025705401,0.00001614465,0.0031524468,0.540055,0.3672904,0.00081982766,0.0000058813025,0.007717158],"study_design_scores_gemma":[0.0003194282,0.000009748991,0.69835097,0.000018807894,0.0000037166612,0.0000017700894,0.0000467257,0.28961924,0.011367307,0.00002099158,0.00009025998,0.00015103645],"about_ca_topic_score_codex":0.00001082504,"about_ca_topic_score_gemma":0.00006684564,"teacher_disagreement_score":0.6174424,"about_ca_system_score_codex":0.000019048464,"about_ca_system_score_gemma":0.00003521822,"threshold_uncertainty_score":0.35299224},"labels":[],"label_agreement":null},{"id":"W2139434864","doi":"10.1287/trsc.1060.0172","title":"An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry","year":2007,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Bidding; Schedule; Crew; Column generation; Operations research; Order (exchange); Computer science; Aircrew; Seniority; Quality (philosophy); Work (physics); Mathematical optimization; Engineering; Business; Mathematics; Finance; Marketing; Aeronautics","score_opus":0.041561768691632965,"score_gpt":0.31415356704378317,"score_spread":0.2725917983521502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139434864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19355036,0.00001354513,0.8053521,0.000024054258,0.00009672836,0.00044634254,0.000005184499,0.00012240792,0.00038929438],"genre_scores_gemma":[0.88235986,0.0000013314282,0.117490575,0.0000142939125,0.000055903907,0.00004499298,0.000018448796,0.000010144616,0.00000446133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989038,0.00003396454,0.0002905249,0.000183864,0.00032881816,0.0002589903],"domain_scores_gemma":[0.9995188,0.00012265133,0.00005101452,0.0001931747,0.00007547254,0.000038879352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045379493,0.000084648214,0.000073382755,0.00012112244,0.00024125686,0.00007244895,0.00037916284,0.00008126331,0.0000026893763],"category_scores_gemma":[0.000019643965,0.000056294546,0.000023362847,0.0009839255,0.00008718408,0.00038370016,0.000001426194,0.00021567143,4.7418652e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007703509,0.000015980055,0.0020209448,0.000049837618,0.0000020752536,2.2683874e-7,0.0024865249,0.98362,0.0052536214,0.0018695928,0.000003947781,0.0046695424],"study_design_scores_gemma":[0.00020293368,0.000014954351,0.08280534,0.000016587708,0.000011755445,0.0000015209213,0.0020127867,0.91229755,0.0025166364,0.00001165967,0.000028456334,0.00007981616],"about_ca_topic_score_codex":0.000023741299,"about_ca_topic_score_gemma":0.00004301032,"teacher_disagreement_score":0.68880945,"about_ca_system_score_codex":0.00006994383,"about_ca_system_score_gemma":0.00003817307,"threshold_uncertainty_score":0.2295625},"labels":[],"label_agreement":null},{"id":"W2141089842","doi":"10.1016/j.trc.2014.08.007","title":"The time-dependent vehicle routing problem with soft time windows and stochastic travel times","year":2014,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":117,"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":"Vehicle routing problem; Tabu search; Metaheuristic; Computer science; Mathematical optimization; Reliability (semiconductor); Service (business); Routing (electronic design automation); Service quality; Algorithm; Mathematics; Computer network","score_opus":0.019140656369509616,"score_gpt":0.28264868442206814,"score_spread":0.2635080280525585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141089842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24023496,0.0007440837,0.7416719,0.0046948744,0.00009929886,0.0019784814,0.000032968168,0.0081744585,0.0023689875],"genre_scores_gemma":[0.9805218,0.000089868256,0.018347492,0.0000070180854,0.00002787285,0.00017810111,0.000018606335,0.000076698285,0.0007325249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788857,0.00015225966,0.00037218007,0.00034663844,0.0005875622,0.00065281073],"domain_scores_gemma":[0.998543,0.00075389375,0.000064528635,0.00038736084,0.00018792771,0.00006324199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021360656,0.0002180539,0.00023028666,0.00022066187,0.00064809865,0.00013291463,0.00037242073,0.0001476123,0.000029253732],"category_scores_gemma":[0.0002809887,0.00016562674,0.000031311418,0.00060549064,0.0004246521,0.00018753478,0.000026250005,0.00060463056,0.00005540104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006088295,0.000030777595,0.0015778646,0.000121904755,0.0001228061,0.0000066100056,0.0013387891,0.91048896,0.009341487,0.004216696,0.00091716857,0.07177605],"study_design_scores_gemma":[0.0006912805,0.00016737654,0.0017021693,0.00018081712,0.00003080054,0.00000347637,0.0015985391,0.98531395,0.0064088535,0.0024063122,0.0011191126,0.00037732424],"about_ca_topic_score_codex":0.000018578123,"about_ca_topic_score_gemma":0.000034411743,"teacher_disagreement_score":0.7402869,"about_ca_system_score_codex":0.000046970814,"about_ca_system_score_gemma":0.00003131668,"threshold_uncertainty_score":0.6754062},"labels":[],"label_agreement":null},{"id":"W2141557529","doi":"10.1007/0-387-25036-0_9","title":"Recent Trends in Arc Routing","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"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; Group for Research in Decision Analysis","funders":"","keywords":"Arc routing; Arc (geometry); Traverse; Heuristic; Routing (electronic design automation); Vehicle routing problem; Computer science; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Operations research; Mathematics; Geography; Computer network; Artificial intelligence; Cartography; Geometry","score_opus":0.03149969619143034,"score_gpt":0.27114872171483473,"score_spread":0.2396490255234044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141557529","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074466934,0.00047069322,0.015901424,0.00012285827,0.0002497642,0.00006209767,0.000004519157,0.0005824008,0.9825988],"genre_scores_gemma":[0.00093528436,0.0015230007,0.11412006,0.00010237258,0.00037568383,0.000004773033,0.000057175046,0.00020468584,0.88267696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998899,0.000013588927,0.00043013063,0.00023516333,0.00016528656,0.0002568353],"domain_scores_gemma":[0.9995312,0.000051872146,0.000049989612,0.0002749994,0.000028458786,0.000063489475],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002930557,0.0002832001,0.00031220572,0.00043264456,0.00001847677,0.000026387464,0.00013849385,0.00032681754,0.0062806597],"category_scores_gemma":[0.000018981527,0.0003126133,0.0000736584,0.00008749534,0.00001292548,0.000051761417,0.00003934876,0.00047822786,0.00013129291],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012499395,0.000002821445,0.00001462933,0.0000099939825,0.000020021018,0.0000065271524,0.00007022348,0.20820166,0.000007912955,0.012980561,0.001499939,0.7771845],"study_design_scores_gemma":[0.00029368047,0.000009009924,0.000092914066,0.0001365264,0.000018692299,0.000007802692,0.0000051819297,0.30469835,0.000077350574,0.0004054466,0.69366336,0.00059166],"about_ca_topic_score_codex":0.000003831347,"about_ca_topic_score_gemma":0.00006918867,"teacher_disagreement_score":0.7765928,"about_ca_system_score_codex":0.00032385523,"about_ca_system_score_gemma":0.000011505731,"threshold_uncertainty_score":0.9999326},"labels":[],"label_agreement":null},{"id":"W2141809992","doi":"10.1007/s10732-007-9046-y","title":"Local and variable neighborhood search for the k-cardinality subgraph problem","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Constructive; Heuristics; Variable neighborhood search; Combinatorics; Mathematics; Induced subgraph isomorphism problem; Cardinality (data modeling); Local search (optimization); Metaheuristic; Subgraph isomorphism problem; Heuristic; Graph; Combinatorial optimization; Variable (mathematics); Discrete mathematics; Mathematical optimization; Computer science; Line graph; Data mining","score_opus":0.018834917495229954,"score_gpt":0.2812296731848295,"score_spread":0.2623947556895995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141809992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036863366,0.0007155778,0.994333,0.000097548465,0.00024741184,0.00010959082,0.000005836823,0.00002173844,0.00078293093],"genre_scores_gemma":[0.697496,0.00012971614,0.3021384,0.000029400291,0.00016539417,7.218917e-7,4.5584744e-7,0.000020188709,0.000019756513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912643,0.000040924893,0.00037559625,0.000056168672,0.00019388823,0.00020701323],"domain_scores_gemma":[0.9985199,0.00093039323,0.00007648344,0.00010510055,0.00028027102,0.00008784776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032318642,0.00008231206,0.00016383771,0.00006676513,0.00009022212,0.000043298245,0.00012258525,0.000060077906,0.0000065188565],"category_scores_gemma":[0.00017061112,0.000059546728,0.00005484955,0.00018200981,0.00005221238,0.000057578705,0.000019199233,0.0002739078,3.9989675e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103383325,0.00004413332,0.010659967,0.00028183442,0.0002451445,0.000019288496,0.00035863472,0.93674827,0.00067736197,0.012205065,0.0021564318,0.0365005],"study_design_scores_gemma":[0.0013088861,0.00024338333,0.01284636,0.00008499286,0.00024575295,0.00036274942,0.00043535637,0.9634558,0.0029754878,0.005742514,0.01204155,0.0002571506],"about_ca_topic_score_codex":0.000002550093,"about_ca_topic_score_gemma":6.2693545e-7,"teacher_disagreement_score":0.6938096,"about_ca_system_score_codex":0.00004171747,"about_ca_system_score_gemma":0.000034109074,"threshold_uncertainty_score":0.24282451},"labels":[],"label_agreement":null},{"id":"W2142169698","doi":"10.1287/trsc.2014.0525","title":"Service Network Design with Resource Constraints","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Infrastructure Canada; Compute Canada","keywords":"Column generation; Solver; Benchmark (surveying); Heuristic; Network planning and design; Computer science; Service (business); Consolidation (business); Quality of service; Operations research; Mathematical optimization; Computer network; Engineering; Business; Artificial intelligence; Mathematics","score_opus":0.021099234204862673,"score_gpt":0.2463486574531667,"score_spread":0.22524942324830402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142169698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04155078,0.0000064071046,0.95540446,0.00006724775,0.0000588303,0.00010549353,0.0000013573793,0.0003235554,0.0024818368],"genre_scores_gemma":[0.63295984,9.921453e-7,0.36681828,0.00016922732,0.000022518774,0.0000048796132,0.0000032347402,0.000011540245,0.000009492124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990802,0.00003781524,0.00015879907,0.00018234095,0.00029455134,0.00024630246],"domain_scores_gemma":[0.9994856,0.0001077049,0.000032610747,0.00016903848,0.00011137087,0.00009367211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146005,0.000089129986,0.00008882144,0.00005725257,0.0001361982,0.000043680062,0.000201533,0.000027949582,0.000042516785],"category_scores_gemma":[0.0000217092,0.000082549675,0.0000097574375,0.001210272,0.00019626938,0.00021892553,0.0000012458408,0.00007757734,0.000016337168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004251299,0.0000020214013,0.0007648841,0.00000951937,0.0000019426575,5.756354e-7,0.00045758218,0.9915117,0.001043911,0.00085599755,0.000043896805,0.005303719],"study_design_scores_gemma":[0.0003341243,0.000030671312,0.026317636,0.000042972017,0.00001309605,0.0000036156362,0.00010971234,0.9675389,0.004051827,0.00016056889,0.0011844,0.00021245716],"about_ca_topic_score_codex":0.0000036487097,"about_ca_topic_score_gemma":0.000016256365,"teacher_disagreement_score":0.591409,"about_ca_system_score_codex":0.000019305227,"about_ca_system_score_gemma":0.000044122313,"threshold_uncertainty_score":0.3366278},"labels":[],"label_agreement":null},{"id":"W2143046423","doi":"10.1007/s00291-013-0348-1","title":"Self-imposed time windows in vehicle routing problems","year":2013,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":75,"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":"Vehicle routing problem; Benchmark (surveying); Heuristic; Computer science; Tabu search; Mathematical optimization; Routing (electronic design automation); Order (exchange); Operations research; Mathematics; Economics","score_opus":0.009466649504264044,"score_gpt":0.22174500512405423,"score_spread":0.2122783556197902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143046423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247241,0.0001391636,0.017200828,0.0013083658,0.00046774154,0.00155222,0.0000043072882,0.003520705,0.051082555],"genre_scores_gemma":[0.93420714,0.000018157554,0.064338334,0.00006297517,0.00012359065,0.000048297265,0.000004145984,0.000088414374,0.0011089224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877745,0.00006916515,0.00032688977,0.00020945177,0.00014474953,0.00047228436],"domain_scores_gemma":[0.99950796,0.00008879834,0.00004196269,0.0002565805,0.000016954824,0.000087754954],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033010144,0.00017496945,0.00021277547,0.00012558437,0.000049846814,0.000090783935,0.00018442853,0.000101690355,0.0010692636],"category_scores_gemma":[0.000056058496,0.0001653122,0.00003856031,0.00048816716,0.000012888863,0.00025342777,0.000040782674,0.0002427865,0.0010438159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017682652,0.00017606502,0.028303223,0.0002513658,0.00010543607,0.000041027815,0.003063238,0.8927053,0.061067287,0.00067620695,0.0018481882,0.011744949],"study_design_scores_gemma":[0.0005865949,0.000034006014,0.0073661394,0.000039673025,0.000005794014,0.000009719727,0.000028611645,0.9846748,0.005934264,0.00023820643,0.00082552864,0.00025662087],"about_ca_topic_score_codex":0.000059032776,"about_ca_topic_score_gemma":0.000026230648,"teacher_disagreement_score":0.09196951,"about_ca_system_score_codex":0.000161223,"about_ca_system_score_gemma":0.000023567378,"threshold_uncertainty_score":0.9998439},"labels":[],"label_agreement":null},{"id":"W2143105265","doi":"10.1287/inte.2013.0683","title":"Mathematical Programming Guides Air-Ambulance Routing at Ornge","year":2013,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"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":"Operations research; Work (physics); Computer science; Fixed wing; Routing (electronic design automation); Route planning; Air traffic control; Range (aeronautics); Vehicle routing problem; Operations management; Aeronautics; Transport engineering; Engineering; Computer network; Wing","score_opus":0.018716778310650772,"score_gpt":0.2584463641114855,"score_spread":0.23972958580083475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143105265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14036748,0.00004992605,0.7765049,0.0002687064,0.00031325134,0.00055898086,0.0000028665133,0.0008092486,0.08112467],"genre_scores_gemma":[0.7071429,0.000036093406,0.2917576,0.00032401364,0.00024787307,0.00001867343,0.0000043480654,0.00007081184,0.00039768865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801695,0.000012615754,0.00082786684,0.00013576461,0.00045894366,0.0005478344],"domain_scores_gemma":[0.9989616,0.00015134354,0.0002130922,0.00027939098,0.00012684669,0.00026771874],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068813027,0.00027067467,0.00034793172,0.00018022172,0.00022600588,0.00026013228,0.00028527607,0.00014346771,0.00033761474],"category_scores_gemma":[0.00014190699,0.00021590464,0.00011823825,0.00034998666,0.0000491503,0.00025335117,0.00006981069,0.0005638633,0.0008009752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011537371,0.00004344305,0.0006149996,0.00010986225,0.000159428,0.000017524944,0.0005007044,0.87653273,0.0006182332,0.008805739,0.0025214688,0.110064335],"study_design_scores_gemma":[0.0005990777,0.00004829286,0.00046493637,0.0001274814,0.000042911503,0.00022702287,0.00025411142,0.9857957,0.0017596948,0.0021764734,0.0080265105,0.0004778169],"about_ca_topic_score_codex":8.326854e-7,"about_ca_topic_score_gemma":4.7884936e-7,"teacher_disagreement_score":0.5667754,"about_ca_system_score_codex":0.00032365505,"about_ca_system_score_gemma":0.000025065076,"threshold_uncertainty_score":0.999977},"labels":[],"label_agreement":null},{"id":"W2143519380","doi":"","title":"Evolutionary Algorithms for Vehicle Routing","year":2007,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"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; Benchmark (surveying); Evolutionary algorithm; Computer science; Particle swarm optimization; Routing (electronic design automation); Mathematical optimization; Evolutionary computation; Metaheuristic; Algorithm; Artificial intelligence; Mathematics; Geography","score_opus":0.025214133791604403,"score_gpt":0.29275019287515,"score_spread":0.26753605908354555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143519380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009802325,0.00007530466,0.97412044,0.000045057906,0.00032119337,0.00015043639,0.0000032180653,0.00081401726,0.014668007],"genre_scores_gemma":[0.3518659,0.000002656741,0.6473487,0.00005605625,0.00017603012,0.0000069664757,0.000006529632,0.000030675386,0.00050649774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992815,0.00000996201,0.00020814569,0.00011499154,0.000092864415,0.00029249312],"domain_scores_gemma":[0.99951994,0.00022115187,0.000016317643,0.00012063737,0.000057678753,0.00006424412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070013176,0.00008714193,0.000087435554,0.00006302797,0.00008084536,0.000015064407,0.0000807907,0.00006766886,0.000054807726],"category_scores_gemma":[0.00009113691,0.00009283823,0.000045890203,0.00018111477,0.000012774555,0.00009411095,0.000015331783,0.00007134251,0.000021199136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020477957,0.000043497836,0.005767264,0.00008045864,0.00007196099,0.00000500305,0.00040488996,0.7303288,0.014510857,0.013118609,0.007095215,0.22855297],"study_design_scores_gemma":[0.00027434618,0.0000125724855,0.0037725663,0.0000060235375,0.0000054644074,0.000004037292,0.00007929581,0.9839242,0.0075579025,0.00025397362,0.00397039,0.0001392448],"about_ca_topic_score_codex":0.000004368344,"about_ca_topic_score_gemma":0.0000019488714,"teacher_disagreement_score":0.34206355,"about_ca_system_score_codex":0.000074896554,"about_ca_system_score_gemma":0.000008116871,"threshold_uncertainty_score":0.3785833},"labels":[],"label_agreement":null},{"id":"W2144303296","doi":"10.1287/ijoc.1090.0341","title":"Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada); HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematical optimization; Computer science; Speedup; Constrained Shortest Path First; Shortest path problem; Vehicle routing problem; Path (computing); Scheduling (production processes); Routing (electronic design automation); Context (archaeology); Longest path problem; K shortest path routing; Mathematics; Parallel computing; Theoretical computer science; Computer network","score_opus":0.017409394862990268,"score_gpt":0.28754947685326876,"score_spread":0.2701400819902785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144303296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6708685,0.00008266129,0.32745132,0.0001207754,0.00028092758,0.00014597594,6.3242044e-7,0.00013762433,0.00091157196],"genre_scores_gemma":[0.74511606,0.000018507482,0.25441232,0.00019047683,0.00023311378,9.053419e-7,0.0000014222524,0.0000235082,0.0000036968408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984056,0.000035582278,0.00072903844,0.00014423112,0.00019683107,0.0004887187],"domain_scores_gemma":[0.9990184,0.00045407194,0.00019758649,0.00009996239,0.00010106321,0.0001289735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019430835,0.00020497084,0.0002745479,0.00029210653,0.00026600648,0.00024903065,0.00014834211,0.00010056272,0.0000015338089],"category_scores_gemma":[0.0007896409,0.00019879639,0.00006543333,0.00028410665,0.000012859774,0.00034903546,0.000027775257,0.00061416026,0.0000015919421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010681246,0.000008307702,0.0007764203,0.00002334896,0.000007753692,0.000006574739,0.00070421904,0.62083167,0.0010141624,0.00046069722,0.0000075138078,0.37614864],"study_design_scores_gemma":[0.00094527507,0.00011954637,0.004827637,0.00067674334,0.0000057647976,0.00012894775,0.0003549078,0.9910816,0.0013113713,0.00026558823,0.000040210634,0.00024243012],"about_ca_topic_score_codex":0.0000011169986,"about_ca_topic_score_gemma":3.8019417e-7,"teacher_disagreement_score":0.3759062,"about_ca_system_score_codex":0.00022926374,"about_ca_system_score_gemma":0.00002896919,"threshold_uncertainty_score":0.8106682},"labels":[],"label_agreement":null},{"id":"W2145366356","doi":"","title":"A multi-objective hub covering location problem under congestion using simulated annealing algorithm","year":2013,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Mathematical optimization; Computer science; Metric (unit); Integer programming; Algorithm; Operations research; Mathematics; Operations management; Engineering","score_opus":0.021455756965323494,"score_gpt":0.26936220426759827,"score_spread":0.2479064473022748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145366356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02504105,0.00013073512,0.9717441,0.0000938584,0.00026826237,0.001492844,0.0000058220803,0.0007228152,0.00050047063],"genre_scores_gemma":[0.48304445,0.000034935834,0.516347,0.000094592375,0.000058946684,0.000051258976,0.00005374051,0.000075539545,0.00023958595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982085,0.00015231433,0.00044513115,0.00040836213,0.00029099613,0.0004946863],"domain_scores_gemma":[0.9991609,0.00010125044,0.00009932017,0.00031712244,0.00021714927,0.00010424389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005475926,0.00031349267,0.0002459774,0.00031184475,0.00017860596,0.00016712215,0.00018401747,0.00012760723,0.000107120555],"category_scores_gemma":[0.000030790834,0.00035541807,0.000053841944,0.00074389105,0.000039506987,0.00035946345,0.000093520066,0.0001983939,0.00004971813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003077277,0.000028025393,0.00032763113,0.00015862077,0.00012695737,0.0000049820737,0.000529371,0.974592,0.0009000466,0.00014507642,0.00006578083,0.023118488],"study_design_scores_gemma":[0.0008590354,0.000019812871,0.0018706556,0.00018318296,0.00004996596,0.0000030507929,0.0010576093,0.99467844,0.00043164403,0.00031037952,0.00014418254,0.00039202205],"about_ca_topic_score_codex":0.00043387956,"about_ca_topic_score_gemma":0.0000072441403,"teacher_disagreement_score":0.45800337,"about_ca_system_score_codex":0.00067328144,"about_ca_system_score_gemma":0.000017303488,"threshold_uncertainty_score":0.9998898},"labels":[],"label_agreement":null},{"id":"W2145935606","doi":"10.48550/arxiv.1406.0941","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"Travelling salesman problem; Computer science; Message passing; 2-opt; Cutting-plane method; Mathematical optimization; Optimization problem; Graph; Combinatorial optimization; Graph partition; Context (archaeology); Theoretical computer science; Bottleneck traveling salesman problem; Mathematics; Algorithm; Integer programming; Parallel computing","score_opus":0.045906100470516735,"score_gpt":0.19448794099779942,"score_spread":0.14858184052728268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145935606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23028098,0.000012113272,0.767456,0.000013536247,0.000050480627,0.0001276811,0.0000033892268,0.00019625966,0.001859544],"genre_scores_gemma":[0.93749964,0.000021451015,0.0622932,0.000021478329,0.000029752144,0.0000015986204,0.0000077732575,0.000025845524,0.00009927064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993474,0.00007038481,0.00011485525,0.0002327664,0.000027778933,0.00020684378],"domain_scores_gemma":[0.9995515,0.00017599713,0.000043409134,0.000110753936,0.000041954932,0.00007639504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031362206,0.00011894443,0.00013131101,0.0000786575,0.0001945118,0.0000405909,0.00007649889,0.000057469417,0.000009760581],"category_scores_gemma":[0.000030246827,0.00014758503,0.000042716452,0.00023696851,0.000052111816,0.00021266499,0.000021076414,0.00008805986,0.000002644772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009222945,0.000007939241,0.0025736818,0.00006804014,0.00003750775,0.0000023972557,0.0003381615,0.9447283,0.000943612,0.04962218,0.00002809056,0.0016408298],"study_design_scores_gemma":[0.0006841544,0.00003015299,0.0008909305,0.000051559975,0.00005197663,0.0000016685499,0.0002618489,0.98180157,0.0015060954,0.014363131,0.00015570717,0.00020119653],"about_ca_topic_score_codex":0.00000465133,"about_ca_topic_score_gemma":0.000008117472,"teacher_disagreement_score":0.70721865,"about_ca_system_score_codex":0.000045758694,"about_ca_system_score_gemma":0.0000070487336,"threshold_uncertainty_score":0.60183424},"labels":[],"label_agreement":null},{"id":"W2146004814","doi":"10.1016/j.cor.2012.04.007","title":"An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":506,"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; HEC Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Vehicle routing problem; Heuristic; Computer science; Context (archaeology); Routing (electronic design automation); Mathematical optimization; Scheme (mathematics); Local search (optimization); Operations research; Mathematics; Algorithm; Artificial intelligence; Computer network","score_opus":0.13790653681425669,"score_gpt":0.4106109157336956,"score_spread":0.27270437891943894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146004814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08073785,0.00015381692,0.9171859,0.00008696344,0.00025560235,0.0009390454,0.000029678195,0.00022368642,0.00038746698],"genre_scores_gemma":[0.78703755,0.000010193525,0.21239725,0.00002266471,0.0002913105,0.000096605654,0.000060596198,0.000058625796,0.00002520809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967758,0.0007623157,0.0004546292,0.0003579623,0.00045302548,0.0011962571],"domain_scores_gemma":[0.9979612,0.00081024854,0.000016761309,0.00044679316,0.00050099567,0.00026400253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005336909,0.00020043457,0.00025677393,0.00045125853,0.0006191744,0.00033291677,0.00040455585,0.00013759093,0.000019724388],"category_scores_gemma":[0.00049320364,0.0002246528,0.00004742201,0.0010785974,0.000086630054,0.0005865743,0.0001635103,0.00082373386,0.000019648438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012616186,0.00018609955,0.004961028,0.000048186397,0.000018188266,0.0000018044527,0.0027916282,0.9776144,0.0018650909,0.006767613,0.0000601808,0.005673167],"study_design_scores_gemma":[0.000775975,0.00012590521,0.0025552036,0.00007293684,0.0000059722556,0.000003625648,0.0005354655,0.9942925,0.0012317819,0.00011546076,0.000048497164,0.00023669832],"about_ca_topic_score_codex":0.00013758538,"about_ca_topic_score_gemma":0.00012585522,"teacher_disagreement_score":0.7062997,"about_ca_system_score_codex":0.00046210422,"about_ca_system_score_gemma":0.00012616781,"threshold_uncertainty_score":0.91610754},"labels":[],"label_agreement":null},{"id":"W2147424049","doi":"10.1016/j.cor.2009.02.017","title":"An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":196,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Pickup; Computer science; Ant colony optimization algorithms; Benchmark (surveying); Mathematical optimization; Ant colony; Routing (electronic design automation); Backhaul (telecommunications); Combinatorial optimization; Algorithm; Artificial intelligence; Mathematics; Computer network","score_opus":0.03016327053796509,"score_gpt":0.3280864310040777,"score_spread":0.2979231604661126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147424049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38678613,0.00008303883,0.61166036,0.00014672913,0.000047140806,0.0007726507,0.000007956422,0.00033507138,0.00016091081],"genre_scores_gemma":[0.700743,0.000009904606,0.29901463,0.000026059199,0.000084950414,0.000040626597,0.000017073406,0.000026133575,0.000037604215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850005,0.00022608814,0.00025079102,0.00031696385,0.00026932242,0.00043676043],"domain_scores_gemma":[0.9985937,0.00045672795,0.000012383464,0.00029147678,0.0004893797,0.00015632945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101688,0.00014470247,0.00018555374,0.00019252807,0.0006185542,0.00042744438,0.00022452112,0.00007948201,0.0000018456981],"category_scores_gemma":[0.0000664725,0.00013702725,0.000018914692,0.00043604508,0.00006120745,0.00027610915,0.00003587833,0.0002537264,0.000004443996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022196982,0.0000316518,0.0000872303,0.000064004016,0.000017344342,0.000011874316,0.00080044713,0.971566,0.0064837458,0.0011931524,0.00009674091,0.019625606],"study_design_scores_gemma":[0.0005419215,0.000493776,0.00019245679,0.00010951341,0.0000077405775,0.000028398506,0.00035572154,0.9966338,0.0013276759,0.000008067077,0.00013207633,0.00016885022],"about_ca_topic_score_codex":0.000033539178,"about_ca_topic_score_gemma":0.000033660945,"teacher_disagreement_score":0.31395686,"about_ca_system_score_codex":0.00019577779,"about_ca_system_score_gemma":0.00007839728,"threshold_uncertainty_score":0.5587809},"labels":[],"label_agreement":null},{"id":"W2148767145","doi":"10.1287/trsc.2014.0535","title":"Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO and LIFO accounting; Pickup; Vehicle routing problem; Mathematical optimization; Computation; Column generation; Computer science; Algorithm; Path (computing); Dynamic programming; Shortest path problem; Mathematics; Routing (electronic design automation); FIFO (computing and electronics); Theoretical computer science","score_opus":0.014906122694752602,"score_gpt":0.24406077677824442,"score_spread":0.2291546540834918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148767145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39116237,0.00008640556,0.60808665,0.00010996664,0.00003371012,0.00029841275,0.000003860494,0.000065946675,0.00015268051],"genre_scores_gemma":[0.88758844,0.0000499623,0.11224098,0.00003736855,0.000015248302,0.00002597643,0.0000018081948,0.0000131122815,0.000027101612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992594,0.000012009368,0.00016014637,0.00022042631,0.00015876097,0.00018924334],"domain_scores_gemma":[0.99948776,0.00026959903,0.000034815912,0.0000902089,0.000055682525,0.00006194815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083268556,0.0000961113,0.000109791676,0.00008680921,0.00018508526,0.00007559529,0.00009030478,0.000028157696,0.0000035814028],"category_scores_gemma":[0.00002441888,0.00007311183,0.000008662669,0.00028831765,0.00019091745,0.0003434523,0.0000033949366,0.000066925335,0.0000010415864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041039915,0.00001540123,0.054431483,0.00026063726,0.000020544894,0.0000013904003,0.014407692,0.85287744,0.01271941,0.0013311676,0.000015666188,0.06387813],"study_design_scores_gemma":[0.0007036667,0.00004452709,0.115545966,0.000055509376,0.000018887207,0.0000034779455,0.00008499829,0.88123393,0.0017354599,0.00015717928,0.00026661763,0.00014977554],"about_ca_topic_score_codex":0.0000144471605,"about_ca_topic_score_gemma":0.00014821022,"teacher_disagreement_score":0.49642608,"about_ca_system_score_codex":0.000014818438,"about_ca_system_score_gemma":0.00001964832,"threshold_uncertainty_score":0.29814136},"labels":[],"label_agreement":null},{"id":"W2149852331","doi":"10.1287/inte.1040.0113","title":"Bombardier Flexjet Significantly Improves Its Fractional Aircraft Ownership Operations","year":2005,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","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; HEC Montréal","funders":"","keywords":"Crew; Charter; Engineering; Aeronautics; Operations research; Service (business); Operations management; Business; Marketing","score_opus":0.022731258156740753,"score_gpt":0.2711719378261229,"score_spread":0.24844067966938216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149852331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04079449,0.00014592527,0.8618012,0.0016965823,0.0010371992,0.00049617165,0.000051229406,0.00082737074,0.093149826],"genre_scores_gemma":[0.918729,0.0001547726,0.077395685,0.0011205006,0.0011348776,0.00001270764,0.000025932588,0.00006991825,0.0013565762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826175,0.000017209575,0.0006814363,0.00014683997,0.00048868585,0.00040406297],"domain_scores_gemma":[0.9991062,0.00010556993,0.00010507159,0.00021855027,0.00018725973,0.0002773107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062204036,0.0002625968,0.00026810408,0.0003218505,0.00028292663,0.000304576,0.00024645118,0.00016971354,0.00035995423],"category_scores_gemma":[0.00010042246,0.00021831773,0.00012246026,0.0003647909,0.00003389715,0.0004873533,0.00002306616,0.0008679708,0.00049014686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015493535,0.000028909151,0.00001845404,0.000010392169,0.0001112308,0.0000029681555,0.00014925502,0.97427636,0.0028699893,0.004408533,0.0021308877,0.015977552],"study_design_scores_gemma":[0.0006931632,0.00004937277,0.00029595994,0.00001963783,0.000057960835,0.00006238957,0.00019155793,0.9295841,0.0062943096,0.00020552638,0.06213868,0.0004073475],"about_ca_topic_score_codex":5.1404675e-7,"about_ca_topic_score_gemma":0.0000033120264,"teacher_disagreement_score":0.8779345,"about_ca_system_score_codex":0.00028667413,"about_ca_system_score_gemma":0.00010570935,"threshold_uncertainty_score":0.89027387},"labels":[],"label_agreement":null},{"id":"W2149985337","doi":"10.1287/trsc.1080.0232","title":"The Stochastic Eulerian Tour Problem","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Eulerian path; Mathematics; A priori and a posteriori; Combinatorics; Graph; Expected value; Probability distribution; Mathematical optimization; Discrete mathematics; Applied mathematics; Statistics","score_opus":0.02164490420805822,"score_gpt":0.2595778368169822,"score_spread":0.23793293260892398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149985337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29145688,0.00004176568,0.7058149,0.00009549861,0.00023862047,0.0001474674,0.0000031454779,0.00032037278,0.0018813425],"genre_scores_gemma":[0.9588357,0.000014741702,0.04094047,0.000020906557,0.000020247357,0.0000130507005,0.0000018787202,0.000010581882,0.00014242901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.000010797176,0.00018014704,0.00012809805,0.00030251386,0.00020959409],"domain_scores_gemma":[0.9996101,0.0000604466,0.000025442787,0.00014962211,0.000088739216,0.000065622065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046646583,0.000067386725,0.00005573788,0.000052966305,0.0004908136,0.000036141955,0.00023829371,0.00001861444,0.00002199236],"category_scores_gemma":[0.00003316418,0.00005320202,0.00001890314,0.0007071448,0.00026222097,0.0002481109,0.0000015943771,0.00007246647,0.00002155732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017711486,0.0000032727587,0.00048542887,0.000004271012,0.0000019300132,0.0000016672158,0.0015705043,0.9890005,0.0047011385,0.0014160131,0.000083730185,0.0027297996],"study_design_scores_gemma":[0.00044598675,0.00003139717,0.26474264,0.000024535153,0.000012435181,0.000018808636,0.00029494773,0.7245219,0.006952918,0.00064492866,0.0019288979,0.000380626],"about_ca_topic_score_codex":0.000004898153,"about_ca_topic_score_gemma":0.000018455547,"teacher_disagreement_score":0.6673788,"about_ca_system_score_codex":0.000027509313,"about_ca_system_score_gemma":0.00006583306,"threshold_uncertainty_score":0.3774991},"labels":[],"label_agreement":null},{"id":"W2149994569","doi":"10.3138/infor.46.1.71","title":"Metaheuristics: A Canadian Perspective","year":2008,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","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":true,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Metaheuristic; Perspective (graphical); Computer science; Parallel metaheuristic; Simple (philosophy); Sociology; Management science; Artificial intelligence; Operations research; Mathematics; Epistemology; Engineering; Philosophy","score_opus":0.06716616501221806,"score_gpt":0.34087110619448663,"score_spread":0.27370494118226857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149994569","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102659814,0.0015822924,0.13207963,0.0011658508,0.0013044253,0.0024596634,0.00040613196,0.00058991037,0.7577523],"genre_scores_gemma":[0.9950259,0.00012936747,0.004098859,0.000082116385,0.00010177072,0.000075586555,0.00005356712,0.000009799039,0.00042306533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987707,0.00006726454,0.0003248056,0.00006568474,0.0005060402,0.00026547632],"domain_scores_gemma":[0.9983323,0.00014040286,0.000018489234,0.000115903524,0.0011755292,0.0002173416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011126868,0.00008544158,0.00010934213,0.0005326118,0.0005214456,0.00026362692,0.000096532494,0.00008148933,0.00004881678],"category_scores_gemma":[0.000483852,0.000081690494,0.000017469427,0.00036460612,0.0000783433,0.0011714409,0.000020467267,0.00022638876,0.00022154173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010836369,0.0000058282594,0.002601384,0.000113676644,0.000078084755,0.000007549924,0.012516119,0.602102,0.00003576944,0.3617181,0.019329898,0.0014807624],"study_design_scores_gemma":[0.00029979146,0.000027607646,0.0042657563,0.000020455222,0.000002126519,0.00012019189,0.0031321656,0.8164804,0.00005378286,0.00007991467,0.17534679,0.00017104532],"about_ca_topic_score_codex":0.01832326,"about_ca_topic_score_gemma":0.0006866498,"teacher_disagreement_score":0.89236605,"about_ca_system_score_codex":0.0003189538,"about_ca_system_score_gemma":0.00038633888,"threshold_uncertainty_score":0.98821384},"labels":[],"label_agreement":null},{"id":"W2150123606","doi":"10.1016/j.dam.2008.04.022","title":"0–1 reformulations of the multicommodity capacitated network design problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":112,"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; Computer Research Institute of Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Cutting-plane method; Integer (computer science); Residual; Variable (mathematics); Integer programming; Mathematical optimization; Network planning and design; Piecewise linear function; Branch and cut; Piecewise; Algorithm; Computer science","score_opus":0.03861793585691882,"score_gpt":0.24257225088065193,"score_spread":0.20395431502373312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150123606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028558569,0.000016081225,0.9614813,0.00001786316,0.00006104175,0.0005589579,0.000007820738,0.00025700964,0.009041371],"genre_scores_gemma":[0.42969984,0.0000068038553,0.5701803,0.000007532063,0.000019086305,0.00002806543,0.0000037478114,0.000030023648,0.000024590367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999051,0.000033365483,0.00040594832,0.00009844862,0.00019399935,0.00021726785],"domain_scores_gemma":[0.9991372,0.00021428069,0.00011765454,0.00044168736,0.000047593807,0.000041572235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003353844,0.00014740204,0.00022360789,0.000028587241,0.00016971372,0.000008894651,0.00022750658,0.00007989373,0.00001310751],"category_scores_gemma":[0.00004735575,0.00010749989,0.000061194114,0.00037630703,0.00009261219,0.000044941502,0.00004650629,0.00015739536,0.000009078078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018732732,0.00001804707,0.00006518507,0.000090909656,0.00002986583,2.0479845e-7,0.0016251509,0.9848102,0.0024441502,0.010490455,0.00029392002,0.00013004767],"study_design_scores_gemma":[0.00025262655,0.000005700238,0.0003499422,0.000046227808,0.000033271026,0.000006933059,0.00011707346,0.9800089,0.009197952,0.009756662,0.000055663666,0.00016902213],"about_ca_topic_score_codex":0.0000020849914,"about_ca_topic_score_gemma":0.0000010316014,"teacher_disagreement_score":0.40114126,"about_ca_system_score_codex":0.000040037146,"about_ca_system_score_gemma":0.000018774885,"threshold_uncertainty_score":0.43837184},"labels":[],"label_agreement":null},{"id":"W2152304735","doi":"10.1023/a:1011336210885","title":"Variable Neighborhood Decomposition Search","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":291,"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":"Variable neighborhood search; Metaheuristic; Local search (optimization); Descent (aeronautics); Mathematical optimization; Variable (mathematics); Node (physics); Gradient descent; Decomposition; Computer science; Local optimum; Algorithm; Mathematics; Artificial intelligence; Artificial neural network","score_opus":0.016014294489356155,"score_gpt":0.29095552040227646,"score_spread":0.2749412259129203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152304735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023595938,0.00020218531,0.96902907,0.00006977293,0.0004968909,0.000027657297,0.0000019352683,0.00004651056,0.0065300446],"genre_scores_gemma":[0.5567801,0.00019729753,0.44255716,0.000036059664,0.0003375441,2.2667462e-7,0.0000013997411,0.000024361058,0.00006588699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921495,0.00005598082,0.0003352086,0.000042078384,0.00020051931,0.00015129232],"domain_scores_gemma":[0.99941355,0.00012873825,0.00006553129,0.000093264076,0.00021107396,0.00008782445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004991315,0.00007229276,0.0001441092,0.0001100077,0.000040381125,0.000038830738,0.000115661845,0.000053454314,0.000108935346],"category_scores_gemma":[0.00012450069,0.00007080853,0.00003941756,0.00022706739,0.000010671456,0.000104499566,0.000012261757,0.0002510256,0.000012405032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014925846,0.000035149747,0.0028890343,0.00002582634,0.000039318238,0.000065591346,0.00007530704,0.9858889,0.0027671251,0.001344682,0.0019286412,0.0049254918],"study_design_scores_gemma":[0.00060699706,0.0001164299,0.0024285242,0.00007001795,0.00005385628,0.0008565596,0.000042190208,0.98504674,0.0016436735,0.0022514842,0.0067195804,0.000163925],"about_ca_topic_score_codex":7.329583e-7,"about_ca_topic_score_gemma":9.1488936e-8,"teacher_disagreement_score":0.5331841,"about_ca_system_score_codex":0.00007007556,"about_ca_system_score_gemma":0.000031763815,"threshold_uncertainty_score":0.2887488},"labels":[],"label_agreement":null},{"id":"W2154025454","doi":"10.1016/j.cor.2011.12.016","title":"The Canadian minimum duration truck driver scheduling problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Truck; Duration (music); Integer programming; Schedule; Operations research; Scheduling (production processes); Computer science; Dynamic programming; Service (business); Transport engineering; Linear programming; Operations management; Automotive engineering; Business; Engineering; Marketing; Algorithm; Operating system","score_opus":0.05594305595633055,"score_gpt":0.3457641357038667,"score_spread":0.2898210797475362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154025454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12560235,0.0007914624,0.856159,0.0040765502,0.0016012557,0.0012924329,0.000008643598,0.0004260653,0.010042245],"genre_scores_gemma":[0.74718285,0.000040128045,0.25197327,0.00003743227,0.00030782775,0.00006231192,0.00001937802,0.000030077983,0.00034670418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982336,0.00034428053,0.00025457906,0.0001402308,0.00034842215,0.00067886803],"domain_scores_gemma":[0.998775,0.00026858755,0.000007866835,0.0003162717,0.00033795976,0.00029432352],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021691234,0.000105328814,0.00008480488,0.00025448133,0.0018681872,0.0005902494,0.00030607366,0.00008934228,0.000033946126],"category_scores_gemma":[0.0001769546,0.00009102938,0.000030197381,0.000657376,0.000101584075,0.0003987558,0.000059469876,0.00043639587,0.00017411781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011507876,0.000009195864,0.00087223726,0.000009954778,0.00002211135,7.926105e-7,0.0012623792,0.9773634,0.0008108366,0.006608634,0.002643331,0.010395944],"study_design_scores_gemma":[0.00011743287,0.0000108424965,0.0017102339,0.00001509592,0.000002795703,0.0000056915324,0.0001276333,0.9856172,0.00073201745,0.000034981855,0.011510778,0.00011526775],"about_ca_topic_score_codex":0.0024355473,"about_ca_topic_score_gemma":0.024414029,"teacher_disagreement_score":0.62158054,"about_ca_system_score_codex":0.00043171033,"about_ca_system_score_gemma":0.00022865811,"threshold_uncertainty_score":0.99943125},"labels":[],"label_agreement":null},{"id":"W2154441251","doi":"10.1007/s10696-012-9162-3","title":"Environmental and economic issues arising from the pooling of SMEs’ supply chains: case study of the food industry in western France","year":2012,"lang":"en","type":"article","venue":"Flexible Services and Manufacturing Journal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":53,"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é Laval","funders":"Conservatoire National des Arts et Métiers","keywords":"Pooling; Supply chain; Business; Order (exchange); Supply network; Industrial organization; Environmental economics; Computer science; Operations research; Marketing; Economics; Engineering; Finance","score_opus":0.013582670686573402,"score_gpt":0.2457775649177627,"score_spread":0.2321948942311893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154441251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9970915,0.0024005007,0.000115188894,0.000051467672,0.00019636173,0.000116085335,0.000011891565,0.000010965309,0.0000060655157],"genre_scores_gemma":[0.99882704,0.00020026889,0.00075700035,0.000030695443,0.00015840046,0.0000014611752,4.1664114e-7,0.000017649825,0.0000070964325],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99928105,0.00008268114,0.00029691213,0.000085853884,0.00008620342,0.00016727451],"domain_scores_gemma":[0.9995951,0.00007468652,0.00013743484,0.00014086998,0.000002788274,0.000049111124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034275703,0.00011648211,0.00017297438,0.000046154186,0.000115889,0.000050579507,0.00013008146,0.00009674535,0.000016652264],"category_scores_gemma":[0.0000014997585,0.00008145072,0.000022189426,0.000022088481,0.000024386269,0.00024370091,0.00010151846,0.00049458427,2.3465732e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053848466,0.00003484598,0.80826545,0.000054316115,0.00006578802,0.0000054139423,0.017286792,0.17038178,0.00029969506,9.225017e-7,0.0000010181684,0.0035986023],"study_design_scores_gemma":[0.0009334222,0.00005783536,0.9390304,0.0002130154,0.000049401722,0.0004238102,0.025859347,0.015206769,0.01794867,0.00003171173,0.000089830595,0.0001557569],"about_ca_topic_score_codex":0.00063868816,"about_ca_topic_score_gemma":0.00022976479,"teacher_disagreement_score":0.15517502,"about_ca_system_score_codex":0.000025208457,"about_ca_system_score_gemma":0.0000043322902,"threshold_uncertainty_score":0.3321464},"labels":[],"label_agreement":null},{"id":"W2155032754","doi":"10.1016/j.ejor.2012.08.014","title":"Rich routing problems arising in supply chain management","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":105,"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":"Interdependence; Computer science; Supply chain; Vehicle routing problem; Scheduling (production processes); Supply chain management; Routing (electronic design automation); Operations research; Context (archaeology); Mathematical optimization; Focus (optics); Mathematics; Business","score_opus":0.07711657160685632,"score_gpt":0.35139712469357054,"score_spread":0.27428055308671423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155032754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74213165,0.0014233096,0.15537626,0.00086531945,0.0006579907,0.00043663013,0.0000029517867,0.00006590997,0.09903996],"genre_scores_gemma":[0.918909,0.00011003732,0.08018844,0.000024257612,0.00041091617,0.000002018991,0.0000025845097,0.000042784784,0.0003099732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968866,0.0012532078,0.00057031895,0.00008961099,0.00075665367,0.00044358138],"domain_scores_gemma":[0.99921626,0.00020063315,0.000053001877,0.00011662253,0.0002722596,0.00014123645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016302474,0.00009616336,0.0001316445,0.0005227527,0.00012539652,0.00013711634,0.0002658478,0.000019771394,0.00010631683],"category_scores_gemma":[0.0003571429,0.00009076589,0.000035004312,0.00058762403,0.00003114092,0.0004433589,0.000088248395,0.00066063274,0.00006854924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001591725,0.00008654185,0.021783045,0.00006103773,0.000048134483,0.00009414059,0.0026337816,0.9511828,0.0038951328,0.0025691683,0.0013187127,0.016311623],"study_design_scores_gemma":[0.0038683421,0.0003264232,0.4329462,0.0013788475,0.000026077743,0.00045180807,0.0027981682,0.529647,0.004358692,0.00022481366,0.023155052,0.00081861083],"about_ca_topic_score_codex":0.0000012788895,"about_ca_topic_score_gemma":5.109051e-7,"teacher_disagreement_score":0.4215358,"about_ca_system_score_codex":0.00020056395,"about_ca_system_score_gemma":0.000031195916,"threshold_uncertainty_score":0.5650144},"labels":[],"label_agreement":null},{"id":"W2155052104","doi":"10.1109/ccece.2007.350","title":"A Swarm Optimizer Based on Multi-Criterion Decision Making, Part II: Case Study","year":2007,"lang":"en","type":"article","venue":"","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":"Dalhousie University","funders":"","keywords":"Generality; Benchmark (surveying); Travelling salesman problem; Mathematical optimization; Computer science; Class (philosophy); Fraction (chemistry); Swarm behaviour; Mathematics; Artificial intelligence","score_opus":0.038915302723277215,"score_gpt":0.3448650715935365,"score_spread":0.3059497688702593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155052104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41119397,0.000008454574,0.5863588,0.000007239361,0.0003434108,0.0002878458,0.0000014863477,0.0005145667,0.001284229],"genre_scores_gemma":[0.5724104,0.0000011273946,0.42724508,0.00011859616,0.0000479532,0.000009373464,0.000001504952,0.000043913577,0.000122057565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851996,0.00008149547,0.00044381965,0.0003098027,0.0002843711,0.00036057102],"domain_scores_gemma":[0.9989191,0.00039503805,0.000040112827,0.00046454856,0.000065276094,0.0001159245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015134406,0.00023612726,0.0002143585,0.00026322785,0.00018577659,0.00005923728,0.00012811867,0.00010993201,0.0003225614],"category_scores_gemma":[0.00020120361,0.00022146388,0.00006867264,0.00036334395,0.000014966966,0.0000988694,0.000054678567,0.00021090696,0.000037897007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004648996,0.00032237679,0.0013913782,0.0000071993045,0.000014027918,0.00097611954,0.0004951571,0.9497418,0.000041165124,0.0000051098423,0.00037178185,0.04658744],"study_design_scores_gemma":[0.0016298711,0.00018767388,0.00075954944,0.000054129217,0.000019112857,0.00011324081,0.0005591734,0.9948846,0.0008283887,0.00000174786,0.00068771146,0.00027477526],"about_ca_topic_score_codex":0.000026749056,"about_ca_topic_score_gemma":0.00007470729,"teacher_disagreement_score":0.16121641,"about_ca_system_score_codex":0.00011678633,"about_ca_system_score_gemma":0.000011319608,"threshold_uncertainty_score":0.90310353},"labels":[],"label_agreement":null},{"id":"W2155293443","doi":"10.1016/j.cor.2013.08.010","title":"A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":160,"is_retracted":false,"has_abstract":false,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Benchmark (surveying); Vehicle routing problem; Heuristic; Computer science; Mathematical optimization; Variable (mathematics); Variable neighborhood search; Ant colony optimization algorithms; Algorithm; Routing (electronic design automation); Metaheuristic; Mathematics","score_opus":0.030289850259653747,"score_gpt":0.29436816292635276,"score_spread":0.264078312666699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155293443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021594202,0.000095097676,0.9735874,0.000743091,0.00009516264,0.0027020627,0.000020799393,0.00031745073,0.00084471615],"genre_scores_gemma":[0.6447034,0.000009417459,0.35353887,0.00005072931,0.00018760264,0.00073053024,0.000040485542,0.00008038732,0.00065857166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760723,0.0003610522,0.00033992718,0.00037629798,0.0005121226,0.0008033537],"domain_scores_gemma":[0.99622273,0.002112241,0.000014563311,0.0005772913,0.00090787,0.00016529881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018768935,0.000200679,0.000216173,0.00019633216,0.0011522509,0.00086004985,0.00059090625,0.00006329152,0.00016167352],"category_scores_gemma":[0.00030855375,0.00015244179,0.00004598447,0.0007970293,0.0001338072,0.00039086898,0.00018349949,0.00057941244,0.00023121577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009341153,0.00004054322,0.00024629635,0.000045480698,0.0000675521,0.0000013859293,0.0004798072,0.98435336,0.003224608,0.0007821207,0.0028809486,0.007868571],"study_design_scores_gemma":[0.000763701,0.000113130845,0.00039870807,0.00006050945,0.000010978401,0.000012629728,0.000118584605,0.9964517,0.001259858,0.0000786027,0.00053601415,0.000195627],"about_ca_topic_score_codex":0.00024244763,"about_ca_topic_score_gemma":0.000011672019,"teacher_disagreement_score":0.6231092,"about_ca_system_score_codex":0.00016665409,"about_ca_system_score_gemma":0.00019226017,"threshold_uncertainty_score":0.88622993},"labels":[],"label_agreement":null},{"id":"W2155694204","doi":"10.1287/trsc.1120.0449","title":"Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Branch and cut; Bottleneck traveling salesman problem; Bounding overwatch; Mathematics; 2-opt; Traveling purchaser problem; Integer programming; Tree traversal; Branch and bound; Graph; Combinatorics; Hamiltonian path; Time complexity; Combinatorial optimization; Mathematical optimization; Algorithm; Computer science","score_opus":0.015636451574653952,"score_gpt":0.270342152026532,"score_spread":0.25470570045187807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155694204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08173584,0.00016525511,0.91764283,0.00004282299,0.000051465056,0.00018684712,0.000013527213,0.0000842287,0.00007720567],"genre_scores_gemma":[0.8025653,0.000051933966,0.19724669,0.000019994799,0.000024647567,0.00001918296,0.000006534246,0.000009810644,0.00005594159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992562,0.000012158537,0.00017593341,0.00014715585,0.0001965027,0.00021208452],"domain_scores_gemma":[0.9995829,0.00014672353,0.000033283748,0.00009974021,0.000054974043,0.00008237464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225205,0.00007946468,0.00010400049,0.00012915599,0.00020721523,0.00005461346,0.00010075255,0.000026876596,0.000013755739],"category_scores_gemma":[0.000010216773,0.000063938474,0.000030011235,0.00069871807,0.00012114494,0.000327493,0.0000019386919,0.000054211345,0.0000020274708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037669406,0.000016799462,0.027648011,0.000051593477,0.00012653838,2.2523635e-7,0.008188063,0.663785,0.011630257,0.000569939,0.0000047197477,0.28797513],"study_design_scores_gemma":[0.00014277226,0.0000057943234,0.09547616,0.000004343101,0.00018207879,9.848304e-7,0.00007302087,0.89834815,0.005552477,0.000054015614,0.000059049264,0.000101143894],"about_ca_topic_score_codex":0.000008738562,"about_ca_topic_score_gemma":0.000013460728,"teacher_disagreement_score":0.7208294,"about_ca_system_score_codex":0.00001406492,"about_ca_system_score_gemma":0.000011871233,"threshold_uncertainty_score":0.26073354},"labels":[],"label_agreement":null},{"id":"W2157158960","doi":"10.1287/opre.1110.0965","title":"Benders Decomposition for Large-Scale Uncapacitated Hub Location","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":237,"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":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Robustness (evolution); Heuristic; Computer science; Decomposition; Set (abstract data type); Algorithm; Reduction (mathematics); Mathematics","score_opus":0.12692481900359817,"score_gpt":0.40012140670801616,"score_spread":0.273196587704418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157158960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04329809,0.00004106715,0.9486955,0.00010489106,0.00012808996,0.0005624461,0.000023285527,0.00022568284,0.0069209873],"genre_scores_gemma":[0.6991071,0.000018457062,0.3000026,0.000015048587,0.000049490078,0.00022725268,0.00012804687,0.000033310436,0.0004187139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.00016404115,0.00019860442,0.00017252758,0.00020915136,0.00033304177],"domain_scores_gemma":[0.9989133,0.00009714744,0.000005903191,0.00023507068,0.00067002454,0.000078553305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264072,0.00008225231,0.00008427608,0.0002514188,0.00043033974,0.0000826777,0.00013900753,0.00008632309,0.00020950266],"category_scores_gemma":[0.00017110088,0.00009031874,0.000027867154,0.00067758205,0.000035630255,0.0002616386,0.000020489562,0.00018920269,0.00008582722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020143307,0.00011407706,0.00022916385,0.00007290855,0.000037345413,6.3315025e-7,0.005441788,0.9647171,0.015436321,0.0087854015,0.0024788731,0.0026662468],"study_design_scores_gemma":[0.00032290333,0.000050080904,0.00070888654,0.000015259498,0.0000053541376,0.0000016875896,0.0007833117,0.9786235,0.0184791,0.00025409146,0.00064751523,0.00010831221],"about_ca_topic_score_codex":0.000032330205,"about_ca_topic_score_gemma":0.0001569243,"teacher_disagreement_score":0.655809,"about_ca_system_score_codex":0.00012316623,"about_ca_system_score_gemma":0.00005260226,"threshold_uncertainty_score":0.3683091},"labels":[],"label_agreement":null},{"id":"W2157589720","doi":"10.1287/trsc.2013.0503","title":"A New Formulation Based on Customer Delivery Patterns for a Maritime Inventory Routing Problem","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Solver; Integer programming; Revenue; Operations research; Mathematical optimization; Liquefied natural gas; Scheduling (production processes); Benchmark (surveying); Computer science; Routing (electronic design automation); Lagrangian relaxation; Branch and price; Term (time); Engineering; Mathematics; Economics; Natural gas; Computer network","score_opus":0.01901026960619377,"score_gpt":0.2648938226044016,"score_spread":0.24588355299820783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157589720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08982789,0.0000021112037,0.90868056,0.0000557096,0.00011853426,0.0002825572,0.0000090283675,0.0002572012,0.0007663994],"genre_scores_gemma":[0.80480236,8.0852635e-7,0.19490977,0.0001355196,0.0000380339,0.000023313292,0.000030237043,0.000020008461,0.00003994046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988839,0.000019208932,0.00026999688,0.0002354972,0.00033762198,0.00025377882],"domain_scores_gemma":[0.9994488,0.00010774103,0.000059692484,0.0001554191,0.00011856869,0.00010981735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008750979,0.00011365355,0.000105641964,0.00020719453,0.00013993714,0.000056658206,0.0001614809,0.00006339344,0.000036837784],"category_scores_gemma":[0.00004956092,0.00012306633,0.00004663052,0.00046678912,0.00002366332,0.00039399977,0.0000015439722,0.00009735434,0.000010681987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009956921,0.000007626268,0.010058846,0.000051424235,0.0000019318607,1.4278272e-7,0.00038118352,0.9604078,0.0024838445,0.0021132496,0.000038947288,0.024445074],"study_design_scores_gemma":[0.00040636284,0.00003338331,0.02986656,0.00005562657,0.000010581897,1.4105247e-7,0.000013868804,0.9650747,0.0038804833,0.00014494066,0.00036498054,0.00014838108],"about_ca_topic_score_codex":0.00002706092,"about_ca_topic_score_gemma":0.00003166112,"teacher_disagreement_score":0.71497446,"about_ca_system_score_codex":0.00007817391,"about_ca_system_score_gemma":0.00007638751,"threshold_uncertainty_score":0.50184995},"labels":[],"label_agreement":null},{"id":"W2158175311","doi":"10.1287/opre.51.6.940.24921","title":"A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"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":"Branch and cut; Linear programming relaxation; Mathematical optimization; Facet (psychology); Relaxation (psychology); Undirected graph; Integer programming; Mathematics; Integer (computer science); Linear programming; Algorithm; Polyhedron; Travelling salesman problem; Computer science; Combinatorics; Graph","score_opus":0.06787206902597621,"score_gpt":0.3684388767560152,"score_spread":0.300566807730039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158175311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004063582,0.00045943432,0.9917291,0.00048151662,0.00007798432,0.00085492973,0.00001420073,0.0001242939,0.002194959],"genre_scores_gemma":[0.15151243,0.00026906095,0.8439275,0.000033238113,0.00011319691,0.00074624305,0.00001804197,0.00006743878,0.0033128588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989259,0.00022794964,0.00016649521,0.00015854521,0.00021088871,0.00031021857],"domain_scores_gemma":[0.9989175,0.0005269337,0.0000039960382,0.00020193818,0.00028666246,0.00006296015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020162642,0.000082102786,0.00008760452,0.00009493506,0.0006581249,0.00019698907,0.00011665735,0.000060474886,0.000080118654],"category_scores_gemma":[0.00044421037,0.000064846405,0.000025660316,0.000532081,0.000065217166,0.00010208166,0.000017472517,0.00026758233,0.00001402681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021410904,0.000022651042,0.000025084686,0.000031744832,0.000052463707,5.5518063e-7,0.0009748727,0.84767866,0.0061095953,0.0059345854,0.0006083762,0.13855927],"study_design_scores_gemma":[0.00027789833,0.000018580324,0.000045538636,0.000011108075,0.0000059289014,0.000005767238,0.00015404132,0.98288643,0.0066989125,0.00017640351,0.009635757,0.00008364677],"about_ca_topic_score_codex":0.000027406953,"about_ca_topic_score_gemma":0.000054272034,"teacher_disagreement_score":0.14780161,"about_ca_system_score_codex":0.00005053463,"about_ca_system_score_gemma":0.00006915065,"threshold_uncertainty_score":0.50618315},"labels":[],"label_agreement":null},{"id":"W2158354221","doi":"10.1287/trsc.1100.0363","title":"Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Vehicle routing problem; Column generation; Tabu search; Mathematical optimization; Routing (electronic design automation); Path (computing); Computer science; Branch and cut; Mathematics; Integer programming; Computer network","score_opus":0.017258190346143072,"score_gpt":0.24024294705219787,"score_spread":0.2229847567060548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158354221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6949833,0.000028775385,0.30441654,0.000008064416,0.00001335981,0.00015001094,0.0000048332677,0.00007325473,0.00032189486],"genre_scores_gemma":[0.8911614,0.000020724403,0.108743496,0.0000176435,0.00000583305,0.000011674804,0.0000018511968,0.0000110977,0.000026298863],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9993567,0.0000075701914,0.0001379247,0.00021370627,0.00011561459,0.00016849973],"domain_scores_gemma":[0.9996779,0.000057818124,0.000034860586,0.00007240798,0.00008214737,0.000074891934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037096624,0.000087327564,0.0001000916,0.000057228703,0.00015590871,0.000043928925,0.000056287518,0.000026129073,0.00000938379],"category_scores_gemma":[0.000022806817,0.00008215477,0.0000062739223,0.00024855442,0.00022254315,0.00048671305,0.0000029325954,0.0000417478,6.2320134e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029481534,0.000044996228,0.089127675,0.0006108946,0.000054799162,0.0000046107134,0.0909577,0.041643977,0.6807545,0.010076473,0.0000067453425,0.08642286],"study_design_scores_gemma":[0.00094984093,0.0001413683,0.61757255,0.000063468244,0.00003356256,0.000005591824,0.00033055607,0.27349317,0.106818415,0.00025938166,0.000022025142,0.00031006045],"about_ca_topic_score_codex":0.000011011995,"about_ca_topic_score_gemma":0.000012835928,"teacher_disagreement_score":0.57393605,"about_ca_system_score_codex":0.000008601941,"about_ca_system_score_gemma":0.000019480363,"threshold_uncertainty_score":0.33501744},"labels":[],"label_agreement":null},{"id":"W2158930858","doi":"10.3138/infor.47.3.223","title":"Locating Satellite Yards in Forestry Operations","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"HEC Montréal","funders":"Natural Resources Canada; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; FPInnovations","keywords":"Yard; Satellite; Integer programming; Operations research; Thunder; Linear programming; Computer science; Engineering; Geography; Meteorology","score_opus":0.04898157019413371,"score_gpt":0.3574831592876238,"score_spread":0.3085015890934901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158930858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55116296,0.0019619153,0.24819908,0.0016948071,0.000855021,0.0033515128,0.00009553989,0.0007089438,0.1919702],"genre_scores_gemma":[0.9915456,0.00012960038,0.007773351,0.000119496166,0.000087145956,0.000071741546,0.00010321503,0.000007815711,0.00016200572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834794,0.00008845827,0.0006371751,0.00008732886,0.000549713,0.00028940148],"domain_scores_gemma":[0.9991324,0.00013144281,0.00002096637,0.00014849873,0.0004706017,0.000096101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021159754,0.000109963876,0.00013684353,0.00049773825,0.00024508216,0.0006679585,0.00011986508,0.00011436949,0.000016355461],"category_scores_gemma":[0.0003390659,0.000106820444,0.000017219993,0.00059901376,0.000036541947,0.002120496,0.000024405259,0.00031531215,0.000068289344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051243765,0.0000055531036,0.0012642122,0.00006788484,0.0000042819775,5.7954526e-7,0.0013092724,0.9313934,0.000115808405,0.04396586,0.00020355667,0.021664469],"study_design_scores_gemma":[0.00035133693,0.000036210306,0.014533047,0.000066804525,8.9321264e-7,0.000015507178,0.00091509207,0.9707816,0.0001403951,0.000059739832,0.012962028,0.0001373284],"about_ca_topic_score_codex":0.00008450712,"about_ca_topic_score_gemma":0.000017413253,"teacher_disagreement_score":0.44038266,"about_ca_system_score_codex":0.00013801156,"about_ca_system_score_gemma":0.000116042516,"threshold_uncertainty_score":0.64411396},"labels":[],"label_agreement":null},{"id":"W2159784590","doi":"10.1287/opre.1050.0222","title":"Dynamic Aggregation of Set-Partitioning Constraints in Column Generation","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kronos (Canada); Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Crew scheduling; Mathematical optimization; Scheduling (production processes); Computer science; Degeneracy (biology); Equivalence relation; Relaxation (psychology); Set (abstract data type); Equivalence (formal languages); Job shop scheduling; Relation (database); Routing (electronic design automation); Mathematics; Discrete mathematics","score_opus":0.07615527304630118,"score_gpt":0.3934507778213092,"score_spread":0.317295504775008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159784590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83877885,0.000119168544,0.15676449,0.0003216722,0.00007374089,0.0003705606,0.000015962176,0.000079841855,0.0034757338],"genre_scores_gemma":[0.8891908,0.000063978165,0.110293165,0.000007909616,0.000045668217,0.00006178525,0.00007407234,0.000017278497,0.00024538097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987692,0.0002492409,0.00033408764,0.00014068728,0.00028714302,0.00021963619],"domain_scores_gemma":[0.99940556,0.00008590062,0.000010486294,0.00017736811,0.00027699303,0.000043680935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013437979,0.00006749603,0.00010278378,0.00036701292,0.00014726294,0.00007802481,0.000095258576,0.000076393495,0.00034217964],"category_scores_gemma":[0.00029487623,0.00008229827,0.00001842705,0.00073308416,0.00010628208,0.00030806763,0.000020239579,0.0002379293,0.000052111587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011271949,0.00001878897,0.0003807291,0.000011746241,0.000004719182,5.152272e-7,0.000510611,0.9360482,0.045525547,0.0009544236,0.00012076855,0.016422812],"study_design_scores_gemma":[0.00024179787,0.000014585593,0.00097454747,0.000030581006,0.0000014600353,0.0000027296294,0.00013610555,0.9794321,0.01892296,0.000017911636,0.00015361655,0.00007159921],"about_ca_topic_score_codex":0.000045467248,"about_ca_topic_score_gemma":0.0014931523,"teacher_disagreement_score":0.050411936,"about_ca_system_score_codex":0.00023509124,"about_ca_system_score_gemma":0.000085419626,"threshold_uncertainty_score":0.3746627},"labels":[],"label_agreement":null},{"id":"W2159913713","doi":"10.1007/s10288-010-0145-5","title":"A large neighbourhood search heuristic for the aircraft and passenger recovery problem","year":2010,"lang":"en","type":"article","venue":"4OR","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"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":"HEC Montréal","keywords":"Iterated local search; Operations research; Schedule; Computer science; Heuristic; Context (archaeology); Neighbourhood (mathematics); Set (abstract data type); Vehicle routing problem; Randomness; Mathematical optimization; Local search (optimization); Routing (electronic design automation); Engineering; Mathematics; Artificial intelligence","score_opus":0.012263228661227093,"score_gpt":0.2616284954726309,"score_spread":0.2493652668114038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159913713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09258533,0.00026498732,0.9026478,0.0010249477,0.00060566654,0.00067938905,0.000045768582,0.0003531085,0.001792981],"genre_scores_gemma":[0.80510306,0.00004850313,0.19384263,0.000094898016,0.00025099586,0.00008607373,0.000005554095,0.000056726924,0.0005115237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941075,0.000026061469,0.000119278666,0.00012270728,0.00008073212,0.00024046592],"domain_scores_gemma":[0.9992325,0.00046480124,0.000013418153,0.00019354692,0.000044074208,0.000051708084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060023356,0.0000877775,0.00009276084,0.000033569097,0.00011416479,0.00006310352,0.00009739697,0.00007102785,0.00009528753],"category_scores_gemma":[0.00018101408,0.00006740261,0.000032323045,0.00009563691,0.000019406541,0.000062522755,0.000030886604,0.00023678677,0.000011808614],"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.00016460998,0.0003187858,0.01589145,0.0021845882,0.0007102853,0.000019736925,0.008122005,0.39748606,0.07717497,0.026565898,0.02648244,0.44487917],"study_design_scores_gemma":[0.0006677374,0.000043116954,0.0074672587,0.000018182507,0.000034920206,0.000014625906,0.00009983268,0.9674323,0.0015951842,0.00073874765,0.021675372,0.00021270079],"about_ca_topic_score_codex":0.0000036761078,"about_ca_topic_score_gemma":0.000015242513,"teacher_disagreement_score":0.71251774,"about_ca_system_score_codex":0.000009657122,"about_ca_system_score_gemma":0.000015780039,"threshold_uncertainty_score":0.27485988},"labels":[],"label_agreement":null},{"id":"W2160968569","doi":"10.1287/trsc.1100.0326","title":"The Dynamic Uncapacitated Hub Location Problem","year":2010,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Lagrangian; Reduction (mathematics); Set (abstract data type); Exploit; Relaxation (psychology); Upper and lower bounds; Tree (set theory); Function (biology); Computer science; Branch and bound; Mathematics; Applied mathematics; Combinatorics","score_opus":0.008700321292497787,"score_gpt":0.26349886339977696,"score_spread":0.25479854210727915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160968569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59682196,0.000019504969,0.4001324,0.00020654868,0.0005509635,0.00019176818,0.000003559404,0.00043031195,0.0016429841],"genre_scores_gemma":[0.9357206,0.0000111641575,0.06412217,0.00001575577,0.000009718112,0.000016238195,0.000007858237,0.000011899042,0.00008460102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913996,0.000011840973,0.00020827077,0.00014770248,0.00029061738,0.00020157734],"domain_scores_gemma":[0.99939525,0.000070261514,0.00003690429,0.00020509967,0.00023229871,0.000060164268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096110936,0.00007433932,0.0000504626,0.00007298324,0.00033022088,0.000091892194,0.00027259003,0.000034664405,0.000016513906],"category_scores_gemma":[0.000063896434,0.00005941708,0.000015017975,0.001236921,0.00028916862,0.0003469442,0.0000013297503,0.00017003989,0.000023901193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032961204,0.000008824373,0.0014910145,0.000022163269,0.000004444311,5.663792e-7,0.0018058268,0.66945934,0.2897162,0.010108516,0.000034441684,0.027345354],"study_design_scores_gemma":[0.0001682628,0.000009783476,0.111231945,0.0000099923345,0.000007847961,0.0000018273598,0.00015676218,0.8708845,0.015104164,0.0011578506,0.0010991818,0.00016790093],"about_ca_topic_score_codex":0.0000064575934,"about_ca_topic_score_gemma":0.00020760918,"teacher_disagreement_score":0.33889863,"about_ca_system_score_codex":0.000026263711,"about_ca_system_score_gemma":0.00006965539,"threshold_uncertainty_score":0.25398254},"labels":[],"label_agreement":null},{"id":"W2161733364","doi":"10.1287/trsc.1050.0130","title":"Inbound Logistic Planning: Minimizing Transportation and Inventory Cost","year":2006,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Heuristic; Supply chain; Operations research; Supply chain management; Computer science; Nonlinear programming; Set (abstract data type); Integer programming; Relaxation (psychology); Pipeline (software); Linear programming; Inventory theory; Nonlinear system; Inventory control; Mathematics","score_opus":0.04512122447174366,"score_gpt":0.305077298297317,"score_spread":0.25995607382557334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161733364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69433707,0.00012699571,0.30403093,0.000024482357,0.00016681432,0.00014153242,0.000014977735,0.0002582293,0.00089900085],"genre_scores_gemma":[0.9702873,0.000011159611,0.029515244,0.000028965977,0.000030740342,0.0000152381845,0.000053963904,0.000017996537,0.000039359056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988522,0.000014441676,0.0003266877,0.00024806178,0.0003123978,0.00024624527],"domain_scores_gemma":[0.9996099,0.000053791093,0.00005611049,0.00011547365,0.0000804278,0.000084332845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045610053,0.00012476403,0.00012053743,0.00019619214,0.0001755363,0.00007760276,0.0001267225,0.000050366794,0.000018283805],"category_scores_gemma":[0.00002084489,0.00014010741,0.000021143851,0.0006603437,0.00029170094,0.00047866435,8.2515896e-7,0.00009775046,0.0000037399886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062262006,0.000012533846,0.07210508,0.000058547263,0.0000034037193,0.000008929653,0.0016449525,0.90789205,0.013330882,0.0033561438,0.00006744932,0.0015138148],"study_design_scores_gemma":[0.00047020562,0.000017107956,0.7916463,0.000048270915,0.00002745824,0.0000022752129,0.00025413866,0.19999889,0.0057665757,0.000690802,0.00077976537,0.00029821816],"about_ca_topic_score_codex":0.00004665028,"about_ca_topic_score_gemma":0.00006860267,"teacher_disagreement_score":0.7195412,"about_ca_system_score_codex":0.00005115958,"about_ca_system_score_gemma":0.000047053498,"threshold_uncertainty_score":0.57134145},"labels":[],"label_agreement":null},{"id":"W2163513576","doi":"10.1002/net.21520","title":"A branch‐price‐and‐cut algorithm for the min‐max <i>k</i>‐vehicle windy rural postman problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Set (abstract data type); Branch and cut; Computer science; Mathematical optimization; Algorithm; Graph; Vehicle routing problem; Mathematics; Combinatorics; Integer programming; Routing (electronic design automation)","score_opus":0.007274112739817685,"score_gpt":0.21954171832004143,"score_spread":0.21226760558022376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163513576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073342496,0.0011920789,0.9880103,0.00059781974,0.00043455546,0.001023272,0.00000576651,0.0004367895,0.0009651773],"genre_scores_gemma":[0.40173018,0.00039164897,0.59300846,0.0010607434,0.0015375653,0.0006675186,0.000034526154,0.00021582688,0.0013535257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892426,0.000049403243,0.00026017553,0.00017803011,0.00012560058,0.00046255827],"domain_scores_gemma":[0.99909073,0.0003970152,0.00004839319,0.00027477706,0.00008453721,0.00010457101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036108308,0.00019789964,0.0001898968,0.00003557747,0.0001901908,0.00014810015,0.00021184704,0.00015341,0.00007152959],"category_scores_gemma":[0.000020107509,0.00014058962,0.00007005948,0.0002259051,0.00004916308,0.00018571551,0.000055024062,0.00026474515,0.000021761774],"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.0000025697614,0.00000852186,0.00019660094,0.000018866884,0.000048055368,3.0631878e-7,0.00018660576,0.39734948,0.000158875,0.000061226114,0.006914717,0.59505415],"study_design_scores_gemma":[0.0004743395,0.000031254353,0.0016522941,0.000027325896,0.000027829532,0.000009706383,0.00004101026,0.9907218,0.000111599846,0.00033858613,0.0063590226,0.00020520616],"about_ca_topic_score_codex":0.000036637546,"about_ca_topic_score_gemma":0.0000055301093,"teacher_disagreement_score":0.594849,"about_ca_system_score_codex":0.0000323355,"about_ca_system_score_gemma":0.000009176756,"threshold_uncertainty_score":0.5733079},"labels":[],"label_agreement":null},{"id":"W2163715979","doi":"10.1007/978-0-387-77778-8_8","title":"Parallel Solution Methods for Vehicle Routing Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Operations research, computer science. Interface series","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":45,"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; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Heuristic; Pace; Computer science; Metaheuristic; Mathematical optimization; Routing (electronic design automation); Field (mathematics); Combinatorial optimization; Algorithm; Mathematics; Geography; Computer network","score_opus":0.09522652726484755,"score_gpt":0.3867614583324927,"score_spread":0.29153493106764516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163715979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044932054,0.0006442844,0.95875615,0.00041613882,0.0009648724,0.001294604,0.000026793601,0.0004893215,0.037362896],"genre_scores_gemma":[0.0015969641,0.00056889956,0.90838796,0.000023913686,0.0003581105,0.0001681429,0.000024831936,0.00012840267,0.08874279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645483,0.00021574543,0.0007278514,0.00087148737,0.0007739412,0.0009561168],"domain_scores_gemma":[0.997014,0.00032912852,0.00005993698,0.0008003709,0.0015582826,0.00023831542],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0043591666,0.00044376857,0.00048299303,0.00082336925,0.002010583,0.0009680434,0.0011727221,0.0003038526,0.00016438549],"category_scores_gemma":[0.0002929831,0.00045746195,0.00014670665,0.0005183215,0.0013729312,0.0012900695,0.0006082579,0.00093767216,0.00006906545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009042606,0.000013261511,7.9157803e-7,0.000080890866,0.000046869893,0.0000016118888,0.0015962854,0.93649024,0.0038049123,0.010395704,0.0045837555,0.042976644],"study_design_scores_gemma":[0.00019911386,0.00021122841,0.0000038798594,0.00021550636,0.000009352657,0.000036083013,0.000028218341,0.92715746,0.004899511,0.0007691936,0.06602523,0.00044524643],"about_ca_topic_score_codex":0.000023795412,"about_ca_topic_score_gemma":0.00005325733,"teacher_disagreement_score":0.06144147,"about_ca_system_score_codex":0.0005924839,"about_ca_system_score_gemma":0.00051791675,"threshold_uncertainty_score":0.9997877},"labels":[],"label_agreement":null},{"id":"W2163940244","doi":"10.1057/palgrave.jors.2601775","title":"Design of balanced MBA student teams","year":2004,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"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":"Computer science; Metaheuristic; Project management; Population; Set (abstract data type); Operations research; Mathematical optimization; Norm (philosophy); Representation (politics); Management science; Mathematics; Engineering","score_opus":0.06223547916946872,"score_gpt":0.392809572784927,"score_spread":0.3305740936154583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163940244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18760543,0.00047417026,0.80727017,0.0032397665,0.00041063823,0.00038181047,0.0000046704727,0.0000211773,0.0005921858],"genre_scores_gemma":[0.7444952,0.00027224622,0.25480112,0.00006172164,0.0001772078,0.000004085078,4.4743226e-7,0.000016460983,0.0001715029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980624,0.00025450008,0.00034905568,0.000057201236,0.001106844,0.00017002049],"domain_scores_gemma":[0.9986905,0.00029949207,0.000069533635,0.00013901,0.0007416279,0.000059869075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041283155,0.00006444463,0.00013514349,0.00003817671,0.00015612661,0.000049632567,0.0004092593,0.000055206143,0.00003823597],"category_scores_gemma":[0.00041002,0.000043347263,0.00014034784,0.00035032202,0.00008915036,0.00015492357,0.000064398104,0.00050188217,0.0000031071136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006979905,0.000039455776,0.00027618214,0.000011890589,0.00007097103,5.962159e-7,0.00097493496,0.9572019,0.03819704,0.00034935595,0.0026628207,0.00020784434],"study_design_scores_gemma":[0.0053425,0.0005680211,0.025401395,0.0005916108,0.000054545828,0.00012308381,0.0032369886,0.7486933,0.20660336,0.007107115,0.0018540109,0.00042407],"about_ca_topic_score_codex":0.0000027745943,"about_ca_topic_score_gemma":2.9445465e-7,"teacher_disagreement_score":0.5568898,"about_ca_system_score_codex":0.00036565363,"about_ca_system_score_gemma":0.0003732434,"threshold_uncertainty_score":0.21804562},"labels":[],"label_agreement":null},{"id":"W2164283282","doi":"10.1109/lcomm.2004.827437","title":"A New Hybrid Constraint-Based Approach for 3G Network Planning","year":2004,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Computer science; Constraint (computer-aided design); Mathematical optimization; Range (aeronautics); Hybrid algorithm (constraint satisfaction); Network planning and design; Constraint satisfaction; Artificial intelligence; Mathematics; Local consistency; Computer network","score_opus":0.04587738194204006,"score_gpt":0.2900443951567786,"score_spread":0.24416701321473855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164283282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021850339,0.00026953543,0.99280727,0.0024173553,0.00017829685,0.0003658993,0.000012625074,0.0005907522,0.0011732299],"genre_scores_gemma":[0.24629357,0.000007240608,0.7522261,0.0011379593,0.000113187634,0.00008146332,0.000086763546,0.000045225028,0.000008478617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911165,0.00007140954,0.00027584928,0.00014926336,0.00009129969,0.00030050403],"domain_scores_gemma":[0.998396,0.0003007313,0.00005717855,0.0011187798,0.000034511562,0.000092832364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033471812,0.00015491227,0.00016790199,0.00008524638,0.00023520328,0.00006324124,0.00069705886,0.000049755126,0.0000048226707],"category_scores_gemma":[0.00004505083,0.00018783864,0.00008405674,0.0002527456,0.000089810856,0.00008820097,0.00003275691,0.0002446044,0.000006327437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031877357,0.00001261157,0.00008285264,0.000018778635,0.000030885803,4.3184838e-7,0.00011760543,0.98804176,0.0023554673,0.00048324474,0.006732383,0.0021207968],"study_design_scores_gemma":[0.0012204947,0.000013439995,0.000076986245,0.000076940545,0.0000394459,0.0000110121855,0.00003912471,0.9882444,0.0025501817,0.00021635722,0.007182404,0.00032922198],"about_ca_topic_score_codex":0.0000124779235,"about_ca_topic_score_gemma":0.0000011880102,"teacher_disagreement_score":0.24410854,"about_ca_system_score_codex":0.00012410522,"about_ca_system_score_gemma":0.000063592095,"threshold_uncertainty_score":0.76598376},"labels":[],"label_agreement":null},{"id":"W2165941447","doi":"10.1016/j.cor.2012.04.003","title":"Lower and upper bounds for the two-echelon capacitated location-routing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":166,"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; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Heuristics; Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Upper and lower bounds; Branch and bound; Routing (electronic design automation); Set (abstract data type); Neighbourhood (mathematics); Mathematics","score_opus":0.07168323218806766,"score_gpt":0.37346540804947786,"score_spread":0.3017821758614102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165941447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037014905,0.0006217326,0.9595526,0.00083977036,0.00040914887,0.0008115924,0.0000050327794,0.0001765969,0.00056864694],"genre_scores_gemma":[0.7477053,0.000031932108,0.25148597,0.000051660914,0.00024467648,0.00017616787,0.000017065431,0.00003611097,0.00025114484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986535,0.00020277876,0.0002312925,0.00017325298,0.00023975475,0.00049946614],"domain_scores_gemma":[0.99825156,0.0008532175,0.000009524396,0.00029229518,0.00048241278,0.000110976034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025088275,0.00011885974,0.00010920168,0.00015840265,0.0008930481,0.00037003367,0.00020991097,0.00006287257,0.0000188641],"category_scores_gemma":[0.000265487,0.000097911136,0.000028051221,0.00064669154,0.000129513,0.0003459399,0.00008323182,0.00031487414,0.00002141965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004798086,0.000030426268,0.00068183226,0.0000453085,0.00004811453,1.7748808e-7,0.0030479461,0.9700231,0.0015181983,0.006837207,0.0021370247,0.015625866],"study_design_scores_gemma":[0.00029496124,0.000024165249,0.00083288294,0.000031881682,0.0000081854205,0.0000066593,0.00028265122,0.99464345,0.00065093493,0.00004342612,0.003058378,0.0001224509],"about_ca_topic_score_codex":0.000050361898,"about_ca_topic_score_gemma":0.000019104933,"teacher_disagreement_score":0.7106904,"about_ca_system_score_codex":0.00011884877,"about_ca_system_score_gemma":0.000058019235,"threshold_uncertainty_score":0.68686944},"labels":[],"label_agreement":null},{"id":"W2167459401","doi":"10.1002/net.10105","title":"The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm","year":2004,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"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":"Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture; Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Steiner tree problem; Spanning tree; Branch and cut; k-minimum spanning tree; Tabu search; Vertex (graph theory); Mathematics; Integer programming; Combinatorics; Kruskal's algorithm; Euclidean geometry; Heuristic; Algorithm; Graph; Mathematical optimization; Tree structure; K-ary tree; Binary tree","score_opus":0.007846760493643152,"score_gpt":0.2338371477629094,"score_spread":0.22599038726926624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167459401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05134978,0.0023075538,0.94502693,0.00020793981,0.00015149378,0.00012384036,0.0000014910248,0.0002317071,0.0005992386],"genre_scores_gemma":[0.6561824,0.0006537415,0.34252328,0.000089592766,0.00030770412,0.000019785492,0.000010433487,0.00004644696,0.00016660105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907464,0.00006508667,0.00023429075,0.00019305399,0.000110577304,0.000322348],"domain_scores_gemma":[0.99954003,0.00010417192,0.00004267708,0.00019466378,0.00002621631,0.00009226634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038162054,0.00015739235,0.00022032789,0.00008323912,0.00021486843,0.0001328886,0.000097846125,0.000111574234,0.0000058321966],"category_scores_gemma":[0.000016133128,0.00012872905,0.00006378049,0.0005893055,0.000060187373,0.000076214375,0.00004358081,0.00019752933,9.791976e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003507027,0.000002482661,0.0017226671,0.000004442463,0.00019246723,0.0000017730218,0.00022021096,0.8721574,0.000048306953,0.000101203885,0.00004730618,0.12549827],"study_design_scores_gemma":[0.00056666473,0.000012090138,0.0057290997,0.000013855371,0.00017961777,0.0000075377184,0.0000229908,0.9927196,0.000090758986,0.00022926964,0.0002668152,0.00016173247],"about_ca_topic_score_codex":0.000032592474,"about_ca_topic_score_gemma":0.000062609055,"teacher_disagreement_score":0.60483265,"about_ca_system_score_codex":0.0000325426,"about_ca_system_score_gemma":0.000008415862,"threshold_uncertainty_score":0.52494186},"labels":[],"label_agreement":null},{"id":"W2167917756","doi":"10.1287/trsc.1070.0217","title":"An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows","year":2008,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Norges Forskningsråd","keywords":"Metaheuristic; Vehicle routing problem; Simulated annealing; Mathematical optimization; Computer science; Benchmark (surveying); Integer programming; Local search (optimization); Heuristics; Heuristic; Integer (computer science); Routing (electronic design automation); Mathematics","score_opus":0.01505666634643012,"score_gpt":0.26844187007922954,"score_spread":0.25338520373279944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167917756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6718024,0.000028956078,0.32718495,0.000021297723,0.00004046094,0.00067684695,0.000017486283,0.00018449427,0.000043071144],"genre_scores_gemma":[0.8566129,0.00000620084,0.14318779,0.000028376719,0.000023918812,0.000093355135,0.00000594104,0.000026199235,0.000015302487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878746,0.000045758734,0.00025861865,0.00032204314,0.00028700178,0.00029911642],"domain_scores_gemma":[0.9983896,0.0010675914,0.00007190104,0.00019848422,0.00016438839,0.00010804001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009996586,0.00015784585,0.0001704112,0.00006543877,0.00062334986,0.0000684314,0.00020337768,0.000035398625,0.000005235608],"category_scores_gemma":[0.00016501769,0.000119159165,0.000025385414,0.00051601516,0.0003880107,0.0004192572,0.0000025873096,0.00010314896,0.0000020707423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042501964,0.000013940632,0.006539883,0.00005787425,0.000016773378,0.000007572212,0.005356669,0.95089537,0.030629007,0.000077424666,0.000002142544,0.0063608345],"study_design_scores_gemma":[0.0005045591,0.00010266433,0.15967754,0.000029747689,0.000051188646,0.000010754833,0.00010209217,0.8351968,0.004120089,0.0000249035,0.000015418043,0.00016426669],"about_ca_topic_score_codex":0.000017271148,"about_ca_topic_score_gemma":0.000018065739,"teacher_disagreement_score":0.18481049,"about_ca_system_score_codex":0.000031375974,"about_ca_system_score_gemma":0.000053181087,"threshold_uncertainty_score":0.48591697},"labels":[],"label_agreement":null},{"id":"W2168210873","doi":"10.1287/trsc.1090.0301","title":"Fifty Years of Vehicle Routing","year":2009,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":981,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Heuristics; Truck; Metaheuristic; Routing (electronic design automation); Mathematical optimization; Decomposition; Computer science; Operations research; Engineering; Mathematics; Computer network","score_opus":0.016207461148893893,"score_gpt":0.27872062482300336,"score_spread":0.2625131636741095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168210873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88151133,0.000015433645,0.11699202,0.000025738147,0.000073864976,0.000047559468,0.0000030356498,0.0001526196,0.0011783801],"genre_scores_gemma":[0.9524834,0.000005465827,0.047455937,0.000027649323,0.000008816617,6.5603524e-7,0.0000020138223,0.000004855401,0.000011202145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99929297,0.000007545733,0.0002013117,0.000109639564,0.0002467599,0.0001417658],"domain_scores_gemma":[0.99970984,0.00002640215,0.000034427307,0.00011848963,0.00006531381,0.000045542954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045770145,0.000047393834,0.00007605713,0.00008807798,0.00003951664,0.000013899265,0.0001518233,0.000021686143,0.000020099036],"category_scores_gemma":[0.000037628,0.00005626586,0.000021547581,0.0007880446,0.00007153179,0.00025946775,7.8256073e-7,0.000052035866,0.0000048116285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027864803,0.000012932862,0.0052817157,0.000009848149,0.0000019441482,0.0000016844091,0.0024108433,0.7427246,0.18118358,0.0031060602,0.000011438612,0.06525254],"study_design_scores_gemma":[0.00015659064,0.000018550732,0.7357615,0.000015455333,0.0000046969853,3.6527558e-7,0.00006670622,0.20956393,0.05406232,0.00020571904,0.00005112025,0.0000930516],"about_ca_topic_score_codex":0.000004308285,"about_ca_topic_score_gemma":0.0000016944937,"teacher_disagreement_score":0.7304798,"about_ca_system_score_codex":0.000018225212,"about_ca_system_score_gemma":0.000026891968,"threshold_uncertainty_score":0.22944552},"labels":[],"label_agreement":null},{"id":"W2168381469","doi":"10.1016/s0377-2217(99)00073-9","title":"An efficient transformation of the generalized vehicle routing problem","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":155,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Arc routing; Vehicle routing problem; Transformation (genetics); Computer science; Routing (electronic design automation); Mathematical optimization; Arc (geometry); Mathematics; Computer network","score_opus":0.05034688933492008,"score_gpt":0.33841100554714104,"score_spread":0.28806411621222094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168381469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95918447,0.00007020865,0.02530455,0.00036826573,0.00007002675,0.00015253497,0.000004046954,0.00001858323,0.014827304],"genre_scores_gemma":[0.9726346,0.000030660238,0.027020961,0.000021455768,0.0001407286,9.1929286e-7,0.0000022110305,0.000025613961,0.00012285249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967557,0.0016407704,0.00056801626,0.00007002379,0.00078427285,0.00018120016],"domain_scores_gemma":[0.99909544,0.0000933083,0.000056403867,0.00015065474,0.00052566937,0.00007855273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006502471,0.00007142254,0.000109270935,0.00011542169,0.00019772928,0.00008491101,0.00036917764,0.000018045017,0.0003398982],"category_scores_gemma":[0.000108837994,0.000051387222,0.00006396622,0.00039897207,0.000061489154,0.00021598073,0.000013249187,0.0003775215,0.000018541927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023637862,0.000032900436,0.00010120517,0.000011870728,0.000012495594,0.0000024946662,0.001423151,0.95672554,0.027587306,0.0007289427,0.00010319564,0.013247245],"study_design_scores_gemma":[0.0007344484,0.00012535954,0.007621503,0.00008171414,0.000005866999,0.00003536523,0.000115743336,0.9745666,0.01524973,0.000027646847,0.0013579839,0.000078049],"about_ca_topic_score_codex":0.0000021463802,"about_ca_topic_score_gemma":4.3266735e-7,"teacher_disagreement_score":0.017841032,"about_ca_system_score_codex":0.000062869614,"about_ca_system_score_gemma":0.00008349666,"threshold_uncertainty_score":0.3721647},"labels":[],"label_agreement":null},{"id":"W2170216278","doi":"10.1287/trsc.35.3.286.10153","title":"Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems","year":2001,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":194,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew scheduling; Scheduling (production processes); Column generation; Mathematical optimization; Homogeneous; Computer science; Crew; Heuristic; Branch and bound; Job shop scheduling; Operations research; Engineering; Mathematics; Schedule","score_opus":0.015211003904855951,"score_gpt":0.26064639540075274,"score_spread":0.2454353914958968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170216278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69623727,0.00018796243,0.3028174,0.000024318397,0.000103304985,0.000108910834,0.000002688703,0.00015416907,0.000363964],"genre_scores_gemma":[0.9745452,0.0000728049,0.025294768,0.000016488988,0.000017342538,0.0000067208703,0.0000028647557,0.000015237459,0.000028598939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989633,0.000022322505,0.00027527616,0.00022532578,0.00026275692,0.00025103844],"domain_scores_gemma":[0.9996052,0.00009425612,0.000025456782,0.00011726491,0.00006246607,0.00009535802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063269865,0.000099431316,0.0001262238,0.00018056248,0.000084974316,0.00007321506,0.00013175701,0.000046341287,0.000010251705],"category_scores_gemma":[0.00004052563,0.000109867025,0.00001400907,0.0010295223,0.00010302744,0.00037371385,9.638601e-7,0.000107385815,0.000004765418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039914667,0.000004379386,0.016766535,0.000027746939,0.0000012989735,0.00001830896,0.0013230279,0.95778126,0.02233081,0.00024128308,4.2559356e-7,0.0015009108],"study_design_scores_gemma":[0.00027244462,0.000009525897,0.02700888,0.000037955248,0.000004767232,0.000003824136,0.0002437881,0.97091496,0.001261985,0.000021274307,0.00008975247,0.00013086619],"about_ca_topic_score_codex":0.00003630184,"about_ca_topic_score_gemma":0.000029150899,"teacher_disagreement_score":0.2783079,"about_ca_system_score_codex":0.000046732617,"about_ca_system_score_gemma":0.000030573017,"threshold_uncertainty_score":0.44802472},"labels":[],"label_agreement":null},{"id":"W2170296950","doi":"10.1287/ijoc.1040.0128","title":"A Memetic Heuristic for the Generalized Quadratic Assignment Problem","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Heuristic; Memetic algorithm; Assignment problem; Generalized assignment problem; Generalization; Integer programming; Matrix (chemical analysis); Mathematics; Weapon target assignment problem; Computer science; Branch and bound; Linear bottleneck assignment problem; Container (type theory); Linear programming; Quadratic equation; Local search (optimization); Optimization problem; Engineering","score_opus":0.01745726383268033,"score_gpt":0.2652813078728558,"score_spread":0.24782404404017547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170296950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024723345,0.00017744182,0.9720003,0.00022714082,0.0006333775,0.00034617443,0.0000014683385,0.00017844561,0.0017122843],"genre_scores_gemma":[0.7295361,0.000014062401,0.26938608,0.00021321334,0.00065945374,0.000012493571,0.000002988814,0.000045784287,0.00012981023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855083,0.000043332653,0.0006571367,0.00009239393,0.00028972697,0.0003665878],"domain_scores_gemma":[0.9988254,0.0006645376,0.00018932608,0.0001566624,0.00009872171,0.00006538806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012891544,0.00017969031,0.00020245464,0.000107161344,0.00041873427,0.00028374328,0.00023409852,0.000053812437,0.000020048978],"category_scores_gemma":[0.00012121406,0.00011734877,0.00012177089,0.00019656247,0.000021352664,0.00010789144,0.000025517116,0.000320468,0.000012095157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007714146,0.000010871633,0.00008173106,0.00003272508,0.00003830988,0.000002533853,0.00014794483,0.9730141,0.00013222305,0.0014783244,0.0012758654,0.023777625],"study_design_scores_gemma":[0.00075710524,0.00006915939,0.0003464642,0.00008653425,0.000030337924,0.000084555286,0.00004433519,0.9919852,0.00042689292,0.0014249411,0.004572825,0.00017165444],"about_ca_topic_score_codex":0.0000046377013,"about_ca_topic_score_gemma":0.0000011271555,"teacher_disagreement_score":0.70481277,"about_ca_system_score_codex":0.00016505238,"about_ca_system_score_gemma":0.000033517015,"threshold_uncertainty_score":0.4785344},"labels":[],"label_agreement":null},{"id":"W2170951393","doi":"10.1287/trsc.1120.0454","title":"Designing Production-Inventory-Transportation Systems with Capacitated Cross-Docks","year":2013,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Column generation; Truck; Mathematical optimization; Integer programming; Cutting stock problem; Safety stock; Supply chain; Transportation theory; Facility location problem; Computer science; Operations research; Fixed charge; Nonlinear programming; Linear programming; Set (abstract data type); Optimization problem; Nonlinear system; Mathematics; Engineering","score_opus":0.01946998476016498,"score_gpt":0.2618670104765673,"score_spread":0.24239702571640231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170951393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68844163,0.00003216568,0.3098031,0.000022149809,0.0004083073,0.000427837,0.00000643671,0.00052305526,0.0003353215],"genre_scores_gemma":[0.9527215,0.0000078839,0.046870016,0.000012688756,0.00004047423,0.00012224026,0.000038740054,0.00003652732,0.0001499562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9981532,0.000029680019,0.00043625795,0.00039399404,0.0006106324,0.00037621372],"domain_scores_gemma":[0.99884397,0.000031936197,0.00010231748,0.00025139528,0.00061298657,0.00015740612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063966814,0.00018753888,0.00016379493,0.00024030097,0.00028849216,0.00023735302,0.00022331254,0.00005873009,0.00007097229],"category_scores_gemma":[0.00003588372,0.00017548013,0.000027975428,0.0015075067,0.0003280803,0.0017668172,6.1929745e-7,0.000150803,0.000048707927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041726857,0.000009187992,0.043866348,0.000064100794,0.000008698199,0.0000018725643,0.001683892,0.9161183,0.03780263,0.00018402781,0.00003868727,0.00021807659],"study_design_scores_gemma":[0.00066201494,0.00007154513,0.55605555,0.0001771051,0.00004620243,0.000008719174,0.0011264943,0.35840404,0.082514,0.0001052496,0.00012511395,0.00070399925],"about_ca_topic_score_codex":0.00014306004,"about_ca_topic_score_gemma":0.000033239594,"teacher_disagreement_score":0.5577143,"about_ca_system_score_codex":0.00009517271,"about_ca_system_score_gemma":0.00009256057,"threshold_uncertainty_score":0.7155872},"labels":[],"label_agreement":null},{"id":"W2171349556","doi":"10.1504/ijstl.2010.033508","title":"An airfreight forwarder's shipment planning: simultaneous decisions on job, route and agent selection","year":2010,"lang":"en","type":"article","venue":"International Journal of Shipping and Transport Logistics","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":"University of British Columbia","funders":"","keywords":"Selection (genetic algorithm); Profit (economics); Variety (cybernetics); Computer science; Plan (archaeology); Forwarder; Operations research; Business; Destinations; Function (biology); Operations management; Microeconomics; Tourism; Economics","score_opus":0.027137626681478507,"score_gpt":0.30183404629131744,"score_spread":0.2746964196098389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171349556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5212843,0.00005841397,0.47742376,0.00009823568,0.0008102489,0.000035648933,0.000012904101,0.000041850908,0.00023467747],"genre_scores_gemma":[0.9410879,0.00019097063,0.058337875,0.000064092324,0.00027553702,8.6758297e-7,0.000009204518,0.000020122512,0.000013399761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990158,0.000022012102,0.00039673506,0.00011788874,0.0003188886,0.00012867781],"domain_scores_gemma":[0.9991332,0.00031411712,0.000106995685,0.00006759326,0.00023205415,0.00014601239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004054196,0.00013096255,0.00015937584,0.00019084643,0.00007374451,0.000067969966,0.00015424687,0.00009572945,0.000013466046],"category_scores_gemma":[0.00020460329,0.00012068481,0.00004108266,0.000050720333,0.000045419663,0.00011663562,0.000005792951,0.00043830514,6.381093e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006696949,0.000046027213,0.029498884,0.000008700621,0.00011759224,0.000193968,0.0005293174,0.948164,0.0014674283,0.00067510805,0.000012206674,0.01921983],"study_design_scores_gemma":[0.0012738878,0.00036101567,0.0832635,0.0002859226,0.00012469468,0.000710355,0.00016627037,0.90642667,0.0013997582,0.0018132357,0.0037989912,0.00037569422],"about_ca_topic_score_codex":0.0000055295277,"about_ca_topic_score_gemma":0.000020326477,"teacher_disagreement_score":0.41980365,"about_ca_system_score_codex":0.000044129494,"about_ca_system_score_gemma":0.000027461736,"threshold_uncertainty_score":0.4921384},"labels":[],"label_agreement":null},{"id":"W2177426957","doi":"10.1179/1942787514y.0000000042","title":"A case study of snow plow routing using an adaptive large hood search metaheuristic","year":2015,"lang":"en","type":"article","venue":"Transportation Letters","topic":"Vehicle Routing Optimization Methods","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":true,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Metaheuristic; Workload; Routing (electronic design automation); Computer science; Hierarchy; Local search (optimization); Work (physics); Transport engineering; Operations research; Artificial intelligence; Engineering; Computer network","score_opus":0.09827727275834967,"score_gpt":0.3182714321715683,"score_spread":0.2199941594132186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177426957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.583935,0.000005655144,0.415626,0.000008878748,0.00006943592,0.00020083207,0.000016368542,0.00012986184,0.000007952464],"genre_scores_gemma":[0.94166905,3.4594015e-7,0.058160786,0.000039658247,0.00004009493,0.000008541803,0.000025106692,0.000054759992,0.0000016594095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858123,0.00020730196,0.00042050562,0.00021297205,0.0003200572,0.00025791288],"domain_scores_gemma":[0.99936897,0.00007821937,0.000072639756,0.00021567744,0.00013101194,0.00013347805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007516371,0.00016196871,0.00024452247,0.00016579083,0.00007029396,0.000020667105,0.00009665169,0.00004795652,0.000011636177],"category_scores_gemma":[0.000029996,0.00018436548,0.000041834206,0.00040524182,0.000020296868,0.00029176573,0.0000029259847,0.00017807707,0.0000018657456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018834888,0.00014642868,0.007076431,0.000023648803,0.00007649546,0.0005086735,0.029802362,0.9601506,0.0017914235,0.000019490417,0.00000552147,0.000380068],"study_design_scores_gemma":[0.0017661995,0.00018265829,0.0032640863,0.00002584376,0.00017884796,0.00008850191,0.024052562,0.9685518,0.0016311911,0.0000036986216,0.0000019601064,0.0002526556],"about_ca_topic_score_codex":0.0003386307,"about_ca_topic_score_gemma":0.00020371421,"teacher_disagreement_score":0.35773402,"about_ca_system_score_codex":0.00006723519,"about_ca_system_score_gemma":0.000028443847,"threshold_uncertainty_score":0.7518206},"labels":[],"label_agreement":null},{"id":"W2186075603","doi":"10.1007/978-3-319-09129-7_20","title":"A Multi-start Tabu Search Approach for Solving the Information Routing Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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 Victoria","funders":"","keywords":"Tabu search; Computer science; Routing (electronic design automation); Guided Local Search; Vehicle routing problem; Mathematical optimization; Algorithm; Computer network; Mathematics","score_opus":0.030398284504125416,"score_gpt":0.26339126101884625,"score_spread":0.23299297651472084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186075603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019841149,0.00005607642,0.9968537,0.000079924415,0.0003758833,0.00084978726,0.000005377768,0.00023225826,0.0015271682],"genre_scores_gemma":[0.03646247,0.000006630243,0.9628671,0.0002409637,0.00025924735,0.000029017017,0.000020122714,0.000043666776,0.00007077888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821895,0.000026404761,0.00044992502,0.0003681668,0.000442571,0.0004939778],"domain_scores_gemma":[0.9985878,0.0005342137,0.000116925934,0.0004785245,0.00021873534,0.00006381554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002522281,0.00030268074,0.00028097178,0.00032863475,0.00031146695,0.00040141973,0.00084430916,0.00022441773,0.000004121156],"category_scores_gemma":[0.00017995926,0.00024149171,0.00007785622,0.00028401279,0.00020727956,0.00032434912,0.00024406506,0.0006559921,0.0000061536543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012090117,0.000001723418,0.000014012409,0.00010772854,0.000005277506,1.3287683e-7,0.0012054461,0.8119091,0.000057720994,0.0005387516,0.000006670975,0.18615228],"study_design_scores_gemma":[0.0001985476,0.00002187969,0.000017422804,0.00013808825,0.0000067906262,0.000007966906,0.0000010655372,0.9977462,0.0003853822,0.0006190406,0.0005754461,0.0002821597],"about_ca_topic_score_codex":0.000006716693,"about_ca_topic_score_gemma":0.000005554661,"teacher_disagreement_score":0.18587011,"about_ca_system_score_codex":0.00021386165,"about_ca_system_score_gemma":0.000111829846,"threshold_uncertainty_score":0.9847746},"labels":[],"label_agreement":null},{"id":"W2186282916","doi":"","title":"Modeling and Solving a Multimodal Routing Problem with Timetables and Time Windows","year":2008,"lang":"en","type":"article","venue":"","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":"Université de Montréal; HEC Montréal","funders":"","keywords":"Column generation; Heuristics; Vehicle routing problem; Computer science; Mathematical optimization; Flow network; Cutting-plane method; Pickup; Integer programming; Routing (electronic design automation); Scheduling (production processes); Mathematics; Artificial intelligence; Computer network","score_opus":0.013010784106900925,"score_gpt":0.2151223155670533,"score_spread":0.20211153146015237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186282916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35919875,0.00017526021,0.6353389,0.000017670378,0.00000912019,0.00015063485,8.7121475e-7,0.00036558794,0.0047431667],"genre_scores_gemma":[0.5499012,0.000022397917,0.449825,0.000011701999,0.000017816661,0.0000046212676,0.0000012443305,0.000030029982,0.00018601041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992178,0.000030131652,0.00018712175,0.000204416,0.00010823253,0.0002523062],"domain_scores_gemma":[0.99968517,0.000066967164,0.000018467263,0.000107264736,0.00003821459,0.00008392156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025591,0.00016060102,0.00019508584,0.000071676644,0.00017051495,0.00004796926,0.000046010802,0.000059805825,0.000027845554],"category_scores_gemma":[0.000026851118,0.00013892779,0.000013168345,0.00012893419,0.00003653479,0.00025055758,0.00004258084,0.00012430815,0.000004069294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044029575,0.0000045432803,0.002303197,0.000025688701,0.000024702349,0.000003910943,0.00059900625,0.9923996,0.0022376904,0.000048967227,0.00000818444,0.0023401584],"study_design_scores_gemma":[0.00042963555,0.0000173932,0.00015726595,0.000041108236,0.000014752734,0.00010888685,0.000050307382,0.9980574,0.0008924943,0.00002160222,0.000009446002,0.00019971112],"about_ca_topic_score_codex":0.00004583224,"about_ca_topic_score_gemma":0.0000038001585,"teacher_disagreement_score":0.19070244,"about_ca_system_score_codex":0.000017448423,"about_ca_system_score_gemma":0.000013311655,"threshold_uncertainty_score":0.56653106},"labels":[],"label_agreement":null},{"id":"W2186951678","doi":"","title":"AN ANALYSIS OF THE ASSIGNMENT OF DELIVERY ROUTES TO VEHICLE DRIVERS IN STOCHASTIC VEHICLE ROUTING OPERATIONS","year":2004,"lang":"en","type":"article","venue":"","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":"Wilfrid Laurier University","funders":"","keywords":"Vehicle routing problem; Markov decision process; Operations research; Routing (electronic design automation); Markov chain; Markov process; Computer science; Range (aeronautics); Transport engineering; Engineering; Computer network","score_opus":0.011922643264747722,"score_gpt":0.25698144603733136,"score_spread":0.24505880277258363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186951678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.603368,0.00000503284,0.39630556,0.000048765036,0.00002835437,0.00010830122,0.00000575825,0.00003793416,0.000092332055],"genre_scores_gemma":[0.9579,0.0000012399247,0.042013023,0.000040659954,0.000006988719,0.000007630373,0.0000032620053,0.000014654255,0.000012572356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999045,0.00007426465,0.00037128382,0.00014599759,0.00019868757,0.00016477749],"domain_scores_gemma":[0.9994472,0.00007401161,0.00003508987,0.00031404966,0.00007204041,0.000057560283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330874,0.000099029814,0.00022468771,0.00025774573,0.00004865096,0.000017055738,0.00021679806,0.000047540278,0.000035139372],"category_scores_gemma":[0.00008372032,0.000085995795,0.00007941049,0.0014984319,0.000026351141,0.00013499949,0.000044103195,0.000084198655,0.0000018006119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002057395,0.00004026356,0.013943095,0.0000037231393,0.0000815122,1.9396337e-7,0.0014175357,0.9368024,0.046754792,0.0005396393,7.1357493e-7,0.00041409006],"study_design_scores_gemma":[0.00025453165,0.00002456016,0.07783476,0.000023262126,0.00010455275,1.0755344e-7,0.00065752224,0.8958638,0.02513807,0.000011496557,3.7141007e-7,0.00008697161],"about_ca_topic_score_codex":0.00053493655,"about_ca_topic_score_gemma":0.0006807235,"teacher_disagreement_score":0.354532,"about_ca_system_score_codex":0.00017706335,"about_ca_system_score_gemma":0.00003417873,"threshold_uncertainty_score":0.35068068},"labels":[],"label_agreement":null},{"id":"W2188576392","doi":"10.1287/ijoc.2015.0649","title":"Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure","year":2015,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Quadratic equation; Algorithm; Branch and cut; Heuristic; Routing (electronic design automation); Mathematical optimization; Metaheuristic; Computer science; Mathematics; Integer programming","score_opus":0.028336016636880533,"score_gpt":0.2709757504084353,"score_spread":0.24263973377155476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188576392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4681973,0.00007702053,0.5304961,0.000051268562,0.000348521,0.00027032182,0.0000061384335,0.00020734887,0.00034595822],"genre_scores_gemma":[0.8476591,0.0000041394887,0.15196204,0.00007957431,0.0002209518,0.0000020090868,0.0000063492457,0.000053739168,0.000012104647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852425,0.000046369372,0.00052957947,0.00015244498,0.00030859606,0.00043875078],"domain_scores_gemma":[0.998784,0.00028373956,0.00022733158,0.00013107418,0.00028805845,0.00028581664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009465346,0.00025163637,0.00029723733,0.00015918206,0.0002678133,0.00033958087,0.00014318692,0.000095452866,0.0000029808252],"category_scores_gemma":[0.00035130052,0.00019188321,0.00003784194,0.00027363875,0.00004806526,0.00033755534,0.000027356136,0.00053144817,0.0000023047307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026572086,0.0000070939077,0.0013149343,0.00006470183,0.000058243742,0.00000949767,0.0016945439,0.95417523,0.00017415115,0.00011631202,0.00008745556,0.042271234],"study_design_scores_gemma":[0.0016575198,0.000335886,0.0006363564,0.00034894675,0.000022462078,0.00044091302,0.00043739125,0.99496305,0.00038576842,0.0002829168,0.000198787,0.00029000986],"about_ca_topic_score_codex":0.0000059835165,"about_ca_topic_score_gemma":0.000003162899,"teacher_disagreement_score":0.37946182,"about_ca_system_score_codex":0.00023891451,"about_ca_system_score_gemma":0.00006970061,"threshold_uncertainty_score":0.782477},"labels":[],"label_agreement":null},{"id":"W2189140217","doi":"10.4018/978-1-61350-086-6.ch002","title":"Vehicle Routing Models and Algorithms for Winter Road Spreading Operations","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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":"Routing (electronic design automation); Truck; Key (lock); Computer science; Vehicle routing problem; Limiting; Transport engineering; Operations research; Engineering; Computer network; Computer security","score_opus":0.04654899351961165,"score_gpt":0.27824678453282164,"score_spread":0.23169779101321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189140217","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000110630084,0.00019431079,0.4379618,0.00000793169,0.00029806,0.0003801412,0.00011790981,0.00035966045,0.5605696],"genre_scores_gemma":[0.42402747,0.000039432594,0.5004225,0.00030474935,0.001003707,0.00014869325,0.00003822769,0.00052388344,0.07349136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986552,0.000017423721,0.00043831716,0.0003937601,0.00014475886,0.00035051903],"domain_scores_gemma":[0.9993166,0.00004503367,0.000061897954,0.0003160216,0.000118356176,0.00014209987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024712103,0.00040312076,0.00042264131,0.000068533045,0.00015092535,0.00012981467,0.00018450391,0.00038782574,0.000018602706],"category_scores_gemma":[0.000026494738,0.0004536685,0.00013508674,0.000014913076,0.000050082494,0.00012817784,0.000094581635,0.000242336,0.00001537106],"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.0000097710845,0.00000360807,0.0000066201674,0.000084628744,0.00017593583,0.000005407019,0.00041296278,0.112879515,0.000092706025,0.84154665,0.00025140817,0.04453077],"study_design_scores_gemma":[0.0004251192,0.000038825612,0.000006702776,0.00026966791,0.000118134754,0.000024850699,0.000013555494,0.9157898,0.0002091494,0.081361175,0.0011497097,0.0005933199],"about_ca_topic_score_codex":0.000038433165,"about_ca_topic_score_gemma":0.000026839107,"teacher_disagreement_score":0.80291027,"about_ca_system_score_codex":0.00017863586,"about_ca_system_score_gemma":0.000039243343,"threshold_uncertainty_score":0.9997915},"labels":[],"label_agreement":null},{"id":"W2204163060","doi":"10.1016/j.cor.2015.12.013","title":"The Steiner traveling salesman problem with online advanced edge blockages","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Zhejiang Sci-Tech University; National Natural Science Foundation of China; China Postdoctoral Science Foundation; Alberta Innovates - Technology Futures; Genome Canada; Southern Taiwan Science Park; Georgia Southern University","keywords":"Travelling salesman problem; Enhanced Data Rates for GSM Evolution; Computer science; Competitive analysis; Mathematical optimization; Upper and lower bounds; Online algorithm; Service (business); Steiner tree problem; Mathematics; Algorithm; Telecommunications; Economics","score_opus":0.08018762853346349,"score_gpt":0.36395403354220485,"score_spread":0.28376640500874134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204163060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18028516,0.00062985055,0.8139282,0.0018298414,0.00028080202,0.00079569384,0.000009631862,0.00045732156,0.0017835394],"genre_scores_gemma":[0.4058548,0.00009906216,0.59246916,0.000030608557,0.00022831834,0.00007999619,0.000043530636,0.00006520211,0.0011293023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998322,0.00030636677,0.00024731297,0.00022483805,0.000473284,0.00042617918],"domain_scores_gemma":[0.99843735,0.0002953116,0.000009674085,0.00041524586,0.00067006645,0.00017237867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013619711,0.00013751978,0.00013251654,0.00012514132,0.0005465888,0.00033987864,0.00040429272,0.000053532498,0.000004326868],"category_scores_gemma":[0.00012664,0.000097494034,0.000022678283,0.0007371753,0.00013610942,0.00018744727,0.00010160283,0.00047408824,0.000026078143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008792156,0.000024788424,0.00006987746,0.000011466624,0.000024282139,0.0000037622062,0.00075041543,0.9718061,0.0006272318,0.00052441924,0.0012831369,0.024865735],"study_design_scores_gemma":[0.00055032637,0.00010711702,0.00020254265,0.00005221805,0.0000041543262,0.000011377315,0.0005279723,0.9908947,0.0007347427,0.000032651737,0.0067385626,0.00014367171],"about_ca_topic_score_codex":0.0000152135535,"about_ca_topic_score_gemma":0.00017237685,"teacher_disagreement_score":0.22556964,"about_ca_system_score_codex":0.00013414188,"about_ca_system_score_gemma":0.00016132633,"threshold_uncertainty_score":0.42039743},"labels":[],"label_agreement":null},{"id":"W2214969595","doi":"10.1287/opre.2016.1535","title":"Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"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","funders":"","keywords":"Vehicle routing problem; Routing (electronic design automation); Computer science; Battery (electricity); Groundwater recharge; Extension (predicate logic); Algorithm; Mathematical optimization; Real-time computing; Engineering; Mathematics; Computer network; Power (physics)","score_opus":0.05546575356943034,"score_gpt":0.34658538942623596,"score_spread":0.2911196358568056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214969595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069761515,0.00011391142,0.9223574,0.0009715294,0.0000638144,0.0017359914,0.00002855184,0.0005158722,0.0044514635],"genre_scores_gemma":[0.79040176,0.00007513933,0.19776699,0.000022117949,0.00033803072,0.00092334324,0.000027381555,0.0001686075,0.010276658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982421,0.00020538103,0.0002475421,0.00028704433,0.0003988431,0.0006191025],"domain_scores_gemma":[0.99849504,0.000534825,0.000010453429,0.00033242084,0.0005109879,0.00011629198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018515736,0.00013936227,0.00015663264,0.00029731065,0.00044961012,0.00017818814,0.00023015999,0.00009047033,0.00016875623],"category_scores_gemma":[0.0004351534,0.00009664925,0.000034265588,0.0009372238,0.000054120814,0.00031119256,0.00003543287,0.00022632458,0.00020302949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018217761,0.00004382035,0.00027603307,0.000041140338,0.00005922487,0.0000020940126,0.00028444306,0.58022237,0.35262594,0.000708199,0.0010170079,0.06470151],"study_design_scores_gemma":[0.0007274638,0.00015982175,0.00017005925,0.00006876828,0.0000058001547,0.0000069831026,0.000019557869,0.97382253,0.023256281,0.000038649712,0.001545704,0.00017835503],"about_ca_topic_score_codex":0.000018144108,"about_ca_topic_score_gemma":0.000016668411,"teacher_disagreement_score":0.72459036,"about_ca_system_score_codex":0.00020297631,"about_ca_system_score_gemma":0.00012976644,"threshold_uncertainty_score":0.3941242},"labels":[],"label_agreement":null},{"id":"W2216088815","doi":"10.2139/ssrn.2724060","title":"Airfreight Forwarding Under System-Wide and Double Discounts","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Business; Commerce; Computer science","score_opus":0.016906695179991806,"score_gpt":0.24994967460103837,"score_spread":0.23304297942104657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216088815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14526483,0.0037693477,0.8431043,0.00019346243,0.000511737,0.00010909057,9.303398e-7,0.00022961275,0.006816662],"genre_scores_gemma":[0.9943693,0.00045708063,0.0042825886,0.000020697598,0.0002211595,0.000003815177,0.0000015488584,0.000051233874,0.0005925642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980733,0.000060516773,0.0002495494,0.00012697525,0.00022777297,0.0012618811],"domain_scores_gemma":[0.999542,0.000043916374,0.00005758033,0.00012874421,0.000068842295,0.00015891588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020206077,0.00015017332,0.0001857369,0.00010877069,0.00012267669,0.000108826345,0.00013811515,0.000075626514,0.0000044352505],"category_scores_gemma":[0.0000338794,0.00013642131,0.000044758577,0.00016252646,0.00002028118,0.00029893708,0.000028754685,0.00086156296,0.00001819928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006906993,0.000020972851,0.007871016,0.00009089796,0.00048268877,0.000011166847,0.0006419832,0.7353161,0.00037741146,0.24743137,0.0007323373,0.006954967],"study_design_scores_gemma":[0.013693704,0.0005177681,0.001304379,0.00048192387,0.00043066335,0.0070986263,0.027370578,0.78824943,0.0024745818,0.14979073,0.0064354255,0.0021521621],"about_ca_topic_score_codex":0.000014563961,"about_ca_topic_score_gemma":0.00004354045,"teacher_disagreement_score":0.84910446,"about_ca_system_score_codex":0.001379525,"about_ca_system_score_gemma":0.0003820291,"threshold_uncertainty_score":0.55630994},"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,"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; É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","score_opus":0.014529178717328553,"score_gpt":0.22272130247434482,"score_spread":0.20819212375701626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225208082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07686471,0.00013327633,0.92050606,0.0015841237,0.00009921256,0.00015539794,0.000019146735,0.0001415982,0.00049649813],"genre_scores_gemma":[0.9826524,0.00015183771,0.016618652,0.00017049274,0.00006901153,0.0000024753726,0.000002950895,0.000035851284,0.00029627618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992791,0.00005430796,0.00023888588,0.000104355975,0.00015394788,0.00016942967],"domain_scores_gemma":[0.99929583,0.00035303392,0.00008074224,0.000073522446,0.00009836323,0.00009851399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003622695,0.000121764984,0.00011112671,0.00003607678,0.00023408748,0.000091216316,0.00006311928,0.000037273792,0.000019164667],"category_scores_gemma":[0.0000516499,0.000067851324,0.000014352914,0.00010126455,0.000053432334,0.000091899754,0.0000014566184,0.00017124847,0.000008961212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017313192,0.000022565406,0.0029057374,0.000055884528,0.00009507776,0.000039110644,0.0011132811,0.9481926,0.0045912345,0.0041003446,0.00021972913,0.038491316],"study_design_scores_gemma":[0.0061403047,0.00085145544,0.18768351,0.0009721879,0.00033051358,0.00029022555,0.0004131911,0.79352444,0.0012169611,0.0023572198,0.0051367013,0.0010832712],"about_ca_topic_score_codex":9.070453e-7,"about_ca_topic_score_gemma":0.000005694441,"teacher_disagreement_score":0.90578777,"about_ca_system_score_codex":0.000016095713,"about_ca_system_score_gemma":0.000016664166,"threshold_uncertainty_score":0.27668965},"labels":[],"label_agreement":null},{"id":"W2230461717","doi":"10.1007/s10479-015-2091-2","title":"Exact and heuristic approaches for the cycle hub location problem","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Metaheuristic; Theory of computation; Heuristic; Tree (set theory); Steiner tree problem; Network topology; Tree network; Set (abstract data type); Flow network; Branch and bound; Network planning and design; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.2801187575592472,"score_gpt":0.42866052791683307,"score_spread":0.14854177035758587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230461717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042337507,0.00093711814,0.94749373,0.006952103,0.00003391028,0.00088895054,0.00002184029,0.000065322434,0.0012694922],"genre_scores_gemma":[0.9721858,0.00042283593,0.02663251,0.000011901922,0.00004887631,0.00020289152,0.0000039159145,0.000018628838,0.000472641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924314,0.00012358896,0.00016651503,0.00011242456,0.00016971443,0.00018461951],"domain_scores_gemma":[0.99853206,0.00077735697,0.0000080324435,0.00020875905,0.000435367,0.000038411425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001819282,0.000054876717,0.00007383781,0.00009757031,0.00022045993,0.000059711947,0.00012508463,0.00003789355,0.000018370309],"category_scores_gemma":[0.0007092951,0.000033479795,0.000017477882,0.00027115032,0.00011289907,0.0001490664,0.000030709383,0.00007279847,0.0000060445755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010531389,0.000029663199,0.00016435151,0.00012531587,0.000041695792,9.860401e-8,0.0004965828,0.8718409,0.003612077,0.013197976,0.0017832002,0.10869763],"study_design_scores_gemma":[0.00018180588,0.000054730728,0.0015642935,0.000045935474,0.000004197638,0.000001342935,0.00012980252,0.9850655,0.010595365,0.0009346616,0.0013517735,0.00007059455],"about_ca_topic_score_codex":0.000018361727,"about_ca_topic_score_gemma":0.000016106407,"teacher_disagreement_score":0.9298483,"about_ca_system_score_codex":0.000010866174,"about_ca_system_score_gemma":0.000038115173,"threshold_uncertainty_score":0.16956218},"labels":[],"label_agreement":null},{"id":"W2233419640","doi":"10.1016/j.cor.2015.06.001","title":"Time-dependent routing problems: A review","year":2015,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":244,"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":"Tree traversal; Arc routing; Computer science; Time horizon; Routing (electronic design automation); Graph traversal; Arc (geometry); Point (geometry); Graph; Vehicle routing problem; Point of interest; Field (mathematics); Operations research; Node (physics); Mathematical optimization; Algorithm; Artificial intelligence; Theoretical computer science; Computer network; Mathematics","score_opus":0.1917023661751183,"score_gpt":0.44913487507889294,"score_spread":0.25743250890377467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233419640","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.2169e-8,0.916354,0.07774267,0.00006758,0.00032701247,0.0025104606,0.000028985129,0.00054730946,0.0024218755],"genre_scores_gemma":[2.6264004e-7,0.9533417,0.043614347,0.000031618772,0.00033537022,0.0005362658,0.00030414012,0.0001906635,0.0016456152],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944676,0.0020362192,0.0011089884,0.0006078926,0.0010269642,0.00075233955],"domain_scores_gemma":[0.9972813,0.00046234083,0.000050848048,0.0010380136,0.0008611045,0.0003063548],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0070578116,0.00048164555,0.001596091,0.0006263035,0.00035077563,0.00041390458,0.0010691246,0.0003117438,0.00017483174],"category_scores_gemma":[0.0005357014,0.0004447872,0.0002595306,0.0019144777,0.000110472305,0.00022424212,0.0004819832,0.0016004952,0.0021039064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4457152e-7,0.00001969172,3.5315185e-8,0.022853894,0.00009426305,0.000008361607,0.00009095002,0.21891548,3.479218e-7,0.00004302849,0.023781953,0.73419183],"study_design_scores_gemma":[0.00007107875,0.00002023852,1.2010001e-8,0.03641974,0.00008586357,0.000043348184,0.0000042396396,0.3131282,2.6608095e-7,0.0000028058446,0.6499253,0.00029890286],"about_ca_topic_score_codex":0.000011449817,"about_ca_topic_score_gemma":0.0000043788614,"teacher_disagreement_score":0.7338929,"about_ca_system_score_codex":0.00086091243,"about_ca_system_score_gemma":0.0007726791,"threshold_uncertainty_score":0.9998004},"labels":[],"label_agreement":null},{"id":"W2250014226","doi":"10.5555/2722129.2722164","title":"Linear programming-based approximation algorithms for multi-vehicle minimum latency problems: extended abstract","year":2015,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","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":"University of Waterloo","funders":"","keywords":"Rounding; Approximation algorithm; Linear programming; Latency (audio); Leverage (statistics); Computer science; Mathematical optimization; Vehicle routing problem; Algorithm; Mathematics; Routing (electronic design automation); Computer network; Artificial intelligence; Telecommunications","score_opus":0.05793689123546252,"score_gpt":0.31696333685336847,"score_spread":0.25902644561790594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2250014226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045836032,0.00021645523,0.98820966,0.00048079956,0.0010133159,0.002570213,0.00013798359,0.0018470365,0.0009409321],"genre_scores_gemma":[0.07465415,0.000022178147,0.9227457,0.00010218589,0.0004672987,0.0009126606,0.00042954242,0.00028023907,0.00038602485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696416,0.00010547341,0.0008135645,0.0006894328,0.0005851077,0.0008422451],"domain_scores_gemma":[0.99819636,0.00015871829,0.00020804157,0.00062230864,0.00038700516,0.00042757866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012068065,0.00055774325,0.00048897177,0.0002679932,0.00017332968,0.00017348984,0.00040834962,0.00033607156,0.000016142727],"category_scores_gemma":[0.00018469013,0.00054401637,0.00022783809,0.0005216062,0.00009358278,0.00038957823,0.000043385768,0.00037123318,0.00006998212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000834486,0.00038605722,0.00010285729,0.00042031507,0.00011252922,0.000009042432,0.00094702124,0.944911,0.0047690975,0.000100513054,0.00047515339,0.04768297],"study_design_scores_gemma":[0.0033032778,0.00044264307,0.00015488247,0.000121978796,0.000058730835,0.000004587068,0.00014121058,0.9793668,0.012608415,0.000119957986,0.0029937555,0.0006838033],"about_ca_topic_score_codex":0.000022156453,"about_ca_topic_score_gemma":0.000004507473,"teacher_disagreement_score":0.07007055,"about_ca_system_score_codex":0.00025646295,"about_ca_system_score_gemma":0.00012353691,"threshold_uncertainty_score":0.99970114},"labels":[],"label_agreement":null},{"id":"W2252993480","doi":"10.5539/mas.v10n4p128","title":"A Heuristic and Exact Method: Integrated Aircraft Routing and Crew Pairing Problem","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Crew; Computer science; Heuristic; Integer programming; Routing (electronic design automation); Crew scheduling; Mathematical optimization; Particle swarm optimization; Operations research; Pairing; Heuristics; Mathematics; Algorithm; Engineering; Aeronautics; Artificial intelligence; Computer network","score_opus":0.014067659575462457,"score_gpt":0.2548301235589542,"score_spread":0.24076246398349171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252993480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05191375,0.00006283827,0.9444013,0.00006614676,0.000039751507,0.00018028649,0.000002209922,0.00042200682,0.0029116701],"genre_scores_gemma":[0.6242524,0.000012658701,0.3756282,0.000021614365,0.000012189631,0.000013450238,2.0128937e-7,0.000019621126,0.000039690138],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865484,0.00003971786,0.00022604987,0.0004446457,0.0002311131,0.00040361373],"domain_scores_gemma":[0.9992898,0.00024664964,0.00004299966,0.00021500072,0.0000473501,0.00015820091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017281722,0.00017355656,0.00018598478,0.00014345051,0.00021743913,0.00013720192,0.00019821279,0.00005475706,0.000008603597],"category_scores_gemma":[0.00017240665,0.00013027493,0.0000127881085,0.00043821064,0.0002417276,0.00021906367,0.00013101545,0.00012678327,0.0000049765013],"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.0000048038023,0.0000055083156,0.0008949684,0.000041275605,0.0000064205647,0.0000016291026,0.00077389646,0.02002207,0.66278076,0.0014550147,0.00000891206,0.31400475],"study_design_scores_gemma":[0.0002685015,0.000009398478,0.001232088,0.000070919,0.000008171958,0.000014506631,0.000048004244,0.98302424,0.012964674,0.002079219,0.00006293023,0.00021734287],"about_ca_topic_score_codex":0.0000070055025,"about_ca_topic_score_gemma":0.000002274903,"teacher_disagreement_score":0.96300215,"about_ca_system_score_codex":0.000084943524,"about_ca_system_score_gemma":0.00004089648,"threshold_uncertainty_score":0.53124577},"labels":[],"label_agreement":null},{"id":"W2259887679","doi":"10.1007/s11067-015-9311-9","title":"Spatial Analysis of Single Allocation Hub Location Problems","year":2015,"lang":"en","type":"article","venue":"Networks and Spatial Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"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":"Computer science; Operations research; Transport engineering; Mathematical optimization; Engineering; Mathematics","score_opus":0.02169642552667028,"score_gpt":0.22219142139101855,"score_spread":0.20049499586434827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259887679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14498258,0.00015906323,0.85374844,0.000024419656,0.0002292451,0.000093669994,0.000003124321,0.000056949193,0.0007025301],"genre_scores_gemma":[0.993356,0.00012654552,0.0062366026,0.000018487424,0.00014566646,0.000006381409,0.00007900579,0.000019367038,0.000011950459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935097,0.000031597603,0.00032041734,0.00013587359,0.000040209914,0.00012091634],"domain_scores_gemma":[0.9995453,0.000040822117,0.000097635784,0.00014854218,0.000090839196,0.00007686717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032384906,0.00009634369,0.00023162359,0.00012348188,0.000023796827,0.00003483176,0.00006059548,0.00010102263,0.000009502066],"category_scores_gemma":[0.00002764278,0.00011193445,0.000035832145,0.00025563897,0.000026808026,0.000093342635,0.000019597765,0.00006122549,9.994474e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005572381,0.000011608415,0.004458387,0.000009504042,0.00011709098,3.987871e-8,0.00018666705,0.9471308,0.000026991127,0.00011442404,0.000020042422,0.047918875],"study_design_scores_gemma":[0.0002107865,0.00003563506,0.0040737833,0.000006826156,0.00014698261,3.6082028e-7,0.000019699879,0.9949426,0.00011069253,0.00006191489,0.0002805558,0.00011014093],"about_ca_topic_score_codex":0.0005734083,"about_ca_topic_score_gemma":0.0016208874,"teacher_disagreement_score":0.8483734,"about_ca_system_score_codex":0.00007180173,"about_ca_system_score_gemma":0.000019423782,"threshold_uncertainty_score":0.45645544},"labels":[],"label_agreement":null},{"id":"W2269669929","doi":"10.1007/s11590-015-0973-5","title":"A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"Russian Science Foundation; National Research University Higher School of Economics; Agence Nationale de la Recherche","keywords":"Variable neighborhood search; Heuristics; Mathematical optimization; Heuristic; Benchmark (surveying); Solver; Pairwise comparison; Computational intelligence; Local search (optimization); Computer science; Set (abstract data type); Variable (mathematics); Metaheuristic; Mathematics; Artificial intelligence","score_opus":0.029756073684588987,"score_gpt":0.24712882116455606,"score_spread":0.21737274747996707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269669929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006452331,0.00004640879,0.99467015,0.0020339978,0.0004301074,0.0008896425,0.000029756586,0.00043528512,0.0008194272],"genre_scores_gemma":[0.17222771,0.000022753227,0.8255587,0.0011151311,0.00019528551,0.000258659,0.00032568388,0.00012648804,0.00016957372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986454,0.00013770373,0.00033892377,0.00025018508,0.00026167984,0.00036605896],"domain_scores_gemma":[0.9987938,0.00040482552,0.00006352654,0.00032564244,0.0002962103,0.00011602217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079247885,0.00019928992,0.00016191383,0.00011642455,0.00016390506,0.00014780281,0.00023167001,0.000085499414,0.00004450261],"category_scores_gemma":[0.00035959974,0.00017589646,0.000048781698,0.00057368167,0.000046553185,0.00027611663,0.000028802913,0.00016462503,0.000018564351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021488342,0.000025211326,0.000442333,0.0000447397,0.00005222034,3.8188603e-7,0.00058214547,0.99080914,0.0006109492,0.00027927992,0.0065283435,0.0006037669],"study_design_scores_gemma":[0.0013322375,0.000022895674,0.00004028446,0.000024086416,0.000033911034,0.000004502927,0.000116392715,0.9959961,0.00032546683,0.000032636235,0.0018682998,0.00020316131],"about_ca_topic_score_codex":0.000014639274,"about_ca_topic_score_gemma":0.000001559071,"teacher_disagreement_score":0.17158248,"about_ca_system_score_codex":0.0001803183,"about_ca_system_score_gemma":0.000049001716,"threshold_uncertainty_score":0.717285},"labels":[],"label_agreement":null},{"id":"W2269671001","doi":"10.1007/s11590-016-1081-x","title":"On a linearization technique for solving the quadratic set covering problem and variations","year":2016,"lang":"en","type":"preprint","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","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":"Simon Fraser University","funders":"","keywords":"Linearization; Heuristic; Class (philosophy); Mathematical optimization; Set (abstract data type); Quadratic equation; Mathematics; Quadratic model; Computer science; Algorithm; Nonlinear system; Artificial intelligence; Statistics","score_opus":0.015207257924394528,"score_gpt":0.2564950073204825,"score_spread":0.241287749396088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269671001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016917476,0.000029843357,0.9933613,0.002974764,0.00040227393,0.0020953298,0.00009337758,0.0004798149,0.00039414963],"genre_scores_gemma":[0.041990504,0.000099974546,0.954641,0.00086499413,0.00027737505,0.0015463284,0.0003223017,0.00019099886,0.00006656434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856895,0.00011179618,0.00046549633,0.00039329418,0.00019047981,0.00026998],"domain_scores_gemma":[0.99860036,0.000591523,0.00021341692,0.00042620202,0.000112685884,0.000055805118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065816287,0.00032947437,0.00026368102,0.00021093866,0.0002703588,0.0002763211,0.00022141213,0.0002687367,0.000024166235],"category_scores_gemma":[0.000324028,0.0002717733,0.00007610516,0.00019845174,0.00004848792,0.00016038943,0.00012262953,0.00033675248,0.0000023327061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006460937,0.0000062594,0.000018428633,0.00022648017,0.000053557545,2.8224233e-7,0.00037879273,0.9931092,0.0031866515,0.0018440981,0.00083735015,0.0003323958],"study_design_scores_gemma":[0.00029180205,0.000015948048,0.000009590687,0.0003472652,0.00006031244,0.0000030474973,0.00000943251,0.99626875,0.0010968206,0.0014454132,0.000120935336,0.0003306558],"about_ca_topic_score_codex":0.0000031972784,"about_ca_topic_score_gemma":8.873976e-7,"teacher_disagreement_score":0.04182133,"about_ca_system_score_codex":0.00017759178,"about_ca_system_score_gemma":0.000043620203,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W2277326438","doi":"","title":"The One-Commodity Traveling Salesman Problem with Selective Pickup and Delivery","year":2011,"lang":"en","type":"article","venue":"Document Server@UHasselt (UHasselt)","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":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Pickup; 2-opt; Bottleneck traveling salesman problem; Traveling purchaser problem; Computer science; Heuristic; Domain (mathematical analysis); Mathematical optimization; Combinatorial optimization; Operations research; Engineering; Mathematics; Artificial intelligence","score_opus":0.02399300994395222,"score_gpt":0.23255189581993152,"score_spread":0.2085588858759793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277326438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94159895,0.00061607733,0.046757642,0.00024165635,0.0003214938,0.0013023259,0.000014325199,0.0012315802,0.0079159355],"genre_scores_gemma":[0.93138283,0.00039766735,0.067507565,0.00008632482,0.00010568774,0.00013842317,0.000025171143,0.00014208774,0.00021420636],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99705225,0.00033377513,0.0006275464,0.0006069795,0.0005363081,0.0008431125],"domain_scores_gemma":[0.9982725,0.000344285,0.00019310937,0.0006731468,0.00025354783,0.0002634336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014644053,0.0005401965,0.00047422101,0.0001237999,0.0006627008,0.00031341347,0.00053279335,0.00021522217,0.00006257144],"category_scores_gemma":[0.0000495503,0.00044460318,0.000099469005,0.00060171285,0.00015124059,0.0007411088,0.00013988283,0.00064636004,0.000033112152],"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.0028591317,0.0026225622,0.3676053,0.0039065382,0.010785536,0.000341008,0.07447123,0.29752997,0.015178551,0.10372553,0.01032537,0.11064929],"study_design_scores_gemma":[0.020454945,0.0039740526,0.4648234,0.0022482667,0.0024668076,0.000561398,0.007126534,0.31127408,0.11519343,0.04549629,0.015200415,0.011180374],"about_ca_topic_score_codex":0.00026587848,"about_ca_topic_score_gemma":0.0005661709,"teacher_disagreement_score":0.10001487,"about_ca_system_score_codex":0.0002939363,"about_ca_system_score_gemma":0.00009610961,"threshold_uncertainty_score":0.99980056},"labels":[],"label_agreement":null},{"id":"W2281133739","doi":"10.1287/trsc.2015.0637","title":"An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"Mathematical optimization; Routing (electronic design automation); Computer science; Column generation; Branch and cut; Integer programming; Cluster analysis; Economic shortage; Time horizon; Linear programming; Branch and price; Operations research; Integer (computer science); Mathematics; Artificial intelligence","score_opus":0.013733779326738225,"score_gpt":0.2711333527092343,"score_spread":0.257399573382496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281133739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91607726,0.000014208762,0.08343986,0.00008726912,0.000013827692,0.00011768699,0.0000030935187,0.00014862379,0.00009818796],"genre_scores_gemma":[0.9436176,0.000008876662,0.056340117,0.000013319911,0.0000032324244,0.0000062674376,0.0000013975729,0.000007110539,0.0000020948721],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99924594,0.00003766046,0.00021645549,0.00014965402,0.0002245412,0.00012572078],"domain_scores_gemma":[0.9996712,0.000051354647,0.000054222393,0.00013115282,0.00006357799,0.000028483431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093560613,0.000068226516,0.000078981466,0.00009216312,0.00008185882,0.000029229384,0.00013622949,0.00001769005,0.0000039632673],"category_scores_gemma":[0.000019109133,0.00004017155,0.0000070013766,0.0004876103,0.00021347654,0.0004626468,0.0000016617456,0.00003749122,1.8461594e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026964202,0.000045706893,0.42627692,0.00009293105,0.000008430901,0.0000046234804,0.043512125,0.34970465,0.16013433,0.0028891177,0.000004438472,0.017299755],"study_design_scores_gemma":[0.00055135466,0.00006527652,0.5392987,0.0001622882,0.0000095470305,0.000004167174,0.0011635527,0.4413053,0.017117698,0.00014594998,0.00001817291,0.00015794073],"about_ca_topic_score_codex":0.00006751685,"about_ca_topic_score_gemma":0.00011816711,"teacher_disagreement_score":0.14301664,"about_ca_system_score_codex":0.000016931075,"about_ca_system_score_gemma":0.000042497948,"threshold_uncertainty_score":0.16381483},"labels":[],"label_agreement":null},{"id":"W2282509245","doi":"","title":"Comparaison d'approches de modélisation de problèmes tests pour le pilotage du transport : application aux mines à ciel ouvert","year":2007,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal","funders":"","keywords":"Benchmark (surveying); Computer science; Operations research; Simulation; Engineering; Geology","score_opus":0.017932773643221187,"score_gpt":0.25918195043522496,"score_spread":0.24124917679200378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282509245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18864106,0.0026065921,0.798091,0.006401655,0.00017913929,0.0012741629,0.00004336787,0.0015738758,0.0011891418],"genre_scores_gemma":[0.52939993,0.00016318505,0.4678737,0.0004384336,0.0003376664,0.00033795877,0.00006413834,0.00015669849,0.00122832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591136,0.00027648872,0.0011102427,0.00070664217,0.00044909565,0.0015461491],"domain_scores_gemma":[0.99745655,0.0004467763,0.00038021491,0.00083902205,0.0002969577,0.00058049604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033834553,0.0006994614,0.00065121514,0.00058966153,0.00042116418,0.00016839181,0.00066733285,0.00082958804,0.00003200594],"category_scores_gemma":[0.00042413434,0.0008987051,0.000265096,0.0011162087,0.00018824205,0.00062970293,0.00008054186,0.00068725366,0.000017789973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009279209,0.0005605467,0.10470938,0.00039933517,0.000092531816,0.000037022386,0.0023238778,0.7580516,0.07706786,0.023986774,0.0015006211,0.031177703],"study_design_scores_gemma":[0.00073593005,0.00007274385,0.1519716,0.00015765188,0.00010619831,0.00016126005,0.00041551076,0.7920665,0.048948262,0.0020271009,0.0026487368,0.0006884853],"about_ca_topic_score_codex":0.023821602,"about_ca_topic_score_gemma":0.006959219,"teacher_disagreement_score":0.34075886,"about_ca_system_score_codex":0.0017956608,"about_ca_system_score_gemma":0.0009971156,"threshold_uncertainty_score":0.9993464},"labels":[],"label_agreement":null},{"id":"W2282607975","doi":"10.4230/lipics.fsttcs.2012.325","title":"k-delivery traveling salesman problem on tree networks","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Travelling salesman problem; Pickup; Routing (electronic design automation); Vehicle routing problem; Tree (set theory); Traveling purchaser problem; Computer science; Mathematical optimization; Mathematics; Combinatorics; 2-opt; Artificial intelligence; Computer network","score_opus":0.017013542441611736,"score_gpt":0.2445203401976485,"score_spread":0.22750679775603677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282607975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18699975,0.00018932129,0.77497643,0.00006941987,0.0021994358,0.0014865224,0.00016796957,0.0013774529,0.032533705],"genre_scores_gemma":[0.8668713,0.000093016744,0.13113457,0.00044069692,0.00061045977,0.000116403964,0.0003699333,0.00016696645,0.00019665831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971712,0.000051669213,0.0010912649,0.0001720241,0.00036613777,0.0011476948],"domain_scores_gemma":[0.99858975,0.00022125481,0.00020803182,0.0005294406,0.00013133508,0.00032020893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009957608,0.0004825711,0.00045762086,0.00021768002,0.0002577033,0.00017428778,0.00042957344,0.00034622886,0.000046298013],"category_scores_gemma":[0.000060158927,0.00047626495,0.00022984148,0.00032868277,0.000058418536,0.0010617711,0.00009434028,0.00062029273,0.00015697387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010291652,0.00026695334,0.0115639,0.00083257706,0.00033063686,0.000001921975,0.008492725,0.90769356,0.00010222312,0.0032151556,0.006454423,0.060942985],"study_design_scores_gemma":[0.0018447309,0.00011160829,0.0015646536,0.00022275795,0.000065534645,0.000027098491,0.00053162995,0.9701001,0.000753536,0.00005825718,0.023993134,0.00072696235],"about_ca_topic_score_codex":0.0000028006382,"about_ca_topic_score_gemma":0.0000037162833,"teacher_disagreement_score":0.67987156,"about_ca_system_score_codex":0.00020189601,"about_ca_system_score_gemma":0.000020123942,"threshold_uncertainty_score":0.9997689},"labels":[],"label_agreement":null},{"id":"W2283042507","doi":"10.1007/0-306-48213-4_15","title":"The Bottleneck TSP","year":2006,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"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 New Brunswick","funders":"","keywords":"Bottleneck; Computer science; Embedded system","score_opus":0.009923679561488942,"score_gpt":0.2187868876056296,"score_spread":0.20886320804414066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283042507","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011995945,0.0009506553,0.28329453,0.000061024293,0.009256366,0.0003760054,0.000015531336,0.0008195039,0.70522517],"genre_scores_gemma":[0.0020469634,0.004777906,0.13097426,0.00009568628,0.006838535,0.00011946774,0.001390505,0.0015644577,0.8521922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984432,0.000042224747,0.00055365067,0.0002830632,0.00037900958,0.00029888676],"domain_scores_gemma":[0.99873,0.0002378594,0.0001798684,0.0005522429,0.00022375984,0.00007625835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036814116,0.00041141704,0.00033495293,0.000110660425,0.0003072555,0.00020097784,0.0003537422,0.0005660164,0.00013982037],"category_scores_gemma":[0.00009087188,0.0003819746,0.00014078672,0.000090239795,0.00008384598,0.00011040229,0.00006477831,0.00045279087,0.00007645169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000519009,0.0000040506516,0.0000012596735,0.000019331203,0.000038168626,0.0000017822456,0.000008317215,0.8590354,0.0000021279686,0.11435073,0.024960557,0.0015730914],"study_design_scores_gemma":[0.000505329,0.000026927939,0.000001983364,0.0000665916,0.00007430483,0.0000029422386,0.0000013126678,0.6854066,0.000049496644,0.014542289,0.29882288,0.00049931643],"about_ca_topic_score_codex":0.0000024711953,"about_ca_topic_score_gemma":8.2528334e-7,"teacher_disagreement_score":0.27386233,"about_ca_system_score_codex":0.0002600663,"about_ca_system_score_gemma":0.000054004784,"threshold_uncertainty_score":0.9998632},"labels":[],"label_agreement":null},{"id":"W2289752907","doi":"","title":"Separating Valid Odd-Cycle and Odd-Set Inequalities for the Multiple Depot Vehicle Scheduling Problem","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Kronos (Canada); Group for Research in Decision Analysis; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Scheduling (production processes); Depot; Multi-commodity flow problem; Computer science; Mathematics; Set (abstract data type); Flow network; Job shop scheduling; Column generation; Operations research; Schedule","score_opus":0.0217638503829815,"score_gpt":0.26136430973450403,"score_spread":0.23960045935152252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289752907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28339362,0.0012265227,0.71166253,0.000939948,0.00008925907,0.0013701647,0.000031026226,0.0011347503,0.0001522078],"genre_scores_gemma":[0.58566445,0.00009474037,0.41236275,0.0003334729,0.0001108836,0.0012120502,0.000013340205,0.00009466089,0.00011366202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785537,0.00015888677,0.00061458856,0.00036135764,0.00024259224,0.00076722493],"domain_scores_gemma":[0.99778104,0.0011443204,0.00015063131,0.000556989,0.00015968077,0.00020732878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011810386,0.0003662347,0.00035766864,0.0001800213,0.00050958013,0.0004491698,0.00036790804,0.00024312567,0.00002620987],"category_scores_gemma":[0.0005926866,0.0003249949,0.00011844419,0.00037003894,0.000084568885,0.0005128245,0.00015449416,0.00039968514,0.000009957857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017781886,0.00003249274,0.01820166,0.00020217262,0.00009141079,0.0000018739705,0.0012901326,0.93316716,0.021188332,0.0028644216,0.00068881264,0.022253761],"study_design_scores_gemma":[0.00055146177,0.00004662783,0.004852539,0.000060607235,0.000034133747,0.000021880258,0.0005820171,0.9763332,0.015119602,0.0015332444,0.00047457777,0.00039008656],"about_ca_topic_score_codex":0.0027753552,"about_ca_topic_score_gemma":0.00045747985,"teacher_disagreement_score":0.3022708,"about_ca_system_score_codex":0.00017679039,"about_ca_system_score_gemma":0.000054175856,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W2291592553","doi":"10.1057/jors.2015.90","title":"Solving the vehicle routing problem with lunch break arising in the furniture delivery industry","year":2015,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"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","funders":"","keywords":"Vehicle routing problem; Computer science; Heuristic; Mathematical optimization; Routing (electronic design automation); Integer programming; Heuristics; Linear programming; Process (computing); Last mile (transportation); Operations research; Algorithm; Mathematics; Mile; Artificial intelligence","score_opus":0.07099147204568494,"score_gpt":0.34300034658101936,"score_spread":0.2720088745353344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291592553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96947366,0.0006090655,0.008679506,0.018304769,0.00019182177,0.00046106786,0.0000035859246,0.000024684989,0.0022518516],"genre_scores_gemma":[0.9758264,0.000034475797,0.023103734,0.0003950389,0.00046131643,0.000008351494,8.7445886e-7,0.000024247953,0.00014556127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967161,0.0009364685,0.00037392598,0.00009998983,0.0015359012,0.0003376045],"domain_scores_gemma":[0.9978217,0.0008735264,0.000101832076,0.00023194666,0.0008916467,0.00007933931],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.012971357,0.000113842245,0.00013475902,0.00004481246,0.00058496254,0.00040451845,0.00074550236,0.00015825013,0.000011683478],"category_scores_gemma":[0.0007357898,0.00005193974,0.000105350315,0.0008314369,0.00014543961,0.00040976252,0.00012426246,0.0031954146,0.0000020312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016926997,0.000028125462,0.008358316,0.000013000193,0.00005958579,0.0000045987636,0.009379977,0.9689086,0.001420962,0.0002754822,0.010873302,0.00066111825],"study_design_scores_gemma":[0.0013926432,0.00011767841,0.018716067,0.00043821792,0.000031870695,0.00034917417,0.025495283,0.94811887,0.0012000492,0.00078748236,0.0031283044,0.00022436999],"about_ca_topic_score_codex":0.000035646015,"about_ca_topic_score_gemma":0.00001978898,"teacher_disagreement_score":0.020789744,"about_ca_system_score_codex":0.0004004069,"about_ca_system_score_gemma":0.0006255695,"threshold_uncertainty_score":0.99910426},"labels":[],"label_agreement":null},{"id":"W2292410759","doi":"","title":"Scheduling Issues in Vehicle Routing","year":2012,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"HEC Montréal","funders":"","keywords":"Computer science; Equal-cost multi-path routing; Static routing; Policy-based routing; Multipath routing; Link-state routing protocol; Distributed computing; Computer network; Routing (electronic design automation); Routing protocol","score_opus":0.013045123559327482,"score_gpt":0.2537664492992031,"score_spread":0.24072132573987562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292410759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033202,0.0011766391,0.091572024,0.000179604,0.00041351654,0.00008758441,0.0000011118483,0.00048278618,0.0027665345],"genre_scores_gemma":[0.781439,0.000057372443,0.21799356,0.00006734651,0.00028643274,0.000007206185,0.0000029975467,0.00004299885,0.000103049315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989583,0.00009194169,0.00024679626,0.00012515404,0.00012539933,0.00045239797],"domain_scores_gemma":[0.9995665,0.00011528044,0.000029708744,0.0001724104,0.000019571882,0.00009653307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006864559,0.00014502573,0.00017351824,0.00012145612,0.00009687145,0.00003938011,0.00011969157,0.00015192355,0.000045434812],"category_scores_gemma":[0.00019410352,0.00016483101,0.00004163799,0.000323846,0.000040607883,0.00027918443,0.000022079821,0.00035196915,0.00004640956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009411731,0.0000628484,0.2873797,0.00011016122,0.000050568884,0.000012916661,0.016237305,0.6201088,0.015484358,0.023034645,0.00025708956,0.03725218],"study_design_scores_gemma":[0.000858116,0.00001493081,0.037359063,0.000088170906,0.000020229418,0.000019044646,0.0014796772,0.9337995,0.019684836,0.00056897226,0.0053938413,0.00071360037],"about_ca_topic_score_codex":0.000030185096,"about_ca_topic_score_gemma":0.0000034579375,"teacher_disagreement_score":0.31369072,"about_ca_system_score_codex":0.0001620735,"about_ca_system_score_gemma":0.000006223041,"threshold_uncertainty_score":0.67216134},"labels":[],"label_agreement":null},{"id":"W2292509389","doi":"10.48550/arxiv.1602.08508","title":"A joint routing and speed optimization problem","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo","funders":"","keywords":"Joint (building); Computer science; Routing (electronic design automation); Mathematical optimization; Computer network; Engineering; Mathematics; Structural engineering","score_opus":0.059450403824680934,"score_gpt":0.18857151191658467,"score_spread":0.12912110809190375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292509389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056923762,0.00004979322,0.93431973,0.00003848632,0.00025970777,0.00031483997,0.00001662254,0.0007414272,0.007335642],"genre_scores_gemma":[0.93441665,0.00027690743,0.06453903,0.000015418498,0.00009706169,6.1300983e-7,0.000018056042,0.000074722324,0.00056155556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987076,0.000115254385,0.00024806088,0.00056264584,0.000059035043,0.00030743866],"domain_scores_gemma":[0.99912196,0.00007007383,0.00014038898,0.00042396405,0.000106721884,0.00013689841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034775533,0.00030740837,0.00032139567,0.00022140292,0.00009668765,0.00007488623,0.00022143833,0.00032547946,0.00007662909],"category_scores_gemma":[0.000059406153,0.0003406826,0.00008845025,0.00025357466,0.000064015716,0.00017839426,0.000434099,0.00037924392,0.000014132317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006127994,0.000008007893,0.0009344772,0.00013063563,0.00006262265,0.00002076187,0.00009612478,0.9927294,0.00012197302,0.005381237,0.000042198666,0.00046639165],"study_design_scores_gemma":[0.00042119244,0.00001021303,0.00021300596,0.00024236158,0.00007027051,0.0000043853233,0.000036747704,0.9944104,0.00022538136,0.0039255703,0.00004062238,0.00039983887],"about_ca_topic_score_codex":0.000014352474,"about_ca_topic_score_gemma":0.0000023799023,"teacher_disagreement_score":0.87749285,"about_ca_system_score_codex":0.0002272135,"about_ca_system_score_gemma":0.00004195989,"threshold_uncertainty_score":0.9999045},"labels":[],"label_agreement":null},{"id":"W2294468862","doi":"10.1016/j.eswa.2016.02.037","title":"Erratum to “A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem [Expert Systems with Applications 43 (2015) 117–130]”","year":2016,"lang":"en","type":"erratum","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Computer science; Vehicle routing problem; Depot; Routing (electronic design automation); Routing algorithm; Mathematical optimization; Artificial intelligence; Computer network; Mathematics; Routing protocol","score_opus":0.01891774664071865,"score_gpt":0.28406008841891456,"score_spread":0.2651423417781959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294468862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.803017e-7,0.019376194,0.9527174,0.00076764345,0.0029224218,0.018015927,0.0010748118,0.0016153202,0.0035097632],"genre_scores_gemma":[0.0019583406,0.0013808204,0.5781401,0.00036377055,0.010030577,0.30389115,0.0019599895,0.0014186644,0.10085657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944659,0.00030545602,0.001479201,0.0015840292,0.0009200897,0.0012453094],"domain_scores_gemma":[0.9940313,0.00080030144,0.00066610647,0.002330253,0.0016381124,0.00053390843],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009156741,0.0012501577,0.0012799411,0.00036928616,0.0017506478,0.0005425921,0.0013980366,0.0008270156,0.000013821988],"category_scores_gemma":[0.00005171021,0.0008405705,0.0001906263,0.0014833724,0.0002677098,0.000331936,0.00016192911,0.0009841141,0.0001786749],"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.000034468092,0.00021977516,0.000020233998,0.0006181563,0.00096965133,0.000003496336,0.0015857338,0.20151986,0.00054459396,0.0023408735,0.7846207,0.0075224694],"study_design_scores_gemma":[0.0007911918,0.00010039094,0.000010617444,0.0008703186,0.00010714947,0.0000753023,0.0012866458,0.4129606,0.000038797323,0.00000466318,0.5828017,0.0009526581],"about_ca_topic_score_codex":0.00048548743,"about_ca_topic_score_gemma":0.00009007958,"teacher_disagreement_score":0.37457734,"about_ca_system_score_codex":0.0010857148,"about_ca_system_score_gemma":0.00066046946,"threshold_uncertainty_score":0.9995489},"labels":[],"label_agreement":null},{"id":"W2295299369","doi":"","title":"Solution Techniques for the Large Set Covering Problem","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Set cover problem; Mathematics; Cover (algebra); Constraint satisfaction problem; Heuristic; Set (abstract data type); Extension (predicate logic); Combinatorics; Constraint (computer-aided design); Family of sets; Computation; Discrete mathematics; Algorithm; Mathematical optimization; Computer science","score_opus":0.01391323732630745,"score_gpt":0.24987864402170837,"score_spread":0.23596540669540092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295299369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018105771,0.0010021658,0.9907923,0.00058611674,0.00015860035,0.0014824385,0.00006179641,0.0026735575,0.0014324479],"genre_scores_gemma":[0.34814847,0.00023807585,0.6496234,0.00048326066,0.00009937329,0.0009354449,0.00001984705,0.00013154252,0.00032063414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811494,0.00013633228,0.0004373556,0.00029348745,0.00022268803,0.0007952219],"domain_scores_gemma":[0.9986972,0.00030953615,0.00010537699,0.0006411048,0.00011355784,0.00013318892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019362901,0.00031213576,0.00026817375,0.00020217714,0.00040988697,0.0001599579,0.00036071148,0.00026895374,0.000027739885],"category_scores_gemma":[0.00035154072,0.00028194996,0.00015828547,0.00048988225,0.000042833446,0.00027000598,0.00006366041,0.00036549818,0.0000060250827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006302648,0.00017385896,0.00828921,0.00037672583,0.00025317015,0.000010405144,0.0009058198,0.7429562,0.042248752,0.13259092,0.021802146,0.05032977],"study_design_scores_gemma":[0.00036182525,0.000051514868,0.0005230606,0.00004496911,0.000043209428,0.000046221605,0.00007760776,0.8723715,0.06512423,0.0019476804,0.059008077,0.0004000988],"about_ca_topic_score_codex":0.00021257612,"about_ca_topic_score_gemma":0.00021330827,"teacher_disagreement_score":0.34633788,"about_ca_system_score_codex":0.00041046142,"about_ca_system_score_gemma":0.000076463635,"threshold_uncertainty_score":0.9999633},"labels":[],"label_agreement":null},{"id":"W2298220966","doi":"10.1016/j.disopt.2017.09.003","title":"The quadratic minimum spanning tree problem and its variations","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanning tree; Minimum spanning tree; Distributed minimum spanning tree; Combinatorics; Euclidean minimum spanning tree; Matroid; Mathematics; Context (archaeology); Kruskal's algorithm; Bottleneck; k-minimum spanning tree; Quadratic equation; Tree (set theory); Simple (philosophy); Minimum degree spanning tree; Discrete mathematics; Binary tree; K-ary tree; Computer science; Tree structure","score_opus":0.02206177484825251,"score_gpt":0.28212960636901624,"score_spread":0.26006783152076374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298220966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005528744,0.001464627,0.98112065,0.00068316277,0.00080098206,0.00084840524,0.000039140952,0.00051005976,0.013980111],"genre_scores_gemma":[0.29289743,0.003093948,0.70055073,0.00003327843,0.0004383675,0.00040284832,0.000568462,0.00027486501,0.0017400543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983207,0.0001738504,0.0005105073,0.00040567646,0.0002537406,0.00033550634],"domain_scores_gemma":[0.9984717,0.0002176262,0.00032639407,0.0006976426,0.00018356457,0.00010307699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006945721,0.0003660784,0.0003197145,0.00011746582,0.0008214271,0.00090884394,0.00044074553,0.0003393145,0.000018978719],"category_scores_gemma":[0.00046771337,0.0003223426,0.00008110269,0.000118627984,0.00006120301,0.00027261907,0.000323547,0.0005012257,0.0000068703644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039581296,0.0000043332084,0.000064445536,0.0001461101,0.00007646427,9.4946466e-7,0.00056314457,0.9946676,0.000038103182,0.001587335,0.00016829361,0.0026792623],"study_design_scores_gemma":[0.00021756694,0.00001068669,0.0001855217,0.00019780632,0.00010554959,0.000003095239,0.000047761197,0.99755067,0.000062321706,0.0010755165,0.00018214172,0.00036134833],"about_ca_topic_score_codex":0.0000089929,"about_ca_topic_score_gemma":0.0000108211525,"teacher_disagreement_score":0.29234454,"about_ca_system_score_codex":0.00009122933,"about_ca_system_score_gemma":0.00007506086,"threshold_uncertainty_score":0.9999229},"labels":[],"label_agreement":null},{"id":"W2301536381","doi":"10.5539/jmr.v8n2p49","title":"Optimal Two Hubs Location and Network Construction for a Regional Company of WAEMU Zone","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","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":true,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Profit (economics); Integer programming; Operations research; Business; Mathematics; Operations management; Transport engineering; Mathematical optimization; Engineering; Economics; Microeconomics","score_opus":0.09717918017672626,"score_gpt":0.39004391466650534,"score_spread":0.29286473448977907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301536381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16602112,0.00018875586,0.83327246,0.00021002648,0.00007658643,0.00013120435,0.0000019185914,0.000010958359,0.00008699293],"genre_scores_gemma":[0.31345847,0.00014627793,0.6861526,0.0000017430032,0.00017621502,0.0000037110995,3.4192544e-7,0.000017890501,0.000042782576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875087,0.00009889056,0.000490085,0.000059660597,0.0004105905,0.0001899218],"domain_scores_gemma":[0.9975298,0.0012348727,0.00018092731,0.000113663926,0.0008675082,0.00007322198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032390247,0.000067084504,0.00023143539,0.00018414986,0.000056870354,0.000026024178,0.00011944412,0.00005149339,0.000015148501],"category_scores_gemma":[0.00046562593,0.000048783055,0.00004297641,0.00022721392,0.00013491917,0.000120282326,0.000025443695,0.00015386804,0.0000012851762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019372827,0.00019674892,0.00094788487,0.0018409617,0.00035148152,0.000004549932,0.0017440103,0.8491667,0.04410112,0.046609696,0.006202609,0.048640527],"study_design_scores_gemma":[0.002478048,0.000308294,0.0004071157,0.0012911122,0.000037408405,0.00038110765,0.0007168894,0.9710262,0.009041937,0.013491197,0.0006616064,0.00015910182],"about_ca_topic_score_codex":7.3846417e-7,"about_ca_topic_score_gemma":5.8643394e-7,"teacher_disagreement_score":0.14743735,"about_ca_system_score_codex":0.00006370682,"about_ca_system_score_gemma":0.000057520752,"threshold_uncertainty_score":0.19893152},"labels":[],"label_agreement":null},{"id":"W2302298156","doi":"10.1007/s10479-015-2001-7","title":"Multi-trip pickup and delivery problem with time windows and synchronization","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; École de Technologie Supérieure; Université de Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Tabu search; Computer science; Pickup; Benchmark (surveying); Operations research; Scheduling (production processes); Routing (electronic design automation); Job shop scheduling; Synchronization (alternating current); Mathematical optimization; Theory of computation; Computer network; Algorithm; Mathematics; Artificial intelligence","score_opus":0.091053267242863,"score_gpt":0.36662861446233885,"score_spread":0.27557534721947585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302298156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6875971,0.00088721554,0.3081831,0.001615782,0.000015439475,0.00071079633,0.000029067285,0.00012644594,0.00083503965],"genre_scores_gemma":[0.8767445,0.0009208974,0.12132417,0.000015501746,0.000023386385,0.000033370587,0.00000620505,0.000026605883,0.0009053345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991132,0.00015341493,0.00016722162,0.00015563435,0.00020844472,0.0002020705],"domain_scores_gemma":[0.9990349,0.00016746562,0.00000937166,0.0001544752,0.00055710477,0.00007667788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008261804,0.00007768914,0.00011047474,0.00020203287,0.00014468074,0.0000653134,0.00007064131,0.000054714135,0.000060227827],"category_scores_gemma":[0.0001774765,0.000055446395,0.000008689824,0.00031541867,0.00014346877,0.00032349984,0.000045574954,0.0000915211,0.000014431319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006433936,0.00013194367,0.009940169,0.0002813792,0.00016870942,0.000006913264,0.0015856235,0.6742479,0.18613896,0.0009436903,0.0019092564,0.124581076],"study_design_scores_gemma":[0.00077734044,0.00018243997,0.0053144693,0.00017914167,0.0000058392675,0.000010817517,0.000056516288,0.97138804,0.021459805,0.000027604023,0.00043702777,0.0001609277],"about_ca_topic_score_codex":0.000028996265,"about_ca_topic_score_gemma":0.000029933844,"teacher_disagreement_score":0.29714012,"about_ca_system_score_codex":0.00001570119,"about_ca_system_score_gemma":0.000053572243,"threshold_uncertainty_score":0.22610384},"labels":[],"label_agreement":null},{"id":"W2304562996","doi":"","title":"A Branch-and-Price Algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows","year":2009,"lang":"en","type":"article","venue":"RePEc: Research Papers in Economics","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Pickup; Routing (electronic design automation); Computer science; Revenue; Mathematical optimization; Set (abstract data type); Operations research; Mathematics; Economics; Computer network; Artificial intelligence; Finance","score_opus":0.012272064764539913,"score_gpt":0.2622616525344074,"score_spread":0.24998958776986752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304562996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8004818,0.001600675,0.12592581,0.0021208653,0.00015590404,0.0071190107,0.00009973358,0.0008469503,0.061649248],"genre_scores_gemma":[0.8401133,0.0014895845,0.1574343,0.0001121092,0.00012138851,0.00014817416,0.000006294808,0.000076263896,0.0004985981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988495,0.00009202837,0.00021704321,0.0002901114,0.00009385864,0.00045743986],"domain_scores_gemma":[0.9987617,0.0008446159,0.000036586436,0.0001938743,0.00007966211,0.000083541745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012619705,0.00014149051,0.00019628764,0.000098477416,0.00023481574,0.000103231694,0.00013874966,0.00008262841,0.0000054168736],"category_scores_gemma":[0.00013191397,0.00011998891,0.000022267022,0.00019153081,0.00010689231,0.00015725613,0.000046410263,0.00035163425,8.122728e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041349067,0.000014939303,0.0010369365,0.000019745436,0.00004956561,0.0000016451191,0.00083088526,0.11810063,0.00065665005,0.00013931008,0.000013375882,0.87909496],"study_design_scores_gemma":[0.00079283933,0.00016676408,0.005914714,0.00003599183,0.000007455526,0.00001884272,0.000196693,0.9907745,0.00055772136,0.0002191067,0.001143488,0.00017188379],"about_ca_topic_score_codex":0.000012944956,"about_ca_topic_score_gemma":0.000015527841,"teacher_disagreement_score":0.87892306,"about_ca_system_score_codex":0.00020116972,"about_ca_system_score_gemma":0.00006192551,"threshold_uncertainty_score":0.48930055},"labels":[],"label_agreement":null},{"id":"W2311828527","doi":"10.1287/ijoc.2016.0744","title":"New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Enumeration; Routing (electronic design automation); Node (physics); Relaxation (psychology); State (computer science); Mathematics; Variable (mathematics); Computer science; Arc (geometry); Mathematical optimization; Algorithm; Combinatorics; Computer network; Engineering","score_opus":0.01893947499540653,"score_gpt":0.2695841109089779,"score_spread":0.25064463591357133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311828527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10777419,0.00002770053,0.88837224,0.00033755152,0.00044985852,0.00040922724,0.0000013750321,0.00006189896,0.002565925],"genre_scores_gemma":[0.91847247,0.0000049860714,0.08091568,0.000058778194,0.0003211358,0.0000019450436,4.6454892e-7,0.000028802751,0.00019570945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885154,0.000025063933,0.0004369984,0.00008477769,0.00029767002,0.0003039525],"domain_scores_gemma":[0.9986168,0.0002460417,0.00059766683,0.00035496603,0.00012410195,0.000060436876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012226696,0.00014514547,0.0001722421,0.000040590407,0.0011888223,0.00028149408,0.00060881575,0.00005133264,0.000011717557],"category_scores_gemma":[0.00019696224,0.000077208395,0.00009588207,0.00008983841,0.00003954955,0.0003265115,0.00009270969,0.00035269427,0.0000053158906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027500406,0.0000058588134,0.0016147146,0.00001940331,0.00007522967,3.523362e-7,0.0004688259,0.84385717,0.0016898323,0.00010196999,0.00023549215,0.15190363],"study_design_scores_gemma":[0.0009969738,0.00009793731,0.007202032,0.000413047,0.000028613262,0.000029115488,0.000039182632,0.98058665,0.009654912,0.00009305438,0.0007259966,0.00013248053],"about_ca_topic_score_codex":0.000010088864,"about_ca_topic_score_gemma":0.0000018388217,"teacher_disagreement_score":0.81069833,"about_ca_system_score_codex":0.00009194652,"about_ca_system_score_gemma":0.000075192795,"threshold_uncertainty_score":0.9143581},"labels":[],"label_agreement":null},{"id":"W2312035630","doi":"","title":"Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks","year":2015,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Pickup; FIFO and LIFO accounting; Benchmark (surveying); Stack (abstract data type); Computer science; Vehicle routing problem; Mathematical optimization; Path (computing); Travelling salesman problem; Position (finance); Shortest path problem; Algorithm; Routing (electronic design automation); Mathematics; Economics; FIFO (computing and electronics); Computer network; Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.015110270455657241,"score_gpt":0.2269251546750366,"score_spread":0.21181488421937936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312035630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081792526,0.0030128998,0.9121479,0.00080354983,0.000040112733,0.0013207488,0.000044117456,0.0006808113,0.00015736185],"genre_scores_gemma":[0.3611757,0.00036040202,0.6372537,0.0003463236,0.00009373817,0.00034499657,0.000012545397,0.00011202677,0.00030055465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868935,0.0000728746,0.0002752629,0.00031618442,0.00019233537,0.0004540011],"domain_scores_gemma":[0.99872065,0.00044096145,0.00008084192,0.00035028666,0.00012675929,0.00028049402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008519209,0.00028816884,0.0002941362,0.00014399482,0.00019994729,0.00019937701,0.00016959607,0.00017351078,0.000003367821],"category_scores_gemma":[0.00015121061,0.00022578894,0.00003436883,0.0002343666,0.000117165786,0.00028991213,0.00011620102,0.0002542782,0.0000015919649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044731496,0.0001185051,0.066833,0.0003577357,0.00044041284,0.00002155083,0.003400048,0.68914735,0.0068005514,0.001556642,0.004484914,0.226392],"study_design_scores_gemma":[0.0013424652,0.00014334344,0.0046317424,0.000041402138,0.000057320565,0.00010392645,0.00010204384,0.98846513,0.0022393353,0.0004180213,0.0021333506,0.00032190306],"about_ca_topic_score_codex":0.00072095724,"about_ca_topic_score_gemma":0.00030789658,"teacher_disagreement_score":0.2993178,"about_ca_system_score_codex":0.000118365744,"about_ca_system_score_gemma":0.00006738848,"threshold_uncertainty_score":0.9207406},"labels":[],"label_agreement":null},{"id":"W2314520391","doi":"10.1109/ieem.2013.6962399","title":"Optimization of forest vehicle routing using reactive tabu search metaheuristic","year":2013,"lang":"en","type":"article","venue":"","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":"Université du Québec en Abitibi-Témiscamingue; École de Technologie Supérieure","funders":"","keywords":"Tabu search; Metaheuristic; Vehicle routing problem; Computer science; Guided Local Search; Mathematical optimization; Routing (electronic design automation); Algorithm; Mathematics; Computer network","score_opus":0.02994774288431724,"score_gpt":0.27773371291234983,"score_spread":0.2477859700280326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314520391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29482082,0.000021439495,0.70070416,0.000013425047,0.000070358874,0.00019261063,0.0000014735967,0.00020049364,0.003975253],"genre_scores_gemma":[0.61639154,0.000004479447,0.38347146,0.000007704242,0.000026104159,0.000005353559,0.0000042859156,0.000034729575,0.00005432194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894094,0.0000938007,0.00034559917,0.00015858143,0.00019724679,0.00026381767],"domain_scores_gemma":[0.99923253,0.00018798739,0.000057985646,0.00022107083,0.0002279285,0.00007247596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038374317,0.00013359125,0.00020809037,0.00013154355,0.00006403593,0.000044544893,0.0001209794,0.000079733494,0.00032294315],"category_scores_gemma":[0.0001825716,0.00013479452,0.000047715374,0.00043086347,0.000035671947,0.00034238285,0.00004519181,0.00014005399,0.000020160067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014794571,0.000011054834,0.0040492723,0.00002974136,0.000029649309,3.7986953e-7,0.00017298704,0.9818649,0.012512761,0.00028257808,0.00001866963,0.001026482],"study_design_scores_gemma":[0.0001837781,0.0000120612885,0.0025143365,0.000023006394,0.000021655862,0.000002928328,0.00018152012,0.9804277,0.016446264,0.000047036254,0.0000033719502,0.00013633935],"about_ca_topic_score_codex":0.00027516653,"about_ca_topic_score_gemma":0.0000028301195,"teacher_disagreement_score":0.32157075,"about_ca_system_score_codex":0.00008297577,"about_ca_system_score_gemma":0.000022322509,"threshold_uncertainty_score":0.54967606},"labels":[],"label_agreement":null},{"id":"W2317060951","doi":"10.1016/j.trb.2016.03.003","title":"A rough-cut approach for evaluating location-routing decisions via approximation algorithms","year":2016,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Implementation; Routing (electronic design automation); Computer science; Routing algorithm; Quality (philosophy); Cut-off; Supply chain; Simple (philosophy); Operations research; Algorithm; Mathematical optimization; Mathematics; Business; Routing protocol; Engineering; Computer network; Marketing","score_opus":0.5247866706428028,"score_gpt":0.5032388526761308,"score_spread":0.021547817966672045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317060951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024359036,0.00007845949,0.972691,0.00024381137,0.00017957701,0.0014273399,0.000045811747,0.00058871275,0.00038626257],"genre_scores_gemma":[0.22536471,0.00005743389,0.7730456,0.000023873832,0.00018592119,0.00096037093,0.00017051665,0.00005913773,0.00013241344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943654,0.0022012922,0.0009448741,0.0006613371,0.0010125781,0.0008145292],"domain_scores_gemma":[0.98686254,0.011290947,0.000118447235,0.0004218221,0.0010778961,0.00022836906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01903438,0.00026824832,0.00042939716,0.00029933537,0.00044882591,0.00007268446,0.00036441945,0.00031655334,0.00013244322],"category_scores_gemma":[0.007747012,0.00019873262,0.00015034639,0.0011532473,0.0001940771,0.00035050922,0.000015368643,0.00040277207,0.000027738683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019609969,0.00016037656,0.0017681918,0.00019914184,0.000107626154,0.0000031242325,0.0010906832,0.6349699,0.032270696,0.006905643,0.0005759526,0.32175255],"study_design_scores_gemma":[0.0012784053,0.00019710834,0.006510548,0.00011534087,0.00003899238,0.0000032206092,0.0002720287,0.97531706,0.009168755,0.0062630307,0.00046515625,0.00037036723],"about_ca_topic_score_codex":0.000009822224,"about_ca_topic_score_gemma":0.000006018105,"teacher_disagreement_score":0.34034714,"about_ca_system_score_codex":0.00017332142,"about_ca_system_score_gemma":0.00008336367,"threshold_uncertainty_score":0.9274457},"labels":[],"label_agreement":null},{"id":"W2322772548","doi":"10.3138/infor.53.1.26","title":"Routing Courier Delivery Services with Urgent Demand","year":2015,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Vehicle routing problem; Computer science; Heuristic; Routing (electronic design automation); Set (abstract data type); Service (business); Operations research; On demand; Similarity (geometry); Computer network; Engineering; Business; Artificial intelligence","score_opus":0.05297306154814244,"score_gpt":0.3227330839743835,"score_spread":0.26976002242624103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322772548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7824917,0.0008081081,0.1482234,0.00029321772,0.000557658,0.001485082,0.00007082497,0.00042395748,0.06564607],"genre_scores_gemma":[0.99400824,0.00003808958,0.00539497,0.000086914566,0.00010517551,0.0000709914,0.00008888896,0.000012113162,0.00019458725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836737,0.00007880872,0.00039806715,0.00007371347,0.00083977747,0.00024225411],"domain_scores_gemma":[0.99831724,0.000117564065,0.000041272313,0.00012401637,0.0011577391,0.00024215656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024603857,0.000104578,0.00012290794,0.00022999698,0.00022947406,0.0006723372,0.00010304039,0.00007774854,0.000015767535],"category_scores_gemma":[0.00011499959,0.00008440979,0.000011504767,0.00030152604,0.00004035471,0.0020531774,0.000047818252,0.00018167173,0.00007753206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033813536,0.0000047112644,0.0039825784,0.00023481726,0.00003920167,0.0000019206009,0.0034140667,0.97928417,0.000021272126,0.009979054,0.0013243658,0.0016800202],"study_design_scores_gemma":[0.0005313191,0.000045674373,0.00088004937,0.00008201737,0.0000028811316,0.000045844372,0.0032507477,0.93867916,0.00008426736,0.000010910938,0.056256738,0.00013038513],"about_ca_topic_score_codex":0.00010296463,"about_ca_topic_score_gemma":0.0000100060615,"teacher_disagreement_score":0.21151659,"about_ca_system_score_codex":0.000110115594,"about_ca_system_score_gemma":0.00019116739,"threshold_uncertainty_score":0.6483363},"labels":[],"label_agreement":null},{"id":"W2325833190","doi":"10.1287/moor.2015.0758","title":"Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Facility location problem; Steiner tree problem; Latency (audio); Mathematical optimization; Approximation algorithm; Total cost; Computer science; Mathematics; Set (abstract data type); Telecommunications","score_opus":0.09349109213490026,"score_gpt":0.36359941826799386,"score_spread":0.2701083261330936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325833190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051136605,0.000024552808,0.9464873,0.0003134295,0.000015246014,0.0012265865,0.000051174884,0.00017869592,0.0005664091],"genre_scores_gemma":[0.46706998,0.000014931207,0.5320364,0.000002760173,0.000011082626,0.00049301237,0.00001808272,0.000023230925,0.00033049253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986741,0.00008264978,0.0004100608,0.00017154362,0.00040027848,0.00026136282],"domain_scores_gemma":[0.99770373,0.0004915933,0.000025851212,0.00042225848,0.0012988998,0.00005766806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019657856,0.00011255848,0.00017854298,0.000234718,0.00014875316,0.00004986015,0.00020846346,0.00008143651,0.000047570567],"category_scores_gemma":[0.0007337175,0.000074831245,0.000031788015,0.00048332894,0.00014196205,0.00015483571,0.000024555775,0.00009783171,0.000014065662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023864102,0.0004129327,0.00029988468,0.0024239242,0.00006295387,4.949182e-7,0.0022551704,0.7913526,0.18553346,0.006251317,0.00040188426,0.01098146],"study_design_scores_gemma":[0.0003866503,0.00022244165,0.000040343577,0.00035909668,0.000009018088,0.0000012915954,0.0001840726,0.85732645,0.14033177,0.0006757344,0.00031420187,0.00014889396],"about_ca_topic_score_codex":0.000009266743,"about_ca_topic_score_gemma":0.000023063161,"teacher_disagreement_score":0.41593337,"about_ca_system_score_codex":0.00011543164,"about_ca_system_score_gemma":0.0001360209,"threshold_uncertainty_score":0.30515295},"labels":[],"label_agreement":null},{"id":"W2331471704","doi":"10.1061/41064(358)402","title":"Research on Optimization of Crew Scheduling of the Passenger Dedicated Line Based on a Genetic Ant Colony Algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"National Natural Science Foundation of China; York University","keywords":"Crew scheduling; Crew; Scheduling (production processes); Ant colony optimization algorithms; Computer science; Genetic algorithm; Operations research; Ant colony; Job shop scheduling; Engineering; Schedule; Algorithm; Operating system; Aeronautics; Operations management; Machine learning","score_opus":0.04073749363813492,"score_gpt":0.3363787996597579,"score_spread":0.295641306021623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331471704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033573598,0.000041056694,0.9632508,0.00044469727,0.0000812527,0.00029641026,0.000004871508,0.00012294177,0.0021843857],"genre_scores_gemma":[0.5224978,0.000018263094,0.4773301,0.00006913215,0.00002765523,0.000003827075,0.0000035125986,0.000017273689,0.000032485306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985044,0.0002826596,0.0003535645,0.00016063855,0.00048388785,0.00021484953],"domain_scores_gemma":[0.9988659,0.00036576513,0.00006522149,0.00037679917,0.0002730148,0.000053291787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096923736,0.00011110963,0.0001774793,0.00023961673,0.000060491708,0.000012527049,0.00020662916,0.00011663474,0.00009882824],"category_scores_gemma":[0.0003288793,0.00008493923,0.00005102311,0.0010281516,0.000050650262,0.000026127733,0.000018076644,0.00027326975,0.0000030303943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001423964,0.00008180682,0.000052007752,0.000020916257,0.000008651521,7.0746773e-7,0.000031347143,0.98712236,0.0033329444,0.00006253186,0.0000590106,0.009213476],"study_design_scores_gemma":[0.00039644827,0.0002153288,0.0021091385,0.000115688614,0.000008769053,5.0121827e-7,0.000020983363,0.9405264,0.05649989,0.000017242684,0.000013853599,0.000075725584],"about_ca_topic_score_codex":0.00000834156,"about_ca_topic_score_gemma":6.7313647e-7,"teacher_disagreement_score":0.48892418,"about_ca_system_score_codex":0.000063488755,"about_ca_system_score_gemma":0.00005745423,"threshold_uncertainty_score":0.34637213},"labels":[],"label_agreement":null},{"id":"W2332834184","doi":"10.1016/j.ejor.2016.03.040","title":"An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Heuristics; Computer science; Synchronization (alternating current); Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Real-time computing; Operations research; Computer network; Mathematics","score_opus":0.0590928165349166,"score_gpt":0.34067075522544904,"score_spread":0.28157793869053244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332834184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026745426,0.00027052625,0.97010475,0.0008574836,0.00007515882,0.0005001739,0.000022130089,0.000048770828,0.0013755931],"genre_scores_gemma":[0.9217843,0.0001196019,0.07726195,0.000031014955,0.0005598101,0.000009896176,0.000007287259,0.00009058121,0.00013560172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962,0.001639443,0.0005138787,0.00020715006,0.00094726094,0.0004922159],"domain_scores_gemma":[0.9957244,0.0018102739,0.00009127669,0.00024539727,0.001955049,0.00017359604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011641142,0.00015395762,0.00016428814,0.0002167256,0.00053406187,0.00025589025,0.0004939969,0.00003130135,0.00005759904],"category_scores_gemma":[0.0006239368,0.00008703938,0.000056485387,0.0004947542,0.000099217345,0.0006723507,0.0000576971,0.00048040948,0.00002620408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054244447,0.00011914106,0.007245197,0.00003438722,0.00017219296,0.00004239656,0.0016106872,0.8223668,0.03468287,0.007256199,0.00015673267,0.12577096],"study_design_scores_gemma":[0.0034394613,0.0010452545,0.007317424,0.00024648113,0.000017988805,0.0000664129,0.0005759452,0.97767025,0.008197859,0.00004816814,0.0011693008,0.00020547936],"about_ca_topic_score_codex":0.0000022498812,"about_ca_topic_score_gemma":0.0000055463706,"teacher_disagreement_score":0.89503884,"about_ca_system_score_codex":0.00023101429,"about_ca_system_score_gemma":0.0002469092,"threshold_uncertainty_score":0.4107626},"labels":[],"label_agreement":null},{"id":"W2335850549","doi":"10.1080/03155986.2016.1166793","title":"The pickup and delivery problem with time windows and scheduled lines","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"TKI DINALOG; Technische Universiteit Eindhoven","keywords":"Pickup; Public transport; Vehicle routing problem; Computer science; Transport engineering; Integer programming; Set (abstract data type); Routing (electronic design automation); Operations research; Destinations; Line (geometry); Business; Engineering; Computer network; Tourism; Mathematics","score_opus":0.027934545557684504,"score_gpt":0.29165877861605827,"score_spread":0.2637242330583738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335850549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8804243,0.0020302627,0.09149251,0.0028137602,0.00020613342,0.0030788232,0.00009554207,0.0003425817,0.01951609],"genre_scores_gemma":[0.98816943,0.0007104367,0.0094225835,0.000048571306,0.00010835033,0.00018076567,0.000018205425,0.0000158951,0.001325789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898696,0.00006882232,0.00030467976,0.0000694317,0.0003845454,0.00018559075],"domain_scores_gemma":[0.99875516,0.0005061004,0.000032030774,0.00009810295,0.0005243692,0.000084241656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635523,0.00008779986,0.00009478284,0.00012695721,0.00043489164,0.0006333117,0.00006464411,0.000060750517,0.000007303426],"category_scores_gemma":[0.000170555,0.000045721514,0.0000065910435,0.00014689872,0.00013347318,0.0014030534,0.000051123912,0.00010636946,0.00003056223],"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.0006167757,0.000027621441,0.032394122,0.0017947531,0.00049331813,0.000003977237,0.009110386,0.27627197,0.0069878334,0.21062876,0.01087601,0.45079446],"study_design_scores_gemma":[0.001686482,0.00014860346,0.0063187564,0.0002924411,0.000005823338,0.000092228314,0.0007733442,0.87921,0.00039811936,0.0000720617,0.110738575,0.00026356036],"about_ca_topic_score_codex":0.000021942737,"about_ca_topic_score_gemma":0.0000053409362,"teacher_disagreement_score":0.602938,"about_ca_system_score_codex":0.000033538534,"about_ca_system_score_gemma":0.00007055846,"threshold_uncertainty_score":0.61070395},"labels":[],"label_agreement":null},{"id":"W2336420787","doi":"10.1111/itor.12282","title":"Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem","year":2016,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Travelling salesman problem; Heuristics; Descent (aeronautics); Variable neighborhood search; Mathematical optimization; Local search (optimization); Variable (mathematics); Mathematics; Sequence (biology); Computer science; Metaheuristic; Geography","score_opus":0.13763799870457297,"score_gpt":0.42554192951133163,"score_spread":0.2879039308067587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336420787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08028414,0.00000690352,0.9036426,0.00459395,0.00054515287,0.000803417,0.00006371633,0.00013716909,0.009922948],"genre_scores_gemma":[0.98464257,0.000022345139,0.014001034,0.00008747526,0.00021992603,0.00031200305,0.000014007784,0.000042969692,0.0006576965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969491,0.00074177305,0.0004532333,0.00036649586,0.0011354884,0.00035395115],"domain_scores_gemma":[0.9981112,0.0010255093,0.00001939483,0.00028766115,0.00046068165,0.00009556042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030613902,0.00015995657,0.00012543028,0.00034437553,0.0003218797,0.0002184194,0.00052765926,0.00009659652,0.002158114],"category_scores_gemma":[0.0002547405,0.00010982349,0.000042560576,0.0005821546,0.00008509128,0.00047350704,0.000017739027,0.0005924931,0.000087981076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012897444,0.0014228905,0.0061345636,0.000008675909,0.00019804864,0.000017426702,0.0016761444,0.9443743,0.012431233,0.023301132,0.00019494875,0.010111663],"study_design_scores_gemma":[0.0026643833,0.00041519484,0.027537415,0.00019654157,0.000016302587,0.000034425266,0.0012900775,0.9573889,0.0029573701,0.0050478806,0.001988869,0.00046268367],"about_ca_topic_score_codex":0.00004188888,"about_ca_topic_score_gemma":0.00007456354,"teacher_disagreement_score":0.9043584,"about_ca_system_score_codex":0.0005911689,"about_ca_system_score_gemma":0.00021573293,"threshold_uncertainty_score":0.998754},"labels":[],"label_agreement":null},{"id":"W2337514772","doi":"10.1016/j.ejor.2016.04.007","title":"A practical vehicle routing problem with desynchronized arrivals to depot","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"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é Laval; Transport Canada","funders":"","keywords":"Computer science; Heuristic; Operations research; Vehicle routing problem; Key (lock); Routing (electronic design automation); Duration (music); Component (thermodynamics); Mathematical optimization; Artificial intelligence; Computer network; Mathematics","score_opus":0.09863036971870431,"score_gpt":0.38735915200099236,"score_spread":0.28872878228228804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337514772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17507125,0.000036690846,0.80689263,0.0054867426,0.00007247224,0.00022692785,0.0000030198876,0.000054211083,0.012156047],"genre_scores_gemma":[0.6423325,0.000018157865,0.35701108,0.000046077443,0.00025848215,0.0000027203582,3.7652234e-7,0.000047685557,0.0002829557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964471,0.0014701787,0.0005140969,0.00015644543,0.0010251071,0.00038708135],"domain_scores_gemma":[0.9974877,0.0008382791,0.000065399734,0.00016769335,0.0011313311,0.0003095707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008054665,0.00011827033,0.00017191742,0.0002529736,0.00017928563,0.00019209406,0.00026957822,0.00002228116,0.00021197338],"category_scores_gemma":[0.002382027,0.00007429921,0.000040763312,0.00044062323,0.00006842015,0.00043541912,0.00007779741,0.00042998034,0.0002013878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009174255,0.0002351733,0.005699567,0.00008169193,0.00038184415,0.0016106663,0.0018287915,0.47469097,0.38284585,0.007765083,0.024188416,0.09975452],"study_design_scores_gemma":[0.03574741,0.014028182,0.096207924,0.008847106,0.0002067541,0.010240294,0.0020735664,0.3723828,0.31594583,0.0009463929,0.13910154,0.0042722235],"about_ca_topic_score_codex":8.2131055e-7,"about_ca_topic_score_gemma":0.0000011422622,"teacher_disagreement_score":0.4672612,"about_ca_system_score_codex":0.00020272571,"about_ca_system_score_gemma":0.00028178885,"threshold_uncertainty_score":0.3029834},"labels":[],"label_agreement":null},{"id":"W2338680530","doi":"10.1080/03155986.2016.1167357","title":"Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"","keywords":"City logistics; Vehicle routing problem; Transport engineering; Point (geometry); Business; Distribution (mathematics); Computer science; Routing (electronic design automation); Engineering","score_opus":0.08966874283481639,"score_gpt":0.3823053147348017,"score_spread":0.2926365718999853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338680530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021940652,0.0000762328,0.9687524,0.00029030017,0.00015071653,0.0011591315,0.0026141126,0.00011637633,0.004900111],"genre_scores_gemma":[0.9862997,0.000047765407,0.01210316,0.000045342913,0.00006900229,0.00033207674,0.0007739284,0.000014734262,0.0003143215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980832,0.00013420045,0.00079072674,0.00010750607,0.000674649,0.00020976584],"domain_scores_gemma":[0.99747306,0.00074765563,0.00007447259,0.0002415373,0.0013083621,0.00015492272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020755606,0.00011489115,0.0001915037,0.00044677826,0.00013616189,0.00015014497,0.00016410688,0.00008934871,0.000077949284],"category_scores_gemma":[0.00029737278,0.00009215988,0.00002182345,0.0008013136,0.000069716385,0.00068879616,0.0000134477905,0.000107431144,0.00009367704],"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.00009070633,0.000021237485,0.026070982,0.00021051263,0.00004808189,2.9209062e-7,0.0011059901,0.93185574,0.0005358055,0.017181037,0.0062649227,0.016614683],"study_design_scores_gemma":[0.0013247536,0.000093667986,0.47586465,0.00022793528,0.000009748912,8.592525e-7,0.00018897925,0.42577037,0.0015934594,0.000055888155,0.09447869,0.00039102088],"about_ca_topic_score_codex":0.0035622881,"about_ca_topic_score_gemma":0.00069025834,"teacher_disagreement_score":0.96435905,"about_ca_system_score_codex":0.00015896409,"about_ca_system_score_gemma":0.00030789743,"threshold_uncertainty_score":0.5385138},"labels":[],"label_agreement":null},{"id":"W2339305992","doi":"","title":"A Proximal Trust-Region Algorithm for Column Generation Stabilization","year":2003,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Trust region; Convergence (economics); Column (typography); Mathematical optimization; Generalization; Context (archaeology); Scheduling (production processes); Algorithm; Cutting-plane method; Dimension (graph theory); Point (geometry); Computer science; Mathematics; Combinatorics; Connection (principal bundle); Geometry; Computer network","score_opus":0.01847488940365453,"score_gpt":0.23466102340845912,"score_spread":0.2161861340048046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339305992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06531078,0.00010721567,0.93262035,0.000049589446,0.00045394903,0.00054615294,0.000008346579,0.00036215465,0.0005414734],"genre_scores_gemma":[0.10447791,0.00004436803,0.89431983,0.00008267119,0.00028119056,0.000174783,0.00008202216,0.000079157304,0.00045805456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.00010758171,0.00024664847,0.00021008655,0.00012371792,0.00023918677],"domain_scores_gemma":[0.99953884,0.000066557266,0.000048396152,0.00016859075,0.00011221015,0.000065421285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033165392,0.0001524386,0.00015073834,0.000090493646,0.00020473587,0.00007016809,0.00006729625,0.00018084365,0.000022594411],"category_scores_gemma":[0.00019196047,0.00017737036,0.000060054434,0.0002475059,0.000044412864,0.00016670415,0.0000038998437,0.00012054393,0.0000034058164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001855994,0.00011712116,0.0027160777,0.00021735774,0.00012483315,0.000008297966,0.0036327152,0.5748179,0.012745197,0.05759586,0.0056901868,0.34231588],"study_design_scores_gemma":[0.00066395366,0.000041206185,0.000092240996,0.000005588952,0.000021771168,0.0000145707545,0.0000858452,0.97801846,0.01055881,0.0005556207,0.009717971,0.0002239724],"about_ca_topic_score_codex":0.0000028095449,"about_ca_topic_score_gemma":0.0000036005083,"teacher_disagreement_score":0.40320054,"about_ca_system_score_codex":0.00020859632,"about_ca_system_score_gemma":0.000028103394,"threshold_uncertainty_score":0.72329533},"labels":[],"label_agreement":null},{"id":"W2340192962","doi":"","title":"Provide a Variable Neighborhood Search for Solving Multidimensional Two-Way Number Partitioning Problem","year":2014,"lang":"en","type":"article","venue":"Journal of academic and applied studies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variable neighborhood search; Swap (finance); Metaheuristic; Mathematical optimization; Generalization; Computer science; Set (abstract data type); Mathematics; Local search (optimization); Algorithm","score_opus":0.028330630320046988,"score_gpt":0.3137529698977157,"score_spread":0.2854223395776687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340192962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15007721,0.0014398604,0.84452814,0.0003798262,0.00023429513,0.00036141352,0.0000036953738,0.00009527319,0.002880293],"genre_scores_gemma":[0.6652276,0.00027848958,0.33401328,0.00007557583,0.00033535322,0.00001925917,6.622358e-7,0.000022872395,0.000026924434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893963,0.000031439184,0.00047092515,0.000117000476,0.00018676397,0.00025421975],"domain_scores_gemma":[0.9990784,0.00051367714,0.00014092588,0.000051263036,0.00013767151,0.00007805867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014025139,0.0001348159,0.00032755017,0.00005721023,0.00019379574,0.000019585354,0.000072714276,0.00008505763,0.0000048353813],"category_scores_gemma":[0.00016277948,0.00011282222,0.00004173896,0.00011139002,0.00004831777,0.00013510438,0.000052077314,0.0004653728,0.0000015310483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056230692,0.000021106034,0.0038887819,0.00044326796,0.000423199,6.919514e-7,0.0025906637,0.870603,0.069403276,0.035961155,0.0015375316,0.015071087],"study_design_scores_gemma":[0.006619699,0.00019115752,0.0012934785,0.001093533,0.00037632234,0.00017647896,0.003588088,0.90075403,0.0567299,0.023036778,0.0052894126,0.0008511132],"about_ca_topic_score_codex":5.256553e-7,"about_ca_topic_score_gemma":9.122451e-8,"teacher_disagreement_score":0.51515037,"about_ca_system_score_codex":0.000037855676,"about_ca_system_score_gemma":0.000023249002,"threshold_uncertainty_score":0.46007568},"labels":[],"label_agreement":null},{"id":"W2342453569","doi":"","title":"Periodic Airline Fleet Assignment with Time Windows, Spacing Constraints, and Time Dependent Revenues","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Schedule; Flow network; Computer science; Integer (computer science); Mathematical optimization; Operations research; Revenue; Assignment problem; Branch and bound; Integer programming; Mathematics; Economics; Algorithm; Finance","score_opus":0.006694028341198246,"score_gpt":0.2103561704440824,"score_spread":0.20366214210288414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342453569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07671166,0.0012589399,0.9166481,0.00043395386,0.000061289975,0.00074451824,0.000053864638,0.0013001228,0.0027875411],"genre_scores_gemma":[0.6594452,0.00011806146,0.3389835,0.0002618611,0.00005528002,0.00013014967,0.000021362537,0.00012438746,0.00086013315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979701,0.00023952396,0.00041497132,0.00039969242,0.00033680422,0.0006388871],"domain_scores_gemma":[0.99887794,0.00012828106,0.000116562434,0.0005123128,0.000057213358,0.00030771014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010266382,0.00039638806,0.0004323632,0.0002535308,0.0001989149,0.00017656815,0.00018266981,0.00022441361,0.00020154352],"category_scores_gemma":[0.00016718186,0.00039842256,0.00006253088,0.0003263178,0.00015278158,0.00022892533,0.0000557336,0.000400564,0.000040946576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009187058,0.0002036921,0.030287234,0.00019352495,0.00035038503,0.00023996686,0.0009817079,0.8424228,0.08729774,0.004691711,0.0021490073,0.031090396],"study_design_scores_gemma":[0.0019898,0.00029658203,0.00519875,0.00033450135,0.00015533113,0.0011185571,0.00016857375,0.9226576,0.063105404,0.00053148984,0.0030602878,0.0013831164],"about_ca_topic_score_codex":0.00011135709,"about_ca_topic_score_gemma":0.000046789744,"teacher_disagreement_score":0.5827336,"about_ca_system_score_codex":0.00037181083,"about_ca_system_score_gemma":0.00011214375,"threshold_uncertainty_score":0.99984676},"labels":[],"label_agreement":null},{"id":"W2342688946","doi":"10.5220/0005758103800387","title":"Prize Collecting Travelling Salesman Problem","year":2016,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Computer science; Algorithm","score_opus":0.022207906718143742,"score_gpt":0.24892213294514456,"score_spread":0.22671422622700083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342688946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018581416,0.000018253031,0.902295,0.00011170961,0.00011531736,0.000114582384,7.9627137e-7,0.0009831383,0.07777977],"genre_scores_gemma":[0.4651529,0.000020130858,0.5304175,0.000021596126,0.00006385964,0.000009393931,4.0999046e-7,0.000041868232,0.0042723184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993516,0.00003066129,0.00019013241,0.00012366571,0.0000867133,0.00021718814],"domain_scores_gemma":[0.9996018,0.00016940529,0.000018923953,0.0001252743,0.00003044991,0.00005415523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030987273,0.00009521062,0.000100794234,0.000062292536,0.000059409307,0.000023580966,0.00008445901,0.00005492,0.0002275234],"category_scores_gemma":[0.000057297133,0.00006877637,0.000028991222,0.00020822183,0.000012956092,0.00008685451,0.000013103998,0.00005735183,0.00006883319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011654772,0.000034884724,0.007418767,0.0001755914,0.00012462933,0.000008460702,0.0012206951,0.42194358,0.31056783,0.009568987,0.003434601,0.24549031],"study_design_scores_gemma":[0.0018056681,0.000055185537,0.0013855748,0.00029144407,0.000029588058,0.000035554083,0.00012286326,0.7248815,0.25592753,0.0026099337,0.011890063,0.0009650971],"about_ca_topic_score_codex":0.0000016318978,"about_ca_topic_score_gemma":0.000002780422,"teacher_disagreement_score":0.44657147,"about_ca_system_score_codex":0.000058079724,"about_ca_system_score_gemma":0.000011442569,"threshold_uncertainty_score":0.2804619},"labels":[],"label_agreement":null},{"id":"W2343587508","doi":"","title":"Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","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":"University of Guelph; Brock University","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Cluster analysis; Computer science; Genetic algorithm; Set (abstract data type); Mathematical optimization; Routing (electronic design automation); Extension (predicate logic); Data collection; Algorithm; Mathematics; Machine learning; Computer network","score_opus":0.01627377999709144,"score_gpt":0.25576780847252706,"score_spread":0.2394940284754356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343587508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24272883,0.00002718339,0.7531101,0.000005200723,0.00008383551,0.00037321795,0.000001152426,0.00059052586,0.0030799264],"genre_scores_gemma":[0.32522258,0.000001893629,0.6740275,0.00001675034,0.00009003806,0.0000063399757,0.0000019931856,0.000073388226,0.00055949646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985871,0.00006861982,0.000353502,0.00028638894,0.00022166016,0.00048278522],"domain_scores_gemma":[0.99938035,0.00010614007,0.000072257186,0.00018923105,0.00013980317,0.00011220311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006506032,0.00022906526,0.00021684082,0.00018800258,0.00020358225,0.00006349866,0.00009853513,0.00012108444,0.000054051492],"category_scores_gemma":[0.00003185149,0.00021866655,0.000042142474,0.00086011307,0.00003411859,0.00018108582,0.000031997948,0.00021312891,0.000026567828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016453461,0.000025053414,0.0037779221,0.000018446523,0.000054408512,0.000009013296,0.0006237017,0.95889336,0.030356808,0.000005370249,0.000011976416,0.0062074624],"study_design_scores_gemma":[0.00085285783,0.000056657846,0.0033141181,0.00004384026,0.000029901672,0.000046219324,0.0002969191,0.9495484,0.045496054,0.0000056405966,0.00001547216,0.00029386816],"about_ca_topic_score_codex":0.00009322115,"about_ca_topic_score_gemma":0.00003706587,"teacher_disagreement_score":0.08249375,"about_ca_system_score_codex":0.00031173698,"about_ca_system_score_gemma":0.0000397679,"threshold_uncertainty_score":0.8916963},"labels":[],"label_agreement":null},{"id":"W2366073799","doi":"10.1016/j.omega.2016.05.001","title":"Design-balanced capacitated multicommodity network design with heterogeneous assets","year":2016,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"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 Windsor","funders":"Program for New Century Excellent Talents in University; National Natural Science Foundation of China","keywords":"Tabu search; Network planning and design; Computer science; Mathematical optimization; Quality of service; Range (aeronautics); Metaheuristic; Mathematics; Computer network; Engineering","score_opus":0.032694311082114694,"score_gpt":0.24293606925179614,"score_spread":0.21024175816968144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366073799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041488767,0.00006269848,0.9570182,0.000046786667,0.00019670419,0.0002648023,0.000004530818,0.00074365584,0.00017385276],"genre_scores_gemma":[0.57063043,0.000013163137,0.429134,0.000022984314,0.000056667413,0.000026184329,0.0000018270418,0.000050398558,0.00006432122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987233,0.00027006047,0.00020101413,0.0002130335,0.00015967387,0.0004328968],"domain_scores_gemma":[0.9989306,0.0005071573,0.00004755417,0.00033352748,0.000064821885,0.000116342824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046945494,0.0002062148,0.00022212854,0.000049112117,0.00008241627,0.00003727266,0.0001663791,0.000100433565,0.0000439471],"category_scores_gemma":[0.00007751743,0.00014532718,0.000029953208,0.0002536471,0.000045863388,0.00011380325,0.000016664562,0.00010429854,0.000060692793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037855672,0.00001068355,0.0008303483,0.000008504914,0.000050151964,0.000015328047,0.00005285565,0.9831124,0.010423209,0.0000090535805,0.0006850273,0.0047645764],"study_design_scores_gemma":[0.0015611936,0.0001394085,0.0012332472,0.00012412241,0.00003251174,0.000045121145,0.0000033071124,0.942565,0.05298966,0.00017872694,0.00059677,0.00053093035],"about_ca_topic_score_codex":0.0000025451172,"about_ca_topic_score_gemma":0.0000021511664,"teacher_disagreement_score":0.52914166,"about_ca_system_score_codex":0.000105879226,"about_ca_system_score_gemma":0.000021377291,"threshold_uncertainty_score":0.59262705},"labels":[],"label_agreement":null},{"id":"W2375815961","doi":"","title":"A Double-layer Genetic Algorithm for Sprinkle Car Routing Problem Based on Multiple Depots","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Genetic algorithm; Coding (social sciences); Arc routing; Algorithm; Routing (electronic design automation); Vehicle routing problem; Population; Chromosome; Layer (electronics); Mathematical optimization; Routing algorithm; Mode (computer interface); Computer network; Routing protocol; Machine learning; Mathematics; Gene; Statistics","score_opus":0.023321242855003782,"score_gpt":0.2522590006457415,"score_spread":0.22893775779073774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375815961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005132942,0.00004271359,0.9919464,0.00005070453,0.000030382416,0.0017317713,0.000028133762,0.00069933024,0.00033760097],"genre_scores_gemma":[0.073069505,0.000005803967,0.9248536,0.00014526068,0.00022304333,0.0015101163,0.00004995332,0.00008489911,0.000057778365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880016,0.000023212504,0.00034282217,0.00036775824,0.00011763795,0.0003484394],"domain_scores_gemma":[0.99916667,0.0002085272,0.000058085374,0.00036386575,0.00010289003,0.00009995648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012083658,0.00021849012,0.00019188678,0.00012459581,0.00028875566,0.00004287851,0.00025764835,0.00010464101,0.000006878168],"category_scores_gemma":[0.0000012906974,0.00024925882,0.00009978302,0.00031764034,0.00002791013,0.000049712755,0.00003891435,0.00014616195,0.000044465127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035204148,0.00007067991,0.000808157,0.000040035404,0.000021936865,0.0000011879789,0.00015503363,0.85853994,0.0046216925,0.000044489407,0.0005203157,0.13517301],"study_design_scores_gemma":[0.0012333062,0.000018665673,0.0012302786,0.00001657329,0.000014400512,0.000016316328,0.0000036078386,0.9483735,0.015019855,0.000023184522,0.03378777,0.00026257656],"about_ca_topic_score_codex":0.000011129187,"about_ca_topic_score_gemma":0.0000020218677,"teacher_disagreement_score":0.13491043,"about_ca_system_score_codex":0.000098508644,"about_ca_system_score_gemma":0.000036327267,"threshold_uncertainty_score":0.99999595},"labels":[],"label_agreement":null},{"id":"W2397006241","doi":"10.1080/03155986.2003.11732674","title":"A Heuristic Procedure For Path Location With Multisource Demand","year":2003,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundación Séneca","keywords":"Correctness; Mathematical optimization; Heuristic; Directed acyclic graph; Path (computing); Computer science; Relaxation (psychology); Lagrangian relaxation; Mathematics; Algorithm","score_opus":0.03506155638362248,"score_gpt":0.32169213736743707,"score_spread":0.2866305809838146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397006241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02955921,0.00024757182,0.9612995,0.00005647266,0.000113050584,0.0016849253,0.0000359946,0.00012461352,0.006878666],"genre_scores_gemma":[0.9778014,0.00002419802,0.021183744,0.00003977257,0.00004781791,0.00051308906,0.000096539785,0.000015631531,0.00027783963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878526,0.000071557544,0.00037238607,0.000086625005,0.00045436455,0.0002297977],"domain_scores_gemma":[0.9983518,0.00026476008,0.00004152857,0.00011255068,0.0011378316,0.000091513364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017523448,0.000105396364,0.00011772661,0.00021110674,0.00032474607,0.00042313515,0.00006534094,0.00008357655,0.00000737329],"category_scores_gemma":[0.0007655997,0.00008740178,0.000012235377,0.00036347084,0.00004304916,0.0010147773,0.000009327405,0.00014105446,0.000020942569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029166962,0.000007708486,0.0012886642,0.0008507911,0.000025477202,1.9971864e-7,0.001566911,0.93105984,0.00004708918,0.062304087,0.0015401876,0.0012799088],"study_design_scores_gemma":[0.00076305674,0.00007984248,0.00085563597,0.00009836104,0.0000037346126,0.00003490831,0.0009773335,0.9463795,0.00015924042,0.00003960525,0.050465666,0.00014312769],"about_ca_topic_score_codex":0.0000118309135,"about_ca_topic_score_gemma":0.0000028850054,"teacher_disagreement_score":0.9482421,"about_ca_system_score_codex":0.00007792039,"about_ca_system_score_gemma":0.0001602236,"threshold_uncertainty_score":0.40803018},"labels":[],"label_agreement":null},{"id":"W2400260427","doi":"10.1080/03155986.2001.11732447","title":"An Effective Lagrangian Heuristic For The Generalized Assignment Problem","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Lagrangian relaxation; Heuristics; Mathematical optimization; Lagrangian; Heuristic; Generalized assignment problem; Weapon target assignment problem; Relaxation (psychology); Augmented Lagrangian method; Assignment problem; Computer science; Mathematics; Applied mathematics","score_opus":0.043323036663999955,"score_gpt":0.35773603116964453,"score_spread":0.3144129945056446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400260427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018916922,0.0002770824,0.97025466,0.00030408602,0.00028559152,0.003463876,0.00006597009,0.00015282282,0.006279005],"genre_scores_gemma":[0.98769844,0.00011530472,0.009743806,0.00009546155,0.00021679542,0.0016769617,0.00015402665,0.000016536764,0.0002826527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986527,0.00013719946,0.00038396963,0.0000786886,0.00049977674,0.0002476986],"domain_scores_gemma":[0.99847513,0.00063052966,0.000035325003,0.00016050575,0.0006064189,0.000092104914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029599764,0.00010091199,0.00011359959,0.00017003015,0.0005295152,0.0006877745,0.0001413777,0.000074505806,0.00001907356],"category_scores_gemma":[0.00019051105,0.000071612965,0.000025341269,0.00026824744,0.00004732624,0.0011136155,0.000020669759,0.00015210506,0.000027010545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035003493,0.000006749707,0.0002803341,0.00012218994,0.000036137073,2.0057878e-7,0.0014495178,0.943299,0.00014811892,0.029794188,0.0016386723,0.023189891],"study_design_scores_gemma":[0.000533835,0.00007324271,0.0013514041,0.000021749787,0.000004195881,0.000012714556,0.0006103393,0.89936143,0.00008378413,0.00005263007,0.09780144,0.00009324472],"about_ca_topic_score_codex":0.00008172889,"about_ca_topic_score_gemma":0.0000067395645,"teacher_disagreement_score":0.96878153,"about_ca_system_score_codex":0.00010816843,"about_ca_system_score_gemma":0.00004675282,"threshold_uncertainty_score":0.6632225},"labels":[],"label_agreement":null},{"id":"W2408645284","doi":"10.1080/03155986.2006.11732743","title":"Steiner Tree Problems With Profits","year":2006,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval; HEC Montréal","funders":"","keywords":"Steiner tree problem; Revenue; Travelling salesman problem; Combinatorics; Profit (economics); Computer science; Graph; Mathematics; Tree (set theory); Mathematical optimization; Mathematical economics; Economics; Microeconomics; Finance","score_opus":0.036671311259690066,"score_gpt":0.30265446007941355,"score_spread":0.26598314881972346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408645284","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18907806,0.0006618318,0.31039998,0.0005418963,0.00044114562,0.003907038,0.000109354434,0.0008242627,0.4940364],"genre_scores_gemma":[0.9902385,0.000018010684,0.00732342,0.000027482445,0.00014871538,0.0002761601,0.00017039543,0.000017146369,0.0017801604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984705,0.00005610855,0.00042974175,0.00007585448,0.00071647094,0.00025135343],"domain_scores_gemma":[0.9989555,0.00010224472,0.00003537508,0.00012633509,0.0007141487,0.00006643394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012543623,0.00010767661,0.000116988755,0.00029671972,0.00022993304,0.0005965007,0.00008941373,0.00007932145,0.000017291919],"category_scores_gemma":[0.000052153613,0.00008295275,0.000012221785,0.00041353362,0.00005464646,0.0016903903,0.000025537103,0.00018946943,0.000078944446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010858514,0.000005597348,0.002167605,0.00024130628,0.000014487647,4.4829127e-7,0.0003922063,0.9494909,0.00014856318,0.04068779,0.0034831224,0.0033570866],"study_design_scores_gemma":[0.00068099593,0.000072522875,0.004399111,0.00008867571,0.000002350135,0.000032917214,0.0003318668,0.8510604,0.00031009407,0.000029239683,0.14280508,0.00018675889],"about_ca_topic_score_codex":0.00014265988,"about_ca_topic_score_gemma":0.00001919543,"teacher_disagreement_score":0.80116045,"about_ca_system_score_codex":0.000074644115,"about_ca_system_score_gemma":0.00007620849,"threshold_uncertainty_score":0.575207},"labels":[],"label_agreement":null},{"id":"W2412110906","doi":"10.1016/j.ijpe.2016.05.015","title":"Optimizing transshipment workloads in less-than-truckload cross-docks","year":2016,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"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":"Transshipment (information security); Computer science; Workload; Truck; Scheduling (production processes); Operations research; Mathematical optimization; Job shop scheduling; Schedule; Mathematics; Engineering; Operating system","score_opus":0.022759307941540602,"score_gpt":0.2812607907588968,"score_spread":0.2585014828173562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412110906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89346474,0.00016173023,0.09853025,0.0017652127,0.0055225766,0.00006587477,0.0000050072754,0.000042032607,0.00044258864],"genre_scores_gemma":[0.96075845,0.0009005227,0.037162058,0.000028308119,0.0009088123,0.00000338231,0.0000010712428,0.00003058274,0.00020678736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987286,0.000042978474,0.0007678571,0.0001551378,0.0001416206,0.00016383527],"domain_scores_gemma":[0.9992744,0.00006670758,0.00023623656,0.00012321706,0.00023702392,0.000062457635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008434599,0.00012783754,0.00018913999,0.00037360724,0.000022704366,0.00008178875,0.0003213297,0.00007180474,0.00007901274],"category_scores_gemma":[0.00015978752,0.00011419378,0.00009603211,0.00008484066,0.000045310127,0.0007627655,0.000020635922,0.00017722178,0.000011704353],"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.00006741565,0.000030568015,0.013122022,0.000005788117,0.000094175804,0.000006602763,0.00035551708,0.9225982,0.00392743,0.00019985062,0.00006844648,0.059523992],"study_design_scores_gemma":[0.018668458,0.0004155425,0.13935104,0.0028136922,0.00014194149,0.0031066753,0.0015554684,0.166991,0.6063235,0.013233338,0.044228274,0.0031711035],"about_ca_topic_score_codex":0.0000026887133,"about_ca_topic_score_gemma":0.000010963998,"teacher_disagreement_score":0.7556072,"about_ca_system_score_codex":0.00069970003,"about_ca_system_score_gemma":0.000060761908,"threshold_uncertainty_score":0.46566874},"labels":[],"label_agreement":null},{"id":"W2421926607","doi":"10.1287/trsc.2015.0636","title":"A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Montréal; Université du Québec à Montréal","keywords":"Travelling salesman problem; Solver; Mathematical optimization; Latency (audio); Routing (electronic design automation); Computer science; Class (philosophy); Mathematics","score_opus":0.048006483369849966,"score_gpt":0.29373111238555594,"score_spread":0.24572462901570596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2421926607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05245016,0.00012678142,0.9464952,0.000076254044,0.000047892954,0.0006480571,0.000007456624,0.000049987993,0.00009824438],"genre_scores_gemma":[0.83189243,0.00003926966,0.16795643,0.000011963711,0.0000075424578,0.00007419817,0.0000033185393,0.000010233293,0.0000045977285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896365,0.000071014,0.00027710834,0.00016695246,0.00033327533,0.00018799707],"domain_scores_gemma":[0.9992219,0.00041464146,0.000066758636,0.00016840559,0.00010418551,0.000024079767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001997099,0.000089953224,0.00011898812,0.00020329007,0.00012396448,0.00003902539,0.0002648916,0.00003171607,0.0000016852247],"category_scores_gemma":[0.000018392135,0.000044613254,0.00002698693,0.0016414681,0.00012413123,0.00027701608,6.4141153e-7,0.00004951341,2.016384e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021318008,0.000010892756,0.0005295347,0.000039734477,0.0000061602937,2.1816238e-7,0.0015973472,0.9777717,0.01714078,0.001782497,0.0000031164404,0.0010966858],"study_design_scores_gemma":[0.00068387715,0.000039872677,0.009847703,0.000050807837,0.000032264506,0.000002880182,0.000506177,0.98207563,0.0065841,0.0000718394,0.0000058442683,0.0000989958],"about_ca_topic_score_codex":0.000037433376,"about_ca_topic_score_gemma":0.0000046666682,"teacher_disagreement_score":0.7794423,"about_ca_system_score_codex":0.000040580046,"about_ca_system_score_gemma":0.00005276928,"threshold_uncertainty_score":0.18192758},"labels":[],"label_agreement":null},{"id":"W2464648258","doi":"10.1080/02827581.2016.1206144","title":"Detailed scheduling of harvest teams and robust use of harvest and transportation resources","year":2016,"lang":"en","type":"article","venue":"Scandinavian Journal of Forest Research","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é Laval","funders":"","keywords":"Scheduling (production processes); Schedule; Computer science; Procurement; Operations research; Process (computing); Industrial engineering; Operations management; Engineering; Business","score_opus":0.05462089395413105,"score_gpt":0.308446683804028,"score_spread":0.25382578984989695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464648258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96768486,0.00060212874,0.031381574,0.00009155819,0.000047689955,0.000112226655,0.00001830759,0.0000113003425,0.000050355226],"genre_scores_gemma":[0.952881,0.00052014773,0.046396695,0.0000011309689,0.00005037531,0.0000016316616,0.0000011759277,0.00002820548,0.00011965636],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99832654,0.00020962428,0.00060094125,0.0001232367,0.00047389825,0.00026576692],"domain_scores_gemma":[0.9984106,0.000581248,0.0001978443,0.00014869748,0.00047240814,0.00018924655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982103,0.000114387374,0.00031206623,0.00049424666,0.00007464193,0.000063657935,0.00015226693,0.00009094148,0.000021008229],"category_scores_gemma":[0.0005851241,0.000084029416,0.00005482833,0.00036082655,0.00034242994,0.0005854444,0.000017116026,0.00028621854,4.6046753e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011739556,0.000024515803,0.9185497,0.00024140686,0.00006245517,0.000014469409,0.0007384128,0.0568362,0.017258918,0.00022494297,0.000034196262,0.005897364],"study_design_scores_gemma":[0.0012746638,0.00034203593,0.98160887,0.0013855133,0.0000305961,0.000042655545,0.00030529252,0.006191513,0.008369063,0.00023288548,0.00009388312,0.00012300276],"about_ca_topic_score_codex":0.00003264476,"about_ca_topic_score_gemma":0.00013806783,"teacher_disagreement_score":0.06305917,"about_ca_system_score_codex":0.000048815662,"about_ca_system_score_gemma":0.000045126137,"threshold_uncertainty_score":0.342662},"labels":[],"label_agreement":null},{"id":"W2464795612","doi":"10.1007/s10878-018-0281-y","title":"Optimum turn-restricted paths, nested compatibility, and optimum convex polygons","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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 British Columbia","funders":"","keywords":"Mathematics; Theory of computation; Compatibility (geochemistry); Cutting-plane method; Regular polygon; Mathematical optimization; Combinatorics; Integer programming; Algorithm; Geometry","score_opus":0.013462062895030939,"score_gpt":0.2613608915506082,"score_spread":0.24789882865557727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464795612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1767209,0.00035611563,0.8120822,0.00024249178,0.008568142,0.00039223337,0.000012141966,0.000302967,0.0013228087],"genre_scores_gemma":[0.73246145,0.00016117113,0.26635498,0.000040260857,0.00088346866,0.0000024974725,0.000012392445,0.00006617303,0.0000176276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977541,0.00027879578,0.0009991,0.00019974807,0.0004506342,0.0003176543],"domain_scores_gemma":[0.9976638,0.0002673074,0.0004651103,0.00027833684,0.001063132,0.00026229123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075207005,0.0002824437,0.0005387263,0.00036199836,0.00016807776,0.0001721154,0.00027368066,0.00025153274,0.00009877647],"category_scores_gemma":[0.0005987437,0.00028187942,0.00009758153,0.0007591706,0.00016092621,0.00059814664,0.000067911256,0.0003966065,0.000004974376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117032774,0.000106123094,0.0016685136,0.00003782767,0.00009488672,0.000009527177,0.00043232978,0.99357754,0.0011006375,0.0008261983,0.0010308451,0.000998517],"study_design_scores_gemma":[0.002873867,0.0005217673,0.002037068,0.000087014436,0.00010344616,0.00009008652,0.00007354196,0.9909204,0.0018245782,0.0006676734,0.00047279807,0.00032771347],"about_ca_topic_score_codex":0.000005975561,"about_ca_topic_score_gemma":3.2086652e-7,"teacher_disagreement_score":0.55574054,"about_ca_system_score_codex":0.00015392751,"about_ca_system_score_gemma":0.00011061868,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W2468155677","doi":"10.1287/trsc.2015.0634","title":"Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Discretization; Mathematical optimization; Integer programming; Flow network; Lagrangian relaxation; Multi-commodity flow problem; Piecewise linear function; Mathematics; Flow (mathematics); Linear programming relaxation; Relaxation (psychology); Integer (computer science); Linear programming; Constraint (computer-aided design); Set (abstract data type); Branch and cut; Computer science","score_opus":0.020525424923256673,"score_gpt":0.2780080266119627,"score_spread":0.25748260168870607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468155677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027281538,0.000020686004,0.97122544,0.00023200373,0.00025908335,0.00039374587,0.00011881399,0.00033613152,0.00013255188],"genre_scores_gemma":[0.75558764,0.000018999366,0.2440423,0.000025784839,0.000053717995,0.00006332139,0.00008827475,0.00002279418,0.00009713558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988308,0.000017890909,0.00034241992,0.00025076384,0.00025933172,0.0002987849],"domain_scores_gemma":[0.99927056,0.0001307093,0.000062503575,0.00020714299,0.00022760453,0.00010149564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073118694,0.00012102401,0.0001170314,0.00007867015,0.00022888512,0.000034908346,0.00019994243,0.000056049113,0.000031387568],"category_scores_gemma":[0.00011191493,0.000091781905,0.00004044587,0.0006797738,0.00014238602,0.0007145714,0.0000030075646,0.00005440154,0.0000070240785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000501754,0.000010652355,0.0028396817,0.000019880106,0.000003738498,5.2624113e-8,0.0003504036,0.9718738,0.015192687,0.0008850663,0.00020216887,0.008616858],"study_design_scores_gemma":[0.00044533057,0.000017151538,0.006346729,0.000051018807,0.000012038199,2.1212578e-7,0.000015512833,0.984517,0.0056365156,0.0005231739,0.0022599983,0.0001753385],"about_ca_topic_score_codex":0.0000039255306,"about_ca_topic_score_gemma":0.000023867251,"teacher_disagreement_score":0.7283061,"about_ca_system_score_codex":0.00008545324,"about_ca_system_score_gemma":0.00003881785,"threshold_uncertainty_score":0.37427574},"labels":[],"label_agreement":null},{"id":"W2469651670","doi":"10.1007/s11590-016-1004-x","title":"General variable neighborhood search for the uncapacitated single allocation p-hub center problem","year":2016,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"Natural Sciences and Engineering Research Council of Canada; National Research University Higher School of Economics; Russian Science Foundation","keywords":"Benchmark (surveying); Variable neighborhood search; Heuristic; Mathematical optimization; Variable (mathematics); Descent (aeronautics); Computer science; Local search (optimization); Ant colony optimization algorithms; Mathematics; Metaheuristic; Engineering","score_opus":0.018576060220996726,"score_gpt":0.23410725908140795,"score_spread":0.21553119886041122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469651670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009149132,0.000023140297,0.9911734,0.005460791,0.00035404108,0.0005888964,0.00002884822,0.00038162648,0.0010743854],"genre_scores_gemma":[0.06470676,0.00004968205,0.9326487,0.0013073839,0.00028985733,0.00018105393,0.00011196276,0.00012673621,0.0005778266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988111,0.00009831277,0.00030203632,0.0002351665,0.00019179456,0.00036154868],"domain_scores_gemma":[0.99912834,0.0002902089,0.00005594852,0.00029179937,0.00017210115,0.00006158414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044925814,0.00017630357,0.0001300519,0.00009829743,0.00017032096,0.00010668304,0.00020649502,0.0000819216,0.00015559097],"category_scores_gemma":[0.000070492046,0.00012171324,0.000052355732,0.00038024713,0.000050757193,0.00032105055,0.000023729901,0.00008088529,0.000011260205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010534849,0.00002052011,0.0001875345,0.00002184551,0.000049311846,1.657926e-7,0.000118412914,0.94901514,0.043038774,0.0009936837,0.003344067,0.0032000218],"study_design_scores_gemma":[0.0008989245,0.00002185071,0.00004671655,0.000034932793,0.00002320981,0.0000032599246,0.000014047532,0.9893632,0.005893303,0.00002790513,0.003474146,0.00019850221],"about_ca_topic_score_codex":0.0000035334194,"about_ca_topic_score_gemma":5.135687e-7,"teacher_disagreement_score":0.06379184,"about_ca_system_score_codex":0.00016921047,"about_ca_system_score_gemma":0.00001994299,"threshold_uncertainty_score":0.4963322},"labels":[],"label_agreement":null},{"id":"W2470126219","doi":"10.1016/j.dam.2016.05.030","title":"A heuristic for cumulative vehicle routing using column generation","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Mathematical optimization; Vehicle routing problem; Rounding; Linear programming; Heuristic; Cover (algebra); Routing (electronic design automation); Scalability; Linear programming relaxation; Mathematics; Set (abstract data type); Randomized rounding; Relaxation (psychology); Computer science; Engineering","score_opus":0.050046411098905806,"score_gpt":0.2985779523229441,"score_spread":0.24853154122403828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470126219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106619164,0.000012405782,0.8908612,0.00002129233,0.000103149025,0.00050763367,0.00002683394,0.0003127911,0.0015355244],"genre_scores_gemma":[0.5329017,0.0000028399813,0.4667883,0.000013711333,0.0001175262,0.000054940738,0.000007949715,0.000064982145,0.000048021495],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989295,0.000015609932,0.000402602,0.0001958335,0.00015857999,0.0002978596],"domain_scores_gemma":[0.999162,0.00034454337,0.00010809012,0.00025527013,0.00006480097,0.000065287764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003975483,0.00018487468,0.00024276033,0.00005639889,0.00013467569,0.000053912074,0.00011387184,0.00008997892,0.000023268283],"category_scores_gemma":[0.00018161153,0.00015350331,0.000058961024,0.00014850587,0.000034671542,0.00009535432,0.000032084,0.000057650097,0.000015766642],"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.000010514008,0.0000353389,0.000037704773,0.00031510208,0.000101325175,9.0461515e-7,0.0022848805,0.32231402,0.60076565,0.06577017,0.00027526918,0.008089109],"study_design_scores_gemma":[0.0005292565,0.00001047864,0.000010171087,0.00005899744,0.00004642616,0.0000018979806,0.00014462946,0.96534663,0.029284988,0.0042657964,0.00006348604,0.00023722324],"about_ca_topic_score_codex":0.0000010426653,"about_ca_topic_score_gemma":0.000001239398,"teacher_disagreement_score":0.6430326,"about_ca_system_score_codex":0.00012089479,"about_ca_system_score_gemma":0.000017057733,"threshold_uncertainty_score":0.62596834},"labels":[],"label_agreement":null},{"id":"W2471190594","doi":"10.1109/tsmc.2016.2582745","title":"Vehicle Routing Problems for Drone Delivery","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1245,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Drone; Payload (computing); Computer science; Energy consumption; Mathematical optimization; Simulation; Mathematics; Engineering; Computer network; Network packet; Electrical engineering","score_opus":0.019460758773565952,"score_gpt":0.22406171796139102,"score_spread":0.20460095918782506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471190594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05203975,0.0006322786,0.94280714,0.000037059926,0.0020718584,0.0010116819,0.00008222451,0.00056905526,0.000748977],"genre_scores_gemma":[0.994726,0.00018801018,0.0011947034,0.000010120454,0.00017223817,0.00031274548,0.0000017068536,0.00010684296,0.00328766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827695,0.00013388213,0.0005906231,0.0003436411,0.00023753803,0.00041737815],"domain_scores_gemma":[0.9989587,0.00032661535,0.00009972926,0.0003321653,0.00012107654,0.00016169077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005720535,0.00027989977,0.00037089403,0.00015825586,0.00019198877,0.00015398445,0.0001398121,0.00019464173,0.0000061183305],"category_scores_gemma":[0.000007372527,0.00023111077,0.00008693745,0.00016726079,0.000049602382,0.00013953338,0.0000015837344,0.00012739585,0.000036142555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022903083,0.00005248746,0.00011237044,0.0008050668,0.0001828667,0.0000023176517,0.0005422461,0.9570262,0.024458159,0.0008236251,0.00038285195,0.015588894],"study_design_scores_gemma":[0.0016963762,0.00018211053,0.00005686441,0.0010788849,0.00008593097,0.000055370434,0.00042736388,0.9850734,0.0052739703,0.000019447167,0.0054710847,0.00057919574],"about_ca_topic_score_codex":0.00007884951,"about_ca_topic_score_gemma":0.000011797373,"teacher_disagreement_score":0.9426862,"about_ca_system_score_codex":0.00014750892,"about_ca_system_score_gemma":0.00001705496,"threshold_uncertainty_score":0.94244236},"labels":[],"label_agreement":null},{"id":"W2493658341","doi":"10.1007/978-3-319-33461-5_8","title":"Exact Algorithms for the Chance-Constrained Vehicle Routing Problem","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"Computer science; Vehicle routing problem; Routing (electronic design automation); Algorithm; Mathematical optimization; Computer network; Mathematics","score_opus":0.022987443722590362,"score_gpt":0.2638290936142523,"score_spread":0.2408416498916619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493658341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013086848,0.0002999984,0.99424225,0.00046003825,0.0011683236,0.00066868245,0.000015342774,0.0002881713,0.002844078],"genre_scores_gemma":[0.048709095,0.000053605818,0.94920325,0.00029648357,0.0011308201,0.000042899203,0.000003011864,0.0001038351,0.00045698247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980903,0.000019298157,0.00038664922,0.0005818254,0.0003624531,0.0005594268],"domain_scores_gemma":[0.997772,0.0013509805,0.00012509659,0.0005346992,0.00014256568,0.000074686235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012965361,0.00036037457,0.0003249783,0.00020964647,0.00025260565,0.00017802902,0.00088154786,0.00022865598,0.000024547806],"category_scores_gemma":[0.00013061144,0.00024976235,0.00010231127,0.00023018225,0.00038035336,0.00016375467,0.00016973335,0.00042745587,0.0000096667745],"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.000001543302,0.0000016829043,0.0000067693663,0.00002794585,0.0000107560545,0.000001704855,0.00020180138,0.38366315,0.000270456,0.0011953744,0.000004874364,0.61461395],"study_design_scores_gemma":[0.0002604456,0.000035014178,0.000017030286,0.0003448663,0.000011039247,0.00001253361,2.1513605e-7,0.9832648,0.0018018781,0.013042095,0.0008551163,0.00035497843],"about_ca_topic_score_codex":0.0000021468882,"about_ca_topic_score_gemma":0.0000060333587,"teacher_disagreement_score":0.61425894,"about_ca_system_score_codex":0.00021435042,"about_ca_system_score_gemma":0.00012880583,"threshold_uncertainty_score":0.99999547},"labels":[],"label_agreement":null},{"id":"W24951642","doi":"10.1093/brain/awu159","title":"A Two-phase Method for the Vehicle Routing Problems with Time Windows","year":2004,"lang":"en","type":"article","venue":"IE interfaces","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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":"Vehicle routing problem; Heuristic; Mathematical optimization; Minification; Phase (matter); Computer science; Routing (electronic design automation); Service (business); Ant colony optimization algorithms; Mathematics; Computer network; Economics","score_opus":0.020034448154376893,"score_gpt":0.3088643148755291,"score_spread":0.28882986672115224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24951642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072762124,0.00024308293,0.9244339,0.00042571162,0.00013261993,0.0005871985,0.000010554414,0.00047411709,0.0009307169],"genre_scores_gemma":[0.6300525,0.000003990869,0.36948752,0.00006014939,0.00008211065,0.00009073657,0.0000025761121,0.00005895608,0.00016145408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990399,0.00005403435,0.00025320615,0.00020600518,0.0001346257,0.00031224304],"domain_scores_gemma":[0.99914074,0.0004173578,0.00006364311,0.00025587445,0.00007083798,0.000051548926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045936,0.00018463876,0.000191773,0.00004889572,0.00014034055,0.000112463444,0.0002576912,0.000051751995,0.000038692062],"category_scores_gemma":[0.00008932528,0.00012611687,0.000048953214,0.00021513757,0.000040945684,0.0001567335,0.000033220436,0.0001749112,0.00003752141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028027658,0.000023246725,0.000027612941,0.000026690674,0.00008103261,0.0000011065284,0.0010641697,0.9544985,0.029987603,0.00013266923,0.00005597293,0.0140733365],"study_design_scores_gemma":[0.0022495002,0.00015016158,0.0000140353795,0.00010969501,0.00004709043,0.000016808279,0.00017308985,0.8635806,0.13236998,0.00024819598,0.00084392895,0.00019691596],"about_ca_topic_score_codex":0.000048754315,"about_ca_topic_score_gemma":0.000025367075,"teacher_disagreement_score":0.5572904,"about_ca_system_score_codex":0.00007573639,"about_ca_system_score_gemma":0.000025961928,"threshold_uncertainty_score":0.5142897},"labels":[],"label_agreement":null},{"id":"W2502871266","doi":"","title":"The vehicle routing problem with hard time windows and stochastic service times","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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; Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Vehicle routing problem; Service (business); Routing (electronic design automation); Computer network; Economics","score_opus":0.006517015085209186,"score_gpt":0.20012147893694998,"score_spread":0.1936044638517408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502871266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1387921,0.00071478955,0.85133004,0.004126042,0.00005028023,0.001541996,0.000010402672,0.002225691,0.00120865],"genre_scores_gemma":[0.6817347,0.000040828512,0.3152994,0.00086116506,0.00009479143,0.0006857436,0.000009363016,0.00017129628,0.0011026999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981741,0.00013033784,0.000384986,0.00031950136,0.00027218912,0.00071888923],"domain_scores_gemma":[0.9986077,0.00033666828,0.0001087592,0.00056569075,0.00017181959,0.00020937844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068108685,0.00033957843,0.00028434946,0.00012827378,0.00043704276,0.00046527685,0.00036324887,0.0001726885,0.00004866872],"category_scores_gemma":[0.000102428705,0.00026313993,0.00004514856,0.00054830604,0.00007921865,0.00042144198,0.00013596177,0.0004211893,0.000083650266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031238065,0.000034564782,0.005383227,0.00006740136,0.00011636555,0.000005915085,0.000561735,0.9478616,0.014398512,0.001615073,0.002043734,0.02788061],"study_design_scores_gemma":[0.00038396043,0.000052671872,0.011126323,0.00007363019,0.000030362651,0.00006284115,0.00008725901,0.9854687,0.0016597505,0.00044387052,0.00026262493,0.00034800713],"about_ca_topic_score_codex":0.00136931,"about_ca_topic_score_gemma":0.00027215565,"teacher_disagreement_score":0.5429426,"about_ca_system_score_codex":0.00017463023,"about_ca_system_score_gemma":0.00006324444,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W2508993989","doi":"10.1109/jsyst.2016.2601058","title":"A Game Theoretic Approach for the Real-Life Multiple-Criterion Vehicle Routing Problem With Multiple Time Windows","year":2016,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"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":"King Fahd University of Petroleum and Minerals","keywords":"Tabu search; Vehicle routing problem; Mathematical optimization; Nash equilibrium; Computer science; Routing (electronic design automation); Heuristic; Pareto principle; Multi-objective optimization; Game theory; Set (abstract data type); Operations research; Mathematics; Mathematical economics","score_opus":0.01861246419664608,"score_gpt":0.23866956915820584,"score_spread":0.22005710496155975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508993989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079446115,0.0001716327,0.9178645,0.00008153821,0.00050280726,0.0010984804,0.000021469057,0.0003137661,0.0004996976],"genre_scores_gemma":[0.9598897,0.000046135436,0.038579922,0.000018433238,0.00087207323,0.00015462423,0.0000025923375,0.00013633758,0.0003001804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772733,0.000363757,0.00067798793,0.00026399604,0.0003792215,0.0005877179],"domain_scores_gemma":[0.9977038,0.0011932126,0.00028163422,0.00037091135,0.00023899296,0.00021148374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024120153,0.00029800736,0.0003839152,0.000109031695,0.00033780193,0.0002579057,0.00037196514,0.00013674232,0.000010603987],"category_scores_gemma":[0.0002957624,0.00015844256,0.00012715813,0.00021310395,0.00008702326,0.00028145954,0.000022541255,0.0003031731,0.000018557395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104955405,0.000024964336,0.0063039064,0.00017791154,0.0001678437,0.000005065381,0.00083730574,0.96188384,0.02790031,0.00008752648,0.00023660617,0.0022697512],"study_design_scores_gemma":[0.0024846164,0.000088884306,0.0005881111,0.00042032017,0.000058103844,0.0003499461,0.0001499899,0.9943513,0.0009089916,0.000017783426,0.00028777288,0.00029412462],"about_ca_topic_score_codex":0.000016349682,"about_ca_topic_score_gemma":0.0000014639662,"teacher_disagreement_score":0.8804436,"about_ca_system_score_codex":0.00019063202,"about_ca_system_score_gemma":0.00006897058,"threshold_uncertainty_score":0.64611},"labels":[],"label_agreement":null},{"id":"W2514584850","doi":"10.1007/978-3-319-44953-1_21","title":"Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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 Toronto","funders":"","keywords":"Mathematical optimization; Integer programming; Computer science; Heuristics; Constraint programming; Quadratically constrained quadratic program; Quadratic growth; Quadratic programming; Integer (computer science); Nonlinear programming; Mathematics; Algorithm; Stochastic programming; Nonlinear system","score_opus":0.02049755106873633,"score_gpt":0.259341411781627,"score_spread":0.23884386071289068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2514584850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015217884,0.0001258765,0.9921907,0.00025206903,0.0010197253,0.0011262891,0.000024470197,0.00043042656,0.0048152236],"genre_scores_gemma":[0.053494815,0.000014016882,0.94552076,0.00023773625,0.0003860463,0.000055245826,0.0000087419385,0.0000939537,0.0001886978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745333,0.000024642692,0.00065635523,0.0007546999,0.00042600872,0.00068498304],"domain_scores_gemma":[0.9978265,0.0010764713,0.00014738095,0.00048744565,0.00028955925,0.00017261761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010734976,0.00049107807,0.00055437715,0.00045248817,0.00012215806,0.0002498693,0.0007137294,0.0003986834,0.000059362857],"category_scores_gemma":[0.0003473969,0.00041011348,0.00013079651,0.0002565069,0.00097074616,0.00017496513,0.0001376175,0.00054556475,0.000012686646],"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.0000032765383,0.00000816671,0.000012626937,0.0001580169,0.00002360511,0.0000068808663,0.0002497373,0.22013673,0.0004720293,0.01293835,0.00000605345,0.76598454],"study_design_scores_gemma":[0.000521154,0.00013339426,0.0000042021757,0.0008454445,0.000019564197,0.000037169648,5.060511e-7,0.9586427,0.001033059,0.035723574,0.002312704,0.00072652684],"about_ca_topic_score_codex":0.000001045172,"about_ca_topic_score_gemma":0.000007768117,"teacher_disagreement_score":0.765258,"about_ca_system_score_codex":0.00028631472,"about_ca_system_score_gemma":0.00030435243,"threshold_uncertainty_score":0.9998351},"labels":[],"label_agreement":null},{"id":"W2515696021","doi":"10.1287/ijoc.2016.0706","title":"The Surgical Patient Routing Problem: A Central Planner Approach","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Western University","funders":"University of Pittsburgh; U.S. Department of Veterans Affairs; VA Pittsburgh Healthcare System; Office of Research and Development; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Planner; Computer science; Integer programming; Solver; Scheduling (production processes); Vehicle routing problem; Health care; Routing (electronic design automation); Operations research; Mathematical optimization; Artificial intelligence; Computer network; Algorithm","score_opus":0.012822173578996073,"score_gpt":0.23385218253269335,"score_spread":0.2210300089536973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515696021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3271734,0.00014314573,0.6323997,0.00042940528,0.0016093606,0.00030862162,0.000003220365,0.0005733756,0.03735981],"genre_scores_gemma":[0.96504974,0.0000389246,0.034234222,0.00006103821,0.00050874543,0.000002030641,9.5269803e-7,0.000038657236,0.000065684515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998049,0.00007802614,0.00067487283,0.00012083552,0.00038859138,0.0006886301],"domain_scores_gemma":[0.9988243,0.00053616735,0.0001978539,0.00016816266,0.00008489738,0.00018859869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011119071,0.00019757444,0.00018129428,0.00007944575,0.00055606687,0.00027178437,0.00027528396,0.00008261313,0.000010458235],"category_scores_gemma":[0.0001443483,0.00009617421,0.00011293241,0.0001887314,0.000041191302,0.00022101574,0.00005505514,0.00049112405,0.000020872596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020804368,0.000012564988,0.0011338755,0.000007985395,0.000040162406,0.000017354558,0.00059136323,0.5972926,0.000031359974,0.0012708316,0.00041754666,0.39916354],"study_design_scores_gemma":[0.001405772,0.00015138728,0.00104843,0.00037402398,0.000011462731,0.0012919817,0.00027770846,0.9580064,0.000551162,0.0002492654,0.036182098,0.0004502977],"about_ca_topic_score_codex":8.450114e-7,"about_ca_topic_score_gemma":1.6083183e-7,"teacher_disagreement_score":0.63787633,"about_ca_system_score_codex":0.00020617769,"about_ca_system_score_gemma":0.000036333207,"threshold_uncertainty_score":0.4276873},"labels":[],"label_agreement":null},{"id":"W2518829358","doi":"10.1002/nav.21701","title":"Column generation for stochastic green telecommunication network planning with switchable base stations","year":2016,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","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":"Western University","funders":"","keywords":"Column generation; Base station; Mathematical optimization; Computer science; Column (typography); Base (topology); Energy consumption; Reduction (mathematics); Telecommunications network; Network planning and design; Scheme (mathematics); Operations research; Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.20237634617127043,"score_gpt":0.401718522681826,"score_spread":0.19934217651055558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518829358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043823356,0.00015259851,0.99325264,0.0003989192,0.000119432625,0.000710952,0.00006729429,0.00022990996,0.00068593945],"genre_scores_gemma":[0.6396829,0.00003712316,0.35872254,0.000022073817,0.00039692354,0.0002757871,0.00010303066,0.00007292795,0.0006867016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802774,0.0002761292,0.00031022934,0.00026714144,0.0004741765,0.0006445811],"domain_scores_gemma":[0.99595934,0.002536093,0.00005917145,0.0005164519,0.0007749793,0.00015398047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025087595,0.00015091614,0.0001784581,0.00017417206,0.00049737934,0.000109697976,0.00030844516,0.00012217775,0.00003417527],"category_scores_gemma":[0.0022996087,0.0001241746,0.000029336114,0.00053597643,0.00013639012,0.00016405826,0.00007152146,0.00030815325,0.00002414078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050654206,0.000021506776,0.0002323983,0.000040807034,0.00003429175,0.0000020452635,0.0001235301,0.9763256,0.005666968,0.0033404378,0.0049004476,0.009261371],"study_design_scores_gemma":[0.00072945136,0.00022697508,0.0002502048,0.00011111743,0.000018819053,0.0000033696424,0.00004578446,0.9935603,0.0008257088,0.0026659714,0.0013577185,0.0002045543],"about_ca_topic_score_codex":0.000059862825,"about_ca_topic_score_gemma":0.0001413953,"teacher_disagreement_score":0.6353006,"about_ca_system_score_codex":0.00030378913,"about_ca_system_score_gemma":0.00016367395,"threshold_uncertainty_score":0.50636935},"labels":[],"label_agreement":null},{"id":"W2523297565","doi":"10.1080/00207543.2016.1231940","title":"A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints","year":2016,"lang":"en","type":"article","venue":"International Journal of Production Research","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":"Concordia University","funders":"","keywords":"Column generation; Mathematical optimization; Heuristic; FIFO and LIFO accounting; Benchmark (surveying); Tabu search; Vehicle routing problem; Computer science; Routing (electronic design automation); Computation; Algorithm; Mathematics; FIFO (computing and electronics)","score_opus":0.09263538036986169,"score_gpt":0.354699556474901,"score_spread":0.2620641761050393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523297565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19506933,0.000077777724,0.7953889,0.0076027983,0.0012281641,0.00048634637,0.000015499063,0.000055914817,0.00007532832],"genre_scores_gemma":[0.9409953,0.000009637097,0.057782248,0.00002528464,0.0010020616,0.00003325725,0.0000036061015,0.00003078315,0.0001178601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798346,0.00018025082,0.00043740674,0.00017240565,0.0009784627,0.00024801382],"domain_scores_gemma":[0.9955044,0.00087349495,0.00016253727,0.00013406163,0.0032575133,0.00006800175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038613034,0.00010325464,0.00012311329,0.0002956619,0.000215938,0.00011941639,0.00029378914,0.00004938071,0.000084464606],"category_scores_gemma":[0.0015770982,0.000062462634,0.000056113182,0.0002821248,0.00022258135,0.00028004337,0.000022098826,0.00028672596,0.000006346687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029260243,0.000064133805,0.0018581481,0.00002609923,0.00031056226,0.000014239658,0.00018778423,0.7482549,0.19867902,0.0006042649,0.0036288667,0.046079375],"study_design_scores_gemma":[0.0021244206,0.00025177508,0.001297755,0.00042995618,0.00003277565,0.00026115234,0.00011457402,0.91651446,0.07714944,0.0005400214,0.0010902797,0.00019337474],"about_ca_topic_score_codex":0.0000082672095,"about_ca_topic_score_gemma":0.000022244356,"teacher_disagreement_score":0.74592596,"about_ca_system_score_codex":0.00032222498,"about_ca_system_score_gemma":0.00021243897,"threshold_uncertainty_score":0.25471523},"labels":[],"label_agreement":null},{"id":"W2524034199","doi":"10.1287/trsc.2016.0709","title":"50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing","year":2016,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":147,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Operations research; Stochastic modelling; Service (business); Sketch; Key (lock); Stochastic process; Stochastic optimization; Mathematical optimization; Management science; Engineering; Mathematics; Marketing; Computer security; Algorithm; Computer network; Business","score_opus":0.03834316816566709,"score_gpt":0.3306429495440477,"score_spread":0.29229978137838064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524034199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87607706,0.000048083202,0.12224631,0.0006763124,0.00021998241,0.00015246839,0.000009086029,0.00026968252,0.00030100573],"genre_scores_gemma":[0.99312305,0.000028210776,0.006694063,0.000028590148,0.000050706847,0.000013412392,0.0000018364155,0.000016525099,0.00004358294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9984684,0.00007316053,0.0002578185,0.00027895067,0.0004978495,0.00042384115],"domain_scores_gemma":[0.99925274,0.00021566435,0.000026156464,0.00019367595,0.00019686551,0.00011490469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017294153,0.00008924102,0.00009765093,0.00049188366,0.00021959005,0.00004159773,0.00022131606,0.000053688447,0.000040666822],"category_scores_gemma":[0.00018018715,0.0000771401,0.000021728187,0.0032232532,0.0002526042,0.00071404385,0.0000056223184,0.00018539795,0.000027604736],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024478833,0.000058069963,0.044918317,0.000020060805,0.000007631355,0.000014554839,0.007994147,0.4583557,0.4312591,0.002255878,0.00008969058,0.055002373],"study_design_scores_gemma":[0.00086517073,0.00003024958,0.72141916,0.00013016732,0.0000067010255,0.0000020111775,0.0012503251,0.25501683,0.020267114,0.00040853344,0.00031684368,0.00028691615],"about_ca_topic_score_codex":0.00003292911,"about_ca_topic_score_gemma":0.00010469848,"teacher_disagreement_score":0.6765008,"about_ca_system_score_codex":0.00019095377,"about_ca_system_score_gemma":0.00006089016,"threshold_uncertainty_score":0.3145682},"labels":[],"label_agreement":null},{"id":"W2531881412","doi":"10.2298/yjor160517018b","title":"Using injection points in reformulation local search for solving continuous location problems","year":2016,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Ministry of Education and Science of the Republic of Kazakhstan; Ministry of Education, Science and Technology; Ministerio de Economía y Competitividad","keywords":"Continuous phase modulation; Continuous modelling; Benchmark (surveying); Local search (optimization); Relaxation (psychology); Mathematical optimization; Exploit; Mathematics; Limiting; Relation (database); Computer science; Applied mathematics; Algorithm; Mathematical analysis; Data mining","score_opus":0.12156436583336688,"score_gpt":0.4073655037568511,"score_spread":0.2858011379234842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531881412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30961484,0.00009769166,0.6894815,0.00022851079,0.00012737434,0.00035066143,0.0000024445503,0.000021206399,0.00007578583],"genre_scores_gemma":[0.9155885,0.000058218204,0.08402783,0.000004704997,0.00017129781,0.000019338991,0.0000029347455,0.00003732629,0.0000898401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979693,0.0003036737,0.0006959101,0.00014278872,0.0005156378,0.00037264463],"domain_scores_gemma":[0.99738485,0.00034756833,0.000045692865,0.00016375748,0.001968862,0.00008929313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00548302,0.00010534266,0.00019979195,0.0009931092,0.00022511765,0.00012190111,0.00017608736,0.0001201407,0.000027273514],"category_scores_gemma":[0.0007304074,0.00008227686,0.000050018527,0.00092911837,0.00007441578,0.0008744842,0.000030837935,0.0003510413,0.00000679111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030409685,0.00003108991,0.0012573482,0.00004745955,0.000016041733,0.0000015441889,0.00058888947,0.91703826,0.05911505,0.0003719154,0.000030110336,0.021471888],"study_design_scores_gemma":[0.0010940585,0.00019112366,0.001101596,0.00036049227,0.000005835032,0.0000648121,0.00035980975,0.97676265,0.01966164,0.00021797643,0.00007077975,0.00010920741],"about_ca_topic_score_codex":0.000059755574,"about_ca_topic_score_gemma":0.00009657751,"teacher_disagreement_score":0.60597366,"about_ca_system_score_codex":0.00093269366,"about_ca_system_score_gemma":0.00026550886,"threshold_uncertainty_score":0.33551532},"labels":[],"label_agreement":null},{"id":"W2537704407","doi":"10.1002/atr.1417","title":"A column generation algorithm for the bus driver scheduling problem","year":2016,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology","keywords":"Column generation; Scheduling (production processes); Computer science; Set cover problem; Set (abstract data type); Job shop scheduling; Column (typography); Mathematical optimization; Operations research; Algorithm; Engineering; Embedded system; Mathematics; Computer network","score_opus":0.014597228855142612,"score_gpt":0.2611452104158759,"score_spread":0.2465479815607333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537704407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047499374,0.00020648673,0.9513258,0.00021411423,0.00048650856,0.00021088746,0.000011045331,0.00003875601,0.0000070512356],"genre_scores_gemma":[0.20551598,0.0002590656,0.79385316,0.000018605615,0.00027810584,0.00001574021,0.0000050250023,0.000024268744,0.000030016978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992435,0.000017733606,0.00040019577,0.00006800388,0.00015490675,0.00011569145],"domain_scores_gemma":[0.99927056,0.00015895891,0.00017714831,0.00006883168,0.00028753237,0.00003695107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034194477,0.00008222791,0.00011966693,0.0000583837,0.00007141301,0.000017009708,0.00007885143,0.00004457439,0.000010368066],"category_scores_gemma":[0.00003112,0.00005277162,0.000078878445,0.00011851283,0.000015645846,0.00039786336,5.5552425e-7,0.00007569853,8.365494e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061284577,0.0000051213447,0.000056887682,0.0000091116035,0.000026569793,8.207312e-7,0.00022308982,0.66204786,0.04320523,0.00005102978,0.000024851217,0.29434326],"study_design_scores_gemma":[0.0047368384,0.00025492065,0.012893345,0.0002705866,0.00023518875,0.0000221843,0.0003156787,0.9097854,0.0637022,0.0008660482,0.006555538,0.0003620555],"about_ca_topic_score_codex":4.3015328e-7,"about_ca_topic_score_gemma":0.0000069682756,"teacher_disagreement_score":0.29398122,"about_ca_system_score_codex":0.000057709552,"about_ca_system_score_gemma":0.000024830431,"threshold_uncertainty_score":0.21519642},"labels":[],"label_agreement":null},{"id":"W2538943139","doi":"10.1111/itor.12346","title":"The rescheduling arc routing problem","year":2016,"lang":"en","type":"article","venue":"International Transactions in Operational Research","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; Transport Canada","funders":"","keywords":"Arc routing; Computer science; Integer programming; Scheduling (production processes); Operations research; Mathematical optimization; Schedule; Routing (electronic design automation); Decision maker; Computer network; Mathematics; Algorithm","score_opus":0.06704797698861954,"score_gpt":0.38720962856291435,"score_spread":0.3201616515742948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2538943139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010938976,0.000101344966,0.9467581,0.0128068905,0.000836298,0.00035903687,0.000040643816,0.00018722945,0.027971502],"genre_scores_gemma":[0.95669127,0.00038618263,0.038740695,0.000025305328,0.00019276715,0.00018825877,0.000006858368,0.000032247775,0.0037364443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802583,0.00022608602,0.0003844871,0.00020714819,0.0008070323,0.0003494323],"domain_scores_gemma":[0.99751335,0.001779727,0.000015662887,0.00017396487,0.00045905256,0.000058238733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028258406,0.000098893885,0.00007490683,0.0002760433,0.00042838143,0.0001967971,0.00042156596,0.00007093403,0.0003884424],"category_scores_gemma":[0.00047383964,0.00006671575,0.000044391563,0.00044455545,0.00013230077,0.00036520552,0.000017208105,0.00042477107,0.000079109486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004666645,0.00005602106,0.0010697457,0.000008989201,0.00007772372,0.000006284709,0.00031803126,0.7950865,0.014729519,0.045376774,0.00036698527,0.14285678],"study_design_scores_gemma":[0.0011196273,0.000029993982,0.0023401324,0.00022888991,0.0000034297607,0.000031084906,0.00034730005,0.92137414,0.010296851,0.006145494,0.05777753,0.0003055092],"about_ca_topic_score_codex":0.00002608263,"about_ca_topic_score_gemma":0.00011194411,"teacher_disagreement_score":0.94575226,"about_ca_system_score_codex":0.00047282124,"about_ca_system_score_gemma":0.00010928856,"threshold_uncertainty_score":0.4253172},"labels":[],"label_agreement":null},{"id":"W2546223729","doi":"10.1016/j.ejor.2018.06.046","title":"Column generation for vehicle routing problems with multiple synchronization constraints","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Synchronization (alternating current); Variable (mathematics); Operations research; Routing (electronic design automation); Vehicle routing problem; Computer science; Heuristic; Mathematical optimization; Engineering; Computer network; Mathematics; Artificial intelligence","score_opus":0.08981736353026892,"score_gpt":0.3414826033651602,"score_spread":0.25166523983489125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546223729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14920554,0.0000470747,0.847483,0.00021219958,0.00018508668,0.00033415496,0.000009134877,0.000036975445,0.0024868941],"genre_scores_gemma":[0.86327356,0.000011909964,0.13532075,0.00002893724,0.0011671454,0.0000057534103,0.0000184564,0.000052028652,0.000121439196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979326,0.00060168986,0.00047780923,0.00014248138,0.00057617907,0.00026922062],"domain_scores_gemma":[0.99680287,0.0002892851,0.00009234809,0.000118259675,0.002586186,0.00011103203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580449,0.00010094349,0.0001296671,0.00019004222,0.0004007495,0.00023933283,0.00019564264,0.000027612637,0.00010591578],"category_scores_gemma":[0.0011560894,0.00008984478,0.000033586388,0.00035137447,0.00020294615,0.00034906197,0.000025766616,0.00026941692,0.000027410913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075070166,0.00005535062,0.0028170992,0.00004756681,0.00008853274,0.000015397614,0.0011253959,0.8666602,0.10070851,0.0008615797,0.0039192406,0.023626097],"study_design_scores_gemma":[0.001258781,0.0005957003,0.0016800635,0.00009831538,0.0000075597586,0.000061247796,0.00009873779,0.9866022,0.0076387427,0.000012364064,0.001826354,0.00011994148],"about_ca_topic_score_codex":0.0000011092112,"about_ca_topic_score_gemma":0.000006948394,"teacher_disagreement_score":0.71406806,"about_ca_system_score_codex":0.0001426276,"about_ca_system_score_gemma":0.0001869715,"threshold_uncertainty_score":0.36637637},"labels":[],"label_agreement":null},{"id":"W2548380795","doi":"","title":"Production scheduling and routing problem in the textile industry","year":2013,"lang":"en","type":"article","venue":"Industrial Engineering and Systems Management (IESM), Proceedings of 2013 International Conference on","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","funders":"","keywords":"Column generation; Scheduling (production processes); Solver; Integer programming; Linear programming; Mathematical optimization; Computer science; Job shop scheduling; Routing (electronic design automation); Algorithm; Mathematics; Embedded system","score_opus":0.043154000461980105,"score_gpt":0.24985874610223655,"score_spread":0.20670474564025643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548380795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97841734,0.00005955792,0.00073226943,0.0009991792,0.0008141206,0.0010375677,0.000003025236,0.00017728112,0.017759683],"genre_scores_gemma":[0.996973,0.000093425406,0.0021521354,0.000008289117,0.0002849913,0.000147978,0.000002967085,0.000022098106,0.00031514003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988408,0.0000124917915,0.0004190798,0.00023491897,0.0002919242,0.00020078152],"domain_scores_gemma":[0.99958843,0.00003764425,0.00011431829,0.00007174765,0.00014644559,0.000041414918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076953863,0.00018530195,0.00019272085,0.000286727,0.00004452976,0.00027783003,0.00021592525,0.00018915067,0.000012193883],"category_scores_gemma":[0.00010523189,0.00016134075,0.000018460152,0.00021383571,0.00002889812,0.0003872751,0.000060222348,0.0005073658,0.0000028350357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021533415,0.000060798928,0.008180399,0.000622425,0.00026429744,0.0000021619276,0.0015399905,0.8157558,0.0065290136,0.15542993,0.0020711562,0.009522491],"study_design_scores_gemma":[0.00058287714,0.000049774564,0.002131475,0.0011584271,0.000022942828,0.000014601684,0.004566576,0.9901222,0.00029330098,0.00016458909,0.0006299103,0.00026333108],"about_ca_topic_score_codex":0.00006704448,"about_ca_topic_score_gemma":3.9226174e-7,"teacher_disagreement_score":0.1743664,"about_ca_system_score_codex":0.000054446788,"about_ca_system_score_gemma":0.000006205096,"threshold_uncertainty_score":0.65792847},"labels":[],"label_agreement":null},{"id":"W2548759626","doi":"10.1109/gol.2016.7731666","title":"Strategic planning problem represented by a three-echelon logistics network-modeling and solving","year":2016,"lang":"en","type":"article","venue":"","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é de Montréal","funders":"","keywords":"Time horizon; Computer science; Heuristic; Order (exchange); Plan (archaeology); Mathematical optimization; Operations research; Product (mathematics); Minification; Total cost; Network planning and design; Flow network; Mathematics; Artificial intelligence; Economics","score_opus":0.04758450932323452,"score_gpt":0.27968365531211686,"score_spread":0.23209914598888234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548759626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018830193,0.0004367194,0.9711472,0.000081765254,0.000083505074,0.00013630939,0.0000026824598,0.0007186209,0.008563019],"genre_scores_gemma":[0.7147859,0.000056115397,0.28483275,0.00002007741,0.00008340862,0.000008501594,0.0000038654193,0.00004298087,0.00016646272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989695,0.000039273273,0.00027922334,0.00023564837,0.00011544151,0.00036090764],"domain_scores_gemma":[0.9994586,0.0001812208,0.000034928256,0.00019329261,0.000045714616,0.00008624937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046091888,0.00015944315,0.0001663199,0.000040272596,0.00008599497,0.00006904185,0.000097033655,0.00011132085,0.000034297842],"category_scores_gemma":[0.00006486532,0.00012163712,0.000021236487,0.0001432656,0.000026409081,0.00012937914,0.000056911842,0.00012882854,0.000004887387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039594215,0.0000034438497,0.0027857895,0.000026949723,0.000021348153,0.0000027126478,0.00003768023,0.98910415,0.0039616292,0.0008258808,0.00054492883,0.002681503],"study_design_scores_gemma":[0.00026579623,0.000013459975,0.000026221149,0.00012301464,0.000010963093,0.000006924766,0.000037783208,0.9956986,0.00027610463,0.0032917906,0.000057030302,0.00019235449],"about_ca_topic_score_codex":0.000017601364,"about_ca_topic_score_gemma":0.0000071307586,"teacher_disagreement_score":0.69595563,"about_ca_system_score_codex":0.00003968081,"about_ca_system_score_gemma":0.000011275168,"threshold_uncertainty_score":0.49602178},"labels":[],"label_agreement":null},{"id":"W2550943709","doi":"","title":"A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem.","year":2009,"lang":"en","type":"article","venue":"IJCCI","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":"University of Waterloo","funders":"","keywords":"Vertex cover; Tree traversal; Graph traversal; Algorithm; Vertex (graph theory); Feedback vertex set; Edge cover; Pruning; Mathematics; Cardinality (data modeling); Ant colony optimization algorithms; Reachability; Computer science; Graph; Combinatorics; Mathematical optimization; Approximation algorithm; Data mining","score_opus":0.013454539917893494,"score_gpt":0.2624972349315403,"score_spread":0.24904269501364681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550943709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036762762,0.00008775286,0.9916936,0.00020846502,0.00022366001,0.00043567494,0.000018880964,0.00050319737,0.0031524755],"genre_scores_gemma":[0.09848016,0.000004801682,0.90047127,0.00038812094,0.00009151673,0.00004131348,0.000023314773,0.000044644723,0.0004548818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.000030895142,0.00020587027,0.00016716664,0.00011743793,0.0002896732],"domain_scores_gemma":[0.99951047,0.00014760172,0.00003394102,0.00017589757,0.00006089832,0.00007117456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027919226,0.00013778523,0.00017056364,0.0000735704,0.00006646933,0.000042498617,0.00011480532,0.00009198431,0.00004958548],"category_scores_gemma":[0.00006991327,0.0001483507,0.000058751237,0.00019392905,0.000011102284,0.00008937692,0.000007785311,0.00009830289,0.000021327776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017479239,0.000066729655,0.0000965804,0.00007005538,0.00003445619,0.00000806182,0.00030764585,0.7496878,0.00836464,0.0001888349,0.014211288,0.22694647],"study_design_scores_gemma":[0.0008250199,0.0000947206,0.00028364419,0.00003965729,0.000016338372,0.0000027057495,0.000008644794,0.9805043,0.0043460373,0.00018180514,0.013509276,0.00018786105],"about_ca_topic_score_codex":0.0000018157102,"about_ca_topic_score_gemma":4.4323093e-7,"teacher_disagreement_score":0.23081653,"about_ca_system_score_codex":0.00007477283,"about_ca_system_score_gemma":0.000034886336,"threshold_uncertainty_score":0.60495657},"labels":[],"label_agreement":null},{"id":"W2552752966","doi":"10.1016/j.jal.2016.11.010","title":"A survey on the inventory-routing problem with stochastic lead times and demands","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Lead time; Operations research; Supply chain; Key (lock); Routing (electronic design automation); Inventory control; Inventory theory; Supply chain management; Control (management); Variable (mathematics); Synchronization (alternating current); Lead (geology); Field (mathematics); Mathematical optimization; Operations management; Economics; Mathematics; Business; Artificial intelligence","score_opus":0.027733129981870525,"score_gpt":0.2422598730721083,"score_spread":0.21452674309023778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552752966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39429626,0.0001391136,0.59885323,0.0006573578,0.00008799102,0.00027554802,0.0000028049792,0.0000977706,0.0055899504],"genre_scores_gemma":[0.98722035,0.00001355862,0.012542596,0.00008926188,0.00006316048,0.0000033101514,2.3008708e-7,0.00002285685,0.00004469121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992626,0.00006586841,0.00025396072,0.000080873615,0.00017780688,0.00015893577],"domain_scores_gemma":[0.9990832,0.00054411776,0.00015879117,0.00010031777,0.000060339116,0.00005322768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014017809,0.000116177405,0.00018182106,0.00006809439,0.00006090221,0.00003207471,0.00011902442,0.00004736746,0.000023100152],"category_scores_gemma":[0.00009855008,0.000052845095,0.000022211776,0.00013060973,0.000051127063,0.00004575904,0.00001662331,0.00017725458,0.0000062189765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037986034,0.00006366887,0.005181155,0.00006212422,0.00029766254,0.000014982181,0.0010372002,0.9435815,0.0077254116,0.014747852,0.0020096977,0.024898877],"study_design_scores_gemma":[0.01847086,0.004361589,0.1238439,0.004100666,0.00067647366,0.00072400994,0.0017499392,0.77513623,0.016552202,0.04967225,0.001152122,0.0035597833],"about_ca_topic_score_codex":8.098676e-7,"about_ca_topic_score_gemma":0.0000024388387,"teacher_disagreement_score":0.59292406,"about_ca_system_score_codex":0.00004256719,"about_ca_system_score_gemma":0.000019761404,"threshold_uncertainty_score":0.21549605},"labels":[],"label_agreement":null},{"id":"W2556437849","doi":"10.5267/j.ijiec.2016.10.001","title":"Green open location-routing problem considering economic and environmental costs","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Tecnológica de Pereira; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Routing (electronic design automation); Computer science; Mathematical optimization; Environmental economics; Natural resource economics; Business; Economics; Environmental science; Computer network; Mathematics","score_opus":0.029644109991011264,"score_gpt":0.2704808512720371,"score_spread":0.2408367412810258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556437849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2751777,0.000109009954,0.71979135,0.0017451389,0.0024015529,0.00028207345,0.000062216895,0.00012888537,0.0003020619],"genre_scores_gemma":[0.95994896,0.000035904595,0.039428476,0.000018010194,0.0005012367,0.00000450439,0.0000061864625,0.000032965025,0.000023733766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990253,0.000032152617,0.0005204027,0.00011033093,0.00017461443,0.00013723571],"domain_scores_gemma":[0.99917996,0.00038936734,0.00018338213,0.00007246442,0.000072503084,0.00010229728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041105782,0.00013397775,0.0001872269,0.0002309322,0.000041908046,0.00014523092,0.0003605361,0.000075742995,0.000032726224],"category_scores_gemma":[0.00013224139,0.0001228669,0.000039383172,0.000057915197,0.00002991353,0.0005254354,0.00011394375,0.00017278633,0.000007065967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009966119,0.000010423814,0.0017868272,0.0000031172474,0.00017913239,0.000009284983,0.00010366444,0.9352859,0.0020681068,0.0008612682,0.00022124175,0.059461042],"study_design_scores_gemma":[0.0047721476,0.00008829533,0.0016921012,0.0008542522,0.000056254376,0.00060257455,0.00016314411,0.9801846,0.0051132105,0.00031644187,0.0056521595,0.0005048315],"about_ca_topic_score_codex":0.000019133675,"about_ca_topic_score_gemma":0.0000023842051,"teacher_disagreement_score":0.6847713,"about_ca_system_score_codex":0.00048367507,"about_ca_system_score_gemma":0.00007680706,"threshold_uncertainty_score":0.50103664},"labels":[],"label_agreement":null},{"id":"W2557690748","doi":"10.1109/cec.2016.7744235","title":"A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows","year":2016,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"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":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; King Fahd University of Petroleum and Minerals","keywords":"Vehicle routing problem; Tabu search; Mathematical optimization; Benchmark (surveying); Pareto principle; Nash equilibrium; Computer science; Set (abstract data type); Heuristic; Variable (mathematics); Variable neighborhood search; Routing (electronic design automation); Multi-objective optimization; Metaheuristic; Mathematics","score_opus":0.012941045921025813,"score_gpt":0.2231873047745746,"score_spread":0.21024625885354878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557690748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010086437,0.00001656582,0.9851755,0.00017382657,0.000035527908,0.0010108354,0.000006891342,0.0005090269,0.0029853797],"genre_scores_gemma":[0.651961,0.0000023282691,0.34707445,0.000020655778,0.000050879073,0.00018168702,0.0000061417336,0.000049881455,0.0006529668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989773,0.000047868278,0.00023310538,0.00022605476,0.00013910241,0.00037658444],"domain_scores_gemma":[0.9989041,0.000612526,0.000053451506,0.00027220268,0.00010066793,0.000057041354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006896329,0.0001736579,0.0001675581,0.00004246929,0.00018096907,0.000055975663,0.00014808307,0.000083115694,0.000027339598],"category_scores_gemma":[0.0001113825,0.00009049569,0.000050235572,0.0002251764,0.00004426035,0.00021891984,0.000032911277,0.000083119616,0.000022915472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012688519,0.000054015898,0.003191465,0.000084691004,0.00016725673,8.362421e-7,0.0005692987,0.83185506,0.11665591,0.00019642353,0.0011367529,0.045961417],"study_design_scores_gemma":[0.0015666581,0.00004213223,0.0006363935,0.000033830565,0.000028066535,0.00000544717,0.00007129954,0.98496383,0.012190923,0.000013232589,0.0002543242,0.00019385316],"about_ca_topic_score_codex":0.00001698415,"about_ca_topic_score_gemma":0.0000064497385,"teacher_disagreement_score":0.6418746,"about_ca_system_score_codex":0.00008932234,"about_ca_system_score_gemma":0.000020392272,"threshold_uncertainty_score":0.3690307},"labels":[],"label_agreement":null},{"id":"W2561257229","doi":"","title":"Variable Neighborhood Search and Local Branching","year":2004,"lang":"en","type":"article","venue":"","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Variable neighborhood search; Solver; Mathematical optimization; Integer programming; Local search (optimization); Variable (mathematics); Heuristic; Branching (polymer chemistry); Set (abstract data type); Mathematics; Limit (mathematics); Black box; Integer (computer science); Computer science; Metaheuristic; Artificial intelligence","score_opus":0.010488171469996803,"score_gpt":0.24191149265794876,"score_spread":0.23142332118795195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561257229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01621776,0.00007609041,0.95697933,0.00005707263,0.00006809898,0.000046969257,6.0841506e-7,0.00036749395,0.026186569],"genre_scores_gemma":[0.6307794,0.000007494792,0.36906168,0.00004623628,0.00002471388,0.0000011407518,7.9284564e-7,0.000015615182,0.00006297773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999551,0.000016265272,0.00009293347,0.00009535315,0.00007770576,0.00016676942],"domain_scores_gemma":[0.9997861,0.00003469305,0.000003129696,0.000097009106,0.000015942323,0.00006313735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021455514,0.00006799767,0.000076320815,0.000040520415,0.000045516783,0.000037748334,0.00004843584,0.00004672196,0.00008812092],"category_scores_gemma":[0.00001803182,0.0000677027,0.000009584495,0.0001587742,0.000017800505,0.000105677624,0.000023452014,0.0001166827,0.000016822181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.969107e-7,0.000004041211,0.00019747928,0.000018840243,0.0000072047146,9.88258e-7,0.00012430846,0.96283,0.0010029998,0.024660254,0.000010205537,0.011142988],"study_design_scores_gemma":[0.0004758483,0.000012309776,0.0005715346,0.000017769707,0.0000044524872,0.0000150898795,0.00006868315,0.9905846,0.005251642,0.0027088698,0.00015980985,0.00012940634],"about_ca_topic_score_codex":0.000038847895,"about_ca_topic_score_gemma":0.0000025509212,"teacher_disagreement_score":0.6145616,"about_ca_system_score_codex":0.000037666527,"about_ca_system_score_gemma":0.00001601707,"threshold_uncertainty_score":0.2760836},"labels":[],"label_agreement":null},{"id":"W2563548641","doi":"10.5539/ijsp.v6n1p95","title":"Installation and Dispatch of the Traffic Patrol Service Platform","year":2016,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Workload; Operations research; Service (business); Construct (python library); Shortest path problem; Scale (ratio); Integer programming; Path (computing); Transport engineering; Mathematical optimization; Real-time computing; Computer network; Engineering; Geography; Mathematics; Operating system; Algorithm; Business; Graph","score_opus":0.014622230713215043,"score_gpt":0.25216208946021657,"score_spread":0.2375398587470015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563548641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7747777,0.00003695749,0.22433081,0.00042358864,0.00022877267,0.000049004375,0.0000969562,0.0000051158822,0.00005110706],"genre_scores_gemma":[0.943262,0.00009168359,0.056584723,0.000017702794,0.000033868757,4.9277173e-7,7.836805e-7,0.0000049694895,0.000003808673],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99939877,0.000027222846,0.0002963034,0.000045751487,0.00018488306,0.000047059908],"domain_scores_gemma":[0.9991972,0.0002278082,0.00013701734,0.000052708507,0.00035535515,0.000029920102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003555053,0.000051131567,0.0000872628,0.000028302837,0.000017215601,0.000016532562,0.00009562268,0.00002676231,0.000014839495],"category_scores_gemma":[0.00019703203,0.000029785984,0.000016452557,0.00004119752,0.00004307647,0.000103972496,0.000026518574,0.000060153114,1.3792709e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015737498,0.00008107929,0.124577835,0.00025567997,0.00025421928,0.0000036381555,0.0015642095,0.12840396,0.005044353,0.014345132,0.0001800537,0.72513247],"study_design_scores_gemma":[0.002281529,0.000135977,0.6033167,0.00036528625,0.0000690374,0.00012323304,0.00007502374,0.3307733,0.0016956375,0.05983884,0.0010883817,0.00023701091],"about_ca_topic_score_codex":0.0000040465743,"about_ca_topic_score_gemma":0.000020917734,"teacher_disagreement_score":0.7248955,"about_ca_system_score_codex":0.00003713339,"about_ca_system_score_gemma":0.000022098417,"threshold_uncertainty_score":0.121463716},"labels":[],"label_agreement":null},{"id":"W2564716879","doi":"","title":"General variable neighborhood search for the uncapacitated single allocation \\(p\\)-hub center problem","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"Royal Military College of Canada","funders":"","keywords":"Variable neighborhood search; Benchmark (surveying); Heuristic; Mathematical optimization; Variable (mathematics); Local search (optimization); Descent (aeronautics); Computer science; Mathematics; Ant colony optimization algorithms; Metaheuristic; Engineering; Geography","score_opus":0.030715310732639483,"score_gpt":0.24590282781208728,"score_spread":0.2151875170794478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564716879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02488365,0.00017314516,0.96747404,0.0007011472,0.00047905758,0.0005328052,0.000020616335,0.0004048619,0.0053306744],"genre_scores_gemma":[0.34661534,0.000024974857,0.6510115,0.00028515205,0.00044064748,0.00012475667,0.000108730506,0.00010692506,0.0012819655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998891,0.0001139081,0.00023838702,0.00019206706,0.00020492224,0.00035970355],"domain_scores_gemma":[0.9991597,0.00020053363,0.00003578972,0.0002628271,0.00022721136,0.000113935006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007886891,0.0001635773,0.00014558471,0.000071988754,0.000186246,0.000113027636,0.00021244556,0.00014457948,0.000018784638],"category_scores_gemma":[0.000115095645,0.00013670731,0.00004995818,0.00033783226,0.000072463416,0.00015892278,0.000020990534,0.00023103345,0.000010054329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029640149,0.0000590551,0.0008549423,0.00006759779,0.000117855554,0.0000010787817,0.0032975525,0.93748295,0.0069693946,0.03700993,0.0058049494,0.008305027],"study_design_scores_gemma":[0.0011667638,0.00007007257,0.00013197544,0.000015997144,0.00003450408,0.000012712616,0.0003436854,0.9708391,0.004522268,0.0024405795,0.02016864,0.00025369122],"about_ca_topic_score_codex":0.00002299502,"about_ca_topic_score_gemma":0.000002969525,"teacher_disagreement_score":0.3217317,"about_ca_system_score_codex":0.00027552756,"about_ca_system_score_gemma":0.000046712415,"threshold_uncertainty_score":0.5574763},"labels":[],"label_agreement":null},{"id":"W2566755312","doi":"","title":"Airline crew scheduling: Models, algorithms, and data sets","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew scheduling; Crew; Cockpit; Computer science; Scheduling (production processes); Column generation; Operations research; Distributed computing; Engineering; Mathematical optimization; Aeronautics; Operations management; Mathematics","score_opus":0.027306706610756546,"score_gpt":0.27041841240730485,"score_spread":0.2431117057965483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566755312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01262077,0.0019168219,0.98079616,0.0009794584,0.00014556693,0.00034056616,0.000079867685,0.0022480083,0.0008728111],"genre_scores_gemma":[0.29640752,0.0004627608,0.7020836,0.0005124069,0.00014630365,0.00005346781,0.00012049336,0.00011898184,0.000094483024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785995,0.00016547133,0.000485594,0.00056538655,0.00029056307,0.0006330039],"domain_scores_gemma":[0.9976923,0.00018280241,0.000093671195,0.0015959007,0.00008543554,0.00034988965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015724465,0.0003676559,0.00039779197,0.0002870374,0.00017533882,0.00019268082,0.0007631957,0.00030445805,0.00001727267],"category_scores_gemma":[0.00036940663,0.00040495305,0.00005225985,0.00041681022,0.0000693244,0.00064226816,0.00046306904,0.00048758107,0.00000969351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010106316,0.000040917002,0.0014368277,0.00007256803,0.000046524896,0.000007277115,0.00009992306,0.8853449,0.0009842782,0.0053469366,0.0012827694,0.10532697],"study_design_scores_gemma":[0.00041247145,0.000032781612,0.0013214429,0.000046367488,0.00003608712,0.00006450866,0.000024008748,0.991683,0.001156243,0.0022426874,0.002553834,0.000426551],"about_ca_topic_score_codex":0.00068273535,"about_ca_topic_score_gemma":0.00021499486,"teacher_disagreement_score":0.28378677,"about_ca_system_score_codex":0.00013892533,"about_ca_system_score_gemma":0.000056543297,"threshold_uncertainty_score":0.99984026},"labels":[],"label_agreement":null},{"id":"W2567598518","doi":"10.1016/j.cor.2019.05.008","title":"An RLT approach for solving the binary-constrained mixed linear complementarity problem","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mixed complementarity problem; Complementarity theory; Linear complementarity problem; Complementarity (molecular biology); Linear programming; Mathematical optimization; Binary number; Mathematics; Generalized linear mixed model; Applied mathematics; Computer science; Nonlinear system","score_opus":0.08351850770169487,"score_gpt":0.37789104834462384,"score_spread":0.29437254064292895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567598518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08680813,0.000033321754,0.9097365,0.00038740507,0.00020690724,0.001891786,0.000028152584,0.00024106592,0.00066673895],"genre_scores_gemma":[0.44271785,0.000004313892,0.55666906,0.000036527603,0.00011567951,0.00015353461,0.00018725515,0.00003292727,0.000082836654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812627,0.00036364954,0.00031799366,0.0003378544,0.0003506836,0.00050356856],"domain_scores_gemma":[0.9984988,0.0004037025,0.000012779677,0.00058288494,0.00039393382,0.00010791245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026299302,0.00015291983,0.0001827027,0.00019741923,0.00071433134,0.00035614174,0.0006148443,0.000074383024,0.00006509347],"category_scores_gemma":[0.000055308454,0.00013011452,0.000059903687,0.0005571485,0.00011599878,0.00028470522,0.00012843969,0.00044123322,0.000026235968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000620336,0.00006332823,0.00035101402,0.000067580244,0.000035101544,2.9763768e-7,0.00065227953,0.9873452,0.0055166516,0.0021661848,0.0011805982,0.0026155575],"study_design_scores_gemma":[0.0005341894,0.00012749157,0.0003369837,0.000016323438,0.0000054117218,0.0000035975208,0.0004911335,0.9964544,0.00089412,0.000037205675,0.0009444342,0.00015469373],"about_ca_topic_score_codex":0.00005974934,"about_ca_topic_score_gemma":0.000043973316,"teacher_disagreement_score":0.35590973,"about_ca_system_score_codex":0.00012933496,"about_ca_system_score_gemma":0.00010431901,"threshold_uncertainty_score":0.5494131},"labels":[],"label_agreement":null},{"id":"W2568124026","doi":"10.1155/2017/1918903","title":"Time-Dependent Vehicle Routing of Free Pickup and Delivery Service in Flight Ticket Sales Companies Based on Carbon Emissions","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hebei University; National Natural Science Foundation of China","keywords":"Ticket; Vehicle routing problem; Pickup; Routing (electronic design automation); Heuristic; Operations research; Computer science; Transport engineering; Traffic congestion; Service (business); Fuel efficiency; Engineering; Computer network; Business; Automotive engineering; Marketing","score_opus":0.013192115869882596,"score_gpt":0.2541595312307851,"score_spread":0.24096741536090252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568124026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940548,0.00008766332,0.0052958354,0.00018682626,0.00012366082,0.00007736994,0.000009944317,0.000023263612,0.00014061555],"genre_scores_gemma":[0.96737915,0.000051188155,0.032487974,0.000022841383,0.000027569606,0.0000010891674,0.0000050999247,0.000021287758,0.0000038190246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904555,0.000038362054,0.0004862065,0.000088550594,0.00022658377,0.00011473118],"domain_scores_gemma":[0.99907255,0.00018126858,0.00034340186,0.00019685997,0.00014752534,0.00005838934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003315094,0.000109882436,0.000246626,0.00014029218,0.000066079745,0.000018388753,0.0001666249,0.000059495535,0.0000053936747],"category_scores_gemma":[0.00011922141,0.00010936599,0.000038285714,0.000082772756,0.000020957648,0.00025867895,0.000003842269,0.00018604929,3.4478396e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010041176,0.000026788386,0.010621711,0.000078178615,0.00001304011,0.000011094402,0.00091424515,0.9349282,0.051362276,0.000009292545,0.000002044441,0.0019327637],"study_design_scores_gemma":[0.0023422632,0.00013691773,0.38004866,0.0007271699,0.000051618354,0.0000028353431,0.00035131554,0.5765373,0.039542187,0.00009053579,0.000011799231,0.00015740626],"about_ca_topic_score_codex":0.000018865629,"about_ca_topic_score_gemma":0.00012029377,"teacher_disagreement_score":0.36942697,"about_ca_system_score_codex":0.00004441491,"about_ca_system_score_gemma":0.000029039233,"threshold_uncertainty_score":0.44598156},"labels":[],"label_agreement":null},{"id":"W2570390297","doi":"10.1287/moor.2015.0752","title":"An Improved Integrality Gap for Asymmetric TSP Paths","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","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":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Linear programming relaxation; Conjecture; Bounded function; Spanning tree; Path (computing); Tree (set theory); Minimum spanning tree; Relaxation (psychology); Connection (principal bundle); Space (punctuation); Linear programming; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.13116101593447474,"score_gpt":0.4304011552015642,"score_spread":0.2992401392670895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570390297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06946956,0.00003103693,0.92781514,0.00016800499,0.000059891903,0.0006313529,0.000058213805,0.0001230969,0.0016437188],"genre_scores_gemma":[0.5292184,0.000019883186,0.47023264,0.000002497131,0.000033511544,0.0001250684,0.0000066196167,0.000031270836,0.0003301477],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.00014330125,0.0004052117,0.0001592049,0.00029645392,0.00029233773],"domain_scores_gemma":[0.99777716,0.0008031682,0.000018060977,0.0005421865,0.0007662415,0.00009315258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030420844,0.00010110745,0.0001923494,0.0003873352,0.00013888767,0.000078447636,0.00032513172,0.00008676165,0.00007447142],"category_scores_gemma":[0.0025094626,0.000072524796,0.000052723182,0.0006418801,0.000082847924,0.00022653643,0.00004008402,0.00012840175,0.0000182105],"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.000021881442,0.00079190196,0.0002469611,0.0012082455,0.00013841693,9.4455106e-7,0.0033292472,0.110537365,0.6648298,0.110777915,0.0013734071,0.10674395],"study_design_scores_gemma":[0.0003376845,0.00011288607,0.00005510333,0.000051798426,0.0000059043186,0.0000012180416,0.00024199227,0.93767375,0.058501326,0.0028041701,0.000106081774,0.0001080798],"about_ca_topic_score_codex":0.000014414669,"about_ca_topic_score_gemma":0.000018088884,"teacher_disagreement_score":0.8271364,"about_ca_system_score_codex":0.00009256867,"about_ca_system_score_gemma":0.000062642815,"threshold_uncertainty_score":0.30042425},"labels":[],"label_agreement":null},{"id":"W2573661439","doi":"","title":"Stabilized Dynamic Constraint Aggregation for Solving Set Partitioning Problems","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Degeneracy (biology); Mathematical optimization; Constraint (computer-aided design); Computer science; Scheduling (production processes); Set (abstract data type); Column generation; Dual (grammatical number); Constraint satisfaction problem; Variable (mathematics); Space (punctuation); Projection (relational algebra); Mathematics; Algorithm; Artificial intelligence","score_opus":0.023070708197838442,"score_gpt":0.24788037160537502,"score_spread":0.22480966340753658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573661439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06298457,0.0003495,0.9322711,0.000141146,0.0001693889,0.0011707766,0.00006179463,0.0021423572,0.000709315],"genre_scores_gemma":[0.55362105,0.00005494897,0.44533885,0.00009159005,0.000028431254,0.0006847067,0.00004656299,0.00008014401,0.000053700245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816394,0.00008420751,0.000576441,0.00033412542,0.00018630986,0.0006550003],"domain_scores_gemma":[0.9988594,0.00017202336,0.00015616952,0.00046687745,0.00015498238,0.00019051832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001070083,0.00030115625,0.00031672063,0.00028099393,0.00022784705,0.00011185874,0.0002513456,0.0002466248,0.00010002109],"category_scores_gemma":[0.00034317563,0.00034588532,0.00014147848,0.00036640215,0.00008063085,0.00036612622,0.000051819246,0.00027961461,0.000007346263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010688641,0.00019206048,0.019390844,0.00061200553,0.00022774508,0.00001552744,0.0052702157,0.81686074,0.061341535,0.02216505,0.0008454283,0.072971985],"study_design_scores_gemma":[0.0005889897,0.00006682653,0.002596781,0.0001100904,0.000036887883,0.000032120355,0.0002145557,0.9705077,0.021474475,0.0037728872,0.00020624214,0.00039244557],"about_ca_topic_score_codex":0.00034324295,"about_ca_topic_score_gemma":0.0005132416,"teacher_disagreement_score":0.4906365,"about_ca_system_score_codex":0.00037275514,"about_ca_system_score_gemma":0.00008488594,"threshold_uncertainty_score":0.9998993},"labels":[],"label_agreement":null},{"id":"W2577191082","doi":"10.4230/lipics.isaac.2016.56","title":"Approximation Algorithms for Capacitated k-Travelling Repairmen Problems","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Rounding; Vehicle routing problem; Computer science; Approximation algorithm; Latency (audio); Mathematical optimization; Algorithm; Travelling salesman problem; Constant (computer programming); Routing (electronic design automation); Mathematics; Computer network; Telecommunications","score_opus":0.027757152322522058,"score_gpt":0.25974010107693307,"score_spread":0.231982948754411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577191082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027785035,0.00002789088,0.96602756,0.00012800425,0.00079056266,0.0021612013,0.0005998051,0.0010405668,0.0014394005],"genre_scores_gemma":[0.17896453,0.00008429525,0.8180455,0.00016692255,0.00031268853,0.0008792476,0.00067722134,0.00023099444,0.0006385801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973064,0.000035664358,0.0012874086,0.00024686925,0.00032226904,0.00080137583],"domain_scores_gemma":[0.9983164,0.00032469773,0.00029760352,0.0004955901,0.00038657108,0.00017912714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011867231,0.0004126688,0.00043684916,0.00027437767,0.00024492817,0.00016707831,0.00037023012,0.0002923815,0.000027685464],"category_scores_gemma":[0.00024672603,0.00033250402,0.00022463396,0.00029041088,0.000076239885,0.001101359,0.000052419764,0.00019894494,0.000055665547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004744942,0.0007333377,0.0048441794,0.013765063,0.0020403443,0.0000047684125,0.052419912,0.48749793,0.018894598,0.011754194,0.019560777,0.3880104],"study_design_scores_gemma":[0.0033782239,0.00015037786,0.000080384954,0.00033445875,0.000051692714,0.000019903597,0.00042350197,0.96442455,0.008803693,0.0010212803,0.02069923,0.0006127246],"about_ca_topic_score_codex":0.000002830647,"about_ca_topic_score_gemma":0.000002519787,"teacher_disagreement_score":0.47692662,"about_ca_system_score_codex":0.00024697804,"about_ca_system_score_gemma":0.000035451918,"threshold_uncertainty_score":0.9999127},"labels":[],"label_agreement":null},{"id":"W2579963571","doi":"","title":"Integer Linear Programming Models for a Cement Delivery Problem","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal","funders":"","keywords":"Integer programming; Linear programming; Mathematical optimization; Integer (computer science); Vehicle routing problem; Routing (electronic design automation); Computer science; Branch and price; Branch and cut; Mathematics; Computer network","score_opus":0.028601299560401826,"score_gpt":0.2438993260203359,"score_spread":0.21529802645993407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579963571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008280696,0.00047679082,0.9855314,0.00012249345,0.00012204929,0.0016337647,0.000024700796,0.0024024204,0.0014057081],"genre_scores_gemma":[0.2872304,0.00007377533,0.71062607,0.0002067136,0.00007838456,0.0014633191,0.00002013114,0.00013073468,0.00017047406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979769,0.00007111631,0.0005619316,0.00037304676,0.00022327137,0.00079373433],"domain_scores_gemma":[0.99882054,0.000081618535,0.00011186386,0.00055372715,0.00018871044,0.00024354679],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084627623,0.0003602221,0.00033660355,0.00033575768,0.00014905576,0.00007870004,0.00039740058,0.00027027467,0.000030798936],"category_scores_gemma":[0.000070691305,0.00038431393,0.00018138201,0.00040958956,0.000045394318,0.00041034035,0.00011193579,0.00032519182,0.000008398841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010691498,0.00023952224,0.0015854383,0.00026719738,0.00016572466,0.000014193072,0.0023528978,0.88445884,0.002343052,0.016991008,0.001225256,0.09024998],"study_design_scores_gemma":[0.00043432185,0.00011766005,0.00009420475,0.00006801256,0.00004427973,0.000018761424,0.00011876725,0.9810678,0.011878989,0.00374636,0.0019845946,0.0004262963],"about_ca_topic_score_codex":0.0008578911,"about_ca_topic_score_gemma":0.00020358716,"teacher_disagreement_score":0.27894968,"about_ca_system_score_codex":0.00036729037,"about_ca_system_score_gemma":0.0000759816,"threshold_uncertainty_score":0.9998609},"labels":[],"label_agreement":null},{"id":"W2581421322","doi":"10.1155/2017/9285403","title":"Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows","year":2017,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"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":"Groupe de recherche interuniversitaire en limnologie; Korea Institute of Industrial Technology","keywords":"Orienteering; Mathematical optimization; Scheme (mathematics); Heuristic; Enumeration; Computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.014422961881450973,"score_gpt":0.23947638920310838,"score_spread":0.2250534273216574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581421322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012393877,0.00007335791,0.99462914,0.000061393854,0.000115362105,0.0011574966,0.000008274108,0.0005320122,0.0021835573],"genre_scores_gemma":[0.22984985,0.000013233984,0.76888216,0.000008149362,0.00011147367,0.00065821764,0.000005491229,0.00019569448,0.00027572468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985363,0.000015291636,0.0004339693,0.000248885,0.00022464752,0.0005408935],"domain_scores_gemma":[0.99867266,0.00046744273,0.0000784654,0.00063368573,0.00005749538,0.00009025063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092408614,0.00030316683,0.00035921103,0.000104060455,0.00020881633,0.00022572537,0.00049478025,0.00011118452,0.000027523447],"category_scores_gemma":[0.00028659552,0.00022139399,0.00006418032,0.0001579592,0.00006611453,0.00028319177,0.00006924554,0.0003523591,0.00002137508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020087023,0.000022609629,0.000039943407,0.0004547378,0.000058345508,0.0000020981427,0.00044448322,0.99021095,0.0009919006,0.0004985614,0.0000558181,0.007218554],"study_design_scores_gemma":[0.0006656822,0.0000359514,0.00006123423,0.0004718798,0.000026141663,0.00002166637,0.000024565206,0.9962487,0.0008652173,0.0007288167,0.00054083054,0.0003092896],"about_ca_topic_score_codex":0.0000048654915,"about_ca_topic_score_gemma":0.0000017842839,"teacher_disagreement_score":0.22861047,"about_ca_system_score_codex":0.00011225157,"about_ca_system_score_gemma":0.000013600361,"threshold_uncertainty_score":0.9028185},"labels":[],"label_agreement":null},{"id":"W2584833029","doi":"10.1016/j.cor.2017.01.020","title":"Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"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":"Austrian Science Fund","keywords":"Truck; Trailer; Computer science; Vehicle routing problem; Metaheuristic; Routing (electronic design automation); Branch and price; Set (abstract data type); Order (exchange); Service (business); Operations research; Variable neighborhood search; Transport engineering; Mathematical optimization; Automotive engineering; Integer programming; Business; Algorithm; Engineering; Computer network; Mathematics","score_opus":0.05007025236499678,"score_gpt":0.3340841521052146,"score_spread":0.2840138997402178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584833029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06945941,0.00032618045,0.9264433,0.0013431032,0.000038956496,0.0013134684,0.000023148395,0.000082491606,0.0009699595],"genre_scores_gemma":[0.88790673,0.00007964131,0.11147612,0.000026865922,0.00010299576,0.00010244371,0.0000054881275,0.000038635804,0.00026110283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987254,0.00017392224,0.0001571566,0.0002898966,0.0002386391,0.00041494553],"domain_scores_gemma":[0.9985284,0.0007323855,0.000014372417,0.00035330828,0.0002580591,0.00011345147],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001749745,0.00013328122,0.00016343629,0.0001042927,0.002028477,0.00092593784,0.0002627196,0.00006342063,0.000010607293],"category_scores_gemma":[0.00010272758,0.000099216326,0.000016943899,0.00014295564,0.00022457748,0.00034932457,0.0002250188,0.0003599519,0.0000035598136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119681805,0.00007026844,0.0069784694,0.00021224897,0.0003627461,0.0000062249806,0.012934221,0.8132324,0.0026851795,0.020393977,0.00072050124,0.14228404],"study_design_scores_gemma":[0.0009341003,0.00010969849,0.0110019855,0.000057962738,0.000010531062,0.000014642965,0.00017682258,0.98706037,0.0002462095,0.00004374153,0.00021618768,0.00012775698],"about_ca_topic_score_codex":0.000031662,"about_ca_topic_score_gemma":0.00003486147,"teacher_disagreement_score":0.8184473,"about_ca_system_score_codex":0.000035338566,"about_ca_system_score_gemma":0.000059648602,"threshold_uncertainty_score":0.99927074},"labels":[],"label_agreement":null},{"id":"W2586734565","doi":"10.1007/s10846-017-0496-7","title":"Non-prespecified Starting Depot Formulations for Minimum-Distance Trajectory Optimization in Patrolling Problem","year":2017,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Depot; Patrolling; Mathematical optimization; Trajectory; Sequence (biology); Mathematics; Viewpoints; Computer science","score_opus":0.04332280352912892,"score_gpt":0.3005340156381482,"score_spread":0.25721121210901926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586734565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015518332,0.00057161,0.98128444,0.00004320231,0.0014651092,0.0006399378,0.0000028467696,0.000041561965,0.00043298418],"genre_scores_gemma":[0.71753263,0.00007383284,0.28193706,0.000004546781,0.00031829873,0.000022219747,0.0000023950943,0.00004917878,0.00005982594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768615,0.00006850956,0.0014799986,0.00015582934,0.00028561777,0.00032391638],"domain_scores_gemma":[0.99795455,0.0003130759,0.00093214645,0.00032471848,0.00036979458,0.00010574154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015573098,0.00020000577,0.00049211,0.0002847535,0.00022005575,0.00028294235,0.00038916155,0.00012062482,0.000007824235],"category_scores_gemma":[0.00042526596,0.00019509497,0.00016360776,0.00013047493,0.000023073104,0.00047176157,0.000021253814,0.0002357835,0.0000018223321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041020317,0.00002939585,0.0026048727,0.00023994058,0.00005845908,0.0000059326185,0.0006420921,0.9944313,0.00066325057,0.000114566836,0.00007555904,0.001093606],"study_design_scores_gemma":[0.000644501,0.00007061042,0.0004127542,0.0007582005,0.000039538852,0.000017839604,0.00039802233,0.9962526,0.0010636661,0.00007883301,0.00007607927,0.0001873785],"about_ca_topic_score_codex":0.00001417256,"about_ca_topic_score_gemma":0.000017134684,"teacher_disagreement_score":0.7020143,"about_ca_system_score_codex":0.00030910465,"about_ca_system_score_gemma":0.00006230723,"threshold_uncertainty_score":0.7955742},"labels":[],"label_agreement":null},{"id":"W2587219052","doi":"10.1111/itor.12378","title":"Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem","year":2017,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Mathematical optimization; Metaheuristic; Multi-objective optimization; Context (archaeology); Variable neighborhood search; Path (computing); Computer science; Node (physics); Pareto principle; Mathematics","score_opus":0.13915869188773056,"score_gpt":0.42198457773962467,"score_spread":0.2828258858518941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587219052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003936738,0.00008233214,0.98080873,0.004526913,0.0005429864,0.0008218631,0.00017731539,0.00008194894,0.009021145],"genre_scores_gemma":[0.7736868,0.00011063118,0.22506417,0.000024363157,0.000114396054,0.00043810927,0.000055514178,0.000028824306,0.00047714825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983721,0.0001978358,0.00035824053,0.0002161136,0.0005925239,0.000263198],"domain_scores_gemma":[0.99688363,0.001545345,0.000049981703,0.0005285398,0.0009457122,0.000046769415],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002692979,0.00012472355,0.0001257032,0.0002289553,0.0014317256,0.0006288578,0.0009789356,0.0000945841,0.00015232795],"category_scores_gemma":[0.0011835976,0.00011280178,0.000072828116,0.00014708989,0.00025247218,0.0005549738,0.000043476,0.0005996769,0.000014179818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034459135,0.00014348434,0.00034691763,0.000020860203,0.00008796431,8.713505e-7,0.0007809929,0.9727941,0.0019709459,0.0058195186,0.000261379,0.017738482],"study_design_scores_gemma":[0.00051745324,0.000020974847,0.002625755,0.000052062194,0.000007546315,0.000004848409,0.0001732237,0.9871706,0.0025386557,0.0024886825,0.004278426,0.00012176759],"about_ca_topic_score_codex":0.0001300212,"about_ca_topic_score_gemma":0.00040404216,"teacher_disagreement_score":0.7697501,"about_ca_system_score_codex":0.00046059446,"about_ca_system_score_gemma":0.00010402624,"threshold_uncertainty_score":0.9998683},"labels":[],"label_agreement":null},{"id":"W2587954382","doi":"10.1109/ipdps.2017.90","title":"Distributed Vehicle Routing Approximation","year":2017,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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","funders":"","keywords":"Vehicle routing problem; Computer science; Approximation algorithm; Set (abstract data type); Context (archaeology); Mathematical optimization; Routing (electronic design automation); Linear programming; Duality (order theory); Graph; Theoretical computer science; Algorithm; Mathematics; Combinatorics; Computer network","score_opus":0.023180131873644986,"score_gpt":0.2744738383487814,"score_spread":0.25129370647513644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587954382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079412825,0.000007882323,0.88712245,0.00013620085,0.00019082177,0.000074731375,0.000004762391,0.00070469285,0.03234563],"genre_scores_gemma":[0.91451937,0.0000028826437,0.085213386,0.000012835354,0.0000564296,0.000005000018,0.000012962388,0.000018671913,0.00015846398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951434,0.00001691451,0.00013526462,0.000092921204,0.00008414492,0.00015642209],"domain_scores_gemma":[0.9994815,0.000027542996,0.00004168101,0.00037472456,0.000031779156,0.00004276616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002563293,0.00007525168,0.000082336715,0.000020464284,0.00026726036,0.00017593098,0.00018708453,0.00004976644,0.000063083105],"category_scores_gemma":[0.00021713767,0.00007635494,0.000024904857,0.00004003734,0.000020040085,0.00025546757,0.000039558352,0.000077403,0.000050659943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055047876,0.00002968108,0.032911874,0.000079095604,0.000058440735,0.000005014728,0.00034399217,0.8303182,0.018037532,0.015079221,0.0021863224,0.10094509],"study_design_scores_gemma":[0.00017402365,0.0000027572592,0.019273452,0.000007998828,0.0000041532185,0.0000011280447,0.000020590125,0.9697515,0.0101135485,0.00016668538,0.0003816844,0.00010252216],"about_ca_topic_score_codex":0.0000096757385,"about_ca_topic_score_gemma":0.0000020256064,"teacher_disagreement_score":0.83510655,"about_ca_system_score_codex":0.00003522948,"about_ca_system_score_gemma":0.000004249561,"threshold_uncertainty_score":0.3113664},"labels":[],"label_agreement":null},{"id":"W2589810429","doi":"10.1080/00207543.2017.1285075","title":"Physical Internet, conventional and hybrid logistic systems: a routing optimisation-based comparison using the Eastern Canada road network case study","year":2017,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; Container (type theory); Modular design; Routing (electronic design automation); Computer science; The Internet; Transport engineering; Work (physics); Greenhouse gas; Operations research; Engineering; Automotive engineering; Computer network","score_opus":0.18328565131983593,"score_gpt":0.4396937165274717,"score_spread":0.25640806520763576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589810429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9264033,0.00012701559,0.0696364,0.0005514447,0.0029292388,0.00028095566,0.0000042042707,0.00001610593,0.000051350813],"genre_scores_gemma":[0.9956888,0.000003520027,0.002197163,0.0000071396,0.0019888426,0.0000078551175,0.0000020137388,0.000021901338,0.00008278564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736714,0.00051761075,0.0005458158,0.00018735653,0.001152817,0.00022928146],"domain_scores_gemma":[0.9973852,0.00032127494,0.00039207286,0.00026429832,0.00154901,0.0000881571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032703069,0.00012507213,0.00021418571,0.00014573628,0.00047578028,0.00057649927,0.0005221252,0.000025204252,0.000009925008],"category_scores_gemma":[0.0012526216,0.00010275004,0.000046861558,0.00008978143,0.00015927781,0.00025874187,0.00012170455,0.0005970446,9.583694e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042791777,0.000076307886,0.047005635,0.000017960732,0.00020035963,0.00041198372,0.00034283596,0.9490663,0.00006753365,0.000051825107,0.00060242997,0.0021140503],"study_design_scores_gemma":[0.00048526184,0.00005770838,0.0025831629,0.00012908247,0.000029107825,0.0017881242,0.0019531744,0.99255794,0.00016985972,0.000023113846,0.0001309453,0.00009248868],"about_ca_topic_score_codex":0.049564406,"about_ca_topic_score_gemma":0.0065500047,"teacher_disagreement_score":0.06928549,"about_ca_system_score_codex":0.0004777557,"about_ca_system_score_gemma":0.000334301,"threshold_uncertainty_score":0.95676464},"labels":[],"label_agreement":null},{"id":"W2592065458","doi":"10.4018/978-1-4666-1589-2.ch018","title":"The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Heuristics; Combinatorial optimization; Metaheuristic; Extremal optimization; Mathematical optimization; 2-opt; Lin–Kernighan heuristic; Heuristic; Routing (electronic design automation); Computer science; Quadratic assignment problem; Traveling purchaser problem; Bottleneck traveling salesman problem; Optimization problem; Mathematics; Meta-optimization","score_opus":0.014491528879275187,"score_gpt":0.24421397781514273,"score_spread":0.22972244893586755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592065458","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064319244,0.0011237202,0.026849829,0.00010861915,0.0010887244,0.0015022095,0.00008765947,0.00072604825,0.96787],"genre_scores_gemma":[0.9796697,0.00013907703,0.014260617,0.0001293898,0.00144511,0.000077201,0.000023242497,0.00038753598,0.0038681384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979876,0.00012450268,0.0005934451,0.0003579478,0.0003326435,0.0006038099],"domain_scores_gemma":[0.99854463,0.00036558442,0.00026042893,0.00054578076,0.00012122555,0.00016236433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011071282,0.00066450273,0.00044222092,0.000039194736,0.00061789725,0.0003483282,0.0004107402,0.0004564872,0.000010064812],"category_scores_gemma":[0.000043364995,0.00038522788,0.0001984287,0.00004863395,0.0001440697,0.00008275874,0.0001233849,0.0007495108,0.000015133683],"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.000034753983,0.0000063047646,0.000028939507,0.00003860628,0.00019484476,0.000001284125,0.0005337569,0.39846995,0.00002623147,0.58173674,0.00013938166,0.018789215],"study_design_scores_gemma":[0.0023239888,0.000356372,0.00013015923,0.0011415767,0.00038775048,0.00011216504,0.00019279613,0.7272236,0.00032884162,0.25691518,0.008665968,0.0022216577],"about_ca_topic_score_codex":0.000021270314,"about_ca_topic_score_gemma":0.0000063798743,"teacher_disagreement_score":0.9790265,"about_ca_system_score_codex":0.00038452217,"about_ca_system_score_gemma":0.00007753149,"threshold_uncertainty_score":0.99986},"labels":[],"label_agreement":null},{"id":"W2593704234","doi":"10.1016/j.trb.2017.02.004","title":"The electric vehicle routing problem with nonlinear charging function","year":2017,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":583,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"Agence Nationale de la Recherche; Universidad EAFIT; Universidad de Antioquia; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Testbed; Nonlinear system; Electric vehicle; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Computer science; Metaheuristic; Range (aeronautics); Battery (electricity); Function (biology); Nonlinear programming; Engineering; Algorithm; Mathematics; Power (physics)","score_opus":0.23291961149396032,"score_gpt":0.4196467031617125,"score_spread":0.18672709166775217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593704234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43692896,0.00018791734,0.5565362,0.0010504369,0.00023383682,0.0008183786,0.00000795917,0.0006557007,0.003580634],"genre_scores_gemma":[0.7920495,0.00026387014,0.20677923,0.000027752254,0.00028389937,0.0001917107,0.000023971967,0.000060467446,0.00031959594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966031,0.0012042294,0.0004039987,0.0003566118,0.0006903172,0.0007417415],"domain_scores_gemma":[0.9966263,0.002228637,0.000113334514,0.0005557514,0.0003302187,0.0001457673],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01061197,0.0001828239,0.00024061992,0.00010157313,0.0022292999,0.0003490433,0.0004919341,0.00015095224,0.000058767237],"category_scores_gemma":[0.0009741738,0.00012051588,0.00006661802,0.0004033894,0.00022909472,0.00028310408,0.000014389932,0.0009084249,0.00003186366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015533573,0.00020225348,0.13049136,0.0003337405,0.00047953363,0.00012290866,0.0018581658,0.47516796,0.06832265,0.035320953,0.0013621318,0.28478497],"study_design_scores_gemma":[0.0014707897,0.00054595096,0.37862918,0.00012330421,0.000065984495,0.000005962996,0.0004705469,0.58423746,0.015734548,0.0025406303,0.015591647,0.00058401853],"about_ca_topic_score_codex":0.00003279547,"about_ca_topic_score_gemma":0.000074780626,"teacher_disagreement_score":0.35512054,"about_ca_system_score_codex":0.00006338847,"about_ca_system_score_gemma":0.00005159356,"threshold_uncertainty_score":0.9990697},"labels":[],"label_agreement":null},{"id":"W2595214333","doi":"10.1111/itor.12403","title":"Heuristics for tactical time slot management: a periodic vehicle routing problem view","year":2017,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Polytechnique Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Vehicle routing problem; Time horizon; Computer science; Schedule; Benchmark (surveying); Routing (electronic design automation); Heuristic; Mathematical optimization; Selection (genetic algorithm); Operations research; Plan (archaeology); Mathematics; Computer network; Artificial intelligence","score_opus":0.07925687692376843,"score_gpt":0.4127364920905471,"score_spread":0.33347961516677865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595214333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005558486,0.00005576292,0.92285335,0.003806271,0.0006289174,0.0010514528,0.0001303897,0.00016752504,0.065747835],"genre_scores_gemma":[0.8464847,0.00014555895,0.1471526,0.000040590447,0.00020247952,0.00047107297,0.000052002462,0.00005245902,0.005398534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980885,0.00011172179,0.00040863192,0.00030484036,0.0007097388,0.00037660735],"domain_scores_gemma":[0.998625,0.00046914988,0.00003396656,0.0003109455,0.00047575586,0.000085217616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018004391,0.00014118206,0.00015283575,0.00033654098,0.0008494911,0.0006463338,0.00062123715,0.00009895144,0.0007980489],"category_scores_gemma":[0.0003640344,0.00016006404,0.00007208654,0.00017320376,0.00014039713,0.00052855257,0.000036450438,0.00046401843,0.00013466798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013397528,0.0003336013,0.0008488786,0.00021755941,0.0002918624,0.00003149077,0.00059065054,0.851084,0.003047371,0.06543312,0.00071321503,0.07727428],"study_design_scores_gemma":[0.00085334067,0.000027713277,0.0020534508,0.00010526936,0.000009014645,0.000010806698,0.000057320696,0.979714,0.0005990921,0.001312028,0.015083768,0.00017424788],"about_ca_topic_score_codex":0.000026308677,"about_ca_topic_score_gemma":0.000024196672,"teacher_disagreement_score":0.84092623,"about_ca_system_score_codex":0.0004149934,"about_ca_system_score_gemma":0.0000833919,"threshold_uncertainty_score":0.87380755},"labels":[],"label_agreement":null},{"id":"W2595282281","doi":"","title":"Some Applications of the Generalized Vehicle Routing Problem","year":2008,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Travelling salesman problem; Vertex (graph theory); Routing (electronic design automation); Computer science; Mathematical optimization; Set (abstract data type); Extension (predicate logic); Variety (cybernetics); Mathematics; Theoretical computer science; Graph; Computer network; Artificial intelligence","score_opus":0.011344872875552733,"score_gpt":0.21834270917941423,"score_spread":0.20699783630386148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595282281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.746476,0.0004959011,0.24920876,0.0003467985,0.0001745571,0.00048601886,0.000010202359,0.00047940123,0.002322349],"genre_scores_gemma":[0.81089383,0.000121226105,0.18810244,0.00010958136,0.00018673054,0.0000666858,0.000004336003,0.000043891614,0.00047129497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999166,0.00008156212,0.00027179718,0.00013219051,0.00015444423,0.00019396703],"domain_scores_gemma":[0.9994476,0.000072716764,0.00007149982,0.00031472612,0.00004887281,0.00004460126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019894828,0.00011507922,0.00015291975,0.00004989681,0.00028147548,0.000011043198,0.00023507304,0.00010245998,0.000013446971],"category_scores_gemma":[0.000035825356,0.000098878096,0.00008323648,0.00036607965,0.00014273856,0.00008479298,0.000030499978,0.00021035527,0.00000714737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009559083,0.000075744916,0.02266007,0.00017234636,0.00014207889,0.0000040828063,0.007045413,0.7627564,0.056933712,0.13328338,0.00175135,0.015165884],"study_design_scores_gemma":[0.0029232376,0.00004186141,0.026440745,0.000089295674,0.0001238883,0.00012645198,0.0004209383,0.802286,0.12717646,0.015528841,0.023619523,0.001222719],"about_ca_topic_score_codex":0.000020036912,"about_ca_topic_score_gemma":0.0000013485849,"teacher_disagreement_score":0.117754534,"about_ca_system_score_codex":0.00007745382,"about_ca_system_score_gemma":0.000021683321,"threshold_uncertainty_score":0.40321317},"labels":[],"label_agreement":null},{"id":"W2595691866","doi":"","title":"Enhanced Branch-and-Price-and-Cut for Vehicle Routing with Split Deliveries and Time Windows","year":2010,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Vehicle routing problem; Column generation; Tabu search; Path (computing); Mathematical optimization; Routing (electronic design automation); Computer science; Column (typography); Mathematics; Algorithm","score_opus":0.0060955354736997175,"score_gpt":0.21597083292230068,"score_spread":0.20987529744860095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595691866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01936972,0.0021329622,0.9609421,0.00025381232,0.000099937075,0.0016582436,0.00012953042,0.0024741716,0.012939557],"genre_scores_gemma":[0.1095533,0.0012424131,0.8364532,0.00044908372,0.00044320693,0.00086658687,0.00006955037,0.0016508868,0.049271747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981829,0.000065577085,0.0003664324,0.00055450026,0.00019516757,0.0006354574],"domain_scores_gemma":[0.99873,0.00022221076,0.00020697237,0.0005087885,0.00006529433,0.00026672415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004913741,0.00057161774,0.0006588132,0.00037524608,0.0001753496,0.0002142283,0.00021515423,0.0007302811,0.00008143996],"category_scores_gemma":[0.00014932013,0.0005723228,0.00006522038,0.00022840628,0.00016342549,0.00016184115,0.00013857114,0.0005874554,0.0000046661953],"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.0008855601,0.00029458408,0.014448764,0.0051181368,0.002278942,0.000074951546,0.0042320485,0.041750696,0.2694409,0.027530624,0.034025367,0.59991944],"study_design_scores_gemma":[0.0024113432,0.00032404013,0.0040435535,0.00081062055,0.00029819983,0.00016569525,0.00006787588,0.9397948,0.021625234,0.00048006154,0.027841842,0.0021367471],"about_ca_topic_score_codex":0.0008651193,"about_ca_topic_score_gemma":0.0009863448,"teacher_disagreement_score":0.8980441,"about_ca_system_score_codex":0.00009485351,"about_ca_system_score_gemma":0.000059143716,"threshold_uncertainty_score":0.99967283},"labels":[],"label_agreement":null},{"id":"W2596332277","doi":"10.1007/s10951-017-0513-5","title":"Solving a wind turbine maintenance scheduling problem","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wind power; Mathematical optimization; Solver; Scheduling (production processes); Turbine; Integer programming; Constraint programming; Time horizon; Job shop scheduling; Operations research; Linear programming; Context (archaeology); Industrial engineering; Schedule; Stochastic programming; Engineering; Mathematics","score_opus":0.021650692101702274,"score_gpt":0.2777688907375572,"score_spread":0.2561181986358549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596332277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5338174,0.0007719699,0.4609972,0.000503397,0.00096881564,0.00009497843,0.0000011097719,0.000103399725,0.002741703],"genre_scores_gemma":[0.52563095,0.000091334536,0.47376475,0.000022211727,0.0004102875,4.852342e-7,1.9762281e-7,0.000036056736,0.000043709242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984041,0.000041868097,0.00071592355,0.0001388559,0.00032020838,0.0003790495],"domain_scores_gemma":[0.9983976,0.00009780479,0.0006345322,0.00036776927,0.0003362079,0.00016608398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017372138,0.00019647229,0.0003787084,0.00016982811,0.0003656847,0.00036085697,0.0005973679,0.000118745396,0.00003237437],"category_scores_gemma":[0.0010277228,0.00018320534,0.00015453674,0.00010502818,0.000059412174,0.00086087367,0.00008336637,0.0006949049,0.000011547694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014289502,0.000013894478,0.0032420168,0.000081340426,0.00007545354,0.000047149766,0.0002816936,0.96834415,0.01930921,0.0001896121,0.000042019557,0.008359177],"study_design_scores_gemma":[0.0013926777,0.0000624336,0.0036863608,0.0014040343,0.000068926,0.0003446499,0.00026006548,0.9813325,0.009547702,0.00083199044,0.00067561254,0.0003930772],"about_ca_topic_score_codex":0.0000028844197,"about_ca_topic_score_gemma":0.0000010679788,"teacher_disagreement_score":0.012988326,"about_ca_system_score_codex":0.00011837012,"about_ca_system_score_gemma":0.000068526984,"threshold_uncertainty_score":0.74708974},"labels":[],"label_agreement":null},{"id":"W2596774957","doi":"","title":"Aircrew Pairings with Possible Repetitions of the Same Flight Number","year":2009,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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; Schedule; Computer science; Heuristic; Set (abstract data type); Phase (matter); Sequence (biology); Pairing; Aircrew; Mathematical optimization; Quality (philosophy); Mathematics; Engineering; Aeronautics; Artificial intelligence","score_opus":0.007451375031077562,"score_gpt":0.22384981064333542,"score_spread":0.21639843561225786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596774957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15298988,0.00028254348,0.82992846,0.003990015,0.00011083631,0.0006175671,0.00002972593,0.0017076002,0.010343406],"genre_scores_gemma":[0.7102037,0.0000507343,0.28810507,0.0007259985,0.000053897278,0.0000620668,0.000005406901,0.000057438116,0.00073570106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845815,0.00010450229,0.00041383968,0.00024682606,0.00031525095,0.00046145546],"domain_scores_gemma":[0.99863935,0.00008077881,0.00013012196,0.0008812827,0.00012433963,0.00014415066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044255093,0.000261965,0.00029262723,0.00014645692,0.00016982287,0.00006902651,0.00043229066,0.00018365668,0.00007687581],"category_scores_gemma":[0.00011952064,0.00020754212,0.00013537006,0.0009455335,0.00008054428,0.00022924642,0.00005573441,0.0003812121,0.000010366285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007585986,0.00031100312,0.107703134,0.00014160352,0.00015251321,0.000031585427,0.0009879284,0.77583617,0.033028968,0.056214284,0.0077477624,0.017769188],"study_design_scores_gemma":[0.0011758287,0.00022324371,0.29064268,0.0005230472,0.00014504668,0.00042775163,0.00014923411,0.5293981,0.16632886,0.0049973587,0.004884007,0.0011048664],"about_ca_topic_score_codex":0.00044463135,"about_ca_topic_score_gemma":0.00024944602,"teacher_disagreement_score":0.55721384,"about_ca_system_score_codex":0.00021440811,"about_ca_system_score_gemma":0.00008867554,"threshold_uncertainty_score":0.8463322},"labels":[],"label_agreement":null},{"id":"W2596850612","doi":"","title":"Aircraft Routing Under Different Business Processes","year":2009,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Adaptability; Robustness (evolution); Computer science; Routing (electronic design automation); Operations research; Set (abstract data type); Engineering; Mathematical optimization; Mathematics; Computer network; Economics","score_opus":0.011901509453573293,"score_gpt":0.2373497645693284,"score_spread":0.22544825511575511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596850612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14079185,0.0007438253,0.85192263,0.0017989308,0.00014408199,0.00038794696,0.000009734957,0.003347337,0.00085368357],"genre_scores_gemma":[0.84213203,0.00022020745,0.15597379,0.0010324218,0.00017351264,0.00009175333,0.000021446183,0.000100534126,0.00025429463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783766,0.000091592636,0.0005306636,0.00038669465,0.0003429591,0.00081043266],"domain_scores_gemma":[0.99864924,0.00014079198,0.00011156007,0.0006176517,0.00022813184,0.00025261036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004054159,0.00044667948,0.00041978853,0.00034368143,0.0002134356,0.00022303128,0.00044247246,0.00028876192,0.000036156267],"category_scores_gemma":[0.00036612598,0.00044951052,0.00009324662,0.0012236893,0.00004067076,0.00036734578,0.0000688088,0.00042689062,0.000014048909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021482248,0.00015318488,0.009569658,0.0001349648,0.000045551198,0.00002023384,0.00024304408,0.9433074,0.012471642,0.0052261786,0.00085347664,0.027953183],"study_design_scores_gemma":[0.0005590669,0.00006476809,0.14873247,0.00017195819,0.000049378014,0.00008629311,0.00008923917,0.8187154,0.027775703,0.0024411532,0.00047280712,0.00084178505],"about_ca_topic_score_codex":0.00022118,"about_ca_topic_score_gemma":0.00020930871,"teacher_disagreement_score":0.7013402,"about_ca_system_score_codex":0.0004368971,"about_ca_system_score_gemma":0.00011223853,"threshold_uncertainty_score":0.9997957},"labels":[],"label_agreement":null},{"id":"W2597509186","doi":"","title":"Exact methods for multi-objective optimization problems and application to routing problems","year":2010,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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é Laval","funders":"","keywords":"Computer science; Mathematical optimization; Routing (electronic design automation); Mathematics; Computer network","score_opus":0.0241780881495648,"score_gpt":0.29531923297433327,"score_spread":0.2711411448247685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597509186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020396812,0.00038987785,0.9905942,0.0010057187,0.0002793298,0.0028195642,0.000052481348,0.00088403636,0.0019351115],"genre_scores_gemma":[0.05349047,0.00021398054,0.9439719,0.000036840313,0.000037978898,0.0011514042,0.00041271155,0.00016354218,0.0005212116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949626,0.002679336,0.00073939614,0.000955987,0.00021624604,0.00044649077],"domain_scores_gemma":[0.9944905,0.0014488387,0.00041404928,0.0013965615,0.0020033189,0.00024675042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009756724,0.00046955489,0.00050239154,0.00031209734,0.00036971705,0.000449495,0.0006844361,0.0005757396,0.000014080741],"category_scores_gemma":[0.0029402522,0.0005530361,0.00013786441,0.0004958384,0.00008821302,0.00017568699,0.00067824835,0.00085204135,0.000004778037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042235697,0.00010456812,0.0002060996,0.00045441763,0.000066915214,8.390596e-8,0.008491242,0.84405756,0.011638331,0.0022376005,0.000029367351,0.13270958],"study_design_scores_gemma":[0.00045851525,5.7750424e-7,0.000311175,0.0007142648,0.0000561481,0.000003701834,0.00006410436,0.9700472,0.025612716,0.00066462485,0.001549383,0.0005175852],"about_ca_topic_score_codex":0.0002443465,"about_ca_topic_score_gemma":0.00030614022,"teacher_disagreement_score":0.13219199,"about_ca_system_score_codex":0.00018622029,"about_ca_system_score_gemma":0.000097279975,"threshold_uncertainty_score":0.99969214},"labels":[],"label_agreement":null},{"id":"W2597737709","doi":"","title":"What You Should Know about the Vehicle Routing Problem","year":2007,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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; Metaheuristic; Set (abstract data type); Computer science; Operations research; Routing (electronic design automation); Mathematical optimization; Engineering; Mathematics; Algorithm; Computer network","score_opus":0.02874457439702727,"score_gpt":0.2945735185899438,"score_spread":0.2658289441929165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597737709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04516821,0.0014435792,0.8714701,0.0010797279,0.0011607861,0.00042829246,9.757646e-7,0.0018792348,0.07736908],"genre_scores_gemma":[0.83353597,0.0002844019,0.16108896,0.0005769741,0.00034400608,0.000013067092,0.000004023328,0.000101530975,0.004051096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987745,0.000050510756,0.0003360969,0.00017567915,0.00021632659,0.0004468504],"domain_scores_gemma":[0.99924564,0.0002467747,0.000037093334,0.00032645566,0.00006168003,0.000082349114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018967721,0.000160167,0.00013242287,0.00005791854,0.00015744477,0.00022701346,0.00024572655,0.000108947206,0.00015181096],"category_scores_gemma":[0.00007312154,0.00011843507,0.00005956458,0.0003955112,0.00003541029,0.00039132917,0.00005622657,0.0002872276,0.00008291178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007943471,0.000027024309,0.004398109,0.0000531565,0.00006253205,0.000007414891,0.0025794927,0.60191965,0.0062404424,0.0071802284,0.0018493065,0.3756747],"study_design_scores_gemma":[0.0004202448,0.000021030724,0.004780672,0.0001297576,0.000025304684,0.000015461967,0.0019418627,0.93778104,0.025203211,0.00031171262,0.028930224,0.0004394596],"about_ca_topic_score_codex":0.000015092199,"about_ca_topic_score_gemma":0.000027883823,"teacher_disagreement_score":0.78836775,"about_ca_system_score_codex":0.00006876597,"about_ca_system_score_gemma":0.000011153649,"threshold_uncertainty_score":0.48296422},"labels":[],"label_agreement":null},{"id":"W2598418346","doi":"","title":"A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Université du Québec à Montréal; Polytechnique Montréal; École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Column generation; Mathematical optimization; Benchmark (surveying); A priori and a posteriori; Computer science; Extension (predicate logic); Set (abstract data type); Routing (electronic design automation); Service (business); Mathematics; Economics","score_opus":0.007475988084122415,"score_gpt":0.2090726984807672,"score_spread":0.20159671039664478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598418346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065944376,0.00021215116,0.9879834,0.0021883333,0.000032647516,0.0015785716,0.000016357815,0.0011557345,0.0002383691],"genre_scores_gemma":[0.15738127,0.000025401207,0.84053653,0.0007649323,0.00012664152,0.00067447603,0.000024373845,0.00017717892,0.00028921128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983668,0.00011591645,0.00033674805,0.00036759913,0.00025368374,0.00055928953],"domain_scores_gemma":[0.998414,0.00051370973,0.00015760299,0.0005238714,0.00024293867,0.00014790615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011167915,0.00034744022,0.00032196488,0.00015654581,0.0003564237,0.00024656023,0.00028078113,0.00016678777,0.00001659474],"category_scores_gemma":[0.00015823946,0.00025905352,0.000042886917,0.00054603606,0.000062585335,0.00032182678,0.0000628353,0.00029326268,0.000004048928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009964003,0.00002167354,0.0010011304,0.000120875535,0.00007060076,9.033956e-7,0.0003082516,0.9896385,0.000608162,0.00049733033,0.00018036188,0.0074525625],"study_design_scores_gemma":[0.00094639184,0.00018508217,0.0013688299,0.00025238085,0.0001067345,0.000057567744,0.0000669328,0.99557626,0.00074406323,0.00007490807,0.00024947777,0.00037135824],"about_ca_topic_score_codex":0.00032374825,"about_ca_topic_score_gemma":0.000233056,"teacher_disagreement_score":0.15078683,"about_ca_system_score_codex":0.00016143618,"about_ca_system_score_gemma":0.00008820727,"threshold_uncertainty_score":0.9999862},"labels":[],"label_agreement":null},{"id":"W2600655166","doi":"","title":"A Solution Method for a Car Fleet Management Problem with Maintenance Constraints","year":2006,"lang":"en","type":"article","venue":"Archive ouverte UNIGE (University of Geneva)","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":"Polytechnique Montréal","funders":"","keywords":"Renting; Computer science; Competitor analysis; Operations research; Tabu search; Stockout; Mathematical optimization; Engineering; Mathematics; Business; Algorithm; Marketing","score_opus":0.007470868014500835,"score_gpt":0.1990185386360051,"score_spread":0.19154767062150427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600655166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004224312,0.000013984259,0.97611976,0.00008226819,0.00003856654,0.00047945153,0.00008278564,0.00014865068,0.01881025],"genre_scores_gemma":[0.068591654,0.00002465771,0.9304527,0.000016229833,0.000013067464,0.0000019514084,0.000044936463,0.00002377972,0.00083101576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991736,0.00007840246,0.000112683854,0.0002241611,0.00013433334,0.00027684364],"domain_scores_gemma":[0.9995281,0.00006917301,0.00007005032,0.00019951895,0.000078487945,0.00005466493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024787322,0.00013828083,0.00020040211,0.00015955565,0.00014601447,0.000007935892,0.00020517252,0.000044266773,0.000021269763],"category_scores_gemma":[0.000003902565,0.00016509024,0.00007577938,0.00020190311,0.00013994945,0.00009927443,0.000054280117,0.00007625647,0.000003352132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023296959,0.000093789786,0.0007454696,0.0005790574,0.0004629831,0.000051031988,0.0019321705,0.86791265,0.013402322,0.0421369,0.010769148,0.061681487],"study_design_scores_gemma":[0.0019131072,0.00009821067,0.002909006,0.0001040155,0.00012802282,0.000009940959,0.0012140411,0.9851631,0.0006086168,0.0022018107,0.0053541977,0.0002959474],"about_ca_topic_score_codex":0.00012675565,"about_ca_topic_score_gemma":0.00032258162,"teacher_disagreement_score":0.11725041,"about_ca_system_score_codex":0.000086712505,"about_ca_system_score_gemma":0.000025049512,"threshold_uncertainty_score":0.6732185},"labels":[],"label_agreement":null},{"id":"W2601843465","doi":"","title":"Tabu Search, Partial Elementarity, and Generalized k -Path Inequalities for the Vehicle Routing Problem with Time Windows","year":2006,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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); Triangle inequality; Mathematics; Combinatorics","score_opus":0.013044578428213232,"score_gpt":0.23639253800569535,"score_spread":0.2233479595774821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601843465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22009058,0.0005159565,0.7758559,0.0010373234,0.00003419686,0.0012925377,0.0000647803,0.00090694684,0.00020180926],"genre_scores_gemma":[0.6062942,0.00004626374,0.39186883,0.00030288138,0.00022269523,0.00067749067,0.0000496659,0.00011350849,0.00042446566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796456,0.00017236659,0.0004829358,0.0003229589,0.00030709384,0.0007500543],"domain_scores_gemma":[0.99889404,0.00034214224,0.00010629212,0.00042752616,0.00010444,0.00012558617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014095573,0.0003214994,0.00032636544,0.00013964246,0.00041634537,0.00028965747,0.00027957253,0.00014852213,0.000024086836],"category_scores_gemma":[0.000052935837,0.00026008452,0.00007866574,0.00033268498,0.00010348037,0.00025996915,0.0001202051,0.0003015943,0.0000025946244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012901844,0.00007354361,0.04060059,0.00012097049,0.00012449775,0.000007616299,0.00059063005,0.9124969,0.017973617,0.018447323,0.0016320272,0.007803236],"study_design_scores_gemma":[0.0011023331,0.000094075454,0.0056165624,0.00004217684,0.000058097026,0.000025212326,0.000105085535,0.97402537,0.016863398,0.0005887844,0.0011228966,0.00035602725],"about_ca_topic_score_codex":0.0069638826,"about_ca_topic_score_gemma":0.0011609788,"teacher_disagreement_score":0.38620362,"about_ca_system_score_codex":0.00022010518,"about_ca_system_score_gemma":0.00007945672,"threshold_uncertainty_score":0.99998516},"labels":[],"label_agreement":null},{"id":"W2601972902","doi":"","title":"A Theoretical Comparison of Feasibility Cuts for the Integrated Aircraft Routing and Crew Pairing Problem","year":2006,"lang":"en","type":"article","venue":"","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Routing (electronic design automation); Pairing; Set (abstract data type); Decomposition; Computer science; Mathematical optimization; Benders' decomposition; Operations research; Engineering; Aeronautics; Mathematics; Computer network","score_opus":0.023843547588331182,"score_gpt":0.29875097133638007,"score_spread":0.2749074237480489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601972902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116473705,0.00014598096,0.8788051,0.000135493,0.000043231496,0.00045914084,0.0000043763534,0.00027836408,0.0036546094],"genre_scores_gemma":[0.76117885,0.0000017530632,0.23872413,0.000008057552,0.000021652897,0.000014422334,0.000003320227,0.000017945546,0.000029870464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991354,0.00007001781,0.0003670734,0.00014447489,0.00009320165,0.00018986259],"domain_scores_gemma":[0.9989133,0.00076433306,0.000042647327,0.00016853672,0.00008285715,0.000028361477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008774486,0.00011570011,0.00020632714,0.000029303059,0.00007933958,0.00003389584,0.00009767148,0.00006590352,0.000038517454],"category_scores_gemma":[0.00018704534,0.000079142446,0.000046444235,0.00015977808,0.00012027587,0.000048844977,0.000031470714,0.00012739132,5.343016e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003461543,0.00007778136,0.09240548,0.0002530361,0.00005080515,2.0749944e-7,0.00064191764,0.7011605,0.0050183334,0.18521339,0.00049855234,0.014645406],"study_design_scores_gemma":[0.00029112623,0.000025146279,0.005450813,0.00003421331,0.000024241255,0.0000014118616,0.00023005276,0.98354876,0.007683479,0.0025470587,0.0000679218,0.00009577317],"about_ca_topic_score_codex":0.00004002132,"about_ca_topic_score_gemma":0.00002330246,"teacher_disagreement_score":0.6447052,"about_ca_system_score_codex":0.00003319304,"about_ca_system_score_gemma":0.000011712216,"threshold_uncertainty_score":0.32273355},"labels":[],"label_agreement":null},{"id":"W2602117721","doi":"","title":"Branch-and-Price-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Vehicle routing problem; Computer science; Routing (electronic design automation); Economics; Computer network","score_opus":0.010436719385956935,"score_gpt":0.21173515353165204,"score_spread":0.2012984341456951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602117721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28365943,0.0011723026,0.71163243,0.0009321882,0.00003226348,0.001120086,0.000019045849,0.0010491733,0.0003830918],"genre_scores_gemma":[0.70768523,0.00037318878,0.29033476,0.000462406,0.00010404707,0.00043748948,0.0000075489584,0.00012174893,0.00047356094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982979,0.00008285147,0.00038528544,0.0003625978,0.00023032408,0.0006409872],"domain_scores_gemma":[0.9985759,0.0005398915,0.0001114237,0.00047279443,0.000105796695,0.00019418151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007837031,0.00033690795,0.0003432171,0.00015762559,0.0005450228,0.00012716328,0.00027569832,0.00019422629,0.000013052407],"category_scores_gemma":[0.00011407876,0.00027237897,0.000079312,0.0003869637,0.00013971169,0.0002983966,0.00011577843,0.0003622631,0.000006034492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029986986,0.00011663738,0.0724034,0.0002948972,0.00043238368,0.00004204029,0.0026110876,0.800396,0.026205862,0.00669129,0.002158538,0.088347964],"study_design_scores_gemma":[0.00078111136,0.00010859603,0.021947837,0.000060118622,0.00005914759,0.00025369407,0.000040504547,0.96985203,0.0053833537,0.00020884398,0.00091057736,0.00039418117],"about_ca_topic_score_codex":0.0005417499,"about_ca_topic_score_gemma":0.00012323965,"teacher_disagreement_score":0.42402583,"about_ca_system_score_codex":0.00016066335,"about_ca_system_score_gemma":0.000073808755,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W2602684069","doi":"10.1016/j.ejor.2018.01.054","title":"The quadratic shortest path problem: complexity, approximability, and solution methods","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"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":"Air Force Office of Scientific Research; Air Force Materiel Command; U.S. Air Force; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Shortest path problem; Quadratic equation; Mathematical optimization; Combinatorics; Regular polygon; Function (biology); Approximation algorithm; Graph","score_opus":0.16577740807923447,"score_gpt":0.4255515052571589,"score_spread":0.25977409717792443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602684069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040392864,0.0005916156,0.93375117,0.0023784821,0.0002902903,0.00031510025,0.0000035275925,0.00004717208,0.022229785],"genre_scores_gemma":[0.5202755,0.00009239445,0.4789783,0.00002241954,0.0004380543,0.0000023268758,0.0000017048218,0.000029176792,0.00016012379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945925,0.0037872784,0.0005536562,0.00013238663,0.00064982387,0.00028436107],"domain_scores_gemma":[0.99737334,0.00096316,0.000064506436,0.00019061295,0.0012705126,0.00013786502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024506766,0.00010242827,0.00014024982,0.00013102741,0.00071890553,0.0003716837,0.0003467525,0.000022465663,0.000055028504],"category_scores_gemma":[0.0016090783,0.00007199962,0.0000393263,0.00033764154,0.0006237324,0.00024369705,0.00014555818,0.000557837,0.000024285644],"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.00041196632,0.0004513626,0.00616143,0.00028352733,0.0005677846,0.00011550305,0.009105756,0.115402736,0.13867202,0.11671324,0.035845164,0.5762695],"study_design_scores_gemma":[0.0007238874,0.0007990355,0.019759318,0.00011331727,0.000016442516,0.0003072649,0.00028418744,0.95107454,0.0022400888,0.005493329,0.018950045,0.00023856551],"about_ca_topic_score_codex":0.0000022251406,"about_ca_topic_score_gemma":0.0000045710444,"teacher_disagreement_score":0.8356718,"about_ca_system_score_codex":0.00008894325,"about_ca_system_score_gemma":0.000110678506,"threshold_uncertainty_score":0.8493605},"labels":[],"label_agreement":null},{"id":"W2602703059","doi":"","title":"European Driver Rules in Vehicle Routing with Time Windows","year":2009,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Tabu search; Heuristics; Computer science; Column generation; Task (project management); Routing (electronic design automation); Heuristic; Mathematical optimization; Operations research; Algorithm; Engineering; Artificial intelligence; Mathematics; Embedded system","score_opus":0.007268098677596334,"score_gpt":0.21271114448679942,"score_spread":0.20544304580920308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602703059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46678662,0.0002488579,0.52035147,0.00064524566,0.00003903048,0.00047411595,0.000010627281,0.0023049721,0.009139066],"genre_scores_gemma":[0.7571299,0.00002954318,0.24180926,0.00054320204,0.00008069491,0.000025983563,0.000014538036,0.00010035707,0.00026652892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979197,0.00025392917,0.0004647864,0.0003576829,0.00026917906,0.0007347549],"domain_scores_gemma":[0.9989834,0.00008728742,0.00009525534,0.0005719201,0.000056980603,0.000205197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009795657,0.00034992065,0.00034561512,0.00039081834,0.00012019118,0.00014732221,0.00039714703,0.00015336568,0.000039868035],"category_scores_gemma":[0.00010391279,0.00035656994,0.000075608485,0.0006696661,0.00004372837,0.00036164763,0.000060966475,0.0005080955,0.00008573996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046650977,0.00011114066,0.03519501,0.00001891441,0.00003101368,0.00017355125,0.00060291373,0.87840354,0.02871873,0.0017406318,0.00050625583,0.054451637],"study_design_scores_gemma":[0.00066619326,0.00008849811,0.17530726,0.000101043246,0.00001440311,0.000049804188,0.000030936517,0.8172093,0.0055741086,0.00019297056,0.0003201073,0.00044539277],"about_ca_topic_score_codex":0.0002589079,"about_ca_topic_score_gemma":0.0001267015,"teacher_disagreement_score":0.29034325,"about_ca_system_score_codex":0.00036384477,"about_ca_system_score_gemma":0.00004488508,"threshold_uncertainty_score":0.9998886},"labels":[],"label_agreement":null},{"id":"W2602862967","doi":"","title":"Fifty Years of Vehicle Routing","year":2009,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","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":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Heuristics; Metaheuristic; Truck; Routing (electronic design automation); Computer science; Decomposition; Mathematical optimization; Operations research; Mathematics; Engineering; Computer network","score_opus":0.01020903419138404,"score_gpt":0.23720877505741528,"score_spread":0.22699974086603125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602862967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76167256,0.0039927503,0.22318807,0.0026930298,0.0013083864,0.00020382066,0.00002486441,0.0003336723,0.0065828497],"genre_scores_gemma":[0.67886835,0.00026581538,0.31853804,0.00018999429,0.00033708394,0.0000017123236,0.0000070052783,0.00004945975,0.0017425332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982654,0.00020955355,0.00051325245,0.00026970316,0.00024757098,0.0004945508],"domain_scores_gemma":[0.99900657,0.0002612123,0.00014547732,0.00036361936,0.00008087132,0.00014224084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067287445,0.0002293801,0.00036812344,0.0001269198,0.00011690853,0.000048605096,0.00024262823,0.0003905918,0.00017524832],"category_scores_gemma":[0.00037678803,0.00031789392,0.00016091822,0.00051622064,0.00016831623,0.00019443987,0.000025550718,0.0005489414,0.000052444877],"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.000019588064,0.000107468615,0.0034483417,0.00015288756,0.00010304128,0.00006091125,0.008521596,0.27502602,0.009719441,0.0886565,0.0013801011,0.6128041],"study_design_scores_gemma":[0.0026351474,0.00036768935,0.12808718,0.0005940701,0.00027046064,0.00008966719,0.0010808025,0.7987199,0.024002964,0.011607811,0.031002158,0.0015421391],"about_ca_topic_score_codex":0.00012038744,"about_ca_topic_score_gemma":0.0000031691127,"teacher_disagreement_score":0.61126196,"about_ca_system_score_codex":0.00026120656,"about_ca_system_score_gemma":0.000041103955,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null},{"id":"W2603251541","doi":"10.1002/net.20332","title":"A branch‐and‐price‐based large neighborhood search algorithm for the vehicle routing problem with time windows","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":102,"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":"Vehicle routing problem; Benchmark (surveying); Mathematical optimization; Heuristic; Set (abstract data type); Computer science; Diversification (marketing strategy); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.009967092434046134,"score_gpt":0.24213027695610406,"score_spread":0.23216318452205792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603251541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001132509,0.00045086961,0.9958138,0.00033398034,0.00005611898,0.0007058597,0.000006989146,0.0004144485,0.001085424],"genre_scores_gemma":[0.7735234,0.000022246648,0.22535755,0.00043757068,0.00039527213,0.0000546305,0.00001720531,0.00007265035,0.00011949764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987096,0.00007505561,0.00021737842,0.00023702538,0.00017989194,0.0005810531],"domain_scores_gemma":[0.9990655,0.0004586159,0.000041740735,0.00026076328,0.000079299185,0.00009406143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008992765,0.00019677688,0.00020681808,0.00004332509,0.00027055733,0.00011438922,0.00017620069,0.00012566657,0.000025908788],"category_scores_gemma":[0.000018964174,0.00014767225,0.00005074737,0.00039399366,0.000025479747,0.00010659279,0.000022362176,0.00034228477,0.000004607556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013009329,0.000017353375,0.00037288215,0.000009414593,0.000027730306,0.0000010460003,0.00011466529,0.7934887,0.000057344103,0.00012137135,0.00015037633,0.20562613],"study_design_scores_gemma":[0.0013039451,0.00010457592,0.0017397869,0.000054789354,0.000032375177,0.0000051259553,0.000015200275,0.99585885,0.00012566637,0.000048847658,0.0005101016,0.00020073257],"about_ca_topic_score_codex":0.000002313891,"about_ca_topic_score_gemma":0.0000013545962,"teacher_disagreement_score":0.77239084,"about_ca_system_score_codex":0.000043579686,"about_ca_system_score_gemma":0.000026540954,"threshold_uncertainty_score":0.60218996},"labels":[],"label_agreement":null},{"id":"W2603777508","doi":"","title":"A General Variable Neighborhood Search for Solving the Uncapacitated Single Allocation p -Hub Median Problem","year":2009,"lang":"en","type":"article","venue":"RePEc: Research Papers in Economics","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":"Royal Military College of Canada","funders":"","keywords":"Variable neighborhood search; Heuristics; Variable (mathematics); Mathematical optimization; PlanetLab; Descent (aeronautics); Local search (optimization); Computer science; Mathematics; Metaheuristic","score_opus":0.030557530902397968,"score_gpt":0.29201636367974876,"score_spread":0.26145883277735077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603777508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47311917,0.00044897504,0.13677362,0.0078773135,0.0011996931,0.0077157402,0.0000933652,0.0014503682,0.37132174],"genre_scores_gemma":[0.8383868,0.0003983445,0.15984991,0.00013063266,0.00027708677,0.00016908959,0.00004812547,0.00008344424,0.0006565886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998096,0.00018026793,0.00042073114,0.00033496233,0.00018930972,0.0007787436],"domain_scores_gemma":[0.99853605,0.00070070504,0.000038970942,0.00042955476,0.00016805036,0.00012665027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030661575,0.00016568552,0.00021243306,0.00024697112,0.00023626024,0.000167409,0.00038431786,0.00015330022,0.0000308407],"category_scores_gemma":[0.0004001729,0.00015723679,0.00005552614,0.0004185911,0.00008315908,0.00020478253,0.000044793876,0.0004907447,0.0000033715594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020485018,0.000050948613,0.00026627808,0.000038354345,0.000029526698,0.0000010343666,0.0006812513,0.8075824,0.01729112,0.0031009063,0.00007234811,0.17086537],"study_design_scores_gemma":[0.0005348177,0.0001144276,0.0005349954,0.00004014123,0.0000045312972,0.000005112845,0.00029385963,0.99027264,0.0037644715,0.0020111774,0.0022282763,0.00019553611],"about_ca_topic_score_codex":0.000012337034,"about_ca_topic_score_gemma":0.000025818405,"teacher_disagreement_score":0.37066516,"about_ca_system_score_codex":0.00061711326,"about_ca_system_score_gemma":0.00015790766,"threshold_uncertainty_score":0.64119303},"labels":[],"label_agreement":null},{"id":"W2604134726","doi":"10.5539/mas.v11n5p52","title":"Solving Multi-Objective Vehicle Routing Problem with Time Windows Using Hybrid Ants Optimization and Tabu Search Based on Performance Metrics","year":2017,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Vehicle routing problem; Computer science; Mathematical optimization; Ant colony optimization algorithms; Pareto principle; Metaheuristic; Multi-objective optimization; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.029071672677627364,"score_gpt":0.2684625411401739,"score_spread":0.23939086846254656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604134726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31700394,0.000006011799,0.68116266,0.000007264891,0.000027601569,0.00032408963,0.000003243213,0.00014802952,0.0013171507],"genre_scores_gemma":[0.6164382,0.000002730749,0.38347587,0.000014927096,0.0000151833765,0.000008797929,0.000001249164,0.00003240261,0.00001066507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808586,0.0000301095,0.00021064939,0.0005363476,0.00059347984,0.00054355245],"domain_scores_gemma":[0.99898374,0.00008718768,0.00012467151,0.0005065564,0.0001578044,0.000140039],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016121856,0.00022188331,0.00021332322,0.00031327058,0.0015763268,0.0005574993,0.0004607378,0.00005213947,0.0000048788206],"category_scores_gemma":[0.00011183936,0.00021212688,0.000015792511,0.0005414263,0.00034297362,0.0006740492,0.0001478137,0.00026387573,0.0000047956955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015068765,0.000017340577,0.0031900206,0.000027017699,0.000004223199,0.0000014000128,0.0003320434,0.92196435,0.067132205,0.0000074106797,2.8798496e-7,0.0073086116],"study_design_scores_gemma":[0.00068680214,0.00003282744,0.0030063358,0.00007837233,0.000009994555,0.0000042652673,0.000024527848,0.95340353,0.042486936,0.0000040214477,3.7647376e-7,0.00026197993],"about_ca_topic_score_codex":0.000012773009,"about_ca_topic_score_gemma":8.620531e-7,"teacher_disagreement_score":0.29943424,"about_ca_system_score_codex":0.000241727,"about_ca_system_score_gemma":0.00013142133,"threshold_uncertainty_score":0.9997235},"labels":[],"label_agreement":null},{"id":"W2604135071","doi":"","title":"The Capacitated Team Orienteering and Profitable Tour Problems","year":2007,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Orienteering; Heuristic; Matching (statistics); Computer science; Operations research; Engineering; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.009517911438977173,"score_gpt":0.22581199666292132,"score_spread":0.21629408522394414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604135071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14365026,0.001598502,0.84932,0.0003033333,0.00019995983,0.0006853009,0.0000069013167,0.0017216854,0.002514045],"genre_scores_gemma":[0.75682205,0.0002773438,0.24137175,0.00016174407,0.000107866144,0.00019560238,0.0000067496217,0.00012123528,0.00093565125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998095,0.00006696846,0.00046648752,0.00026754916,0.000250551,0.0008534749],"domain_scores_gemma":[0.99883056,0.00025290204,0.000085461885,0.00048814344,0.00010395298,0.00023895479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021314214,0.00027709428,0.00022350419,0.0002046563,0.00041628297,0.00022315774,0.0002847362,0.00019449205,0.000007298506],"category_scores_gemma":[0.00028510366,0.00023931883,0.000056521334,0.00060849934,0.00008825808,0.00026023627,0.00009835081,0.00044917312,0.0000058068936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096779324,0.00012304533,0.09941888,0.0003072888,0.00023906816,0.000049500966,0.0027211295,0.6646444,0.081791036,0.024744146,0.0073008817,0.11856384],"study_design_scores_gemma":[0.00043582817,0.000060895374,0.018244473,0.00007101489,0.000023707476,0.00011961129,0.0003629542,0.937999,0.03023863,0.0008216107,0.011135725,0.00048654515],"about_ca_topic_score_codex":0.0006567878,"about_ca_topic_score_gemma":0.0010263225,"teacher_disagreement_score":0.6131718,"about_ca_system_score_codex":0.0002459994,"about_ca_system_score_gemma":0.00004008014,"threshold_uncertainty_score":0.9759139},"labels":[],"label_agreement":null},{"id":"W2604913432","doi":"","title":"Reaching the Elementary Lower Bound in the Vehicle Routing Problem with Time Windows","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Group for Research in Decision Analysis; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Column generation; Upper and lower bounds; Vehicle routing problem; Routing (electronic design automation); Relaxation (psychology); Mathematical optimization; Set (abstract data type); State space; Branch and bound; Tree (set theory); Mathematics; Path (computing); Shortest path problem; Computer science; Combinatorics","score_opus":0.007703593308363791,"score_gpt":0.21475462578448806,"score_spread":0.20705103247612427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604913432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6363426,0.0003641981,0.35026434,0.0056236084,0.00007025681,0.0023813643,0.000008798333,0.0011590064,0.0037858475],"genre_scores_gemma":[0.85534155,0.000022633834,0.1415655,0.0018591976,0.00011127037,0.0007733006,0.000013455925,0.00010738933,0.00020566833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975958,0.0003976477,0.00050760614,0.00031086474,0.00040030497,0.0007877924],"domain_scores_gemma":[0.9985418,0.00035052167,0.00012186019,0.0008202071,0.000061698265,0.00010394386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020456843,0.00033925334,0.0002665011,0.00018054582,0.0003521579,0.0004458792,0.000741405,0.00014906339,0.00008726464],"category_scores_gemma":[0.00008289284,0.00022008177,0.00008038244,0.0007565363,0.00008199042,0.0005229152,0.00011405904,0.0008357219,0.0000473802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047062564,0.00019605005,0.064385116,0.000060862425,0.00012783824,0.000050775638,0.0041441335,0.8673505,0.018471943,0.0028312462,0.00516474,0.037169717],"study_design_scores_gemma":[0.00048743462,0.00008213934,0.031005047,0.000087411914,0.000028254428,0.00007686214,0.00047039991,0.9642516,0.0016229739,0.00066375174,0.00084011455,0.00038401052],"about_ca_topic_score_codex":0.005546373,"about_ca_topic_score_gemma":0.0010413366,"teacher_disagreement_score":0.21899901,"about_ca_system_score_codex":0.00037074482,"about_ca_system_score_gemma":0.00006040037,"threshold_uncertainty_score":0.89746743},"labels":[],"label_agreement":null},{"id":"W2605705048","doi":"10.1080/03155986.2017.1303960","title":"New large-scale data instances for CARP and new variations of CARP","year":2017,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Samfund og Erhverv, Det Frie Forskningsråd","keywords":"Arc routing; Carp; Scale (ratio); Computer science; Time horizon; Routing (electronic design automation); Interval (graph theory); Horizon; Operations research; Fish <Actinopterygii>; Environmental science; Fishery; Geography; Mathematics; Biology; Mathematical optimization; Cartography; Computer network","score_opus":0.14214007323015554,"score_gpt":0.40551655497066014,"score_spread":0.2633764817405046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605705048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061832867,0.00039860132,0.97983056,0.000439968,0.00038124883,0.000946302,0.0007050185,0.00005259275,0.011062425],"genre_scores_gemma":[0.8213696,0.00033542974,0.1750266,0.000046323534,0.000493131,0.000084717576,0.00077606563,0.000023367833,0.0018448154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988301,0.00003092325,0.0004543154,0.000096307456,0.0004022609,0.00018612524],"domain_scores_gemma":[0.9986201,0.00022702379,0.000095998264,0.00043499543,0.0004886432,0.00013322762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018791516,0.000083599945,0.00015539705,0.00016794464,0.00057076564,0.0007817383,0.0003119074,0.00008521942,0.000013250108],"category_scores_gemma":[0.00078103895,0.000078655285,0.000013660278,0.00009964175,0.000043046854,0.0032349252,0.00015896633,0.00011397921,0.000005214212],"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.00011957899,0.00002328432,0.014306689,0.00205934,0.00025482004,4.0591655e-7,0.017942833,0.32359964,0.0004662997,0.44006392,0.083984785,0.11717839],"study_design_scores_gemma":[0.00080658053,0.000027615475,0.004508482,0.0000628886,0.0000056797526,0.000003966644,0.0006809508,0.84837526,0.000100893725,0.00011420399,0.14521298,0.00010046965],"about_ca_topic_score_codex":0.00050306827,"about_ca_topic_score_gemma":0.00009934755,"teacher_disagreement_score":0.81518626,"about_ca_system_score_codex":0.0000313251,"about_ca_system_score_gemma":0.00029442867,"threshold_uncertainty_score":0.75383204},"labels":[],"label_agreement":null},{"id":"W2607258061","doi":"10.1007/s12293-017-0231-8","title":"A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows","year":2017,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"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é Laval","funders":"","keywords":"Computer science; Vehicle routing problem; Heuristic; Routing (electronic design automation); Genetic algorithm; Evolutionary algorithm; Artificial intelligence; Machine learning; Computer network","score_opus":0.011936310361194432,"score_gpt":0.2627367152526489,"score_spread":0.2508004048914545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607258061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10936867,0.000078458324,0.8868826,0.000059892598,0.00019327778,0.0008066435,0.000013530772,0.00057317433,0.0020237232],"genre_scores_gemma":[0.4993078,0.0000016717039,0.5003344,0.000021543961,0.00019700585,0.000013859681,0.000050963787,0.00004798188,0.000024749364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827665,0.00008626353,0.000526936,0.00027672583,0.00029156182,0.00054184475],"domain_scores_gemma":[0.99866414,0.00014429515,0.00037127986,0.0005184084,0.0002049134,0.00009694428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012612619,0.00029484922,0.00034436348,0.00015062565,0.001122538,0.0003765653,0.0003945299,0.0001509812,0.00000792232],"category_scores_gemma":[0.00017876801,0.00029718445,0.000080036516,0.0001752281,0.00007301495,0.0007596182,0.00008081906,0.0002853224,0.0000122964575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024159564,0.000017327095,0.0019615404,0.00029652534,0.000057672423,0.0000010442133,0.001127329,0.95502454,0.0011594595,0.00012997,0.00005970149,0.040140737],"study_design_scores_gemma":[0.00090766273,0.00003523532,0.005567836,0.00021080174,0.000047484253,0.000041311898,0.00016059603,0.9920062,0.00015872087,0.000047530033,0.0004447691,0.00037184998],"about_ca_topic_score_codex":0.000012686085,"about_ca_topic_score_gemma":9.765882e-7,"teacher_disagreement_score":0.38993916,"about_ca_system_score_codex":0.00025408898,"about_ca_system_score_gemma":0.00007389876,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W2609748945","doi":"10.1051/ro/2017030","title":"Impact of vehicle tracking on a routing problem with dynamic travel times","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","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é de Montréal","funders":"","keywords":"Schedule; Computer science; Vehicle routing problem; Routing (electronic design automation); Adaptive routing; Dynamic positioning; Operations research; Real-time computing; Transport engineering; Static routing; Engineering; Computer network; Routing protocol; Marine engineering","score_opus":0.06383388641025729,"score_gpt":0.41219941415317757,"score_spread":0.3483655277429203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609748945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93338436,0.0000261543,0.053221244,0.00021341901,0.000029815763,0.0005453875,0.000024053763,0.00012386708,0.012431703],"genre_scores_gemma":[0.9646874,0.000014939954,0.03444955,0.0000022914412,0.00003563009,0.000043267788,0.000010856514,0.000059041573,0.00069700443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842864,0.00018011716,0.00026805923,0.00023516559,0.00045968793,0.00042831394],"domain_scores_gemma":[0.99867177,0.00017668451,0.000031164866,0.00067351415,0.00034847946,0.00009837029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012908517,0.0001494339,0.00021061163,0.00025247948,0.00086770824,0.00036646123,0.00040383937,0.00008664918,0.00010406243],"category_scores_gemma":[0.0004177833,0.00012319167,0.00006549838,0.00028467522,0.0001656092,0.0003792529,0.000057161426,0.0004732735,0.000028885263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021793296,0.00006155807,0.0030089924,0.00003330176,0.00006286658,0.0000032525695,0.00084503,0.9581773,0.027157927,0.0007077107,0.000046700883,0.009873563],"study_design_scores_gemma":[0.00050999125,0.00023773707,0.073227875,0.00013270843,0.0000062459444,0.00000449194,0.00011178278,0.91880417,0.006789393,0.000028324426,0.0000050377103,0.00014226785],"about_ca_topic_score_codex":0.0002494701,"about_ca_topic_score_gemma":0.00013815152,"teacher_disagreement_score":0.07021888,"about_ca_system_score_codex":0.00022308966,"about_ca_system_score_gemma":0.00016114989,"threshold_uncertainty_score":0.6673798},"labels":[],"label_agreement":null},{"id":"W2612913298","doi":"","title":"Heuristics for an Oil Delivery Vehicle routing Problem","year":2010,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Heuristics; Vehicle routing problem; Tabu search; Heuristic; Computer science; Metaheuristic; Mathematical optimization; Routing (electronic design automation); Column generation; Operations research; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01273459076068578,"score_gpt":0.24386130164779565,"score_spread":0.23112671088710987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612913298","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23594147,0.00011473429,0.7592954,0.0002550271,0.00030352647,0.00037668212,0.000054851516,0.0025308786,0.0011274329],"genre_scores_gemma":[0.4687457,0.000035592602,0.53006417,0.00025238565,0.00023319194,0.00027448862,0.000032251297,0.00013304032,0.00022916013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787235,0.00008895061,0.0005537988,0.0004072037,0.00024581514,0.0008319034],"domain_scores_gemma":[0.99827534,0.0002435197,0.00012583369,0.0007832552,0.00021250681,0.00035954165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001211301,0.0003618664,0.00034010393,0.00025778898,0.00030240987,0.00023174545,0.0005091725,0.0004075926,0.00002261516],"category_scores_gemma":[0.00036461165,0.0004161157,0.00013643301,0.00040927253,0.00006244617,0.00041782163,0.00009315223,0.00069969974,0.00001003376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062699335,0.00020575056,0.012718349,0.00023165465,0.00007954595,0.000014110267,0.00056678813,0.49993157,0.27253985,0.018197795,0.0020556168,0.19339627],"study_design_scores_gemma":[0.00047691326,0.00008038714,0.0019153241,0.000028622992,0.00003471135,0.0000355429,0.00004806796,0.9691524,0.024061494,0.0008702638,0.0028110354,0.00048527247],"about_ca_topic_score_codex":0.00068218476,"about_ca_topic_score_gemma":0.001142591,"teacher_disagreement_score":0.4692208,"about_ca_system_score_codex":0.00018993129,"about_ca_system_score_gemma":0.00010470118,"threshold_uncertainty_score":0.99982905},"labels":[],"label_agreement":null},{"id":"W2615340271","doi":"10.1007/s10878-020-00588-y","title":"A class of exponential neighbourhoods for the quadratic travelling salesman problem","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian path; Combinatorics; Travelling salesman problem; Mathematics; Quadratic equation; Digraph; Exponential function; Rank (graph theory); Heuristics; Discrete mathematics; Time complexity; Shortest path problem; Graph; Mathematical optimization; Mathematical analysis","score_opus":0.02603628727455053,"score_gpt":0.2718217439551514,"score_spread":0.24578545668060087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615340271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009225056,0.0004325925,0.9885948,0.0004526672,0.008464465,0.0008179355,0.000018399958,0.00007432578,0.00022231854],"genre_scores_gemma":[0.40480182,0.00044856625,0.5928011,0.000018821664,0.0017368447,0.000029098048,0.000031395128,0.00012442395,0.000007942904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721926,0.00022974591,0.0016015718,0.0001910186,0.0005297282,0.0002286452],"domain_scores_gemma":[0.996764,0.00061783736,0.0014169839,0.0002865163,0.0008004451,0.000114188944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012975092,0.00032654803,0.00078644627,0.00021217598,0.00009801871,0.00013857688,0.000594368,0.00039576253,0.000023575645],"category_scores_gemma":[0.00045794708,0.0002805991,0.00042334598,0.00030701602,0.000052224474,0.00017313313,0.00010126766,0.0008352393,4.7210412e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014291966,0.000053790176,0.000015631977,0.0005390737,0.00033577633,0.0000016205485,0.00075612403,0.9935415,0.0004989662,0.0029835694,0.00033296554,0.00079811167],"study_design_scores_gemma":[0.001702482,0.00019965989,0.0000150579845,0.00033595986,0.00045335392,0.000008331004,0.00007159974,0.98715866,0.0021983143,0.007407746,0.00020336683,0.00024545728],"about_ca_topic_score_codex":0.000002689417,"about_ca_topic_score_gemma":1.7966909e-7,"teacher_disagreement_score":0.4038793,"about_ca_system_score_codex":0.00015356684,"about_ca_system_score_gemma":0.00027707499,"threshold_uncertainty_score":0.9999646},"labels":[],"label_agreement":null},{"id":"W2615412676","doi":"","title":"The Vehicle Routing Problem with Time Windows: State-of-the-Art Exact Solution Methods","year":2010,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Column generation; Solver; Benchmark (surveying); Integer programming; Mathematical optimization; Variable (mathematics); Computer science; Branch and price; Set (abstract data type); Integer (computer science); Routing (electronic design automation); Variable elimination; Mathematics; Artificial intelligence","score_opus":0.007422774126838951,"score_gpt":0.23972268725173923,"score_spread":0.23229991312490028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615412676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06594426,0.00017466114,0.9290564,0.0011229439,0.00021306225,0.0009145466,0.000012432377,0.001052357,0.0015093498],"genre_scores_gemma":[0.3437986,0.00002587769,0.65475565,0.00012339234,0.000070861905,0.00019639776,0.0000047990634,0.00011913481,0.0009052526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975204,0.00042722374,0.0006056939,0.00031061473,0.00038402632,0.00075204624],"domain_scores_gemma":[0.99776924,0.00055898743,0.0002742321,0.0010544326,0.00017633384,0.00016680035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029863557,0.00033948093,0.00033184764,0.00014319044,0.0005047033,0.000177156,0.0007170327,0.00020884232,0.000020033985],"category_scores_gemma":[0.00040363809,0.00023550616,0.00014445558,0.00084108993,0.00019589764,0.0002973906,0.0001811391,0.00095526234,0.000014277785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006958344,0.00007326008,0.0112262815,0.000058918315,0.0001317796,0.0000039740435,0.00048114007,0.41795138,0.40430087,0.002159421,0.001359183,0.16218422],"study_design_scores_gemma":[0.0003246765,0.00005098205,0.00858188,0.000054046646,0.0000360025,0.000044805576,0.000019947847,0.8587568,0.12829733,0.0006816334,0.0028500194,0.00030188423],"about_ca_topic_score_codex":0.00041259712,"about_ca_topic_score_gemma":0.0007718327,"teacher_disagreement_score":0.44080544,"about_ca_system_score_codex":0.00021378875,"about_ca_system_score_gemma":0.00015497416,"threshold_uncertainty_score":0.96036625},"labels":[],"label_agreement":null},{"id":"W2617377437","doi":"10.1007/978-3-319-59250-3_17","title":"Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"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; University of Alberta","funders":"","keywords":"Orienteering; Regret; Computer science; Bounded function; Routing (electronic design automation); Mathematical optimization; Computer network; Mathematics; Machine learning","score_opus":0.022737542150065376,"score_gpt":0.2701361861080368,"score_spread":0.24739864395797143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617377437","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007666633,0.0002927281,0.9928861,0.0001144833,0.0010965292,0.0005331221,0.00000962129,0.0002904685,0.0040102284],"genre_scores_gemma":[0.3155245,0.000026988644,0.683214,0.000105062456,0.0005324684,0.000009957813,0.000008156547,0.000120116594,0.00045877497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800044,0.000015586209,0.00037969273,0.00070693466,0.00035040439,0.0005469294],"domain_scores_gemma":[0.99844706,0.00040903044,0.00017854843,0.0006925484,0.00014612007,0.00012669084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010012964,0.0004088424,0.00047158735,0.00029771854,0.00042842477,0.00054455,0.0007277086,0.0002613707,0.000005112451],"category_scores_gemma":[0.00028225756,0.00041566024,0.000070398295,0.000103511615,0.00036175494,0.00030518818,0.00023070283,0.0005346174,0.000002636725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008857063,0.000007598792,0.00042126796,0.00027243243,0.00002862725,0.00001250593,0.00085999863,0.6634934,0.0007269389,0.0033467768,0.000012167562,0.33080947],"study_design_scores_gemma":[0.00036024806,0.00005612696,0.00015491992,0.00055887917,0.000014383581,0.00002617865,3.1442e-7,0.9861998,0.0021974582,0.008739812,0.0012146104,0.00047727718],"about_ca_topic_score_codex":0.000011195954,"about_ca_topic_score_gemma":0.000028005368,"teacher_disagreement_score":0.3303322,"about_ca_system_score_codex":0.00023445745,"about_ca_system_score_gemma":0.000113764145,"threshold_uncertainty_score":0.99982953},"labels":[],"label_agreement":null},{"id":"W2618694566","doi":"10.1016/j.ejor.2017.05.035","title":"Resource constrained routing and scheduling: Review and research prospects","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Operations research; Heuristic; Routing (electronic design automation); Service (business); Resource (disambiguation); Management science; Operations management; Business; Computer network; Engineering; Marketing; Artificial intelligence","score_opus":0.14144834507892676,"score_gpt":0.42008395228908246,"score_spread":0.2786356072101557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618694566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57175696,0.07258073,0.026280385,0.041585844,0.0004218591,0.002090552,0.000024200257,0.00016416653,0.2850953],"genre_scores_gemma":[0.94506186,0.004102955,0.04988219,0.00006822026,0.00035688953,0.0000020192256,0.0000014513109,0.000045597066,0.00047879704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965415,0.0016297034,0.0004567126,0.00017082418,0.00087177,0.00032946488],"domain_scores_gemma":[0.99763316,0.0005460178,0.00009221724,0.0002729115,0.0012271814,0.00022853947],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.027736573,0.000098981574,0.0002145015,0.00022934873,0.0010774895,0.00070825784,0.00041306988,0.000026491853,0.000050838866],"category_scores_gemma":[0.009449678,0.00008755811,0.0000271295,0.00016876777,0.0004631431,0.0003568178,0.00025362536,0.001145685,0.000013771459],"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.0005901781,0.00050890906,0.04561033,0.010854322,0.0014184366,0.004704336,0.012421394,0.12452026,0.1259334,0.14390455,0.076349415,0.4531845],"study_design_scores_gemma":[0.012667382,0.0031952206,0.25118688,0.02552688,0.00023388724,0.0067963777,0.0029268789,0.49852547,0.009862091,0.0021805163,0.18442273,0.0024756826],"about_ca_topic_score_codex":0.0000012801951,"about_ca_topic_score_gemma":3.8300544e-7,"teacher_disagreement_score":0.45070878,"about_ca_system_score_codex":0.00005482899,"about_ca_system_score_gemma":0.00012540851,"threshold_uncertainty_score":0.99889416},"labels":[],"label_agreement":null},{"id":"W2618781129","doi":"","title":"A branch-price-and-cut algorithm for the inventory-routing problem","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Branch and cut; Mathematical optimization; Benchmark (surveying); Routing (electronic design automation); Vehicle routing problem; Computer science; Branch and price; Set (abstract data type); State (computer science); Operations research; Integer programming; Algorithm; Mathematics","score_opus":0.011244336311351608,"score_gpt":0.23482880688663216,"score_spread":0.22358447057528055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618781129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003237637,0.0007966826,0.9914518,0.0011423895,0.00017279644,0.0010052372,0.000016063974,0.0014973577,0.0006800192],"genre_scores_gemma":[0.22554103,0.00015310197,0.7718447,0.0008550879,0.0003040658,0.00082214,0.000010144498,0.0001439882,0.00032575638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818295,0.00013800026,0.00044799398,0.00032806548,0.00022270162,0.00068027707],"domain_scores_gemma":[0.9984709,0.00054457283,0.00012287572,0.00056873966,0.00009621326,0.00019672373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018597982,0.0003141756,0.00031312348,0.00018281437,0.0003632271,0.0002031937,0.00040008457,0.00022522183,0.000011510534],"category_scores_gemma":[0.00033306892,0.00027507218,0.00012957264,0.00039211533,0.00007437513,0.00020330997,0.000120286975,0.0003724035,0.0000054411353],"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.000013668535,0.000044791206,0.004017574,0.0001358518,0.00012748683,0.0000018012829,0.00067220576,0.20343398,0.0029201906,0.017748859,0.002221723,0.76866186],"study_design_scores_gemma":[0.00045796722,0.000045667115,0.0014718767,0.00004501416,0.00004241012,0.00003126579,0.0000373406,0.9843205,0.0031691303,0.002518046,0.007539422,0.00032134587],"about_ca_topic_score_codex":0.000454634,"about_ca_topic_score_gemma":0.0001622081,"teacher_disagreement_score":0.78088653,"about_ca_system_score_codex":0.00020117039,"about_ca_system_score_gemma":0.00004274335,"threshold_uncertainty_score":0.99997014},"labels":[],"label_agreement":null},{"id":"W2621038882","doi":"10.1007/978-3-319-60042-0_6","title":"A New System for the Dynamic Shortest Route Problem","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"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 Regina","funders":"","keywords":"Shortest path problem; K shortest path routing; Constrained Shortest Path First; Computer science; Private Network-to-Network Interface; Mathematical optimization; Routing (electronic design automation); Shortest Path Faster Algorithm; Vehicle routing problem; Link-state routing protocol; Theoretical computer science; Mathematics; Computer network; Routing protocol; Graph","score_opus":0.017406907414024283,"score_gpt":0.26238217472316294,"score_spread":0.24497526730913866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621038882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027179512,0.0005293451,0.99333,0.00019790833,0.0018594845,0.00073288707,0.0000116503725,0.00031571698,0.0030202747],"genre_scores_gemma":[0.039064128,0.000026523856,0.95917,0.00006333741,0.0005020169,0.0000223592,0.0000058798046,0.0000871106,0.0010586611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838996,0.000011329024,0.0003231377,0.0005315977,0.0003425267,0.0004014769],"domain_scores_gemma":[0.9981039,0.00058173935,0.00013841804,0.0009792013,0.00010671708,0.00009002334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008179034,0.0003426079,0.00034453528,0.00019640065,0.00032229564,0.00043341308,0.0015595991,0.00023104026,0.00000548116],"category_scores_gemma":[0.00007307797,0.0002634119,0.00009982739,0.00009559898,0.00017931784,0.00014918025,0.00021040234,0.00045512922,0.000008635921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010741704,6.4676476e-7,0.000007062702,0.00006386405,0.000010107993,0.0000026774494,0.00010291083,0.6644559,0.000023454673,0.0006819835,0.000012986695,0.33463734],"study_design_scores_gemma":[0.00014033227,0.000023990193,0.000034067973,0.00049529393,0.000022578051,0.000030272335,1.3228393e-7,0.993437,0.00012451869,0.0037123035,0.0016758395,0.00030367041],"about_ca_topic_score_codex":0.000016011838,"about_ca_topic_score_gemma":0.00009405971,"teacher_disagreement_score":0.33433366,"about_ca_system_score_codex":0.00038065016,"about_ca_system_score_gemma":0.00023881088,"threshold_uncertainty_score":0.9999818},"labels":[],"label_agreement":null},{"id":"W2621671707","doi":"10.1016/j.apenergy.2017.05.156","title":"Optimization of sawmill residues collection for bioenergy production","year":2017,"lang":"en","type":"article","venue":"Applied Energy","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Truck; Biomass (ecology); Bioenergy; Heuristics; Vehicle routing problem; Schedule; Environmental science; Renewable energy; Benchmark (surveying); Routing (electronic design automation); Computer science; Operations research; Pulp and paper industry; Engineering; Biofuel; Waste management; Mathematical optimization; Mathematics; Automotive engineering","score_opus":0.01780296463506549,"score_gpt":0.2528430790564614,"score_spread":0.23504011442139594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621671707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024351054,0.000031370528,0.9513285,0.00005452692,0.00038843698,0.00012493071,0.0000022031718,0.00027877826,0.045356147],"genre_scores_gemma":[0.6765992,0.000116543255,0.32080472,0.000008221174,0.00017526286,0.00010122105,0.00001947116,0.00007926758,0.0020960867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994364,0.0000113345495,0.00018418052,0.00016115243,0.000079035024,0.000127941],"domain_scores_gemma":[0.9994119,0.000024835072,0.00011859895,0.00035318366,0.00006330423,0.000028204564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014000823,0.00009985953,0.00013861159,0.00010414791,0.00017508745,0.00002819917,0.0001234448,0.00008545355,0.000024061157],"category_scores_gemma":[0.00009175223,0.00011139083,0.000030508383,0.000100982266,0.000040071034,0.000074382944,0.000018897947,0.000025681256,8.929233e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016829388,0.00001119135,0.000027539798,0.000024583387,0.000022254653,4.155214e-8,0.000028964541,0.9662229,0.013781685,0.010411168,0.0015401959,0.007912647],"study_design_scores_gemma":[0.00039630584,0.00002774312,0.00022378174,0.000015346124,0.000021816433,0.0000010729244,0.00001944561,0.60854554,0.38353157,0.00065443676,0.0063834777,0.0001794936],"about_ca_topic_score_codex":0.00004860766,"about_ca_topic_score_gemma":0.000042928477,"teacher_disagreement_score":0.6741641,"about_ca_system_score_codex":0.000034898643,"about_ca_system_score_gemma":0.00001069174,"threshold_uncertainty_score":0.45423862},"labels":[],"label_agreement":null},{"id":"W2622363162","doi":"","title":"Solving the maximally diverse grouping problem by skewed general variable neighborhood search","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Disjoint sets; Variable neighborhood search; Partition (number theory); Mathematics; Heuristic; Variable (mathematics); Set (abstract data type); Local search (optimization); Mathematical optimization; Computer science; Metaheuristic; Combinatorics","score_opus":0.01683419893696322,"score_gpt":0.22551014217170268,"score_spread":0.20867594323473945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622363162","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07946615,0.00047165577,0.90051484,0.00044190814,0.00047949122,0.00035218569,0.00001613982,0.0007093012,0.01754833],"genre_scores_gemma":[0.3461444,0.000112342685,0.6514556,0.0003863128,0.0004436796,0.000041624986,0.000044635355,0.00013463786,0.0012367396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835765,0.0002259787,0.0002767285,0.00026235124,0.00034571294,0.00053156895],"domain_scores_gemma":[0.9991733,0.00014215901,0.000045434277,0.00033145957,0.00011889955,0.00018873553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011530411,0.000227443,0.00020880367,0.00008701654,0.00033932485,0.00018599501,0.00037999664,0.00017906165,0.000051560644],"category_scores_gemma":[0.00013299038,0.00019879235,0.000059524507,0.00045423058,0.00010551598,0.00025308674,0.00009441801,0.0005321419,0.000030467967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029952453,0.00005577296,0.0039815875,0.000117789416,0.00021800151,0.000025559955,0.010129433,0.87150854,0.013055834,0.067725055,0.01815518,0.014997315],"study_design_scores_gemma":[0.001118209,0.000049503302,0.00031619117,0.000037516133,0.000048093883,0.000035072117,0.00096612156,0.9834276,0.0013664527,0.0033689898,0.008747912,0.00051833165],"about_ca_topic_score_codex":0.000126665,"about_ca_topic_score_gemma":0.0000034743102,"teacher_disagreement_score":0.26667827,"about_ca_system_score_codex":0.0003016159,"about_ca_system_score_gemma":0.000060679005,"threshold_uncertainty_score":0.81065166},"labels":[],"label_agreement":null},{"id":"W2622451785","doi":"","title":"Enfoque de generación de columnas para el problema de localización y ruteo con pickup and delivery","year":2013,"lang":"es","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Column generation; Pickup; Integer programming; Shortest path problem; Routing (electronic design automation); Set (abstract data type); Mathematics; Computer science; Vehicle routing problem; Mathematical optimization; Scheme (mathematics); Integer (computer science); Algorithm; Combinatorics; Artificial intelligence; Computer network; Graph","score_opus":0.01127488069365715,"score_gpt":0.24425266358646824,"score_spread":0.2329777828928111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622451785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35924628,0.0033098739,0.6326967,0.0015745474,0.0001072359,0.0013730064,0.000058784088,0.0011914837,0.00044206268],"genre_scores_gemma":[0.5461397,0.0021415935,0.44811925,0.001708622,0.0002680937,0.0009275071,0.00003085087,0.00025980955,0.0004045195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994231,0.0008964724,0.0011800639,0.00089940464,0.00047690197,0.0023161997],"domain_scores_gemma":[0.9963422,0.00052161777,0.00040641666,0.0011865643,0.0003423904,0.0012008315],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022392876,0.000958372,0.00095143326,0.0006520654,0.0004929073,0.0010564048,0.0007660864,0.0012849846,0.00020838645],"category_scores_gemma":[0.0006631871,0.0011747987,0.00026683995,0.0008646744,0.00027138725,0.0007827116,0.00040866173,0.0012202418,0.00006365377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009712006,0.0003255457,0.23031625,0.000988925,0.0003853489,0.00017761179,0.001521098,0.60059255,0.10935996,0.018055685,0.005087538,0.03309238],"study_design_scores_gemma":[0.0009807582,0.0001732287,0.06333837,0.00038489737,0.00017690273,0.0005011837,0.00013862485,0.89448595,0.034146834,0.0022922892,0.00224712,0.0011338254],"about_ca_topic_score_codex":0.035175655,"about_ca_topic_score_gemma":0.00085160584,"teacher_disagreement_score":0.29389343,"about_ca_system_score_codex":0.0021590719,"about_ca_system_score_gemma":0.00087732525,"threshold_uncertainty_score":0.99998057},"labels":[],"label_agreement":null},{"id":"W2622823936","doi":"10.1007/s10732-019-09423-y","title":"The vehicle routing problem with cross-docking and resource constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Saint-Gobain (Canada)","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Heuristics; Computer science; Mathematical optimization; DOCK; Routing (electronic design automation); Integer programming; Algorithm; Mathematics; Computer network; Engineering","score_opus":0.007581508004379499,"score_gpt":0.24479528799495448,"score_spread":0.23721377999057497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622823936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92176896,0.00042026045,0.07237803,0.00012496156,0.00021258015,0.00012030453,0.0000022600782,0.000055272892,0.004917342],"genre_scores_gemma":[0.9504286,0.00004226458,0.049299568,0.000024536434,0.00009302816,3.1434774e-7,2.0265573e-7,0.000027670098,0.00008379396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991238,0.00005764426,0.00035924368,0.000064961954,0.00020704597,0.00018727945],"domain_scores_gemma":[0.9990381,0.0004428669,0.0001894944,0.00011486275,0.00014898172,0.00006566617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009688427,0.00009361955,0.00015306365,0.000037269587,0.00012514726,0.00016571512,0.00012614082,0.000042541877,0.000007981793],"category_scores_gemma":[0.00018856744,0.00006268199,0.000025640456,0.000104150386,0.00009719526,0.00008721106,0.000025905249,0.0003308161,0.000002696546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045451703,0.00001051595,0.10896416,0.00008525864,0.00008906115,0.00003529351,0.00060677424,0.8684753,0.0010345057,0.00094897556,0.00025098483,0.019453682],"study_design_scores_gemma":[0.0025483852,0.00035853492,0.031816866,0.00061346777,0.00009329027,0.0013214843,0.0009922668,0.9434092,0.0020011389,0.00054811005,0.015827162,0.00047006106],"about_ca_topic_score_codex":4.4980933e-7,"about_ca_topic_score_gemma":3.6868866e-7,"teacher_disagreement_score":0.0771473,"about_ca_system_score_codex":0.000036073587,"about_ca_system_score_gemma":0.000029765055,"threshold_uncertainty_score":0.25560972},"labels":[],"label_agreement":null},{"id":"W2658246728","doi":"10.1287/trsc.2019.0892","title":"Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Pairing; Crew scheduling; Column generation; Computer science; Decomposition; Scheduling (production processes); Benders' decomposition; Engineering; Aeronautics; Mathematical optimization; Mathematics; Operations management; Physics; Chemistry","score_opus":0.03136646166042128,"score_gpt":0.28734515278973816,"score_spread":0.25597869112931687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2658246728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55004954,0.0000576277,0.4492807,0.000035082885,0.00008534401,0.00032461042,0.000006737865,0.00008619168,0.000074157426],"genre_scores_gemma":[0.906843,0.000028605662,0.09294572,0.000035277983,0.000010098232,0.00003637517,0.00005469119,0.000014072687,0.00003216331],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911875,0.000022338038,0.00022376141,0.00026075015,0.00020400791,0.00017040473],"domain_scores_gemma":[0.9996317,0.00006325403,0.000050816023,0.00007623551,0.00010513604,0.00007286782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007288536,0.000102171325,0.00012371155,0.00010586855,0.00017276591,0.00012021969,0.000059873837,0.00004109287,0.000020914113],"category_scores_gemma":[0.000017457616,0.000110092114,0.000017193937,0.00028511832,0.0000912831,0.00044385323,0.000002361255,0.000062751424,0.0000011006277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014625915,0.000016094213,0.014245855,0.00018813025,0.000015523896,3.8574322e-7,0.006246792,0.42093357,0.54784393,0.002785891,0.000018478328,0.0076907366],"study_design_scores_gemma":[0.00080143474,0.000058227022,0.02043011,0.00005968303,0.000017412929,0.0000017298938,0.000396088,0.9675314,0.010375807,0.000091140304,0.00008019927,0.00015676672],"about_ca_topic_score_codex":0.00001222502,"about_ca_topic_score_gemma":0.000020019117,"teacher_disagreement_score":0.54659784,"about_ca_system_score_codex":0.00005909113,"about_ca_system_score_gemma":0.00003469919,"threshold_uncertainty_score":0.44894263},"labels":[],"label_agreement":null},{"id":"W2679747200","doi":"10.1002/net.21747","title":"Adaptive large neighborhood search algorithm for the rural postman problem with time windows","year":2017,"lang":"en","type":"article","venue":"Networks","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; Transport Canada","funders":"New Jersey Department of Transportation","keywords":"Computer science; Set (abstract data type); Mathematical optimization; Algorithm; Running time; Vehicle routing problem; Mathematics; Routing (electronic design automation)","score_opus":0.013644993020114597,"score_gpt":0.2563775742917052,"score_spread":0.24273258127159061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2679747200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028692555,0.00021207398,0.99431646,0.00018657379,0.0001639968,0.00074125873,0.00002080616,0.00022710199,0.0038448272],"genre_scores_gemma":[0.59310997,0.00005068916,0.40409628,0.000114486786,0.0011077039,0.00017651705,0.000035476845,0.00015766562,0.0011512394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989998,0.000049137503,0.00014680608,0.00015930668,0.00015955052,0.00048544482],"domain_scores_gemma":[0.9990174,0.0002247478,0.00005782733,0.00051972806,0.00010592038,0.0000743652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005942362,0.00017143799,0.00017441784,0.000024966988,0.00061880174,0.00019433262,0.00041825484,0.00011472777,0.00004450369],"category_scores_gemma":[0.000016709524,0.00012019621,0.00005575322,0.00008105126,0.000057395922,0.00017540513,0.0000770724,0.00031706074,0.000016798851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021317415,0.000011575243,0.00041316057,0.000006024202,0.00009704471,0.0000018314279,0.00016319503,0.8478169,0.000006886715,0.00028435988,0.0009135685,0.15026413],"study_design_scores_gemma":[0.0008059237,0.00008964767,0.001685658,0.000040215175,0.000034716115,0.000006662248,0.00005714274,0.9962649,0.000034100456,0.000054269814,0.00075321854,0.00017355298],"about_ca_topic_score_codex":0.000009860549,"about_ca_topic_score_gemma":0.000008368744,"teacher_disagreement_score":0.592823,"about_ca_system_score_codex":0.000039630166,"about_ca_system_score_gemma":0.000021315625,"threshold_uncertainty_score":0.49014592},"labels":[],"label_agreement":null},{"id":"W2727820456","doi":"10.1287/trsc.2018.0836","title":"Vehicle Routing and Location Routing with Intermediate Stops: A Review","year":2019,"lang":"en","type":"review","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Static routing; Computer network; Routing protocol","score_opus":0.04510220757424801,"score_gpt":0.33656426991639016,"score_spread":0.29146206234214217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727820456","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080632155,0.94028056,0.05816003,0.000011163112,0.00016888289,0.0007907747,0.000012794121,0.00026918013,0.00022600434],"genre_scores_gemma":[0.0021288507,0.9886017,0.008970744,0.000056017787,0.00003106109,0.000051224517,0.00006165914,0.00006319757,0.00003555556],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9979126,0.000071307,0.00071025535,0.0005081946,0.00045384906,0.00034383702],"domain_scores_gemma":[0.99883735,0.00014757055,0.0002994271,0.0003472232,0.0002536886,0.000114749855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001492717,0.0003272751,0.0008441648,0.00021657234,0.00013055121,0.000098214645,0.00033587543,0.00009882636,0.000014153302],"category_scores_gemma":[0.00013281709,0.00027534727,0.00007655384,0.0023923914,0.00017696974,0.0005273517,0.000009089801,0.00032158144,0.000027041377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.559442e-7,0.000005382449,0.000080559636,0.04529547,0.000026427198,0.0000030837477,0.00048408998,0.0073926984,0.0000042403053,0.00018010051,0.00001122321,0.94651574],"study_design_scores_gemma":[0.0012501952,0.00020567735,0.003274256,0.5384749,0.0044178143,0.00009885432,0.00034186724,0.21792848,0.00004645163,0.00001811028,0.23005234,0.003891055],"about_ca_topic_score_codex":0.000006548698,"about_ca_topic_score_gemma":0.000006965089,"teacher_disagreement_score":0.9426247,"about_ca_system_score_codex":0.00013130836,"about_ca_system_score_gemma":0.00033476105,"threshold_uncertainty_score":0.9999699},"labels":[],"label_agreement":null},{"id":"W2728556672","doi":"","title":"An Integrated Aircraft Routing, Crew Scheduling and Flight Retiming Model","year":2005,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Crew scheduling; Retiming; Scheduling (production processes); Schedule; Computer science; Flexibility (engineering); Benders' decomposition; Operations research; Engineering; Mathematical optimization; Aeronautics; Operating system; Operations management; Algorithm; Mathematics","score_opus":0.011666578898666879,"score_gpt":0.246834580486618,"score_spread":0.23516800158795112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728556672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18956669,0.000729491,0.8053734,0.000633657,0.000056936038,0.00030972308,0.000015132783,0.0027601828,0.0005548399],"genre_scores_gemma":[0.484413,0.000120304474,0.5146719,0.0003848259,0.000098475764,0.000060395294,0.000016822478,0.00010320718,0.00013105311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770534,0.00014420523,0.0006020725,0.00049205846,0.00027568606,0.0007806376],"domain_scores_gemma":[0.99853516,0.000089782705,0.000114298906,0.00071770186,0.00012345421,0.0004195839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010695985,0.0004452063,0.00040827988,0.00041741022,0.0002724605,0.00027982797,0.00039972854,0.00039721673,0.00003186015],"category_scores_gemma":[0.0002272576,0.0004897934,0.00009071564,0.0005361359,0.00007011534,0.00075015565,0.00009938815,0.0006879369,0.000009343576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013623682,0.00004179048,0.0029283087,0.000026301384,0.0000264139,0.0000064764386,0.0004888686,0.94595885,0.014043616,0.0017784485,0.00016256065,0.03452474],"study_design_scores_gemma":[0.00034354106,0.000037532973,0.0009661007,0.00008814657,0.000033584834,0.000055893837,0.00010371616,0.9780497,0.019134842,0.0001750086,0.00049065397,0.00052129844],"about_ca_topic_score_codex":0.00047916494,"about_ca_topic_score_gemma":0.00042819406,"teacher_disagreement_score":0.2948463,"about_ca_system_score_codex":0.0004556136,"about_ca_system_score_gemma":0.00010015804,"threshold_uncertainty_score":0.9997554},"labels":[],"label_agreement":null},{"id":"W2728582604","doi":"10.14279/depositonce-14266","title":"On Compact Formulations for Integer Programs Solved by Column Generation","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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; HEC Montréal; Kronos (Canada)","funders":"","keywords":"Column generation; Mathematics; Diagonal; Mathematical optimization; Integer (computer science); Branching (polymer chemistry); Integer programming; Compatibility (geochemistry); Computer science; Engineering; Geometry","score_opus":0.021142465544789678,"score_gpt":0.25928932300944757,"score_spread":0.23814685746465789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728582604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04053077,0.00020698292,0.95499814,0.0003064916,0.00018770713,0.0013838961,0.000050952483,0.0013635743,0.0009714967],"genre_scores_gemma":[0.66441226,0.000021283096,0.33381438,0.00036761642,0.00006326069,0.00056849944,0.0001932478,0.000107571344,0.00045187064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983751,0.00011322572,0.00043863335,0.00029366033,0.00021102847,0.0005683301],"domain_scores_gemma":[0.9989351,0.00017284972,0.00009717843,0.00046634043,0.00012763694,0.0002008886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067090016,0.0002955523,0.0002803803,0.00021648538,0.00025458948,0.0001986387,0.00018661747,0.00025374067,0.000034480054],"category_scores_gemma":[0.0003408745,0.0003272623,0.00014144502,0.00041516314,0.000032544413,0.00023942825,0.000012596626,0.0002642967,0.0000086736145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027597012,0.0002323168,0.0035772456,0.00004642312,0.000082041755,0.0000015388979,0.00018129662,0.8690189,0.03026184,0.04932662,0.03204278,0.015201403],"study_design_scores_gemma":[0.000573074,0.00013385134,0.00034859797,0.000023515422,0.000024196077,0.000008846139,0.000019236577,0.9548584,0.034933634,0.0013754078,0.0073467325,0.0003544941],"about_ca_topic_score_codex":0.00020600705,"about_ca_topic_score_gemma":0.00030265137,"teacher_disagreement_score":0.6238815,"about_ca_system_score_codex":0.00046225823,"about_ca_system_score_gemma":0.00006125034,"threshold_uncertainty_score":0.9999179},"labels":[],"label_agreement":null},{"id":"W2730563372","doi":"10.1007/s10479-017-2567-3","title":"A meta-heuristic for capacitated green vehicle routing problem","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":61,"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 Manitoba","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Alternative fuel vehicle; Heuristic; Routing (electronic design automation); Ant colony optimization algorithms; Computer science; Ant colony; Engineering; Automotive engineering; Alternative fuels; Mathematics; Computer network","score_opus":0.484601735208781,"score_gpt":0.48273314728261624,"score_spread":0.0018685879261647886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730563372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52021754,0.0013113343,0.42557925,0.014090922,0.0003357139,0.0045436188,0.00048757848,0.0006716257,0.03276243],"genre_scores_gemma":[0.9159498,0.00005542617,0.08214051,0.000020674834,0.00006879518,0.00024397952,0.000017163411,0.000042189917,0.0014614264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985015,0.00019863443,0.00035914703,0.00019512148,0.00033136332,0.0004142663],"domain_scores_gemma":[0.9976161,0.00033455165,0.00003357404,0.0006109081,0.0013113278,0.00009354784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033463473,0.00011283878,0.00026478182,0.00019474242,0.0009408182,0.00026644216,0.00046544807,0.00007604043,0.00006869796],"category_scores_gemma":[0.0015745757,0.00010646997,0.00011158331,0.00021116616,0.00014820456,0.00035838364,0.000082069106,0.00023481013,0.000018682087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024077026,0.00008326255,0.00031748103,0.0002889801,0.0011391625,0.0000032383055,0.0018757038,0.9496488,0.02237333,0.013335484,0.0030736164,0.007836887],"study_design_scores_gemma":[0.00026710238,0.00007728803,0.0006355938,0.000029154993,0.000060278864,0.0000013345547,0.000098381264,0.969481,0.027631084,0.0009097417,0.0006717138,0.00013734754],"about_ca_topic_score_codex":0.00044574885,"about_ca_topic_score_gemma":0.00010597678,"teacher_disagreement_score":0.3957323,"about_ca_system_score_codex":0.000018070208,"about_ca_system_score_gemma":0.00006744803,"threshold_uncertainty_score":0.7236108},"labels":[],"label_agreement":null},{"id":"W2731138409","doi":"","title":"A new family of facet defining inequalities for the maximum edge-weighted clique problem","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"Polytechnique Montréal","funders":"","keywords":"Clique; Mathematics; Enhanced Data Rates for GSM Evolution; Clique problem; Facet (psychology); Combinatorics; Cutting-plane method; Polynomial; Discrete mathematics; Mathematical optimization; Computer science; Graph; Artificial intelligence; Chordal graph; Integer programming; 1-planar graph","score_opus":0.03173730701773475,"score_gpt":0.25760608253380635,"score_spread":0.2258687755160716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731138409","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046971418,0.0011372498,0.94782805,0.00037181,0.00033355708,0.00037281043,0.000026180076,0.0003133123,0.0026456083],"genre_scores_gemma":[0.12086578,0.00007944585,0.8779666,0.00017891978,0.00016335462,0.000066074805,0.000022890243,0.00007823874,0.00057868747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989618,0.00009770706,0.0003607712,0.00014641519,0.00016880089,0.0002645035],"domain_scores_gemma":[0.9990457,0.0003911749,0.00008624683,0.00024821894,0.00012599124,0.0001026187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000781606,0.00017029273,0.00024936805,0.00008488263,0.00009289471,0.000043033346,0.00022207227,0.0001612213,0.000007499488],"category_scores_gemma":[0.00023392943,0.0001397934,0.00008030806,0.00024099083,0.00007103448,0.00009926504,0.000027196109,0.00021598295,0.0000049424225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012034761,0.0000401563,0.0020712218,0.00060619845,0.00044097286,0.000004703635,0.045745168,0.53699607,0.00307729,0.24672683,0.038661156,0.1255099],"study_design_scores_gemma":[0.0058378377,0.0003975657,0.0014221583,0.0002488275,0.000256648,0.000034473556,0.013467477,0.756542,0.013887345,0.10176908,0.104658,0.0014785712],"about_ca_topic_score_codex":0.00008997619,"about_ca_topic_score_gemma":0.000007828265,"teacher_disagreement_score":0.21954595,"about_ca_system_score_codex":0.00009723144,"about_ca_system_score_gemma":0.00009307469,"threshold_uncertainty_score":0.57006097},"labels":[],"label_agreement":null},{"id":"W2732846998","doi":"","title":"Managing Large Fixed Costs in Vehicle Routing and Crew Scheduling Problems Solved by Column Generation","year":2005,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematical optimization; Fixed cost; Vehicle routing problem; Computer science; Minification; Scheduling (production processes); Shortest path problem; Routing (electronic design automation); Mathematics","score_opus":0.010877686175986638,"score_gpt":0.23190354570331112,"score_spread":0.22102585952732448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732846998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3282627,0.0017793262,0.66728526,0.0009197692,0.000062351166,0.00052582985,0.000014968635,0.0008976506,0.00025212506],"genre_scores_gemma":[0.72047627,0.0003135814,0.27823907,0.0004162064,0.00015001318,0.00017441432,0.000038867573,0.00009241213,0.000099191966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977523,0.00016530274,0.0006111493,0.00042030864,0.00024206743,0.00080883986],"domain_scores_gemma":[0.99913937,0.000098159224,0.000119866876,0.00037636457,0.00006200244,0.00020423914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014419542,0.00032006064,0.00033953512,0.0003284819,0.00023875933,0.0002724004,0.00022071051,0.00027231485,0.000016784294],"category_scores_gemma":[0.0001684172,0.00040315796,0.000057068915,0.0005771133,0.00003145618,0.0005504862,0.00012025534,0.0004966026,0.0000063362136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093966855,0.00007395393,0.031032795,0.00005699476,0.00002619754,0.000006775364,0.0004913224,0.8187188,0.10349697,0.00086195517,0.0005480909,0.044676766],"study_design_scores_gemma":[0.0008213317,0.000022316704,0.003559331,0.00009728301,0.000013946761,0.000014153965,0.00008774605,0.97493976,0.019410558,0.00006519584,0.00056760333,0.0004007684],"about_ca_topic_score_codex":0.0010472693,"about_ca_topic_score_gemma":0.0032021403,"teacher_disagreement_score":0.39221355,"about_ca_system_score_codex":0.0007416499,"about_ca_system_score_gemma":0.000041662992,"threshold_uncertainty_score":0.99984205},"labels":[],"label_agreement":null},{"id":"W2734645630","doi":"10.1162/evco_a_00215","title":"Leveraging TSP Solver Complementarity through Machine Learning","year":2017,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":92,"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":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst","keywords":"Solver; Leverage (statistics); Computer science; Benchmark (surveying); Complementarity (molecular biology); Euclidean geometry; Mathematical optimization; Problem solver; Set (abstract data type); Travelling salesman problem; Parallel computing; Algorithm; Artificial intelligence; Mathematics; Computational science","score_opus":0.04305681618019019,"score_gpt":0.305783714799549,"score_spread":0.26272689861935883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734645630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054553684,0.00020840683,0.93646765,0.0002860448,0.00063366967,0.00014172224,0.0000078889125,0.00060100877,0.007099938],"genre_scores_gemma":[0.76436716,0.000018146706,0.23517843,0.00003861032,0.00012264086,0.0000056242316,0.00014367887,0.000027011782,0.000098677396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901706,0.000091547285,0.00024701082,0.00020009078,0.0002172496,0.00022701327],"domain_scores_gemma":[0.9994721,0.00008306417,0.00010898203,0.00021324347,0.00007939268,0.000043233333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736202,0.00014854621,0.00014473943,0.000055831697,0.0010093952,0.00011766253,0.00019127844,0.00005257606,0.00013433781],"category_scores_gemma":[0.00008118964,0.00017987899,0.00005175093,0.000069529284,0.000053271368,0.0005808237,0.00009442567,0.00025424175,0.000059652106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040816267,0.000013986741,0.024576856,0.000021698575,0.00002732128,0.000002638124,0.000427149,0.9683162,0.0001848883,0.0004439739,0.00124448,0.004736722],"study_design_scores_gemma":[0.00040912585,0.000013887822,0.09565871,0.00001912557,0.000011060457,0.0000091191505,0.000040884053,0.8980545,0.00008860525,0.0018712765,0.0036467353,0.00017701571],"about_ca_topic_score_codex":0.00015522535,"about_ca_topic_score_gemma":0.000008511499,"teacher_disagreement_score":0.7098135,"about_ca_system_score_codex":0.00018975821,"about_ca_system_score_gemma":0.000019165087,"threshold_uncertainty_score":0.7763554},"labels":[],"label_agreement":null},{"id":"W2734889840","doi":"10.1287/ijoc.2017.0747","title":"Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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; Branch and cut; Pruning; Branch and bound; Heuristic; Mathematics; Linear programming relaxation; Integer programming; Steiner tree problem; Linear programming; Routing (electronic design automation); Upper and lower bounds; Function (biology); Integer (computer science); Key (lock); Vehicle routing problem; Dual (grammatical number); Computer science","score_opus":0.02471797659407317,"score_gpt":0.2872649552065073,"score_spread":0.26254697861243415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734889840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1105344,0.000051640785,0.87599975,0.0007254536,0.0019599372,0.00033732827,0.0000034380828,0.000275298,0.010112743],"genre_scores_gemma":[0.8895681,0.000015377149,0.109321475,0.00028458846,0.0006243599,0.0000044221388,0.0000012891159,0.000057589867,0.0001228124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982957,0.00003140693,0.0006623538,0.00013821438,0.00031226306,0.0005600509],"domain_scores_gemma":[0.99811494,0.00061935047,0.0004580663,0.0004257888,0.00024281647,0.00013905922],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020116952,0.00023047878,0.00025430392,0.00008311463,0.002456815,0.0012693391,0.0007362517,0.00009950254,0.000020143525],"category_scores_gemma":[0.0007701501,0.00016032875,0.00017091804,0.00011856181,0.00007851945,0.0004823856,0.00009000045,0.0007143318,0.000025150886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028763496,0.000012307173,0.00089450664,0.00002209891,0.00009408012,0.000006404795,0.00061462034,0.8511844,0.00029053772,0.0005604748,0.0005980768,0.1456937],"study_design_scores_gemma":[0.00080028916,0.00010848795,0.0030835634,0.00016563862,0.000020416413,0.0000827245,0.00010386526,0.98671985,0.00038023913,0.0003194856,0.007963393,0.00025203524],"about_ca_topic_score_codex":0.0000067908286,"about_ca_topic_score_gemma":0.0000012764334,"teacher_disagreement_score":0.77903366,"about_ca_system_score_codex":0.00015674919,"about_ca_system_score_gemma":0.000054821623,"threshold_uncertainty_score":0.9997674},"labels":[],"label_agreement":null},{"id":"W2737096452","doi":"10.1007/978-1-4615-0819-9_1","title":"Recent Algorithmic Advances for Arc Routing Problems","year":2002,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Vehicle Routing Optimization Methods","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":"Group for Research in Decision Analysis","funders":"","keywords":"Arc routing; Heuristics; Arc (geometry); Routing (electronic design automation); Computer science; Carp; Mathematical optimization; Mathematics; Fish <Actinopterygii>; Engineering; Fishery; Biology; Computer network; Mechanical engineering","score_opus":0.07737141157025106,"score_gpt":0.40232601213038066,"score_spread":0.3249546005601296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737096452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005001426,0.0006457587,0.02510753,0.009814441,0.005023434,0.007871371,0.0002927368,0.00041280116,0.9503318],"genre_scores_gemma":[0.036759786,0.088645734,0.23314889,0.00018388772,0.0009737007,0.0066899657,0.00071727694,0.0003435143,0.63253725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98468626,0.0002630248,0.0019415603,0.002460408,0.008426474,0.0022222653],"domain_scores_gemma":[0.9938284,0.00031525086,0.000102065154,0.001417041,0.003965248,0.00037198185],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.018314091,0.000749594,0.00056234625,0.011287901,0.0029992175,0.0042406893,0.007090334,0.00024167434,0.0019903344],"category_scores_gemma":[0.0015799309,0.0008284303,0.00015149353,0.0050168904,0.005501571,0.007902906,0.0031758924,0.0017900661,0.00025337373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042142816,0.00011700114,0.0000410343,0.000110811496,0.00007897787,0.00004706547,0.0004881379,0.55211335,0.00019611084,0.42375508,0.00073888514,0.022271413],"study_design_scores_gemma":[0.0008969541,0.00012973775,0.00026728903,0.00079405174,0.000012431002,0.000020817311,0.0014845527,0.6188908,0.00026828924,0.011203938,0.36522937,0.00080177275],"about_ca_topic_score_codex":0.000101419995,"about_ca_topic_score_gemma":0.0015856142,"teacher_disagreement_score":0.41255113,"about_ca_system_score_codex":0.0067529404,"about_ca_system_score_gemma":0.00041211306,"threshold_uncertainty_score":0.9999183},"labels":[],"label_agreement":null},{"id":"W2737203876","doi":"10.1007/bf03399222","title":"Location-Arc Routing Problems","year":2001,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"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; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Arc routing; Computer science; Arc (geometry); Graph; Routing (electronic design automation); Vehicle routing problem; Routing algorithm; Garbage collection; Transport engineering; Operations research; Theoretical computer science; Computer network; Garbage; Mathematics; Routing protocol; Programming language; Engineering","score_opus":0.03531048059759525,"score_gpt":0.30215708515477113,"score_spread":0.2668466045571759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737203876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08094822,0.00029445396,0.8563023,0.0003266006,0.00023982718,0.00028366596,0.0000010554742,0.00090962596,0.060694207],"genre_scores_gemma":[0.95146304,0.00006120416,0.046945084,0.000025815192,0.000113140304,0.00002088257,0.0000053764375,0.000042005788,0.0013234485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991438,0.000054721357,0.00016688083,0.00013475075,0.00019777942,0.0003020644],"domain_scores_gemma":[0.9995124,0.000086019,0.000013271219,0.00021201868,0.00010151172,0.00007478978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059877156,0.00008540598,0.000087540255,0.00008277434,0.00008787502,0.00005804358,0.00014947842,0.0000539503,0.00019649578],"category_scores_gemma":[0.00011855335,0.00009250898,0.000020877196,0.0006090829,0.000022187109,0.00010764092,0.000032407574,0.00018114646,0.00021962447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017904835,0.000013724819,0.011994751,0.000059686117,0.000014232794,0.000004157405,0.00047246338,0.94608426,0.0023018273,0.00078829686,0.00037964038,0.03788517],"study_design_scores_gemma":[0.00019375276,0.000012034564,0.0045519015,0.0000470662,0.0000033914116,0.000016559314,0.000065391505,0.98884934,0.0011061495,0.00018389145,0.00481608,0.00015442491],"about_ca_topic_score_codex":0.000018737343,"about_ca_topic_score_gemma":0.0000041382887,"teacher_disagreement_score":0.8705148,"about_ca_system_score_codex":0.00006807896,"about_ca_system_score_gemma":0.000024552362,"threshold_uncertainty_score":0.37724066},"labels":[],"label_agreement":null},{"id":"W2738714010","doi":"10.1287/ijoc.2019.0893","title":"Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms","year":2020,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Benchmark (surveying); Heuristic; Bilinear interpolation; Generalization; Mathematical optimization; Computer science; Quadratic assignment problem; Algorithm; Quadratic equation; Variable neighborhood search; Point (geometry); Variable (mathematics); Mathematics; Combinatorial optimization; Metaheuristic","score_opus":0.02596002116034216,"score_gpt":0.30502324235123385,"score_spread":0.27906322119089166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738714010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14134467,0.00048224913,0.85525614,0.00007349039,0.00092287763,0.00025875965,0.00003680792,0.00021151346,0.0014134758],"genre_scores_gemma":[0.79357666,0.0000627117,0.20592888,0.00009161993,0.00025302405,0.0000023948676,0.00002823882,0.000048299065,0.0000081909075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976773,0.00007285577,0.0011445022,0.00025696677,0.00049930695,0.0003490375],"domain_scores_gemma":[0.99870294,0.00014839406,0.00056197896,0.00024288674,0.000113578215,0.00023019126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010641395,0.0003609133,0.00081127125,0.0005987556,0.00012719895,0.00021215205,0.00030188583,0.00022525236,0.000045732435],"category_scores_gemma":[0.00007135612,0.00032396225,0.00030366718,0.00058634614,0.00002957265,0.00011375227,0.0004835072,0.0012401704,0.0000024606918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010089674,0.000036848967,0.0013005793,0.00010900645,0.0012967485,0.000011125964,0.0015303468,0.98537505,0.00026370393,0.00009070675,0.000057461213,0.009918339],"study_design_scores_gemma":[0.0004998558,0.00010676976,0.0008970803,0.00022853917,0.00028908573,0.000017152592,0.0002178312,0.99448675,0.0026331332,0.00007095143,0.00023775439,0.0003150994],"about_ca_topic_score_codex":0.0000036376694,"about_ca_topic_score_gemma":2.6238476e-7,"teacher_disagreement_score":0.652232,"about_ca_system_score_codex":0.00020937862,"about_ca_system_score_gemma":0.000066922206,"threshold_uncertainty_score":0.99992126},"labels":[],"label_agreement":null},{"id":"W2741021238","doi":"10.1287/trsc.2017.0798","title":"Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines","year":2018,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"TKI DINALOG","keywords":"Pickup; Vehicle routing problem; Mathematical optimization; Computer science; Scheduling (production processes); Set (abstract data type); Path (computing); Shortest path problem; Longest path problem; Public transport; Job shop scheduling; Column generation; Routing (electronic design automation); Mathematics; Theoretical computer science; Engineering; Transport engineering; Computer network","score_opus":0.014703248623537248,"score_gpt":0.25421395296247146,"score_spread":0.2395107043389342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741021238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65038896,0.00011154554,0.3489808,0.00012049026,0.000023117609,0.0002235597,0.0000041150874,0.00006579029,0.00008161203],"genre_scores_gemma":[0.84604,0.000040106646,0.15378088,0.00004806746,0.000024927764,0.000015965012,0.0000013983234,0.00000896169,0.000039706323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946237,0.00000713045,0.00011269916,0.00016561104,0.00012132247,0.00013086505],"domain_scores_gemma":[0.9995832,0.00012733358,0.000026608417,0.000080146354,0.0001321582,0.00005056697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048513524,0.00007209401,0.00007264516,0.00004834322,0.0002196587,0.000062656516,0.00007309503,0.000021485224,0.0000067821697],"category_scores_gemma":[0.000022145116,0.000050420836,0.0000061426535,0.00029806653,0.00038356325,0.00029079107,0.0000025877143,0.000038929542,0.000001124004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003316809,0.000049697475,0.111451544,0.000717337,0.00012318366,0.0000026328655,0.0319073,0.40157714,0.30046105,0.006830064,0.000115312396,0.14643306],"study_design_scores_gemma":[0.0007773939,0.00009687788,0.21510148,0.000044492524,0.00004086028,0.000005971677,0.000107107364,0.77363485,0.009464159,0.00018011131,0.00036418307,0.0001825001],"about_ca_topic_score_codex":0.0000067923893,"about_ca_topic_score_gemma":0.000023250512,"teacher_disagreement_score":0.37205774,"about_ca_system_score_codex":0.000005830149,"about_ca_system_score_gemma":0.000027068516,"threshold_uncertainty_score":0.2056102},"labels":[],"label_agreement":null},{"id":"W2741268399","doi":"10.1109/icsssm.2017.7996166","title":"Mobile Facility Routing Problem with Service-Time-related Demand","year":2017,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Metaheuristic; Mathematical optimization; Scheduling (production processes); Variable neighborhood search; Routing (electronic design automation); Service (business); Vehicle routing problem; Quality of service; Variable (mathematics); Integer programming; Computer network; Mathematics; Algorithm","score_opus":0.011353629488853453,"score_gpt":0.24255343418434572,"score_spread":0.23119980469549226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741268399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53985804,0.000054735436,0.3039412,0.00011642456,0.00013670458,0.00077142916,0.000015939739,0.002231714,0.15287381],"genre_scores_gemma":[0.85782456,0.0000043991854,0.14020915,0.000023288447,0.000017285663,0.00002771291,0.0000098425435,0.000030513467,0.001853266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991299,0.00003987708,0.00022825088,0.00020536224,0.00013249782,0.0002641374],"domain_scores_gemma":[0.9991446,0.00003879051,0.000071087066,0.00057501596,0.00008811001,0.000082386425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047854576,0.00016022146,0.00018718997,0.000030686817,0.00030650562,0.00016125193,0.00026283177,0.00009990339,0.00032897133],"category_scores_gemma":[0.00003914696,0.00013485042,0.00002693954,0.00009814425,0.000032262647,0.000279318,0.0000674908,0.0001633311,0.00021958863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063076877,0.00001509096,0.00998713,0.000079915204,0.000068863075,0.0000033668127,0.00066247577,0.97843015,0.0026121794,0.000073041156,0.00014721886,0.007914243],"study_design_scores_gemma":[0.000573552,0.0000349287,0.0036515142,0.000043305685,0.000022078773,0.000009777876,0.000050321745,0.99084985,0.003904547,0.00006944389,0.00051979476,0.0002708968],"about_ca_topic_score_codex":0.000047775164,"about_ca_topic_score_gemma":0.000018265744,"teacher_disagreement_score":0.3179665,"about_ca_system_score_codex":0.000042619184,"about_ca_system_score_gemma":0.000016825155,"threshold_uncertainty_score":0.54990405},"labels":[],"label_agreement":null},{"id":"W2741542409","doi":"10.1007/s10479-018-2868-1","title":"Improving set partitioning problem solutions by zooming around an improving direction","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Theory of computation; Set (abstract data type); Computer science; Zoom; Mathematical optimization; Integer programming; Algorithm; Mathematics; Programming language","score_opus":0.1797821635311046,"score_gpt":0.4289831972472035,"score_spread":0.24920103371609892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741542409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44682434,0.000353697,0.547079,0.00061520026,0.00022701675,0.0006129432,0.00006650699,0.00046483832,0.0037564265],"genre_scores_gemma":[0.9053536,0.00006203309,0.09367511,0.000026608377,0.0002867375,0.00010496906,0.00007861664,0.000051920077,0.00036041508],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978115,0.00039986434,0.00044448086,0.00030366605,0.00042384455,0.0006166627],"domain_scores_gemma":[0.99806815,0.00013919137,0.00003274325,0.0003818235,0.0012276969,0.00015036968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003342338,0.00013853486,0.00016541014,0.00036865103,0.0012146954,0.00032147893,0.00022520873,0.00011676641,0.00010256566],"category_scores_gemma":[0.0005777627,0.00015684495,0.00004548824,0.00091811887,0.00020500568,0.0010793288,0.000091337475,0.00037039662,0.00003384751],"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.00001346926,0.00011366654,0.00040340016,0.00012469145,0.000056470835,9.551321e-7,0.0021121588,0.35401765,0.6007808,0.0016512263,0.0041841795,0.036541358],"study_design_scores_gemma":[0.00013147885,0.0001616589,0.00014611373,0.000041434017,0.000005636871,0.0000037912619,0.00060669275,0.93231034,0.065698236,0.00009334934,0.000641064,0.00016020972],"about_ca_topic_score_codex":0.00084775616,"about_ca_topic_score_gemma":0.0003629202,"teacher_disagreement_score":0.57829267,"about_ca_system_score_codex":0.00007856934,"about_ca_system_score_gemma":0.000113638605,"threshold_uncertainty_score":0.9342578},"labels":[],"label_agreement":null},{"id":"W2742471139","doi":"","title":"A Survey of Models and Algorithms for Winter Road Maintenance. Part IV: Vehicle Routing and Fleet Sizing for Plowing and Snow Disposal","year":2005,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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":"Sizing; Routing (electronic design automation); Vehicle routing problem; Snow; Snow removal; Transport engineering; Operations research; Fleet management; Highway maintenance; Plough; Computer science; Engineering; Geography; Meteorology","score_opus":0.02842779412637151,"score_gpt":0.26189771106823284,"score_spread":0.23346991694186134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742471139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4657649,0.00052738865,0.5330605,0.00012176732,0.0000796981,0.00026921433,0.00006133976,0.000078647914,0.000036574726],"genre_scores_gemma":[0.74950516,0.000111656176,0.25006685,0.0000538331,0.00010358027,0.000031432108,0.000015449863,0.00005305976,0.00005898571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988846,0.00007046996,0.00034342363,0.00027565562,0.000087667664,0.00033814146],"domain_scores_gemma":[0.9989904,0.00063432066,0.000069763584,0.00012470596,0.00008656333,0.0000942282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986121,0.00019085938,0.0003307067,0.000070700204,0.00016682303,0.00006808688,0.000068849164,0.00013461403,0.0000013841069],"category_scores_gemma":[0.00037065,0.0001968663,0.00004636559,0.00009421584,0.00010631298,0.0002819443,0.000035912755,0.00013589955,9.1480835e-8],"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.00024701378,0.000055698187,0.022742698,0.0007460041,0.0003576051,0.0000034655834,0.013504195,0.31039882,0.0047348845,0.0036250616,0.0005067592,0.6430778],"study_design_scores_gemma":[0.0011790821,0.00004274502,0.006467127,0.00010276094,0.00003052221,0.0000069619073,0.00022309246,0.990333,0.0008559457,0.0003124844,0.00021948156,0.00022679406],"about_ca_topic_score_codex":0.00003843971,"about_ca_topic_score_gemma":0.00004350786,"teacher_disagreement_score":0.6799342,"about_ca_system_score_codex":0.00005363629,"about_ca_system_score_gemma":0.000010587831,"threshold_uncertainty_score":0.80279744},"labels":[],"label_agreement":null},{"id":"W2742575432","doi":"10.1155/2017/1624328","title":"Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; Jiangsu Science and Technology Department; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Path (computing); Computer science; Routing (electronic design automation); Particle swarm optimization; Operations research; Automated guided vehicle; Shortest path problem; Transport engineering; Real-time computing; Simulation; Engineering; Embedded system; Algorithm; Artificial intelligence; Computer network","score_opus":0.029147941877763105,"score_gpt":0.33283999349427573,"score_spread":0.30369205161651264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742575432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79801786,0.00002155084,0.20167497,0.000010920841,0.00011389129,0.00005627295,0.000006940741,0.000062717816,0.00003487219],"genre_scores_gemma":[0.8066547,0.0000308439,0.19326656,0.000002698456,0.000015076056,9.957839e-7,0.000013986221,0.000014271376,8.788729e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987996,0.00004141194,0.0007838947,0.000086348286,0.0001676435,0.000121098376],"domain_scores_gemma":[0.99887943,0.0000550618,0.0006619041,0.0001655775,0.00019137161,0.000046654477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055005803,0.000095570074,0.0003274802,0.00033566146,0.000050856885,0.000030426041,0.00013471498,0.00006167428,0.00000550025],"category_scores_gemma":[0.00011810397,0.000101476784,0.00008442778,0.0002642485,0.00002916999,0.000683476,0.000002099353,0.0001639951,1.397362e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028528226,0.000024774472,0.036430925,0.00004192531,0.00010613664,0.000016165937,0.0015001701,0.93491274,0.019716455,0.00004520485,2.5866507e-7,0.007176738],"study_design_scores_gemma":[0.00044950275,0.000040493953,0.40444985,0.00010137445,0.00015249844,0.0000013858796,0.00025246345,0.59210825,0.0023157024,0.0000613694,0.0000017989732,0.00006532802],"about_ca_topic_score_codex":0.0000150522255,"about_ca_topic_score_gemma":0.00013635006,"teacher_disagreement_score":0.36801893,"about_ca_system_score_codex":0.000065940214,"about_ca_system_score_gemma":0.000020226775,"threshold_uncertainty_score":0.4138103},"labels":[],"label_agreement":null},{"id":"W2742664076","doi":"10.1007/s10479-017-2601-5","title":"Solving the capacitated clustering problem with variable neighborhood search","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Variable neighborhood search; Heuristics; Benchmark (surveying); Mathematical optimization; Cluster analysis; Heuristic; Iterated local search; Variable (mathematics); Mathematics; Iterated function; Computer science; Metaheuristic; Artificial intelligence","score_opus":0.18524376840212,"score_gpt":0.41619169996105954,"score_spread":0.23094793155893953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742664076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20769952,0.00035060302,0.6610196,0.0072249393,0.00015624154,0.0016731987,0.000042359112,0.00029532026,0.12153821],"genre_scores_gemma":[0.91946805,0.00010879265,0.07950444,0.000021017388,0.00006187395,0.00006337525,0.0000060564316,0.0000402081,0.00072618516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831945,0.00027524217,0.00024231029,0.00017776161,0.0005151318,0.00047011973],"domain_scores_gemma":[0.99772465,0.00022605833,0.000019199504,0.00083643786,0.0011106597,0.00008299012],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0033573885,0.000106971296,0.00014548347,0.00016430095,0.0015413419,0.0006055476,0.00066853565,0.00006359025,0.000103818034],"category_scores_gemma":[0.0004848359,0.00007704771,0.000025618769,0.00039007905,0.00025519775,0.0004959999,0.0001709627,0.0004890887,0.000018755605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009540946,0.000020620948,0.00048094554,0.00006258361,0.000056213856,0.0000019448223,0.0010795443,0.98587435,0.006484401,0.0033236565,0.00040958283,0.002196583],"study_design_scores_gemma":[0.00019174234,0.00007234969,0.0012884759,0.00010350535,0.0000037137524,0.0000059683357,0.0003403737,0.9860117,0.0114666,0.00011828563,0.00028988183,0.0001073947],"about_ca_topic_score_codex":0.00041316578,"about_ca_topic_score_gemma":0.00016576082,"teacher_disagreement_score":0.7117685,"about_ca_system_score_codex":0.000023714576,"about_ca_system_score_gemma":0.00014220194,"threshold_uncertainty_score":0.99975854},"labels":[],"label_agreement":null},{"id":"W2743445264","doi":"","title":"Problème de livraisons à séquence fixée","year":2014,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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é Laval","funders":"","keywords":"Humanities; Philosophy; Political science","score_opus":0.015504862831440288,"score_gpt":0.24429410367686896,"score_spread":0.22878924084542868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743445264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021875734,0.0012782804,0.89568317,0.02086391,0.00053995545,0.0005923693,0.000060091166,0.0008788346,0.058227636],"genre_scores_gemma":[0.20632413,0.0010238665,0.77077436,0.00012390867,0.00008445626,0.00013038905,0.00021759438,0.00016982364,0.021151453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98411214,0.012315845,0.0009995264,0.0010863215,0.000532358,0.0009538179],"domain_scores_gemma":[0.99000067,0.003664853,0.0005982975,0.0030915048,0.0021555847,0.0004891166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01392841,0.0006784874,0.000697514,0.00024997126,0.00051547604,0.0005999729,0.0020025815,0.0007966435,0.00059294514],"category_scores_gemma":[0.005839944,0.000865704,0.00035234194,0.00069195265,0.00039930933,0.00021535526,0.0012368761,0.0015692022,0.00033522677],"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.0000116597,0.000677876,0.005626134,0.0013614966,0.00028255105,0.00001467332,0.023100674,0.35147265,0.013048325,0.47373575,0.0033272272,0.12734097],"study_design_scores_gemma":[0.0005267429,5.338984e-7,0.005345313,0.004256662,0.000115030125,0.000045787678,0.00006327497,0.8865746,0.0486513,0.006554106,0.04686939,0.0009972564],"about_ca_topic_score_codex":0.0017604778,"about_ca_topic_score_gemma":0.0006642789,"teacher_disagreement_score":0.53510195,"about_ca_system_score_codex":0.00060817687,"about_ca_system_score_gemma":0.00049106486,"threshold_uncertainty_score":0.9993794},"labels":[],"label_agreement":null},{"id":"W2747220382","doi":"","title":"Variable Neighborhood Search for the Maximum Clique","year":2001,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristic; Mathematics; Clique; Variable neighborhood search; Greedy algorithm; Clique problem; Vertex (graph theory); Mathematical optimization; Simplicity; Variable (mathematics); Combinatorics; Algorithm; Metaheuristic; Graph; Chordal graph","score_opus":0.01852289698079633,"score_gpt":0.26060745756493653,"score_spread":0.24208456058414018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747220382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031400798,0.0052917367,0.96415204,0.012410365,0.0023826845,0.0007013263,0.000048123904,0.0002796446,0.011593991],"genre_scores_gemma":[0.0291322,0.0024774694,0.944663,0.0009333138,0.0020399552,0.0001389898,0.000030654857,0.00022338692,0.020361042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978212,0.0003031814,0.000412729,0.00036332614,0.00024420553,0.000855353],"domain_scores_gemma":[0.9973318,0.001688848,0.00006519681,0.000560289,0.0001780099,0.00017588784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016581726,0.00031822166,0.00030850703,0.00010333161,0.00062572514,0.00019745232,0.0004435557,0.00050984416,0.0006375088],"category_scores_gemma":[0.00033429774,0.00029956756,0.00017165189,0.0006809369,0.00023667654,0.00020481083,0.000057400684,0.0008303928,0.000078804354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000399879,0.000052670544,0.0015329623,0.00019133001,0.00020144758,0.000017000848,0.0018378285,0.47095865,0.00036695055,0.42334437,0.00315132,0.09830549],"study_design_scores_gemma":[0.0009718875,0.00007773652,0.00050699676,0.00006431316,0.00013870026,0.000109938825,0.00052596215,0.7232456,0.0008713951,0.02216105,0.25089455,0.00043186688],"about_ca_topic_score_codex":0.0002893749,"about_ca_topic_score_gemma":0.000010535454,"teacher_disagreement_score":0.4011833,"about_ca_system_score_codex":0.00041780758,"about_ca_system_score_gemma":0.00011731593,"threshold_uncertainty_score":0.99994564},"labels":[],"label_agreement":null},{"id":"W2748787255","doi":"10.1002/net.21759","title":"Solving the large‐scale min–max K‐rural postman problem for snow plowing","year":2017,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc routing; Computer science; Solver; Mathematical optimization; Arc (geometry); Vehicle routing problem; Travelling salesman problem; Variable (mathematics); Deck; Graph; Transformation (genetics); Heuristics; Enhanced Data Rates for GSM Evolution; Routing (electronic design automation); Mathematics; Algorithm; Theoretical computer science; Computer network; Artificial intelligence; Engineering","score_opus":0.01386496700881961,"score_gpt":0.2647827661948654,"score_spread":0.2509177991860458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748787255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029199708,0.0003514602,0.9636204,0.0006358192,0.0010971457,0.00052336033,0.000006413349,0.00043315414,0.0041325195],"genre_scores_gemma":[0.8627613,0.00003324848,0.13499284,0.00018699323,0.0010278706,0.00008391084,0.000017952516,0.00010229994,0.00079354335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989836,0.000041661762,0.00021484173,0.00015463923,0.00011095417,0.0004942871],"domain_scores_gemma":[0.99901664,0.00023040637,0.00007547925,0.00056089775,0.00005325671,0.00006329852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007636617,0.00015911329,0.00017214139,0.000024220544,0.0008463736,0.00027714483,0.00046101902,0.00013622614,0.000022292113],"category_scores_gemma":[0.00011045399,0.00013244149,0.00010148566,0.000057124347,0.000035605484,0.00020987127,0.00009778616,0.00026211486,0.000006654216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069314665,0.000008503662,0.002514638,0.000028203029,0.000038974715,0.000001091963,0.0006580886,0.96664405,0.00013611559,0.00024677452,0.0054035303,0.024313098],"study_design_scores_gemma":[0.0003727659,0.000013151113,0.0016853999,0.00008841281,0.000025731862,0.0000034971897,0.00012315497,0.9911046,0.00012491379,0.00014701096,0.0061365655,0.00017481818],"about_ca_topic_score_codex":0.000006152665,"about_ca_topic_score_gemma":0.000033044682,"teacher_disagreement_score":0.8335616,"about_ca_system_score_codex":0.00003741514,"about_ca_system_score_gemma":0.0000090466765,"threshold_uncertainty_score":0.6509707},"labels":[],"label_agreement":null},{"id":"W2751348020","doi":"10.1016/j.cie.2017.08.036","title":"An iterated metaheuristic for the directed network design problem with relays","year":2017,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","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":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Metaheuristic; Iterated function; Computer science; Mathematical optimization; Engineering; Mathematics","score_opus":0.05211003315936165,"score_gpt":0.2552218237178717,"score_spread":0.20311179055851009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751348020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015884961,0.0000971433,0.9944352,0.000066537876,0.001489343,0.0010774168,0.000005295243,0.0012047315,0.0000358253],"genre_scores_gemma":[0.25307095,0.000009445504,0.7450642,0.00001642758,0.0014651524,0.00019540379,0.000016728272,0.00013846217,0.000023232633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880177,0.00006628658,0.000291208,0.00025375627,0.0001400371,0.00044693434],"domain_scores_gemma":[0.99833554,0.0006840497,0.00010173721,0.0006702629,0.00008741701,0.00012096393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007904394,0.00028062277,0.00029806563,0.00006347064,0.00044897298,0.0004923418,0.00061976677,0.00016428811,0.000004140143],"category_scores_gemma":[0.0001993228,0.00021970479,0.00005524398,0.000213456,0.000034382025,0.00027434362,0.000043227847,0.00038019527,0.000001652422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003728045,0.000006299048,0.000056303386,0.000016137265,0.00015392691,0.000004259889,0.00007675032,0.9851929,0.00025515165,0.0001416445,0.0009638942,0.013095451],"study_design_scores_gemma":[0.0010787885,0.00009798628,0.00023989705,0.00012634312,0.00009062858,0.00000890089,0.0000031465522,0.994612,0.00047025539,0.000013175951,0.0029638913,0.00029500344],"about_ca_topic_score_codex":0.000007112575,"about_ca_topic_score_gemma":8.3403324e-7,"teacher_disagreement_score":0.25148243,"about_ca_system_score_codex":0.000068201996,"about_ca_system_score_gemma":0.000034506706,"threshold_uncertainty_score":0.8959301},"labels":[],"label_agreement":null},{"id":"W2753828258","doi":"10.1016/j.trb.2017.08.003","title":"Operational flexibility in the truckload trucking industry","year":2017,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Toronto Metropolitan University","funders":"","keywords":"Trucking industry; Flexibility (engineering); Business; Transport engineering; Engineering; Automotive engineering; Economics; Truck; Management","score_opus":0.5610344710681515,"score_gpt":0.5238044464357593,"score_spread":0.03723002463239222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753828258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92440796,0.000056376994,0.06908254,0.0016436017,0.00021623315,0.00050409616,0.000022886998,0.0001476617,0.0039186706],"genre_scores_gemma":[0.89868736,0.000039911552,0.10076603,0.000091361806,0.00015762316,0.0001423595,0.000030507586,0.000016635477,0.000068202586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9950846,0.0029133686,0.00047786967,0.0003387694,0.000719989,0.000465396],"domain_scores_gemma":[0.9964846,0.002569288,0.000052369036,0.00064685143,0.00015431253,0.000092572336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018506857,0.00014641884,0.00024509378,0.0001244548,0.00064799533,0.00023202036,0.0007628977,0.00037139712,0.00044528168],"category_scores_gemma":[0.0030643293,0.000107346954,0.000071092065,0.00029984777,0.00034571605,0.00030238816,0.000014178875,0.0017647814,0.000019042345],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001751177,0.00020146603,0.4242757,0.00014091008,0.000053586806,0.00013999389,0.0043685175,0.4961641,0.0034149874,0.035798166,0.0015287503,0.033738676],"study_design_scores_gemma":[0.00048688456,0.000042622654,0.9598857,0.000029264911,0.0000059994923,0.0000026005885,0.00046233772,0.03059784,0.0014280011,0.00451861,0.002372979,0.00016712531],"about_ca_topic_score_codex":0.00006949219,"about_ca_topic_score_gemma":0.0001430509,"teacher_disagreement_score":0.53561,"about_ca_system_score_codex":0.000059309845,"about_ca_system_score_gemma":0.000053121414,"threshold_uncertainty_score":0.7667195},"labels":[],"label_agreement":null},{"id":"W2754261999","doi":"10.1287/trsc.2017.0771","title":"Exact Solutions for the Carrier–Vehicle Traveling Salesman Problem","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Travelling salesman problem; Range (aeronautics); Computer science; Mathematical optimization; A priori and a posteriori; Integer programming; Vehicle routing problem; Traveling purchaser problem; Integer (computer science); Conic section; 2-opt; Algorithm; Engineering; Mathematics; Routing (electronic design automation); Computer network; Aerospace engineering","score_opus":0.0518667728935645,"score_gpt":0.31759714648962245,"score_spread":0.26573037359605794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754261999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1008867,0.0000523836,0.89664483,0.0005443223,0.00032001297,0.00038500654,0.000041564053,0.00021224745,0.00091290555],"genre_scores_gemma":[0.9490167,0.00002166771,0.050721493,0.000023280245,0.000045374352,0.000055548975,0.000005180091,0.000016812326,0.00009396807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990084,0.0000088744355,0.00021124764,0.00019250107,0.00024252808,0.0003364204],"domain_scores_gemma":[0.99919957,0.00011242567,0.00007099321,0.000399649,0.0001451226,0.00007221122],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013177264,0.00009031039,0.00008453239,0.00004348825,0.002060464,0.0002145895,0.0005576064,0.000033808014,0.000014427246],"category_scores_gemma":[0.00009850334,0.00007529458,0.00004755843,0.0001942368,0.00026838755,0.0005496269,0.000004840905,0.00008950695,0.0000038742915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004127277,0.000006949548,0.0024118805,0.000032906784,0.000009682079,4.675829e-7,0.0021096966,0.9484696,0.024106588,0.00613197,0.000060735307,0.016655395],"study_design_scores_gemma":[0.00031130412,0.000011801428,0.1395579,0.000020592537,0.00002803884,7.644161e-7,0.00018476456,0.8511314,0.007106533,0.00056149805,0.0009275441,0.00015790487],"about_ca_topic_score_codex":0.000036464768,"about_ca_topic_score_gemma":0.00013430945,"teacher_disagreement_score":0.84813,"about_ca_system_score_codex":0.00004776917,"about_ca_system_score_gemma":0.00007423032,"threshold_uncertainty_score":0.9992387},"labels":[],"label_agreement":null},{"id":"W2756042703","doi":"10.1139/cjce-2017-0185","title":"A case study of combined winter road snow plowing and de-icer spreading","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","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":true,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transport engineering; Computer science; Snow removal; Snow; Hierarchy; Plough; Term (time); Operations research; Plan (archaeology); Meteorology; Engineering; Geography","score_opus":0.018792628670988205,"score_gpt":0.246998523770845,"score_spread":0.22820589509985678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756042703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631852,0.00016064128,0.03561789,0.00002029054,0.0004477937,0.00008424269,0.0000022069808,0.000024305993,0.00045740747],"genre_scores_gemma":[0.99573535,0.0000057928905,0.004094668,0.0000053034346,0.000095703464,0.0000014730927,1.3453956e-7,0.000048324207,0.000013225387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991423,0.00002593836,0.00037091365,0.00008203047,0.000097502416,0.00028132947],"domain_scores_gemma":[0.99905443,0.000077861594,0.00012415515,0.00023792776,0.000089977984,0.0004156496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058420683,0.00014431801,0.00029321836,0.0003383466,0.00013614327,0.0001314618,0.00021606304,0.00006287296,0.000026617785],"category_scores_gemma":[0.0004946144,0.00016147997,0.000052317668,0.00007459654,0.000023607101,0.00030337105,0.000019523262,0.00027715974,3.2838074e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042999463,0.000011234142,0.028873695,0.00009347429,0.00019358922,0.0035946248,0.0064082667,0.9564601,0.0011607086,0.000015246564,0.00007123923,0.003113496],"study_design_scores_gemma":[0.0025214104,0.00026728667,0.03155534,0.00082867104,0.00017765739,0.007990746,0.0025922563,0.95217097,0.0011743505,0.00001748932,0.00020597164,0.0004978757],"about_ca_topic_score_codex":0.001441866,"about_ca_topic_score_gemma":0.027737636,"teacher_disagreement_score":0.032550156,"about_ca_system_score_codex":0.00013105273,"about_ca_system_score_gemma":0.00009373806,"threshold_uncertainty_score":0.99000365},"labels":[],"label_agreement":null},{"id":"W2758864124","doi":"","title":"An Extended Branch-and-Bound Method for Locomotive Assignment","year":2003,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Backtracking; Branch and bound; Mathematical optimization; Computer science; Heuristic; Node (physics); Set (abstract data type); Branch and cut; Branch and price; Integer programming; Operations research; Mathematics; Engineering","score_opus":0.014757337852493618,"score_gpt":0.28410462950859844,"score_spread":0.2693472916561048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758864124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004906262,0.008846175,0.97820675,0.0030261446,0.00078702805,0.0021714235,0.00016094056,0.0010103226,0.00088495115],"genre_scores_gemma":[0.09989394,0.00053666526,0.8947339,0.0008938177,0.00024791452,0.00093367015,0.000033966106,0.00029285523,0.0024332535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950089,0.0013323238,0.0008999271,0.0009147365,0.00039647784,0.0014476704],"domain_scores_gemma":[0.99675184,0.00085526373,0.00028385114,0.0010900937,0.00024088184,0.00077805464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039861915,0.00076264306,0.0008139361,0.0004555334,0.00045414723,0.00044551186,0.0004415297,0.0008049358,0.00017941966],"category_scores_gemma":[0.0008292544,0.00092969445,0.00026991326,0.0006754578,0.00016624467,0.0006814753,0.000086663546,0.00072833605,0.000012975457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007521891,0.00050442346,0.0025403644,0.00036324197,0.00028188602,0.000024736939,0.0011425385,0.5524561,0.02429324,0.21401945,0.0011026387,0.2031962],"study_design_scores_gemma":[0.0014257446,0.00041589595,0.004081483,0.00014706375,0.00022734122,0.00016709493,0.0002418264,0.8964472,0.064718366,0.019461228,0.011691204,0.0009755757],"about_ca_topic_score_codex":0.0023289043,"about_ca_topic_score_gemma":0.00053383596,"teacher_disagreement_score":0.3439911,"about_ca_system_score_codex":0.0012581937,"about_ca_system_score_gemma":0.00029456915,"threshold_uncertainty_score":0.9993154},"labels":[],"label_agreement":null},{"id":"W2759685288","doi":"10.1287/trsc.2017.0783","title":"A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Integer programming; Traverse; Mathematical optimization; Linear programming; Extension (predicate logic); Branch and cut; Mathematics; Column generation; Heuristic; Binary number; Minimum weight; Algorithm; Set (abstract data type); Computer science; Combinatorics","score_opus":0.021466535352644686,"score_gpt":0.3028421713022516,"score_spread":0.2813756359496069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759685288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1297144,0.000044079137,0.86901754,0.00030415668,0.0002025652,0.0003395044,0.000019787452,0.00012916072,0.00022883652],"genre_scores_gemma":[0.7676462,0.000022889262,0.23216385,0.000029492276,0.000027331967,0.000035898818,0.000003160641,0.000011166095,0.000060021765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930996,0.000005929517,0.00016101026,0.00014075646,0.00019161319,0.00019073003],"domain_scores_gemma":[0.9994447,0.00008904167,0.000057274632,0.00025145497,0.000101466714,0.000056033623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549378,0.000080387625,0.00007765194,0.000042003117,0.00076938735,0.00018717896,0.00034207254,0.000025489588,0.000006093089],"category_scores_gemma":[0.00005054866,0.000062545165,0.000027313694,0.00011158255,0.00027732018,0.00049135846,0.0000040424443,0.0000632455,0.0000024585052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007957753,0.000013332653,0.0098653175,0.00006642644,0.00001971923,0.0000012378737,0.0045955614,0.16378881,0.02042035,0.0024611948,0.00004364119,0.7987164],"study_design_scores_gemma":[0.0003204215,0.000011362211,0.23098433,0.000014730321,0.0000138751375,0.000001640598,0.00008378242,0.76246786,0.00554046,0.0002385834,0.00021826442,0.00010466073],"about_ca_topic_score_codex":0.000040849925,"about_ca_topic_score_gemma":0.000051184867,"teacher_disagreement_score":0.79861176,"about_ca_system_score_codex":0.000014013274,"about_ca_system_score_gemma":0.00002664728,"threshold_uncertainty_score":0.5917583},"labels":[],"label_agreement":null},{"id":"W2765241042","doi":"10.71781/11079","title":"Recourse policies in the vehicle routing problem with stochastic demands","year":2017,"lang":"en","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Operations research; Business; Mathematical optimization; Engineering; Computer network; Mathematics","score_opus":0.007124106004110809,"score_gpt":0.19946898984464173,"score_spread":0.19234488384053092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765241042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8582358,0.004225518,0.0044738417,0.0002306748,0.0007003295,0.00082693924,0.000028411734,0.00042256954,0.13085592],"genre_scores_gemma":[0.98581904,0.00008311517,0.0028898136,0.000026625234,0.00013471812,0.000045976176,0.00014662273,0.000058906655,0.010795171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984265,0.00011570476,0.00029455428,0.00031791226,0.00045485797,0.00039046272],"domain_scores_gemma":[0.9989557,0.00012675057,0.00024256221,0.0004549507,0.0001221332,0.000097871925],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003987989,0.0003411907,0.0003101889,0.00024977862,0.0033883753,0.00012945206,0.00055551634,0.00028914268,0.000008657042],"category_scores_gemma":[0.000060098093,0.0003055876,0.00010134931,0.000244379,0.00010144222,0.00027752717,0.0000335926,0.0005633749,0.000009577629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023456212,0.00006456154,0.00454145,0.00019696835,0.00019452536,0.0005463079,0.053363293,0.92988217,0.0013743871,0.0027014732,0.0002442206,0.0066560777],"study_design_scores_gemma":[0.005495558,0.00035728744,0.25168785,0.0038514119,0.0012570175,0.002023943,0.13816975,0.5787216,0.0050289147,0.0007960315,0.009062059,0.003548572],"about_ca_topic_score_codex":0.005191705,"about_ca_topic_score_gemma":0.0081215985,"teacher_disagreement_score":0.35116056,"about_ca_system_score_codex":0.0017529171,"about_ca_system_score_gemma":0.00048030907,"threshold_uncertainty_score":0.9999396},"labels":[],"label_agreement":null},{"id":"W2766561679","doi":"10.5539/jms.v7n4p89","title":"A Vehicle Routing Problem with Consideration of Green Transportation","year":2017,"lang":"en","type":"article","venue":"Journal of Management and Sustainability","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan","keywords":"Fuel efficiency; Vehicle routing problem; Terrain; Routing (electronic design automation); Situated; Service (business); Consumption (sociology); Transport engineering; Operations research; Computer science; Genetic algorithm; Automotive engineering; Environmental economics; Business; Engineering; Computer network; Economics","score_opus":0.009895738117435464,"score_gpt":0.251584277456738,"score_spread":0.24168853933930254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766561679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8960957,0.000041781437,0.10257642,0.00032699027,0.000025871444,0.00019696816,6.751819e-7,0.000015410264,0.0007201881],"genre_scores_gemma":[0.9716057,0.00002377741,0.02828004,0.0000044398794,0.00001638733,0.0000017258076,4.6140798e-7,0.000007273618,0.000060175655],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993574,0.000038917482,0.00031249455,0.00006256886,0.00013935774,0.00008927724],"domain_scores_gemma":[0.9992657,0.000032405667,0.00024927902,0.00013825072,0.00028293193,0.000031484058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008769724,0.00006518701,0.00014819573,0.000060541428,0.000107888125,0.000050891525,0.00007747373,0.000027514703,0.000003709906],"category_scores_gemma":[0.000052880834,0.000054711974,0.000028094495,0.000042397656,0.000053322583,0.00032740788,0.000008828524,0.00008542108,3.5813223e-8],"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.00015672413,0.00006304328,0.70918393,0.0020278217,0.00019689334,0.000045586108,0.0026265166,0.20819913,0.000064170636,0.0051838793,0.000045289933,0.072207],"study_design_scores_gemma":[0.0015538213,0.00017762321,0.9216514,0.00011330544,0.0001386648,0.000006490291,0.002637427,0.06700688,0.00054231763,0.0058564614,0.00017165687,0.00014392425],"about_ca_topic_score_codex":0.000025060313,"about_ca_topic_score_gemma":0.000022570513,"teacher_disagreement_score":0.21246748,"about_ca_system_score_codex":0.000050488914,"about_ca_system_score_gemma":0.000022662258,"threshold_uncertainty_score":0.22310896},"labels":[],"label_agreement":null},{"id":"W2767149973","doi":"10.1016/j.trb.2018.05.015","title":"A unified framework for rich routing problems with stochastic demands","year":2018,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"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":"Computer science; Mathematical optimization; Vehicle routing problem; Routing (electronic design automation); Operations research; Mathematics","score_opus":0.3402977632688913,"score_gpt":0.45561005971023105,"score_spread":0.11531229644133978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767149973","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102720626,0.000036873087,0.89518434,0.00017255833,0.00013849002,0.0009025822,0.00002014729,0.00050724,0.0003171288],"genre_scores_gemma":[0.42183012,0.000008387735,0.5774858,0.000025697136,0.00021582529,0.00029695051,0.00003536039,0.00004180903,0.000060077673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967914,0.00095189014,0.00047877672,0.00044877557,0.0005619908,0.0007671322],"domain_scores_gemma":[0.99295145,0.005853702,0.00006312465,0.00029749842,0.0006363257,0.00019791258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007694417,0.00021531431,0.0003621159,0.00019506247,0.00036414358,0.000068010384,0.00026114352,0.0002836695,0.00019809845],"category_scores_gemma":[0.002079722,0.00017223132,0.00006538579,0.0010591225,0.00032397822,0.00012020447,0.000007686975,0.0006447905,0.000020907119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006229275,0.00011034251,0.003934754,0.00032872253,0.00017877363,0.000011320663,0.003742309,0.90594935,0.0027104544,0.07482289,0.00045894645,0.0071292208],"study_design_scores_gemma":[0.003099907,0.0029736804,0.033033725,0.0006975053,0.00016270445,0.000010799108,0.0015418761,0.87040615,0.011619769,0.07207881,0.0030600934,0.0013149987],"about_ca_topic_score_codex":0.0000069467637,"about_ca_topic_score_gemma":0.000034916702,"teacher_disagreement_score":0.31910947,"about_ca_system_score_codex":0.00005609582,"about_ca_system_score_gemma":0.00005487167,"threshold_uncertainty_score":0.70233893},"labels":[],"label_agreement":null},{"id":"W2767827514","doi":"10.1007/s00291-017-0494-y","title":"Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem","year":2017,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Interuniversity Research and Analysis on Organizations; Université Laval; GLS Industries (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Alfaisal University","keywords":"Vehicle routing problem; Solver; Mathematical optimization; Computer science; Routing (electronic design automation); Lexicographical order; Set (abstract data type); Variable (mathematics); Index (typography); Mathematics","score_opus":0.028535133580071145,"score_gpt":0.30224196025263855,"score_spread":0.2737068266725674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767827514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32451895,0.00022110251,0.6702934,0.0019972655,0.00040476443,0.0011801551,0.00004250516,0.00027713852,0.0010647486],"genre_scores_gemma":[0.82521695,0.000048836446,0.17405096,0.000026784004,0.0001193374,0.000046854308,0.0000011340901,0.0000395369,0.00044963622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927205,0.000019343068,0.00018377468,0.0001901771,0.00006806344,0.00026660046],"domain_scores_gemma":[0.99906516,0.00044808493,0.00009695086,0.00030179272,0.00002895916,0.000059072085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036776424,0.00014071573,0.00014430587,0.000024414367,0.0008345141,0.00036405653,0.00017413188,0.000056954712,0.00000994563],"category_scores_gemma":[0.0004287585,0.00010464091,0.00003137324,0.000042397136,0.000072238836,0.0001993985,0.000086963315,0.00012531156,9.54232e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007309068,0.0003201106,0.117691614,0.001264324,0.0020459504,0.000031333475,0.024131782,0.25143453,0.17127985,0.07059151,0.00060749264,0.3598706],"study_design_scores_gemma":[0.0011119583,0.00004270061,0.0227616,0.000022437009,0.000031928143,0.000007784348,0.000062825806,0.97015464,0.003636103,0.0014952355,0.0005143069,0.00015849438],"about_ca_topic_score_codex":0.00010482698,"about_ca_topic_score_gemma":0.00026324598,"teacher_disagreement_score":0.7187201,"about_ca_system_score_codex":0.00003920161,"about_ca_system_score_gemma":0.00001457287,"threshold_uncertainty_score":0.6418492},"labels":[],"label_agreement":null},{"id":"W2767831630","doi":"10.1016/j.cor.2017.11.003","title":"Vehicle routing with backhauls: Review and research perspectives","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Vehicle routing problem; Computer science; Heuristic; Operations research; Routing (electronic design automation); Computer network; Artificial intelligence; Mathematics","score_opus":0.11812769133609638,"score_gpt":0.44026408235878545,"score_spread":0.3221363910226891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767831630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30619308,0.06608635,0.53719825,0.03163991,0.0005433067,0.006015564,0.000035880432,0.0013769036,0.050910767],"genre_scores_gemma":[0.8733437,0.005580322,0.119852915,0.000051531657,0.00018967639,0.00010599275,0.000006407485,0.00006619948,0.0008032752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758345,0.0006493636,0.00021348281,0.00039599303,0.0005992992,0.0005583994],"domain_scores_gemma":[0.99746895,0.00038019574,0.000013924663,0.0009142062,0.0010514277,0.00017131283],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0045632333,0.00013679104,0.00022791245,0.0002581479,0.0025261168,0.0011004191,0.00061776594,0.000066346736,0.00005597669],"category_scores_gemma":[0.00089501013,0.00012370817,0.000024306073,0.0004723991,0.0005368098,0.000521062,0.0003862545,0.00086741865,0.000054732394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053395575,0.00033631432,0.0066269552,0.0032589226,0.0005452791,0.00013812128,0.021302033,0.7061805,0.0060048113,0.034042697,0.048285097,0.17322586],"study_design_scores_gemma":[0.0005087563,0.00013703054,0.0053049847,0.0010331991,0.00001597534,0.000028042594,0.0010364705,0.9885,0.0005640351,0.000060659586,0.0025209056,0.00028993067],"about_ca_topic_score_codex":0.000092653674,"about_ca_topic_score_gemma":0.000051858904,"teacher_disagreement_score":0.5671506,"about_ca_system_score_codex":0.00015542428,"about_ca_system_score_gemma":0.00010524345,"threshold_uncertainty_score":0.9999365},"labels":[],"label_agreement":null},{"id":"W2769122157","doi":"10.1155/2017/9387302","title":"Finding <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math>-Hub Median Locations: An Empirical Study on Problems and Solution Techniques","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Scalability; Computer science; Algorithm; Relaxation (psychology); Database","score_opus":0.028900912177476167,"score_gpt":0.2980729017373702,"score_spread":0.2691719895598941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769122157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94890875,0.00007961476,0.048851565,0.00016732645,0.00035437153,0.000040208302,0.000009997435,0.000088865294,0.0014992951],"genre_scores_gemma":[0.9562938,0.00020061868,0.043057773,0.000047803398,0.00021013424,0.000061631305,0.000051197974,0.00007045309,0.0000065964314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985399,0.000054748092,0.0005394329,0.000202773,0.00042403155,0.00023911346],"domain_scores_gemma":[0.998805,0.000132307,0.0005476053,0.00030030016,0.00007925693,0.00013556321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074396195,0.0001417775,0.00010690729,0.00014970459,0.0003529773,0.00015746806,0.00022535819,0.00021234914,0.0001442053],"category_scores_gemma":[0.00021410159,0.00020087766,0.000106739535,0.00012525445,0.00008791233,0.0009671093,0.000014164498,0.00035875294,0.000009693241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005369057,0.000487792,0.0014122928,0.00078373635,0.0005139578,0.00029199987,0.019587724,0.63331825,0.021220727,0.28435218,0.0006186384,0.036875788],"study_design_scores_gemma":[0.0017807148,0.0020396952,0.037116766,0.0010920998,0.00045682528,0.00016624913,0.0029305983,0.70991284,0.24306612,0.00037948566,0.00043997017,0.00061861833],"about_ca_topic_score_codex":0.000026525813,"about_ca_topic_score_gemma":0.00016575366,"teacher_disagreement_score":0.28397268,"about_ca_system_score_codex":0.000012660906,"about_ca_system_score_gemma":0.000084787265,"threshold_uncertainty_score":0.81915534},"labels":[],"label_agreement":null},{"id":"W2772307536","doi":"10.1016/j.tre.2017.11.008","title":"Service level, cost and environmental optimization of collaborative transportation","year":2017,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":75,"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é Laval","funders":"","keywords":"Transport engineering; Service (business); Business; Total cost; Operations research; Operational costs; Computer science; Environmental economics; Operations management; Engineering; Marketing; Economics","score_opus":0.12142294007334825,"score_gpt":0.3747008007721558,"score_spread":0.25327786069880753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772307536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086226635,0.026922716,0.8700325,0.0015200374,0.00033994397,0.004673774,0.00945677,0.00027090823,0.000556716],"genre_scores_gemma":[0.80212086,0.16649823,0.027555475,0.00009786169,0.000032713804,0.00018720805,0.0034208654,0.00005958786,0.000027184307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9978601,0.000104996645,0.0008344004,0.0003612878,0.0005359978,0.0003032625],"domain_scores_gemma":[0.9986129,0.00018031224,0.00027479473,0.0003543022,0.00038960544,0.0001881036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009392907,0.00025017076,0.0004637111,0.00012972417,0.00041799498,0.000072852345,0.00018785014,0.00014010593,0.00013931599],"category_scores_gemma":[0.00006835155,0.0002652454,0.000050743423,0.00030442257,0.00035567963,0.00040776999,0.0000018567941,0.00027326244,0.0000027208116],"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.00015327068,0.00022251987,0.041607857,0.017046329,0.00029710383,0.000048448095,0.0037237997,0.88308334,0.0010204033,0.014610031,0.00090221013,0.03728469],"study_design_scores_gemma":[0.004099942,0.00033355536,0.7788471,0.005392995,0.0009245488,0.00000294073,0.0015459207,0.18383062,0.0020596776,0.0008687731,0.020620378,0.0014735574],"about_ca_topic_score_codex":0.00012695832,"about_ca_topic_score_gemma":0.0012365661,"teacher_disagreement_score":0.842477,"about_ca_system_score_codex":0.000028448416,"about_ca_system_score_gemma":0.00005541067,"threshold_uncertainty_score":0.99998},"labels":[],"label_agreement":null},{"id":"W2773247030","doi":"10.1016/j.tre.2017.10.007","title":"The importance of considering non-linear layover and delay costs for local truckers","year":2017,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discretization; Nonlinear system; Computer science; Mathematical optimization; Linear programming; Integer programming; Operations research; Engineering; Mathematics; Algorithm","score_opus":0.09995997690386282,"score_gpt":0.4001760545754898,"score_spread":0.300216077671627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773247030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05100137,0.025890991,0.91693586,0.0017995702,0.00032122334,0.0029521135,0.00063254836,0.00010763185,0.00035871696],"genre_scores_gemma":[0.8721663,0.10988617,0.01738572,0.000065021995,0.00003599922,0.00019363979,0.00018068022,0.000042497933,0.000044026707],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99844766,0.000054495333,0.0006614487,0.00023898778,0.00030816114,0.00028924597],"domain_scores_gemma":[0.99832916,0.0006049706,0.00018761077,0.00033298906,0.00042314146,0.0001221385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016825006,0.00015761034,0.0003288081,0.00004512966,0.0005448332,0.000055924524,0.0001653546,0.00008006775,0.000012787771],"category_scores_gemma":[0.00023341818,0.00013191083,0.00006351876,0.00010878892,0.0005673616,0.00015285038,0.000002348046,0.00020922045,8.277206e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004027683,0.00021407066,0.32327425,0.04907481,0.00094679394,0.00012400617,0.0025214371,0.1965966,0.00046430292,0.17824684,0.008556635,0.2395775],"study_design_scores_gemma":[0.005103356,0.00052079675,0.45767137,0.0069541596,0.000799368,0.0000054890543,0.0008391402,0.39101303,0.0013709688,0.00457131,0.12974507,0.0014059454],"about_ca_topic_score_codex":0.00004735027,"about_ca_topic_score_gemma":0.00083262176,"teacher_disagreement_score":0.89955014,"about_ca_system_score_codex":0.000019131412,"about_ca_system_score_gemma":0.000048485592,"threshold_uncertainty_score":0.5379167},"labels":[],"label_agreement":null},{"id":"W2782124575","doi":"10.1007/978-3-319-69215-9_3","title":"Cumulative VRP: A Simplified Model of Green Vehicle Routing","year":2017,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Vehicle Routing Optimization Methods","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":"University of Lethbridge","funders":"","keywords":"Vehicle routing problem; Context (archaeology); Mathematical optimization; Column generation; Cumulative distribution function; Routing (electronic design automation); Integer programming; Computer science; Mathematics; Statistics; Geography; Probability density function","score_opus":0.040998494797837445,"score_gpt":0.27718368582240277,"score_spread":0.2361851910245653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782124575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003829412,0.00035208004,0.8003324,0.000065358,0.00004418956,0.0007566217,0.00012226762,0.0003282582,0.19796053],"genre_scores_gemma":[0.12422424,0.0044435523,0.53286266,0.00015915994,0.0005069102,0.00042777296,0.0005069515,0.00081987004,0.3360489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862075,0.000012356279,0.0005622242,0.0003842864,0.00021145961,0.00020889631],"domain_scores_gemma":[0.99852794,0.00008499938,0.00039099198,0.0005821876,0.0002913602,0.00012252048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001947934,0.00034019962,0.00042282708,0.00019449827,0.00026001272,0.00006601779,0.00027653854,0.0003481173,0.00009058076],"category_scores_gemma":[0.000042560736,0.00040058084,0.00009074643,0.000047608126,0.00007995188,0.0001867025,0.00012052801,0.00029770538,0.000016625869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024493309,0.000007150481,0.0000046739774,0.000104393264,0.000060350314,1.35889e-7,0.00018188848,0.9220439,0.00031750396,0.07287822,0.000027814127,0.0043715155],"study_design_scores_gemma":[0.00024283804,0.000007769933,0.000006856267,0.00009336245,0.00009031101,0.0000010481504,0.0000072392813,0.99404675,0.00033610116,0.0018172072,0.0029894372,0.00036110837],"about_ca_topic_score_codex":0.0000061545165,"about_ca_topic_score_gemma":0.0000035288597,"teacher_disagreement_score":0.26746973,"about_ca_system_score_codex":0.000063179694,"about_ca_system_score_gemma":0.000049240716,"threshold_uncertainty_score":0.9998446},"labels":[],"label_agreement":null},{"id":"W2787686159","doi":"10.1109/ssci.2017.8285385","title":"An age layered population structure genetic algorithm for the multi-depot vehicle problem","year":2017,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Vehicle routing problem; Genetic algorithm; Benchmark (surveying); Ranking (information retrieval); Pareto principle; Mathematical optimization; Computer science; Population; Routing (electronic design automation); Mathematics; Artificial intelligence; Geography; Computer network","score_opus":0.027715621526807035,"score_gpt":0.3046774116243873,"score_spread":0.27696179009758026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787686159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03959438,0.00004097169,0.9591333,0.00005771268,0.00023553963,0.0004946945,0.000021988813,0.00031870068,0.00010270539],"genre_scores_gemma":[0.4589044,0.0000038277803,0.54082286,0.000016878255,0.000091280875,0.000017625756,0.000012362686,0.0000308956,0.00009985799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993195,0.00003321601,0.00017946554,0.00016610161,0.000100593184,0.00020112463],"domain_scores_gemma":[0.99920475,0.000052861764,0.000060193262,0.0005822799,0.00004590878,0.00005397363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017208625,0.00012568304,0.00011343061,0.000026059875,0.00043726456,0.00024035654,0.00033615506,0.00009418459,0.000035464484],"category_scores_gemma":[0.000044104727,0.000094677154,0.000039215287,0.00003766079,0.00002163334,0.00018218001,0.000026101343,0.00009682,0.0000025289626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001456551,0.000007685148,0.0029164418,0.000016662318,0.000020535623,9.284752e-7,0.00011818408,0.7282797,0.004219118,0.000058930713,0.000046838606,0.26431352],"study_design_scores_gemma":[0.00040714233,0.000014447996,0.113617554,0.000004650896,0.000014558198,0.0000020778778,0.00001794323,0.8834315,0.0019902636,0.00021080676,0.00016460761,0.00012442809],"about_ca_topic_score_codex":0.00012640422,"about_ca_topic_score_gemma":0.00012277577,"teacher_disagreement_score":0.41931,"about_ca_system_score_codex":0.000028819848,"about_ca_system_score_gemma":0.0000053279186,"threshold_uncertainty_score":0.38608223},"labels":[],"label_agreement":null},{"id":"W2789761009","doi":"10.5267/j.dsl.2018.2.002","title":"A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study","year":2018,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Tehran","keywords":"Scheduling (production processes); Vehicle routing problem; Reliability (semiconductor); Computer science; Mathematical optimization; Operations research; Reliability engineering; Engineering; Routing (electronic design automation); Mathematics; Computer network","score_opus":0.011872862016939803,"score_gpt":0.264793870505356,"score_spread":0.2529210084884162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789761009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7900748,0.0000092625405,0.20900875,0.00014488652,0.000043910655,0.0004769341,0.0000017934275,0.0001965854,0.000043053915],"genre_scores_gemma":[0.8661283,3.7329886e-7,0.1336557,0.00012315495,0.000034797304,0.000011821992,2.5714473e-7,0.000029754106,0.000015823714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976305,0.00011851115,0.00039263983,0.00069947273,0.00069213705,0.0004667348],"domain_scores_gemma":[0.998621,0.0004524142,0.00008193829,0.00044372954,0.0001868555,0.00021404818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003234006,0.0002228416,0.00025001363,0.00032964637,0.0005778481,0.0002944967,0.00025047385,0.000048846687,0.0000131676115],"category_scores_gemma":[0.00054814806,0.00018772167,0.000015601969,0.0012274414,0.000657018,0.0005165393,0.00017298291,0.00022708793,0.000029248478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010709861,0.0000902981,0.016403124,0.000028332657,0.00002875122,0.00058406405,0.016004823,0.7575725,0.17085156,0.0000048977363,0.000021568561,0.03830299],"study_design_scores_gemma":[0.0009400186,0.0002671388,0.0030741487,0.00009756784,0.000027380062,0.00081013225,0.0010650173,0.9927592,0.00061339006,0.000042979165,0.0000018304386,0.00030114528],"about_ca_topic_score_codex":0.000117116324,"about_ca_topic_score_gemma":0.000019832234,"teacher_disagreement_score":0.23518676,"about_ca_system_score_codex":0.00010467855,"about_ca_system_score_gemma":0.00003987044,"threshold_uncertainty_score":0.76550674},"labels":[],"label_agreement":null},{"id":"W2790139429","doi":"10.1007/s11750-018-0468-5","title":"Comments on: Disruption management in vehicle routing and scheduling for road freight transport: a review","year":2018,"lang":"en","type":"review","venue":"Top","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Scheduling (production processes); Transport engineering; Operations research; Routing (electronic design automation); Operations management; Computer network; Engineering","score_opus":0.0571982485782732,"score_gpt":0.3558061633112891,"score_spread":0.2986079147330159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790139429","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020158706,0.97730887,0.019628985,0.000031951316,0.00019534647,0.0015656922,0.000017663853,0.00013993162,0.0010914213],"genre_scores_gemma":[0.000021142492,0.95732,0.041934688,0.00009915822,0.00011223859,0.00025985,0.000088429086,0.00008065424,0.000083848216],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985242,0.0001005941,0.0006503456,0.00032305619,0.00012501016,0.0002767867],"domain_scores_gemma":[0.99942344,0.00008731948,0.00012186026,0.0002906862,0.000019549327,0.000057139652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009153085,0.00030599633,0.0008791791,0.00013962164,0.000057139074,0.00002249705,0.00015713561,0.00015018789,0.000023065031],"category_scores_gemma":[0.000034325156,0.00029284952,0.00015007782,0.00029057352,0.000015113782,0.00006382218,0.000027683838,0.00022450792,0.000017197388],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013284517,0.000012445678,0.000007288517,0.05418668,0.000062295345,0.0000037225236,0.000038892744,0.0006274876,5.150026e-8,0.0001423215,0.00007166468,0.9448458],"study_design_scores_gemma":[0.00048751276,0.000033429907,0.000031730713,0.11917492,0.0005830718,0.0000053651183,0.00000877541,0.034670524,0.0000012004394,0.00002802314,0.8444609,0.0005145367],"about_ca_topic_score_codex":0.0000024340568,"about_ca_topic_score_gemma":0.0000015212205,"teacher_disagreement_score":0.9443313,"about_ca_system_score_codex":0.0001403716,"about_ca_system_score_gemma":0.000009525098,"threshold_uncertainty_score":0.9999524},"labels":[],"label_agreement":null},{"id":"W2790986720","doi":"10.1155/2018/9848104","title":"Robust Solution Approach for the Dynamic and Stochastic Vehicle Routing Problem","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"A priori and a posteriori; Mathematical optimization; Computer science; Vehicle routing problem; Stochastic programming; Robustness (evolution); Routing (electronic design automation); Robust optimization; Benchmark (surveying); Control reconfiguration; Set (abstract data type); Operations research; Mathematics","score_opus":0.017370511382564416,"score_gpt":0.2563082079329629,"score_spread":0.23893769655039848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790986720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08681093,0.00022827776,0.9124328,0.00006367261,0.00018272,0.00021849456,0.000004064058,0.00003919332,0.000019856398],"genre_scores_gemma":[0.61509734,0.000022994593,0.38476408,0.0000072000093,0.000075543205,0.0000062083755,0.0000048973257,0.0000163842,0.00000537922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992876,0.000017600867,0.00035329972,0.000080597514,0.00012326257,0.00013765236],"domain_scores_gemma":[0.9994071,0.00012095911,0.00016881124,0.000063581574,0.00020261084,0.000036896094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045600728,0.000088428846,0.0001252876,0.00005819069,0.0001325455,0.00002114363,0.00006993559,0.00004369949,0.0000018204723],"category_scores_gemma":[0.000037818598,0.00007057341,0.00004563549,0.00014229378,0.000042058786,0.00027958959,0.0000011611556,0.0001267277,1.8414862e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041904248,0.0000082897905,0.000059003436,0.000041035135,0.000025603524,1.8910531e-7,0.0010863629,0.9722789,0.006652131,0.00008770769,0.0000057061206,0.01971319],"study_design_scores_gemma":[0.0007328971,0.00010420395,0.010810409,0.000044172608,0.00007407231,0.0000087173,0.00042260555,0.9870761,0.00040859566,0.00020468884,0.000028070182,0.000085478416],"about_ca_topic_score_codex":8.667622e-7,"about_ca_topic_score_gemma":0.0000075216026,"teacher_disagreement_score":0.5282864,"about_ca_system_score_codex":0.000044103526,"about_ca_system_score_gemma":0.000014765528,"threshold_uncertainty_score":0.28779003},"labels":[],"label_agreement":null},{"id":"W2794584159","doi":"10.1016/j.trc.2018.03.012","title":"Robust supply vessel routing and scheduling","year":2018,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"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":"Robustness (evolution); Schedule; Computer science; Scheduling (production processes); Operations research; Supply chain; Metaheuristic; Engineering; Operations management; Business","score_opus":0.08231002441420703,"score_gpt":0.3483272193273699,"score_spread":0.26601719491316284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794584159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82387435,0.0005808261,0.1677361,0.0011821126,0.00021028268,0.00031161483,0.000014131826,0.0053094747,0.0007811227],"genre_scores_gemma":[0.8543421,0.0006022152,0.1448295,0.0000069356897,0.00006339777,0.000050897648,0.00001709115,0.000044847457,0.000042988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982861,0.000067468376,0.0003495971,0.00033140066,0.00038066672,0.00058475084],"domain_scores_gemma":[0.99911684,0.00019398073,0.00003675068,0.0003184811,0.0002773312,0.000056647656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012810192,0.00016823759,0.000181959,0.00044799532,0.0004212881,0.00008376897,0.00027682754,0.00018672681,0.000050315484],"category_scores_gemma":[0.00038338793,0.00017996844,0.000029698962,0.0010627073,0.00046666595,0.00026173942,0.000026120684,0.000548862,0.00002372573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006422133,0.00008490378,0.12709048,0.0007166465,0.00024577053,0.00005492474,0.008102687,0.59283227,0.03735464,0.040242806,0.0055433707,0.18766725],"study_design_scores_gemma":[0.000816053,0.00017245917,0.018663121,0.0004733916,0.000031487107,0.000004558073,0.0112031875,0.86106545,0.09041022,0.0037692254,0.012611008,0.0007798432],"about_ca_topic_score_codex":0.000028204058,"about_ca_topic_score_gemma":0.000046269586,"teacher_disagreement_score":0.26823315,"about_ca_system_score_codex":0.00004447854,"about_ca_system_score_gemma":0.000024336472,"threshold_uncertainty_score":0.73389},"labels":[],"label_agreement":null},{"id":"W2794851298","doi":"","title":"The Senior Transportation Problem.","year":2017,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Vehicle Routing Optimization Methods","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":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.11009375435604372,"score_gpt":0.35990514637520304,"score_spread":0.2498113920191593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794851298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017379947,0.000045974815,0.85881394,0.0059251683,0.0014018201,0.0006011537,0.00006454895,0.00054078124,0.11522668],"genre_scores_gemma":[0.990215,0.00005333866,0.009266945,0.000047891448,0.00011755123,0.000034994733,0.000010127053,0.000016338874,0.00023779226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988993,0.000037182574,0.0003022961,0.0001646662,0.00041368234,0.00018291066],"domain_scores_gemma":[0.99902,0.0001923927,0.00009493575,0.0002482222,0.0003934113,0.00005102796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059607043,0.00011732247,0.0000876664,0.00004570976,0.00079520594,0.00040179727,0.00042821057,0.000069176676,0.0001012298],"category_scores_gemma":[0.0003716687,0.00009746928,0.00004083261,0.00007388052,0.00013670177,0.00019121003,0.000007997607,0.00019516292,0.00018804792],"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.000016406635,0.00001575316,0.00006019935,0.0000068892214,0.000012612841,0.0000010180331,0.00017997998,0.14660613,0.0013902675,0.6522621,0.0001907657,0.19925787],"study_design_scores_gemma":[0.000027358286,0.000028501532,0.0029566342,0.000034026223,0.0000060824,9.189176e-7,0.00012220374,0.80054975,0.03145903,0.1626777,0.0019221996,0.0002156243],"about_ca_topic_score_codex":0.000012035927,"about_ca_topic_score_gemma":0.00014422681,"teacher_disagreement_score":0.97283506,"about_ca_system_score_codex":0.00005599802,"about_ca_system_score_gemma":0.00006832177,"threshold_uncertainty_score":0.6116162},"labels":[],"label_agreement":null},{"id":"W2800758442","doi":"10.1093/forsci/fxy001","title":"Identifying Key Factors for the Success of a Regional Logistic Center","year":2018,"lang":"en","type":"article","venue":"Forest Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Center (category theory); Key (lock); Logistic regression; Geography; Medicine; Biology; Ecology","score_opus":0.09065658436735671,"score_gpt":0.34740818640079074,"score_spread":0.25675160203343406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800758442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22981657,0.000017710749,0.76933616,0.000032650267,0.00043611895,0.00009773486,0.000005065924,0.000046932408,0.00021107128],"genre_scores_gemma":[0.96976954,0.0000031082636,0.030098435,0.000016898919,0.0000636406,0.000006045199,0.0000012021334,0.000008390744,0.000032755146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993474,0.000009114849,0.0001282434,0.00011850684,0.000202924,0.00019384988],"domain_scores_gemma":[0.9993576,0.00024898862,0.000038290957,0.00018537763,0.00013454101,0.00003521066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052614615,0.000058609094,0.00006342641,0.00006751551,0.00019923421,0.00005085244,0.0004269307,0.00001918844,0.000014687808],"category_scores_gemma":[0.0004019255,0.00004065949,0.000028702778,0.00039823775,0.0006003611,0.00017156462,0.00004478306,0.000039723873,0.0000037163416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011091687,0.000022088685,0.10139798,0.00008534167,0.000017465316,3.5520955e-7,0.0028367732,0.84441876,0.0053434055,0.044124775,0.00077576225,0.0009661889],"study_design_scores_gemma":[0.00012429722,0.000023324286,0.051705446,0.000030872205,0.0000063895377,0.0000020027796,0.00009433104,0.94247043,0.0035186785,0.0015395614,0.0004036699,0.00008101253],"about_ca_topic_score_codex":0.000015270296,"about_ca_topic_score_gemma":0.000025165382,"teacher_disagreement_score":0.7399529,"about_ca_system_score_codex":0.000029204553,"about_ca_system_score_gemma":0.000028130056,"threshold_uncertainty_score":0.22120555},"labels":[],"label_agreement":null},{"id":"W2800829962","doi":"10.1016/j.cor.2018.05.004","title":"A decomposition heuristic for a rich production routing problem","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Solver; Mathematical optimization; Heuristic; Computer science; Benchmark (surveying); Routing (electronic design automation); Vehicle routing problem; Context (archaeology); Set (abstract data type); Production (economics); Decomposition; Mathematics","score_opus":0.06507195492111406,"score_gpt":0.4036858702288438,"score_spread":0.3386139153077297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800829962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081920065,0.000033083325,0.91507596,0.0004907204,0.00051970064,0.0009517749,0.0000045757097,0.00036720457,0.00063691847],"genre_scores_gemma":[0.5411187,0.000006520031,0.45788804,0.000013588131,0.0005984603,0.00017303911,0.00003179715,0.000031923624,0.00013798357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850965,0.00023055592,0.0002790477,0.00030996784,0.0002635331,0.00040723922],"domain_scores_gemma":[0.9984893,0.00020097001,0.000011071516,0.0002865459,0.0009315759,0.0000805308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599487,0.00011516297,0.0001243168,0.0003092271,0.0008220711,0.00027221325,0.00020188796,0.0000680927,0.000018293353],"category_scores_gemma":[0.00031761895,0.00012551268,0.000032990367,0.0008222785,0.00010226981,0.00023917235,0.00006524573,0.00022795005,0.000064044565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012371261,0.000045567027,0.00006763251,0.00007338877,0.00003031334,6.59816e-7,0.0016083341,0.96003777,0.013784524,0.001784112,0.005148753,0.017406592],"study_design_scores_gemma":[0.0002200995,0.000098800025,0.00016844216,0.00006237124,0.0000061261744,0.000011497132,0.00006978892,0.98898566,0.009380079,0.00018745773,0.0006750005,0.00013470664],"about_ca_topic_score_codex":0.000012464202,"about_ca_topic_score_gemma":0.000026764827,"teacher_disagreement_score":0.4591986,"about_ca_system_score_codex":0.00019960871,"about_ca_system_score_gemma":0.000066875546,"threshold_uncertainty_score":0.632279},"labels":[],"label_agreement":null},{"id":"W2801518913","doi":"10.1007/978-3-319-91641-5_6","title":"Collaborative Agent Teams (CAT): From the Paradigm to Implementation Guidelines","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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é Laval","funders":"","keywords":"Computer science; Key (lock); Representation (politics); Solver; Problem solver; Architecture; Multi-agent system; Software engineering; Distributed computing; Theoretical computer science; Artificial intelligence; Programming language; Computer security","score_opus":0.027408213938519277,"score_gpt":0.3262787265091211,"score_spread":0.2988705125706018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801518913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065729296,0.00019217441,0.9948963,0.001185515,0.0019079784,0.00051260355,0.00005152011,0.00015012639,0.00044650913],"genre_scores_gemma":[0.007690176,0.000051433504,0.98829806,0.0023714337,0.0014033995,0.000019688765,0.000033148197,0.000058159356,0.00007448175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981729,0.000040538118,0.00045961616,0.00054712564,0.0004655333,0.0003143246],"domain_scores_gemma":[0.99852794,0.00040281372,0.00010531436,0.0005837771,0.00029073362,0.00008941072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422835,0.000313543,0.00026149553,0.00017734445,0.00016675981,0.00023936194,0.0008273734,0.00013481277,0.00017179918],"category_scores_gemma":[0.00013083566,0.00024517963,0.0000432914,0.0004988066,0.00019203952,0.0001229465,0.00023142261,0.00021123745,0.00006229709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022650108,0.000001866064,0.00004744084,0.000004677372,0.000015513544,0.0000025875772,0.0025369895,0.747088,0.00018032266,0.0002126538,0.0012918082,0.24861586],"study_design_scores_gemma":[0.00021435719,0.000079701385,0.0002479008,0.00022429737,0.000020992884,0.000003183617,0.0000062767103,0.95364416,0.003985222,0.020286338,0.020711156,0.00057639723],"about_ca_topic_score_codex":0.00005052919,"about_ca_topic_score_gemma":0.0003348078,"teacher_disagreement_score":0.24803947,"about_ca_system_score_codex":0.00032855297,"about_ca_system_score_gemma":0.00019584196,"threshold_uncertainty_score":0.99981356},"labels":[],"label_agreement":null},{"id":"W2806899243","doi":"10.1007/978-3-319-93031-2_35","title":"The WeightedCircuitsLmax Constraint","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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é Laval","funders":"","keywords":"Travelling salesman problem; Constraint (computer-aided design); Computer science; Mathematical optimization; Relaxation (psychology); Bounded function; Graph; Constraint satisfaction problem; Bottleneck traveling salesman problem; 2-opt; Mathematics; Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.01652795363498932,"score_gpt":0.24617602208944842,"score_spread":0.2296480684544591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806899243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004076785,0.000497211,0.98036945,0.00012342096,0.0021110708,0.0001799897,0.0000037926832,0.00025127162,0.016423022],"genre_scores_gemma":[0.063526705,0.0003245294,0.9322005,0.0006844629,0.0020065866,0.00001125563,0.00000647497,0.00016533234,0.001074166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836946,0.000022270799,0.00032388454,0.00044476663,0.00041704817,0.00042260071],"domain_scores_gemma":[0.9984531,0.00060780393,0.00007354375,0.0006392086,0.0001423428,0.00008399933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092560507,0.00029345512,0.00023233212,0.00020693142,0.0002529521,0.00025150226,0.00095840776,0.00022360303,0.000095189695],"category_scores_gemma":[0.00011250397,0.00022385994,0.000060878992,0.0002482123,0.0011529528,0.000085073276,0.00017331801,0.000567962,0.00006912896],"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":[7.6829195e-7,0.0000016410349,0.000009100033,0.000015067286,0.000010576165,0.000008818489,0.00026335704,0.30809507,0.000075518044,0.0032491572,0.00007446306,0.6881965],"study_design_scores_gemma":[0.00009013611,0.000028185475,0.000020823258,0.00015158723,0.0000061737132,0.000037614962,1.3802718e-7,0.94009817,0.0011005715,0.047605228,0.010506074,0.00035531697],"about_ca_topic_score_codex":0.0000011543443,"about_ca_topic_score_gemma":0.000013530843,"teacher_disagreement_score":0.6878412,"about_ca_system_score_codex":0.00019893763,"about_ca_system_score_gemma":0.00014021137,"threshold_uncertainty_score":0.91287434},"labels":[],"label_agreement":null},{"id":"W2807082804","doi":"10.1007/s10732-018-9374-0","title":"On the empirical scaling of running time for finding optimal solutions to the TSP","year":2018,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"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 British Columbia","funders":"Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS","keywords":"Scaling; Mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.10556523700704039,"score_gpt":0.35214306271432305,"score_spread":0.24657782570728265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807082804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13909146,0.000041761545,0.85887873,0.0009439143,0.0004867526,0.00010323291,0.000008847078,0.000019374866,0.00042589026],"genre_scores_gemma":[0.73605525,0.0000055515166,0.26292127,0.00015302894,0.00075026276,0.0000020738803,5.2423655e-7,0.0000304409,0.00008159082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990671,0.000056692796,0.0004313585,0.000053907785,0.00020112739,0.00018980933],"domain_scores_gemma":[0.99824274,0.0011194462,0.00015710005,0.0001467777,0.0002786471,0.00005530383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015479459,0.000083404055,0.0001592727,0.0000859161,0.00021865217,0.000028837769,0.00024227942,0.00004566414,0.000041051142],"category_scores_gemma":[0.001907059,0.00005139566,0.000091961236,0.00020671262,0.000047528563,0.000032927423,0.000035064622,0.00022052969,0.00001219308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025783735,0.000015309639,0.00009196034,0.000011746741,0.000045216148,7.732977e-7,0.0009679201,0.97045124,0.0011750436,0.0005986149,0.026062002,0.00055439846],"study_design_scores_gemma":[0.00017729211,0.00020783901,0.00039930808,0.00011338289,0.000055782268,0.000020781976,0.00013924504,0.99077,0.0026844847,0.00022165396,0.00512764,0.00008260639],"about_ca_topic_score_codex":3.1742812e-7,"about_ca_topic_score_gemma":1.747981e-7,"teacher_disagreement_score":0.5969638,"about_ca_system_score_codex":0.000051902723,"about_ca_system_score_gemma":0.000033527,"threshold_uncertainty_score":0.22830655},"labels":[],"label_agreement":null},{"id":"W2807264637","doi":"10.1007/978-3-319-93031-2_30","title":"Modelling and Solving the Senior Transportation Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"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 Toronto","funders":"","keywords":"Computer science; Mathematical optimization; Decomposition; Integer programming; Heuristic; Transportation theory; Routing (electronic design automation); Operations research; Profit (economics); Heuristics; Constraint (computer-aided design); Artificial intelligence; Algorithm; Mathematics","score_opus":0.017596636783663223,"score_gpt":0.2364923174511141,"score_spread":0.21889568066745088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807264637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006202804,0.00024708096,0.99764925,0.00007614066,0.00035222445,0.00020191514,0.0000026659413,0.00014079154,0.0007096214],"genre_scores_gemma":[0.08198825,0.000061191065,0.9174689,0.00009928516,0.00026531768,0.0000035538935,0.0000033192862,0.000042226016,0.000067928784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988883,0.000012333307,0.00024213013,0.00036521073,0.0002586752,0.00023333126],"domain_scores_gemma":[0.9993548,0.00020437149,0.00005826921,0.00025902942,0.00008043158,0.000043147145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059667806,0.0002103796,0.00017421258,0.00016269696,0.00014859244,0.00014348754,0.0003156932,0.0001457708,0.000015042684],"category_scores_gemma":[0.000010875087,0.0001673666,0.000029707706,0.00016135532,0.0002706918,0.00014101868,0.000032484862,0.00036047658,0.0000033449485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.4858256e-7,7.087838e-7,0.000010059939,0.000031991225,0.000003423728,0.0000016432936,0.0014949793,0.93879795,0.000039585197,0.00020290956,0.0000026322793,0.059413448],"study_design_scores_gemma":[0.000056083078,0.000013494402,0.000009820994,0.00017451096,0.000008157005,0.000006329652,2.707077e-7,0.98323655,0.00037579887,0.015725665,0.00020106928,0.00019225215],"about_ca_topic_score_codex":0.000005878057,"about_ca_topic_score_gemma":0.000021697255,"teacher_disagreement_score":0.08136798,"about_ca_system_score_codex":0.00006215492,"about_ca_system_score_gemma":0.00004288276,"threshold_uncertainty_score":0.68250114},"labels":[],"label_agreement":null},{"id":"W2808768722","doi":"10.1002/net.21826","title":"Integer programming formulations for minimum deficiency interval coloring","year":2018,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Office of Naval Research; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; Edge coloring; Interval graph; Fractional coloring; Integer programming; Greedy coloring; Vertex (graph theory); Graph; Line graph; Pathwidth; Graph power; Algorithm","score_opus":0.025214227599909756,"score_gpt":0.2909210732592273,"score_spread":0.2657068456593175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808768722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024462225,0.000087173576,0.97144806,0.0000198289,0.00094267115,0.00030190212,0.0000012865966,0.00047775282,0.0022591122],"genre_scores_gemma":[0.7474984,0.000003264417,0.25176013,0.000026996173,0.0005209414,0.00006579557,0.0000077769655,0.0000357818,0.00008093702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920434,0.000017570977,0.00023108287,0.00014684281,0.000064351094,0.00033583134],"domain_scores_gemma":[0.9995027,0.0001461709,0.000032706914,0.00015699888,0.000106628635,0.000054759035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000333952,0.00011231879,0.00011921675,0.000058314945,0.00014191064,0.000059014932,0.00012547542,0.000098775876,0.000026589792],"category_scores_gemma":[0.00009260086,0.000117978845,0.000059233294,0.00026250363,0.000040233233,0.00011983548,0.000031818923,0.00012022606,0.000008701224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000972532,0.000013156656,0.000860994,0.000025575056,0.000015752194,2.6871473e-7,0.00040579826,0.89263535,0.00007659318,0.0013666993,0.0009893796,0.10360072],"study_design_scores_gemma":[0.00019190316,0.000065669854,0.00022849496,0.000033896737,0.000014010986,0.000002223129,0.00003933954,0.99202514,0.00017748469,0.00013812809,0.006950328,0.00013339816],"about_ca_topic_score_codex":0.0000014357067,"about_ca_topic_score_gemma":0.000009779154,"teacher_disagreement_score":0.72303617,"about_ca_system_score_codex":0.000058660786,"about_ca_system_score_gemma":0.000008686264,"threshold_uncertainty_score":0.48110378},"labels":[],"label_agreement":null},{"id":"W2809160987","doi":"10.1002/net.21827","title":"A two‐phase Pareto local search heuristic for the bi‐objective pollution‐routing problem","year":2018,"lang":"en","type":"article","venue":"Networks","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Pareto principle; Heuristic; Mathematical optimization; Routing (electronic design automation); Pollution; Phase (matter); Pareto optimal; Computer science; Multi-objective optimization; Mathematics; Chemistry; Ecology; Biology","score_opus":0.022229289596827535,"score_gpt":0.31266925528611006,"score_spread":0.29043996568928254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809160987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023619218,0.00028421244,0.99402946,0.00012025194,0.00052430754,0.0006237248,0.000010153498,0.0004054279,0.001640538],"genre_scores_gemma":[0.9386949,0.000017666018,0.05961876,0.00012894133,0.0012924235,0.00009173841,0.0000094610705,0.0000662261,0.000079919104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986828,0.00012231269,0.00027034426,0.00023379155,0.00016023831,0.00053048733],"domain_scores_gemma":[0.9988475,0.00055338966,0.000041503143,0.00028855068,0.00018220286,0.00008684617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010432269,0.00017278445,0.00017116181,0.000054091295,0.00040017007,0.00007788992,0.00021551232,0.000109313,0.000035943332],"category_scores_gemma":[0.00011715459,0.00014217547,0.00007126835,0.0004771687,0.00016476554,0.00007260724,0.00005826471,0.00030799006,0.000017226042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033257023,0.00001390425,0.00007914421,0.00001387997,0.00004951382,8.744956e-7,0.00048651246,0.93878925,0.000031949476,0.0009123056,0.00121601,0.058373384],"study_design_scores_gemma":[0.00093313557,0.00010037379,0.00017192852,0.000044494314,0.000037373913,0.000007737585,0.00023483367,0.9969859,0.00024341825,0.00018445206,0.00088748493,0.00016883615],"about_ca_topic_score_codex":0.000031791704,"about_ca_topic_score_gemma":0.000032222695,"teacher_disagreement_score":0.93633294,"about_ca_system_score_codex":0.00013544236,"about_ca_system_score_gemma":0.000037417914,"threshold_uncertainty_score":0.57977474},"labels":[],"label_agreement":null},{"id":"W28167682","doi":"10.1184/r1/6705596","title":"Flexible Milk-Runs for Stochastic Vehicle Routing","year":2018,"lang":"en","type":"article","venue":"Journal of Cell 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":"Booth University College","funders":"","keywords":"Vehicle routing problem; Robustness (evolution); Mathematical optimization; Computer science; Routing (electronic design automation); Key (lock); Column generation; Stochastic programming; Set (abstract data type); Operations research; Engineering; Mathematics; Computer network; Computer security","score_opus":0.02149614779217763,"score_gpt":0.29220186188904357,"score_spread":0.27070571409686595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28167682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16783217,0.00005020161,0.82899344,0.000054335094,0.0007707066,0.000064189066,7.929151e-7,0.000045158456,0.0021889932],"genre_scores_gemma":[0.7978029,0.0000027431843,0.20170847,0.000034551096,0.0003092033,7.2205773e-7,5.1681884e-8,0.000012793318,0.00012852951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989468,0.000016711758,0.00031717488,0.00010004251,0.00031693158,0.0003023284],"domain_scores_gemma":[0.9990523,0.0001428462,0.00014191851,0.00012341863,0.00040589646,0.00013361793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019227546,0.00007906955,0.00013244044,0.00016533224,0.00020281615,0.000084311585,0.00038659654,0.00003163646,0.000024737805],"category_scores_gemma":[0.00038569464,0.00007128841,0.000053455788,0.0005773688,0.00017670752,0.0003656589,0.000029793102,0.00011931394,0.000010762554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012371293,0.00001813015,0.00010227589,0.000020551432,0.0000052217056,0.0000011465592,0.0007198192,0.50689363,0.48622733,0.00018593928,0.00045792936,0.0053556617],"study_design_scores_gemma":[0.000328165,0.0001374169,0.00030331532,0.0000357451,0.00001114163,0.000017438726,0.000087514636,0.7347671,0.26352084,0.00023490869,0.000457812,0.00009863099],"about_ca_topic_score_codex":7.7092824e-7,"about_ca_topic_score_gemma":4.148312e-7,"teacher_disagreement_score":0.6299708,"about_ca_system_score_codex":0.000093455914,"about_ca_system_score_gemma":0.00012350842,"threshold_uncertainty_score":0.29070568},"labels":[],"label_agreement":null},{"id":"W2883994353","doi":"10.1016/j.cor.2018.07.012","title":"The green mixed fleet vehicle routing problem with partial battery recharging and time windows","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":180,"is_retracted":false,"has_abstract":false,"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":"Vehicle routing problem; Computer science; Battery (electricity); Heuristic; Routing (electronic design automation); Automotive engineering; Set (abstract data type); Electric vehicle; Mathematical optimization; Computer network; Engineering; Mathematics; Artificial intelligence","score_opus":0.03899741903171219,"score_gpt":0.31642982938420966,"score_spread":0.2774324103524975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883994353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3244306,0.000121576355,0.66874325,0.002941015,0.00024044019,0.0009185484,0.000006057302,0.00047406665,0.0021244178],"genre_scores_gemma":[0.81513727,0.000023024708,0.18329339,0.00006586605,0.0005530437,0.00008337942,0.000012684551,0.00006817077,0.00076317886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981188,0.0004912192,0.0002479602,0.00027957142,0.00034923587,0.0005131907],"domain_scores_gemma":[0.99871725,0.00047378134,0.000013219085,0.00035534814,0.00032337374,0.00011704985],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002144519,0.00013744019,0.00013521446,0.00013445012,0.0014205591,0.0005758553,0.00029164774,0.00006256992,0.000024406141],"category_scores_gemma":[0.00008282862,0.00010579166,0.000018953451,0.00058842055,0.00028093762,0.00025489647,0.00018565546,0.0003831287,0.00008882641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048913033,0.000034351735,0.0014179214,0.00004737382,0.00013597263,0.000011102635,0.0043558935,0.87258613,0.015571358,0.0015838344,0.0045649465,0.09964218],"study_design_scores_gemma":[0.00031374735,0.00009944688,0.0004180217,0.00006091483,0.000004916207,0.000013538546,0.00009409266,0.99305326,0.0037172057,0.000026980635,0.0020587877,0.00013906743],"about_ca_topic_score_codex":0.000054575896,"about_ca_topic_score_gemma":0.000059396883,"teacher_disagreement_score":0.49070665,"about_ca_system_score_codex":0.00008196265,"about_ca_system_score_gemma":0.000066277506,"threshold_uncertainty_score":0.9998795},"labels":[],"label_agreement":null},{"id":"W2884232159","doi":"10.1177/0361198118786620","title":"Fuel Consumption Optimization Model for the Multi-Period Inventory Routing Problem","year":2018,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","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":"Polytechnique Montréal","funders":"","keywords":"Fuel efficiency; Variable (mathematics); Consumption (sociology); Integer programming; Routing (electronic design automation); Computer science; Operations research; Environmental science; Automotive engineering; Engineering; Mathematics","score_opus":0.15659592623825086,"score_gpt":0.40161239244870445,"score_spread":0.2450164662104536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884232159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12273585,0.0003042089,0.8731226,0.001254382,0.00062747323,0.0017328573,0.00005488676,0.00010358977,0.00006416257],"genre_scores_gemma":[0.77005005,0.0010267345,0.2276397,0.00004245212,0.00035421658,0.00021494304,0.000023236269,0.00012564151,0.00052299147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944205,0.0008123874,0.0014428507,0.0003511625,0.0020849041,0.00088815717],"domain_scores_gemma":[0.99353176,0.0010067587,0.0003649663,0.000497143,0.0043390216,0.0002603364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077068764,0.00027470096,0.00036369648,0.00065444753,0.0010978199,0.00021634626,0.001050248,0.00023374152,0.00013926106],"category_scores_gemma":[0.00033708036,0.00019875144,0.00033459175,0.0014319567,0.0007742386,0.00068358297,0.000008468554,0.0015797066,0.000012570608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037764412,0.000079759026,0.023136452,0.0003179304,0.00014411539,0.000003820556,0.0055732764,0.9637911,0.0010990382,0.00094696385,0.001663271,0.002866631],"study_design_scores_gemma":[0.0016628867,0.0002075106,0.03319503,0.00025367565,0.00007494182,6.598975e-7,0.00086530106,0.9610441,0.000529567,0.0006260114,0.0013322278,0.00020809271],"about_ca_topic_score_codex":0.0003927924,"about_ca_topic_score_gemma":0.0064244624,"teacher_disagreement_score":0.64731425,"about_ca_system_score_codex":0.0003298032,"about_ca_system_score_gemma":0.0003901354,"threshold_uncertainty_score":0.84436536},"labels":[],"label_agreement":null},{"id":"W2884929083","doi":"10.1016/j.ijpe.2018.07.016","title":"Electric vehicle routing problem with recharging stations for minimizing energy consumption","year":2018,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":269,"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 Manitoba; McMaster University","funders":"","keywords":"Energy consumption; Computer science; Heuristics; Vehicle routing problem; Greenhouse gas; Electric vehicle; Routing (electronic design automation); Mathematical optimization; Automotive engineering; Engineering; Computer network; Electrical engineering; Mathematics; Power (physics)","score_opus":0.021965773158420066,"score_gpt":0.26770347160931873,"score_spread":0.24573769845089866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884929083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33007592,0.00005318186,0.6668308,0.0006532966,0.0018599433,0.000104706254,0.000005746265,0.000071556846,0.00034485591],"genre_scores_gemma":[0.80142105,0.00017866935,0.19669154,0.000051556042,0.0015276589,0.000009379679,0.0000075535754,0.000036900008,0.00007569872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906486,0.00003239587,0.00050756667,0.00013963676,0.00010397143,0.00015157936],"domain_scores_gemma":[0.9986015,0.00008728175,0.00037118263,0.000084978485,0.00080825423,0.000046795223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061248225,0.00010553442,0.000139644,0.00031514483,0.00009022273,0.000088188506,0.00016731741,0.000044864235,0.00002325493],"category_scores_gemma":[0.00010919845,0.00011044244,0.000051300496,0.00010864527,0.000030646304,0.00054561277,0.000011324747,0.000108479726,0.000003407634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002326361,0.000051734,0.00225053,0.000025573194,0.00043966548,0.0000015250715,0.0008071134,0.8722615,0.02727402,0.005869238,0.0007332739,0.09005314],"study_design_scores_gemma":[0.0014621282,0.00026575668,0.00079842884,0.00014673149,0.00007291567,0.0003891559,0.0002129124,0.8023887,0.1839803,0.0016125547,0.008321089,0.00034931314],"about_ca_topic_score_codex":0.0000024785454,"about_ca_topic_score_gemma":0.000007940756,"teacher_disagreement_score":0.47134513,"about_ca_system_score_codex":0.00031423144,"about_ca_system_score_gemma":0.00007094244,"threshold_uncertainty_score":0.4503712},"labels":[],"label_agreement":null},{"id":"W2884960304","doi":"10.1016/j.omega.2018.07.006","title":"Solving a large multi-product production-routing problem with delivery time windows","year":2018,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":93,"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":"Computer science; Supply chain; Production (economics); Sizing; Vendor; Routing (electronic design automation); Product (mathematics); Integer programming; Mathematical optimization; Set (abstract data type); Vehicle routing problem; Lead time; Operations research; Linear programming; Operations management; Engineering; Mathematics; Algorithm; Economics; Business","score_opus":0.014760608332868318,"score_gpt":0.24134078328042902,"score_spread":0.2265801749475607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884960304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5362799,0.0003286129,0.4428637,0.0003273559,0.0010987686,0.0012735242,0.000015441597,0.003517572,0.014295078],"genre_scores_gemma":[0.6225517,0.0000061269966,0.37503225,0.000032516662,0.00059008313,0.000023608989,0.000007841531,0.00008542148,0.0016704644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985801,0.00006686198,0.00026304304,0.0003991388,0.00019806577,0.0004927883],"domain_scores_gemma":[0.9991997,0.000036600286,0.0000670272,0.00040985315,0.00020471752,0.000082084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006935456,0.00021855354,0.00020904552,0.00012563611,0.0002523358,0.00007447279,0.00016332921,0.00006388128,0.00010100721],"category_scores_gemma":[0.00016603046,0.00020585713,0.000036641457,0.0005390398,0.00006221889,0.0003197072,0.000057852172,0.0002118505,0.00027377735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012696772,0.00039550717,0.03184726,0.0005679199,0.00056456204,0.00003803367,0.010799431,0.69405603,0.20486271,0.00034096223,0.009459732,0.04694088],"study_design_scores_gemma":[0.0011352501,0.000101567515,0.0025698303,0.00023946808,0.000058074682,0.00007293356,0.00014767364,0.94812524,0.03919373,0.000017504846,0.0076129804,0.00072573806],"about_ca_topic_score_codex":0.000008360392,"about_ca_topic_score_gemma":0.000015468,"teacher_disagreement_score":0.2540692,"about_ca_system_score_codex":0.00008970789,"about_ca_system_score_gemma":0.000037291473,"threshold_uncertainty_score":0.83946097},"labels":[],"label_agreement":null},{"id":"W2885484731","doi":"10.1287/ijoc.2020.0974","title":"Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Orientation (vector space); Vehicle routing problem; Computer science; Window (computing); Routing (electronic design automation); Artificial intelligence; Mathematics; Geometry; Computer network","score_opus":0.03841780626790474,"score_gpt":0.2893322890560845,"score_spread":0.25091448278817974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885484731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6292662,0.000059402355,0.35958627,0.0011845905,0.0003430974,0.0003380666,0.0000014083495,0.00031197025,0.008908983],"genre_scores_gemma":[0.9624518,0.0000043515765,0.035791747,0.0012933555,0.00041556294,0.0000016502481,0.0000033355343,0.000032843647,0.000005357971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998167,0.00014300161,0.00068930915,0.00013646756,0.00048051486,0.00038371317],"domain_scores_gemma":[0.99915177,0.00033581574,0.00022462572,0.00011518822,0.000058160695,0.00011445295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017789304,0.00018507015,0.00020701323,0.00012755323,0.00028500817,0.00039621265,0.0003108072,0.00007490633,0.000022159582],"category_scores_gemma":[0.00024176134,0.00013943667,0.00007150686,0.00064691156,0.000017380855,0.00040093705,0.000049754308,0.0008765535,0.000052984065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010304262,0.00001163596,0.0026056357,0.000025910764,0.000017136688,0.000020147403,0.0046576066,0.9121389,0.00095403596,0.00016190138,0.00015479025,0.079242],"study_design_scores_gemma":[0.0007017332,0.00008469751,0.0034662485,0.0002550153,0.000008719074,0.00006246907,0.00073160906,0.99302346,0.0010126869,0.000077147306,0.0003819049,0.00019432568],"about_ca_topic_score_codex":0.000001632976,"about_ca_topic_score_gemma":1.6140912e-7,"teacher_disagreement_score":0.33318558,"about_ca_system_score_codex":0.00018799958,"about_ca_system_score_gemma":0.000035560373,"threshold_uncertainty_score":0.5686062},"labels":[],"label_agreement":null},{"id":"W2885599890","doi":"10.1061/9780784481288.047","title":"Reaction Time Optimization Based on Sensor Data-Driven Simulation for Snow Removal Projects","year":2018,"lang":"en","type":"article","venue":"Construction Research Congress 2018","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":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Truck; Snow; Computer science; Global Positioning System; Snow removal; Real-time computing; Software; Real-time data; Environmental science; Track (disk drive); Simulation; Meteorology; Automotive engineering; Engineering","score_opus":0.11514414012687699,"score_gpt":0.39234901595416,"score_spread":0.27720487582728304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885599890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077311597,0.000012471089,0.9791189,0.00023595664,0.002137596,0.0019550736,0.00017199712,0.0008911426,0.007745721],"genre_scores_gemma":[0.18260445,0.000023648794,0.8132225,0.00005586706,0.0017473268,0.0001470141,0.0009312493,0.00017182679,0.001096089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974166,0.00044729217,0.000402079,0.00058273703,0.0006578598,0.0004934419],"domain_scores_gemma":[0.9962363,0.001164896,0.00011137926,0.00094961654,0.0014000317,0.00013777599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019031496,0.00021184882,0.00022428588,0.0007804142,0.0004730814,0.00018269994,0.0003398779,0.00023723894,0.00018925103],"category_scores_gemma":[0.002799243,0.00022903834,0.000048832553,0.0009286287,0.0004352364,0.00054579397,0.00007511571,0.00031315975,0.0001604526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002483192,0.000025038256,0.000069344744,0.00005290169,0.00003157249,0.0000020239108,0.000038194677,0.97299343,0.0029955595,0.00008885134,0.004317966,0.019136803],"study_design_scores_gemma":[0.001297311,0.0001927085,0.000054247466,0.00010770693,0.000019173993,0.000014121627,0.000058491212,0.98599565,0.001715569,0.00003167429,0.010285676,0.00022765575],"about_ca_topic_score_codex":0.0000073097135,"about_ca_topic_score_gemma":0.000003089947,"teacher_disagreement_score":0.17487329,"about_ca_system_score_codex":0.0002858809,"about_ca_system_score_gemma":0.0001569353,"threshold_uncertainty_score":0.93399125},"labels":[],"label_agreement":null},{"id":"W2887647726","doi":"10.1007/978-3-319-95104-1_16","title":"Solving the Home Health Care Problem with Temporal Precedence and Synchronization","year":2018,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"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 à Chicoutimi","funders":"","keywords":"Heuristic; Task (project management); Computer science; Synchronization (alternating current); Home health; Routing (electronic design automation); Term (time); Health care; Operations research; Artificial intelligence; Engineering; Computer network; Economics","score_opus":0.046888362037004916,"score_gpt":0.33125520669338737,"score_spread":0.28436684465638246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887647726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009447155,0.023013558,0.9629697,0.00027926735,0.0003864763,0.0007851281,0.000026296131,0.0002176032,0.012227463],"genre_scores_gemma":[0.3403322,0.00617179,0.647471,0.00026786624,0.0004678653,0.000100463665,0.00013369753,0.00021869123,0.004836411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986845,0.00004607922,0.00044420944,0.0003261116,0.00029369473,0.00020535858],"domain_scores_gemma":[0.9987714,0.00046839679,0.0001608791,0.00015704494,0.00040426123,0.000038010407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003580967,0.00028283845,0.0003204025,0.00012422986,0.00022169219,0.000048283706,0.00017964827,0.00008647796,0.000024843348],"category_scores_gemma":[0.000045786488,0.0002229224,0.000023764038,0.00012291767,0.00044263463,0.000094042494,0.00012077749,0.0003073566,0.000009893395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005166106,0.000002248315,0.00015535766,0.0004766595,0.000087075794,0.0000026518876,0.00963892,0.96681905,4.3338165e-8,0.007315987,0.000316867,0.015179971],"study_design_scores_gemma":[0.00019404881,0.00038731386,0.00020657707,0.0044962955,0.000050296858,0.000078837904,0.004755714,0.92018545,0.000011842978,0.0657901,0.0028142824,0.0010292196],"about_ca_topic_score_codex":0.000007363218,"about_ca_topic_score_gemma":0.00013250977,"teacher_disagreement_score":0.34023774,"about_ca_system_score_codex":0.00036905636,"about_ca_system_score_gemma":0.000120410965,"threshold_uncertainty_score":0.9090512},"labels":[],"label_agreement":null},{"id":"W2888546274","doi":"10.1016/j.ijpe.2018.08.020","title":"Trade-offs between environmental and economic performance in production and inventory-routing problems","year":2018,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Production (economics); Sustainability; Environmental economics; Time horizon; Routing (electronic design automation); Computer science; Business; Operations research; Economics; Microeconomics; Marketing; Engineering","score_opus":0.01708886336193741,"score_gpt":0.23533347463246637,"score_spread":0.21824461127052897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888546274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965706,0.00007308049,0.00049751904,0.00065138005,0.0020147655,0.00008688285,0.0000031267032,0.000017557646,0.000085129024],"genre_scores_gemma":[0.9930039,0.0008612601,0.00428039,0.000010918227,0.00179464,0.0000018528787,0.0000025816653,0.00001939984,0.000025036543],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99916977,0.000028845801,0.0004821895,0.00015697155,0.00005948704,0.00010271263],"domain_scores_gemma":[0.9996448,0.000014737104,0.0002086628,0.000066745706,0.000020230156,0.00004482124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068836904,0.00009777247,0.00014171,0.00022651447,0.000041358686,0.00004638172,0.00009851759,0.000047494887,0.000013781513],"category_scores_gemma":[0.00004663753,0.00011268319,0.00002052851,0.00002401563,0.00008813712,0.0006717659,0.000027901606,0.00015825251,0.000004245629],"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.00003716455,0.000028030085,0.6881686,0.000030047479,0.0001484503,8.9855155e-7,0.0021366535,0.2447993,0.0035113215,0.000087883775,0.00007832356,0.060973328],"study_design_scores_gemma":[0.0013818655,0.00026927772,0.6325253,0.00025877764,0.00005389979,0.0010520376,0.0005774013,0.321158,0.035980757,0.00070846925,0.005438929,0.00059526105],"about_ca_topic_score_codex":0.0000023572438,"about_ca_topic_score_gemma":0.000008514349,"teacher_disagreement_score":0.076358706,"about_ca_system_score_codex":0.00033262212,"about_ca_system_score_gemma":0.000019527313,"threshold_uncertainty_score":0.45950872},"labels":[],"label_agreement":null},{"id":"W2889549077","doi":"10.1287/trsc.2018.0878","title":"Exact Branch-Price-and-Cut Algorithms for Vehicle Routing","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Algorithm; Branch and cut; Routing (electronic design automation); Integer programming; Computer network","score_opus":0.021958453004788953,"score_gpt":0.29102438433255134,"score_spread":0.2690659313277624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889549077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56138843,0.0000242705,0.43727723,0.000037750688,0.00021605706,0.00021095037,0.000008652578,0.00019362618,0.0006430741],"genre_scores_gemma":[0.9079348,0.000010681769,0.091849394,0.00004596908,0.000025045143,0.000013103817,0.000007002567,0.000018963538,0.00009502947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899924,0.000009507057,0.00022579826,0.00025345443,0.00024189649,0.00027013104],"domain_scores_gemma":[0.9995153,0.00011177485,0.0000411796,0.000150334,0.0000979399,0.00008347368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079315586,0.00009871759,0.000120530785,0.00010181972,0.00012100001,0.00006256688,0.00015682979,0.000039199287,0.000039641134],"category_scores_gemma":[0.000040136012,0.0001040732,0.000030342391,0.00054250227,0.000072077244,0.0004892006,0.0000027479064,0.00007218026,0.000017966377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000135941245,0.000017790531,0.034945615,0.00017992796,0.000014374301,9.000586e-7,0.0041712387,0.71048164,0.18506522,0.005010577,0.00002795046,0.060071137],"study_design_scores_gemma":[0.0004877829,0.000024023471,0.10193949,0.000023254692,0.000008820417,9.835547e-7,0.000101539874,0.8708438,0.025797123,0.0002436206,0.00033719366,0.00019236014],"about_ca_topic_score_codex":0.0000072790885,"about_ca_topic_score_gemma":0.0000036286096,"teacher_disagreement_score":0.3465464,"about_ca_system_score_codex":0.000034920286,"about_ca_system_score_gemma":0.000036221976,"threshold_uncertainty_score":0.4243982},"labels":[],"label_agreement":null},{"id":"W2890582430","doi":"10.1016/j.ifacol.2018.08.478","title":"A Fix-and-Optimize Variable Neighborhood Search for the Biomedical Sample Transportation Problem","year":2018,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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é Laval; HEC Montréal; Université du Québec à Montréal; Transport Canada","funders":"","keywords":"Computer science; Vehicle routing problem; Variable neighborhood search; Sample (material); Decomposition; Cluster analysis; Medical diagnosis; Variable (mathematics); Linear programming; Closing (real estate); Mathematical optimization; Duration (music); Quality (philosophy); Routing (electronic design automation); Operations research; Metaheuristic; Mathematics; Machine learning; Artificial intelligence; Algorithm; Medicine","score_opus":0.019341752699110114,"score_gpt":0.27599475139191176,"score_spread":0.25665299869280167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890582430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004804423,0.00016818482,0.99204385,0.0012734171,0.00023163029,0.00053280493,0.00028209266,0.00032065934,0.00034293355],"genre_scores_gemma":[0.025792276,0.0000669164,0.97301996,0.00018066807,0.00047641757,0.00007483775,0.00020606368,0.00005858478,0.00012425765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988366,0.00004300128,0.0002890969,0.00024714292,0.00021547225,0.0003686968],"domain_scores_gemma":[0.9987311,0.00077954034,0.000032367083,0.00021814898,0.00012214019,0.00011673754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389811,0.00017482568,0.00019551598,0.0000668226,0.00021568107,0.00005344006,0.00017765035,0.0001344514,0.00025046186],"category_scores_gemma":[0.0001297088,0.00013511584,0.000055237808,0.0003635683,0.00013070324,0.00010796761,0.000012495806,0.00018167202,0.000008649648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044982063,0.00043105317,0.003602835,0.0011699772,0.0010115695,0.000006960011,0.015291,0.65401226,0.040163513,0.016042173,0.00069372007,0.2671251],"study_design_scores_gemma":[0.0010113936,0.00013437917,0.0005434639,0.000033536646,0.000068549285,0.000004161575,0.00020044876,0.9921846,0.0009135117,0.00024717292,0.0044629993,0.00019580532],"about_ca_topic_score_codex":0.00006378984,"about_ca_topic_score_gemma":0.00002221292,"teacher_disagreement_score":0.3381723,"about_ca_system_score_codex":0.00003706889,"about_ca_system_score_gemma":0.000049159662,"threshold_uncertainty_score":0.5509864},"labels":[],"label_agreement":null},{"id":"W2891416252","doi":"10.1007/978-981-13-0860-4_19","title":"Ant Colony Algorithm for Routing Alternate Fuel Vehicles in Multi-depot Vehicle Routing Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Asset analytics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"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 Manitoba","funders":"","keywords":"Vehicle routing problem; Ant colony optimization algorithms; Mathematical optimization; Constraint (computer-aided design); Ant colony; Routing (electronic design automation); Metaheuristic; Engineering; Operations research; Computer science; Mathematics; Computer network","score_opus":0.041872811536891326,"score_gpt":0.2958504325081746,"score_spread":0.2539776209712833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891416252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014006008,0.0006022798,0.95061153,0.0001017666,0.0010037299,0.0017200778,0.00040955644,0.0011216055,0.043028835],"genre_scores_gemma":[0.0321421,0.00040145783,0.91476303,0.00013090589,0.00096090784,0.00006116477,0.00031697168,0.00070610904,0.05051732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968417,0.00005452236,0.0012105014,0.000677839,0.0003964684,0.000818946],"domain_scores_gemma":[0.9981058,0.00042133802,0.00043755936,0.00054758147,0.0003175703,0.00017014857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013650683,0.0006852837,0.0008977813,0.0004045391,0.00013619023,0.0001844143,0.00048950885,0.0006756359,0.000055950957],"category_scores_gemma":[0.00016492218,0.00079412636,0.00026284275,0.00018525746,0.00009287678,0.00017917021,0.00017316737,0.00076619675,0.00006533578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075125245,0.00029909253,0.00632483,0.002436094,0.0027399203,0.0004101564,0.004422325,0.7445863,0.002017139,0.014007703,0.005960294,0.21672101],"study_design_scores_gemma":[0.0010748446,0.00007143159,0.00010348915,0.0005303188,0.00017859311,0.000011910063,0.00004717168,0.9893197,0.00031501983,0.001818399,0.005686957,0.00084218284],"about_ca_topic_score_codex":0.000044654513,"about_ca_topic_score_gemma":0.00015749905,"teacher_disagreement_score":0.24473338,"about_ca_system_score_codex":0.00050682545,"about_ca_system_score_gemma":0.00010180291,"threshold_uncertainty_score":0.999451},"labels":[],"label_agreement":null},{"id":"W2893812993","doi":"10.1155/2019/9063232","title":"Optimization of Base Location and Patrol Routes for Unmanned Aerial Vehicles in Border Intelligence, Surveillance, and Reconnaissance","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Heuristic; Base station; Integer programming; Computer science; Base (topology); Drone; Military Base; Routing (electronic design automation); Location model; Real-time computing; Operations research; Artificial intelligence; Engineering; Algorithm; Computer network; Mathematics","score_opus":0.009330241177657544,"score_gpt":0.26348460247772265,"score_spread":0.2541543613000651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893812993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55581623,0.00033246138,0.44345585,0.00002840915,0.00016430994,0.0001784909,0.000007598293,0.000010323763,0.0000063473244],"genre_scores_gemma":[0.82446676,0.00057144795,0.17488787,0.000006112514,0.00002686807,0.0000047041317,0.000016211974,0.00001660716,0.0000034160057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911475,0.000032470423,0.00056343153,0.00009901531,0.00009529885,0.0000950105],"domain_scores_gemma":[0.99923795,0.00016375993,0.00025292614,0.000058567348,0.00025333097,0.000033445278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040802942,0.00009405974,0.00023875124,0.00016718969,0.000015366368,0.000010709474,0.00004128724,0.000059669914,0.0000065972404],"category_scores_gemma":[0.00007577681,0.000098574434,0.000026579271,0.00023091534,0.000022026048,0.00041488057,9.70212e-7,0.00007854055,7.9328906e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001967691,0.000013104633,0.017562585,0.00021450047,0.000012377041,3.720496e-7,0.00053679233,0.9648327,0.0035669054,0.0000966569,0.0000014781024,0.012965711],"study_design_scores_gemma":[0.0025357082,0.00028551213,0.17344631,0.000318682,0.00002774353,0.0000043902105,0.0006127825,0.8122604,0.009771553,0.0004763263,0.000047262754,0.00021331933],"about_ca_topic_score_codex":0.0000023859307,"about_ca_topic_score_gemma":0.000021397955,"teacher_disagreement_score":0.26865053,"about_ca_system_score_codex":0.000021825283,"about_ca_system_score_gemma":0.000019389203,"threshold_uncertainty_score":0.4019749},"labels":[],"label_agreement":null},{"id":"W2894610790","doi":"10.1287/ijoc.2017.0800","title":"The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Lagrangian relaxation; Routing (electronic design automation); Limit (mathematics); Exploit; Integer programming; Branch and cut; Generalization; Computer science; Integer (computer science); Relaxation (psychology); Mathematics","score_opus":0.02495445842993473,"score_gpt":0.24189110339968825,"score_spread":0.2169366449697535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894610790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33247018,0.00006586409,0.6628857,0.00013170956,0.00020379995,0.0001532563,2.910865e-7,0.00020950173,0.00387968],"genre_scores_gemma":[0.84112155,0.000009121259,0.15833569,0.000044372566,0.0004433515,9.2133524e-7,0.0000011221798,0.000028726143,0.000015172756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871093,0.000046381625,0.000465384,0.00011428586,0.00026391514,0.00039913226],"domain_scores_gemma":[0.9991769,0.000246641,0.00023104074,0.00011888968,0.00013878857,0.000087737964],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017282107,0.00016723962,0.00013713734,0.00008656252,0.0014235408,0.00042206465,0.00013418238,0.00006504234,0.0000020842551],"category_scores_gemma":[0.00012759706,0.00010752072,0.000031617863,0.00024968715,0.0000610578,0.00046803607,0.000050940118,0.00042654926,0.0000054664056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000291721,0.0000059410922,0.0035769723,0.000023565975,0.00004703731,0.00000142265,0.002213722,0.638467,0.0002831048,0.0020617577,0.00003916234,0.3532511],"study_design_scores_gemma":[0.00041983873,0.00014668475,0.0024007757,0.00015515312,0.000008673291,0.000109981476,0.0003103251,0.99437475,0.0011033465,0.00023881982,0.00056642375,0.00016525177],"about_ca_topic_score_codex":0.000002605373,"about_ca_topic_score_gemma":0.00000344601,"teacher_disagreement_score":0.5086514,"about_ca_system_score_codex":0.00011769069,"about_ca_system_score_gemma":0.000025661562,"threshold_uncertainty_score":0.9998765},"labels":[],"label_agreement":null},{"id":"W2896787456","doi":"10.2139/ssrn.3179994","title":"Data-Driven Order Assignment for Last Mile Delivery","year":2018,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"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 Toronto","funders":"","keywords":"Mile; Order (exchange); Last mile (transportation); Computer science; Geography; Business","score_opus":0.022994081824839502,"score_gpt":0.28264060656855844,"score_spread":0.25964652474371896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896787456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01701165,0.0005707507,0.98082536,0.00012706732,0.00046206574,0.00014491688,0.000025032188,0.00013993483,0.00069320307],"genre_scores_gemma":[0.70915073,0.0018606343,0.28488165,0.00015520923,0.0023852347,0.000020343734,0.000084140585,0.00016153038,0.0013005158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979442,0.000055165703,0.00025029894,0.00017759699,0.00016838718,0.0014043506],"domain_scores_gemma":[0.9993285,0.0000743056,0.000060604856,0.00031006607,0.00015336522,0.000073160605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013601729,0.00013782855,0.00014485375,0.00007952903,0.00018891892,0.00005855838,0.00043834271,0.00007099174,0.00006508183],"category_scores_gemma":[0.00010164779,0.00013464018,0.00004257697,0.00017298022,0.000032997938,0.00022903022,0.00006123621,0.0006150715,0.00004330633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018444068,0.00021216496,0.0020093261,0.00009307426,0.002000276,0.0000064189417,0.00075656717,0.5938228,0.016186606,0.025387093,0.028738575,0.3306027],"study_design_scores_gemma":[0.0010853639,0.00031603995,0.00008664454,0.000025662972,0.00007480395,0.00015000023,0.00033363653,0.94249564,0.00065317884,0.0060575684,0.0483979,0.00032354202],"about_ca_topic_score_codex":0.0000029441971,"about_ca_topic_score_gemma":0.00018135246,"teacher_disagreement_score":0.6959437,"about_ca_system_score_codex":0.0005572961,"about_ca_system_score_gemma":0.0004992596,"threshold_uncertainty_score":0.54904675},"labels":[],"label_agreement":null},{"id":"W2897824369","doi":"10.1016/j.dam.2018.08.026","title":"A comparison of integer programming models for the partial directed weighted improper coloring problem","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","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":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Knapsack problem; Vertex (graph theory); Integer programming; Integer (computer science); Upper and lower bounds; Discrete mathematics; Function (biology); Graph; Mathematical optimization; Computer science","score_opus":0.04151401789022738,"score_gpt":0.31289705484824093,"score_spread":0.2713830369580136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897824369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012757728,0.00004553766,0.9822264,0.000019981158,0.00014074669,0.0013306293,0.000008116832,0.0005060192,0.0029648833],"genre_scores_gemma":[0.49574792,0.0000026924554,0.5037665,0.000003896087,0.00006854611,0.0003229059,0.000006445837,0.00005279136,0.000028287193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875337,0.000013919739,0.0005591281,0.00016694181,0.00019347577,0.00031317762],"domain_scores_gemma":[0.9990195,0.00029841298,0.00015286217,0.0003304331,0.00015017993,0.000048612426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047310823,0.00019612833,0.00036051043,0.000049993698,0.00013694385,0.00005159518,0.00024735616,0.00009433174,0.000015475413],"category_scores_gemma":[0.0000426516,0.00013721059,0.00007183009,0.00027441198,0.000120146906,0.00006862789,0.00006275452,0.00013884726,0.000005172695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002312275,0.00037833303,0.000096694515,0.0036579343,0.0010235625,3.9060558e-7,0.066983484,0.5595915,0.095837176,0.18491654,0.001356211,0.08592697],"study_design_scores_gemma":[0.00032916767,0.000038997052,0.00000216492,0.000058343787,0.000089055255,6.001686e-7,0.0008004858,0.92663336,0.068907775,0.002398967,0.00057510455,0.00016595106],"about_ca_topic_score_codex":0.0000023768666,"about_ca_topic_score_gemma":0.0000027495782,"teacher_disagreement_score":0.4829902,"about_ca_system_score_codex":0.00003350941,"about_ca_system_score_gemma":0.000016899437,"threshold_uncertainty_score":0.5595285},"labels":[],"label_agreement":null},{"id":"W2898596225","doi":"10.1016/j.cor.2019.02.014","title":"Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":223,"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":"Queueing theory; Queue; Computer science; Routing (electronic design automation); Driving range; Mathematical optimization; Range (aeronautics); Vehicle routing problem; Electric vehicle; Real-time computing; Operations research; Computer network; Mathematics; Engineering","score_opus":0.025915186573026647,"score_gpt":0.3053319213757771,"score_spread":0.2794167348027504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898596225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6349245,0.00013174591,0.35142925,0.00048517226,0.0001325544,0.0012994222,0.000008947652,0.0008688053,0.010719652],"genre_scores_gemma":[0.8395916,0.000019699435,0.15595251,0.000030643412,0.000091052185,0.00007748371,0.000051364317,0.000093485105,0.004092123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747527,0.00042323433,0.0003595921,0.00041470295,0.00062685605,0.0007003626],"domain_scores_gemma":[0.9984662,0.0005128519,0.000023945864,0.00041893686,0.0004405675,0.00013750566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016739456,0.00019228233,0.00021502568,0.0004744199,0.00074892776,0.00039365244,0.0003342939,0.00008463378,0.00033813625],"category_scores_gemma":[0.000083806466,0.00019153538,0.000037903807,0.0013556703,0.00003736503,0.00039587988,0.00017975149,0.00058100035,0.0009533035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067479796,0.000020981463,0.0006798281,0.000034338096,0.000040467294,0.0000040938444,0.00073945033,0.9518307,0.040308658,0.0006799344,0.00052438513,0.005130447],"study_design_scores_gemma":[0.00043592777,0.00008416899,0.0001729758,0.00009556508,0.000006737724,0.000017270453,0.0001219363,0.98900694,0.009575532,0.00001826519,0.00023157372,0.0002331214],"about_ca_topic_score_codex":0.00003973213,"about_ca_topic_score_gemma":0.000019604357,"teacher_disagreement_score":0.2046672,"about_ca_system_score_codex":0.0005432068,"about_ca_system_score_gemma":0.00013519455,"threshold_uncertainty_score":0.9998246},"labels":[],"label_agreement":null},{"id":"W2898820646","doi":"10.1155/2018/3743710","title":"Reoptimization Heuristic for the Capacitated Vehicle Routing Problem","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Universidad del Bío-Bío; Universidad del Valle","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Routing (electronic design automation); Computer science; Context (archaeology); Time horizon; Metaheuristic; Algorithm; Mathematics","score_opus":0.013588291512896549,"score_gpt":0.2631056191549325,"score_spread":0.24951732764203596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898820646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10581042,0.000105256484,0.8930276,0.00011806836,0.00054148777,0.00023273946,0.0000072657754,0.00007493684,0.00008220315],"genre_scores_gemma":[0.6947489,0.000052184823,0.30491826,0.000022759481,0.00019787626,0.0000071281893,0.000009083107,0.000027995135,0.000015815063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902743,0.000028507317,0.000542787,0.00007860571,0.00016611924,0.00015654454],"domain_scores_gemma":[0.9988164,0.00023735562,0.00025846442,0.000092546594,0.00055319746,0.000042081847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003479,0.000102785445,0.000146432,0.000075942684,0.0001359636,0.000025442569,0.00010978904,0.000049014037,0.0000115645735],"category_scores_gemma":[0.00011866967,0.00008218232,0.00007240566,0.00028930858,0.000039487688,0.00032967376,7.7110076e-7,0.00013317363,0.0000013244722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059847982,0.000008675736,0.00018835462,0.000033246502,0.000036201563,8.907276e-7,0.002094331,0.9811001,0.0062163905,0.00019395971,0.00007350496,0.009994492],"study_design_scores_gemma":[0.0022092485,0.0003925133,0.021528613,0.00018729898,0.00021263663,0.000014340674,0.0011473842,0.95559853,0.015692748,0.0012962953,0.0014484033,0.0002719865],"about_ca_topic_score_codex":0.0000010587089,"about_ca_topic_score_gemma":0.000010117486,"teacher_disagreement_score":0.5889385,"about_ca_system_score_codex":0.000049089525,"about_ca_system_score_gemma":0.000025416999,"threshold_uncertainty_score":0.33512977},"labels":[],"label_agreement":null},{"id":"W2899109642","doi":"10.1155/2018/1904340","title":"A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ningbo University; National Natural Science Foundation of China","keywords":"Column generation; Scheduling (production processes); Integer programming; Job shop scheduling; Mathematical optimization; Computer science; Vehicle routing problem; Fleet management; Constraint programming; Engineering; Real-time computing; Routing (electronic design automation); Stochastic programming; Algorithm; Embedded system; Mathematics","score_opus":0.02364987430930877,"score_gpt":0.2664668767632441,"score_spread":0.24281700245393534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899109642","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11803778,0.00012241886,0.8812474,0.000039288247,0.00016893912,0.00028660317,0.000011302433,0.00007471277,0.000011562668],"genre_scores_gemma":[0.3967796,0.00004068794,0.6030481,0.000017847698,0.000064106986,0.000005676886,0.0000079347,0.000030295441,0.0000058067412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895936,0.000032656604,0.0005457443,0.00013335804,0.00014386866,0.00018501251],"domain_scores_gemma":[0.9990408,0.0001888913,0.00022515327,0.000077032135,0.00037643404,0.000091681984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004898125,0.00015020935,0.00025386925,0.00013068048,0.00009070121,0.000035937373,0.000060236056,0.00008933339,0.000016688862],"category_scores_gemma":[0.00012757284,0.00016325226,0.000059722475,0.00011395795,0.00008200642,0.0005212735,0.0000013731888,0.00013156778,8.679938e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009482033,0.0000109197435,0.000074024516,0.000052757543,0.000044584063,0.000003000788,0.0014622306,0.97098714,0.023292646,0.000034960864,0.000007015126,0.0039358777],"study_design_scores_gemma":[0.001469158,0.00011824987,0.00038987788,0.00013996426,0.0000738241,0.00002386436,0.00014447479,0.9907924,0.0064395284,0.00023385504,0.000009575578,0.00016523348],"about_ca_topic_score_codex":2.8927457e-7,"about_ca_topic_score_gemma":0.0000013094626,"teacher_disagreement_score":0.2787418,"about_ca_system_score_codex":0.0000656974,"about_ca_system_score_gemma":0.00005966084,"threshold_uncertainty_score":0.6657234},"labels":[],"label_agreement":null},{"id":"W2899182135","doi":"10.5267/j.ijiec.2018.6.003","title":"A mixed integer linear programming formulation for the vehicle routing problem with backhauls","year":2018,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Integer programming; Mathematical optimization; Linear programming; Mathematics; Integer (computer science); Computer science; Routing (electronic design automation); Computer network","score_opus":0.04464265567407138,"score_gpt":0.29323809542789636,"score_spread":0.24859543975382498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899182135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029353146,0.000025341747,0.9677071,0.00067126146,0.0017556906,0.00031707156,0.000008014926,0.0001250795,0.00003731929],"genre_scores_gemma":[0.738929,0.0000025123177,0.25914618,0.000017043036,0.0018313163,0.000015692292,0.000008378766,0.000038917962,0.00001097199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988066,0.00002616177,0.0005192869,0.00009960331,0.00034748434,0.0002008922],"domain_scores_gemma":[0.9978769,0.0006544142,0.0002242676,0.00009149034,0.0010870903,0.000065842294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006879057,0.00015205995,0.00016893234,0.00022789152,0.00011113553,0.00014414453,0.00033741968,0.00008925386,0.000008292741],"category_scores_gemma":[0.00043038206,0.00011629904,0.00009546364,0.00032919532,0.000027017297,0.00030827807,0.00002816895,0.00032442345,0.0000026022128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004656894,0.000015724143,0.00023186044,0.000005716347,0.00025944915,0.0000019807096,0.00035879685,0.9707519,0.00033066073,0.0012302365,0.00022693616,0.026540216],"study_design_scores_gemma":[0.0013217086,0.00015565647,0.00016285205,0.00019337887,0.000052097443,0.0000617981,0.00011174239,0.9905387,0.0012511387,0.000045092307,0.0059696618,0.00013614999],"about_ca_topic_score_codex":0.000004291573,"about_ca_topic_score_gemma":0.0000030762808,"teacher_disagreement_score":0.70957583,"about_ca_system_score_codex":0.0001572093,"about_ca_system_score_gemma":0.00008334155,"threshold_uncertainty_score":0.4742537},"labels":[],"label_agreement":null},{"id":"W2901773049","doi":"10.1287/ijoc.2018.0810","title":"A Joint Vehicle Routing and Speed Optimization Problem","year":2018,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"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; Solver; Computer science; Vehicle routing problem; Benchmark (surveying); Fuel efficiency; Optimization problem; Routing (electronic design automation); Convex function; Regular polygon; Algorithm; Mathematics; Engineering","score_opus":0.02059373518829806,"score_gpt":0.25878763751141537,"score_spread":0.23819390232311732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901773049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28955418,0.000028646866,0.70021623,0.00008971904,0.0004544612,0.00011749568,5.4558075e-7,0.00033730737,0.00920143],"genre_scores_gemma":[0.70955384,0.000015037441,0.28965122,0.0001726927,0.0005463061,2.6597368e-7,0.0000011220146,0.000035687164,0.000023874865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986427,0.00004021081,0.00058143114,0.0001289493,0.00023992942,0.00036678673],"domain_scores_gemma":[0.9992615,0.0000856478,0.00018968862,0.00012350958,0.0001847602,0.0001548659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011363561,0.00018212471,0.00020507918,0.00020135117,0.0004016013,0.0003247327,0.0001210333,0.00008637012,0.00004394962],"category_scores_gemma":[0.00016560113,0.00016257034,0.000048747537,0.00030452007,0.000049168062,0.00036802384,0.00006639698,0.00042532306,0.0000202731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006676734,0.0000060306234,0.0006867987,0.000016442506,0.00002252043,0.0000041612934,0.00081567286,0.9499421,0.00038651307,0.00018595286,0.000094972536,0.04783213],"study_design_scores_gemma":[0.00052951404,0.0001222767,0.0008638046,0.00019679399,0.000008036265,0.00019960687,0.000101132915,0.99597555,0.001394372,0.00009068886,0.00031555392,0.0002026873],"about_ca_topic_score_codex":0.0000021710011,"about_ca_topic_score_gemma":3.542132e-7,"teacher_disagreement_score":0.41999963,"about_ca_system_score_codex":0.000113004986,"about_ca_system_score_gemma":0.000024938014,"threshold_uncertainty_score":0.66294265},"labels":[],"label_agreement":null},{"id":"W2902620155","doi":"10.1007/978-1-4614-6940-7_12","title":"Variable Neighborhood Search","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":107,"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; Group for Research in Decision Analysis","funders":"","keywords":"Variable neighborhood search; Heuristics; Maxima and minima; Scheme (mathematics); Metaheuristic; Mathematical optimization; Variable (mathematics); Descent (aeronautics); Exploit; Local search (optimization); Decomposition; Computer science; Gradient descent; Mathematics; Algorithm; Artificial intelligence; Geography; Artificial neural network","score_opus":0.021530523238376058,"score_gpt":0.23671686916165446,"score_spread":0.2151863459232784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902620155","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.598805e-7,0.000116586794,0.3418443,0.000014247545,0.0002057016,0.00012704718,0.0000056689782,0.00059311214,0.657093],"genre_scores_gemma":[0.00008289562,0.0000664963,0.29392973,0.000048726793,0.00016654651,0.0000054342145,0.000021654607,0.00014281094,0.7055357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990835,0.000011146493,0.00024536252,0.00020570285,0.00020448717,0.00024979407],"domain_scores_gemma":[0.99930537,0.000085872205,0.000021552025,0.0003906537,0.0000921704,0.000104398736],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019007808,0.00025872534,0.00026562737,0.000121993275,0.000033845237,0.00006551361,0.00019024184,0.00038254962,0.030758368],"category_scores_gemma":[0.000013484711,0.00026233142,0.000059568185,0.000036346006,0.00001916196,0.00007744305,0.000058475805,0.00043623176,0.0031439145],"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":[5.213695e-7,0.0000023609155,0.0000027814453,0.00009215071,0.000092514456,0.0000023474595,0.000023134955,0.14752147,0.00006524684,0.82053465,0.018416228,0.013246617],"study_design_scores_gemma":[0.00020342966,0.000019599704,0.000005248194,0.00010462355,0.000042605305,0.000010101268,0.0000042284473,0.6788888,0.00018717133,0.024066078,0.29575992,0.0007081942],"about_ca_topic_score_codex":0.0000073870647,"about_ca_topic_score_gemma":3.426571e-7,"teacher_disagreement_score":0.79646856,"about_ca_system_score_codex":0.000079617465,"about_ca_system_score_gemma":0.000033135744,"threshold_uncertainty_score":0.9999829},"labels":[],"label_agreement":null},{"id":"W2902921897","doi":"10.1504/ijor.2019.10017910","title":"An integrated production and distribution problem with direct shipment: a case from Moroccan bottled-water market","year":2018,"lang":"en","type":"article","venue":"International Journal of Operational Research","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":"Université de Montréal","funders":"","keywords":"Bottled water; Production (economics); Context (archaeology); Product (mathematics); Vehicle routing problem; Routing (electronic design automation); Operations research; Computer science; Distribution (mathematics); Integer programming; Business; Operations management; Environmental science; Mathematics; Economics; Microeconomics; Environmental engineering; Algorithm","score_opus":0.03279020252808257,"score_gpt":0.35582834798141716,"score_spread":0.3230381454533346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902921897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93798757,0.00007491598,0.059148945,0.0010836092,0.00042068204,0.00020277704,0.00010784858,0.00004407213,0.00092958385],"genre_scores_gemma":[0.9620346,0.00005282914,0.036729313,0.000019296762,0.00086256175,0.000012581627,0.00012611624,0.000024020283,0.00013869852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979945,0.00032315074,0.0003727096,0.00019187725,0.00091546477,0.00020232137],"domain_scores_gemma":[0.99659646,0.0001301264,0.000052319774,0.00011432381,0.0029729868,0.00013381372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020941158,0.00012043018,0.00013429714,0.0002480714,0.00017249862,0.00033812554,0.00021723864,0.000061374565,0.0004083629],"category_scores_gemma":[0.00034845006,0.000085558124,0.00002303499,0.00015986392,0.0001642861,0.00076616026,0.00003817486,0.00036195244,0.000008026045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049352827,0.0010440329,0.02493881,0.00009079227,0.0024459579,0.0036746438,0.010336139,0.690893,0.15187691,0.0015257035,0.020092249,0.0881465],"study_design_scores_gemma":[0.0020249733,0.001260319,0.006873463,0.00051872403,0.000053048054,0.0063738488,0.0010879672,0.8226914,0.14273779,0.00090395927,0.014927075,0.0005474284],"about_ca_topic_score_codex":0.000107724954,"about_ca_topic_score_gemma":0.00012558517,"teacher_disagreement_score":0.13179843,"about_ca_system_score_codex":0.00030715665,"about_ca_system_score_gemma":0.000120427,"threshold_uncertainty_score":0.4471287},"labels":[],"label_agreement":null},{"id":"W2903252607","doi":"10.1016/j.ejor.2019.10.007","title":"A branch-and-cut algorithm for an assembly routing problem","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"HEC Montréal","keywords":"Branch and cut; Linear programming relaxation; Integer programming; Context (archaeology); Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Linear programming; Algorithm; Production planning; Production (economics); Relaxation (psychology); Computer science; Lagrangian relaxation; Product (mathematics); Integer (computer science); Column generation; Mathematics; Programming language","score_opus":0.07423329463476477,"score_gpt":0.37031368853167523,"score_spread":0.29608039389691043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903252607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21934956,0.00018593096,0.76665366,0.00033121268,0.00023339265,0.00042181928,0.000009880107,0.00004680479,0.012767733],"genre_scores_gemma":[0.60007864,0.000030309879,0.39886507,0.000034634842,0.0004203713,0.0000025973525,0.0000058803257,0.00005561412,0.00050688884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979395,0.00072163576,0.00041664197,0.000133304,0.0005272799,0.0002615913],"domain_scores_gemma":[0.9984779,0.00036982246,0.0000545675,0.000116901356,0.00083275465,0.00014809007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008672445,0.00009305306,0.0001523479,0.00020876812,0.00014824305,0.00024260934,0.00023404683,0.000024268413,0.00004914904],"category_scores_gemma":[0.0003118375,0.000084641884,0.000045688757,0.00019392927,0.000029789808,0.00046372597,0.000045653276,0.00041823325,0.00003505148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006817467,0.00009248377,0.0011545483,0.00012431304,0.00014353573,0.000030581457,0.0018016087,0.50728595,0.07545591,0.0037081789,0.0025275545,0.40760717],"study_design_scores_gemma":[0.0011348429,0.0005950927,0.0026433435,0.000102285834,0.0000062426166,0.00012811413,0.0001402566,0.9876724,0.0023239625,0.00012025572,0.0049790093,0.00015421366],"about_ca_topic_score_codex":9.3719547e-7,"about_ca_topic_score_gemma":4.2887916e-7,"teacher_disagreement_score":0.48038644,"about_ca_system_score_codex":0.00006058115,"about_ca_system_score_gemma":0.00009616907,"threshold_uncertainty_score":0.3451596},"labels":[],"label_agreement":null},{"id":"W2905319009","doi":"10.1111/itor.12620","title":"The electric vehicle routing problem with shared charging stations","year":2018,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Benchmark (surveying); Heuristic; Mathematical optimization; Computer science; Routing (electronic design automation); Electric vehicle; Integer (computer science); Mathematics; Computer network; Power (physics)","score_opus":0.0507784722135999,"score_gpt":0.3735352907591384,"score_spread":0.3227568185455385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905319009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04981425,0.000102393366,0.90213585,0.0057647726,0.0005442376,0.00080015184,0.000046295165,0.00031054663,0.040481485],"genre_scores_gemma":[0.9684985,0.00008949765,0.029189015,0.000038538823,0.00022712593,0.00026601017,0.000023901042,0.000039721308,0.0016276613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979249,0.00019830727,0.00034624615,0.00024109922,0.000873055,0.00041635238],"domain_scores_gemma":[0.9979547,0.0008139899,0.000022824506,0.00017689753,0.0009674845,0.00006409422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017519529,0.0001201359,0.00008575459,0.00042196194,0.00090455316,0.00040327202,0.00039379488,0.000059774302,0.00051785907],"category_scores_gemma":[0.00017353115,0.000098970384,0.000029466071,0.0012461088,0.00015014323,0.000484926,0.000012636248,0.0005840566,0.00008770134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000986162,0.00010033227,0.0019348911,0.000012514625,0.00013781333,0.000006312071,0.0017469779,0.9366022,0.010049783,0.019330833,0.00042106304,0.029558685],"study_design_scores_gemma":[0.00044664793,0.000055187043,0.003332715,0.000046271172,0.0000029698608,0.0000147281935,0.00029213098,0.9860609,0.003530798,0.000491436,0.0055892216,0.00013697219],"about_ca_topic_score_codex":0.000073545656,"about_ca_topic_score_gemma":0.00044524253,"teacher_disagreement_score":0.9186843,"about_ca_system_score_codex":0.00045354548,"about_ca_system_score_gemma":0.00020912172,"threshold_uncertainty_score":0.6957183},"labels":[],"label_agreement":null},{"id":"W2907244310","doi":"10.1080/24725854.2018.1552820","title":"Integrated order allocation and order routing problem for e-order fulfillment","year":2019,"lang":"en","type":"article","venue":"IISE Transactions","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":"University of Windsor","funders":"Shanghai Education Development Foundation; Shanghai Municipal Education Commission; National Natural Science Foundation of China","keywords":"Order (exchange); Solver; Computer science; Order fulfillment; Mathematical optimization; Routing (electronic design automation); Integer programming; Heuristic; Benchmarking; Quality (philosophy); Operations research; Supply chain; Engineering; Mathematics; Economics; Business; Marketing; Algorithm; Artificial intelligence; Computer network","score_opus":0.0124421512583515,"score_gpt":0.24792089944327028,"score_spread":0.2354787481849188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907244310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022246705,0.00006041286,0.9745751,0.0003228685,0.00024942978,0.0007617658,0.000019512823,0.0004561112,0.0013081016],"genre_scores_gemma":[0.4975543,0.000045987093,0.5008608,0.00005455978,0.000027453689,0.00015574563,0.00003342699,0.00006763072,0.0012000585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991073,0.000036476376,0.00027333022,0.00022796083,0.00010569217,0.000249238],"domain_scores_gemma":[0.9993609,0.0001108452,0.000034002125,0.00015126949,0.00027421853,0.0000687377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024398474,0.0001719968,0.00016923925,0.00010818167,0.00012475818,0.000058481004,0.00006779598,0.00010884006,0.00029131037],"category_scores_gemma":[0.000029171473,0.00017615293,0.000036299258,0.00055873435,0.000019187359,0.00020406595,0.0000030433926,0.00016812034,0.000024707502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013522788,0.000037393922,0.00012411895,0.00011065435,0.00008197626,1.5919082e-7,0.00079279835,0.9558523,0.009760336,0.00034014203,0.00007531691,0.032811258],"study_design_scores_gemma":[0.0008009517,0.000039740644,0.00017018763,0.00005169882,0.000062105246,0.0000062688646,0.0003314491,0.9891403,0.003243238,0.000088732275,0.0057995063,0.0002658535],"about_ca_topic_score_codex":0.000027835458,"about_ca_topic_score_gemma":0.000034992845,"teacher_disagreement_score":0.47530758,"about_ca_system_score_codex":0.00007747189,"about_ca_system_score_gemma":0.000047015164,"threshold_uncertainty_score":0.7183308},"labels":[],"label_agreement":null},{"id":"W2908756765","doi":"10.1155/2019/5364201","title":"A Hybrid Simulated Annealing Heuristic for Multistage Heterogeneous Fleet Scheduling with Fleet Sizing Decisions","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Sizing; Simulated annealing; Mathematical optimization; Scheduling (production processes); Integer programming; Heuristic; Vehicle routing problem; Computer science; Job shop scheduling; Routing (electronic design automation); Mathematics","score_opus":0.013350608733517962,"score_gpt":0.27466590032402344,"score_spread":0.2613152915905055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908756765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5240286,0.00017248224,0.47530037,0.000007683316,0.00022216968,0.0001865207,0.000019975007,0.000057064353,0.0000051205116],"genre_scores_gemma":[0.62046313,0.00004691095,0.3793448,0.000012367088,0.000043896613,0.0000023026037,0.000031120293,0.000049711667,0.000005806482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.00003383469,0.00070712285,0.00016025857,0.00025641016,0.00024362277],"domain_scores_gemma":[0.9985341,0.00054059207,0.00031054212,0.00014396435,0.00036388938,0.00010693634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036542144,0.00018659687,0.0003422565,0.0001848762,0.00008630956,0.00003494788,0.00011687143,0.000056389785,0.000012011612],"category_scores_gemma":[0.00014874326,0.00017648454,0.0001196341,0.00019179132,0.00001275373,0.00038182194,0.0000013757768,0.00025015607,0.0000019111283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024309586,0.000016932046,0.000626899,0.000084589934,0.00007198683,0.000035202887,0.00053545757,0.9788736,0.01465824,0.000012015691,0.0000011555975,0.0048407908],"study_design_scores_gemma":[0.003292834,0.0003016653,0.0021907636,0.00053666584,0.000119607575,0.000052044943,0.0003116958,0.9772502,0.015298684,0.00014391978,0.00020381255,0.00029808868],"about_ca_topic_score_codex":8.769355e-7,"about_ca_topic_score_gemma":0.0000046156138,"teacher_disagreement_score":0.0964345,"about_ca_system_score_codex":0.000089752495,"about_ca_system_score_gemma":0.000039874656,"threshold_uncertainty_score":0.71968305},"labels":[],"label_agreement":null},{"id":"W2911388047","doi":"10.1016/j.heliyon.2019.e01158","title":"Vehicle routing for a mid-day meal delivery distribution system","year":2019,"lang":"en","type":"article","venue":"Heliyon","topic":"Vehicle Routing Optimization Methods","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Food delivery; Meal; Routing (electronic design automation); Delivery system; Distribution (mathematics); Set (abstract data type); Transfer (computing); Food distribution; Computer science; Day to day; Business; Operations research; Transport engineering; Operations management; Engineering; Computer network; Mathematics; Marketing; Medicine; Food science; Operating system; Biology","score_opus":0.012508411937791631,"score_gpt":0.23666581191706032,"score_spread":0.2241573999792687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911388047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5102985,0.00041265614,0.48602065,0.000029284545,0.00086045754,0.00042168717,0.00006163455,0.00081859616,0.0010765167],"genre_scores_gemma":[0.98773044,0.000027008458,0.011763634,0.000019491878,0.0001604158,0.000034012708,0.000079634774,0.000049423477,0.00013592279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899894,0.00006785842,0.00028257316,0.00019207997,0.00015128728,0.0003072859],"domain_scores_gemma":[0.99940985,0.00017321127,0.000051978524,0.00021824453,0.00008443655,0.00006226354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067936274,0.0001358493,0.00018317328,0.0000392072,0.00007692406,0.000051149305,0.00011872893,0.00011430839,0.000018008255],"category_scores_gemma":[0.00008058236,0.00014804897,0.000076560056,0.00017034897,0.000007941666,0.00012708305,0.00002740867,0.00010644968,0.0001379169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005236823,0.000031650154,0.007863443,0.0038116206,0.00009603543,0.000004086917,0.0006948285,0.83943737,0.1272073,0.0038209364,0.0005548176,0.016425584],"study_design_scores_gemma":[0.0006998574,0.000036396097,0.0019194246,0.000388734,0.000025068826,0.000005304551,0.00020271605,0.96218187,0.030954642,0.00000612429,0.0033316659,0.00024818972],"about_ca_topic_score_codex":0.00000424588,"about_ca_topic_score_gemma":0.0000013336919,"teacher_disagreement_score":0.47743195,"about_ca_system_score_codex":0.00024857526,"about_ca_system_score_gemma":0.000015363312,"threshold_uncertainty_score":0.60372615},"labels":[],"label_agreement":null},{"id":"W2912438787","doi":"10.1016/j.tre.2019.01.008","title":"Reliable single-allocation hub location problem with disruptions","year":2019,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Heuristic; Mathematical optimization; Pareto principle; Operations research; Pareto optimal; Facility location problem; Natural disaster; Location-allocation; Multi-objective optimization; Engineering; Mathematics; Geography","score_opus":0.0698358171683551,"score_gpt":0.34064801630546465,"score_spread":0.2708121991371095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912438787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064153336,0.024868732,0.89360213,0.002098982,0.0003896857,0.0069217826,0.0003416168,0.001241098,0.006382631],"genre_scores_gemma":[0.92401856,0.037531953,0.034936685,0.00015520756,0.000049525486,0.00040753325,0.0022766006,0.0000977463,0.00052616565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9976728,0.000108486114,0.00072912086,0.0004235184,0.00065503665,0.00041102682],"domain_scores_gemma":[0.9983548,0.00017631259,0.000114352464,0.0003389494,0.0008414827,0.0001741057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001046806,0.00024646983,0.0003638027,0.00018575213,0.00016895193,0.00006961125,0.00013776914,0.00011764103,0.000247232],"category_scores_gemma":[0.000031140415,0.00022980337,0.00004896841,0.0012472569,0.00013610222,0.0003335655,0.0000013056556,0.00037347968,0.00007232688],"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.00007713863,0.0002901454,0.03259848,0.025111184,0.00017410661,0.0000213191,0.0010566744,0.8609143,0.0011884937,0.06041834,0.0021464282,0.016003381],"study_design_scores_gemma":[0.007599035,0.0024830746,0.39041576,0.034900934,0.0017039625,0.000022587757,0.0014605427,0.16692007,0.0026825191,0.0058467435,0.38131398,0.004650795],"about_ca_topic_score_codex":0.00005994831,"about_ca_topic_score_gemma":0.0003955624,"teacher_disagreement_score":0.85986525,"about_ca_system_score_codex":0.00006478514,"about_ca_system_score_gemma":0.00008244367,"threshold_uncertainty_score":0.93711096},"labels":[],"label_agreement":null},{"id":"W2912451127","doi":"10.1109/access.2019.2894681","title":"Brainstorming-Based Ant Colony Optimization for Vehicle Routing With Soft Time Windows","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":42,"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 Windsor","funders":"Natural Science Foundation of Hubei Province; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Ant colony optimization algorithms; Brainstorming; Simulated annealing; Computer science; Vehicle routing problem; Metaheuristic; Convergence (economics); Mathematical optimization; Ant colony; Routing (electronic design automation); Algorithm; Artificial intelligence; Mathematics","score_opus":0.014646939018490589,"score_gpt":0.26544929526132355,"score_spread":0.250802356242833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912451127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26380715,0.000015124621,0.73397434,0.00005118402,0.0003039435,0.00066526193,0.000011458961,0.00051783974,0.0006536602],"genre_scores_gemma":[0.86858016,0.0000012574491,0.13056809,0.00023826816,0.00013820866,0.00007017272,0.00003613319,0.00011777317,0.00024993328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988334,0.00004766118,0.00027489424,0.00028238233,0.00019627661,0.0003653643],"domain_scores_gemma":[0.99906087,0.00030678185,0.00010338144,0.00030694652,0.00014251182,0.00007951432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040327225,0.00020688721,0.00025648135,0.000118861804,0.000105252715,0.00016750557,0.00032254553,0.0001166254,0.00012690936],"category_scores_gemma":[0.00007640341,0.00020426522,0.00005389749,0.00037748218,0.000023629475,0.0005100495,0.000021874086,0.0001290451,0.000037503163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004262657,0.00001761721,0.003767295,0.00008523498,0.000025635387,0.0000012778121,0.00009670702,0.9909571,0.0031781902,0.000008318849,0.00026841086,0.0015515945],"study_design_scores_gemma":[0.0013547763,0.00007413942,0.00030937995,0.00007436461,0.000023838918,0.0000020981124,0.000010516504,0.9844454,0.013043906,0.0000063652815,0.00036099507,0.0002942344],"about_ca_topic_score_codex":0.000010734654,"about_ca_topic_score_gemma":0.000003750582,"teacher_disagreement_score":0.604773,"about_ca_system_score_codex":0.00012170449,"about_ca_system_score_gemma":0.000066821856,"threshold_uncertainty_score":0.83296937},"labels":[],"label_agreement":null},{"id":"W2914448801","doi":"","title":"Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization","year":2010,"lang":"en","type":"article","venue":"Integer Programming and Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Integer programming; Computer science; Combinatorial optimization; Integer (computer science); Mathematical optimization; Theoretical computer science; Mathematics; Programming language; Algorithm","score_opus":0.01127464220673921,"score_gpt":0.2481053551520198,"score_spread":0.2368307129452806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914448801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24912153,0.00018559476,0.67118144,0.0020018837,0.05360679,0.0050727907,0.00003875739,0.002597201,0.016194033],"genre_scores_gemma":[0.86397547,0.00006125807,0.13529874,0.000023704424,0.00039696542,0.00009860334,0.000026536763,0.000075478645,0.00004326951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809563,0.00005520147,0.00059689773,0.00043363907,0.000474519,0.0003441285],"domain_scores_gemma":[0.9985021,0.000104290426,0.00027742842,0.00021565589,0.000763978,0.0001365717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006897151,0.00035951933,0.00034791618,0.0002044675,0.00023026702,0.00044350172,0.00036909408,0.00034744092,0.000037687136],"category_scores_gemma":[0.00037109747,0.00031254013,0.00008102531,0.0005207331,0.00026457725,0.00043892852,0.00015495402,0.0007176541,9.618414e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028705195,0.00049665204,0.0055282265,0.00027965783,0.00022629584,0.0000018558528,0.0025812027,0.63037056,0.0021583133,0.3052633,0.00021695408,0.052589934],"study_design_scores_gemma":[0.0018442878,0.00023930386,0.00008565789,0.00020967271,0.00006941368,0.000019419227,0.00040470765,0.99090266,0.0026827173,0.0016298556,0.001466933,0.00044534486],"about_ca_topic_score_codex":0.00001932074,"about_ca_topic_score_gemma":0.0000012854662,"teacher_disagreement_score":0.6148539,"about_ca_system_score_codex":0.00006955798,"about_ca_system_score_gemma":0.000048903505,"threshold_uncertainty_score":0.99993265},"labels":[],"label_agreement":null},{"id":"W2915502992","doi":"10.20944/preprints201902.0183.v1","title":"Two-Echelon Routing Problem for Parcel Delivery by Cooperated Truck and Drone","year":2019,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"University of Alberta","funders":"Distinguished Young Scholar Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Drone; Truck; Simulated annealing; Routing (electronic design automation); Tabu search; Computer science; Vehicle routing problem; Heuristic; Process (computing); Operations research; Transport engineering; Engineering; Computer network; Artificial intelligence; Automotive engineering; Algorithm","score_opus":0.06495944926391745,"score_gpt":0.320628277966875,"score_spread":0.25566882870295754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915502992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8748306,0.0004805181,0.11691472,0.00011507577,0.00060365273,0.002141136,0.00011823139,0.001125177,0.003670858],"genre_scores_gemma":[0.9321045,0.0003124162,0.06541504,0.00007318583,0.0001223118,0.00031303655,0.00027216537,0.00021296217,0.0011743518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971808,0.0002057418,0.00076447095,0.001029175,0.00023656123,0.0005832501],"domain_scores_gemma":[0.99809676,0.00028539734,0.0002289889,0.00090346293,0.00031778787,0.0001676055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015642483,0.0005586849,0.0007013427,0.00013999257,0.00012673851,0.0000849734,0.00046252855,0.00053640356,0.000119830394],"category_scores_gemma":[0.00036674697,0.0006570181,0.00011616329,0.00021569723,0.000057406018,0.00013686724,0.0009640836,0.00096042483,0.00014318622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048139336,0.000047087357,0.08432204,0.0011052557,0.00027806815,0.0000017411174,0.0008861198,0.859966,0.050200883,0.00012027528,0.00021965522,0.0028047538],"study_design_scores_gemma":[0.0017001122,0.00002326374,0.009133033,0.00045802243,0.00014144047,0.000009107204,0.00008407891,0.9221314,0.063502125,0.00029900347,0.0014497422,0.0010686363],"about_ca_topic_score_codex":0.00010624615,"about_ca_topic_score_gemma":0.000004602755,"teacher_disagreement_score":0.07518901,"about_ca_system_score_codex":0.00023661272,"about_ca_system_score_gemma":0.00011350256,"threshold_uncertainty_score":0.99958813},"labels":[],"label_agreement":null},{"id":"W2916653839","doi":"10.1002/net.21925","title":"Primal column generation framework for vehicle and crew scheduling problems","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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 scheduling; Column generation; Scheduling (production processes); Crew; Column (typography); Computer science; Operations research; Aeronautics; Engineering; Operations management; Mathematics; Mathematical optimization","score_opus":0.03948768764023189,"score_gpt":0.26363793227351073,"score_spread":0.22415024463327884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916653839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025171231,0.00082801573,0.97263885,0.00034589812,0.0002136384,0.00031822472,0.0000020153948,0.00034898924,0.0001331411],"genre_scores_gemma":[0.5116333,0.000057884605,0.48714352,0.00029699237,0.00078424014,0.00003195985,0.000011339752,0.00003545551,0.000005330783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993419,0.000028759405,0.00017897188,0.00017598104,0.00006951084,0.00020488072],"domain_scores_gemma":[0.99962777,0.000114789334,0.000030558273,0.00008845434,0.000038880917,0.000099555764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019160415,0.00010349611,0.0001332767,0.0000148135005,0.0000953153,0.000087414446,0.000063133186,0.00015683366,0.000017841983],"category_scores_gemma":[0.00012169702,0.00012137921,0.000027237715,0.00016437093,0.000015369202,0.000089856934,0.000022730863,0.00020099449,0.0000022144088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000446749,0.0000028461413,0.0005021633,0.00004044931,0.000013564741,2.4630188e-7,0.00020203576,0.98041886,0.00082134665,0.0009769812,0.00034302459,0.01667402],"study_design_scores_gemma":[0.00023093262,0.000035859808,0.00015335876,0.00002764447,0.0000138384985,7.509974e-7,0.000011430365,0.9977864,0.00049509335,0.00019055848,0.00092073187,0.0001333877],"about_ca_topic_score_codex":8.1081845e-7,"about_ca_topic_score_gemma":0.0000010682686,"teacher_disagreement_score":0.48646206,"about_ca_system_score_codex":0.000020139409,"about_ca_system_score_gemma":0.000008349349,"threshold_uncertainty_score":0.49497008},"labels":[],"label_agreement":null},{"id":"W2917261650","doi":"10.3390/a12020039","title":"A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem","year":2019,"lang":"en","type":"article","venue":"Algorithms","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"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":"Computer science; Heuristic; Benchmark (surveying); Adaptability; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Heuristics; Real-time computing; Artificial intelligence; Mathematics; Computer network","score_opus":0.013412085036412865,"score_gpt":0.2512406010561653,"score_spread":0.23782851601975244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917261650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014755561,0.00015166654,0.97675425,0.000063719024,0.0006502721,0.0010106013,0.00016514373,0.00072381715,0.005724984],"genre_scores_gemma":[0.644175,0.00006473274,0.35429615,0.00010973507,0.00033854478,0.00019365875,0.00006267766,0.00014834625,0.00061115954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854213,0.000060187813,0.00034666844,0.00032815905,0.00019400106,0.0005288363],"domain_scores_gemma":[0.998996,0.00031319103,0.00007029761,0.00034640945,0.000112221176,0.00016184297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047423606,0.00023997166,0.00034374013,0.00009624864,0.00007292074,0.000048646078,0.00019685732,0.00008607443,0.000097756936],"category_scores_gemma":[0.00014401299,0.00025284066,0.000109311244,0.0001941958,0.000015422935,0.00015527425,0.00005002331,0.00018200175,0.00016837088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002072185,0.00041009608,0.0041466304,0.0010820468,0.00097431923,0.00008334295,0.0039660456,0.8751337,0.0020357086,0.02368955,0.010081565,0.078189805],"study_design_scores_gemma":[0.0012624877,0.00011526574,0.0004645763,0.000043046188,0.000039346218,0.000013399695,0.000076718745,0.99410367,0.00059741305,0.0010264068,0.0019142509,0.00034343053],"about_ca_topic_score_codex":0.00002124423,"about_ca_topic_score_gemma":0.0000019736578,"teacher_disagreement_score":0.62941945,"about_ca_system_score_codex":0.000088990186,"about_ca_system_score_gemma":0.00005159516,"threshold_uncertainty_score":0.9999924},"labels":[],"label_agreement":null},{"id":"W2922070351","doi":"10.1007/978-3-030-19212-9_9","title":"A Constraint Programming Approach to Electric Vehicle Routing with Time Windows","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"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 Toronto","funders":"","keywords":"Computer science; Vehicle routing problem; Mathematical optimization; Constraint programming; Electric vehicle; Integer programming; Linear programming; Routing (electronic design automation); Scheduling (production processes); Transformation (genetics); Range (aeronautics); Minification; Algorithm; Computer network; Stochastic programming; Mathematics; Engineering","score_opus":0.012218359804833804,"score_gpt":0.225919186827576,"score_spread":0.2137008270227422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922070351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004768505,0.000078603356,0.98720104,0.00004830604,0.00019040072,0.0008663846,0.0000017799971,0.00042150758,0.010715149],"genre_scores_gemma":[0.13876231,0.000002127853,0.8604512,0.0002595727,0.0001953806,0.000012502043,0.000005338601,0.00010012953,0.00021143892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745274,0.00002945157,0.00037598147,0.0008508074,0.00057748787,0.0007135583],"domain_scores_gemma":[0.9987602,0.0002582139,0.000104000705,0.0005822682,0.00013606943,0.0001592457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089001766,0.00045958138,0.0004911806,0.00060251495,0.00011588087,0.00028495197,0.0007486249,0.0002459326,0.000012065227],"category_scores_gemma":[0.0000696415,0.0004214766,0.0000614236,0.0008793111,0.00016924413,0.00015149766,0.00017311299,0.0007876342,0.000058229674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032622822,0.00000692129,0.00004430894,0.00003686079,0.00001098298,0.000005415058,0.00031017984,0.7372764,0.0005193527,0.00029139817,0.0000022787142,0.26149267],"study_design_scores_gemma":[0.00021604658,0.0001109923,0.00003820736,0.00027688913,0.000012152528,0.000059383914,3.2210184e-7,0.997222,0.0009891049,0.00024054333,0.0002770351,0.00055730995],"about_ca_topic_score_codex":0.000003976807,"about_ca_topic_score_gemma":0.000002312115,"teacher_disagreement_score":0.26093537,"about_ca_system_score_codex":0.00035927532,"about_ca_system_score_gemma":0.00028060502,"threshold_uncertainty_score":0.9998237},"labels":[],"label_agreement":null},{"id":"W2923724034","doi":"10.1016/j.trc.2018.12.011","title":"A Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion","year":2019,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":54,"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":"GRASP; Mathematical optimization; Heuristic; Nonlinear system; Function (biology); Lagrangian relaxation; Computer science; Benchmark (surveying); Convergence (economics); Mathematics; Economics","score_opus":0.029146225791938155,"score_gpt":0.2952903331790177,"score_spread":0.26614410738707955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923724034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90429777,0.0020392642,0.09092923,0.00068164745,0.00008267605,0.001040847,0.00002644316,0.00081681303,0.00008534014],"genre_scores_gemma":[0.98361224,0.0008437536,0.015330749,0.0000019315169,0.000011922049,0.00013828906,0.00001010412,0.000023090925,0.000027897791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991865,0.00003833064,0.00021198016,0.00019218792,0.00012397188,0.0002469867],"domain_scores_gemma":[0.9990399,0.00060596765,0.00004446289,0.00018752042,0.00009698553,0.000025200117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087418576,0.00010583871,0.00018426357,0.00012734435,0.00015693888,0.0000333756,0.000100318866,0.00009236548,0.000002424168],"category_scores_gemma":[0.000046928373,0.00008096651,0.000016038992,0.00026547266,0.00023758585,0.00008850765,0.000009816484,0.00018814515,6.201447e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015108813,0.000011655972,0.22701618,0.0024384756,0.00018643144,0.0000026817906,0.0012706179,0.6995675,0.0005936002,0.03580348,0.00028396485,0.032674305],"study_design_scores_gemma":[0.0014271513,0.00035217297,0.1381547,0.00073304854,0.00010126466,0.0000070726464,0.0105356425,0.842498,0.0015525251,0.0011048198,0.0031382928,0.00039529457],"about_ca_topic_score_codex":0.000042209635,"about_ca_topic_score_gemma":0.00024067948,"teacher_disagreement_score":0.1429305,"about_ca_system_score_codex":0.000017160499,"about_ca_system_score_gemma":0.000011146439,"threshold_uncertainty_score":0.33017182},"labels":[],"label_agreement":null},{"id":"W2925837702","doi":"10.1155/2019/1812543","title":"An Integrated Problem of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:math>-Hub Location and Revenue Management with Multiple Capacity Levels under Disruptions","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Revenue; Profit maximization; Profit (economics); Computer science; Stochastic programming; Mathematical optimization; Star (game theory); Algorithm; Operations research; Mathematics; Economics; Finance","score_opus":0.01523716657415934,"score_gpt":0.2449827766764912,"score_spread":0.22974561010233188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925837702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8235091,0.00004564757,0.17561108,0.000032454653,0.00013242425,0.00002916244,0.000030196688,0.000028499468,0.00058141205],"genre_scores_gemma":[0.88734657,0.000098742596,0.11232239,0.000024440245,0.000040741877,0.000023129503,0.000082013474,0.000049233277,0.000012749931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892277,0.000039391714,0.00043064004,0.00014865866,0.00029277583,0.00016574172],"domain_scores_gemma":[0.9991591,0.00008022897,0.00039561625,0.0001843584,0.00010082377,0.0000798969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035498504,0.00011077582,0.00008992178,0.00010194221,0.000078796955,0.000043896474,0.00011319469,0.00012543144,0.00018907488],"category_scores_gemma":[0.000028532433,0.00014677274,0.00007225979,0.00023977403,0.00006120928,0.000600339,0.0000061477126,0.00021823448,0.0000075292387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012831153,0.00004329269,0.00010393177,0.00043985283,0.00013569384,0.000014598741,0.0015467056,0.7934037,0.007419238,0.19456424,0.000029913293,0.0021705437],"study_design_scores_gemma":[0.0017908046,0.00063065486,0.02609144,0.0011647773,0.00036924754,0.000090056936,0.0027017193,0.8201862,0.14624195,0.0001941487,0.0001920494,0.00034694266],"about_ca_topic_score_codex":0.000033849166,"about_ca_topic_score_gemma":0.00018269471,"teacher_disagreement_score":0.19437009,"about_ca_system_score_codex":0.000010142969,"about_ca_system_score_gemma":0.00005850574,"threshold_uncertainty_score":0.5985219},"labels":[],"label_agreement":null},{"id":"W2934965048","doi":"10.5267/j.dsl.2018.11.001","title":"Vehicle routing problems in rice-for-the-poor distribution","year":2019,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Kementerian Riset, Teknologi dan Pendidikan Tinggi; Institut Pertanian Bogor","keywords":"Vehicle routing problem; Integer programming; Distribution (mathematics); Routing (electronic design automation); Mathematical optimization; Homogeneous; Linear programming; Computer science; Integer (computer science); Operations research; Mathematics","score_opus":0.018459451644066833,"score_gpt":0.2790806962669723,"score_spread":0.2606212446229055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934965048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5002599,0.000018349268,0.49825606,0.000649777,0.0004134568,0.00025569528,0.0000033653455,0.00007463233,0.0000687704],"genre_scores_gemma":[0.9767387,0.0000053904496,0.02262715,0.00053246063,0.00003765864,0.000023827364,0.00000338035,0.000015481477,0.000015936865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985291,0.000026503829,0.00030182934,0.00029002476,0.0004505136,0.00040206203],"domain_scores_gemma":[0.99881244,0.0007128083,0.00004860136,0.00031695561,0.00005497774,0.00005421254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792033,0.000106737585,0.00012161103,0.0001329582,0.00016311073,0.00016488227,0.0005008419,0.000039944785,0.000015357078],"category_scores_gemma":[0.0005024306,0.00008552499,0.00004180796,0.0014580864,0.000096810545,0.00040810788,0.00006436271,0.00015583828,0.00007202311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003017909,0.000004153938,0.007846181,0.0000072295684,0.0000014336455,3.5733123e-7,0.00015266085,0.8775619,0.094979554,0.00010511245,0.00056007097,0.018778317],"study_design_scores_gemma":[0.00034778003,0.00000880204,0.037356723,0.00004047295,0.0000023493772,0.0000020892514,0.000049185022,0.9567511,0.0035836513,0.000076796,0.001650526,0.00013048878],"about_ca_topic_score_codex":0.000008702677,"about_ca_topic_score_gemma":0.000001893913,"teacher_disagreement_score":0.47647882,"about_ca_system_score_codex":0.00020232797,"about_ca_system_score_gemma":0.000019620018,"threshold_uncertainty_score":0.34876078},"labels":[],"label_agreement":null},{"id":"W2936461448","doi":"10.1080/03155986.2019.1575686","title":"Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Time horizon; Scheduling (production processes); Computer science; Vehicle routing problem; Integer programming; Production (economics); Production planning; Mathematical optimization; Operations research; Set (abstract data type); Job shop scheduling; Routing (electronic design automation); Industrial engineering; Engineering; Algorithm; Mathematics; Economics","score_opus":0.03983700142863135,"score_gpt":0.3221490325116731,"score_spread":0.28231203108304176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936461448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73656523,0.00017524858,0.25652835,0.000362068,0.0002260607,0.0027712334,0.000052661137,0.00014514649,0.003174036],"genre_scores_gemma":[0.9728322,0.00002008265,0.02645774,0.000058506128,0.00005781778,0.00024421234,0.00012997154,0.00001729303,0.00018216464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845713,0.000059308302,0.0006490232,0.00012005065,0.0003989107,0.00031558803],"domain_scores_gemma":[0.9986078,0.00052693795,0.00006422222,0.0001140923,0.0006034728,0.000083464955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030115044,0.00012635227,0.00018868217,0.00040135378,0.00023888622,0.00056874356,0.00008627079,0.00014265718,0.000011790908],"category_scores_gemma":[0.00038800182,0.00012024461,0.000022779912,0.00037512838,0.000029247263,0.0018881005,0.000055232318,0.0003027757,0.0000233842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026828237,0.0000055302075,0.0070215724,0.00065572595,0.000019261943,1.3257339e-7,0.0036712831,0.9397024,0.0006689468,0.04555344,0.00014472177,0.002530183],"study_design_scores_gemma":[0.00093926955,0.000034839133,0.0025654314,0.0001664774,0.0000020087311,0.000007408763,0.0020598776,0.98932296,0.00007741681,0.00006417671,0.004621109,0.0001390487],"about_ca_topic_score_codex":0.00006189477,"about_ca_topic_score_gemma":0.000011044578,"teacher_disagreement_score":0.236267,"about_ca_system_score_codex":0.000117346586,"about_ca_system_score_gemma":0.00009155197,"threshold_uncertainty_score":0.54844075},"labels":[],"label_agreement":null},{"id":"W2937321088","doi":"10.1287/ijoc.2019.0915","title":"A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"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":"Belgian Federal Science Policy Office","keywords":"Mathematics; Sorting; Column generation; Mathematical optimization; Branch and cut; Relaxation (psychology); Linear programming relaxation; Set (abstract data type); Position (finance); Variable (mathematics); Exponential function; Integer programming; Algorithm; Computer science","score_opus":0.020375786052066303,"score_gpt":0.265880337222943,"score_spread":0.24550455117087672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937321088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019518927,0.00017677805,0.97279537,0.005304377,0.00031468685,0.00044174955,0.0000035650976,0.0002699293,0.0011745981],"genre_scores_gemma":[0.86502874,0.000059080456,0.13255554,0.0014949453,0.00078149704,0.0000068799523,0.0000023072225,0.000053399064,0.000017600181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889904,0.00001861949,0.00043787854,0.00011189024,0.00021059245,0.00032198185],"domain_scores_gemma":[0.99907506,0.0004047522,0.00014849842,0.000090600806,0.000092920935,0.0001881828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061073375,0.00017172504,0.00019554485,0.000056561446,0.00035739032,0.0002466297,0.00024094703,0.00006817021,0.000010672192],"category_scores_gemma":[0.0004222537,0.000111245936,0.0000784237,0.00025872598,0.000026052448,0.00020118378,0.00005067623,0.0005101309,0.000006405714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025066054,0.0000029184775,0.00035708482,0.00014064029,0.00007367248,0.0000021649425,0.0029004756,0.87966996,0.0001251964,0.00030127948,0.0008257892,0.11557572],"study_design_scores_gemma":[0.0006683656,0.00009357396,0.00038521047,0.00011339729,0.000017156857,0.00008651939,0.0001551047,0.99086565,0.0003001929,0.00035573472,0.0067867716,0.00017231653],"about_ca_topic_score_codex":6.42003e-7,"about_ca_topic_score_gemma":7.81586e-7,"teacher_disagreement_score":0.8455098,"about_ca_system_score_codex":0.000039723684,"about_ca_system_score_gemma":0.00004527784,"threshold_uncertainty_score":0.45364776},"labels":[],"label_agreement":null},{"id":"W2937396187","doi":"10.1177/0954410019842487","title":"Optimal scheduling for aerial recovery of multiple unmanned aerial vehicles using genetic algorithm","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part G Journal of Aerospace Engineering","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Genetic algorithm; Drone; Greedy algorithm; Real-time computing; Algorithm; Mathematical optimization; Machine learning; Mathematics","score_opus":0.014378231345519929,"score_gpt":0.23235224859443065,"score_spread":0.21797401724891072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937396187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5545479,0.00013796464,0.44310015,0.000015656962,0.0018799119,0.00026093272,0.000015075636,0.000036716494,0.000005672126],"genre_scores_gemma":[0.5368857,0.000045071796,0.462769,0.0000017862828,0.00024970365,0.000003289551,6.699404e-7,0.00004132156,0.0000034696013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778765,0.000011842588,0.0011990601,0.00017618413,0.00048192337,0.00034331862],"domain_scores_gemma":[0.9982218,0.00019699745,0.0006856762,0.00014830113,0.0006286766,0.000118542965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009824287,0.00029071412,0.00074387796,0.00026297668,0.000044322016,0.000024721148,0.00046930218,0.00023639011,0.0000063744747],"category_scores_gemma":[0.0010736004,0.00026967382,0.00040134185,0.00047399968,0.00005572188,0.00040579648,0.00008519389,0.00036111052,3.6005898e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009198861,0.000023382301,0.00004265335,0.0003770565,0.0001169795,1.9741027e-7,0.00006759116,0.656517,0.3421555,0.00036092388,0.00001036238,0.00023631459],"study_design_scores_gemma":[0.0012161848,0.00015761601,0.00003234592,0.0005956575,0.000085925,0.000023488294,0.00007532199,0.6212386,0.37633878,0.000016717437,0.000061740095,0.00015762787],"about_ca_topic_score_codex":0.0000030106248,"about_ca_topic_score_gemma":8.048365e-8,"teacher_disagreement_score":0.035278466,"about_ca_system_score_codex":0.00015765472,"about_ca_system_score_gemma":0.0000927786,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W2938533079","doi":"","title":"Valid Inequalities and a Branch-and-Cut Algorithm for Asymmetric Multi-Depot Routing Problems","year":2019,"lang":"en","type":"article","venue":"","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é Laval","funders":"","keywords":"Travelling salesman problem; Branch and cut; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Benchmark (surveying); Set (abstract data type); Triangle inequality; Mathematics; Computer science; Node (physics); Traveling purchaser problem; Column generation; Algorithm; 2-opt; Integer programming; Combinatorics; Engineering","score_opus":0.03342638280313788,"score_gpt":0.28106554293530933,"score_spread":0.24763916013217147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938533079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044056416,0.00034464718,0.952933,0.000032614545,0.00018976863,0.00051440904,0.000011245145,0.00045518405,0.0014626876],"genre_scores_gemma":[0.38923076,0.000052362506,0.60931593,0.000050395294,0.000048899667,0.000033859596,0.0000062490103,0.000052367184,0.0012091566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908197,0.000044722678,0.00028089053,0.00021748646,0.00010174364,0.00027318677],"domain_scores_gemma":[0.99931705,0.0003797633,0.000040498624,0.00013674922,0.00005627123,0.00006965779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626155,0.0001607771,0.00023703104,0.00016065495,0.000058691956,0.00008821202,0.000064140404,0.000091765425,0.000016332979],"category_scores_gemma":[0.00014232165,0.00015461072,0.000035339912,0.0002486556,0.000017145263,0.00016326843,0.00004607251,0.00010163505,0.000007427924],"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.0000070370816,0.000054555283,0.021034392,0.0013940511,0.0002061702,0.000001469745,0.003643712,0.16346969,0.003852016,0.0040125586,0.00016210512,0.80216223],"study_design_scores_gemma":[0.0009723596,0.000035439374,0.0008299175,0.000037463735,0.000014306666,0.000010417262,0.00017177279,0.99462575,0.002620647,0.00010956145,0.00034332398,0.00022906372],"about_ca_topic_score_codex":0.000035304107,"about_ca_topic_score_gemma":0.0000040731466,"teacher_disagreement_score":0.831156,"about_ca_system_score_codex":0.000026687405,"about_ca_system_score_gemma":0.00000846885,"threshold_uncertainty_score":0.6304842},"labels":[],"label_agreement":null},{"id":"W2939963135","doi":"10.1007/s43069-020-00042-z","title":"The Inventory Routing Problem with Demand Moves","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Time horizon; Routing (electronic design automation); Operations research; Inventory theory; Computer science; Holding cost; Demand forecasting; Perpetual inventory; Total cost; Inventory cost; Inventory control; Operations management; Business; Economics; Mathematical optimization; Supply chain; Microeconomics; Marketing; Engineering; Computer network; Mathematics","score_opus":0.03831725747215989,"score_gpt":0.3362077405177609,"score_spread":0.29789048304560106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939963135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18180001,0.00416008,0.6720392,0.016754046,0.00043261208,0.0018039203,0.000020479463,0.001005404,0.12198424],"genre_scores_gemma":[0.83803934,0.0003586539,0.1502713,0.0000666273,0.000114811635,0.00023076995,0.000027604285,0.00007560452,0.010815325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857694,0.0002657185,0.00017308159,0.00015948352,0.00036782312,0.00045694914],"domain_scores_gemma":[0.9990028,0.00017513662,0.0000058574606,0.00032557495,0.00040886388,0.00008174214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013745555,0.00008190799,0.000077503195,0.00006409564,0.0011735489,0.00045963892,0.00017135011,0.00004498959,0.000046042307],"category_scores_gemma":[0.00030722958,0.00005875727,0.000018619874,0.00065197295,0.00009806131,0.00020412078,0.00009261867,0.0003595821,0.00003209811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003073435,0.000014187555,0.0013047771,0.000015251429,0.00003757975,0.000007608093,0.0003852588,0.9719508,0.0036277934,0.016079046,0.0023185485,0.004256062],"study_design_scores_gemma":[0.00020623312,0.000032944325,0.0002298006,0.000043373246,0.0000035727835,0.000015222898,0.0015107837,0.9723505,0.011045355,0.00023797617,0.014207599,0.000116660136],"about_ca_topic_score_codex":0.000018065677,"about_ca_topic_score_gemma":0.00065295346,"teacher_disagreement_score":0.6562393,"about_ca_system_score_codex":0.00009099044,"about_ca_system_score_gemma":0.00017842486,"threshold_uncertainty_score":0.9026107},"labels":[],"label_agreement":null},{"id":"W2940300938","doi":"10.1007/s10732-019-09412-1","title":"Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows","year":2019,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"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":"Heuristics; Benchmark (surveying); Vehicle routing problem; Computer science; Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Evolutionary algorithm; Genetic algorithm; Machine learning; Mathematics","score_opus":0.03366536894842708,"score_gpt":0.26658316919298636,"score_spread":0.23291780024455927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940300938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016827041,0.00040386457,0.9811216,0.00017984326,0.00048567832,0.000617282,0.00017417195,0.00010128263,0.00008925144],"genre_scores_gemma":[0.3108543,0.000041574884,0.6884645,0.000041750824,0.0003764889,0.000004983907,0.00003080596,0.00008849599,0.000097124954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827313,0.00006218199,0.00070664356,0.00019564538,0.00040328118,0.00035911816],"domain_scores_gemma":[0.99696875,0.0014433417,0.00038433255,0.0006087228,0.0004857539,0.00010908051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010081872,0.00022749217,0.00037481714,0.000087402484,0.00017286705,0.0000792303,0.0007097434,0.00009963774,0.000029261151],"category_scores_gemma":[0.00068636885,0.00016245269,0.00008453378,0.00020866355,0.000060492355,0.00025516056,0.00012573715,0.0004813198,0.000032490123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008516345,0.00005953254,0.02225119,0.00009293396,0.0001829425,0.000011545977,0.00012218545,0.97018945,0.0007147758,0.0000613761,0.0048645665,0.001364361],"study_design_scores_gemma":[0.0016691346,0.00016380669,0.006082222,0.00011654875,0.00015922383,0.000089161855,0.000060651502,0.98647547,0.000087077584,0.00006633957,0.00481447,0.00021586627],"about_ca_topic_score_codex":0.0000050921644,"about_ca_topic_score_gemma":0.000009772914,"teacher_disagreement_score":0.29402724,"about_ca_system_score_codex":0.000118183125,"about_ca_system_score_gemma":0.00012293337,"threshold_uncertainty_score":0.6624629},"labels":[],"label_agreement":null},{"id":"W2943956374","doi":"10.1155/2019/5075671","title":"A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":259,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Hrvatska Zaklada za Znanost","keywords":"Vehicle routing problem; Heuristics; Computer science; Algorithm; Electric vehicle; Greenhouse gas; Operations research; Routing (electronic design automation); Mathematics; Physics","score_opus":0.026667245177416754,"score_gpt":0.24072319847424806,"score_spread":0.2140559532968313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943956374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.934568,0.0001194819,0.06467986,0.00009087804,0.00014326008,0.00017839295,0.0000031677823,0.00003260508,0.00018436166],"genre_scores_gemma":[0.983245,0.00006577694,0.01659451,0.000018620862,0.000030727555,0.0000021851472,0.0000068006907,0.000021314327,0.0000150425485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99914235,0.000100455945,0.0003508953,0.000086841406,0.00018199933,0.00013744124],"domain_scores_gemma":[0.9993813,0.00023645839,0.00018252419,0.000079265046,0.000085290514,0.000035166737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010063254,0.000095311305,0.00014850464,0.000084951556,0.000051264495,0.000022379401,0.00007095695,0.000047840032,0.000006568617],"category_scores_gemma":[0.00005536663,0.0000734696,0.000035589408,0.00028940925,0.000008252396,0.00026037608,0.000001013654,0.0002320809,0.0000021693277],"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.0000532329,0.000016687149,0.012158091,0.000027870126,0.000029297373,0.0000011325694,0.00071363646,0.9574275,0.017953124,0.0006248874,0.000008851539,0.010985695],"study_design_scores_gemma":[0.0006126541,0.00012392654,0.8084256,0.00007313159,0.000021781472,0.000003947808,0.00009990575,0.18827933,0.0019385656,0.0003004163,0.000013954599,0.00010677609],"about_ca_topic_score_codex":0.0000041386265,"about_ca_topic_score_gemma":0.000010596458,"teacher_disagreement_score":0.7962675,"about_ca_system_score_codex":0.00004130756,"about_ca_system_score_gemma":0.000018360543,"threshold_uncertainty_score":0.29960033},"labels":[],"label_agreement":null},{"id":"W2944565881","doi":"10.1016/j.ejor.2019.04.047","title":"The Steiner Traveling Salesman Problem and its extensions","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"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; Ministerio de Economía y Competitividad","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Mathematics; Steiner tree problem; Mathematical optimization; Integer programming; Extension (predicate logic); Graph; Branch and cut; 2-opt; Combinatorics; Computer science","score_opus":0.0678517191682732,"score_gpt":0.3429520143905892,"score_spread":0.275100295222316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944565881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433782,0.0023755126,0.010638825,0.0024219921,0.0003510242,0.00033278778,0.0000033437689,0.00003704409,0.040461253],"genre_scores_gemma":[0.979901,0.00041216143,0.01763868,0.000026302145,0.0002142561,8.226628e-7,0.0000010319317,0.000035406316,0.0017703224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980464,0.0008015485,0.0003392532,0.000082363214,0.00053422636,0.00019618512],"domain_scores_gemma":[0.9984998,0.0005215314,0.000035551122,0.00010198669,0.0007405123,0.00010060455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069884583,0.0000679394,0.000089855894,0.000094587434,0.00026958337,0.00018971083,0.00021162762,0.00001465117,0.00006211287],"category_scores_gemma":[0.0004580945,0.000045771485,0.000028804456,0.0001882079,0.00003702634,0.00017642089,0.00005670787,0.00052314333,0.00009867312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004919008,0.000025324669,0.00080466317,0.000048704733,0.000087901826,0.00007032263,0.0009902811,0.87807614,0.08565686,0.014303061,0.0035884927,0.016299088],"study_design_scores_gemma":[0.0017702645,0.0004951504,0.029726919,0.00035111935,0.000014981333,0.0005463593,0.00069522794,0.91444457,0.0029883138,0.00034893712,0.048284236,0.0003339446],"about_ca_topic_score_codex":1.8808251e-7,"about_ca_topic_score_gemma":3.4586358e-7,"teacher_disagreement_score":0.08266855,"about_ca_system_score_codex":0.000032010958,"about_ca_system_score_gemma":0.000065349195,"threshold_uncertainty_score":0.24220742},"labels":[],"label_agreement":null},{"id":"W2947091483","doi":"10.1080/03155986.2019.1607806","title":"An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Benchmark (surveying); Computer science; Mathematical optimization; Statistic; Process (computing); Gasoline; Operations research; Vehicle routing problem; Order (exchange); Routing (electronic design automation); Algorithm; Mathematics; Statistics; Economics; Engineering","score_opus":0.027317348647659195,"score_gpt":0.321159388669695,"score_spread":0.29384204002203584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947091483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020385979,0.00015097002,0.97184825,0.00018906506,0.00017535522,0.0037322172,0.00015161932,0.00014454545,0.003221983],"genre_scores_gemma":[0.86452097,0.00011598044,0.13118751,0.0001076855,0.00022081095,0.0016104449,0.0007566437,0.000045338173,0.0014346004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981675,0.00009274365,0.00048704556,0.00013512332,0.0007627641,0.0003547832],"domain_scores_gemma":[0.9978154,0.00042226107,0.000054107903,0.00026968328,0.0013331672,0.00010538719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037985833,0.00013156,0.00014974203,0.00023378777,0.0004710217,0.0009759526,0.00018014164,0.000088288434,0.000033352786],"category_scores_gemma":[0.000054826392,0.00009015369,0.000021672573,0.00035803448,0.000047644102,0.002464701,0.00003229911,0.0002470689,0.00003121916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051438587,0.00000968465,0.00048751215,0.00031518308,0.00004960372,9.6435755e-8,0.0018540985,0.951368,0.00036252887,0.005958529,0.0006635096,0.038879823],"study_design_scores_gemma":[0.0008867414,0.00026818836,0.0005421379,0.000037482598,0.0000047380872,0.000010983168,0.0029308822,0.97331905,0.00038438503,0.000007748578,0.021479862,0.00012779479],"about_ca_topic_score_codex":0.00016599966,"about_ca_topic_score_gemma":0.000010086053,"teacher_disagreement_score":0.844135,"about_ca_system_score_codex":0.00014054187,"about_ca_system_score_gemma":0.0001991482,"threshold_uncertainty_score":0.94111335},"labels":[],"label_agreement":null},{"id":"W2947585677","doi":"10.1016/j.cor.2019.05.026","title":"Exact solution methods for the multi-period vehicle routing problem with due dates","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Period (music); Computer science; Mathematical optimization; Routing (electronic design automation); Operations research; Mathematics; Computer network","score_opus":0.07459327942086358,"score_gpt":0.4055867442912805,"score_spread":0.3309934648704169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947585677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011169109,0.0002254969,0.985345,0.00097103807,0.00022541946,0.0015876745,0.0000074202894,0.00025614392,0.00021269475],"genre_scores_gemma":[0.20362328,0.000017326338,0.7955857,0.0000335445,0.000089911206,0.00023023222,0.00002960508,0.000054635886,0.0003357603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804324,0.0005609835,0.00027929986,0.00033116265,0.0002602665,0.00052502565],"domain_scores_gemma":[0.9978293,0.0011010247,0.000016922686,0.00052239205,0.00044960112,0.0000807225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034759685,0.00016184486,0.00019140812,0.00017300871,0.0007828708,0.00046543294,0.0004387092,0.000082377774,0.00003463266],"category_scores_gemma":[0.0001838318,0.00012013268,0.00005013811,0.0007005318,0.000093342285,0.00032706073,0.00013937666,0.00043659718,0.00004463873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010023974,0.000024320096,0.00019913586,0.00004681585,0.00005427456,5.4288773e-7,0.00086916593,0.94312805,0.013582055,0.0007148028,0.0002701794,0.04110062],"study_design_scores_gemma":[0.0006262016,0.0000888633,0.0005338938,0.000054018677,0.000009560455,0.000009736051,0.00027246564,0.99183476,0.0039554937,0.000011119665,0.0024397476,0.000164155],"about_ca_topic_score_codex":0.000061021383,"about_ca_topic_score_gemma":0.00003141676,"teacher_disagreement_score":0.19245417,"about_ca_system_score_codex":0.00015214845,"about_ca_system_score_gemma":0.00010201208,"threshold_uncertainty_score":0.60212886},"labels":[],"label_agreement":null},{"id":"W2949203745","doi":"10.1016/j.ejor.2019.10.010","title":"A concise guide to existing and emerging vehicle routing problem variants","year":2019,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Vehicle routing problem; Computer science; Diversity (politics); Focus (optics); Routing (electronic design automation); Data science; Management science; Operations research; Risk analysis (engineering); Engineering; Business; Political science; Computer network","score_opus":0.10251774212373478,"score_gpt":0.40096161314748013,"score_spread":0.29844387102374537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949203745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3098083,0.0012357043,0.58849615,0.0021965266,0.001278681,0.0011463454,0.000039822848,0.00015110402,0.09564738],"genre_scores_gemma":[0.65994245,0.00011778802,0.3378291,0.0000894871,0.0008302507,0.000004541734,0.000008465509,0.0001321737,0.0010457226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533474,0.0016998067,0.001080751,0.00032236506,0.0011123476,0.00044997974],"domain_scores_gemma":[0.997101,0.0005473056,0.00017636492,0.00028846512,0.0015915481,0.0002952786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01613283,0.00023164488,0.00036956058,0.00053448684,0.00024322045,0.00058135454,0.0005687333,0.00007022398,0.00007967696],"category_scores_gemma":[0.0026253301,0.00023263547,0.00007628782,0.00033491864,0.000046059446,0.00021601653,0.00085287844,0.0018279565,0.00007401075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023986553,0.000013597913,0.0005760844,0.00015275207,0.00007595085,0.00012266396,0.001483071,0.97641313,0.00738618,0.00037989704,0.003750951,0.0096217375],"study_design_scores_gemma":[0.0010956913,0.00022144942,0.0068821544,0.002107793,0.000027346505,0.00019183903,0.00047121427,0.97527975,0.0008450695,0.00012265358,0.012215578,0.00053947576],"about_ca_topic_score_codex":0.0000066135312,"about_ca_topic_score_gemma":7.147982e-7,"teacher_disagreement_score":0.35013413,"about_ca_system_score_codex":0.00024318622,"about_ca_system_score_gemma":0.00035275542,"threshold_uncertainty_score":0.9486599},"labels":[],"label_agreement":null},{"id":"W2951794473","doi":"10.48550/arxiv.1708.01335","title":"Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Waterloo; University of Alberta","funders":"","keywords":"Orienteering; Regret; Rounding; Mathematics; Linear programming relaxation; Approximation algorithm; Routing (electronic design automation); Bounded function; Path (computing); Mathematical optimization; Combinatorics; Node (physics); Point (geometry); Linear programming; Discrete mathematics; Computer science; Statistics; Computer network; Geometry; Engineering","score_opus":0.0782951958348076,"score_gpt":0.22094772364564436,"score_spread":0.14265252781083676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951794473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46963716,0.00011381704,0.5236339,0.000039498733,0.0006830385,0.0006940002,0.0000472806,0.00073265645,0.004418654],"genre_scores_gemma":[0.9839306,0.000087885004,0.014731012,0.000010329622,0.00013957746,0.0000023154041,0.00003163527,0.00009608597,0.00097058644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843377,0.00007087734,0.0002535419,0.00070008094,0.00007316982,0.0004685625],"domain_scores_gemma":[0.9984312,0.00017166694,0.0002280886,0.0008450805,0.00014859241,0.00017533939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052078965,0.0003893526,0.00046962043,0.00016661549,0.00040454272,0.00024083274,0.00054511154,0.00035143198,0.000009492917],"category_scores_gemma":[0.00020030336,0.0004985361,0.00014696832,0.00014380085,0.00010804308,0.00026346388,0.0004112269,0.00056284247,0.0000060046596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033381188,0.000021022724,0.0075289737,0.0005214587,0.00017328875,0.000028569064,0.00025586065,0.9729597,0.00022866792,0.017375952,0.00007844225,0.0007947069],"study_design_scores_gemma":[0.0008654987,0.00002757881,0.0012935577,0.00028252334,0.00013114056,0.000004590772,0.00010484683,0.9911192,0.00071519887,0.004216656,0.000702788,0.0005363915],"about_ca_topic_score_codex":0.00007553465,"about_ca_topic_score_gemma":0.000024657267,"teacher_disagreement_score":0.51429343,"about_ca_system_score_codex":0.00027104258,"about_ca_system_score_gemma":0.00007261976,"threshold_uncertainty_score":0.9997466},"labels":[],"label_agreement":null},{"id":"W2953891001","doi":"10.1287/trsc.2018.0876","title":"A Rule-Based Recourse for the Vehicle Routing Problem with Stochastic Demands","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Université de Montréal; Transport Canada","funders":"","keywords":"Vehicle routing problem; Computer science; TRIPS architecture; Operations research; Routing (electronic design automation); Mathematical optimization; Residual; Engineering; Mathematics","score_opus":0.014085415359261281,"score_gpt":0.25906495470527746,"score_spread":0.24497953934601618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953891001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26349103,0.000016455875,0.7354785,0.00012663321,0.00009834217,0.00043288487,0.0000070032384,0.00016671515,0.0001823937],"genre_scores_gemma":[0.88308394,8.706597e-7,0.116701335,0.00006442299,0.0000160219,0.000058282,0.0000065873523,0.000020248004,0.00004826771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990144,0.000010648203,0.00019544552,0.00020779892,0.00031451855,0.00025719206],"domain_scores_gemma":[0.999268,0.00025719003,0.000055709977,0.0001965219,0.0001687796,0.00005380618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365843,0.0000990937,0.00009485842,0.00007625957,0.00019167762,0.000064442844,0.0002293356,0.000026709273,0.000029726727],"category_scores_gemma":[0.000029974884,0.000071256145,0.000028715855,0.0006961709,0.00010140309,0.00025529633,0.0000012682244,0.00008396108,0.000009206114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014733014,0.000005238468,0.0023475243,0.00005953573,0.000004074936,1.5574774e-7,0.0004997279,0.9912368,0.0028728168,0.00046494775,0.0000032291362,0.002491216],"study_design_scores_gemma":[0.0005661764,0.000039524042,0.016621135,0.00009239852,0.000018808529,5.01391e-7,0.00015540735,0.97956544,0.0027370795,0.000046026704,0.000035174733,0.00012232835],"about_ca_topic_score_codex":0.00000585486,"about_ca_topic_score_gemma":0.000011903362,"teacher_disagreement_score":0.6195929,"about_ca_system_score_codex":0.000041008076,"about_ca_system_score_gemma":0.00012251054,"threshold_uncertainty_score":0.29057413},"labels":[],"label_agreement":null},{"id":"W2953949769","doi":"10.1016/j.tre.2019.05.014","title":"A Lagrangean decomposition approach for a novel two-echelon node-based location-routing problem in an offshore oil and gas supply chain","year":2019,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Supply chain; Submarine pipeline; Decomposition; Oil supply; Vehicle routing problem; Petroleum engineering; Computer science; Mathematical optimization; Routing (electronic design automation); Engineering; Business; Computer network; Chemistry; Mathematics; Structural engineering","score_opus":0.07540011802285368,"score_gpt":0.36748203541960733,"score_spread":0.29208191739675365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953949769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07543295,0.0052427645,0.9150328,0.00071729854,0.00006800024,0.0024503586,0.0004784783,0.00024795844,0.0003293591],"genre_scores_gemma":[0.795081,0.007751283,0.191258,0.00017308937,0.000035783843,0.00067747815,0.0049213404,0.00007562561,0.000026350197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976148,0.00016686344,0.0008485224,0.0005193958,0.00041341467,0.00043700114],"domain_scores_gemma":[0.9986503,0.00031912216,0.00011934579,0.00023923963,0.00049757864,0.00017438491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024171774,0.00026494556,0.0004633435,0.00025891713,0.0001389605,0.000072866496,0.00012798303,0.00013304884,0.000022610084],"category_scores_gemma":[0.000044585973,0.0002799541,0.000059524617,0.0007720586,0.00009784796,0.00024328579,0.0000013609828,0.0003425342,0.0000017750554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013086187,0.00033935567,0.049739763,0.027907424,0.00004867009,0.0000058575006,0.0014452441,0.87013197,0.0015750682,0.013801513,0.000047004898,0.034827296],"study_design_scores_gemma":[0.0033809566,0.00018833276,0.043504905,0.0031631778,0.00013142682,0.0000013181709,0.00025792685,0.94732696,0.00017095101,0.0002767624,0.0010517722,0.0005454964],"about_ca_topic_score_codex":0.00011354568,"about_ca_topic_score_gemma":0.0006968041,"teacher_disagreement_score":0.72377485,"about_ca_system_score_codex":0.000053378637,"about_ca_system_score_gemma":0.00008527966,"threshold_uncertainty_score":0.99996525},"labels":[],"label_agreement":null},{"id":"W2954693089","doi":"10.22119/ijte.2019.94586.1361","title":"Sustainable vehicle-routing problem with time windows by heterogeneous fleet of vehicles and separated compartments: Application in waste collection problem","year":2019,"lang":"en","type":"article","venue":"International Journal of Transportation Engineering","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Vehicle routing problem; Solver; Variable (mathematics); Mathematical optimization; Integer programming; Computer science; Operations research; Fleet management; Constraint programming; Constraint (computer-aided design); Routing (electronic design automation); Engineering; Transport engineering; Mathematics","score_opus":0.003690886833348476,"score_gpt":0.21545884997712114,"score_spread":0.21176796314377266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954693089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9207158,0.00011832295,0.07860377,0.000036936173,0.00006413904,0.00032382805,0.000014126139,0.000050939365,0.000072131385],"genre_scores_gemma":[0.98155254,0.00003242613,0.018234696,0.000006744181,0.00002343252,0.000013714723,0.000049294125,0.00003600157,0.000051168994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870354,0.000025133828,0.0006549678,0.00012673956,0.00032045398,0.0001691882],"domain_scores_gemma":[0.99921274,0.00006293772,0.0002545119,0.00006488725,0.00035325772,0.000051673498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033766916,0.00015021581,0.00025365507,0.0003108469,0.000016739032,0.00003282783,0.00013468045,0.00006492036,0.000009512197],"category_scores_gemma":[0.0000075184607,0.0001553139,0.000038254617,0.00031453124,0.000013175823,0.00039137076,0.0000044257818,0.00016642777,0.0000012676207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088644076,0.000035335997,0.014153328,0.00010891301,0.00012024559,0.00000846953,0.0005671254,0.93226767,0.052178994,0.0000799409,0.000016501212,0.00037481956],"study_design_scores_gemma":[0.0020634984,0.00013116268,0.004486356,0.0002719769,0.00003103105,0.000035343848,0.00017993484,0.95978814,0.03257861,0.000024373563,0.00021433539,0.00019525587],"about_ca_topic_score_codex":0.000025686952,"about_ca_topic_score_gemma":0.00000667723,"teacher_disagreement_score":0.06083671,"about_ca_system_score_codex":0.00015759337,"about_ca_system_score_gemma":0.000030182462,"threshold_uncertainty_score":0.6333517},"labels":[],"label_agreement":null},{"id":"W2955472062","doi":"10.1016/j.trb.2019.06.006","title":"The electric vehicle routing problem with energy consumption uncertainty","year":2019,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":249,"is_retracted":false,"has_abstract":false,"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":"Vehicle routing problem; Mathematical optimization; Heuristic; Computer science; Energy consumption; Context (archaeology); Electric vehicle; Routing (electronic design automation); Operations research; Robust optimization; Engineering; Mathematics","score_opus":0.16889241896232268,"score_gpt":0.3911624713733028,"score_spread":0.2222700524109801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955472062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6763245,0.00028457542,0.31947142,0.00031757815,0.00013806131,0.00065022026,0.000007028972,0.00058718224,0.0022194206],"genre_scores_gemma":[0.9277926,0.00046779032,0.07094433,0.00004195182,0.00007247834,0.00017840504,0.000041961874,0.000045647834,0.00041480688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558985,0.0021871454,0.00043331843,0.00036360533,0.0007103435,0.00071574945],"domain_scores_gemma":[0.99455637,0.0046482515,0.000062524276,0.00031532472,0.0002837856,0.00013372434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007427437,0.00018101443,0.0002559309,0.00012134765,0.0003642927,0.00009709484,0.00027998065,0.00016417263,0.0002522609],"category_scores_gemma":[0.00024212635,0.0001178809,0.000062981475,0.00087954313,0.00013997711,0.00013380738,0.00000812833,0.0006530571,0.000064114945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003343302,0.000043857577,0.041247122,0.00009794625,0.00009683646,0.0000139179965,0.00037085018,0.8704417,0.021375569,0.032945324,0.00042892442,0.03260367],"study_design_scores_gemma":[0.001886973,0.00070161285,0.1298481,0.00012712103,0.000045650584,0.000009136441,0.00051131303,0.825379,0.018178577,0.003349005,0.019247953,0.0007155403],"about_ca_topic_score_codex":0.00004330031,"about_ca_topic_score_gemma":0.00007958116,"teacher_disagreement_score":0.25146812,"about_ca_system_score_codex":0.00009922209,"about_ca_system_score_gemma":0.000056368066,"threshold_uncertainty_score":0.4807044},"labels":[],"label_agreement":null},{"id":"W2955754236","doi":"10.1287/trsc.2018.0881","title":"Exact Solution of Several Families of Location-Arc Routing Problems","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Ministerio de Economía y Competitividad","keywords":"Arc routing; Mathematical optimization; Traverse; Routing (electronic design automation); Graph; Computer science; Set (abstract data type); Vehicle routing problem; Mathematics; Mixed graph; Social connectedness; Constraint (computer-aided design); Theoretical computer science; Line graph","score_opus":0.01570143438517315,"score_gpt":0.25899625266381293,"score_spread":0.24329481827863977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955754236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6135774,0.000017211818,0.385483,0.00000808279,0.0001086958,0.00012412126,0.000004470219,0.0000624173,0.00061460794],"genre_scores_gemma":[0.9573417,0.00001286967,0.042584796,0.0000045025977,0.000005777678,0.0000035046185,0.000008771026,0.000009530353,0.000028551145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989328,0.000015976946,0.0003845033,0.00014991473,0.00036164917,0.00015518087],"domain_scores_gemma":[0.9993562,0.000050034145,0.00011490707,0.00016580196,0.00028025243,0.000032767188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071901747,0.00007540199,0.00013519145,0.00016814533,0.000039491388,0.0000094804045,0.00016783008,0.000033366425,0.00003437926],"category_scores_gemma":[0.00003931572,0.00007982461,0.000027573988,0.0011221246,0.00013195326,0.00044464695,0.000002558286,0.000057959285,0.0000059848717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027799522,0.0000073940146,0.020746686,0.00012404646,0.000002940116,3.68684e-8,0.002130305,0.87940997,0.095776565,0.00080123503,0.0000013735566,0.0009966885],"study_design_scores_gemma":[0.00019773167,0.000021236512,0.24748152,0.00007751275,0.0000069340676,3.162983e-7,0.0002449174,0.7018143,0.049994502,0.000057767487,0.000010297199,0.00009293949],"about_ca_topic_score_codex":0.000044399407,"about_ca_topic_score_gemma":0.000012449635,"teacher_disagreement_score":0.3437643,"about_ca_system_score_codex":0.000034044337,"about_ca_system_score_gemma":0.00008147201,"threshold_uncertainty_score":0.32551533},"labels":[],"label_agreement":null},{"id":"W2956133935","doi":"10.1016/j.tre.2019.06.015","title":"The time-dependent location-routing problem","year":2019,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Vehicle routing problem; Mathematics; Computer network","score_opus":0.050619391118946436,"score_gpt":0.3429221920774899,"score_spread":0.2923028009585435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956133935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051618665,0.19305399,0.6963728,0.009389056,0.0019787666,0.019683506,0.0009456055,0.0031607016,0.023796888],"genre_scores_gemma":[0.81959033,0.16608235,0.009909127,0.00031004293,0.000112979236,0.0004730326,0.0010631372,0.00014057185,0.0023184456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975279,0.00019752816,0.0008105839,0.00032919232,0.00068857474,0.0004462308],"domain_scores_gemma":[0.998223,0.00061438535,0.000104518644,0.00032943505,0.000587063,0.0001416184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025898772,0.0002062233,0.00030259375,0.00008131094,0.00033474533,0.00009526703,0.00021268305,0.00009310457,0.00024061376],"category_scores_gemma":[0.00007989939,0.00016853352,0.0000631645,0.00070217426,0.0001373708,0.00015652545,0.0000020548507,0.00042500318,0.00019909993],"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.00007260179,0.00015323442,0.029501516,0.020685252,0.0003793353,0.00003793492,0.0016718818,0.7164934,0.0008165309,0.13406238,0.009239716,0.086886205],"study_design_scores_gemma":[0.0039616614,0.0005316326,0.14760925,0.013298842,0.0007662956,0.000009800602,0.0009518355,0.29524264,0.0009135046,0.0076945145,0.5261825,0.0028375578],"about_ca_topic_score_codex":0.000032721644,"about_ca_topic_score_gemma":0.00015187389,"teacher_disagreement_score":0.76797163,"about_ca_system_score_codex":0.000040050112,"about_ca_system_score_gemma":0.000074145464,"threshold_uncertainty_score":0.68725973},"labels":[],"label_agreement":null},{"id":"W2957530701","doi":"","title":"Heuristics for the dynamic facility location problem with modular capacities","year":2019,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Heuristics; Benchmark (surveying); Mathematical optimization; Modular design; Heuristic; Time horizon; Genetic algorithm; Computer science; Facility location problem; Variable (mathematics); Integer programming; Point (geometry); Mathematics","score_opus":0.008236871715568514,"score_gpt":0.2170081944015468,"score_spread":0.2087713226859783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957530701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06661488,0.00055786833,0.9293553,0.0005394744,0.00010536672,0.0015684819,0.00008992628,0.001007267,0.00016138954],"genre_scores_gemma":[0.68074733,0.00005779724,0.3179361,0.00014122514,0.00002467754,0.000538243,0.000038181908,0.000057741716,0.00045873906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986396,0.00007145955,0.0003244114,0.00026993122,0.00023365319,0.00046093183],"domain_scores_gemma":[0.9986104,0.0002750141,0.000089827874,0.00072956824,0.00020432776,0.00009088997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071826705,0.00026413947,0.0002475843,0.00012933683,0.00017410364,0.00011438267,0.0003247795,0.00016775464,0.000015094859],"category_scores_gemma":[0.00011204213,0.00021096309,0.00007052068,0.00038649185,0.0000904337,0.00019273309,0.000040370942,0.00029212292,0.000012508922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030269024,0.000021019394,0.0034044734,0.00018534847,0.00005363044,8.2266814e-7,0.0003082314,0.9846149,0.002222883,0.0025371676,0.00017842757,0.006442794],"study_design_scores_gemma":[0.00033766744,0.00007381474,0.0046140193,0.000038536225,0.000037277954,0.000018424633,0.00021352043,0.98981893,0.0027619856,0.0006560185,0.001153758,0.0002760274],"about_ca_topic_score_codex":0.00047767727,"about_ca_topic_score_gemma":0.00033486664,"teacher_disagreement_score":0.6141324,"about_ca_system_score_codex":0.00037274766,"about_ca_system_score_gemma":0.00008486392,"threshold_uncertainty_score":0.86028254},"labels":[],"label_agreement":null},{"id":"W2958866644","doi":"10.5267/j.ijiec.2019.6.001","title":"The electric vehicle routing problem with backhauls","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Backhaul (telecommunications); Vehicle routing problem; Computer science; Initialization; Mathematical optimization; Electric vehicle; Linear programming; Routing (electronic design automation); Computer network; Mathematics; Algorithm","score_opus":0.015070319391829097,"score_gpt":0.24871662331391664,"score_spread":0.23364630392208754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958866644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324508,0.00016071298,0.46104416,0.0012167749,0.003667344,0.0003045023,0.0000049616733,0.00022910749,0.00092162355],"genre_scores_gemma":[0.97680223,0.00002016107,0.022494344,0.000016483044,0.00057177385,0.0000032948424,0.000002857148,0.000039332368,0.000049498853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987884,0.00003772297,0.00044983617,0.00008267926,0.00044288853,0.00019848235],"domain_scores_gemma":[0.9986549,0.0005465703,0.00018209279,0.000097453536,0.00045030663,0.00006868946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352607,0.0001324867,0.00015818034,0.0002154277,0.00005968171,0.00018349443,0.00041365568,0.000070608665,0.000013592191],"category_scores_gemma":[0.0001696683,0.00010116381,0.00007090132,0.00040170297,0.000011576761,0.00024007521,0.000025377589,0.0004904245,0.000014360769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018668241,0.000009032716,0.001161407,0.0000026718901,0.00018779095,0.000006607889,0.000084506726,0.9866899,0.0015928696,0.0009607766,0.00024741268,0.009038305],"study_design_scores_gemma":[0.0011717756,0.00008882398,0.0006314038,0.00014214427,0.000020597532,0.00013244199,0.00005609574,0.9928231,0.0010773733,0.00005474849,0.003651248,0.00015021511],"about_ca_topic_score_codex":0.0000023964092,"about_ca_topic_score_gemma":5.2664956e-7,"teacher_disagreement_score":0.44435143,"about_ca_system_score_codex":0.00018421568,"about_ca_system_score_gemma":0.00009919347,"threshold_uncertainty_score":0.41253406},"labels":[],"label_agreement":null},{"id":"W2960400114","doi":"10.1287/trsc.2020.0988","title":"Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on Path-Based Models","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Path (computing); Algorithm; Arc (geometry); Variable (mathematics); Mathematics; Computer science; Geometry","score_opus":0.04511196812750818,"score_gpt":0.29447120525812354,"score_spread":0.24935923713061536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960400114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07452601,0.000021087391,0.9243118,0.00024267571,0.00010083657,0.00022934622,0.000024595856,0.00016584597,0.00037777604],"genre_scores_gemma":[0.68209356,0.0000035064018,0.3176022,0.00023733248,0.00001581965,0.000024699662,0.0000078859575,0.000011357473,0.000003640089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.000017318178,0.00025603324,0.00029462687,0.0002704451,0.00026380172],"domain_scores_gemma":[0.999545,0.00014720204,0.000038188296,0.00009187644,0.000072023824,0.00010572814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007252641,0.000106890744,0.00013445709,0.00011331424,0.00010557326,0.00005338548,0.00017082151,0.000033865505,0.000012565582],"category_scores_gemma":[0.00006549926,0.0001127115,0.000021128502,0.00095968007,0.00008241612,0.00044841846,0.0000018758752,0.00009453077,0.0000016287307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007839156,0.000005102483,0.0003417898,0.000046636997,0.0000012328206,9.2232744e-7,0.0011078693,0.98047596,0.012821298,0.0033237094,0.0000032897835,0.0018643185],"study_design_scores_gemma":[0.0005061593,0.000031438445,0.0010081268,0.000037654398,0.000004470661,1.6204774e-7,0.000048100002,0.9844742,0.012042506,0.001686109,0.000028416713,0.00013265177],"about_ca_topic_score_codex":0.000021876078,"about_ca_topic_score_gemma":0.000008193983,"teacher_disagreement_score":0.60756755,"about_ca_system_score_codex":0.000039693045,"about_ca_system_score_gemma":0.000090753194,"threshold_uncertainty_score":0.45962417},"labels":[],"label_agreement":null},{"id":"W2963443214","doi":"10.1287/ijoc.2018.0869","title":"A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Bounded function; Network planning and design; Backup; Mathematical optimization; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Benchmark (surveying); Graph; Hop (telecommunications); Algorithm; Discrete mathematics","score_opus":0.023120167328931438,"score_gpt":0.27374386999094885,"score_spread":0.2506237026620174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963443214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0358852,0.000048654387,0.96168894,0.00007062108,0.00063838385,0.0007280933,7.221537e-7,0.0001900475,0.0007493175],"genre_scores_gemma":[0.6465995,0.0000024414792,0.35301292,0.000111387264,0.0002234929,0.0000035964013,0.0000015237188,0.000021308093,0.000023887307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878067,0.000048565555,0.00044299473,0.00010637732,0.00023657485,0.00038480217],"domain_scores_gemma":[0.9981703,0.001227446,0.0001921756,0.00016337058,0.00018386082,0.00006281504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022847587,0.00017083692,0.00019039646,0.000048423488,0.00035951118,0.00021103288,0.00019295896,0.0000632074,0.00001869922],"category_scores_gemma":[0.000096031275,0.00010106125,0.00007444265,0.00025779696,0.000024329884,0.00029874942,0.000020893473,0.00055491936,0.000008550767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006301103,0.0000038242133,0.0016150369,0.000028221186,0.00005174749,4.6341006e-7,0.00019243016,0.90071404,0.000022997818,0.00081241195,0.000103350896,0.09639249],"study_design_scores_gemma":[0.00085699715,0.00015412907,0.0022143354,0.00016088744,0.000013290833,0.00010944552,0.000048772417,0.9950852,0.00019788818,0.0005286441,0.00046564033,0.000164818],"about_ca_topic_score_codex":6.44624e-7,"about_ca_topic_score_gemma":4.5781346e-7,"teacher_disagreement_score":0.61071426,"about_ca_system_score_codex":0.00012799891,"about_ca_system_score_gemma":0.000057229146,"threshold_uncertainty_score":0.4121158},"labels":[],"label_agreement":null},{"id":"W2963813097","doi":"10.1109/tits.2018.2865893","title":"Joint Ground and Aerial Package Delivery Services: A Stochastic Optimization Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Singapore Institute of Manufacturing Technology","keywords":"Drone; Computer science; Benchmark (surveying); Suite; Operations research; Stochastic programming; Takeoff; Mathematical optimization; Engineering; Mathematics","score_opus":0.026419990522462487,"score_gpt":0.23868458060270087,"score_spread":0.21226459008023837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963813097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04536876,0.00009925876,0.9510882,0.0000064643336,0.0018619611,0.0006471369,0.00010501935,0.00060122943,0.00022196879],"genre_scores_gemma":[0.9680197,0.000104973,0.03126071,0.000028347074,0.00019587131,0.00014205147,0.00007422407,0.00009034347,0.00008373472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817085,0.00010404424,0.00070919975,0.00039055903,0.00033104696,0.00029428137],"domain_scores_gemma":[0.9991754,0.00007044832,0.000099959354,0.00028048662,0.00021518003,0.00015847162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030600815,0.00031639668,0.00033526073,0.0003150437,0.00023617139,0.00014432051,0.00011912604,0.00020181533,0.0000847259],"category_scores_gemma":[0.0000018641746,0.0003401575,0.00009197406,0.00043496044,0.0000910324,0.00032572632,3.1027318e-7,0.00021396599,0.00003190553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000473875,0.000059207952,0.000005632891,0.0002756658,0.00009252976,0.0000012205128,0.0027556363,0.99443173,0.00087051146,0.000076940196,0.000008133761,0.0013754107],"study_design_scores_gemma":[0.00043595865,0.00010861341,0.000058681246,0.00015192805,0.00010609201,0.000013552897,0.0012355496,0.9927329,0.0047623087,0.000005881585,0.000049889506,0.00033868948],"about_ca_topic_score_codex":0.000124175,"about_ca_topic_score_gemma":0.000043767875,"teacher_disagreement_score":0.922651,"about_ca_system_score_codex":0.00011198969,"about_ca_system_score_gemma":0.000022303888,"threshold_uncertainty_score":0.99990505},"labels":[],"label_agreement":null},{"id":"W2964487007","doi":"10.1016/j.ejor.2019.07.049","title":"Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and ‘grey zone’ customers arising in urban logistics","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":150,"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; Österreichische Forschungsförderungsgesellschaft","keywords":"Vehicle routing problem; Computer science; Operations research; Synchronization (alternating current); City logistics; Routing (electronic design automation); Business; Mathematical optimization; Transport engineering; Computer network; Mathematics; Engineering","score_opus":0.038374522156203794,"score_gpt":0.3206628979252961,"score_spread":0.2822883757690923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964487007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36082613,0.00015618405,0.63707,0.00006140689,0.00005438183,0.0002945456,0.00000344749,0.000021125776,0.0015127651],"genre_scores_gemma":[0.7739227,0.000046139285,0.2258558,0.000008120157,0.00005723432,0.0000012270166,0.0000060019797,0.000046799807,0.0000560137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973022,0.0009965926,0.0006176559,0.00018540511,0.00062953954,0.00026864978],"domain_scores_gemma":[0.9981182,0.00032283098,0.00017061795,0.00012996257,0.0011645526,0.00009382071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046110814,0.00013546426,0.00023357349,0.0004733129,0.000106646556,0.00012937057,0.000174272,0.000039499,0.000025358871],"category_scores_gemma":[0.0005203895,0.00012487512,0.000026019075,0.0007778958,0.00010079681,0.00048785907,0.000063885,0.0005987993,0.000006492311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006686402,0.000048753795,0.026278384,0.00006066662,0.000030401792,0.000021513386,0.0014367796,0.95988965,0.010198496,0.00018772317,0.0000115375215,0.0017692219],"study_design_scores_gemma":[0.0019053692,0.00027654984,0.011051942,0.00033061634,0.000008823462,0.00003122728,0.00045959596,0.984259,0.001527768,0.000004190088,0.000014791563,0.0001300954],"about_ca_topic_score_codex":0.000014948688,"about_ca_topic_score_gemma":0.0000055125997,"teacher_disagreement_score":0.41309652,"about_ca_system_score_codex":0.00024675007,"about_ca_system_score_gemma":0.00017641821,"threshold_uncertainty_score":0.50922596},"labels":[],"label_agreement":null},{"id":"W2964779613","doi":"10.1155/2019/3201656","title":"A New Ant Colony Optimization Algorithm to Solve the Periodic Capacitated Arc Routing Problem with Continuous Moves","year":2019,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"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; Center for Interuniversity Research and Analysis on Organizations","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Arc routing; Tabu search; Ant colony optimization algorithms; Mathematical optimization; Routing (electronic design automation); Arc (geometry); Computer science; Ant colony; Algorithm; Metaheuristic; Mathematics; Computer network","score_opus":0.007159781880296249,"score_gpt":0.20567763480277604,"score_spread":0.19851785292247978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964779613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008044044,0.000082938874,0.98827016,0.00012666621,0.0001180571,0.001405322,0.0000033903068,0.0006500011,0.0012994326],"genre_scores_gemma":[0.16952327,0.000007097225,0.82998055,0.00003268037,0.000048972244,0.00012364933,0.000005484321,0.00012766605,0.00015065429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812293,0.000032480853,0.00059263466,0.0003210849,0.0003257475,0.00060510944],"domain_scores_gemma":[0.9990379,0.00029618698,0.00006483059,0.00036849847,0.000066726454,0.00016582866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007330743,0.0003469275,0.00045840832,0.00019447097,0.000056226116,0.00016444316,0.0002910795,0.00012664388,0.00009660118],"category_scores_gemma":[0.00014507385,0.00026736988,0.000051966632,0.0008209643,0.000023578052,0.00019168598,0.000070058326,0.00043771323,0.000050620227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034985076,0.000019624667,0.00009732465,0.00030292902,0.000036903708,0.000003709881,0.0029652347,0.99185055,0.0013253975,0.0009582532,0.000036643723,0.002399921],"study_design_scores_gemma":[0.00058217347,0.000080203215,0.00003959522,0.0007006248,0.00001758678,0.000033618486,0.00019983458,0.9971491,0.00042538266,0.00029398227,0.00010132163,0.0003765843],"about_ca_topic_score_codex":0.000018465224,"about_ca_topic_score_gemma":0.0000035725297,"teacher_disagreement_score":0.16147922,"about_ca_system_score_codex":0.00018179853,"about_ca_system_score_gemma":0.00003850625,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W2964913780","doi":"10.1016/j.omega.2019.07.009","title":"Strategic and operational decision-making in expanding supply chains for LNG as a fuel","year":2019,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada","keywords":"Bunker; Truck; Liquefied natural gas; Supply chain; Operations research; Greenhouse gas; Offset (computer science); Transport engineering; Engineering; Computer science; Natural gas; Waste management; Business; Automotive engineering; Coal","score_opus":0.018471173390760213,"score_gpt":0.30275367998788977,"score_spread":0.28428250659712956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964913780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9156696,0.00017476214,0.07857774,0.00003929724,0.00020466707,0.00026876468,0.000006744698,0.00008005467,0.004978341],"genre_scores_gemma":[0.88717115,0.00002013239,0.11257897,0.000041430398,0.000045020304,0.000023007195,0.0000060493157,0.000024205068,0.00009004852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940276,0.000017637813,0.00016831783,0.00014970299,0.00009211763,0.00016947874],"domain_scores_gemma":[0.99949807,0.0003337091,0.000016790915,0.000095700576,0.000023370398,0.000032367498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031232295,0.000090002206,0.00012389326,0.00013097777,0.00003499391,0.00007976834,0.00006234265,0.000060196915,0.00008289538],"category_scores_gemma":[0.00008282125,0.00009544825,0.00002050351,0.00015483436,0.0000072455664,0.00015141217,0.00001984187,0.00008177453,0.0000129815435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036841746,0.000019453693,0.022373151,0.00016123448,0.000021657712,0.0000054930497,0.0013338089,0.9120139,0.006777755,0.045096725,0.000061571176,0.012098421],"study_design_scores_gemma":[0.0008236084,0.000034470282,0.005039234,0.00016038661,0.00000367389,0.0000114812465,0.00040153778,0.988758,0.00022452894,0.0040188693,0.0003325525,0.000191616],"about_ca_topic_score_codex":0.0000029831688,"about_ca_topic_score_gemma":0.000009935015,"teacher_disagreement_score":0.076744154,"about_ca_system_score_codex":0.000053081472,"about_ca_system_score_gemma":0.000021530577,"threshold_uncertainty_score":0.3892267},"labels":[],"label_agreement":null},{"id":"W2965363856","doi":"10.24963/ijcai.2019/782","title":"On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows","year":2019,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","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":"York University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Vehicle routing problem; Solver; Pickup; Set (abstract data type); Mathematical optimization; Computational complexity theory; Metaheuristic; Theoretical computer science; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","score_opus":0.02812422643871574,"score_gpt":0.2472558387060989,"score_spread":0.21913161226738317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965363856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6842114,0.000009025994,0.291575,0.00004832576,0.000052881613,0.0005204907,0.00002118867,0.00028540316,0.023276335],"genre_scores_gemma":[0.7819001,0.0000015818945,0.21767929,0.000032402742,0.0000050076314,0.000003214171,0.000007711974,0.000014793671,0.0003559049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993624,0.00003839234,0.00017886313,0.00013792039,0.00016479346,0.00011761881],"domain_scores_gemma":[0.99947137,0.0002628598,0.000041033585,0.000110213376,0.00007074124,0.00004380653],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016533476,0.00010436545,0.00017252978,0.000051901636,0.00002085135,0.000014618894,0.000071417664,0.000040301842,0.0011544203],"category_scores_gemma":[0.00002088576,0.00007983545,0.0000146600205,0.0001186709,0.00014831974,0.00007999276,0.00001895951,0.000086906904,0.00006568658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003100417,0.000018173047,0.0019138174,0.000081612176,0.000029598576,4.6517857e-7,0.00012708388,0.99324816,0.00068723114,0.0026720983,0.000062893916,0.0011278562],"study_design_scores_gemma":[0.0007003825,0.0001669466,0.0055954894,0.000109101835,0.0000069955354,0.000016029817,0.000024571971,0.99188393,0.00085078686,0.00049325975,0.00001352564,0.000138978],"about_ca_topic_score_codex":0.000006454299,"about_ca_topic_score_gemma":0.000003128548,"teacher_disagreement_score":0.09768874,"about_ca_system_score_codex":0.000021608574,"about_ca_system_score_gemma":0.00003166507,"threshold_uncertainty_score":0.99975866},"labels":[],"label_agreement":null},{"id":"W2965762698","doi":"10.1016/j.ins.2019.08.017","title":"Solving the traveling repairman problem with profits: A Novel variable neighborhood search approach","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; National Natural Science Foundation of China","keywords":"Variable neighborhood search; Heuristics; Mathematical optimization; Benchmark (surveying); Variable (mathematics); Replicate; Computer science; Heuristic; Local search (optimization); Profit (economics); Mathematics; Metaheuristic; Operations research; Statistics; Economics","score_opus":0.018931491975604054,"score_gpt":0.2396039903047542,"score_spread":0.22067249832915015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965762698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01923205,0.000013190617,0.83490247,0.00007745767,0.00008627233,0.00048152325,0.000002540517,0.00028950177,0.14491501],"genre_scores_gemma":[0.590046,0.000002512805,0.40972742,0.000094138806,0.000021517522,0.000025607544,0.000004885592,0.0000076646065,0.000070281596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987943,0.000031118707,0.00029449144,0.00011567146,0.0004822838,0.00028212287],"domain_scores_gemma":[0.9994777,0.0000954775,0.00006998032,0.00019259322,0.00012456774,0.000039671115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192785,0.00010659842,0.00010164051,0.00010421549,0.00026833697,0.00038347967,0.0003464908,0.00004445585,0.00003118519],"category_scores_gemma":[0.00004014091,0.00006670948,0.000018380875,0.001084678,0.00007535088,0.0020071918,0.000039416525,0.00017077517,0.00004546436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020720097,0.000004926238,0.0012280416,0.00007145344,0.000007626294,1.7651868e-8,0.003591148,0.98695654,0.00026576713,0.0053791096,0.00002784035,0.0024654425],"study_design_scores_gemma":[0.00020487186,0.000033958982,0.0004412012,0.000037472477,0.0000038003043,0.000014121202,0.0022958878,0.9957338,0.00034914628,0.000035608155,0.0007312025,0.0001189088],"about_ca_topic_score_codex":0.000017418506,"about_ca_topic_score_gemma":4.4460944e-7,"teacher_disagreement_score":0.5708139,"about_ca_system_score_codex":0.000038478436,"about_ca_system_score_gemma":0.000102896935,"threshold_uncertainty_score":0.36979032},"labels":[],"label_agreement":null},{"id":"W2966130377","doi":"10.1287/ijoc.2020.1039","title":"Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","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":"University of Toronto","funders":"","keywords":"Mathematics; Vertex (graph theory); Discretization; Integer programming; Constraint programming; Combinatorics; Mathematical optimization; Discrete mathematics; Graph","score_opus":0.04288099152760674,"score_gpt":0.27726845819022056,"score_spread":0.2343874666626138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966130377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17574032,0.00055456016,0.82070434,0.00015117423,0.00095562765,0.00078316184,0.000011742486,0.00044080525,0.0006582501],"genre_scores_gemma":[0.5923528,0.00005197005,0.40703908,0.00006906995,0.00028919283,0.000027760492,0.000068640344,0.00008332745,0.000018142917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967818,0.00010226145,0.0012388682,0.0005213729,0.0005547063,0.0008009867],"domain_scores_gemma":[0.9982389,0.00016568531,0.0005036538,0.00039890088,0.00022390699,0.00046890817],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017566821,0.0006292715,0.0007299701,0.00048775098,0.00035753404,0.002219252,0.0004310396,0.00026663695,0.000016504518],"category_scores_gemma":[0.00019756482,0.00058568316,0.00021799166,0.00043226933,0.00010526675,0.00031015603,0.00058830954,0.0024019978,0.000004548306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000904647,0.000041685365,0.0009838981,0.0005298572,0.00012937178,0.000035305387,0.0010469144,0.68774,0.000012305441,0.00019249842,0.000043270626,0.3092358],"study_design_scores_gemma":[0.00059699535,0.00020946722,0.0005242768,0.0047643604,0.00007386162,0.0011486473,0.0009129473,0.98340285,0.0006338204,0.00025468346,0.006281905,0.0011961686],"about_ca_topic_score_codex":0.000006640321,"about_ca_topic_score_gemma":0.0000029017526,"teacher_disagreement_score":0.4166125,"about_ca_system_score_codex":0.0004414934,"about_ca_system_score_gemma":0.00013051918,"threshold_uncertainty_score":0.9998995},"labels":[],"label_agreement":null},{"id":"W2970460007","doi":"10.1016/j.ijpe.2019.08.007","title":"The multi-plant perishable food production routing with packaging consideration","year":2019,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Food spoilage; Production (economics); Supply chain; Routing (electronic design automation); Mathematical optimization; Integer (computer science); Vehicle routing problem; Operations research; Process (computing); Integer programming; Selection (genetic algorithm); Algorithm; Mathematics; Business; Economics; Artificial intelligence","score_opus":0.01566775008233696,"score_gpt":0.2307604342598984,"score_spread":0.21509268417756144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970460007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94682586,0.000119180004,0.038062163,0.0026242514,0.0117507875,0.0002190993,0.000004853332,0.00007353998,0.0003202418],"genre_scores_gemma":[0.96698326,0.00022702786,0.031436116,0.000027899534,0.0009723664,0.0000036297456,0.0000058278756,0.000031446092,0.00031240276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990069,0.00005050011,0.0004991409,0.00015221952,0.00015321509,0.00013798666],"domain_scores_gemma":[0.9988954,0.00006338695,0.00037091385,0.00015497212,0.00047891698,0.000036424157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093219447,0.00011578693,0.00013832991,0.00012887118,0.000110237685,0.0002045521,0.00018588151,0.000038521368,0.000016843096],"category_scores_gemma":[0.00025686208,0.00009242901,0.000048923204,0.00007226817,0.000032334006,0.00071145495,0.000018203515,0.00023103046,0.000012470499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050113158,0.000018268622,0.008073366,0.000007721739,0.00020987268,0.0000011285848,0.0003672371,0.9834401,0.002161441,0.0005595406,0.00028637514,0.0048248633],"study_design_scores_gemma":[0.0024015312,0.0003560279,0.0066297567,0.00031801226,0.0000900082,0.004525973,0.0033693472,0.83193916,0.1262888,0.00072850066,0.022605192,0.0007476755],"about_ca_topic_score_codex":0.0000015959441,"about_ca_topic_score_gemma":0.0000171094,"teacher_disagreement_score":0.1515009,"about_ca_system_score_codex":0.0002659916,"about_ca_system_score_gemma":0.0000751707,"threshold_uncertainty_score":0.37691453},"labels":[],"label_agreement":null},{"id":"W2973679003","doi":"10.5267/j.dsl.2019.7.003","title":"A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery","year":2019,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Khon Kaen University","keywords":"Vehicle routing problem; Computer science; Phase (matter); Routing (electronic design automation); Transport engineering; Operations research; Automotive engineering; Engineering; Computer network","score_opus":0.04887680044610048,"score_gpt":0.3264399826008187,"score_spread":0.2775631821547182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973679003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56004196,0.000008479974,0.43865138,0.00003164523,0.00007542424,0.0011096079,0.000004947112,0.000065199965,0.000011328636],"genre_scores_gemma":[0.6886461,3.1944444e-7,0.31100422,0.00022101276,0.000016714002,0.000078624274,9.636357e-7,0.000030032505,0.0000020432299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997585,0.00005940072,0.00051188876,0.0005815775,0.00076547574,0.0004966422],"domain_scores_gemma":[0.9982462,0.00065181183,0.00016504813,0.000681549,0.00014746531,0.00010791602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024956244,0.00024858286,0.00031222127,0.00025465185,0.00029984186,0.00018129428,0.00057993387,0.00003318223,0.0000023499888],"category_scores_gemma":[0.000102149184,0.00017115634,0.00008173039,0.0009254094,0.00016399373,0.0002744183,0.00011845747,0.00018667817,0.0000045268703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000739091,0.0003486029,0.0018784266,0.000022594762,0.00002620711,0.00003106004,0.0034876906,0.8815406,0.108206205,0.0000068600566,0.000010343254,0.0043674866],"study_design_scores_gemma":[0.0046099056,0.0003577652,0.0002563479,0.00006115093,0.000026216576,0.00022872571,0.002810813,0.9850043,0.0064078267,0.0000018365383,0.000009662938,0.00022546442],"about_ca_topic_score_codex":0.00003674897,"about_ca_topic_score_gemma":0.000007254202,"teacher_disagreement_score":0.12860407,"about_ca_system_score_codex":0.00015062357,"about_ca_system_score_gemma":0.00004308907,"threshold_uncertainty_score":0.6979553},"labels":[],"label_agreement":null},{"id":"W2974438822","doi":"10.1287/ijoc.2018.0881","title":"An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; Mathematical optimization; Lagrangian relaxation; Lagrangian; Mathematics; Travelling salesman problem; Branch and bound; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.01822810706720267,"score_gpt":0.25650438329130326,"score_spread":0.23827627622410058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974438822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61303043,0.000022303335,0.38325697,0.00012883509,0.00045674614,0.00018465263,0.0000016062079,0.00017529048,0.0027431506],"genre_scores_gemma":[0.8786737,0.0000026994128,0.12028499,0.0007568021,0.00023541189,0.0000010505889,0.00000298975,0.0000308432,0.0000115189305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878544,0.00007979908,0.00038179144,0.00013460703,0.0002861913,0.00033214854],"domain_scores_gemma":[0.99909776,0.0002209581,0.00009762499,0.0002965556,0.000086970664,0.0002001075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013548791,0.00018368069,0.00020468261,0.00016622062,0.00026144675,0.00029051007,0.00035747126,0.00007925044,0.000012809826],"category_scores_gemma":[0.0000662715,0.00012770799,0.0000726477,0.00024302973,0.000017371267,0.00024014355,0.000046631885,0.00062270026,0.00005782732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011240865,0.000018725512,0.0018472208,0.000020569003,0.000016722159,0.000001081776,0.00073068944,0.93145555,0.00011072158,0.00011116499,0.000083422194,0.06559287],"study_design_scores_gemma":[0.0005143905,0.000085214946,0.012274133,0.00006090239,0.000007684111,0.000042355354,0.00019285218,0.9848351,0.00021203476,0.000009798559,0.001574325,0.0001912461],"about_ca_topic_score_codex":0.0000074192667,"about_ca_topic_score_gemma":9.571382e-7,"teacher_disagreement_score":0.26564324,"about_ca_system_score_codex":0.00009205374,"about_ca_system_score_gemma":0.000029119861,"threshold_uncertainty_score":0.52077806},"labels":[],"label_agreement":null},{"id":"W2978059148","doi":"10.1016/j.tre.2019.09.016","title":"An exact algorithm for the inventory routing problem with logistic ratio","year":2019,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Time horizon; Mathematical optimization; Routing (electronic design automation); Algorithm; Computer science; Function (biology); Distribution (mathematics); Mathematics","score_opus":0.09468338248980823,"score_gpt":0.3723578190204224,"score_spread":0.2776744365306142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978059148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019830535,0.0061083515,0.98805094,0.00025228446,0.000111140434,0.0029052375,0.00022369435,0.00020053389,0.00016478334],"genre_scores_gemma":[0.7835745,0.053521156,0.1572682,0.0004235374,0.00019219595,0.0015521541,0.0029606065,0.0001979375,0.00030969374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978665,0.00015630679,0.000649362,0.00038256662,0.00052267,0.00042260345],"domain_scores_gemma":[0.99830246,0.00057760323,0.0001129505,0.0003446259,0.0005090356,0.0001533389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064582,0.00023549054,0.00035735514,0.00009211547,0.0002626239,0.000083871055,0.00020607954,0.00009116469,0.00012683366],"category_scores_gemma":[0.00003535651,0.00017463171,0.00006748988,0.0005012179,0.00016600851,0.00023058194,9.554857e-7,0.00035702682,0.0000099159015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074645024,0.00016442266,0.017399777,0.012612342,0.00031349316,0.000023114651,0.0014991666,0.77376705,0.00020457049,0.049080785,0.0010191208,0.14384153],"study_design_scores_gemma":[0.0015934254,0.00055068394,0.029495861,0.0022356012,0.00043661144,0.0000025152592,0.0004254319,0.934086,0.00012454648,0.000758086,0.02961347,0.0006777635],"about_ca_topic_score_codex":0.000055618268,"about_ca_topic_score_gemma":0.0002692187,"teacher_disagreement_score":0.8307827,"about_ca_system_score_codex":0.000034509907,"about_ca_system_score_gemma":0.00008788258,"threshold_uncertainty_score":0.7121275},"labels":[],"label_agreement":null},{"id":"W2978804656","doi":"10.1002/9780470400531.eorms1107","title":"Continuous Optimization by Variable Neighborhood Search","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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; Royal Military College of Canada; Group for Research in Decision Analysis; Royal Ottawa Mental Health Centre","funders":"","keywords":"Metaheuristic; Variable neighborhood search; Mathematical optimization; Continuous variable; Variable (mathematics); Computer science; Continuous optimization; Local search (optimization); Section (typography); Optimization problem; Mathematics; Multi-swarm optimization","score_opus":0.021397446484316636,"score_gpt":0.2968403791596312,"score_spread":0.27544293267531456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978804656","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010488521,0.0007555848,0.31509992,0.000016767839,0.00015455493,0.00067880546,0.00004123009,0.00015412657,0.6830885],"genre_scores_gemma":[0.00044163765,0.053871587,0.48448578,0.000014739119,0.00009446948,0.00017115574,0.00008820919,0.00025071812,0.46058172],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977592,0.00010239507,0.00029267478,0.0004750914,0.00081783446,0.00055276445],"domain_scores_gemma":[0.99900144,0.00004273635,0.000025596584,0.00050221727,0.00023454998,0.00019343775],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016459223,0.00019927282,0.00024041787,0.0010945166,0.00026888985,0.00017248653,0.000620158,0.0001230297,0.0014125014],"category_scores_gemma":[0.000109830595,0.000202283,0.000017613114,0.0017435934,0.0006548578,0.0002967463,0.00030125416,0.00027364408,0.00003290286],"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.0000071336294,0.0001931391,0.00017252509,0.000713887,0.000111037014,0.0000059122394,0.0003869441,0.42481267,0.00031384503,0.025879808,0.530673,0.016730092],"study_design_scores_gemma":[0.00054988184,0.00016697965,0.000036729056,0.0004865105,0.000033240594,0.000002803875,0.00026045064,0.77267456,0.0002365487,0.00010669199,0.22490594,0.00053964066],"about_ca_topic_score_codex":0.00022358226,"about_ca_topic_score_gemma":0.000016478329,"teacher_disagreement_score":0.34786192,"about_ca_system_score_codex":0.0000658021,"about_ca_system_score_gemma":0.00009949966,"threshold_uncertainty_score":0.99950033},"labels":[],"label_agreement":null},{"id":"W2978805836","doi":"10.4018/ijamc.2020010102","title":"An Efficient VNS Algorithm to Solve the Multi-Attribute Technician Routing and Scheduling Problem","year":2019,"lang":"en","type":"article","venue":"International Journal of Applied Metaheuristic Computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Variable neighborhood search; Computer science; Tabu search; Mathematical optimization; Technician; Meta heuristic; Job shop scheduling; Heuristic; Metaheuristic; Solver; Overtime; Scheduling (production processes); Algorithm; Routing (electronic design automation); Artificial intelligence; Mathematics; Engineering","score_opus":0.010689592422019686,"score_gpt":0.27545001590261187,"score_spread":0.2647604234805922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978805836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15686576,0.00007337439,0.8414624,0.00016990145,0.0008061854,0.00024627108,0.0000038890935,0.00009513731,0.00027711524],"genre_scores_gemma":[0.5303352,0.000003970113,0.46930313,0.00007223503,0.00025507525,0.0000013009054,0.0000016310826,0.000025052375,0.000002433355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981624,0.00004407338,0.00078303344,0.00021987683,0.00051570695,0.00027491763],"domain_scores_gemma":[0.99853426,0.00040262443,0.00033981205,0.00018981814,0.00039866453,0.00013482294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021246672,0.00020557707,0.00032414487,0.00027144232,0.00011599877,0.00017104296,0.0006177358,0.000060994626,0.000014018934],"category_scores_gemma":[0.00015207328,0.00016434702,0.000068591966,0.00026758018,0.000038598388,0.00007110787,0.00015293933,0.00044893377,0.000011149991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008333561,0.000025726762,0.00022322568,0.000010403229,0.00011297443,0.0000064137503,0.001007399,0.9357686,0.0054893196,0.0013236386,0.000008936857,0.05601505],"study_design_scores_gemma":[0.00062368956,0.000044703927,0.0010206939,0.00015158043,0.00004328408,0.00008937183,0.0005661102,0.99571747,0.0011878408,0.000111585185,0.00025788465,0.00018579552],"about_ca_topic_score_codex":0.000005172315,"about_ca_topic_score_gemma":5.9344745e-7,"teacher_disagreement_score":0.3734694,"about_ca_system_score_codex":0.0001364793,"about_ca_system_score_gemma":0.000034041586,"threshold_uncertainty_score":0.67018765},"labels":[],"label_agreement":null},{"id":"W2981013975","doi":"10.1287/trsc.2019.0913","title":"Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pairing Problem","year":2019,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Crew scheduling; Computer science; Operations research; Crew resource management; Schedule; Column generation; Scheduling (production processes); Aviation; Mathematical optimization; Aeronautics; Operations management; Engineering; Mathematics","score_opus":0.018296338483712423,"score_gpt":0.25626094630158225,"score_spread":0.23796460781786982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981013975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9083627,0.00013013113,0.088015124,0.000077868615,0.00017510923,0.00043469892,0.0000070836973,0.0002818598,0.0025154117],"genre_scores_gemma":[0.9611992,0.00001755914,0.03858259,0.00009096639,0.000013765496,0.000032717428,0.0000072290854,0.000022221384,0.00003371202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982169,0.00005349867,0.00044572915,0.00037017776,0.00049628026,0.00041741025],"domain_scores_gemma":[0.9993317,0.00017063979,0.00008652885,0.00027424278,0.000069662165,0.00006722773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016521753,0.00017496651,0.00017956487,0.00016746204,0.00014643767,0.00015074444,0.0004791321,0.00005499701,0.000052415668],"category_scores_gemma":[0.00004907912,0.00015179621,0.000035477617,0.001017362,0.00011544927,0.00094071584,0.000009832457,0.00023396744,0.000018021583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056298404,0.00001648245,0.041071516,0.00026679822,0.000005274965,0.0000038059316,0.008374728,0.8068895,0.12748207,0.00038015482,0.000017750337,0.015486285],"study_design_scores_gemma":[0.001144749,0.00009742693,0.25756872,0.0005042786,0.000029622544,0.000012531928,0.0038853746,0.6699768,0.06475295,0.00040312947,0.0006349928,0.0009894898],"about_ca_topic_score_codex":0.000106407904,"about_ca_topic_score_gemma":0.000096003176,"teacher_disagreement_score":0.2164972,"about_ca_system_score_codex":0.000065076456,"about_ca_system_score_gemma":0.00007678416,"threshold_uncertainty_score":0.619007},"labels":[],"label_agreement":null},{"id":"W2981178732","doi":"","title":"A general variable neighborhood search for the travelling salesman problem with draft limits","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Université Laval","funders":"","keywords":"Travelling salesman problem; Traveling purchaser problem; Variable neighborhood search; Mathematical optimization; Limit (mathematics); Hull; 2-opt; Set (abstract data type); Variable (mathematics); Computer science; Context (archaeology); Bottleneck traveling salesman problem; Mathematics; Metaheuristic; Engineering; Geography","score_opus":0.019853393059819625,"score_gpt":0.2370067501492878,"score_spread":0.21715335708946817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981178732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009211467,0.00065401435,0.9625177,0.0021663646,0.00016856666,0.001424394,0.0000484969,0.00054978544,0.023259252],"genre_scores_gemma":[0.1713274,0.00041614406,0.8218828,0.000050572784,0.000073523486,0.00050583394,0.0002819237,0.00016748134,0.0052943504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960154,0.0019545117,0.0005142961,0.00060250197,0.00037769164,0.0005355492],"domain_scores_gemma":[0.99377066,0.0023654357,0.00019818255,0.0017095166,0.0017949858,0.00016123058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0054494217,0.00039800684,0.0003766577,0.00014436431,0.00044265334,0.0006705462,0.0012166003,0.00031171786,0.000088720946],"category_scores_gemma":[0.0002872587,0.0003349247,0.00013555186,0.00042826997,0.00013654902,0.00013093288,0.0003657977,0.0008633548,0.000016561073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011872163,0.00015034991,0.0005989928,0.0006119501,0.00030618484,9.635623e-7,0.0074475924,0.87040335,0.0025208609,0.08449604,0.0006220929,0.032829754],"study_design_scores_gemma":[0.00047619903,5.6979735e-7,0.00037917215,0.00087104377,0.00008107129,0.0000068416257,0.000060900158,0.9770824,0.016213406,0.0015466118,0.0028690817,0.00041271746],"about_ca_topic_score_codex":0.00032976316,"about_ca_topic_score_gemma":0.00013927334,"teacher_disagreement_score":0.16211593,"about_ca_system_score_codex":0.0001337598,"about_ca_system_score_gemma":0.00025465348,"threshold_uncertainty_score":0.9999103},"labels":[],"label_agreement":null},{"id":"W2982060258","doi":"10.1051/matecconf/201929602009","title":"Optimization of DND Multi-Depot Split-Load Pickup-Delivery Problem","year":2019,"lang":"en","type":"article","venue":"MATEC Web of Conferences","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":true,"ca_institutions":"Public Safety Canada; Defence Research and Development Canada","funders":"","keywords":"Pickup; Heuristic; Computer science; Descent (aeronautics); Mathematical optimization; Ground transportation; Vehicle routing problem; Depot; Range (aeronautics); Greedy algorithm; Operations research; Transport engineering; Engineering; Routing (electronic design automation); Computer network; Mathematics; Algorithm","score_opus":0.018466011410109128,"score_gpt":0.24346451760024254,"score_spread":0.22499850619013342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982060258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7396459,0.00032126025,0.21405491,0.000036057674,0.00039731426,0.0005156501,0.000026497351,0.0003767863,0.044625618],"genre_scores_gemma":[0.7775342,0.00010055695,0.22208923,0.0000045476218,0.000010366474,0.0000065203835,0.0000074417712,0.000019453142,0.00022770853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989262,0.000056166205,0.00044328716,0.0001603575,0.00024360201,0.0001703764],"domain_scores_gemma":[0.9992397,0.00007796439,0.00015215104,0.00022728232,0.00026415868,0.00003878881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003250155,0.00014719456,0.00031271233,0.00011577526,0.000017697834,0.000025342597,0.00020828353,0.00010907624,0.00064707996],"category_scores_gemma":[0.000038775037,0.000144451,0.00005028563,0.00021535046,0.000052691634,0.00014333107,0.000040426065,0.000090787646,0.000023483615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009317136,0.000026652206,0.011356231,0.00034417515,0.00003571819,3.0833402e-7,0.00018147746,0.97339505,0.01140765,0.0011409462,0.000032342326,0.0020701524],"study_design_scores_gemma":[0.0005266205,0.000050833267,0.0023155077,0.00015571358,0.000019084073,0.0000013164927,0.00015087059,0.968341,0.027871443,0.0000518212,0.0003392139,0.00017659272],"about_ca_topic_score_codex":0.000074517375,"about_ca_topic_score_gemma":0.000010438019,"teacher_disagreement_score":0.04439791,"about_ca_system_score_codex":0.00002805664,"about_ca_system_score_gemma":0.00022755632,"threshold_uncertainty_score":0.7085072},"labels":[],"label_agreement":null},{"id":"W2982515303","doi":"10.3390/su11216055","title":"A Memetic Algorithm for the Green Vehicle Routing Problem","year":2019,"lang":"en","type":"article","venue":"Sustainability","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":"University of Manitoba","funders":"","keywords":"Crossover; Memetic algorithm; Mathematical optimization; Vehicle routing problem; Population; Computer science; Local search (optimization); Bees algorithm; Routing (electronic design automation); Metaheuristic; Artificial intelligence; Mathematics","score_opus":0.008642215360106072,"score_gpt":0.2598593622576075,"score_spread":0.2512171468975014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982515303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06306883,0.00015294686,0.9313764,0.001241662,0.00027430907,0.0024790638,0.000010430897,0.00060783996,0.00078850705],"genre_scores_gemma":[0.8554357,0.0000033232827,0.14288056,0.00006099766,0.00011297641,0.00020597946,0.0000045205784,0.00005996223,0.0012359562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880993,0.00010091907,0.00027213895,0.00024469805,0.00015229864,0.00042001082],"domain_scores_gemma":[0.99837685,0.0006267354,0.000040380997,0.00049716857,0.00040607006,0.000052772844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016558891,0.00014784827,0.00017770159,0.000038010072,0.00013711936,0.000050243263,0.00024762176,0.00007898288,0.000050173647],"category_scores_gemma":[0.00039000725,0.00011775961,0.00009872753,0.00031132618,0.00004632176,0.00011941692,0.0000676272,0.00017962161,0.000011668459],"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.000010832499,0.000033991073,0.010533787,0.0006324835,0.000068259484,9.4454305e-7,0.0015714299,0.3791233,0.0001420366,0.0020213767,0.00015848306,0.60570306],"study_design_scores_gemma":[0.0003796889,0.000034512213,0.0039218045,0.000007149754,0.000021950129,0.0000013234115,0.00063443516,0.98602796,0.00031748827,0.0051419334,0.00335136,0.00016041996],"about_ca_topic_score_codex":0.00008535393,"about_ca_topic_score_gemma":0.0000047510075,"teacher_disagreement_score":0.7923669,"about_ca_system_score_codex":0.00045837386,"about_ca_system_score_gemma":0.00009209469,"threshold_uncertainty_score":0.48020974},"labels":[],"label_agreement":null},{"id":"W2982586778","doi":"10.1016/j.cor.2020.105085","title":"A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints","year":2020,"lang":"en","type":"preprint","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Constraint programming; Mathematical optimization; Linear programming; Computer science; Constraint (computer-aided design); Synchronization (alternating current); Constraint satisfaction; Goal programming; Routing (electronic design automation); Mathematics; Stochastic programming; Artificial intelligence","score_opus":0.07258725483866049,"score_gpt":0.34493051542850567,"score_spread":0.27234326058984515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982586778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008494432,0.00024462902,0.989983,0.0018184274,0.000088868444,0.0062946887,0.00010256563,0.00054097123,0.00007736016],"genre_scores_gemma":[0.46196392,0.000014862343,0.53699607,0.000037507365,0.00015965573,0.0005755762,0.0001435684,0.00009329099,0.000015532407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963573,0.0004407616,0.0005804494,0.00087832834,0.00076316285,0.000979968],"domain_scores_gemma":[0.996999,0.0008499948,0.000057518748,0.0005522636,0.0011775041,0.00036371348],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023085573,0.0004545612,0.00045944168,0.00029638165,0.0010512859,0.0011916386,0.00061012886,0.00030654992,0.0000130890185],"category_scores_gemma":[0.00020775791,0.00038807097,0.00010181011,0.00087330403,0.0004544047,0.00017809341,0.00057716004,0.0018316575,0.00000364568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038410883,0.000049503804,0.00009381459,0.00033410857,0.00017721276,0.000004835682,0.002321047,0.85321313,0.00006323365,0.0035745602,0.00007599916,0.14005412],"study_design_scores_gemma":[0.0014140925,0.00026384677,0.000020084923,0.0005147494,0.0000628499,0.000008422395,0.00070905685,0.9961991,0.00020889327,0.00007438497,0.0001173788,0.0004071728],"about_ca_topic_score_codex":0.00006560592,"about_ca_topic_score_gemma":0.000078908895,"teacher_disagreement_score":0.4611145,"about_ca_system_score_codex":0.0003422988,"about_ca_system_score_gemma":0.0021350812,"threshold_uncertainty_score":0.9998571},"labels":[],"label_agreement":null},{"id":"W2986923212","doi":"10.1016/j.omega.2019.102151","title":"A continuous-time supply-driven inventory-constrained routing problem","year":2019,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"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é Laval","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Commonwealth Scientific and Industrial Research Organisation","keywords":"Routing (electronic design automation); Container (type theory); Operations research; Vehicle routing problem; Computer science; Supply chain; Inventory theory; Biogas; Operations management; Business; Inventory control; Economics; Engineering; Computer network; Waste management; Marketing","score_opus":0.007621246591284409,"score_gpt":0.2210714830864677,"score_spread":0.2134502364951833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986923212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85603845,0.000085798296,0.021672115,0.00016882055,0.00052951043,0.00078310753,0.000019029687,0.0018742116,0.11882896],"genre_scores_gemma":[0.9117387,0.000004753779,0.08436395,0.000056692028,0.00009337968,0.000018841003,0.000021170976,0.00007676231,0.003625736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988497,0.00007002402,0.00030143975,0.00022628944,0.00016912921,0.0003834017],"domain_scores_gemma":[0.99942917,0.000079624304,0.00005853554,0.00028422193,0.00005022937,0.00009822995],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003645498,0.000184644,0.0002746025,0.00010618823,0.000046267825,0.00006850035,0.00019199816,0.000114903,0.00062610244],"category_scores_gemma":[0.0000544704,0.00020149112,0.00007600857,0.0002460619,0.000029578076,0.00016260403,0.000046840807,0.00020382863,0.0009300628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020608559,0.00007032825,0.13495882,0.00030408663,0.00023562132,0.000021940654,0.0022852507,0.7055686,0.12937061,0.0038232706,0.0039174175,0.019423405],"study_design_scores_gemma":[0.0011016187,0.00004842253,0.0013841226,0.00012443334,0.000021536178,0.000018741892,0.0000923193,0.9860595,0.0030395603,0.00012105739,0.0075431163,0.000445589],"about_ca_topic_score_codex":0.0000068674517,"about_ca_topic_score_gemma":0.0000010774119,"teacher_disagreement_score":0.28049085,"about_ca_system_score_codex":0.00008584926,"about_ca_system_score_gemma":0.000028507995,"threshold_uncertainty_score":0.9998478},"labels":[],"label_agreement":null},{"id":"W2987023879","doi":"10.1016/j.ejor.2019.11.015","title":"Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Iterated local search; Mathematical optimization; Computer science; Heuristic; Routing (electronic design automation); Metaheuristic; Product (mathematics); Time horizon; Set (abstract data type); Quality (philosophy); USable; Vehicle routing problem; Algorithm; Mathematics","score_opus":0.053666287729541004,"score_gpt":0.32640920298315945,"score_spread":0.27274291525361843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987023879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65845263,0.00045387034,0.3377019,0.00033497962,0.00009736549,0.00069403666,0.000013253238,0.000039550057,0.0022124276],"genre_scores_gemma":[0.7050791,0.0000354892,0.29420236,0.000017949236,0.00023428349,0.000004525953,0.00001066597,0.000047767484,0.00036785187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984207,0.00042026193,0.00033833346,0.00016620736,0.00042422462,0.00023025007],"domain_scores_gemma":[0.99862444,0.0001801759,0.00006155051,0.000115672105,0.0008867448,0.00013140889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045673917,0.00010084216,0.00014965594,0.00019027677,0.00021042424,0.00024357723,0.0001272075,0.000013529221,0.000018650377],"category_scores_gemma":[0.00032423116,0.00008554471,0.000017234228,0.00016655849,0.000051745767,0.0005713371,0.00003952316,0.00031948803,0.0000054881266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029694702,0.00020115651,0.010877543,0.00082572596,0.0003038396,0.0000728213,0.0044583557,0.72125214,0.022539154,0.0037030412,0.003296312,0.23217294],"study_design_scores_gemma":[0.0012958777,0.00082090707,0.004063246,0.00016767776,0.000011554375,0.00031538517,0.00012534528,0.9892826,0.0010026646,0.00012776,0.0026174807,0.00016947465],"about_ca_topic_score_codex":0.0000014874232,"about_ca_topic_score_gemma":5.7261764e-7,"teacher_disagreement_score":0.26803046,"about_ca_system_score_codex":0.000053239448,"about_ca_system_score_gemma":0.00013016592,"threshold_uncertainty_score":0.3488412},"labels":[],"label_agreement":null},{"id":"W2989947400","doi":"10.1287/trsc.2021.1111","title":"The Electric Vehicle Routing Problem with Capacitated Charging Stations","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Iterated local search; Routing (electronic design automation); Electric vehicle; Mathematical optimization; Set (abstract data type); Generator (circuit theory); Computer science; Charging station; Iterated function; Local search (optimization); Mathematics","score_opus":0.013352103453035993,"score_gpt":0.24868157888305245,"score_spread":0.23532947543001645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989947400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000351,0.0000850372,0.39654586,0.0002713735,0.0000944757,0.00015824163,0.0000057627008,0.00039285692,0.0024113297],"genre_scores_gemma":[0.94903624,0.000029050776,0.05074094,0.000030959247,0.000011454761,0.000019047382,0.000010463818,0.000018007364,0.0001038404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988089,0.000034073273,0.00023615085,0.00020711837,0.00038443218,0.000329297],"domain_scores_gemma":[0.99921453,0.00013896916,0.0000491371,0.00017563505,0.00035025878,0.000071471666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070718414,0.000093259325,0.00007807461,0.00007909479,0.00064303994,0.00016298328,0.00016701699,0.000020732134,0.000017204773],"category_scores_gemma":[0.000060975057,0.000074077514,0.000018295419,0.0027189434,0.0001113608,0.0004057897,0.0000018792244,0.00013765333,0.000007504164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040024584,0.000009920927,0.00404149,0.000017328546,0.000012015834,0.000007758044,0.003515372,0.8421325,0.13379103,0.009887277,0.00001571679,0.0065655834],"study_design_scores_gemma":[0.0003599084,0.00001966538,0.06332941,0.00003852414,0.0000210363,0.000007650855,0.0011144009,0.83352166,0.10074759,0.00032783847,0.00027072817,0.00024155324],"about_ca_topic_score_codex":0.000009002841,"about_ca_topic_score_gemma":0.00007516341,"teacher_disagreement_score":0.34900117,"about_ca_system_score_codex":0.000065678636,"about_ca_system_score_gemma":0.00019678859,"threshold_uncertainty_score":0.4945808},"labels":[],"label_agreement":null},{"id":"W2991187918","doi":"10.1016/j.ejor.2019.11.043","title":"A branch-and-price heuristic for the crew pairing problem with language constraints","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Computer science; Heuristic; Set (abstract data type); Schedule; Operations research; Tree (set theory); Mathematical optimization; Artificial intelligence; Programming language; Mathematics; Engineering","score_opus":0.0438936097016484,"score_gpt":0.3347566218631179,"score_spread":0.2908630121614695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991187918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34343123,0.001072578,0.63252187,0.0013112808,0.00014459937,0.0007094691,0.000011107838,0.00004201928,0.020755831],"genre_scores_gemma":[0.94276315,0.000042982698,0.056468844,0.000042415795,0.00017013158,0.0000032291387,0.0000013824291,0.00003437891,0.00047348754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986907,0.0003858039,0.00024613066,0.00008502169,0.00040805282,0.00018426465],"domain_scores_gemma":[0.99830353,0.0010424289,0.000040921554,0.00010355542,0.00043678176,0.00007277155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005130776,0.000071235074,0.000103015045,0.0000970846,0.00013568155,0.00015132737,0.00019692481,0.000011326581,0.00013084669],"category_scores_gemma":[0.00045392607,0.000045411514,0.000027312857,0.00015847417,0.000089127105,0.00013109007,0.000032823304,0.0003626672,0.000024708927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017955306,0.000036866302,0.002587152,0.0002656851,0.00022756828,0.0000775892,0.00396305,0.9231994,0.017632091,0.004012316,0.0019753084,0.045843404],"study_design_scores_gemma":[0.008305898,0.0020497027,0.0718723,0.0012959758,0.00007795921,0.001827211,0.0037178125,0.88353616,0.0041669426,0.00022751474,0.022138111,0.00078443915],"about_ca_topic_score_codex":6.5919096e-7,"about_ca_topic_score_gemma":4.2351803e-7,"teacher_disagreement_score":0.5993319,"about_ca_system_score_codex":0.00003396492,"about_ca_system_score_gemma":0.000082286475,"threshold_uncertainty_score":0.18518278},"labels":[],"label_agreement":null},{"id":"W2991685881","doi":"","title":"Transportation optimization for the collection of end-of-life vehicles","year":2019,"lang":"en","type":"article","venue":"Espace École de technologie supérieure (École de technologie supérieure)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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":"Purchasing; Vehicle routing problem; Integer programming; Operations research; Heuristic; Linear programming; Routing (electronic design automation); Order (exchange); Computer science; Heuristics; Transport engineering; Mathematical optimization; Engineering; Operations management; Business; Mathematics; Computer network","score_opus":0.014024788042035509,"score_gpt":0.25425514609940664,"score_spread":0.24023035805737114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991685881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31326845,0.00085304264,0.6779647,0.0012586346,0.00035518338,0.0022238907,0.00013391297,0.0037540644,0.00018816786],"genre_scores_gemma":[0.87247735,0.0004969688,0.12596543,0.00008774337,0.000037940652,0.00050024095,0.000060312846,0.00015357915,0.00022045599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968608,0.00009137779,0.0010324811,0.000635898,0.00046085793,0.0009186086],"domain_scores_gemma":[0.9965618,0.0010242279,0.00050000293,0.0013676138,0.0004448702,0.000101436985],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012186299,0.0005680888,0.00082651456,0.00078123173,0.00021652249,0.00005345163,0.001323136,0.0013874796,0.000088747045],"category_scores_gemma":[0.0020535302,0.000534824,0.0003216926,0.00269465,0.00048181403,0.00028915834,0.00010130341,0.0008988525,0.000008112597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015348179,0.0000964133,0.024910556,0.00037784313,0.00015836862,0.000003478703,0.00033601787,0.94436145,0.022714838,0.0018004806,0.0011814265,0.003905669],"study_design_scores_gemma":[0.0014883629,0.0004288606,0.0053795036,0.00011874158,0.0001487257,0.000011508708,0.0033256426,0.8515033,0.13473545,0.00060462323,0.001700163,0.00055508706],"about_ca_topic_score_codex":0.00006541755,"about_ca_topic_score_gemma":0.00013796546,"teacher_disagreement_score":0.55920887,"about_ca_system_score_codex":0.00027504523,"about_ca_system_score_gemma":0.00036448773,"threshold_uncertainty_score":0.9999089},"labels":[],"label_agreement":null},{"id":"W2992897731","doi":"10.1093/forestscience/49.1.1","title":"An Indirect Search Algorithm for Harvest-Scheduling Under Adjacency Constraints","year":2003,"lang":"en","type":"article","venue":"Forest Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Adjacency list; Simulated annealing; Mathematical optimization; Best-first search; Hill climbing; Search algorithm; Algorithm; Guided Local Search; Computer science; Greedy algorithm; Scheduling (production processes); Integer programming; Beam search; Mathematics","score_opus":0.03399996158010347,"score_gpt":0.3140991011701756,"score_spread":0.2800991395900721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992897731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116883725,0.000031402167,0.8811337,0.000010416195,0.00034506642,0.0002129199,0.000009296257,0.00022957257,0.0011439099],"genre_scores_gemma":[0.49704042,0.0000032669495,0.5028539,0.000020411511,0.00002418267,0.000011297718,0.0000023185796,0.000016365926,0.000027865146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866605,0.000053172094,0.00017773239,0.0003005206,0.0002986097,0.00050394435],"domain_scores_gemma":[0.99925786,0.000116509924,0.00002301964,0.00026439392,0.00013865349,0.00019953403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018805508,0.00012240377,0.00012209393,0.00016975451,0.00028185095,0.00015765942,0.00033643589,0.000057990717,0.000047942798],"category_scores_gemma":[0.0002711946,0.00012714646,0.000031294963,0.000781585,0.00041480275,0.0005148523,0.000016796019,0.00013224124,0.000015674901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3939806e-7,0.000013795323,0.001030146,0.000009073407,0.0000033200154,7.9800833e-7,0.00016981387,0.9613118,0.0032024826,0.011678359,0.0000060623556,0.022573866],"study_design_scores_gemma":[0.00021311195,0.000037107904,0.0023268359,0.000015907188,0.0000040163663,0.000011463411,0.00013815021,0.9834641,0.012090328,0.001454203,0.000069302965,0.00017545506],"about_ca_topic_score_codex":0.0000033712224,"about_ca_topic_score_gemma":0.0000047291005,"teacher_disagreement_score":0.3801567,"about_ca_system_score_codex":0.00009396208,"about_ca_system_score_gemma":0.00019907129,"threshold_uncertainty_score":0.5184882},"labels":[],"label_agreement":null},{"id":"W2993393857","doi":"10.1109/kse.2019.8919421","title":"On the Traveling Salesman Problem with Hierarchical Objective Function","year":2019,"lang":"en","type":"article","venue":"","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":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Computer science; 2-opt; Traveling purchaser problem; Genetic algorithm; Transformation (genetics); Function (biology); Bottleneck traveling salesman problem; Lin–Kernighan heuristic; Group (periodic table); Mathematics","score_opus":0.008224644849638498,"score_gpt":0.20786119378277734,"score_spread":0.19963654893313884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993393857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37053713,0.000004756662,0.5320581,0.00015582309,0.00010587717,0.00030518818,5.8222525e-7,0.00041002015,0.096422486],"genre_scores_gemma":[0.96361893,0.0000014338323,0.035401028,0.00013900835,0.000032985456,0.00001460706,0.000002033818,0.000031148167,0.0007588093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945945,0.000042169188,0.00009597227,0.00012872394,0.00013057202,0.00014309876],"domain_scores_gemma":[0.9995284,0.00023703,0.000013722292,0.0001660795,0.000026538602,0.000028196917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025842024,0.0000953455,0.00008107186,0.00003206741,0.00004950209,0.000027972637,0.00006770867,0.00004461328,0.00024596014],"category_scores_gemma":[0.000016468675,0.00005636461,0.000021361537,0.0001742132,0.000015579313,0.000050915904,0.000008313266,0.00022470359,0.00013420962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032233133,0.0000105941,0.0007643905,0.00001465852,0.000036115278,3.7782831e-7,0.00030244226,0.9578508,0.0013167424,0.036761135,0.00012186089,0.0027886417],"study_design_scores_gemma":[0.00048978376,0.00024967897,0.006745205,0.00005777826,0.000017175018,0.000006620327,0.00023169273,0.9853273,0.0036853412,0.002658704,0.00029609242,0.00023461007],"about_ca_topic_score_codex":0.000002886262,"about_ca_topic_score_gemma":0.0000038066546,"teacher_disagreement_score":0.5930818,"about_ca_system_score_codex":0.00003574481,"about_ca_system_score_gemma":0.000010793155,"threshold_uncertainty_score":0.2693091},"labels":[],"label_agreement":null},{"id":"W2998840417","doi":"10.1287/ijoc.2022.1174","title":"Integral Column Generation for Set Partitioning Problems with Side Constraints","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematical optimization; Heuristics; Column (typography); Heuristic; Integer (computer science); Set (abstract data type); Computer science; Algorithm; Integer programming; Vehicle routing problem; Mathematics; Routing (electronic design automation)","score_opus":0.03675847513803565,"score_gpt":0.27204631779692334,"score_spread":0.2352878426588877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998840417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2528459,0.0000156222,0.7449801,0.00007541998,0.00053686765,0.00024011196,0.000010897741,0.00017318173,0.0011218932],"genre_scores_gemma":[0.8721281,0.0000020498105,0.12724873,0.00022045626,0.0002872271,0.000019159212,0.00003251367,0.000033217628,0.00002851299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882835,0.000047792073,0.00044343513,0.000106618194,0.00027340488,0.0003003974],"domain_scores_gemma":[0.9993814,0.00013859353,0.0001834515,0.000089962916,0.00012066648,0.000085876374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360449,0.00013776065,0.00016270831,0.0001431829,0.00078205566,0.00021806474,0.00013205236,0.000032360833,0.00006098656],"category_scores_gemma":[0.00008315203,0.00012535795,0.000059198283,0.00022266562,0.000030178222,0.00021334869,0.00003353338,0.00052470167,0.0000027889814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011662913,0.0000077796885,0.0004893958,0.00001635833,0.000036290105,0.000004812199,0.00072133366,0.9658912,0.0003430651,0.000398703,0.0005142187,0.031565223],"study_design_scores_gemma":[0.00079485413,0.00027945935,0.00012345395,0.000066377004,0.000010500261,0.00044789014,0.0004247509,0.9944115,0.0005569762,0.000103760554,0.0025935841,0.00018684253],"about_ca_topic_score_codex":0.0000013623101,"about_ca_topic_score_gemma":0.0000020869845,"teacher_disagreement_score":0.61928225,"about_ca_system_score_codex":0.00025069126,"about_ca_system_score_gemma":0.00006906122,"threshold_uncertainty_score":0.6015019},"labels":[],"label_agreement":null},{"id":"W3000079527","doi":"10.1155/2020/2431763","title":"Multimodal Capacitated Hub Location Problems with Multi-Commodities: An Application in Freight Transport","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Corporación de Fomento de la Producción","keywords":"Solver; Truck; Computer science; Integer programming; Train; Operations research; Process (computing); Multimodal transport; Commodity; Facility location problem; Linear programming; Mathematical optimization; Transport engineering; Engineering; Business; Mathematics","score_opus":0.016710931128499792,"score_gpt":0.2469352076798134,"score_spread":0.2302242765513136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000079527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43673158,0.00005444645,0.5627882,0.00006420631,0.00004565594,0.00021684215,0.00000916187,0.00007664128,0.000013319758],"genre_scores_gemma":[0.7866986,0.000034946283,0.21301404,0.00003463308,0.000048106333,0.00001909126,0.000107598025,0.000041918,0.0000011181779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986166,0.00004468835,0.0007417605,0.00016487196,0.00026345765,0.00016863545],"domain_scores_gemma":[0.99915785,0.000032383774,0.00026387023,0.00010797136,0.0003009039,0.00013704816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022029353,0.00017809086,0.00028090112,0.00015760667,0.00003454405,0.000011947567,0.00013449755,0.00008785741,0.0000061734117],"category_scores_gemma":[0.000014324386,0.00017189528,0.00004340363,0.0006212295,0.00002982317,0.0010136974,4.061891e-7,0.00031513275,0.0000011826188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012226825,0.00007076973,0.0068324003,0.00015447165,0.000021437952,0.000009482805,0.010080794,0.9618492,0.017358266,0.000044307824,0.0000010038273,0.003455586],"study_design_scores_gemma":[0.0044815186,0.00039259423,0.22776827,0.00020368105,0.00006644855,0.000009576113,0.0018400684,0.7566952,0.00795776,0.00008206148,0.00013497319,0.0003678586],"about_ca_topic_score_codex":0.000013820652,"about_ca_topic_score_gemma":0.0002412377,"teacher_disagreement_score":0.349967,"about_ca_system_score_codex":0.00008186389,"about_ca_system_score_gemma":0.00004644148,"threshold_uncertainty_score":0.7009686},"labels":[],"label_agreement":null},{"id":"W3000972540","doi":"10.1287/trsc.2019.0904","title":"The Vehicle Routing Problem with Stochastic Two-Dimensional Items","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Transport Canada; Université Laval","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Integer (computer science); Integer programming; Probability distribution; Mathematics; Computer science; Statistics","score_opus":0.01835321259663467,"score_gpt":0.2561111963444445,"score_spread":0.23775798374780985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000972540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49285856,0.00003431913,0.5051819,0.000707852,0.000091474845,0.00022887137,0.0000049303917,0.00041119556,0.00048088378],"genre_scores_gemma":[0.96141386,7.324879e-7,0.038390864,0.000118742726,0.000030719304,0.000011336655,0.0000034647685,0.000016870737,0.0000133811545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.000017734721,0.00021888805,0.00021002335,0.000464793,0.00025430502],"domain_scores_gemma":[0.999467,0.00011993212,0.000045840203,0.00011400772,0.00012609533,0.00012708698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340386,0.00009717069,0.00008091671,0.000031000494,0.0003722768,0.00009044449,0.00023041305,0.000016340264,0.000011390614],"category_scores_gemma":[0.00004178439,0.000070116665,0.00001769553,0.000988629,0.00019878805,0.00029728608,0.000003467159,0.00012739412,0.00001512545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007688444,0.0000022071408,0.0005544858,0.000005821723,0.0000032035703,0.0000011655936,0.0011855767,0.98459864,0.011172205,0.00089074695,0.000009488768,0.0015687945],"study_design_scores_gemma":[0.00028788976,0.000025859412,0.005965419,0.000016209447,0.000008053672,0.0000012914925,0.00012264708,0.99053705,0.002830294,0.000046174096,0.00004226241,0.00011685997],"about_ca_topic_score_codex":0.0000070091824,"about_ca_topic_score_gemma":0.0000135286,"teacher_disagreement_score":0.46855533,"about_ca_system_score_codex":0.00002646593,"about_ca_system_score_gemma":0.000079335645,"threshold_uncertainty_score":0.28632897},"labels":[],"label_agreement":null},{"id":"W3002119673","doi":"10.5267/j.dsl.2020.1.002","title":"Bi objective hybrid vehicle routing problem with alternative paths and reliability","year":2020,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Simulated annealing; Vehicle routing problem; Reliability (semiconductor); Fuel efficiency; Hybrid algorithm (constraint satisfaction); Routing (electronic design automation); Nonlinear programming; Computer science; Nonlinear system; Engineering; Constraint programming; Mathematics; Automotive engineering; Stochastic programming","score_opus":0.015172443608376997,"score_gpt":0.26131042787723296,"score_spread":0.24613798426885597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002119673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57082003,0.000006255748,0.42764172,0.0009852872,0.000059078215,0.00013875913,0.0000022624993,0.0001432878,0.00020327959],"genre_scores_gemma":[0.77341366,0.0000039347356,0.22534414,0.001175759,0.000037192633,0.0000066740313,4.104443e-7,0.000017143477,0.0000011209577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824744,0.000058824557,0.00024961203,0.00052996527,0.0005882824,0.00032584617],"domain_scores_gemma":[0.9990551,0.00034055577,0.00006250632,0.00023131086,0.000109015054,0.00020154877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011129213,0.00015540628,0.00017584,0.00010582609,0.00021091518,0.00018369725,0.00032389094,0.000021367916,0.000008517009],"category_scores_gemma":[0.00065896485,0.00012802993,0.000023674718,0.0010222556,0.00032602812,0.0006006891,0.00012691051,0.00021950925,0.000013399601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000346054,0.0000086609025,0.0141250575,0.000014859281,0.0000069924654,0.000024695217,0.0032076915,0.8966998,0.048840683,0.000056773155,0.00020089894,0.03677929],"study_design_scores_gemma":[0.00042098225,0.000063977,0.012093107,0.000047840414,0.000006232301,0.000012495747,0.00019330543,0.96151704,0.025104107,0.00017607014,0.00012707553,0.00023776075],"about_ca_topic_score_codex":0.000011533013,"about_ca_topic_score_gemma":4.612909e-7,"teacher_disagreement_score":0.20259356,"about_ca_system_score_codex":0.00010665905,"about_ca_system_score_gemma":0.000029929604,"threshold_uncertainty_score":0.5220909},"labels":[],"label_agreement":null},{"id":"W3002241203","doi":"10.1155/2020/9743841","title":"Presenting a Multi-Start Hybrid Heuristic for Solving the Problem of Two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery (2E-LRPSPD)","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Heuristics; Mathematical optimization; Pickup; Vehicle routing problem; Computer science; Heuristic; Routing (electronic design automation); Path (computing); Mathematics; Artificial intelligence","score_opus":0.01784759339996823,"score_gpt":0.25696146778215445,"score_spread":0.23911387438218623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002241203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36382508,0.00022102156,0.63537705,0.000106038846,0.000031265743,0.000383512,0.000008397113,0.00004120001,0.0000064115875],"genre_scores_gemma":[0.57814914,0.00003744451,0.42170706,0.000016891676,0.00004308919,0.0000074387067,0.0000075811513,0.000028444123,0.0000029310988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986514,0.00003565977,0.0007446482,0.00014879476,0.00022776071,0.0001917707],"domain_scores_gemma":[0.9982341,0.0005244642,0.0005239015,0.00007735392,0.00056208216,0.000078125646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039108077,0.00016085594,0.00027597538,0.000064193075,0.0001081665,0.000030510038,0.00011439595,0.000033018754,0.0000018118441],"category_scores_gemma":[0.00014659361,0.00012943476,0.000058686826,0.00024433347,0.000038353945,0.0003585111,0.0000034023267,0.00022939396,1.3906836e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013567776,0.000018670362,0.0016034282,0.0005423903,0.000068383524,0.000009872076,0.0052784267,0.9732008,0.011389941,0.000036991467,0.0000029351895,0.00771246],"study_design_scores_gemma":[0.002724054,0.00024114137,0.0023865069,0.00046540124,0.00020773397,0.000027920425,0.0014203646,0.98202693,0.010094929,0.00013100696,0.00006273038,0.0002112943],"about_ca_topic_score_codex":0.000005610379,"about_ca_topic_score_gemma":0.000020841473,"teacher_disagreement_score":0.21432403,"about_ca_system_score_codex":0.00003469021,"about_ca_system_score_gemma":0.00005845989,"threshold_uncertainty_score":0.52781963},"labels":[],"label_agreement":null},{"id":"W3002434250","doi":"10.48550/arxiv.2001.09297","title":"Vehicle Scheduling Problem","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Toronto; University of Waterloo","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Job shop scheduling; Integer programming; Computer science; Linear programming; Heuristic; Operations research; Mathematics; Computer network","score_opus":0.0769270011065532,"score_gpt":0.1993015847559991,"score_spread":0.1223745836494459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002434250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20011233,0.000081424645,0.79080707,0.00007919808,0.00036978733,0.00025592334,0.000015894462,0.0014883688,0.006790017],"genre_scores_gemma":[0.9307756,0.00012382449,0.06860309,0.00004601555,0.00012972052,9.3496004e-7,0.000023828496,0.00008005862,0.00021692856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873054,0.00009653186,0.00020865754,0.00059010606,0.00006496452,0.00030921432],"domain_scores_gemma":[0.99908817,0.00006658276,0.00008615101,0.0004906037,0.00008018268,0.00018832897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018874483,0.00030070386,0.000319012,0.0001339723,0.000081022685,0.000064623266,0.0005217624,0.0003290123,0.00007583707],"category_scores_gemma":[0.000046635054,0.00041131038,0.00015134507,0.00048525582,0.00004461951,0.00012592503,0.0004999314,0.0008608704,0.00015882414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007388689,0.00001048438,0.00096781144,0.00022385897,0.00008375567,0.00006681744,0.00010956268,0.9899319,0.00031646443,0.0077972803,0.00009423679,0.00039045763],"study_design_scores_gemma":[0.0002758611,0.000010503794,0.00020744726,0.00009077644,0.00007244646,0.000001143335,0.00005209287,0.98933244,0.0005206777,0.008697589,0.00033017184,0.0004088824],"about_ca_topic_score_codex":0.000016032523,"about_ca_topic_score_gemma":0.0000032050145,"teacher_disagreement_score":0.7306633,"about_ca_system_score_codex":0.00020086046,"about_ca_system_score_gemma":0.000065753346,"threshold_uncertainty_score":0.9998339},"labels":[],"label_agreement":null},{"id":"W3003938257","doi":"10.1109/tfuzz.2020.2970834","title":"Sentiment Analysis for Driver Selection in Fuzzy Capacitated Vehicle Routing Problem With Simultaneous Pick-Up and Drop in Shared Transportation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","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":"University of Alberta","funders":"","keywords":"Computer science; Selection (genetic algorithm); Fuzzy logic; Vehicle routing problem; Process (computing); Routing (electronic design automation); Operations research; Fuzzy set; Artificial intelligence; Machine learning; Data mining; Engineering","score_opus":0.016651655313582717,"score_gpt":0.23319210546419988,"score_spread":0.21654045015061718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003938257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38933733,0.000019097177,0.6094754,0.000043672415,0.00008054968,0.00074004376,0.000054261865,0.0002153202,0.000034359095],"genre_scores_gemma":[0.99135274,0.000008957999,0.008273575,0.000017205231,0.000021359385,0.00019838939,0.000024438463,0.000054756656,0.000048594065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845237,0.00012304561,0.0005408125,0.00038239913,0.00020452493,0.00029686987],"domain_scores_gemma":[0.99943846,0.00018697347,0.000082810046,0.00009264235,0.00009299347,0.000106144216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026597126,0.00022941771,0.0003901301,0.0004023025,0.000096100295,0.00007488851,0.00006530465,0.00013058352,0.0000062265426],"category_scores_gemma":[0.000007659951,0.00024452113,0.000071049624,0.0017838673,0.000019273013,0.00021409059,2.7797708e-7,0.00024945618,0.000002698254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011025323,0.00004006709,0.0047386,0.00021846693,0.00022415144,0.000006111844,0.0048603457,0.9817021,0.0071907174,0.000008042235,0.0000035736832,0.0008975727],"study_design_scores_gemma":[0.0015246571,0.00013288518,0.0026854775,0.000109853456,0.00020479587,0.0000026469538,0.0006945871,0.99160665,0.0027583663,0.000003269219,0.000012360941,0.0002644528],"about_ca_topic_score_codex":0.0003389694,"about_ca_topic_score_gemma":0.0013871059,"teacher_disagreement_score":0.6020154,"about_ca_system_score_codex":0.0002107911,"about_ca_system_score_gemma":0.000023184279,"threshold_uncertainty_score":0.99712825},"labels":[],"label_agreement":null},{"id":"W3004319648","doi":"10.1155/2020/5748680","title":"Product Service Scheduling Problem with Service Matching Based on Tabu Search Method","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education of Liaoning Province","keywords":"Tabu search; Mathematical optimization; Job shop scheduling; Travelling salesman problem; Scheduling (production processes); Computer science; Adaptability; Guided Local Search; Operations research; Engineering; Mathematics; Schedule; Economics","score_opus":0.01869334838219953,"score_gpt":0.2827049988874803,"score_spread":0.26401165050528075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004319648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24064481,0.00003988619,0.75648326,0.0023814973,0.00007441921,0.00019446302,0.0000051418415,0.00011525293,0.00006127464],"genre_scores_gemma":[0.3759646,0.00000832474,0.6233285,0.00054209627,0.000093506555,0.000003215219,0.000012259861,0.000046491434,0.000001007139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853516,0.00009120543,0.00052170834,0.00018465002,0.00046366028,0.00020362267],"domain_scores_gemma":[0.99886394,0.0001198119,0.00020404867,0.00011933066,0.0005436759,0.00014919898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005620175,0.00018395459,0.0002803914,0.00012563259,0.000062630315,0.00003298558,0.00016075518,0.000048077083,0.000017452137],"category_scores_gemma":[0.000021506467,0.00016558383,0.000051272295,0.00094554445,0.000005409948,0.0005029,0.000001510314,0.00049962784,0.000003405463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026701696,0.000021417736,0.00027109619,0.000533628,0.000035819467,0.000017012946,0.0038867681,0.95543647,0.03418456,0.000028048305,0.0000016399655,0.0053165313],"study_design_scores_gemma":[0.002165573,0.00028017795,0.0065188413,0.0005765431,0.00010226453,0.000013269795,0.0010989879,0.9492019,0.03948388,0.00006831474,0.00017149572,0.00031876523],"about_ca_topic_score_codex":0.0000051212714,"about_ca_topic_score_gemma":0.000016983338,"teacher_disagreement_score":0.1353198,"about_ca_system_score_codex":0.000055331384,"about_ca_system_score_gemma":0.00008607696,"threshold_uncertainty_score":0.6752313},"labels":[],"label_agreement":null},{"id":"W3005635975","doi":"10.1111/itor.12911","title":"Selective arc‐ng pricing for vehicle routing","year":2020,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Mathematical optimization; Solver; Vehicle routing problem; Path (computing); Set (abstract data type); Relaxation (psychology); Computer science; Routing (electronic design automation); Mathematics","score_opus":0.10321937624915684,"score_gpt":0.40502112560386316,"score_spread":0.30180174935470633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005635975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0163092,0.000033676642,0.9707947,0.0047598057,0.00030421684,0.00050306297,0.000050437033,0.00016526389,0.0070796586],"genre_scores_gemma":[0.93810457,0.000030030715,0.060831144,0.00016573102,0.0002813596,0.0002310731,0.000033129487,0.00003988557,0.00028305693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998332,0.00012731382,0.0003615672,0.0002795613,0.0005827822,0.00031674426],"domain_scores_gemma":[0.99841636,0.00081878435,0.000016932148,0.00008425064,0.0005681722,0.00009552007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481462,0.00011438131,0.00012599053,0.0002928364,0.00022716321,0.0001369329,0.00027831565,0.00008313588,0.00032170853],"category_scores_gemma":[0.0006249127,0.00013396269,0.000060929044,0.00071459525,0.00004679228,0.00037754097,0.00001262982,0.0005570913,0.000033661527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044003857,0.0000336007,0.0005612081,0.000023072047,0.000045900502,0.0000016150962,0.0011086704,0.9777641,0.011022504,0.002737713,0.00018343549,0.006474167],"study_design_scores_gemma":[0.00060715113,0.000037077476,0.0010061421,0.000029435028,0.000002537144,0.000002750869,0.00027486106,0.9844702,0.01068242,0.0002818724,0.002476074,0.00012948574],"about_ca_topic_score_codex":0.000027823511,"about_ca_topic_score_gemma":0.000027163875,"teacher_disagreement_score":0.92179537,"about_ca_system_score_codex":0.0003987386,"about_ca_system_score_gemma":0.00013259379,"threshold_uncertainty_score":0.546284},"labels":[],"label_agreement":null},{"id":"W3006796855","doi":"10.1155/2020/3153201","title":"A Branch-and-Price-and-Cut Algorithm for the Integrated Scheduling and Rostering Problem of Bus Drivers","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan","keywords":"Crew scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Benchmark (surveying); Fleet management; Job shop scheduling; Algorithm; Operations research; Schedule; Engineering; Mathematics","score_opus":0.012713217930857678,"score_gpt":0.24730868024559557,"score_spread":0.2345954623147379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006796855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33131436,0.0005081498,0.6678492,0.00014616371,0.000043208027,0.00011347662,0.0000068964428,0.0000163508,0.00000221235],"genre_scores_gemma":[0.5170949,0.0005052761,0.4823425,0.000017218812,0.000022821512,0.000002117016,0.0000021498277,0.000012183974,8.050798e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942327,0.000012243854,0.00033308685,0.00006929219,0.00008522812,0.0000769099],"domain_scores_gemma":[0.9995121,0.00012989866,0.00015694507,0.000027861874,0.00011942329,0.000053805485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018050407,0.00008061944,0.00016969045,0.000043913446,0.000038494585,0.000014330398,0.000040270505,0.000033724693,0.0000012891558],"category_scores_gemma":[0.000029415512,0.00006471148,0.0000327167,0.00012702309,0.000025036084,0.00023557714,0.0000016616814,0.00012960003,2.359142e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037112997,0.0000027977633,0.0005093618,0.00014230965,0.00004824486,0.0000011458932,0.0034241234,0.8126926,0.030349059,0.000028003795,6.5523017e-7,0.15276462],"study_design_scores_gemma":[0.0024571717,0.00023535006,0.024075732,0.00028037728,0.00017431028,0.0000181634,0.0016014139,0.95670164,0.013761524,0.00019207988,0.00032999125,0.00017227176],"about_ca_topic_score_codex":0.0000013177014,"about_ca_topic_score_gemma":0.000002490142,"teacher_disagreement_score":0.18578057,"about_ca_system_score_codex":0.00001081925,"about_ca_system_score_gemma":0.000011745134,"threshold_uncertainty_score":0.26388574},"labels":[],"label_agreement":null},{"id":"W3007930322","doi":"10.1007/s11590-020-01551-w","title":"Variable neighborhood search based algorithms to solve a rich k-travelling repairmen problem","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","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":"Université de Montréal","funders":"","keywords":"Variable neighborhood search; Benchmark (surveying); Computational intelligence; Variable (mathematics); Algorithm; Set (abstract data type); Computer science; Mathematical optimization; Database transaction; Local search (optimization); Mathematics; Metaheuristic; Artificial intelligence; Database","score_opus":0.01777942290356581,"score_gpt":0.2336952618307448,"score_spread":0.21591583892717897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007930322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040930553,0.000014416928,0.98997194,0.005796299,0.00014562644,0.00055223727,0.000014179142,0.0011173966,0.0019786],"genre_scores_gemma":[0.0074763885,0.0000058100823,0.98487616,0.0071554673,0.00020890473,0.00005370272,0.00007117856,0.00012689855,0.000025521626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981951,0.00008886819,0.00042571657,0.00044743487,0.00035716355,0.0004857093],"domain_scores_gemma":[0.99911606,0.000111146794,0.000049855804,0.0002815571,0.00012860677,0.00031277732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004539648,0.00026036336,0.00025731444,0.00017121647,0.00013577074,0.00015806328,0.00026316525,0.00010898824,0.00029204472],"category_scores_gemma":[0.00010787521,0.00030527552,0.000058351136,0.0014104792,0.000019468796,0.00023212425,0.000048403537,0.0002654282,0.00007731949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011880634,0.000015538144,0.00014555629,0.00008029894,0.000034248646,0.0000053710555,0.0007722203,0.9916572,0.0045224694,0.00012768242,0.0019946506,0.00063286675],"study_design_scores_gemma":[0.0004990207,0.000045287383,0.00001700931,0.000036534253,0.000022798513,0.0000018225991,0.000047383834,0.995916,0.0024208769,0.0000054615284,0.0006428609,0.00034495784],"about_ca_topic_score_codex":0.000006589738,"about_ca_topic_score_gemma":1.444392e-7,"teacher_disagreement_score":0.007067083,"about_ca_system_score_codex":0.0001270979,"about_ca_system_score_gemma":0.000053707794,"threshold_uncertainty_score":0.9999399},"labels":[],"label_agreement":null},{"id":"W3009064098","doi":"10.1016/j.omega.2020.102304","title":"Inventory routing under stochastic supply and demand","year":2020,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"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":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Supply chain; Computer science; Context (archaeology); Stochastic programming; Reservation; Operations research; Mathematical optimization; Routing (electronic design automation); Benchmark (surveying); Inventory theory; Heuristic; Set (abstract data type); Inventory control; Mathematics; Business; Artificial intelligence","score_opus":0.023338424295900252,"score_gpt":0.24432199237118943,"score_spread":0.22098356807528918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009064098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20039633,0.00032837252,0.7969544,0.00040995286,0.00011028846,0.000080189086,0.0000022430922,0.0003676025,0.0013506111],"genre_scores_gemma":[0.982213,0.000008731831,0.017323487,0.00027761387,0.00009585442,0.0000033981553,0.0000025956049,0.000030260291,0.000045022975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951285,0.000028388884,0.00011807826,0.00011801627,0.000076121716,0.0001465537],"domain_scores_gemma":[0.9997361,0.0000545967,0.000015420837,0.00007119233,0.000012142866,0.00011060511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012161618,0.00008544396,0.00010345755,0.000028061046,0.000042157317,0.000033519984,0.000054746804,0.000043818523,0.000030098945],"category_scores_gemma":[0.00008536461,0.00009397302,0.000016507052,0.00013183172,0.000018999557,0.000072869894,0.000031919488,0.00011001379,0.000018422772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026249131,0.000002535277,0.0022386813,0.00004174405,0.00001518453,0.0000015208975,0.0008061677,0.992066,0.0016404982,0.00067426654,0.00041154787,0.0020991808],"study_design_scores_gemma":[0.00031070586,0.000014998716,0.0028948325,0.000018677676,0.000014107242,0.000004463485,0.00011836315,0.99558187,0.00037842157,0.00012844993,0.00038537633,0.00014972153],"about_ca_topic_score_codex":0.0000016670998,"about_ca_topic_score_gemma":6.89318e-7,"teacher_disagreement_score":0.7818167,"about_ca_system_score_codex":0.000020529847,"about_ca_system_score_gemma":0.0000075072508,"threshold_uncertainty_score":0.38321087},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.032987308182205494,"score_gpt":0.28849050009934984,"score_spread":0.2555031919171443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009897573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05464844,0.000055943052,0.9437858,0.00090399326,0.0001810113,0.00016812276,0.00004245056,0.000102664344,0.00011159685],"genre_scores_gemma":[0.9206169,0.00010375613,0.078507185,0.0006256881,0.000059107442,0.000002651823,0.000052993993,0.000026707565,0.0000049580453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991476,0.000060745606,0.00040752557,0.00012252288,0.00011245329,0.00014916276],"domain_scores_gemma":[0.99949694,0.0001840468,0.000075848126,0.000031650063,0.000060447248,0.00015104536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029045067,0.00012254223,0.00016747632,0.00011406107,0.000075676915,0.000044833123,0.00004837981,0.00005014795,0.000018832252],"category_scores_gemma":[0.00034049674,0.00013119809,0.000035880155,0.00015643952,0.000030315106,0.000060291597,0.0000012244152,0.00035341294,0.0000015791359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007745767,0.000006116321,0.0017714289,0.00006157907,0.000010558117,0.000029471741,0.0008234709,0.96376985,0.00035558478,0.00044318996,0.000010064612,0.03264122],"study_design_scores_gemma":[0.0012925564,0.000230125,0.0061037396,0.00008380461,0.000022741942,0.000018069652,0.00021786691,0.99074346,0.00021553323,0.00009046792,0.0008160684,0.00016554965],"about_ca_topic_score_codex":0.0000012586551,"about_ca_topic_score_gemma":0.0000149488005,"teacher_disagreement_score":0.8659685,"about_ca_system_score_codex":0.000035384954,"about_ca_system_score_gemma":0.000022001295,"threshold_uncertainty_score":0.5350103},"labels":[],"label_agreement":null},{"id":"W3013962532","doi":"","title":"Computational study of a branching algorithm for the maximum \\(k\\)-cut problem","year":2020,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","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","funders":"","keywords":"Branch and bound; Maximum cut; Branching (polymer chemistry); Cutting-plane method; Algorithm; Mathematics; Mathematical optimization; Relaxation (psychology); Metaheuristic; Graph; Node (physics); Linear programming relaxation; Linear programming; Combinatorics; Integer programming","score_opus":0.01582555029809753,"score_gpt":0.24318568317454362,"score_spread":0.22736013287644607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013962532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061303638,0.00007916002,0.93720424,0.00040378678,0.00009201125,0.0005802868,0.000015252258,0.0001889962,0.00013260625],"genre_scores_gemma":[0.42068848,0.0000043428076,0.5789525,0.00014319528,0.000117635835,0.000041781594,0.0000072782095,0.000033542485,0.00001121272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999244,0.000060817503,0.0002509298,0.00014069279,0.00016119119,0.0001423879],"domain_scores_gemma":[0.9993457,0.00039108747,0.0000529247,0.00010116506,0.000061766434,0.000047348476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025137712,0.00011303487,0.00016481045,0.000035334608,0.00015688107,0.000030811778,0.00016454366,0.00005263474,0.000009714307],"category_scores_gemma":[0.000057779478,0.00009675556,0.00005526419,0.00021814815,0.000039681905,0.00006141475,0.000019610141,0.00017951829,0.0000017261282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000604248,0.000027562568,0.00026018766,0.000046082703,0.000093249306,0.000001109115,0.009175225,0.90899754,0.000055461664,0.0004441707,0.00022559559,0.0806678],"study_design_scores_gemma":[0.0008054757,0.00008435357,0.0004177965,0.0000060022926,0.000032932625,0.0000026296082,0.0011479327,0.9958019,0.0000997962,0.0009232142,0.0005709587,0.00010695308],"about_ca_topic_score_codex":0.000009396252,"about_ca_topic_score_gemma":0.0000017399999,"teacher_disagreement_score":0.35938486,"about_ca_system_score_codex":0.000031822296,"about_ca_system_score_gemma":0.000012566916,"threshold_uncertainty_score":0.39455774},"labels":[],"label_agreement":null},{"id":"W3016159714","doi":"10.1111/itor.12797","title":"Solving the clustered traveling salesman problem with ‐relaxed priority rule","year":2020,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"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; Iterated local search; Mathematical optimization; Computer science; Class (philosophy); Iterated function; Traveling purchaser problem; 2-opt; Constraint (computer-aided design); Integer (computer science); Metaheuristic; Mathematics; Artificial intelligence","score_opus":0.07497900821825791,"score_gpt":0.3582295158604328,"score_spread":0.28325050764217485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016159714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04076049,0.000063062536,0.9291964,0.01519438,0.00023245679,0.00064313976,0.000036490725,0.00020090227,0.01367266],"genre_scores_gemma":[0.9268923,0.00006580078,0.07216593,0.00015281611,0.0001850665,0.00014036635,0.000025847054,0.000038506372,0.00033341895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979608,0.00022791399,0.00035406658,0.00026985595,0.0008976217,0.00028972],"domain_scores_gemma":[0.9988252,0.00050707586,0.000019542413,0.00014134643,0.00041421794,0.000092634495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189537,0.00013325906,0.000119746066,0.00015701054,0.00031730984,0.00022713104,0.0004377697,0.0000796246,0.0005552517],"category_scores_gemma":[0.00014831842,0.000109264154,0.00004296088,0.0006785876,0.000110887806,0.0003679498,0.00001815073,0.00092426914,0.00004684099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047321017,0.000035695433,0.000757843,0.000021441781,0.000056329678,0.000006088757,0.0017028431,0.98942316,0.0020031044,0.0012952279,0.00008496771,0.004565976],"study_design_scores_gemma":[0.00067177333,0.000036703652,0.0023643072,0.00005335482,0.00000503756,0.000017544504,0.00049109285,0.99156916,0.0015818331,0.00020869425,0.0028498182,0.00015070457],"about_ca_topic_score_codex":0.00004702479,"about_ca_topic_score_gemma":0.0001402378,"teacher_disagreement_score":0.88613176,"about_ca_system_score_codex":0.00024552934,"about_ca_system_score_gemma":0.00017869643,"threshold_uncertainty_score":0.60796165},"labels":[],"label_agreement":null},{"id":"W3016459552","doi":"10.1007/978-3-030-39694-7_14","title":"Integration of User’s Preferences into the Home Healthcare Routing and Scheduling Multi-objective Problem: A Hierarchical Approach with Pareto-Optimal Alternative Solutions","year":2020,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Vehicle Routing Optimization Methods","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":"CARE Canada; Polytechnique Montréal","funders":"","keywords":"Scheduling (production processes); Pareto principle; Health care; Decision maker; Computer science; Operations research; Heuristic; Pareto optimal; Multi-objective optimization; Operations management; Engineering; Economics; Artificial intelligence; Machine learning","score_opus":0.04330043294735896,"score_gpt":0.27533835176008314,"score_spread":0.23203791881272418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016459552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026125961,0.00024940685,0.98985946,0.000062073595,0.000057132238,0.0012105021,0.00010903892,0.00017363284,0.0056661437],"genre_scores_gemma":[0.07852974,0.00032859808,0.9205117,0.000010048162,0.00006837446,0.000099196535,0.000031745483,0.00014467316,0.00027587774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767,0.000029101348,0.00093944574,0.00049541687,0.00050084025,0.0003651849],"domain_scores_gemma":[0.99830353,0.00035877095,0.0005688849,0.0001691819,0.0004823832,0.00011723569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007839066,0.0005281756,0.0007483791,0.00024190004,0.00017872361,0.00013988871,0.000332123,0.00027257943,0.0000038013843],"category_scores_gemma":[0.00039314374,0.00042068947,0.000048917234,0.00016743079,0.00032918958,0.00016006171,0.00021090155,0.0014038455,0.0000014931297],"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.00003577919,0.00007781714,0.0002650383,0.004834095,0.00030644727,0.0000052981986,0.07904958,0.045312982,0.00018183493,0.8653028,0.000012697309,0.0046156254],"study_design_scores_gemma":[0.00038925128,0.00015479172,0.00011047691,0.0018219224,0.00014127952,0.000012541985,0.003098665,0.9270649,0.00009817142,0.06658564,0.000021964035,0.0005003979],"about_ca_topic_score_codex":0.000036774545,"about_ca_topic_score_gemma":0.00005905815,"teacher_disagreement_score":0.8817519,"about_ca_system_score_codex":0.00022206751,"about_ca_system_score_gemma":0.000113415146,"threshold_uncertainty_score":0.99982446},"labels":[],"label_agreement":null},{"id":"W3017984166","doi":"10.3390/su12083500","title":"Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions","year":2020,"lang":"en","type":"article","venue":"Sustainability","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":59,"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 Manitoba","funders":"","keywords":"Ant colony optimization algorithms; Vehicle routing problem; Mathematical optimization; Engineering; Routing (electronic design automation); Ant colony; Operations research; Mathematics; Embedded system","score_opus":0.021513893174764206,"score_gpt":0.2794227487170579,"score_spread":0.2579088555422937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017984166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6775229,0.00007251171,0.30676454,0.009835398,0.00015508835,0.0015210211,0.000013459342,0.0023464418,0.0017686641],"genre_scores_gemma":[0.81712234,0.0000010679939,0.18228519,0.00021544435,0.00009576242,0.00005159783,0.000003224159,0.00005925768,0.0001661084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981669,0.00019641916,0.00044299994,0.00044491445,0.0002100075,0.0005387241],"domain_scores_gemma":[0.998583,0.00014779507,0.000043464966,0.00040329993,0.00035899846,0.00046341616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005938763,0.00023416926,0.00029194396,0.00005703946,0.00012150022,0.000045003137,0.0002714595,0.00012871549,0.000033806326],"category_scores_gemma":[0.0024946355,0.00025089175,0.00008394529,0.0007253014,0.00003780757,0.00009576644,0.0001819512,0.00031859457,0.000009947806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050553295,0.000086643224,0.08769109,0.00085350685,0.000043862976,0.00002647032,0.010897647,0.8699016,0.0097877905,0.00011599541,0.00022442885,0.020320423],"study_design_scores_gemma":[0.00056538533,0.000043155185,0.020827174,0.000020495561,0.000020876982,0.0000014089503,0.0012604784,0.9726105,0.0030812875,0.0002110733,0.0009700491,0.0003881589],"about_ca_topic_score_codex":0.00020443034,"about_ca_topic_score_gemma":0.00000843293,"teacher_disagreement_score":0.13959947,"about_ca_system_score_codex":0.0005553838,"about_ca_system_score_gemma":0.0001491054,"threshold_uncertainty_score":0.99999434},"labels":[],"label_agreement":null},{"id":"W3019441366","doi":"10.1111/itor.12801","title":"The uncapacitated <i>r</i>‐allocation <i>p</i>‐hub center problem","year":2020,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Variable neighborhood search; Mathematical optimization; Benchmark (surveying); Solver; Generalization; Equivalence (formal languages); Mathematics; Computer science; Variable (mathematics); Integer programming; Binary number; Metaheuristic; Discrete mathematics","score_opus":0.07830413859196639,"score_gpt":0.3652832162998267,"score_spread":0.2869790777078603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019441366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00899782,0.00020788079,0.8729486,0.056975454,0.0011067368,0.0009980262,0.00010818508,0.00043061693,0.058226686],"genre_scores_gemma":[0.9773347,0.0004153888,0.02035027,0.00035068174,0.00021761162,0.00024459936,0.00007392853,0.000042340293,0.0009705304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791276,0.00024744254,0.00041731304,0.00023987197,0.0008743034,0.00030831466],"domain_scores_gemma":[0.9985767,0.00056927575,0.000017899145,0.00013957369,0.0005934924,0.0001030308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188661,0.00012202256,0.00009204088,0.00018291162,0.00034449867,0.00027249797,0.00046652404,0.000078076744,0.00042842486],"category_scores_gemma":[0.0002464198,0.00010825315,0.00004952079,0.0008194144,0.00012433444,0.00038761267,0.000015272002,0.00069309206,0.00015457082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047344347,0.000058021797,0.00034873874,0.000014469446,0.00005663149,0.000003298945,0.0008131535,0.9745879,0.0041222754,0.0070992955,0.0017162291,0.0111326445],"study_design_scores_gemma":[0.0006293424,0.000029560257,0.00043277984,0.000026182468,0.0000022485267,0.000008629584,0.0003039249,0.9147004,0.003153609,0.00057541067,0.079987645,0.00015029487],"about_ca_topic_score_codex":0.000021161013,"about_ca_topic_score_gemma":0.00006768568,"teacher_disagreement_score":0.9683368,"about_ca_system_score_codex":0.00027657129,"about_ca_system_score_gemma":0.00011595869,"threshold_uncertainty_score":0.46909517},"labels":[],"label_agreement":null},{"id":"W3020867067","doi":"10.1287/opre.2020.2033","title":"Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Branch and cut; Routing (electronic design automation); Vehicle routing problem; Solver; Reduction (mathematics); Mathematical optimization; Path (computing); Computer science; Mathematics; Node (physics); Inequality; Upper and lower bounds; Algorithm; Integer programming","score_opus":0.08454693968172562,"score_gpt":0.3695019839405457,"score_spread":0.28495504425882007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020867067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5204917,0.0042272615,0.46715257,0.0009516653,0.00017357724,0.0006184441,0.00004760803,0.0004350752,0.0059020664],"genre_scores_gemma":[0.798546,0.0007928095,0.19870049,0.000031212785,0.00010823419,0.00008706832,0.000027517897,0.00004984938,0.0016567903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998138,0.000523503,0.00029794854,0.0002844166,0.0003697617,0.00038636755],"domain_scores_gemma":[0.9986697,0.0005010924,0.000008400068,0.00024296546,0.00045075882,0.0001271232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017979457,0.00012165037,0.00017359391,0.0003085133,0.0004887178,0.00046338592,0.0000908665,0.00009127731,0.0000496065],"category_scores_gemma":[0.0012773029,0.00013043024,0.000022804958,0.0012644985,0.00008522517,0.00028479102,0.00015717448,0.0004181184,0.000018769948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035346586,0.000099036144,0.0046360767,0.00038180526,0.00012199175,0.000032725617,0.007482087,0.6364163,0.02679598,0.0048902202,0.0003566837,0.31878352],"study_design_scores_gemma":[0.000367931,0.000022112683,0.0017189231,0.000053202373,0.0000057951142,0.000027666229,0.00078113563,0.983711,0.012490599,0.0000920003,0.0005717103,0.00015793554],"about_ca_topic_score_codex":0.00017923793,"about_ca_topic_score_gemma":0.000106732616,"teacher_disagreement_score":0.34729466,"about_ca_system_score_codex":0.00007369385,"about_ca_system_score_gemma":0.000089638736,"threshold_uncertainty_score":0.5318791},"labels":[],"label_agreement":null},{"id":"W3022257994","doi":"","title":"Selective pricing in branch-price-and-cut algorithms for vehicle routing","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","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":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Heuristic; Column generation; Context (archaeology); Branch and cut; Branch and bound; Branch and price; Path (computing); Computer science; Mathematics; Routing (electronic design automation); Algorithm; Integer programming","score_opus":0.012191029225512188,"score_gpt":0.24728491598619065,"score_spread":0.23509388676067847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022257994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13671975,0.0003457116,0.8599929,0.0007403275,0.00009903164,0.0007221449,0.000019762329,0.0010332131,0.00032713407],"genre_scores_gemma":[0.71291703,0.000110145724,0.28607792,0.00019751649,0.00009905217,0.00034833566,0.0000028732659,0.0000998648,0.00014722989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979805,0.000113153765,0.0005080487,0.00041028752,0.00018297484,0.000805052],"domain_scores_gemma":[0.9986925,0.0005607915,0.00010759206,0.00035877666,0.00009837673,0.00018192528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011647536,0.00030693016,0.0003734674,0.00040606377,0.00014577757,0.000084030544,0.00023900998,0.00025932494,0.0000080991385],"category_scores_gemma":[0.0005860089,0.00028093075,0.00008841175,0.0006298538,0.000047224905,0.0003765146,0.00009071277,0.000269944,0.000004235426],"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.00011505129,0.00012842753,0.12040329,0.00021489468,0.00013334701,0.000017366361,0.0016382402,0.1693086,0.22454543,0.009016751,0.0006155244,0.47386307],"study_design_scores_gemma":[0.001159212,0.000063869804,0.036429696,0.00016311457,0.00001552541,0.000023331504,0.00004459318,0.8948152,0.0645963,0.001977817,0.00025996685,0.00045137398],"about_ca_topic_score_codex":0.00053947786,"about_ca_topic_score_gemma":0.00037705415,"teacher_disagreement_score":0.7255066,"about_ca_system_score_codex":0.00067177176,"about_ca_system_score_gemma":0.0000657938,"threshold_uncertainty_score":0.9999643},"labels":[],"label_agreement":null},{"id":"W3023001328","doi":"","title":"A time-expanded network for the biomedical sample transportation problem","year":2019,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Humanities; Political science; Philosophy","score_opus":0.011131934831249083,"score_gpt":0.24776028536215572,"score_spread":0.23662835053090664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023001328","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007097948,0.000031987936,0.9908657,0.00021389,0.00019110387,0.0005224354,0.000017255128,0.00035597614,0.00070370134],"genre_scores_gemma":[0.07842406,0.000010700371,0.9199137,0.00012957044,0.00019071312,0.00008684059,0.00017212606,0.000044491568,0.0010277616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946994,0.000014701924,0.00015867164,0.000090899965,0.00009163595,0.0001741446],"domain_scores_gemma":[0.9992773,0.0005244153,0.000016334006,0.00012474487,0.000024252791,0.00003295663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034098807,0.00007080213,0.00009140782,0.000017768112,0.000043007563,0.000016034212,0.000087153276,0.000056299697,0.00050360995],"category_scores_gemma":[0.000020402776,0.000049481925,0.000042890184,0.00016819465,0.000015274753,0.000044288157,0.0000022760669,0.000057331257,0.000048667014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007274094,0.0000062323875,0.0006100018,0.000034707,0.00003201387,5.203508e-8,0.00018935547,0.982829,0.00046809338,0.0008432994,0.0069402796,0.008039743],"study_design_scores_gemma":[0.00034286518,0.000023862718,0.00082980125,0.000009142404,0.0000151237155,3.6583276e-7,0.000024197247,0.97379833,0.00015909412,0.00041095287,0.024303569,0.000082697785],"about_ca_topic_score_codex":0.0000083511195,"about_ca_topic_score_gemma":0.0000058221945,"teacher_disagreement_score":0.07132611,"about_ca_system_score_codex":0.000014138332,"about_ca_system_score_gemma":0.000010322567,"threshold_uncertainty_score":0.5514176},"labels":[],"label_agreement":null},{"id":"W3025850278","doi":"10.1016/j.cor.2020.104944","title":"The two-echelon inventory-routing problem with fleet management","year":2020,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Transport Canada","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Vehicle routing problem; Computer science; Vendor-managed inventory; Remanufacturing; Inventory theory; Renting; Product (mathematics); Supply chain; Operations research; Fleet management; Vendor; Inventory management; Set (abstract data type); Inventory control; Routing (electronic design automation); Supply chain management; Operations management; Business; Manufacturing engineering; Mathematics; Economics; Engineering","score_opus":0.06683703304782425,"score_gpt":0.3465967150423648,"score_spread":0.27975968199454054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025850278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008811673,0.00013475545,0.9768849,0.004000155,0.00011369939,0.00080581463,0.0000017642209,0.00044286143,0.008804401],"genre_scores_gemma":[0.54362106,0.00008972381,0.45527247,0.00018823527,0.0002116251,0.00014676688,0.000015700776,0.00006407184,0.00039032422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982975,0.0003276518,0.00023303683,0.0002526405,0.00046714893,0.0004219905],"domain_scores_gemma":[0.999176,0.00015611967,0.000009460568,0.00031149318,0.00020089377,0.00014602747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011921215,0.00012489183,0.00010784412,0.00009625908,0.0008119391,0.0005083001,0.00046168282,0.000033275843,0.000014674385],"category_scores_gemma":[0.000047018424,0.00009563165,0.00002631009,0.0009541803,0.00009601649,0.0001519171,0.00021270796,0.00043579735,0.00007398251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006378722,0.000008805058,0.000116510564,0.00003665341,0.000051945284,0.00000782899,0.001105653,0.9707689,0.0002060968,0.006733608,0.0027976187,0.018159969],"study_design_scores_gemma":[0.0003537496,0.00005202539,0.00006767224,0.000043580727,0.000005291163,0.0000028371187,0.0003456557,0.9918715,0.00044470414,0.000027391905,0.006666279,0.00011933384],"about_ca_topic_score_codex":0.000012927704,"about_ca_topic_score_gemma":0.0000231166,"teacher_disagreement_score":0.5348094,"about_ca_system_score_codex":0.00014595984,"about_ca_system_score_gemma":0.000051294064,"threshold_uncertainty_score":0.62448615},"labels":[],"label_agreement":null},{"id":"W3027262244","doi":"10.1016/j.ejor.2020.05.005","title":"Alternating Lagrangian decomposition for integrated airline crew scheduling problem","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"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; Computer science; Scheduling (production processes); Mathematical optimization; Set (abstract data type); Constraint programming; Operations research; Decomposition; Context (archaeology); Assignment problem; Engineering; Mathematics; Aeronautics","score_opus":0.0954391724302661,"score_gpt":0.38727626805254606,"score_spread":0.29183709562227994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027262244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07759463,0.00021432119,0.9158135,0.0029302072,0.00011392122,0.0002258072,0.000011528221,0.000059327762,0.003036726],"genre_scores_gemma":[0.52091295,0.00002696556,0.47824258,0.0001065271,0.00061535236,0.0000021648261,0.000019210962,0.000043310432,0.000030932497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789727,0.0006580175,0.00057061506,0.00012442052,0.0005179717,0.00023169818],"domain_scores_gemma":[0.9980048,0.00032994666,0.00007672306,0.00006704023,0.0013276964,0.00019377594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045653395,0.00010283051,0.00015440585,0.00018488854,0.00019004432,0.00020819152,0.00029503717,0.000022259568,0.00008208281],"category_scores_gemma":[0.001177812,0.00009433995,0.0000760638,0.0003873623,0.000031428917,0.0002911851,0.000039106446,0.0005654825,0.000030386575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006515261,0.000017110693,0.00008202335,0.00005671351,0.000047522197,0.000027027301,0.00051438034,0.9366309,0.050236683,0.00055058557,0.001076801,0.010695108],"study_design_scores_gemma":[0.0009426834,0.00032121426,0.00024111698,0.00015701633,0.000008320714,0.00003961738,0.00016417696,0.9844311,0.007981021,0.00004476554,0.005550815,0.000118147735],"about_ca_topic_score_codex":8.227229e-7,"about_ca_topic_score_gemma":3.625248e-7,"teacher_disagreement_score":0.4433183,"about_ca_system_score_codex":0.00008412829,"about_ca_system_score_gemma":0.000102026424,"threshold_uncertainty_score":0.38470715},"labels":[],"label_agreement":null},{"id":"W3028512226","doi":"10.1016/j.cor.2020.104987","title":"A review of vehicle routing with simultaneous pickup and delivery","year":2020,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":200,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; Vehicle routing problem; Computer science; Routing (electronic design automation); Destinations; Operations research; Tourism; Artificial intelligence; Computer network; Mathematics; Geography","score_opus":0.08792970271494478,"score_gpt":0.389522005941624,"score_spread":0.30159230322667924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028512226","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004934684,0.9303172,0.06826449,0.000056525725,0.00005561913,0.0009856398,0.000019711335,0.00012971828,0.00016611925],"genre_scores_gemma":[0.00004012961,0.9187071,0.08089682,0.000043853073,0.000089579626,0.0000619726,0.000051867024,0.000080319034,0.000028365579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756205,0.0007181827,0.0006278006,0.0003781024,0.00038550032,0.00032839144],"domain_scores_gemma":[0.9977608,0.0011887127,0.000042772182,0.0004144952,0.0004367672,0.00015646004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147751,0.00027912596,0.0011024119,0.00025429463,0.00018851856,0.00012648603,0.00038396867,0.00013312876,0.000019951935],"category_scores_gemma":[0.0004584323,0.00023902564,0.00010055287,0.0013062103,0.0001232337,0.00010352326,0.00023437508,0.00080675696,0.000022763641],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010711383,0.000010108779,5.097262e-7,0.06225529,0.000102314065,0.000023979528,0.00011126172,0.07658615,0.0000017186678,0.00005513645,0.00042947897,0.86042297],"study_design_scores_gemma":[0.00009535612,0.00006782075,1.5155123e-7,0.07151508,0.0000943617,0.00004403157,0.000011369788,0.57295036,0.0000022926965,4.801502e-7,0.3550119,0.00020678245],"about_ca_topic_score_codex":0.00001783853,"about_ca_topic_score_gemma":0.000005450889,"teacher_disagreement_score":0.8602162,"about_ca_system_score_codex":0.00014655775,"about_ca_system_score_gemma":0.00033043153,"threshold_uncertainty_score":0.9747183},"labels":[],"label_agreement":null},{"id":"W3033405475","doi":"10.1016/j.ejor.2020.05.054","title":"The two-echelon production-routing problem","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Transport Canada","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Mathematical optimization; Routing (electronic design automation); Production (economics); Supply chain; Vendor-managed inventory; Vendor; Supply chain management; Mathematics; Economics","score_opus":0.11010586751565572,"score_gpt":0.367330615983832,"score_spread":0.2572247484681763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033405475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2291215,0.0029651206,0.46667615,0.112398386,0.0022868807,0.0013756513,0.000009469596,0.00045357196,0.18471327],"genre_scores_gemma":[0.9270167,0.00013126478,0.07069111,0.000095082585,0.0016217565,0.0000018131549,0.0000015033952,0.00005059395,0.00039019133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970115,0.0013394915,0.0004932587,0.000112981696,0.00079769985,0.00024506715],"domain_scores_gemma":[0.99835247,0.00035879997,0.00006382565,0.00011521028,0.00095988874,0.00014983551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009273195,0.00008234416,0.00009784918,0.00007572394,0.00047460973,0.00027414173,0.0003973169,0.000011818759,0.000047894617],"category_scores_gemma":[0.0028304935,0.000059006157,0.000047827474,0.00048302775,0.00007794362,0.00023597758,0.00007083982,0.00080005894,0.000102283266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003900037,0.000012990426,0.00027876877,0.000020075213,0.000052247324,0.000041273863,0.0013553977,0.9328586,0.023620492,0.0023172686,0.014094924,0.025308982],"study_design_scores_gemma":[0.00192608,0.0006922957,0.0049296776,0.0002678526,0.000024056248,0.00043090634,0.0016420839,0.7785994,0.025787625,0.00036266702,0.18481171,0.0005256629],"about_ca_topic_score_codex":4.5386986e-7,"about_ca_topic_score_gemma":3.3845077e-7,"teacher_disagreement_score":0.69789517,"about_ca_system_score_codex":0.000067833214,"about_ca_system_score_gemma":0.00012202553,"threshold_uncertainty_score":0.36503625},"labels":[],"label_agreement":null},{"id":"W3034726805","doi":"10.1287/ijoc.2021.1119","title":"Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Bayerische Forschungsallianz","keywords":"Vehicle routing problem; Mathematical optimization; Scheduling (production processes); Computer science; Branch and price; Branch and cut; Synchronization (alternating current); Mathematics; Routing (electronic design automation); Linear programming; Computer network","score_opus":0.014642493236050096,"score_gpt":0.24660680146249273,"score_spread":0.23196430822644262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034726805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31435615,0.00013359671,0.68429667,0.00035196258,0.00009825822,0.00018288271,0.0000020132352,0.0001356764,0.00044279126],"genre_scores_gemma":[0.7312649,0.000032360273,0.26826984,0.00021760652,0.00013933134,0.0000051334623,0.000006063401,0.000035393885,0.000029346207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989711,0.000030890613,0.00037514622,0.00015849985,0.00019974365,0.00026462454],"domain_scores_gemma":[0.9988964,0.0002090418,0.00016394859,0.000129801,0.00047731103,0.00012349291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006754095,0.00017692345,0.00019747038,0.00010683353,0.00038178536,0.00035075354,0.00009082908,0.00007367351,0.000007763935],"category_scores_gemma":[0.000084650484,0.00015385733,0.000029212073,0.0003333341,0.000022145166,0.00039134469,0.000034280398,0.000344828,0.000005197141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012775417,0.000021430946,0.0007666238,0.00018377975,0.00007927128,0.0000016814965,0.0013959561,0.9660047,0.0005631605,0.00030158303,0.000010027705,0.030658979],"study_design_scores_gemma":[0.0010214378,0.00014511611,0.0014554142,0.0004702115,0.000024974945,0.00030690688,0.00024080055,0.99179804,0.00359668,0.00045175807,0.00021475364,0.00027388288],"about_ca_topic_score_codex":0.000005632558,"about_ca_topic_score_gemma":0.0000028783625,"teacher_disagreement_score":0.41690877,"about_ca_system_score_codex":0.00011199421,"about_ca_system_score_gemma":0.00009350498,"threshold_uncertainty_score":0.62741196},"labels":[],"label_agreement":null},{"id":"W3036044801","doi":"10.3390/app10124154","title":"Cooperative Path Planning for Aerial Recovery of a UAV Swarm Using Genetic Algorithm and Homotopic Approach","year":2020,"lang":"en","type":"article","venue":"Applied Sciences","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 Toronto","funders":"","keywords":"Motion planning; Computer science; Swarm behaviour; Scheduling (production processes); Rendezvous; Real-time computing; Path (computing); Flexibility (engineering); Distributed computing; Mathematical optimization; Artificial intelligence; Engineering; Mathematics; Robot; Aerospace engineering; Spacecraft","score_opus":0.051461689233457224,"score_gpt":0.2816755440561116,"score_spread":0.23021385482265438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036044801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19213557,0.00011244394,0.8067345,0.000009674584,0.00006803131,0.0002278852,0.000007805449,0.000048741967,0.0006553493],"genre_scores_gemma":[0.30192596,0.0000057220286,0.6979274,0.000034739383,0.00008052286,0.000014475826,0.0000014381142,0.000008289074,0.0000014514856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993624,0.000018237615,0.00016414313,0.00019705608,0.000107566666,0.00015060228],"domain_scores_gemma":[0.999754,0.00008590837,0.00004037171,0.000049683666,0.000021110618,0.000048932347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023772186,0.00008743054,0.0001590741,0.00003868221,0.0001160219,0.000047148493,0.00010823819,0.00003966091,0.0000022637034],"category_scores_gemma":[0.000036575668,0.00008255645,0.000016806054,0.00028857397,0.00011258509,0.0000623414,0.000029979497,0.00004952297,2.3892986e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004553621,0.000004031719,0.000057894344,0.000043402855,0.000008728937,2.0381738e-7,0.0012713522,0.98065996,0.009107068,0.00016410582,0.000017321236,0.008661363],"study_design_scores_gemma":[0.00024092625,0.000055187862,0.000082827646,0.000008850961,0.000009901212,0.0000018015727,0.0004797394,0.989927,0.008953042,0.00009283418,0.00004583722,0.00010207499],"about_ca_topic_score_codex":0.00000252914,"about_ca_topic_score_gemma":2.9461651e-8,"teacher_disagreement_score":0.10979038,"about_ca_system_score_codex":0.00001010988,"about_ca_system_score_gemma":0.000032540924,"threshold_uncertainty_score":0.33665544},"labels":[],"label_agreement":null},{"id":"W3036776288","doi":"10.1287/trsc.2019.0956","title":"Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University","funders":"","keywords":"Bounding overwatch; Scheduling (production processes); Mathematical optimization; Vehicle routing problem; Branch and cut; Integer programming; Linear programming; Computer science; Stochastic programming; Travelling salesman problem; Stochastic optimization; Routing (electronic design automation); Mathematics","score_opus":0.018078489015077453,"score_gpt":0.258140197037406,"score_spread":0.24006170802232854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036776288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4727989,0.00009349565,0.5255507,0.001041642,0.0000067043584,0.0003554582,0.000008460886,0.00011632252,0.000028295897],"genre_scores_gemma":[0.97725075,0.000009960777,0.022478763,0.00019498142,0.0000073960596,0.00003384755,0.000008231839,0.000014572893,0.0000014964015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914587,0.000015036708,0.00020321368,0.00026598846,0.00018579507,0.00018412447],"domain_scores_gemma":[0.9996108,0.000051727468,0.000036644782,0.00007694876,0.00008213334,0.00014178986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025841105,0.00009765539,0.00012480855,0.000070167196,0.00011703432,0.000046370144,0.00009250973,0.000029413597,0.0000032762932],"category_scores_gemma":[0.000013166622,0.000095054165,0.000005225426,0.0012129359,0.00006758164,0.00028944254,0.0000033421434,0.00010828916,0.0000012586402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009674504,0.000008645619,0.015042997,0.00031043828,0.0000038362255,0.0000010872307,0.013838535,0.9555852,0.01090294,0.0013584784,4.4206726e-7,0.0029377437],"study_design_scores_gemma":[0.00047339158,0.000026943237,0.13893189,0.000054575772,0.0000079627125,0.0000013293891,0.0006141212,0.8592157,0.000493252,0.000048456353,0.0000028018187,0.00012958352],"about_ca_topic_score_codex":0.00005801622,"about_ca_topic_score_gemma":0.0001447659,"teacher_disagreement_score":0.5044519,"about_ca_system_score_codex":0.000025723353,"about_ca_system_score_gemma":0.000058236907,"threshold_uncertainty_score":0.38761964},"labels":[],"label_agreement":null},{"id":"W3037143117","doi":"10.5267/j.ijiec.2020.6.003","title":"Parameter tuning of the HCSCROCFO-3Opt algorithm for solving the capacitated vehicle routing problem","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Computer science; Routing (electronic design automation); Algorithm; Mathematics; Embedded system","score_opus":0.04260207365858089,"score_gpt":0.2687201777290583,"score_spread":0.22611810407047744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037143117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03872062,0.000047353085,0.95673454,0.0025926284,0.0015504566,0.00022874081,0.000029134788,0.000071714676,0.000024823194],"genre_scores_gemma":[0.8119837,0.000003920653,0.18712412,0.00007760652,0.0007594802,0.0000065244035,0.0000042875113,0.000036514048,0.000003863044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986448,0.00004930052,0.0006744053,0.000091711394,0.0003699702,0.00016978505],"domain_scores_gemma":[0.9980195,0.0009396952,0.0003280774,0.0000861885,0.0005565584,0.00006997553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053271203,0.00014130662,0.0002108427,0.00010926993,0.00008047726,0.000093634444,0.0005754229,0.00008456938,0.0000056758513],"category_scores_gemma":[0.001198842,0.00010607605,0.00018800961,0.0003772742,0.00003438938,0.00018896333,0.000059455288,0.0004952207,6.4411785e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007438426,0.000008619947,0.0001285213,0.000007835578,0.00021603615,0.0000013906725,0.0010622118,0.9751918,0.0033808548,0.000174356,0.0002984024,0.01952258],"study_design_scores_gemma":[0.0008607841,0.000038833958,0.00011307766,0.00016863577,0.0000442672,0.000023603845,0.00017943207,0.9938284,0.004005125,0.00006343353,0.0005711623,0.0001032581],"about_ca_topic_score_codex":0.000004444076,"about_ca_topic_score_gemma":2.7725085e-7,"teacher_disagreement_score":0.7732631,"about_ca_system_score_codex":0.000098860095,"about_ca_system_score_gemma":0.00008475602,"threshold_uncertainty_score":0.43256557},"labels":[],"label_agreement":null},{"id":"W3037764692","doi":"10.1002/net.21964","title":"Routing electric vehicles with a single recharge per route","year":2020,"lang":"en","type":"article","venue":"Networks","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Deutsche Forschungsgemeinschaft","keywords":"Groundwater recharge; Computer science; Driving range; Routing (electronic design automation); Heuristic; Range (aeronautics); Parking lot; Suite; Operations research; Mathematical optimization; Power (physics); Electric vehicle; Engineering; Mathematics; Computer network","score_opus":0.01957702120302509,"score_gpt":0.2200015023775971,"score_spread":0.200424481174572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037764692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060599618,0.0004579686,0.93245006,0.00028104873,0.00011360885,0.00015733534,0.0000012484588,0.0012221931,0.0047169053],"genre_scores_gemma":[0.93521434,0.000031335418,0.06370541,0.00044075915,0.00046161606,0.000009420314,0.0000079204565,0.00008558874,0.0000436157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896455,0.0000667968,0.00020521291,0.00022544386,0.00014420038,0.0003937842],"domain_scores_gemma":[0.99953276,0.000093969866,0.000043128326,0.00015849622,0.000036384616,0.00013527455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019076382,0.00017607166,0.00019561432,0.000036537243,0.000089596644,0.000070857255,0.00014425669,0.00011875598,0.0000496776],"category_scores_gemma":[0.00004980411,0.0001687872,0.000040839597,0.0005981827,0.000012667914,0.000115743285,0.000026559495,0.0003695752,0.000026142616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014010904,0.000008067157,0.0021826532,0.000013830818,0.000029610766,0.0000056939693,0.00030133454,0.9740515,0.0031561635,0.00009977019,0.0007515047,0.019385882],"study_design_scores_gemma":[0.000276321,0.000069131216,0.00051490247,0.000027256187,0.000020641835,0.000007060029,0.000024543559,0.9954847,0.0015712025,0.000007898982,0.0017721022,0.00022422937],"about_ca_topic_score_codex":0.0000029590708,"about_ca_topic_score_gemma":0.0000016085633,"teacher_disagreement_score":0.8746147,"about_ca_system_score_codex":0.00006765709,"about_ca_system_score_gemma":0.000013595182,"threshold_uncertainty_score":0.68829423},"labels":[],"label_agreement":null},{"id":"W3046352921","doi":"10.1155/2020/8815983","title":"A Fissile Ripple Spreading Algorithm to Solve Time-Dependent Vehicle Routing Problem via Coevolutionary Path Optimization","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Shortest path problem; Computer science; Constrained Shortest Path First; Routing (electronic design automation); Path (computing); Vehicle routing problem; Trajectory; Traffic congestion; Engineering; Computer network; Mathematics; Transport engineering; K shortest path routing","score_opus":0.007878574087836812,"score_gpt":0.2298517935174723,"score_spread":0.2219732194296355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046352921","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018560482,0.000117459516,0.9802169,0.00029967196,0.00021386458,0.00028586003,0.000031421023,0.00019324875,0.00008108275],"genre_scores_gemma":[0.22892493,0.000035453486,0.770617,0.00010644964,0.00019038972,0.000007978815,0.000050172264,0.000057575642,0.000010041737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.00004036659,0.0008190903,0.00019207178,0.00040536787,0.00025634855],"domain_scores_gemma":[0.9990232,0.00007276385,0.00030059487,0.00009395482,0.00025864437,0.00025086364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034297415,0.00019636423,0.0003102357,0.00013130422,0.00009884837,0.000033832686,0.00015261438,0.000088082175,0.00007854153],"category_scores_gemma":[0.000056272533,0.00021692697,0.00010705522,0.0004913999,0.000011957707,0.00070310564,0.000005131117,0.00027907206,0.000013454742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049370752,0.000025223822,0.0002025121,0.000045591107,0.000039050236,0.00001984615,0.0023216584,0.9487252,0.02901176,0.000010727929,0.000097462194,0.01945157],"study_design_scores_gemma":[0.0009659771,0.00020689477,0.0018606444,0.00013585619,0.00006364033,0.000015175097,0.0002710271,0.99049264,0.005474478,0.000070533766,0.00019054078,0.00025258673],"about_ca_topic_score_codex":0.0000025234665,"about_ca_topic_score_gemma":0.0000011274601,"teacher_disagreement_score":0.21036445,"about_ca_system_score_codex":0.0001531824,"about_ca_system_score_gemma":0.00004314805,"threshold_uncertainty_score":0.8846025},"labels":[],"label_agreement":null},{"id":"W3046951078","doi":"10.1007/s10479-020-03743-0","title":"Optimal scheduling of airport ferry vehicles based on capacity network","year":2020,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"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 Victoria; Fisheries and Oceans Canada","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Integer programming; Computer science; Scheduling (production processes); Operations research; Linear programming; Flow network; Mathematical optimization; Engineering; Mathematics; Algorithm","score_opus":0.2884538788196349,"score_gpt":0.4198422238996973,"score_spread":0.13138834508006236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046951078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.837126,0.00013191302,0.15674204,0.0029109789,0.000051919124,0.00029197702,0.000026433228,0.00011167574,0.0026070366],"genre_scores_gemma":[0.81707567,0.00003989902,0.1825803,0.00012845758,0.00010754858,0.000014432807,0.0000110425835,0.00002514111,0.000017512253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983434,0.00027643947,0.00037730532,0.0001770205,0.00051339605,0.00031245608],"domain_scores_gemma":[0.99863774,0.00026549087,0.000020247093,0.000267734,0.00067380053,0.00013501408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017557228,0.000101377926,0.00021574204,0.00015228587,0.00015136355,0.0000380147,0.000240369,0.00008659961,0.00010788733],"category_scores_gemma":[0.00087191444,0.00010701907,0.00006817484,0.00088880816,0.00011541977,0.00012754326,0.00004548913,0.00039958814,0.000016360154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022108034,0.000033683245,0.0006309158,0.00007321255,0.000022296681,0.0000013170877,0.00023681563,0.99030644,0.0063519734,0.000702514,0.0009966359,0.00062210707],"study_design_scores_gemma":[0.00014205712,0.0001347562,0.0009954287,0.00005870995,0.0000026596106,2.7075157e-7,0.00006187432,0.9448607,0.053466424,0.000014891422,0.0001791633,0.00008305472],"about_ca_topic_score_codex":0.000027396592,"about_ca_topic_score_gemma":0.0000039120127,"teacher_disagreement_score":0.04711445,"about_ca_system_score_codex":0.000014017549,"about_ca_system_score_gemma":0.00010627781,"threshold_uncertainty_score":0.4364111},"labels":[],"label_agreement":null},{"id":"W3048626276","doi":"10.1155/2020/3030197","title":"Time-Dependent Electric Vehicle Routing Problem with Time Windows and Path Flexibility","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Flexibility (engineering); Mathematical optimization; Path (computing); Routing (electronic design automation); Vehicle routing problem; Computer science; Electric vehicle; Energy consumption; Shortest path problem; Integer programming; Simulation; Real-time computing; Engineering; Mathematics; Computer network","score_opus":0.008577693196341687,"score_gpt":0.22932060219763753,"score_spread":0.22074290900129584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048626276","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8625656,0.00016604863,0.13666898,0.00016618242,0.000027765853,0.000188095,0.0000047929034,0.00011851702,0.00009402895],"genre_scores_gemma":[0.89588654,0.00003953243,0.10391905,0.000041585336,0.000060459417,0.0000020638283,0.000006074442,0.00003395026,0.000010750588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998921,0.00004583891,0.0004787682,0.00013795726,0.00025256886,0.00016389675],"domain_scores_gemma":[0.9993821,0.00006251201,0.00021519644,0.00006637651,0.0001452564,0.00012855043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003210346,0.00013541088,0.0002484931,0.000058385365,0.00004577673,0.00002176437,0.000072058014,0.000050116087,0.000022025913],"category_scores_gemma":[0.000032149772,0.00012167204,0.000041861742,0.000301613,0.000015621294,0.00043787443,0.0000014995262,0.00025655303,0.000004329805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001287576,0.000013739867,0.0013022008,0.000056263503,0.000031887834,0.00001451289,0.001332774,0.8965505,0.09270766,0.0000066442767,0.0000062588338,0.007848799],"study_design_scores_gemma":[0.0041860966,0.0010201948,0.05309456,0.00021902434,0.00020201807,0.000047945374,0.0003238646,0.90284294,0.037225407,0.00018787995,0.00014611887,0.0005039512],"about_ca_topic_score_codex":6.2673604e-7,"about_ca_topic_score_gemma":9.2353184e-7,"teacher_disagreement_score":0.05548225,"about_ca_system_score_codex":0.00004906323,"about_ca_system_score_gemma":0.00003408095,"threshold_uncertainty_score":0.4961642},"labels":[],"label_agreement":null},{"id":"W3079159037","doi":"10.1007/s43069-020-00016-1","title":"Dynamic Constraint Aggregation for Solving Very Large-scale Airline Crew Pairing Problems","year":2020,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"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; Group for Research in Decision Analysis","funders":"","keywords":"Crew; Constraint (computer-aided design); Computer science; Set (abstract data type); Degeneracy (biology); Exploit; Mathematical optimization; Scale (ratio); Column generation; Pairing; Algorithm; Operations research; Mathematics; Engineering; Aeronautics","score_opus":0.05093061371344633,"score_gpt":0.3443331500059634,"score_spread":0.29340253629251706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079159037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017943053,0.00024459514,0.9741751,0.0050116465,0.00012366749,0.0011378713,0.00008271963,0.0004426415,0.00083871424],"genre_scores_gemma":[0.71152985,0.00008781995,0.28729227,0.00013211563,0.00009567693,0.000321257,0.00018328291,0.000074589996,0.00028314826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982376,0.000096368676,0.00036207953,0.00030166542,0.0003403761,0.00066187757],"domain_scores_gemma":[0.99897856,0.00019328657,0.000014736379,0.00023128578,0.00039168235,0.00019047904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013802049,0.0001468963,0.00017855225,0.00016818772,0.00063808815,0.00025455718,0.00021569844,0.00010645382,0.000112832546],"category_scores_gemma":[0.0007745734,0.00015992136,0.00007222857,0.00060126605,0.00007002995,0.0003886081,0.000096835916,0.00040136627,0.000050155304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063860903,0.000022689135,0.0001665875,0.00013351227,0.00002374417,0.0000010106521,0.0009410318,0.9762513,0.012361078,0.00088167965,0.0012282005,0.007982754],"study_design_scores_gemma":[0.00051695004,0.00008480371,0.000045897734,0.00006990637,0.0000058500623,0.0000025965567,0.0009969221,0.98941296,0.003883762,0.00008777052,0.004726,0.00016655013],"about_ca_topic_score_codex":0.000009334543,"about_ca_topic_score_gemma":0.0002224769,"teacher_disagreement_score":0.69358677,"about_ca_system_score_codex":0.00016973293,"about_ca_system_score_gemma":0.0001162675,"threshold_uncertainty_score":0.6521404},"labels":[],"label_agreement":null},{"id":"W3082078888","doi":"10.1016/j.asoc.2020.106681","title":"A heuristic approach for optimal integrated airline schedule design and fleet assignment with demand recapture","year":2020,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"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 Alberta","funders":"","keywords":"Schedule; Mathematical optimization; Computer science; Genetic algorithm; Integer programming; Scheduling (production processes); Heuristic; Linear programming; Population; Scale (ratio); Operations research; Engineering; Mathematics","score_opus":0.02200079983770911,"score_gpt":0.23153715455458043,"score_spread":0.20953635471687132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082078888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00480642,0.00014891526,0.9931098,0.00008479666,0.000029098315,0.0007662955,0.0000039064735,0.00064693455,0.00040381026],"genre_scores_gemma":[0.45762375,0.0000016828881,0.5421006,0.00011454826,0.00006242014,0.000025130299,0.00002236715,0.000047152054,0.0000023420116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883705,0.000055143064,0.0002772963,0.0003733022,0.00013815472,0.0003190214],"domain_scores_gemma":[0.9992887,0.00030907424,0.000068769834,0.00012910982,0.000051747375,0.00015261912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004921965,0.00025556525,0.00031434998,0.000043277265,0.00016240813,0.000083196304,0.00012962478,0.00010880393,0.0000034635234],"category_scores_gemma":[0.00008151885,0.00023291679,0.000026165499,0.00028142557,0.00004124479,0.00003973263,0.000052363666,0.0002838999,0.0000014940025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007438907,0.000015639385,0.000037353035,0.00016471648,0.00006355451,0.0000015487443,0.00068281003,0.99086934,0.001331712,0.0002535204,0.00018239845,0.0063230307],"study_design_scores_gemma":[0.001026342,0.000083920386,0.00001436787,0.00003524523,0.00004763553,0.000010389197,0.00029948552,0.99550366,0.00248328,0.000017397057,0.0001979928,0.0002802864],"about_ca_topic_score_codex":5.0645093e-7,"about_ca_topic_score_gemma":5.1922292e-8,"teacher_disagreement_score":0.45281735,"about_ca_system_score_codex":0.000040479717,"about_ca_system_score_gemma":0.000023121564,"threshold_uncertainty_score":0.9498071},"labels":[],"label_agreement":null},{"id":"W3083618710","doi":"10.1016/j.eswa.2020.113959","title":"Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm","year":2020,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":106,"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":"National Research Foundation of Korea","keywords":"Computer science; Genetic algorithm; Pickup; Routing (electronic design automation); Vehicle routing problem; Operations research; Point (geometry); Delivery Performance; Set (abstract data type); Decision maker; Artificial intelligence; Industrial engineering; Machine learning; Computer network","score_opus":0.029393816094489624,"score_gpt":0.259616303172509,"score_spread":0.23022248707801937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083618710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007924441,0.0016745785,0.9880541,0.00011683872,0.000018777439,0.001753616,0.000015697973,0.00035106472,0.00009089437],"genre_scores_gemma":[0.63178384,0.000023358181,0.36714363,0.00005115351,0.0002301832,0.00068589323,0.0000053197905,0.00006514857,0.000011502594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896663,0.000040117975,0.00028623556,0.00028969697,0.00014686634,0.00027046903],"domain_scores_gemma":[0.9990129,0.00042957006,0.000093017065,0.00021922505,0.00013165819,0.00011366317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013449031,0.00019030068,0.00019197956,0.000026150852,0.00039836153,0.00015103686,0.00014795107,0.00005895448,0.000001719994],"category_scores_gemma":[0.000015132967,0.00013709131,0.000020418562,0.00029665756,0.0000502513,0.00008315055,0.000023397506,0.00012128024,0.0000018655707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006171668,0.000005482116,0.00008836655,0.000079525125,0.000053154985,0.0000014928564,0.00086875283,0.97599363,0.0014817996,0.00013553453,0.00001614881,0.021269951],"study_design_scores_gemma":[0.00037473653,0.000055466204,0.000017072483,0.000057766927,0.000035984176,0.000048233578,0.0018128576,0.9955672,0.00027614526,0.0000032638486,0.0015455413,0.00020572449],"about_ca_topic_score_codex":0.00009614508,"about_ca_topic_score_gemma":0.0000033849017,"teacher_disagreement_score":0.6238594,"about_ca_system_score_codex":0.000052601186,"about_ca_system_score_gemma":0.00004302493,"threshold_uncertainty_score":0.5590421},"labels":[],"label_agreement":null},{"id":"W3083807878","doi":"10.1287/ijoc.2020.0974","title":"Addressing orientation symmetry in the time window assignment vehicle routing problem","year":2021,"lang":"en","type":"article","venue":"EUR Research Repository (Erasmus University Rotterdam)","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","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Computer science; Mathematical optimization; Routing (electronic design automation); Tree (set theory); Orientation (vector space); Algorithm; Mathematics","score_opus":0.05342564923841636,"score_gpt":0.3072336184337487,"score_spread":0.25380796919533233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083807878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9340565,0.0001285978,0.010931751,0.00068681815,0.0002463667,0.0006239302,0.000005909411,0.00030120098,0.053018887],"genre_scores_gemma":[0.9897858,0.000016145646,0.0075669647,0.0000532696,0.00014891151,0.000005181239,0.000018702169,0.00003822414,0.0023668066],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956222,0.0022509068,0.00028027926,0.0004098951,0.00085637544,0.00058034266],"domain_scores_gemma":[0.99855685,0.00055715046,0.000056881243,0.00047448595,0.00024002843,0.000114624716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022101826,0.00017012557,0.0001906459,0.0003120964,0.00069760747,0.0002879858,0.000454461,0.00012111823,0.000038816903],"category_scores_gemma":[0.00013998253,0.00017777739,0.00007246737,0.0014692787,0.00009647469,0.00042306897,0.00019415953,0.0008710736,0.00004948444],"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.00020483293,0.0005501628,0.0645219,0.00046648647,0.00024230785,0.006191625,0.017822567,0.28409654,0.6009787,0.0021351036,0.0071069663,0.015682856],"study_design_scores_gemma":[0.007897068,0.00029111482,0.09432195,0.0012645993,0.000105420026,0.00045922288,0.020559095,0.6433479,0.21213132,0.0003431621,0.01763374,0.0016453812],"about_ca_topic_score_codex":0.00007608182,"about_ca_topic_score_gemma":0.0000111302015,"teacher_disagreement_score":0.38884732,"about_ca_system_score_codex":0.0006821303,"about_ca_system_score_gemma":0.00015480553,"threshold_uncertainty_score":0.72495514},"labels":[],"label_agreement":null},{"id":"W3084549995","doi":"10.1002/net.21984","title":"The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands","year":2020,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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; Metaheuristic; Computer science; Integer programming; Routing (electronic design automation); Set (abstract data type); Graph; Mathematics; Theoretical computer science; Computer network","score_opus":0.01018283057323346,"score_gpt":0.2019510239074673,"score_spread":0.19176819333423384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084549995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06485119,0.00045019115,0.9234628,0.00021938486,0.00026799706,0.0003529958,0.0000032089029,0.0011927471,0.009199463],"genre_scores_gemma":[0.85247254,0.000084549625,0.14515881,0.0003224069,0.0008996736,0.000048025617,0.000034151864,0.00017427963,0.0008055344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854416,0.00013449638,0.00030938364,0.0002487089,0.0002280075,0.00053522276],"domain_scores_gemma":[0.9990758,0.0003800605,0.00007920526,0.00022293707,0.00007497678,0.00016703403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052250276,0.00022998532,0.0002146947,0.00002326126,0.00027106117,0.00016812127,0.00026851625,0.00014182448,0.000010827519],"category_scores_gemma":[0.000120784316,0.0001729938,0.000049066344,0.00049023924,0.000047372265,0.00010831871,0.000052418738,0.00046890287,0.000029288241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043396226,0.0000035311664,0.00079261686,0.000011136953,0.00007346238,0.0000067480514,0.0004314651,0.9889555,0.0004062246,0.00011817389,0.0046306904,0.004566097],"study_design_scores_gemma":[0.00041705102,0.0000412843,0.00028853165,0.000025634714,0.0000311775,0.000009706968,0.00009307398,0.996472,0.000586375,0.000018241042,0.0019188937,0.000098044686],"about_ca_topic_score_codex":0.0000045374168,"about_ca_topic_score_gemma":0.00000741334,"teacher_disagreement_score":0.7876214,"about_ca_system_score_codex":0.00004541797,"about_ca_system_score_gemma":0.000018760458,"threshold_uncertainty_score":0.7054482},"labels":[],"label_agreement":null},{"id":"W3085334717","doi":"10.1080/10556788.2020.1817447","title":"Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding","year":2020,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"McGill University","funders":"","keywords":"Bounding overwatch; Travelling salesman problem; Morin; Computer science; Mathematical optimization; Mathematics; Algorithm; Artificial intelligence","score_opus":0.025209316645392842,"score_gpt":0.301731733635452,"score_spread":0.2765224169900592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085334717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029435116,0.00021211029,0.9956567,0.00013631127,0.0002542092,0.0012948599,0.000029967498,0.002005277,0.00011618955],"genre_scores_gemma":[0.0056107156,0.00006187521,0.9934047,0.00012420726,0.00011673535,0.00026649472,0.00013196618,0.0002398658,0.0000434774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973738,0.00030964767,0.00068135903,0.0006810733,0.00028435243,0.00066974823],"domain_scores_gemma":[0.99798596,0.0008214994,0.00025461466,0.00033512534,0.00029410512,0.00030870535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012157093,0.0004667733,0.0005298492,0.00014877711,0.00036654033,0.00030173306,0.00036551227,0.00022567691,0.00006535485],"category_scores_gemma":[0.001505348,0.000488814,0.00012923204,0.00080741436,0.00014998345,0.00051402947,0.00005690551,0.00037291175,0.0000031070513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037328307,0.000011845857,0.00030759387,0.00038335862,0.00006461933,0.0000026222865,0.00087691174,0.8145658,0.00051422295,0.00006773654,0.0000075055027,0.18316048],"study_design_scores_gemma":[0.00095907424,0.00012687064,0.00002870076,0.00014157266,0.00012131044,0.000019298754,0.00041186195,0.99632955,0.0008795582,0.000044535296,0.00033466012,0.00060300087],"about_ca_topic_score_codex":0.0000027604967,"about_ca_topic_score_gemma":0.0000021036894,"teacher_disagreement_score":0.18255748,"about_ca_system_score_codex":0.00017487248,"about_ca_system_score_gemma":0.000104857645,"threshold_uncertainty_score":0.99975634},"labels":[],"label_agreement":null},{"id":"W3086889218","doi":"10.1016/j.cie.2020.106832","title":"A new bi-objective vehicle routing-scheduling problem with cross-docking: Mathematical model and algorithms","year":2020,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Tardiness; Mathematical optimization; Vehicle routing problem; Sorting; Computer science; Integer programming; Scheduling (production processes); Genetic algorithm; Job shop scheduling; Multi-objective optimization; Pareto principle; Algorithm; Routing (electronic design automation); Mathematics","score_opus":0.036964806310519835,"score_gpt":0.25109734866772104,"score_spread":0.2141325423572012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086889218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097370096,0.000054038872,0.9006923,0.00015787386,0.00015698286,0.0003244882,0.0000036982551,0.0010844594,0.00015605941],"genre_scores_gemma":[0.43746853,0.000003386291,0.5618211,0.000041764386,0.00053819193,0.000009981109,0.0000034971695,0.000102761245,0.000010796662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838674,0.00002835084,0.00043356168,0.0004124584,0.00025913402,0.00047977894],"domain_scores_gemma":[0.9990831,0.00019464329,0.00006597,0.00018395323,0.000055804372,0.00041654689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028424748,0.00036782195,0.00044283294,0.000103888735,0.00008877813,0.0002604942,0.00022677386,0.00022407899,0.000007754407],"category_scores_gemma":[0.00015118203,0.00037925542,0.000060877377,0.0005238246,0.000029995252,0.00029315337,0.00013177162,0.0006890182,0.0000055765413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019085403,0.0000061447868,0.0001876387,0.00006588745,0.00008039582,0.000010165094,0.0011576073,0.9842977,0.0008980301,0.00033758953,0.000053961536,0.012885826],"study_design_scores_gemma":[0.001624463,0.00007658953,0.000048669302,0.00020381997,0.000033448865,0.000021739948,0.000031795924,0.9955758,0.0018350842,0.000049063277,0.00007155717,0.00042799005],"about_ca_topic_score_codex":0.0000051523198,"about_ca_topic_score_gemma":1.3955726e-7,"teacher_disagreement_score":0.34009844,"about_ca_system_score_codex":0.000100019366,"about_ca_system_score_gemma":0.00007938993,"threshold_uncertainty_score":0.99986595},"labels":[],"label_agreement":null},{"id":"W3089996180","doi":"10.1016/j.ejor.2021.07.056","title":"Meta partial benders decomposition for the logistics service network design problem","year":2021,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Benders' decomposition; Decomposition; Computer science; Benchmark (surveying); Mathematical optimization; Service (business); Reverse logistics; Network planning and design; Operations research; Product (mathematics); Supply chain; Engineering; Mathematics; Computer network; Economics; Business","score_opus":0.33625220473001965,"score_gpt":0.4159091840486648,"score_spread":0.07965697931864513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089996180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021039156,0.0023656122,0.9933046,0.002339614,0.00062360946,0.0005661554,0.00001696305,0.000028243297,0.0005447715],"genre_scores_gemma":[0.10130088,0.0006444404,0.8953153,0.00019198352,0.002227313,0.00004205707,0.000075039774,0.00011323729,0.000089730245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941343,0.003545091,0.00080774666,0.00021489318,0.00092671916,0.00037126636],"domain_scores_gemma":[0.99406064,0.0024399934,0.00017174282,0.00030020176,0.002899079,0.00012832439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017751232,0.0002059221,0.00034550327,0.0001294637,0.00042178758,0.00072222995,0.0007313694,0.00007786166,0.00013665248],"category_scores_gemma":[0.0006750129,0.00015502555,0.0002246357,0.00032602603,0.00006336911,0.00013876248,0.00030448998,0.00155106,0.000008451757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052549287,0.000021688194,0.0000039388215,0.000101922866,0.0012583291,0.000033226544,0.0003104893,0.98993134,0.00030326718,0.00038751465,0.006430589,0.0011651164],"study_design_scores_gemma":[0.00034337642,0.00009891491,0.00009762004,0.00015136534,0.00042170857,0.000055707893,0.000102777005,0.994884,0.000461235,0.00037720968,0.0028361941,0.00016986897],"about_ca_topic_score_codex":0.0000026922698,"about_ca_topic_score_gemma":0.000002906117,"teacher_disagreement_score":0.10109049,"about_ca_system_score_codex":0.00015802801,"about_ca_system_score_gemma":0.00051397464,"threshold_uncertainty_score":0.69644797},"labels":[],"label_agreement":null},{"id":"W3093308000","doi":"10.1155/2020/8831746","title":"The Fourth-Party Logistics Routing Problem Using Ant Colony System-Improved Grey Wolf Optimization","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Ant colony optimization algorithms; Computer science; Node (physics); Operations research; Vehicle routing problem; Routing (electronic design automation); Optimization problem; Convergence (economics); Transport engineering; Engineering; Computer network; Economics; Artificial intelligence","score_opus":0.020695206598193495,"score_gpt":0.257597793447659,"score_spread":0.2369025868494655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093308000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036316976,0.00018601037,0.9623722,0.00016283733,0.0005092643,0.00025612098,0.000009291553,0.0001359926,0.000051339615],"genre_scores_gemma":[0.54680735,0.00008550613,0.45289135,0.000022271164,0.0001458721,0.0000023045773,0.000008297364,0.00003463963,0.0000024510603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834234,0.000080011865,0.00095344236,0.00012534834,0.00026939914,0.00022944686],"domain_scores_gemma":[0.9985701,0.00016158324,0.00059937907,0.00010098029,0.0004459376,0.00012202847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052363204,0.0001690742,0.0002741454,0.00005596183,0.00019684713,0.0000731175,0.000156055,0.000084586485,0.0000035474397],"category_scores_gemma":[0.00018288463,0.00014028532,0.00009605683,0.00037575446,0.000030280562,0.0004418448,0.0000028873499,0.00030379978,6.2185353e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076996526,0.000007273553,0.00024402923,0.00013001534,0.000044688135,0.000013131971,0.0010374283,0.98748887,0.008879206,0.00016388574,0.000008441086,0.0019060189],"study_design_scores_gemma":[0.0007675958,0.00009784713,0.00047340512,0.00014262149,0.00010450148,0.000017167333,0.00095112744,0.9955817,0.0015409301,0.000021050733,0.00015023946,0.00015180603],"about_ca_topic_score_codex":0.0000021055541,"about_ca_topic_score_gemma":0.000005187832,"teacher_disagreement_score":0.51049036,"about_ca_system_score_codex":0.00016416448,"about_ca_system_score_gemma":0.000065298016,"threshold_uncertainty_score":0.57206696},"labels":[],"label_agreement":null},{"id":"W3093338685","doi":"10.3390/math8101788","title":"A Method for Transportation Planning and Profit Sharing in Collaborative Multi-Carrier Vehicle Routing","year":2020,"lang":"en","type":"article","venue":"Mathematics","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":"Western University","funders":"","keywords":"Heuristics; Shapley value; Vehicle routing problem; Computer science; Mathematical optimization; Profit (economics); Routing (electronic design automation); Genetic algorithm; Route planning; Profit sharing; Operations research; Distributed computing; Game theory; Computer network; Engineering; Mathematics; Microeconomics; Economics; Mathematical economics","score_opus":0.04895802467706618,"score_gpt":0.3282797199960404,"score_spread":0.2793216953189742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093338685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12918599,0.00007364297,0.869932,0.00008624832,0.000020755106,0.00042322217,0.000026552472,0.00017481908,0.00007679964],"genre_scores_gemma":[0.23153606,0.0000020079847,0.76829296,0.00003931257,0.000020434982,0.00005166062,0.000008467769,0.000038836006,0.000010278612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992424,0.000022926086,0.00031878505,0.00016718777,0.00007846294,0.00017024174],"domain_scores_gemma":[0.99955773,0.00020600723,0.000057903853,0.00007175892,0.00004561307,0.000060972998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043347894,0.000121980396,0.0002175406,0.000045846868,0.000046876394,0.00004356878,0.00007057943,0.000067783396,0.000003885601],"category_scores_gemma":[0.00019918448,0.00013305999,0.000021555586,0.0003003306,0.000009019149,0.000111200185,0.000009554819,0.00011305453,7.557676e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014162286,0.000016244414,0.014143907,0.0011228869,0.00004327568,0.000004965215,0.09386946,0.8766371,0.0091516385,0.0021193107,0.0000266753,0.0028503481],"study_design_scores_gemma":[0.0006444436,0.000016155283,0.0010314854,0.000098509176,0.00001803736,4.2965397e-7,0.002383256,0.9904463,0.004938467,0.00024124564,0.000039652783,0.00014196562],"about_ca_topic_score_codex":0.000001399887,"about_ca_topic_score_gemma":0.000003561674,"teacher_disagreement_score":0.113809235,"about_ca_system_score_codex":0.000027467111,"about_ca_system_score_gemma":0.000010604082,"threshold_uncertainty_score":0.5426029},"labels":[],"label_agreement":null},{"id":"W3094207985","doi":"10.1155/2020/8843397","title":"Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science Foundation of Ministry of Education of China; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Shapley value; Computer science; Operations research; Mathematical optimization; Particle swarm optimization; Heuristic; Profit (economics); Transport engineering; Engineering; Game theory; Economics","score_opus":0.007228364623000414,"score_gpt":0.23794464172279306,"score_spread":0.23071627709979264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094207985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7014539,0.00011482161,0.29763272,0.00026130624,0.00005117278,0.0003565312,0.000025821573,0.00006107705,0.000042644155],"genre_scores_gemma":[0.6555183,0.000051149975,0.34432468,0.00003053926,0.000023970859,0.0000073148312,0.000021007696,0.000018802835,0.000004247556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9989737,0.00004572044,0.00046597118,0.00011659112,0.00028364724,0.00011435585],"domain_scores_gemma":[0.99927807,0.00005504709,0.00028125365,0.00004798293,0.00021460124,0.00012306691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014152877,0.00013123477,0.00022458188,0.00005568685,0.000039778308,0.000023557697,0.0000428192,0.000029633233,0.000012772337],"category_scores_gemma":[0.00001744511,0.000115252464,0.000024816729,0.00019438457,0.00001740961,0.00044324383,9.976387e-7,0.00013139658,0.0000014580695],"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.00022551249,0.000027061742,0.0028268052,0.000057489327,0.00007781772,0.000014613888,0.0043748408,0.9530971,0.035358973,0.000011428981,0.000020718244,0.003907655],"study_design_scores_gemma":[0.022794196,0.003902957,0.41845283,0.0006852088,0.0006234765,0.00003893117,0.0060507623,0.41365394,0.13031612,0.0001705492,0.002165917,0.0011451036],"about_ca_topic_score_codex":4.948348e-7,"about_ca_topic_score_gemma":0.000002139641,"teacher_disagreement_score":0.53944314,"about_ca_system_score_codex":0.00006911914,"about_ca_system_score_gemma":0.00003032758,"threshold_uncertainty_score":0.4699859},"labels":[],"label_agreement":null},{"id":"W3098142126","doi":"","title":"A Branch-and-Check Approach for a Tourist Trip Design Problem with Rich Constraints","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal","funders":"","keywords":"Computer science; Tourism; Geography","score_opus":0.02164509327999898,"score_gpt":0.2318065279226187,"score_spread":0.21016143464261972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098142126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003429382,0.00055150443,0.9609609,0.0005624664,0.00008605661,0.0018260346,0.0000646886,0.0005330917,0.031985838],"genre_scores_gemma":[0.26815674,0.00014398182,0.72921616,0.00002271344,0.00001672717,0.00028672436,0.00023176301,0.000095063406,0.0018301178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958192,0.0023181606,0.0004889973,0.00069646694,0.0002795895,0.00039759194],"domain_scores_gemma":[0.9954247,0.0017904252,0.00028151914,0.0012552859,0.001092876,0.00015520358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0057717026,0.00040619087,0.000510202,0.00017863928,0.00018081043,0.00036193343,0.0006418951,0.0003500811,0.000026574115],"category_scores_gemma":[0.0007436846,0.00041367777,0.000110070614,0.0003015134,0.00022260002,0.00010017102,0.0003262386,0.0005991684,0.0000056429612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010567706,0.0006267074,0.0022099675,0.0042237868,0.00071695336,0.000003293857,0.017918408,0.7945531,0.002545275,0.017714567,0.0025592267,0.15682307],"study_design_scores_gemma":[0.0013948192,0.0000011388523,0.00028520476,0.0011441861,0.00010681591,0.000022484941,0.00009458584,0.9819883,0.012051851,0.0009996337,0.0012399374,0.0006710062],"about_ca_topic_score_codex":0.000045936304,"about_ca_topic_score_gemma":0.000019231386,"teacher_disagreement_score":0.26472735,"about_ca_system_score_codex":0.00011826855,"about_ca_system_score_gemma":0.00022662885,"threshold_uncertainty_score":0.9998315},"labels":[],"label_agreement":null},{"id":"W3102154833","doi":"10.5267/j.ijiec.2020.10.003","title":"Time-dependent vehicle routing problem with backhaul with FIFO assumption: Variable neighborhood search and mat-heuristic variable neighborhood search algorithms","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Backhaul (telecommunications); Vehicle routing problem; FIFO (computing and electronics); Variable neighborhood search; Heuristic; FIFO and LIFO accounting; Mathematical optimization; Variable (mathematics); Computer science; Routing (electronic design automation); Reduction (mathematics); Algorithm; Null-move heuristic; Mathematics; Metaheuristic; Computer network","score_opus":0.0249850087606199,"score_gpt":0.25282262619365276,"score_spread":0.22783761743303285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102154833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02195103,0.00007497468,0.97553015,0.0010537854,0.00039672334,0.00028356112,0.000050731345,0.00023040688,0.00042862247],"genre_scores_gemma":[0.7301196,0.000017780936,0.26847705,0.00005927934,0.0011397733,0.000008314057,0.000033500684,0.00010579284,0.00003894303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976226,0.000110429595,0.00067302695,0.00027534727,0.00093828334,0.00038031227],"domain_scores_gemma":[0.99807495,0.00046451524,0.00016254275,0.00012685689,0.0008362119,0.00033493782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007345418,0.0003037851,0.0004010526,0.00031017858,0.000113159724,0.0003643786,0.0004250872,0.00016046781,0.00010227487],"category_scores_gemma":[0.00021111415,0.0002841827,0.000051446907,0.0006940467,0.000046243415,0.0005333889,0.000100092344,0.0010214436,0.0000144728365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089836176,0.000046529378,0.0007970918,0.00003710047,0.0004985695,0.00006449199,0.000416092,0.9931691,0.0009933778,0.00077574165,0.000114366434,0.0029976715],"study_design_scores_gemma":[0.0027714043,0.00032223362,0.00020654152,0.00038738188,0.000087387,0.00035462287,0.0001242762,0.9948034,0.00040745083,0.000036672034,0.00019127183,0.0003073444],"about_ca_topic_score_codex":0.000015697111,"about_ca_topic_score_gemma":3.7042042e-7,"teacher_disagreement_score":0.70816857,"about_ca_system_score_codex":0.00024447334,"about_ca_system_score_gemma":0.000311226,"threshold_uncertainty_score":0.999961},"labels":[],"label_agreement":null},{"id":"W3104464641","doi":"10.1016/j.cor.2023.106526","title":"Unified Branch-and-Benders-Cut for two-stage stochastic mixed-integer programs","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Canada Foundation for Innovation; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Mathematical optimization; Benders' decomposition; Integer (computer science); Decomposition; Generality; Heuristic; Branch and bound; Heuristics; Discretization; Stochastic programming; Mathematics; Branch and cut; Computer science; Integer programming","score_opus":0.09352603497581218,"score_gpt":0.3962700240992904,"score_spread":0.3027439891234782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104464641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012413161,0.00039523715,0.98396873,0.0005352479,0.0006565716,0.00094250037,0.000016630143,0.00065634615,0.00041559918],"genre_scores_gemma":[0.8848013,0.00001751088,0.11325092,0.000025264333,0.0002393804,0.0002796624,0.000077267905,0.00007839677,0.0012302593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984689,0.00017321498,0.00025166545,0.00035602695,0.00028886818,0.00046132682],"domain_scores_gemma":[0.9987758,0.00054324325,0.000004414164,0.00028512962,0.00025305335,0.00013840498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011850704,0.00015843518,0.00016507073,0.00039066238,0.00032761434,0.0008475084,0.00022795344,0.00007959051,0.000026110221],"category_scores_gemma":[0.0001260059,0.00015833075,0.000059015205,0.0007149648,0.00011854874,0.00024147515,0.00010085614,0.00043140585,0.000043068474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047549183,0.000017572367,0.000003390347,0.0001640833,0.000055669017,0.0000036031888,0.0007447816,0.936435,0.00096874556,0.017125264,0.0013566676,0.043120455],"study_design_scores_gemma":[0.0003055076,0.0000793842,0.000009787719,0.000107143635,0.000008749135,0.0000082801,0.0001571199,0.9960316,0.0005644241,0.00016384,0.002399005,0.00016519352],"about_ca_topic_score_codex":0.000028598764,"about_ca_topic_score_gemma":0.00006750174,"teacher_disagreement_score":0.8723882,"about_ca_system_score_codex":0.00012845037,"about_ca_system_score_gemma":0.000102625236,"threshold_uncertainty_score":0.8172543},"labels":[],"label_agreement":null},{"id":"W3107516874","doi":"10.1007/s11590-020-01675-z","title":"An efficient heuristic for a hub location routing problem","year":2020,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Heuristic; Variable neighborhood search; Computer science; Computational intelligence; Selection (genetic algorithm); Local search (optimization); Fraction (chemistry); Steiner tree problem; Mathematics; Metaheuristic; Artificial intelligence","score_opus":0.01530435585602781,"score_gpt":0.24606985011928661,"score_spread":0.23076549426325882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107516874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039486215,0.000017127497,0.99241775,0.0019201174,0.00014339572,0.0005250445,0.000008060215,0.00083597883,0.00018390949],"genre_scores_gemma":[0.3934738,0.000002419831,0.60488147,0.0012841397,0.00014606985,0.0000521448,0.00009328855,0.000062923915,0.0000037503944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894094,0.00006591852,0.00032295732,0.00027176074,0.00014794027,0.0002505041],"domain_scores_gemma":[0.999434,0.00007531116,0.000074327014,0.00017009405,0.00011527432,0.00013099768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024462646,0.00016390612,0.00015260959,0.000068931746,0.00012307311,0.00010392451,0.00015095498,0.000063132095,0.000031080544],"category_scores_gemma":[0.00016402149,0.00019273773,0.000039715396,0.00047111217,0.000020462046,0.00015703551,0.000012623028,0.0000956138,0.000010187797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008654978,0.000012286517,0.000062458115,0.00008638911,0.000012042476,4.7737774e-7,0.00081934046,0.9950904,0.0024069275,0.00015679773,0.0005070711,0.00083711924],"study_design_scores_gemma":[0.0004177975,0.000032059143,0.000030294279,0.000020410673,0.000022508522,0.0000012210651,0.000059393453,0.9982708,0.0007586983,0.0000026288542,0.00016870636,0.00021548341],"about_ca_topic_score_codex":0.0000014519578,"about_ca_topic_score_gemma":1.5274384e-7,"teacher_disagreement_score":0.38952518,"about_ca_system_score_codex":0.00007429956,"about_ca_system_score_gemma":0.00001660457,"threshold_uncertainty_score":0.7859616},"labels":[],"label_agreement":null},{"id":"W3108622340","doi":"10.1016/j.dib.2020.106568","title":"Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search","year":2020,"lang":"en","type":"article","venue":"Data in Brief","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":"McMaster University; Université Laval","funders":"Universiteit Antwerpen","keywords":"Computer science; Metaheuristic; Meta-analysis; Set (abstract data type); Replicate; Implementation; Domain (mathematical analysis); Variety (cybernetics); Range (aeronautics); Data mining; Machine learning; Artificial intelligence; Statistics; Mathematics; Software engineering","score_opus":0.30977380902254176,"score_gpt":0.3708319806133107,"score_spread":0.06105817159076893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108622340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001851702,0.0006155621,0.94476,0.0010160751,0.000051194005,0.00071083894,0.05048309,0.0000647057,0.00044681397],"genre_scores_gemma":[0.9066455,0.000018177789,0.09040289,0.00035961025,0.000034304132,0.000042742457,0.0024428875,0.00004068852,0.000013189132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984064,0.00025487613,0.0004034006,0.00044673882,0.00023831517,0.00025022935],"domain_scores_gemma":[0.9974917,0.00047570484,0.000060864735,0.00187126,0.00005210323,0.000048370497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015465316,0.00013515932,0.00059872924,0.00013869564,0.000024701896,0.0000214502,0.0017161687,0.00006733332,0.0001380164],"category_scores_gemma":[0.00073880906,0.00010955244,0.00012097407,0.0019436991,0.000027109278,0.00034004622,0.0011026212,0.0002422431,0.0000023945595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072149625,0.000092146176,0.0028443516,0.000059785452,0.020960886,0.000004328066,0.001784205,0.96682197,0.0001566227,0.0029578197,0.0035935363,0.00065221207],"study_design_scores_gemma":[0.00036529815,0.000013798589,0.0024564613,0.000003625888,0.0063753272,1.547113e-7,0.0002585127,0.98827374,0.0001313648,0.00002298028,0.0019889507,0.000109805056],"about_ca_topic_score_codex":0.0001212104,"about_ca_topic_score_gemma":0.0006189695,"teacher_disagreement_score":0.9047938,"about_ca_system_score_codex":0.000028622135,"about_ca_system_score_gemma":0.000043148473,"threshold_uncertainty_score":0.4467419},"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,"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":"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","score_opus":0.02748217703064264,"score_gpt":0.2509191413029552,"score_spread":0.22343696427231252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108778051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008918674,0.00009657975,0.98669606,0.003777806,0.00018003142,0.00019620688,0.0000018296698,0.00006242222,0.00007039889],"genre_scores_gemma":[0.8436503,0.00074666494,0.15142132,0.0007550906,0.0033422862,0.000004954793,0.00002546718,0.000040045237,0.0000138692585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990852,0.00016294801,0.0003069663,0.00017654999,0.00013094586,0.00013737392],"domain_scores_gemma":[0.9995444,0.00016162745,0.00008993905,0.000050698523,0.000042604664,0.00011075895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006413602,0.00012441044,0.0001384374,0.0000613124,0.00020255757,0.00009700129,0.000046857527,0.00005249753,0.000021056743],"category_scores_gemma":[0.00022498803,0.00011275974,0.000012109472,0.00025938018,0.00002399523,0.00007009848,0.0000026884002,0.00045037002,0.000002637724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076959484,0.000007803236,0.0014892262,0.000013636183,0.000006679246,0.000003489039,0.0011977729,0.9822689,0.00007875049,0.0006192403,0.00014944233,0.014088071],"study_design_scores_gemma":[0.00045869543,0.00020257045,0.0063654794,0.000023922183,0.000019741725,0.0000053544563,0.0001170784,0.9881327,0.000079682046,0.000040119965,0.004440232,0.00011443171],"about_ca_topic_score_codex":0.000001857617,"about_ca_topic_score_gemma":0.0000034402087,"teacher_disagreement_score":0.83527476,"about_ca_system_score_codex":0.000020397287,"about_ca_system_score_gemma":0.000007308714,"threshold_uncertainty_score":0.45982087},"labels":[],"label_agreement":null},{"id":"W3110999205","doi":"10.1287/ijoc.2020.1003","title":"The Rank-One Quadratic Assignment Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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; Simon Fraser University","funders":"","keywords":"Quadratic assignment problem; Heuristics; Mathematical optimization; Metaheuristic; Integer programming; Quadratic equation; Pairwise comparison; Computer science; Quadratic programming; Rank (graph theory); Generalized assignment problem; Benchmark (surveying); Mathematics; Combinatorial optimization; Optimization problem; Artificial intelligence; Combinatorics","score_opus":0.026991940439963214,"score_gpt":0.2570781168276537,"score_spread":0.23008617638769047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110999205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022829356,0.00013532017,0.9650093,0.0021882032,0.00049279083,0.00018465467,4.998079e-7,0.00033205276,0.008827828],"genre_scores_gemma":[0.89709896,0.000055065488,0.10124072,0.00093906064,0.0005960298,0.0000016829981,7.8654625e-7,0.00003927538,0.00002841121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986035,0.000054660242,0.00057333044,0.00008111856,0.00036387698,0.00032348555],"domain_scores_gemma":[0.99916375,0.00031827576,0.00015640522,0.0001138225,0.000066061395,0.00018169955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009870635,0.00014604091,0.00016940263,0.000041852916,0.00045094304,0.00036102315,0.00027883254,0.000048202815,0.000020693144],"category_scores_gemma":[0.00019716924,0.00009943757,0.00007592883,0.0002410902,0.000020963476,0.00016342262,0.000047819234,0.0006276103,0.00006828595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008653327,0.0000047003377,0.0001142381,0.000020135347,0.000043824133,0.000004447133,0.00080714916,0.8912302,0.00018716986,0.00043615012,0.00058935373,0.10655394],"study_design_scores_gemma":[0.00046461393,0.000103343395,0.00021389611,0.00009791209,0.0000094961515,0.00004066889,0.00015487541,0.9897017,0.00071740884,0.00020575005,0.008129757,0.00016060383],"about_ca_topic_score_codex":3.2825298e-7,"about_ca_topic_score_gemma":1.2982953e-7,"teacher_disagreement_score":0.8742696,"about_ca_system_score_codex":0.00010329466,"about_ca_system_score_gemma":0.000032595977,"threshold_uncertainty_score":0.40549466},"labels":[],"label_agreement":null},{"id":"W311217234","doi":"10.1007/0-387-25486-2_2","title":"Shortest Path Problems with Resource Constraints","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":573,"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; Group for Research in Decision Analysis","funders":"","keywords":"Shortest path problem; Computer science; Column generation; Resource (disambiguation); Mathematical optimization; Scheduling (production processes); Path (computing); Vehicle routing problem; Operations research; Resource constraints; Routing (electronic design automation); Distributed computing; Engineering; Mathematics; Theoretical computer science; Graph; Computer network","score_opus":0.013839727611325623,"score_gpt":0.2045635052047349,"score_spread":0.19072377759340928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W311217234","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000046513223,0.000096809505,0.21799898,0.000014019306,0.000043256452,0.00023976488,0.00002346126,0.00085813494,0.7807209],"genre_scores_gemma":[0.003573169,0.000030321318,0.1554652,0.000075011776,0.00020704331,0.000015205844,0.00019263678,0.00036690055,0.8400745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988833,0.0000107799015,0.0003234743,0.00028609688,0.0002461081,0.00025025426],"domain_scores_gemma":[0.999368,0.0000689847,0.00006545691,0.00035374812,0.000060028786,0.00008377055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017662854,0.00037311393,0.00033368057,0.00011264923,0.000040326362,0.000049561277,0.00014529715,0.0003154097,0.0008900351],"category_scores_gemma":[0.000006593001,0.0003310273,0.000058977377,0.000037364494,0.00012856883,0.00003933614,0.000024565523,0.00040201712,0.00007492803],"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.0000025060153,0.00000677991,0.00006960961,0.000098087745,0.00010676136,0.000038926966,0.000042156986,0.94960666,0.000025058704,0.018296275,0.020378646,0.011328537],"study_design_scores_gemma":[0.00073987135,0.000118558724,0.00006494656,0.001049251,0.00017644995,0.00017058162,0.00001666849,0.16802168,0.000118438285,0.0011004262,0.8264869,0.0019362398],"about_ca_topic_score_codex":0.000004288561,"about_ca_topic_score_gemma":0.000009293411,"teacher_disagreement_score":0.80610824,"about_ca_system_score_codex":0.000074025964,"about_ca_system_score_gemma":0.000030659998,"threshold_uncertainty_score":0.99991417},"labels":[],"label_agreement":null},{"id":"W3112475217","doi":"10.1139/cjce-2020-0262","title":"Optimized route to clear diverging diamond interchange using discrete optimization method","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematical optimization; Clearing; Graph; Algorithm; Mathematics; Theoretical computer science","score_opus":0.02619415702868113,"score_gpt":0.2522113426855539,"score_spread":0.22601718565687276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112475217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003221057,0.00035450683,0.99467206,0.00035792365,0.0006943231,0.00014318217,0.000019854675,0.000115250245,0.00042181718],"genre_scores_gemma":[0.37212634,0.000016742297,0.6272606,0.0001623012,0.00032047485,0.000001929393,0.000003013744,0.00010258892,0.000005996661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851966,0.000071881055,0.00055404485,0.00017159194,0.00019957418,0.00048324693],"domain_scores_gemma":[0.9982068,0.000093795665,0.0001042552,0.00015190874,0.00015339204,0.0012898688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005306552,0.00025787068,0.00042668678,0.000532362,0.000083139166,0.00014531486,0.00034391775,0.00010508895,0.00019784276],"category_scores_gemma":[0.0005653087,0.0002969095,0.00013713406,0.0007330631,0.000012688548,0.0004131104,0.000036786296,0.00041324177,0.0000046388527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010918193,9.340625e-7,0.000089494504,0.00005256575,0.00006871311,0.00005479171,0.0017838441,0.99618334,0.0009896979,0.000037829974,0.00017181414,0.00055603404],"study_design_scores_gemma":[0.00040728104,0.00004973461,0.000053492295,0.00018114067,0.000054053347,0.000054035434,0.000117343334,0.9964786,0.0006428771,0.0000034864909,0.0016541643,0.0003037523],"about_ca_topic_score_codex":0.00016470136,"about_ca_topic_score_gemma":0.0005199631,"teacher_disagreement_score":0.36890528,"about_ca_system_score_codex":0.0003848788,"about_ca_system_score_gemma":0.00015365,"threshold_uncertainty_score":0.9999483},"labels":[],"label_agreement":null},{"id":"W3112745349","doi":"10.1111/itor.12911","title":"Selective arc-ng pricing for vehicle routing","year":2021,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"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; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Solver; Mathematical optimization; Vehicle routing problem; Path (computing); Computer science; Set (abstract data type); Relaxation (psychology); Routing (electronic design automation); Mathematics","score_opus":0.012099992376166312,"score_gpt":0.24637388085833553,"score_spread":0.2342738884821692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112745349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0724816,0.0006951674,0.9220448,0.0005818263,0.00019980899,0.0005683583,0.000025129577,0.0020138258,0.0013894775],"genre_scores_gemma":[0.559282,0.000050375103,0.43936157,0.00041918908,0.00015740062,0.00025824926,0.000022786966,0.00012058999,0.00032781225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977778,0.00015015439,0.00052206736,0.00044424934,0.00024340599,0.00086229044],"domain_scores_gemma":[0.998417,0.00040707862,0.00011321596,0.00056129484,0.00028241152,0.00021898335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008980828,0.00033072502,0.0003971695,0.00023450846,0.00030376046,0.00018757224,0.00027250012,0.0002728689,0.000021920558],"category_scores_gemma":[0.0008411235,0.00040028407,0.00018804273,0.00092959934,0.0000321619,0.0002894162,0.000113560316,0.00045516485,0.000007835411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030761566,0.000085079555,0.01608099,0.00016162572,0.00013900238,0.000031594103,0.0007629307,0.7966315,0.14177726,0.008002102,0.0013573768,0.034939747],"study_design_scores_gemma":[0.00045338064,0.000031989606,0.006372206,0.000066043314,0.000031596504,0.0000448908,0.00014106983,0.80980587,0.18120353,0.00076411996,0.0007087875,0.000376524],"about_ca_topic_score_codex":0.00027912867,"about_ca_topic_score_gemma":0.0002758399,"teacher_disagreement_score":0.48680043,"about_ca_system_score_codex":0.00065078837,"about_ca_system_score_gemma":0.00017781946,"threshold_uncertainty_score":0.9998449},"labels":[],"label_agreement":null},{"id":"W3114589794","doi":"10.1155/2020/8834502","title":"A New Hybrid Butterfly Optimization Algorithm for Green Vehicle Routing Problem","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Vehicle routing problem; Algorithm; Metaheuristic; Mathematical optimization; Computer science; Routing (electronic design automation); Mathematics","score_opus":0.012817209095655266,"score_gpt":0.24777536887085788,"score_spread":0.23495815977520262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114589794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009841117,0.00010984289,0.9888927,0.00052472245,0.0002072456,0.0002520402,0.000020012694,0.00012607903,0.000026278298],"genre_scores_gemma":[0.09018476,0.000043062,0.90921587,0.00009967908,0.00034624388,0.0000047444837,0.00003618684,0.000053322914,0.00001613965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987986,0.000022403836,0.00066609634,0.0001245345,0.00020990534,0.00017844206],"domain_scores_gemma":[0.99918616,0.00006324598,0.0002882709,0.000060928607,0.0002379452,0.00016343604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002009333,0.00014313134,0.00024593476,0.00007664784,0.00005039844,0.00002534821,0.00011868419,0.000047945177,0.000017605234],"category_scores_gemma":[0.00003306007,0.00015395926,0.00011488729,0.00024941866,0.0000070784863,0.000608351,0.000001451441,0.00017067476,0.0000010362598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034823723,0.0000061625137,0.00007555768,0.000050459665,0.00003149522,0.0000049654914,0.0009544076,0.8307922,0.003519968,0.000016820482,0.00007085853,0.16444232],"study_design_scores_gemma":[0.0019544377,0.00020386511,0.0006753435,0.00007515961,0.00007956003,0.000007991437,0.00014814043,0.98478746,0.011011857,0.00019167666,0.000678556,0.00018594562],"about_ca_topic_score_codex":0.0000027244942,"about_ca_topic_score_gemma":0.0000012660317,"teacher_disagreement_score":0.16425638,"about_ca_system_score_codex":0.00005061641,"about_ca_system_score_gemma":0.000049834933,"threshold_uncertainty_score":0.62782764},"labels":[],"label_agreement":null},{"id":"W3116025892","doi":"10.18280/jesa.530604","title":"Modelling of Agent-Based Vehicle Routing Problem Using Unified Modelling Language","year":2020,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Computer science; Exploit; Unified Modeling Language; Visualization; Routing (electronic design automation); Constraint (computer-aided design); Modeling language; Process (computing); Operations research; Distributed computing; Engineering; Data mining; Computer network; Software","score_opus":0.05934378831447326,"score_gpt":0.26962164200769784,"score_spread":0.21027785369322458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116025892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3626404,0.00042835937,0.6357736,0.0000269216,0.00009358775,0.00012923458,0.0000063882126,0.00041914813,0.00048238365],"genre_scores_gemma":[0.5794747,0.00002227061,0.42024967,0.000032670076,0.00011318063,0.0000012595916,0.000002237928,0.00009165365,0.000012392663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974328,0.00033229782,0.0010479917,0.00023823247,0.00046645,0.00048220804],"domain_scores_gemma":[0.9987645,0.0001449487,0.00039962845,0.00021993689,0.0001991764,0.0002718197],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008251119,0.00030430095,0.0005029009,0.00019213889,0.00023780025,0.00017717805,0.00033988035,0.00011544817,0.00005557978],"category_scores_gemma":[0.00009274028,0.00031407364,0.00018236379,0.00067666365,0.00005273122,0.0003570648,0.000055494485,0.00049759366,0.000014363966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011991582,0.000016190119,0.00023893158,0.00045618165,0.00007138974,0.00004535908,0.002710342,0.97275656,0.015067993,0.000084311454,0.000017822284,0.008522927],"study_design_scores_gemma":[0.00055863016,0.00004633076,0.00008909085,0.00050919503,0.000072172435,0.000055617824,0.00026001662,0.9930222,0.00498326,0.00008943547,0.000015349577,0.00029870248],"about_ca_topic_score_codex":0.00003337584,"about_ca_topic_score_gemma":3.920195e-7,"teacher_disagreement_score":0.21683426,"about_ca_system_score_codex":0.00019614238,"about_ca_system_score_gemma":0.00009742358,"threshold_uncertainty_score":0.99993116},"labels":[],"label_agreement":null},{"id":"W3117154257","doi":"10.1093/jcde/qwaa089","title":"A biobjective home health care logistics considering the working time and route balancing: a self-adaptive social engineering optimizer","year":2020,"lang":"en","type":"article","venue":"Journal of Computational Design and Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Metaheuristic; Vehicle routing problem; Scheduling (production processes); Computer science; Population; Operations research; Operations management; Routing (electronic design automation); Engineering; Artificial intelligence; Medicine; Computer network","score_opus":0.02356356349678254,"score_gpt":0.23335147664918524,"score_spread":0.2097879131524027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117154257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009274523,0.0017880033,0.98802376,0.00042637903,0.00014721179,0.00014890655,0.0000045479114,0.00017132156,0.00001534322],"genre_scores_gemma":[0.53946435,0.00004460778,0.4601746,0.000090898575,0.00018884681,0.0000017697216,0.0000013575652,0.000033164684,4.4112937e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891037,0.00006856143,0.00043044446,0.00012943403,0.00022555163,0.00023562863],"domain_scores_gemma":[0.9989395,0.00059475575,0.00013598385,0.000038874645,0.00012990583,0.00016094245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004292831,0.00021123394,0.00036265433,0.00010306331,0.00012783424,0.000110434776,0.00009482457,0.00006607481,0.0000020734624],"category_scores_gemma":[0.000104753184,0.00019291948,0.000059136408,0.00024758864,0.00002298777,0.00013812598,0.000040501724,0.00038516053,7.620477e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001918135,0.0000031002696,0.000022996479,0.0000757545,0.00013516021,0.0000123896525,0.0054709967,0.9924318,0.00023214247,0.00019963561,0.00006870008,0.0013281065],"study_design_scores_gemma":[0.00053432625,0.00008705189,0.0009595507,0.00009239052,0.00003692034,0.00012255237,0.0002296523,0.9975232,0.00005096539,0.000043223106,0.00012917416,0.00019099732],"about_ca_topic_score_codex":8.3305514e-7,"about_ca_topic_score_gemma":4.6981576e-8,"teacher_disagreement_score":0.5301898,"about_ca_system_score_codex":0.00014992875,"about_ca_system_score_gemma":0.00008363644,"threshold_uncertainty_score":0.7867028},"labels":[],"label_agreement":null},{"id":"W3118945546","doi":"10.1007/s43069-020-00044-x","title":"Branch-and-Price for a Multi-attribute Technician Routing and Scheduling Problem","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Branch and price; Arc routing; Technician; Column generation; Solver; Mathematical optimization; Integer programming; Scheduling (production processes); Algorithm; Routing (electronic design automation); Mathematics; Engineering; Computer network","score_opus":0.08663084792724975,"score_gpt":0.3906069132587584,"score_spread":0.30397606533150867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118945546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040910564,0.0007605418,0.9553169,0.0017959308,0.00004643449,0.00060866703,0.00002793747,0.00020038374,0.0003326282],"genre_scores_gemma":[0.3859794,0.00015698968,0.6130509,0.000033541754,0.00003665817,0.0001619332,0.000026254096,0.00003544291,0.0005189059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987275,0.00010441363,0.0002262526,0.00026317514,0.00017988746,0.00049880036],"domain_scores_gemma":[0.99905604,0.00018670206,0.000008101204,0.00019928008,0.0004353691,0.00011450832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014055157,0.00010522742,0.00014124258,0.00014866605,0.00070938974,0.00031944044,0.00009159516,0.00009422775,0.000013892572],"category_scores_gemma":[0.00097148796,0.00011392566,0.000026468075,0.00055587926,0.00005716102,0.00023945057,0.00014458677,0.00032150152,0.000004605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005870209,0.00006396801,0.004415133,0.0002791048,0.00007911006,0.0000063240445,0.0009732173,0.8501771,0.10053221,0.017157795,0.00033683548,0.025973339],"study_design_scores_gemma":[0.00046526553,0.000023423805,0.00036545773,0.000068962116,0.000005295811,0.000015955686,0.00053474423,0.9819887,0.01478677,0.00007613596,0.0015323652,0.00013691251],"about_ca_topic_score_codex":0.000017567625,"about_ca_topic_score_gemma":0.00014499908,"teacher_disagreement_score":0.34506884,"about_ca_system_score_codex":0.00007360305,"about_ca_system_score_gemma":0.000094151896,"threshold_uncertainty_score":0.5456124},"labels":[],"label_agreement":null},{"id":"W3119461075","doi":"10.1109/access.2021.3051741","title":"A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Computer science; Algorithm; Guided Local Search; Evolutionary algorithm; Benchmark (surveying); Vertex cover; Robustness (evolution); Local search (optimization); Memetic algorithm; Mathematical optimization; Combinatorial optimization; Best-first search; Search algorithm; Mathematics; Approximation algorithm; Beam search; Artificial intelligence","score_opus":0.025941904011549687,"score_gpt":0.27988977420800404,"score_spread":0.2539478701964544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119461075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027726889,0.0005978152,0.9945258,0.00016252327,0.00072329625,0.0002462579,0.000030478976,0.00013812205,0.00080304604],"genre_scores_gemma":[0.13561769,0.00051620504,0.8593708,0.0006002384,0.000755531,0.00030542183,0.00003786044,0.00019940127,0.0025968081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992904,0.000037136506,0.00017178188,0.00018575418,0.00010644072,0.0002084952],"domain_scores_gemma":[0.9991807,0.00043036323,0.000028618771,0.00021365138,0.00009552365,0.0000511651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018338629,0.00012331648,0.00014312897,0.000029562683,0.00010921354,0.00020310507,0.00019858168,0.00006336331,0.000054809003],"category_scores_gemma":[0.000059068225,0.000101455014,0.000037612244,0.0002155385,0.000028752154,0.00017760393,0.000049160237,0.00010902389,0.0000068407403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043612563,0.000021190477,0.0003068988,0.00014842264,0.000097511,0.000011493126,0.00022811939,0.852534,0.00047637793,0.000060641887,0.010825614,0.13528536],"study_design_scores_gemma":[0.00041511786,0.0000075438106,0.00037509395,0.000028099605,0.00004461468,0.000016798373,0.000019173405,0.9916972,0.0036696238,0.0002024862,0.0033799678,0.00014429446],"about_ca_topic_score_codex":0.000005800126,"about_ca_topic_score_gemma":0.00000388242,"teacher_disagreement_score":0.13916318,"about_ca_system_score_codex":0.000025273626,"about_ca_system_score_gemma":0.0000264918,"threshold_uncertainty_score":0.41372156},"labels":[],"label_agreement":null},{"id":"W3121559560","doi":"","title":"The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan","year":2007,"lang":"en","type":"article","venue":"SSRN Electronic Journal","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":"Mathematical optimization; Job shop scheduling; Production schedule; Scheduling (production processes); Computer science; Heuristic; Operations research; Schedule; Production (economics); Memetic algorithm; Genetic algorithm; Engineering; Mathematics; Economics","score_opus":0.008334488040680722,"score_gpt":0.2456455639661238,"score_spread":0.2373110759254431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121559560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33032295,0.001030469,0.66775787,0.0002992539,0.0000984882,0.00036380204,5.62886e-7,0.00010317362,0.000023419125],"genre_scores_gemma":[0.91234684,0.00078693574,0.08642227,0.0000052754976,0.0002427239,0.000020158875,0.000005163936,0.000043126598,0.00012752929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984665,0.000030082423,0.000257816,0.0001490675,0.00013315499,0.00096339616],"domain_scores_gemma":[0.99958915,0.00005447771,0.00005219296,0.000088729634,0.00016863066,0.00004684898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003844356,0.00012315024,0.0001013076,0.0000754669,0.00029921968,0.00006327047,0.00007557809,0.000038772974,3.9481287e-7],"category_scores_gemma":[0.000109250504,0.00008356141,0.000026573067,0.00026658643,0.00003290597,0.00016785048,0.0000014861496,0.0007800794,2.0666273e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006635731,0.000051565185,0.010444895,0.00012166758,0.00058388856,0.0000021450005,0.0018606471,0.52708405,0.023216901,0.014918392,0.00003808103,0.4210142],"study_design_scores_gemma":[0.008550194,0.005780462,0.035214696,0.0017344044,0.0017600948,0.0068268906,0.04347436,0.6182397,0.16556287,0.089823365,0.01807059,0.0049623703],"about_ca_topic_score_codex":0.0000040757864,"about_ca_topic_score_gemma":0.0011233005,"teacher_disagreement_score":0.58202386,"about_ca_system_score_codex":0.00027534526,"about_ca_system_score_gemma":0.0003009295,"threshold_uncertainty_score":0.34075356},"labels":[],"label_agreement":null},{"id":"W3121630490","doi":"10.2139/ssrn.2460366","title":"A Bi-Objective Model for the Used Oil Location-Routing Problem","year":2014,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"Queen's University","funders":"","keywords":"Download; Computer science; Routing (electronic design automation); Computer network; World Wide Web","score_opus":0.01347704958455576,"score_gpt":0.25484008521588164,"score_spread":0.24136303563132588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121630490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004387266,0.00051260303,0.99357104,0.00039481785,0.0001361678,0.00013166283,0.000001055514,0.00016783607,0.0006975745],"genre_scores_gemma":[0.9556744,0.00034154527,0.04258954,0.0000559029,0.00032408445,0.00004472474,0.000001944983,0.00007239851,0.0008954742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979266,0.00009121095,0.0002981767,0.00014414526,0.00017817525,0.0013617149],"domain_scores_gemma":[0.9991024,0.00037366306,0.00010499401,0.00018474387,0.00018329149,0.000050892675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035906264,0.00015780963,0.00015478268,0.00007775409,0.0003686753,0.00008649671,0.00027376792,0.0000756591,0.0000028701813],"category_scores_gemma":[0.0002933397,0.0001234369,0.00008937343,0.00026631137,0.00002450661,0.00015052354,0.000017628105,0.0010194869,0.000006014169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007206242,0.0000070184387,0.00006448486,0.000013276989,0.0000909512,2.7311387e-8,0.00058633153,0.91577744,0.00026304444,0.038066953,0.000027952115,0.0450953],"study_design_scores_gemma":[0.0005196156,0.000042034575,0.000019754028,0.000022930979,0.00004327076,0.000038761165,0.00037280872,0.96110666,0.00015702167,0.03735138,0.00017746144,0.00014831168],"about_ca_topic_score_codex":0.000008203648,"about_ca_topic_score_gemma":0.00011766907,"teacher_disagreement_score":0.9512871,"about_ca_system_score_codex":0.0006294015,"about_ca_system_score_gemma":0.000570498,"threshold_uncertainty_score":0.50336105},"labels":[],"label_agreement":null},{"id":"W3122240186","doi":"","title":"Optimum Turn-Restricted Paths, Nested Compatibility, and Optimum Convex Polygons","year":2016,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","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":"University of British Columbia","funders":"","keywords":"Compatibility (geochemistry); Mathematics; Mathematical optimization; Regular polygon; Cutting-plane method; Integer programming; Combinatorics; Convex polygon; Path (computing); Computer science; Geometry; Engineering","score_opus":0.03557851359454558,"score_gpt":0.3186559526578178,"score_spread":0.28307743906327226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122240186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93690753,0.00071350846,0.003651123,0.0006114619,0.0015293534,0.0023720304,0.00045004694,0.00093533145,0.052829593],"genre_scores_gemma":[0.963314,0.00761224,0.02751292,0.0000406798,0.0002991265,0.00021549099,0.00012653571,0.00025909333,0.00061993225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957795,0.00068623736,0.0010372438,0.0010892882,0.0003119471,0.0010957925],"domain_scores_gemma":[0.9962741,0.0014701693,0.0001699142,0.001460646,0.0002019846,0.00042315084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001963813,0.00055579207,0.0009195028,0.00077133207,0.0001589087,0.0002667391,0.00077702553,0.0008422869,0.00010617325],"category_scores_gemma":[0.0009181888,0.0005809559,0.00014388429,0.00027313828,0.00043200835,0.00016271205,0.0013507553,0.002155645,0.000013703909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008412949,0.00013310426,0.0249474,0.0006508268,0.00025444652,0.000053942706,0.0006302535,0.8197343,0.0012396752,0.0002733649,0.00020552863,0.15179303],"study_design_scores_gemma":[0.0012801945,0.00006916284,0.025564395,0.00045240388,0.000020087642,0.000022382335,0.00019930351,0.9681148,0.00037728608,0.0010706614,0.0019168537,0.0009125036],"about_ca_topic_score_codex":0.000044656674,"about_ca_topic_score_gemma":0.000037022706,"teacher_disagreement_score":0.15088052,"about_ca_system_score_codex":0.0010085247,"about_ca_system_score_gemma":0.00036281254,"threshold_uncertainty_score":0.9996642},"labels":[],"label_agreement":null},{"id":"W3122956505","doi":"10.1002/net.20177","title":"Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":310,"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":"Pickup; Computer science; Branch and cut; Vehicle routing problem; Set (abstract data type); Mathematical optimization; Limit (mathematics); Algorithm; Time limit; Running time; Integer programming; Mathematics; Routing (electronic design automation); Computer network; Engineering; Artificial intelligence","score_opus":0.01662834278793372,"score_gpt":0.23147513826401478,"score_spread":0.21484679547608107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122956505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05054317,0.0015672012,0.9468042,0.000018826291,0.000052704036,0.00033473354,0.0000025615243,0.0001634142,0.00051316636],"genre_scores_gemma":[0.65920776,0.00039486698,0.33976024,0.00009284737,0.0002406924,0.000025134626,0.0000111829595,0.00007446707,0.00019281101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993294,0.0000143115285,0.00014888382,0.00017974486,0.00006632401,0.0002613632],"domain_scores_gemma":[0.9995797,0.00016789921,0.000025732274,0.00009508422,0.000037339443,0.00009423259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042005494,0.00013390945,0.00016214084,0.00004323646,0.00007361988,0.000045947472,0.00003721015,0.00011579757,0.0000030182155],"category_scores_gemma":[0.0000059070912,0.00012438305,0.000012307964,0.00009506296,0.0000418133,0.0001413663,0.000022964741,0.000125194,3.6611854e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017719152,0.0000034418024,0.0004586689,0.000036961348,0.000025718959,9.607946e-7,0.00017874442,0.9220534,0.000051228308,0.00004854455,0.00009655994,0.07702807],"study_design_scores_gemma":[0.00067929743,0.000052637533,0.0005760846,0.000050766677,0.000023842023,0.000021963835,0.00000919026,0.997842,0.000047860645,0.00022559018,0.00030796824,0.00016277675],"about_ca_topic_score_codex":0.0000056891413,"about_ca_topic_score_gemma":0.000011269618,"teacher_disagreement_score":0.6086646,"about_ca_system_score_codex":0.000014493816,"about_ca_system_score_gemma":0.00000501518,"threshold_uncertainty_score":0.5072193},"labels":[],"label_agreement":null},{"id":"W3123584973","doi":"","title":"Less-than-Truckload Carrier Collaboration Problem: Modeling Framework and Solution Approach","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"University of Waterloo","funders":"","keywords":"Motor carrier; Business; Computer science; Engineering; Automotive engineering","score_opus":0.02214227710273034,"score_gpt":0.2627927840904783,"score_spread":0.24065050698774795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123584973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13734503,0.0030262803,0.85831547,0.0001266948,0.00018318887,0.00013190729,0.0000016518588,0.0001515188,0.00071827567],"genre_scores_gemma":[0.85409844,0.00095592695,0.14449492,0.000013736891,0.00026857798,0.000009715267,0.0000061242035,0.000047935828,0.00010463998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801755,0.00013045175,0.00029948752,0.00017233979,0.0002643247,0.0011158565],"domain_scores_gemma":[0.999418,0.0000229481,0.00007078252,0.00013181129,0.00020829248,0.0001481623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021817212,0.00016708563,0.00017762248,0.00012441176,0.00016672569,0.00014213448,0.000119754586,0.00018063175,0.0000013320949],"category_scores_gemma":[0.000133641,0.00017150627,0.00003275535,0.00036995663,0.000022545355,0.00038082644,0.000023421182,0.0013774309,0.0000020702525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015385016,0.000010186116,0.00044698027,0.000014997634,0.0000571834,3.961741e-7,0.00090353325,0.96794844,0.00019640943,0.021369098,0.000028861556,0.009008545],"study_design_scores_gemma":[0.00039777253,0.000054770022,0.0000085678375,0.00002450973,0.000029517678,0.00016158544,0.0033966734,0.9149399,0.00005258879,0.08068762,0.000058118967,0.00018838083],"about_ca_topic_score_codex":0.000019633942,"about_ca_topic_score_gemma":0.000051000694,"teacher_disagreement_score":0.7167534,"about_ca_system_score_codex":0.00090037996,"about_ca_system_score_gemma":0.00076372945,"threshold_uncertainty_score":0.6993823},"labels":[],"label_agreement":null},{"id":"W3125310543","doi":"10.1002/net.10067","title":"The single‐vehicle routing problem with unrestricted backhauls","year":2003,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"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":"Solver; Computer science; Backhaul (telecommunications); Vehicle routing problem; Mathematical optimization; Set (abstract data type); Revenue; Routing (electronic design automation); Mathematics; Computer network; Economics","score_opus":0.010873064014029878,"score_gpt":0.21076196657672738,"score_spread":0.1998889025626975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125310543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02237178,0.00090080785,0.9314812,0.000088904104,0.00037306634,0.00035221063,7.218104e-7,0.0009610309,0.043470304],"genre_scores_gemma":[0.92209524,0.00005873578,0.07723858,0.0000511171,0.00012206166,0.00002057929,0.000003223624,0.00007451958,0.00033593937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988095,0.00016226569,0.00024125974,0.00016673472,0.00016148775,0.00045875114],"domain_scores_gemma":[0.9991625,0.00034916308,0.000054719105,0.00028802035,0.00006596966,0.000079627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052236824,0.00016428175,0.00013011204,0.000026420546,0.0002579918,0.00013842183,0.00015591837,0.00010523622,0.000019331881],"category_scores_gemma":[0.000080983526,0.00011853875,0.000030706047,0.0006099806,0.00004317854,0.000088613604,0.000016560027,0.00031332643,0.000009336502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004468487,0.000008515449,0.0018923221,0.0000044623575,0.000024491434,0.0000026751352,0.00005078105,0.97968286,0.00013173067,0.0010789637,0.00065184763,0.016466876],"study_design_scores_gemma":[0.00038712597,0.000041310945,0.0009812639,0.00004582665,0.000018319864,0.000014785498,0.000050738985,0.984314,0.0006045274,0.000104043975,0.013201814,0.0002361893],"about_ca_topic_score_codex":0.0000027864216,"about_ca_topic_score_gemma":0.00001422007,"teacher_disagreement_score":0.8997235,"about_ca_system_score_codex":0.00007427236,"about_ca_system_score_gemma":0.000017700537,"threshold_uncertainty_score":0.48338702},"labels":[],"label_agreement":null},{"id":"W3125430804","doi":"10.5267/j.ijiec.2020.11.001","title":"Designing optimal route for the distribution chain of a rural LPG delivery system","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Vehicle routing problem; Benchmark (surveying); Computer science; Constraint (computer-aided design); Mathematical optimization; Pickup; Homogeneous; Integer programming; Liquefied petroleum gas; Linear programming; Routing (electronic design automation); Simulation; Algorithm; Mathematics; Engineering; Artificial intelligence; Embedded system; Mechanical engineering","score_opus":0.02889744660939638,"score_gpt":0.26814512367465065,"score_spread":0.23924767706525427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125430804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063586235,0.00022307938,0.9328544,0.00026468784,0.0027877255,0.00011149703,0.00010080864,0.00006237537,0.000009151794],"genre_scores_gemma":[0.9167734,0.000019605044,0.08230586,0.0000057997045,0.000800012,0.000007561174,0.000056379275,0.000024099394,0.0000073238507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988484,0.000047490867,0.0005913028,0.000058315658,0.00031802958,0.00013646981],"domain_scores_gemma":[0.9977174,0.0009232401,0.00021905775,0.00008298992,0.0010041095,0.00005319261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056470936,0.00011815447,0.0002079054,0.00013074775,0.000054694938,0.00007548852,0.00027414397,0.000087536275,0.0000045058678],"category_scores_gemma":[0.0005938287,0.00010948903,0.0001706809,0.0002543601,0.000017484792,0.00016454486,0.00003226558,0.00025701636,5.59144e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021838223,0.000012506569,0.00007962471,0.000016062711,0.00033374352,0.000008368191,0.00013632397,0.98941,0.003218984,0.0011483995,0.00023234359,0.0053817946],"study_design_scores_gemma":[0.0009831185,0.000029849145,0.00015483802,0.00031146785,0.000072532464,0.00016899055,0.00050628185,0.9889794,0.008027498,0.000007631222,0.00066049246,0.000097903154],"about_ca_topic_score_codex":0.000004108491,"about_ca_topic_score_gemma":2.78892e-7,"teacher_disagreement_score":0.85318714,"about_ca_system_score_codex":0.0002708161,"about_ca_system_score_gemma":0.00014498034,"threshold_uncertainty_score":0.4464833},"labels":[],"label_agreement":null},{"id":"W3125828786","doi":"10.5267/j.ijiec.2020.11.003","title":"A specialized genetic algorithm for the fuel consumption heterogeneous fleet vehicle routing problem with bidimensional packing constraints","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Tecnológica de Pereira","keywords":"Vehicle routing problem; Benchmark (surveying); Fuel efficiency; GRASP; Genetic algorithm; Routing (electronic design automation); Computer science; Set (abstract data type); Mathematical optimization; Reduction (mathematics); Consumption (sociology); Engineering; Automotive engineering; Mathematics; Embedded system","score_opus":0.03647383700614815,"score_gpt":0.28103662421572534,"score_spread":0.2445627872095772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125828786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02702936,0.00028879932,0.9694237,0.0003918974,0.002489129,0.00021933243,0.000048901973,0.000089293564,0.000019569829],"genre_scores_gemma":[0.47020507,0.000055226046,0.52824706,0.00004819057,0.001337263,0.0000148087665,0.000026721771,0.00005409217,0.000011587748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998558,0.000058613943,0.00058408413,0.00013955227,0.0004478824,0.00021185877],"domain_scores_gemma":[0.99783057,0.0008727938,0.00022514211,0.00009898698,0.000884255,0.0000882695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004020663,0.00017780758,0.00023069438,0.0001779459,0.00009277261,0.00018220018,0.00023962486,0.00009796551,0.000044421566],"category_scores_gemma":[0.00025627852,0.00015392993,0.00013213606,0.00022403184,0.00005170692,0.00014191697,0.000035915215,0.00034409988,0.0000024509059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001762976,0.000022908745,0.00017301065,0.00000687132,0.00046029326,0.000059841015,0.00012514804,0.92960775,0.00082280394,0.00018130495,0.00010891608,0.06841353],"study_design_scores_gemma":[0.0023868107,0.000048465023,0.00036353548,0.00023803356,0.00008808732,0.0009290512,0.000049429076,0.99277145,0.0016870885,0.000063485764,0.001195049,0.0001795064],"about_ca_topic_score_codex":0.000001844685,"about_ca_topic_score_gemma":0.0000014207901,"teacher_disagreement_score":0.4431757,"about_ca_system_score_codex":0.0001829888,"about_ca_system_score_gemma":0.00019490124,"threshold_uncertainty_score":0.627708},"labels":[],"label_agreement":null},{"id":"W3125883116","doi":"10.1287/mnsc.2020.3741","title":"On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors","year":2020,"lang":"en","type":"article","venue":"Management Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":252,"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":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Heuristics; Unobservable; Vehicle routing problem; Operations research; Order (exchange); Last mile (transportation); Analytics; Big data; Service provider; Routing (electronic design automation); Mathematical optimization; Service (business); Data mining; Mile; Econometrics; Engineering","score_opus":0.008366144430866654,"score_gpt":0.20464250949066126,"score_spread":0.19627636505979462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125883116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07935435,0.000014775014,0.7678305,0.0007883662,0.00020161523,0.00078449794,0.000010310689,0.0011199716,0.14989561],"genre_scores_gemma":[0.7935189,0.0000122672245,0.20348665,0.0009279108,0.000055869175,0.00003740974,0.000006234046,0.000057870868,0.00189691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842435,0.000028943441,0.00016014784,0.00038563492,0.0006415941,0.00035935672],"domain_scores_gemma":[0.99946344,0.00003860091,0.00003188711,0.00025434312,0.00003474005,0.00017699825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174818,0.00016665024,0.0001381342,0.00012542687,0.00014521596,0.00011008345,0.0004560276,0.000023220176,0.00044510484],"category_scores_gemma":[0.000036369045,0.00014738433,0.000019912868,0.0013336885,0.00013210511,0.00019066516,0.00011809797,0.000094875795,0.00054450135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010113731,0.000022100052,0.00021791348,0.0000312621,0.00003175593,0.000013041629,0.00029413472,0.98952854,0.0032636067,0.0006010647,0.0030049973,0.0029814523],"study_design_scores_gemma":[0.00037400535,0.00013890074,0.0019991286,0.0000316185,0.000023371927,7.7789986e-7,0.000069742695,0.99284256,0.002108156,0.000017644341,0.002161587,0.00023251919],"about_ca_topic_score_codex":8.5992076e-7,"about_ca_topic_score_gemma":1.438724e-7,"teacher_disagreement_score":0.7141645,"about_ca_system_score_codex":0.00010265955,"about_ca_system_score_gemma":0.000017682416,"threshold_uncertainty_score":0.6998645},"labels":[],"label_agreement":null},{"id":"W3126046128","doi":"10.1007/s10479-017-2725-7","title":"Negative dependence in matrix arrangement problems","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Eidgenössische Technische Hochschule Zürich; Swiss Finance Institute","keywords":"Theory of computation; Mathematical optimization; Maximization; Computer science; Minification; Matrix (chemical analysis); Scheduling (production processes); Mathematics; Algorithm","score_opus":0.2819698716354554,"score_gpt":0.49960532239658373,"score_spread":0.21763545076112834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126046128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9139485,0.0005877567,0.04679272,0.0050723,0.00017655356,0.0013538122,0.000030889903,0.00011140183,0.03192608],"genre_scores_gemma":[0.97104543,0.00038106524,0.027827764,0.000007918999,0.000027967188,0.000078097175,0.000002724252,0.000015169343,0.00061387644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998866,0.00016276432,0.00023148757,0.00013318933,0.00034408597,0.00026246946],"domain_scores_gemma":[0.9989236,0.00010704354,0.000015107032,0.00045860198,0.00044476683,0.000050901028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020995338,0.00006519233,0.000114917835,0.00023689706,0.00028716834,0.00016812255,0.0003936951,0.000048697628,0.000104280734],"category_scores_gemma":[0.0009796474,0.000066594745,0.000022840846,0.00022151353,0.00010528726,0.00036812818,0.00009280262,0.0002480221,0.000036622416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036621664,0.0000324533,0.0017955967,0.00004547051,0.000013388247,0.000002495419,0.000838235,0.98625743,0.005358641,0.0015984038,0.0003762782,0.0036779277],"study_design_scores_gemma":[0.00029743035,0.000054524455,0.018136598,0.00012019197,0.0000013203115,0.0000010393364,0.00022946084,0.92419845,0.055701613,0.0006235642,0.0005076228,0.00012818218],"about_ca_topic_score_codex":0.0003947052,"about_ca_topic_score_gemma":0.00067730126,"teacher_disagreement_score":0.062058996,"about_ca_system_score_codex":0.000024126854,"about_ca_system_score_gemma":0.000050339553,"threshold_uncertainty_score":0.2715655},"labels":[],"label_agreement":null},{"id":"W3127947492","doi":"","title":"Can Machine Learning Help in Solving Cargo Capacity Management Booking Control Problems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Revenue management; Computer science; Operations research; Revenue; Dynamic programming; Reinforcement learning; Profit (economics); Vehicle routing problem; Control (management); Mathematical optimization; Capacity management; Focus (optics); Time horizon; Routing (electronic design automation); Economics; Artificial intelligence; Engineering; Mathematics; Microeconomics; Finance; Algorithm","score_opus":0.0425783939065098,"score_gpt":0.17502310269506727,"score_spread":0.13244470878855746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127947492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42975968,0.0002729926,0.56449705,0.000024925856,0.00041875918,0.000498726,0.00001567356,0.0005775262,0.0039346516],"genre_scores_gemma":[0.9907463,0.0004623405,0.008130545,0.00002749024,0.00004742949,0.000004203236,0.000045478646,0.000083868035,0.0004523422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979488,0.00034796065,0.00033413127,0.00074378797,0.000109952205,0.000515328],"domain_scores_gemma":[0.9990217,0.000101114856,0.00014713392,0.0005156121,0.00008621067,0.00012819005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000632303,0.0004032901,0.0005107394,0.00042226564,0.00013108998,0.000115865354,0.0004279095,0.00030365988,0.00005778348],"category_scores_gemma":[0.000055464458,0.0005659251,0.00016296894,0.0005467218,0.000044955377,0.00013717586,0.00047969227,0.0014063158,0.000005290154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059223826,0.00002157728,0.029891258,0.00056821137,0.00017338619,0.00029000643,0.00049650756,0.96682906,0.000112418675,0.0012364085,0.0000040523064,0.00037120245],"study_design_scores_gemma":[0.00088374485,0.000009060457,0.0019280048,0.00051241997,0.00011421691,0.0000036145195,0.00032409138,0.9949854,0.00012402976,0.0004984463,0.000093579874,0.0005233764],"about_ca_topic_score_codex":0.000634326,"about_ca_topic_score_gemma":0.00073550915,"teacher_disagreement_score":0.56098664,"about_ca_system_score_codex":0.0007662294,"about_ca_system_score_gemma":0.000042528198,"threshold_uncertainty_score":0.9996792},"labels":[],"label_agreement":null},{"id":"W3128085259","doi":"10.1016/j.tcs.2021.02.003","title":"Improved hardness and approximation results for single allocation hub location problems","year":2021,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Hardness of approximation; Mathematics; Clique; Graph; Node (physics); Metric (unit); Approximation algorithm; Discrete mathematics; Integer (computer science); Computer science; Physics","score_opus":0.01807884128422667,"score_gpt":0.25378342178509666,"score_spread":0.23570458050086998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128085259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098859975,0.00003268959,0.98836225,0.0003010082,0.0003680936,0.00024145731,0.0000026406165,0.00019468424,0.000611199],"genre_scores_gemma":[0.6157376,0.000002549767,0.38414413,0.00003149205,0.0000458711,0.000013467853,0.000010405321,0.000007832486,0.0000066406587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905133,0.00004848806,0.00022135087,0.0003187029,0.00015642689,0.0002037199],"domain_scores_gemma":[0.9991394,0.00012406059,0.00003333848,0.00024197107,0.0003846115,0.00007661068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012463848,0.00008809235,0.00009853177,0.00005808325,0.00014822539,0.00019441164,0.00014586537,0.000044505974,0.0000019343152],"category_scores_gemma":[0.0004065211,0.00008817539,0.00001437887,0.0005525851,0.00035869295,0.0002598328,0.00006688084,0.000060372135,0.0000014769593],"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.000020752856,0.00006926892,0.000010442979,0.00025883535,0.000008481464,5.22551e-7,0.0013756286,0.29496405,0.18475656,0.4115341,0.000043122047,0.10695822],"study_design_scores_gemma":[0.0002792062,0.00004301296,0.00008562734,0.00003337714,0.000005357619,0.000008470117,0.000010524987,0.91167575,0.08038287,0.0073351474,0.000036212146,0.00010447307],"about_ca_topic_score_codex":3.8166863e-7,"about_ca_topic_score_gemma":3.3387195e-7,"teacher_disagreement_score":0.6167117,"about_ca_system_score_codex":0.00005527561,"about_ca_system_score_gemma":0.000040550043,"threshold_uncertainty_score":0.3595688},"labels":[],"label_agreement":null},{"id":"W3128538413","doi":"10.1155/2021/8886572","title":"Vehicle Routing Problem with Transshipment: Mathematical Model and Algorithm","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transshipment (information security); Heuristics; Economic shortage; Computer science; Routing (electronic design automation); Heuristic; Vehicle routing problem; Operations research; Integer programming; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.009899326220585324,"score_gpt":0.242173556055023,"score_spread":0.23227422983443768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128538413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24210668,0.00015238252,0.7574332,0.00006435399,0.000021131846,0.000052363466,0.0000037257585,0.00003692816,0.00012927451],"genre_scores_gemma":[0.42086884,0.00007273684,0.5789933,0.000010387743,0.000015939395,0.000001581626,0.0000046144623,0.000019252586,0.000013299724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915487,0.000020375926,0.00040516365,0.00008671142,0.00020461166,0.00012824958],"domain_scores_gemma":[0.99955463,0.000043771994,0.00010071899,0.00005928918,0.00016643856,0.00007514192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002037223,0.000102276215,0.00019483973,0.00004885421,0.0000377133,0.000021953405,0.00003883218,0.000043415348,0.000009458784],"category_scores_gemma":[0.000009040551,0.00009227344,0.000038666843,0.00016336527,0.000016657237,0.0003533477,7.2987183e-7,0.00017675817,3.2628853e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014985905,0.000021086129,0.00013174083,0.00008608143,0.00003262262,0.000030873885,0.0019914904,0.96222323,0.009098345,0.0003614791,0.0000015392835,0.026006503],"study_design_scores_gemma":[0.001527374,0.00007243051,0.003759457,0.00023267402,0.00009766105,0.00009056493,0.0006619705,0.9795171,0.0110445665,0.0027956779,0.000024739182,0.00017575907],"about_ca_topic_score_codex":1.1798136e-7,"about_ca_topic_score_gemma":0.000002342128,"teacher_disagreement_score":0.17876217,"about_ca_system_score_codex":0.00002768958,"about_ca_system_score_gemma":0.00003478564,"threshold_uncertainty_score":0.37628016},"labels":[],"label_agreement":null},{"id":"W3128705935","doi":"10.1111/itor.13111","title":"GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows","year":2022,"lang":"en","type":"preprint","venue":"International Transactions in Operational Research","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é Laval","funders":"Agence Nationale de la Recherche","keywords":"Orienteering; GRASP; Heuristic; Cover (algebra); Set (abstract data type); Computer science; Set cover problem; Operations research; Artificial intelligence; Mathematical optimization; Engineering; Mathematics; Software engineering; Programming language","score_opus":0.04690838405420756,"score_gpt":0.36247496320102846,"score_spread":0.3155665791468209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128705935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00790519,0.00031169326,0.98251224,0.0015785345,0.0007109068,0.002388208,0.0011149613,0.00014829097,0.0033299841],"genre_scores_gemma":[0.90017533,0.00062333833,0.0859684,0.0000669472,0.0003485753,0.0055988566,0.00084485876,0.00016525843,0.006208424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724805,0.00025023363,0.00047347767,0.00049613137,0.0011374754,0.00039464398],"domain_scores_gemma":[0.99702984,0.0019890068,0.00004592251,0.00030103623,0.00055518467,0.00007900938],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024130312,0.00025529577,0.0002467519,0.00050116325,0.0004934282,0.00039262994,0.000571508,0.00010451848,0.001907186],"category_scores_gemma":[0.00024380622,0.00022502293,0.0000767296,0.00031963835,0.00016238778,0.00021210968,0.00011388007,0.0015871397,0.000014717182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114961105,0.00005133184,0.00011175103,0.000102784914,0.00022772663,0.0000053858676,0.00042294903,0.9960838,0.00012291812,0.0004895722,0.0005935997,0.0016732138],"study_design_scores_gemma":[0.0009076649,0.000057403384,0.00023948964,0.00012238997,0.000023684384,0.00004319277,0.00015606642,0.98246855,0.00021446103,0.00052701106,0.014996023,0.00024406414],"about_ca_topic_score_codex":0.00010313993,"about_ca_topic_score_gemma":0.000042770127,"teacher_disagreement_score":0.89654386,"about_ca_system_score_codex":0.00092737115,"about_ca_system_score_gemma":0.0004660789,"threshold_uncertainty_score":0.9990052},"labels":[],"label_agreement":null},{"id":"W3129185417","doi":"10.1016/j.trpro.2021.01.007","title":"The Synchronized Location-Transshipment Problem","year":2021,"lang":"en","type":"article","venue":"Transportation research procedia","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"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":"Transshipment (information security); Computer science; Synchronization (alternating current); Integer programming; Operations research; Linear programming; Mathematical optimization; Engineering; Mathematics; Computer network; Computer security; Channel (broadcasting); Algorithm","score_opus":0.04130024121777702,"score_gpt":0.34486838691013294,"score_spread":0.3035681456923559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129185417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13732015,0.006815088,0.8304608,0.006109604,0.0007281927,0.0027566245,0.000050802395,0.0031734812,0.012585288],"genre_scores_gemma":[0.9294422,0.0009861521,0.06790765,0.00003321398,0.000103525366,0.0004193041,0.00010321903,0.00008718245,0.00091755216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821955,0.00014276023,0.00034131279,0.00021690763,0.0006444638,0.00043499807],"domain_scores_gemma":[0.99833405,0.00035361937,0.000021369002,0.00024444732,0.0009329471,0.00011357926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013450196,0.00011223608,0.00010800288,0.0000709941,0.00036633416,0.000117677875,0.00019335237,0.000077153934,0.00008167217],"category_scores_gemma":[0.0001502316,0.000097010336,0.00003865738,0.0011464321,0.00009314422,0.00014032985,0.0000035107275,0.00039215342,0.00007069486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058898895,0.00015789691,0.0056909467,0.0017949482,0.00023885931,0.000067504836,0.008834185,0.8259915,0.0118490355,0.054498695,0.010154415,0.080663115],"study_design_scores_gemma":[0.004945831,0.00019902126,0.17815948,0.000692113,0.00011375545,0.000017582683,0.006061395,0.48979014,0.143976,0.012804131,0.16160966,0.0016308848],"about_ca_topic_score_codex":0.000010138555,"about_ca_topic_score_gemma":0.0002646497,"teacher_disagreement_score":0.79212207,"about_ca_system_score_codex":0.00009920872,"about_ca_system_score_gemma":0.00029219018,"threshold_uncertainty_score":0.39559665},"labels":[],"label_agreement":null},{"id":"W3129729546","doi":"10.1287/trsc.2020.1013","title":"The Robust Vehicle Routing Problem with Time Window Assignments","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Compute Canada","keywords":"Subgradient method; Vehicle routing problem; Window (computing); Mathematical optimization; Computer science; Travel time; Routing (electronic design automation); Service (business); Operations research; Mathematics; Engineering; Transport engineering; Economics; Computer network","score_opus":0.013936633328072743,"score_gpt":0.23757625810749416,"score_spread":0.22363962477942143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129729546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.506925,0.00006323066,0.48545706,0.00030905663,0.0001458348,0.00023102602,0.0000074652344,0.0004384736,0.0064228484],"genre_scores_gemma":[0.899824,0.00000955411,0.09966909,0.000036111363,0.000016351021,0.000011988139,0.000007861243,0.000018920275,0.0004060749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876547,0.00003166488,0.00021566985,0.00022137558,0.0004771552,0.00028864574],"domain_scores_gemma":[0.9993963,0.00009050668,0.000045693916,0.00020772002,0.00018323264,0.0000765009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007742901,0.00009600595,0.000084121115,0.000035267833,0.00042992423,0.00015953727,0.00021306922,0.000025761801,0.000040345047],"category_scores_gemma":[0.00003335918,0.00007313175,0.000019789139,0.001087076,0.00015890432,0.000382892,0.0000039014594,0.00010988287,0.000025397652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032428861,0.000007778597,0.0057368707,0.000007936144,0.000007320596,0.000006397362,0.00063546136,0.9469355,0.042049803,0.00053001795,0.000016885964,0.0040628035],"study_design_scores_gemma":[0.00061568967,0.000028717941,0.14176473,0.00007243502,0.000026823152,0.000008334145,0.00043144322,0.7609222,0.09515819,0.000117680094,0.0005285466,0.00032523082],"about_ca_topic_score_codex":0.0000031681316,"about_ca_topic_score_gemma":0.000016668335,"teacher_disagreement_score":0.39289904,"about_ca_system_score_codex":0.000056688332,"about_ca_system_score_gemma":0.00012860294,"threshold_uncertainty_score":0.3306673},"labels":[],"label_agreement":null},{"id":"W3132725877","doi":"10.1007/978-3-030-60104-1_3","title":"A Fast Electric Vehicle Planner Using Clustering","year":2021,"lang":"en","type":"book-chapter","venue":"Studies in classification, data analysis, and knowledge organization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Cluster analysis; Computation; Speedup; Computer science; Shortest path problem; Planner; Range (aeronautics); Electric vehicle; Graph; Path (computing); Mathematical optimization; Real-time computing; Algorithm; Engineering; Mathematics; Artificial intelligence; Parallel computing; Theoretical computer science; Computer network","score_opus":0.11164230897041949,"score_gpt":0.3458162574810454,"score_spread":0.2341739485106259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132725877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001587552,0.04660318,0.9128782,0.0000993182,0.0011540035,0.00061006687,0.00039853822,0.0006885365,0.035980612],"genre_scores_gemma":[0.42365626,0.259024,0.12458237,0.0001607922,0.0038285584,0.000059747046,0.04245683,0.0017827222,0.14444873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979726,0.00009067452,0.0007434265,0.00075955386,0.00019220832,0.00024149969],"domain_scores_gemma":[0.9979041,0.00016219019,0.00021293429,0.0009898542,0.0006666244,0.00006429701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053061853,0.00038400464,0.0007241463,0.0008971704,0.00023260663,0.0001062484,0.0003287167,0.00029691358,0.00007721992],"category_scores_gemma":[0.00043360822,0.00043613912,0.000046080597,0.0021686465,0.00009228397,0.00025597043,0.0004042078,0.00031108747,0.000013587456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000497152,0.00051215815,0.15252264,0.008762105,0.04361825,0.00010183617,0.0258961,0.55083805,0.014001618,0.053575467,0.020864008,0.12925807],"study_design_scores_gemma":[0.00022289187,0.0000059123813,0.002926225,0.00021384264,0.0018862433,0.000006796494,0.00029604926,0.9888818,0.00007249711,0.000111318746,0.0048124753,0.00056389737],"about_ca_topic_score_codex":0.000010068229,"about_ca_topic_score_gemma":0.0006243611,"teacher_disagreement_score":0.7882958,"about_ca_system_score_codex":0.00037288104,"about_ca_system_score_gemma":0.000109829154,"threshold_uncertainty_score":0.999809},"labels":[],"label_agreement":null},{"id":"W3132873744","doi":"10.1287/opre.2020.2037","title":"Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"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; Group for Research in Decision Analysis; Wilfrid Laurier University; Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Branch and cut; Routing (electronic design automation); Mathematical optimization; Algorithm; Mathematics; Integer programming; Computer network","score_opus":0.049962690972596556,"score_gpt":0.3392341381493094,"score_spread":0.2892714471767129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132873744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026392752,0.00064774614,0.9700409,0.0011085363,0.000042645766,0.00075777376,0.000015477439,0.00008644365,0.0009076952],"genre_scores_gemma":[0.85987025,0.000089445486,0.13731864,0.00002360631,0.00006605798,0.00022775121,0.000020387666,0.00004951409,0.0023343617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989785,0.00013689892,0.00016116066,0.00021029323,0.00021824196,0.00029488068],"domain_scores_gemma":[0.9986019,0.00075226865,0.000007252092,0.00018637083,0.0003801146,0.00007207151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992889,0.000096243755,0.00011564717,0.0000708967,0.00069796067,0.00028912007,0.00008694519,0.00006173276,0.000043650074],"category_scores_gemma":[0.00031595168,0.00007206891,0.000014568416,0.00051039015,0.00010882764,0.00013101067,0.000054527034,0.0003171051,0.000005402447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075598227,0.000014450483,0.00005398357,0.000034651373,0.000053647043,0.0000017385328,0.0012125451,0.9773242,0.0046339836,0.001965031,0.000111595255,0.014586608],"study_design_scores_gemma":[0.00048263394,0.00004009754,0.000527236,0.00004045335,0.000014696805,0.000025887644,0.00050773437,0.9962324,0.0018669417,0.00007165685,0.00009259718,0.00009765101],"about_ca_topic_score_codex":0.000033228403,"about_ca_topic_score_gemma":0.0000571521,"teacher_disagreement_score":0.8334775,"about_ca_system_score_codex":0.000038705042,"about_ca_system_score_gemma":0.000100566525,"threshold_uncertainty_score":0.53682196},"labels":[],"label_agreement":null},{"id":"W3134425920","doi":"10.1287/ijoc.2020.1027","title":"Multirow Intersection Cuts Based on the Infinity Norm","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Mathematics; Integer programming; Linear programming relaxation; Linear programming; Norm (philosophy); Cutting-plane method; Mathematical optimization; Relaxation (psychology); Row; Algorithm; Computer science","score_opus":0.02295085128851744,"score_gpt":0.2621619497504528,"score_spread":0.2392110984619354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134425920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38498005,0.000012978729,0.5785035,0.0005089855,0.0018538692,0.00008206605,0.0000013319058,0.0002621709,0.03379508],"genre_scores_gemma":[0.9732515,0.0000056765357,0.025086017,0.0012274525,0.00033760158,8.090647e-7,0.0000024918124,0.000027277727,0.000061167724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988965,0.000083079634,0.0003985159,0.000091510716,0.00028454064,0.00024587614],"domain_scores_gemma":[0.9988558,0.0005817467,0.00012530034,0.00020015967,0.00015152551,0.00008543577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095540774,0.00015142036,0.00014183338,0.00012853001,0.00032100728,0.00022740084,0.00016227302,0.000072692535,0.0000898633],"category_scores_gemma":[0.00062160403,0.00010848155,0.00010875813,0.0003373087,0.000017313328,0.00014456641,0.000036043068,0.000884056,0.000047750204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008972481,0.000014596168,0.0007631425,0.000011376798,0.000018823326,0.00001576982,0.00027739047,0.95311254,0.00015984784,0.0001771627,0.00038335708,0.04505703],"study_design_scores_gemma":[0.00037105143,0.000053445678,0.0025536434,0.00017084971,0.000005661688,0.00009727187,0.00014454834,0.990045,0.0034144328,0.000044007324,0.002962981,0.00013711864],"about_ca_topic_score_codex":0.0000016853013,"about_ca_topic_score_gemma":0.0000016511831,"teacher_disagreement_score":0.58827144,"about_ca_system_score_codex":0.00019477133,"about_ca_system_score_gemma":0.00005499129,"threshold_uncertainty_score":0.44237494},"labels":[],"label_agreement":null},{"id":"W3136996413","doi":"10.1007/s10107-022-01844-1","title":"Disjunctive cuts in Mixed-Integer Conic Optimization","year":2022,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","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":false,"ca_institutions":"Polytechnique Montréal","funders":"Mitacs","keywords":"Conic section; Normalization (sociology); Conic optimization; Mathematics; Mathematical optimization; Solver; Integer programming; Context (archaeology); Duality (order theory); Discrete mathematics; Geometry","score_opus":0.012955250657911692,"score_gpt":0.2247089888048701,"score_spread":0.21175373814695841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136996413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24568526,0.00045502506,0.56616455,0.00085949013,0.0021489284,0.0010425013,0.00037905137,0.0010571416,0.18220805],"genre_scores_gemma":[0.9734171,0.00018245453,0.0150043955,0.00015333273,0.00006546563,0.000068623835,0.00026797017,0.00009786406,0.010742763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975711,0.000409598,0.00038597555,0.0005567539,0.00043566086,0.0006409198],"domain_scores_gemma":[0.99908143,0.00023949514,0.000102174556,0.00037310924,0.000079528356,0.00012427526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043022732,0.00036547257,0.0004217515,0.0005644993,0.0004887868,0.000038696104,0.0005200104,0.00008065548,0.0005120411],"category_scores_gemma":[0.000035054505,0.00043628848,0.00012655146,0.0008298274,0.00014465037,0.00027702,0.00066507957,0.0005435478,0.00005580951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007650073,0.000114064795,0.007166241,0.000034011613,0.00011445726,0.00014291689,0.00085723057,0.97959167,0.00021975147,0.009975937,0.0013707603,0.000336486],"study_design_scores_gemma":[0.0020336735,0.00015153429,0.018224386,0.000044251952,0.00010849195,0.0000953122,0.0021808925,0.95395553,0.00020327777,0.0002473054,0.021849543,0.0009058051],"about_ca_topic_score_codex":0.000019990382,"about_ca_topic_score_gemma":0.00003529791,"teacher_disagreement_score":0.7277319,"about_ca_system_score_codex":0.00073011627,"about_ca_system_score_gemma":0.00008864025,"threshold_uncertainty_score":0.9998089},"labels":[],"label_agreement":null},{"id":"W3140856702","doi":"10.1287/trsc.2021.1084","title":"An Improved Integral Column Generation Algorithm Using Machine Learning for Aircrew Pairing","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Pairing; Crew; Aircrew; Column generation; Computer science; Algorithm; Scheduling (production processes); Crew scheduling; Process (computing); Set (abstract data type); Engineering; Mathematics; Mathematical optimization; Aeronautics; Physics; Programming language","score_opus":0.03862218519718917,"score_gpt":0.3131411882160839,"score_spread":0.2745190030188947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140856702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28143045,0.000043023047,0.71792793,0.000010261713,0.00023128687,0.00011454938,0.000012570952,0.00021259594,0.00001731508],"genre_scores_gemma":[0.49623492,0.000006552766,0.5035308,0.000020923897,0.000054181786,0.000009852578,0.0000995647,0.000018631714,0.000024555035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891734,0.00003840842,0.00028006124,0.00029878673,0.00021583302,0.00024954407],"domain_scores_gemma":[0.9993429,0.000036273992,0.000049931063,0.0001474519,0.0003252582,0.000098181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078192377,0.00011204694,0.00012469954,0.00010828211,0.00031953328,0.00013665958,0.00012993187,0.000048103124,0.000027978314],"category_scores_gemma":[0.00007841695,0.00013251377,0.0000411641,0.0007656595,0.00006243796,0.0007005381,0.0000023244868,0.00012646102,8.909556e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.4011384e-7,0.0000066372336,0.00081131305,0.000012468532,0.0000027427654,0.000001004124,0.00039538342,0.59505624,0.37860617,0.000044835502,5.608459e-7,0.025061766],"study_design_scores_gemma":[0.00022656714,0.000021637468,0.0016913696,0.0000101071555,0.000013334629,0.0000024936367,0.000117165255,0.8480581,0.1496235,0.000013697971,0.000085990636,0.00013602874],"about_ca_topic_score_codex":0.000041842894,"about_ca_topic_score_gemma":0.00013650474,"teacher_disagreement_score":0.25300184,"about_ca_system_score_codex":0.00008790972,"about_ca_system_score_gemma":0.00012836023,"threshold_uncertainty_score":0.5403755},"labels":[],"label_agreement":null},{"id":"W3143580828","doi":"10.1155/2021/6665539","title":"Modeling and Solution of Vehicle Routing Problem with Grey Time Windows and Multiobjective Constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education, Fujian Province","keywords":"Vehicle routing problem; Customer satisfaction; Routing (electronic design automation); Computer science; Mathematical optimization; Order (exchange); Operations research; Simulation; Mathematics; Economics","score_opus":0.008225670799943506,"score_gpt":0.23393888837125842,"score_spread":0.2257132175713149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143580828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.615534,0.00014391156,0.3841839,0.000014358442,0.000020922273,0.000056806035,0.000003802712,0.000014412181,0.000027889484],"genre_scores_gemma":[0.72428024,0.00007117294,0.27561295,0.0000031930006,0.000012439492,6.838266e-7,0.0000042760785,0.000012282346,0.0000027330525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992762,0.00003159806,0.00037626628,0.00008750465,0.00013316974,0.00009524949],"domain_scores_gemma":[0.9993638,0.00004920121,0.00014922635,0.000040530293,0.00035072284,0.000046514007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022035881,0.00008552972,0.00019412395,0.0000645537,0.00003751309,0.000011772319,0.000020768774,0.000042591968,0.0000039358297],"category_scores_gemma":[0.000029883371,0.000083539286,0.00002432487,0.000135837,0.000037336144,0.00039738754,0.0000013009746,0.00013390374,8.416098e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044856937,0.000010755395,0.0014483494,0.00006428046,0.00003789524,0.000008339518,0.0021255633,0.8990092,0.085382156,0.000041199237,1.2498728e-7,0.011827281],"study_design_scores_gemma":[0.0019580966,0.00010460783,0.021996569,0.00037825655,0.000084697094,0.00006752851,0.0011392918,0.9520876,0.021873558,0.00017662958,0.0000013987294,0.00013180384],"about_ca_topic_score_codex":0.0000019595238,"about_ca_topic_score_gemma":0.000009858937,"teacher_disagreement_score":0.108746275,"about_ca_system_score_codex":0.000026005066,"about_ca_system_score_gemma":0.000036593683,"threshold_uncertainty_score":0.3406633},"labels":[],"label_agreement":null},{"id":"W3147792716","doi":"10.5267/j.uscm.2021.2.007","title":"Multi-product multi-vehicle inventory routing problem with vehicle compatibility and site dependency: A case study in the restaurant chain industry","year":2021,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Japan Society for the Promotion of Science","keywords":"Vehicle routing problem; Heuristics; Computer science; Integer programming; Compatibility (geochemistry); Mathematical optimization; Dependency (UML); Supply chain; Operations research; Column generation; Routing (electronic design automation); Mathematics; Engineering; Algorithm; Artificial intelligence","score_opus":0.036795674175107734,"score_gpt":0.28659657764442037,"score_spread":0.24980090346931264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147792716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98191154,0.00028131666,0.014626029,0.0004300983,0.00007997443,0.002250355,0.000012078142,0.00024642775,0.00016220682],"genre_scores_gemma":[0.9245162,0.00002183352,0.07474696,0.00015821686,0.00004218743,0.00023668853,0.000019458841,0.000065485154,0.00019297523],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626154,0.0011481071,0.0006414428,0.00083422265,0.00048915436,0.00062555366],"domain_scores_gemma":[0.9985977,0.00019514828,0.00010949689,0.00087065576,0.0001024351,0.00012459095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033617807,0.00040210944,0.00038975792,0.00020331706,0.00028698327,0.00018477504,0.00029893493,0.00012428827,0.00002434148],"category_scores_gemma":[0.00010345873,0.0003381404,0.000047601345,0.0010550672,0.00009113391,0.00019383729,0.00026898968,0.0008588011,0.0000035823257],"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.000027659182,0.0006870999,0.49813828,0.000351363,0.00011976164,0.006197821,0.022955457,0.46431655,0.0003453979,0.00006155456,0.000040059036,0.0067590275],"study_design_scores_gemma":[0.0036000754,0.00008787422,0.06710769,0.00016124039,0.00007872884,0.00020586827,0.06074989,0.8672903,0.00015668388,0.000021035792,0.00006198202,0.00047861406],"about_ca_topic_score_codex":0.0013503506,"about_ca_topic_score_gemma":0.006723307,"teacher_disagreement_score":0.43103057,"about_ca_system_score_codex":0.00027556525,"about_ca_system_score_gemma":0.000047031714,"threshold_uncertainty_score":0.9999071},"labels":[],"label_agreement":null},{"id":"W3149352661","doi":"10.1080/00207543.2021.1902013","title":"Integrated production-inventory-routing problem for multi-perishable products under uncertainty by meta-heuristic algorithms","year":2021,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Production (economics); Profit (economics); Vehicle routing problem; Integer programming; Fuzzy logic; Differential evolution; Routing (electronic design automation); Operations research; Mathematics; Economics; Artificial intelligence","score_opus":0.1940955073617104,"score_gpt":0.418685039166351,"score_spread":0.2245895318046406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149352661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08504864,0.0065538115,0.85261035,0.031480603,0.020722859,0.0023801958,0.00015731866,0.00053473434,0.0005114926],"genre_scores_gemma":[0.3242248,0.0006908663,0.6543825,0.00011001441,0.0049163424,0.000270222,0.0001932874,0.00022103422,0.014990919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961024,0.00057035877,0.00097311806,0.00052238285,0.0013552179,0.0004765226],"domain_scores_gemma":[0.9876927,0.000184658,0.0003526422,0.0003226634,0.011304324,0.0001429902],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005523776,0.0002438223,0.0004218076,0.00051805266,0.00023212381,0.0002729241,0.0005184031,0.00011848758,0.00015811263],"category_scores_gemma":[0.008393043,0.00022301637,0.00020539433,0.0010553411,0.00013865149,0.0005778874,0.000085211286,0.00090511626,0.000011892716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121000056,0.00046069603,0.00024515396,0.00019102373,0.0028613163,0.000030470623,0.0005476393,0.82554036,0.0933342,0.0003563759,0.06726104,0.009050744],"study_design_scores_gemma":[0.0024372276,0.0002457129,0.00018223938,0.000446387,0.0005786753,0.0012254455,0.00310895,0.43946433,0.43199533,0.0024263875,0.117,0.00088931754],"about_ca_topic_score_codex":0.000023890456,"about_ca_topic_score_gemma":0.000009614708,"teacher_disagreement_score":0.38607603,"about_ca_system_score_codex":0.00070793106,"about_ca_system_score_gemma":0.0004625668,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W3149471625","doi":"10.1016/j.ejor.2021.03.031","title":"An inverse optimization approach for a capacitated vehicle routing problem","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"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":"National Natural Science Foundation of China","keywords":"Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Operations research; Multiplicative function; Process (computing); Inverse; Mathematics","score_opus":0.0969225648087,"score_gpt":0.35160653743997106,"score_spread":0.25468397263127107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149471625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024809914,0.000077972945,0.96706367,0.00017883402,0.00009021744,0.00018335259,0.000009426723,0.000046603174,0.0075399987],"genre_scores_gemma":[0.28724292,0.000026285115,0.7121379,0.000037431582,0.00028332946,0.0000043783425,0.000055645887,0.000054824104,0.00015729967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968678,0.0015514129,0.000536754,0.00016846143,0.0005884015,0.00028721808],"domain_scores_gemma":[0.99691224,0.00022495078,0.000071437484,0.00016660533,0.00244731,0.00017748027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069805733,0.00010698777,0.00015931463,0.0002193676,0.00026940485,0.00028897845,0.00025489522,0.000034177443,0.000082463215],"category_scores_gemma":[0.0010215635,0.00010671478,0.00006472104,0.0005726777,0.000051960076,0.0005327595,0.00003379298,0.0004518508,0.0000054534503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002557603,0.00006491709,0.00010385974,0.000033648448,0.000036717716,0.000028596398,0.0006612891,0.9736616,0.022644997,0.00048924075,0.00081453135,0.0014350499],"study_design_scores_gemma":[0.00077693985,0.00014164158,0.0001541834,0.00003663983,0.000007733916,0.000075512275,0.00049964245,0.9939427,0.003870811,0.000020569041,0.00036330405,0.00011032198],"about_ca_topic_score_codex":7.561547e-7,"about_ca_topic_score_gemma":4.594291e-7,"teacher_disagreement_score":0.26243302,"about_ca_system_score_codex":0.00012307802,"about_ca_system_score_gemma":0.00023585049,"threshold_uncertainty_score":0.43517023},"labels":[],"label_agreement":null},{"id":"W3151788990","doi":"10.1109/wsc.2011.6147959","title":"Modeling and simulation of military tactical logistics distribution","year":2011,"lang":"en","type":"article","venue":"","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":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Truck; Computer science; Military logistics; Operations research; Integrated logistics support; Humanitarian Logistics; Systems engineering; Transport engineering; Engineering; Operations management; Automotive engineering","score_opus":0.05568092365549123,"score_gpt":0.28831719802683686,"score_spread":0.23263627437134562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151788990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09322711,0.000050432263,0.90573823,0.0000023257226,0.000035195862,0.00003200357,0.000006373973,0.00009434424,0.0008139855],"genre_scores_gemma":[0.83920366,0.000015925041,0.16074954,0.0000025350723,0.000008161321,4.985326e-7,0.000010339206,0.0000058602554,0.0000034893349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968755,0.000016290072,0.0001340052,0.00005353266,0.000045553377,0.00006305015],"domain_scores_gemma":[0.999814,0.000047523426,0.0000057689517,0.00006699611,0.00004024058,0.000025500607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012482321,0.00004314832,0.0000627956,0.000016036221,0.000013388247,0.0000010600596,0.00002059577,0.0000437787,0.000027795899],"category_scores_gemma":[0.00012773287,0.00004308613,0.000010269777,0.000051438496,0.000016228583,0.000059069676,0.000010476674,0.000041793955,7.9021663e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003236612,0.000005494092,0.00032791094,0.000018367396,0.00000433813,1.680162e-7,0.0000811169,0.99757016,0.000091144015,0.00065702584,0.000004004718,0.0012370419],"study_design_scores_gemma":[0.00006491972,0.000009132924,0.0005501577,0.000004252078,0.000008990805,5.5542927e-7,0.000026816093,0.99819994,0.0006057985,0.00047946096,0.0000040729146,0.000045878576],"about_ca_topic_score_codex":0.000024083416,"about_ca_topic_score_gemma":0.0000012629364,"teacher_disagreement_score":0.7459765,"about_ca_system_score_codex":0.000012334556,"about_ca_system_score_gemma":0.0000025635643,"threshold_uncertainty_score":0.17570014},"labels":[],"label_agreement":null},{"id":"W3152731649","doi":"10.3390/app11083346","title":"Randomized and Generated Instances Fitting with the Home Health Care Problem Subjected to Certain Constraints","year":2021,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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 à Chicoutimi","funders":"","keywords":"Benchmark (surveying); Computer science; Generator (circuit theory); Workload; Set (abstract data type); Confidentiality; Health care; Synchronization (alternating current); Risk analysis (engineering); Operations research; Power (physics); Computer security; Medicine; Engineering","score_opus":0.01466948788174533,"score_gpt":0.26013073658135333,"score_spread":0.245461248699608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152731649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8815925,0.0013944723,0.10221038,0.0021177554,0.00009619086,0.0009883908,0.000007380623,0.00035062502,0.01124232],"genre_scores_gemma":[0.8260156,0.000026716194,0.1734973,0.00035780566,0.000020145295,0.00005363897,0.000003560936,0.000010088726,0.000015151327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888426,0.00016853525,0.00020228238,0.00026032384,0.00021165506,0.00027292463],"domain_scores_gemma":[0.99936014,0.0003271785,0.000053042648,0.00010703762,0.00007321962,0.00007938138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012371393,0.000120608085,0.00027100902,0.000055195116,0.00039885685,0.00016856987,0.00013612401,0.000027851349,0.000013153296],"category_scores_gemma":[0.000054593747,0.000076371536,0.000015269554,0.0008224832,0.0003943795,0.000054126493,0.000031583066,0.00009913639,0.000001500605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071897754,0.000016250613,0.00068268564,0.00021052735,0.00010898356,0.000008417173,0.041528493,0.8536815,0.01772943,0.013875115,0.00037501348,0.07106461],"study_design_scores_gemma":[0.20413165,0.00044899745,0.002695684,0.0008719261,0.00020227472,0.00021826268,0.18947627,0.42746872,0.16521002,0.0017891371,0.003501152,0.0039859093],"about_ca_topic_score_codex":0.000012827054,"about_ca_topic_score_gemma":0.00012060588,"teacher_disagreement_score":0.4262128,"about_ca_system_score_codex":0.000031347514,"about_ca_system_score_gemma":0.00017764083,"threshold_uncertainty_score":0.3114341},"labels":[],"label_agreement":null},{"id":"W3155585954","doi":"10.5267/j.ijiec.2021.2.002","title":"A biobjective capacitated vehicle routing problem using metaheuristic ILS and decomposition","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Vehicle routing problem; Sorting; Benchmark (surveying); Metaheuristic; Multi-objective optimization; Decomposition; Tabu search; Set (abstract data type); Computer science; Iterated local search; Routing (electronic design automation); Genetic algorithm; Mathematics; Algorithm","score_opus":0.034552938549428196,"score_gpt":0.2983848979352959,"score_spread":0.2638319593858677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155585954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39541686,0.00012776062,0.60294914,0.00014631728,0.0011559562,0.00005864274,0.000014048841,0.000076577184,0.000054673943],"genre_scores_gemma":[0.8226794,0.000015547477,0.17686258,0.000014084766,0.00038488873,0.0000013625129,0.000010837401,0.000027938035,0.0000033423353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885017,0.000075548494,0.00051355426,0.00011207629,0.00028382093,0.00016483974],"domain_scores_gemma":[0.9986045,0.00031569166,0.00016855185,0.000058596168,0.00075032015,0.00010233433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003878826,0.00014034241,0.0002188393,0.0003177337,0.000057208123,0.00015173927,0.00012629485,0.00009322229,0.000010766949],"category_scores_gemma":[0.000506868,0.00016106007,0.0000758363,0.00036518497,0.000020051151,0.0002948159,0.000035940437,0.00036572883,0.0000010827719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007956483,0.00001938223,0.00027035066,0.0000069303064,0.00027666005,0.000055242752,0.00030813986,0.9746741,0.020743648,0.00032611954,0.000030744075,0.003280711],"study_design_scores_gemma":[0.0009672504,0.000024655998,0.00034759965,0.00023378838,0.00006934227,0.000562305,0.00012338754,0.98971325,0.0075539974,0.00014395828,0.000105396015,0.00015507858],"about_ca_topic_score_codex":0.000007773313,"about_ca_topic_score_gemma":8.288246e-7,"teacher_disagreement_score":0.42726254,"about_ca_system_score_codex":0.00024782275,"about_ca_system_score_gemma":0.00012209412,"threshold_uncertainty_score":0.65678394},"labels":[],"label_agreement":null},{"id":"W3156359523","doi":"10.1155/2021/5531500","title":"Vehicle Routing Problem for Collaborative Multidepot Petrol Replenishment under Emergency Conditions","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science Foundation of Ministry of Education of China; Chongqing Municipal Education Commission; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Truck; Vehicle routing problem; Routing (electronic design automation); Computer science; Genetic algorithm; Operations research; Transport engineering; Particle swarm optimization; Engineering; Computer network; Automotive engineering","score_opus":0.015592656698369243,"score_gpt":0.29327924102817887,"score_spread":0.27768658432980964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156359523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38347858,0.00035618606,0.61477923,0.00024281336,0.0006105967,0.0002493749,0.00009107687,0.00007018343,0.00012195268],"genre_scores_gemma":[0.67138207,0.00016906887,0.32820132,0.000017749779,0.00007650939,0.000019650026,0.000055208344,0.000028657025,0.000049741684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99868804,0.0000491349,0.00076503435,0.00012525383,0.00020051427,0.00017202525],"domain_scores_gemma":[0.99849904,0.00011654846,0.00030892738,0.000094964445,0.0009057943,0.00007473828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027866586,0.00012335757,0.00022286363,0.00007808682,0.00010197788,0.000017426508,0.000059578397,0.00005522339,0.000064137115],"category_scores_gemma":[0.000082506886,0.00013489531,0.000118582204,0.00037567335,0.000011097749,0.0004190145,0.0000011682414,0.00015240307,8.6872586e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028788694,0.000037503552,0.001012378,0.00006357731,0.00008613611,0.000008907376,0.0012045845,0.9247061,0.07048869,0.00072408305,0.00008969019,0.0015495692],"study_design_scores_gemma":[0.015084389,0.00087224285,0.39252278,0.0008576493,0.0010202122,0.00008796279,0.026511589,0.1827287,0.36172825,0.012422308,0.004585754,0.0015781692],"about_ca_topic_score_codex":4.8052306e-7,"about_ca_topic_score_gemma":0.000023746314,"teacher_disagreement_score":0.7419774,"about_ca_system_score_codex":0.00009502109,"about_ca_system_score_gemma":0.000093324,"threshold_uncertainty_score":0.5500871},"labels":[],"label_agreement":null},{"id":"W3157158781","doi":"10.1287/trsc.2022.1168","title":"The Fragility-Constrained Vehicle Routing Problem with Time Windows","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Fragility; Column generation; Constraint (computer-aided design); Mathematical optimization; Routing (electronic design automation); Path (computing); Computer science; Algorithm; Mathematics","score_opus":0.009692242060243708,"score_gpt":0.2352825047397383,"score_spread":0.22559026267949459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157158781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8526655,0.000036583308,0.1397441,0.00041844792,0.00015499315,0.00050422724,0.000027009406,0.00070148293,0.005747679],"genre_scores_gemma":[0.9713241,0.000001602245,0.028383112,0.000045586065,0.000011311057,0.000053062453,0.000008170393,0.000017197019,0.00015586955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985963,0.00005346103,0.0002483049,0.00022369051,0.0005742284,0.00030398057],"domain_scores_gemma":[0.99945116,0.0001245892,0.00005647308,0.00021317517,0.000086963584,0.00006764007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017764233,0.000097631106,0.00008774318,0.00006567781,0.0011706792,0.00008427529,0.00036749215,0.00001387813,0.000111932364],"category_scores_gemma":[0.000023696548,0.00007825131,0.000023619259,0.0012915395,0.00027545565,0.00027646188,0.000007617489,0.00020216504,0.000009347027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094766265,0.000007685625,0.0029034913,0.000005359557,0.000005022292,0.00000238412,0.0015900515,0.9782758,0.010831776,0.0013218771,0.000014208661,0.0050328765],"study_design_scores_gemma":[0.00050252536,0.00006415981,0.03386215,0.000009856791,0.0000146504,0.000007737499,0.0008682813,0.9581939,0.004592713,0.00023002128,0.0014024506,0.00025154732],"about_ca_topic_score_codex":0.000009578881,"about_ca_topic_score_gemma":0.000010665216,"teacher_disagreement_score":0.11865862,"about_ca_system_score_codex":0.0000843528,"about_ca_system_score_gemma":0.00012395131,"threshold_uncertainty_score":0.9004037},"labels":[],"label_agreement":null},{"id":"W3162944938","doi":"10.5267/j.dsl.2021.4.003","title":"A new distributed optimization approach for home healthcare routing and scheduling problem","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Health care; Home health; Technician; Vehicle routing problem; Operations research; Routing (electronic design automation); Nurse scheduling problem; Job shop scheduling; Mathematical optimization; Engineering; Computer network; Mathematics; Economics","score_opus":0.026161131746409657,"score_gpt":0.2946441322966472,"score_spread":0.26848300055023755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162944938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025133943,0.00010815083,0.9726984,0.0013894904,0.00019000475,0.00023280099,0.00000992907,0.00019727029,0.00004001235],"genre_scores_gemma":[0.08721413,0.000019063244,0.9121997,0.0004321523,0.00006196906,0.000012567661,0.000031568536,0.000023146978,0.0000057109314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843687,0.000034898087,0.00031875976,0.00044598104,0.00038190768,0.0003815671],"domain_scores_gemma":[0.99911594,0.00021855012,0.000057754045,0.00024728524,0.00016477787,0.0001957111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010968748,0.0001348511,0.00017774402,0.00015880354,0.000313936,0.00032618525,0.00021120207,0.000059446626,0.000005486036],"category_scores_gemma":[0.0005730856,0.00013954952,0.000037256108,0.0014482323,0.000064104854,0.00042650395,0.00008716255,0.00013024533,7.0546594e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035231892,0.000003233526,0.00048826315,0.000023694323,0.0000028147713,0.0000011843136,0.0001694526,0.96875894,0.004846204,0.00017103936,0.000110823,0.02542082],"study_design_scores_gemma":[0.00036797198,0.0000073659953,0.0003545535,0.000047697213,0.000005658043,0.000018363357,0.00012544073,0.9973886,0.0013551263,0.00009439477,0.00006955895,0.00016525855],"about_ca_topic_score_codex":0.0000037052637,"about_ca_topic_score_gemma":4.6844582e-7,"teacher_disagreement_score":0.06208019,"about_ca_system_score_codex":0.000120558834,"about_ca_system_score_gemma":0.00009698944,"threshold_uncertainty_score":0.5690664},"labels":[],"label_agreement":null},{"id":"W3163275984","doi":"10.1155/2021/8280686","title":"Two-Echelon Location-Routing Problem with Time Windows and Transportation Resource Sharing","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Sorting; Genetic algorithm; Computer science; Mathematical optimization; Particle swarm optimization; Vehicle routing problem; Multi-objective optimization; Resource (disambiguation); Cluster analysis; Process (computing); Service (business); Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.008240355208725375,"score_gpt":0.2414700889973975,"score_spread":0.23322973378867212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163275984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6935522,0.0004330271,0.30528057,0.00010535366,0.00007145989,0.00015104814,0.00000697459,0.00010761717,0.00029175877],"genre_scores_gemma":[0.7214473,0.00006267463,0.27824762,0.000023816936,0.000060486313,0.0000040126038,0.00006488781,0.00004368782,0.00004551632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986822,0.00003378415,0.00064684695,0.00017908656,0.00028073872,0.0001773626],"domain_scores_gemma":[0.99902356,0.00008089869,0.0002844198,0.00011514794,0.00040315333,0.00009280152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035787764,0.00016423193,0.00026172496,0.00011964344,0.000077024546,0.000041803076,0.00007616475,0.00006350697,0.00001769717],"category_scores_gemma":[0.000025563062,0.00016474495,0.00004768415,0.0004899981,0.000023037583,0.00062583905,9.4196224e-7,0.00026159704,0.000001132662],"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.00006111332,0.000017484399,0.00409511,0.00011883434,0.00005044641,0.000039710405,0.0024024695,0.9645324,0.020607622,0.00019954484,0.000004238581,0.007871078],"study_design_scores_gemma":[0.016880551,0.00072396523,0.5637754,0.004262632,0.0011343791,0.0004948031,0.008225681,0.25952506,0.13871586,0.0019682406,0.0022263823,0.0020669927],"about_ca_topic_score_codex":0.0000022421395,"about_ca_topic_score_gemma":0.000035221103,"teacher_disagreement_score":0.70500726,"about_ca_system_score_codex":0.000060416463,"about_ca_system_score_gemma":0.000057366324,"threshold_uncertainty_score":0.6718104},"labels":[],"label_agreement":null},{"id":"W3163654962","doi":"10.1016/j.cie.2021.107396","title":"Robust optimization for the hierarchical mixed capacitated general routing problem applied to winter road maintenance","year":2021,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Mathematical optimization; Computer science; Vehicle routing problem; Metaheuristic; Hierarchy; Routing (electronic design automation); Robust optimization; Operations research; Engineering; Mathematics","score_opus":0.03923158368135803,"score_gpt":0.2291408364209234,"score_spread":0.18990925273956535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163654962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084005995,0.00003613098,0.9871853,0.00046204845,0.0023653556,0.00073172525,0.000014422198,0.0006722911,0.00013213072],"genre_scores_gemma":[0.1550147,0.0000066662024,0.84304506,0.00016936421,0.0013132078,0.00016219697,0.00006675518,0.00014051812,0.00008153771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982339,0.000052670617,0.0005233183,0.00039399788,0.00019971684,0.00059636007],"domain_scores_gemma":[0.99887264,0.00038237323,0.00005544976,0.00034199053,0.00014128849,0.00020627287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005467871,0.00031886657,0.00034455024,0.00012966376,0.00015160367,0.00020396971,0.00032700118,0.00021488253,0.000019878606],"category_scores_gemma":[0.00040917326,0.00030644948,0.00011971379,0.00072513,0.000022352695,0.000106259344,0.00012225096,0.0005121363,0.0000038733183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018974162,0.000009203427,0.000008060186,0.000025509584,0.000098005905,0.0000039045844,0.00025078334,0.9729435,0.0023700101,0.000558026,0.0015967976,0.022117222],"study_design_scores_gemma":[0.0011275854,0.000021038846,0.000051744144,0.000118901335,0.00003330139,0.000014669592,0.000042953103,0.99288034,0.0031861714,0.000006008603,0.0021610388,0.00035623444],"about_ca_topic_score_codex":0.0000044354615,"about_ca_topic_score_gemma":0.000001246236,"teacher_disagreement_score":0.14661409,"about_ca_system_score_codex":0.0002152412,"about_ca_system_score_gemma":0.00006621426,"threshold_uncertainty_score":0.9999388},"labels":[],"label_agreement":null},{"id":"W3166781248","doi":"10.1155/2021/5182989","title":"Multi-Depot Pickup and Delivery Problem with Resource Sharing","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; Fundamental Research Funds for the Central Universities; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Sorting; Mathematical optimization; Benchmark (surveying); Computer science; Genetic algorithm; Particle swarm optimization; Cluster analysis; Multi-objective optimization; Pareto principle; Operator (biology); Pickup; Selection (genetic algorithm); Algorithm; Mathematics","score_opus":0.012240130949841102,"score_gpt":0.24067441416789895,"score_spread":0.22843428321805784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166781248","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7167461,0.00055788585,0.2824575,0.000036321962,0.000050943843,0.000046295725,0.000001938514,0.000041449315,0.00006156928],"genre_scores_gemma":[0.45583418,0.00015968732,0.5439136,0.0000150789965,0.000024696357,0.0000011038027,0.0000056254103,0.000020347426,0.000025706518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993163,0.000016453683,0.0003236772,0.00009543837,0.00014419125,0.000103977516],"domain_scores_gemma":[0.99953777,0.000036891965,0.000118022304,0.00006921985,0.00017590949,0.00006221879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014594042,0.00008869209,0.00015171785,0.000066589644,0.000036437898,0.000022092201,0.000045923603,0.00003750144,0.000007011186],"category_scores_gemma":[0.000013334812,0.00008366944,0.00003053677,0.00017464597,0.000012810464,0.0003295242,0.0000014810546,0.00017234657,2.5983078e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003413293,0.000013739811,0.0053165136,0.000077523,0.000033649754,0.00006998553,0.0010840653,0.9597789,0.025679776,0.000020249927,0.000003384624,0.007888066],"study_design_scores_gemma":[0.011533397,0.00048811265,0.7297265,0.0018845857,0.00046324995,0.00071695726,0.0052240724,0.1456252,0.098313645,0.00036411802,0.0045735943,0.0010865425],"about_ca_topic_score_codex":8.1329785e-7,"about_ca_topic_score_gemma":0.000024290059,"teacher_disagreement_score":0.81415373,"about_ca_system_score_codex":0.000028932016,"about_ca_system_score_gemma":0.00002257645,"threshold_uncertainty_score":0.34119406},"labels":[],"label_agreement":null},{"id":"W3167803807","doi":"10.1016/j.scs.2021.103074","title":"Mixed fleet based green clustered logistics problem under carbon emission cap","year":2021,"lang":"en","type":"article","venue":"Sustainable Cities and Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Benchmark (surveying); Metaheuristic; Particle swarm optimization; Computer science; Vehicle routing problem; Mathematical optimization; Operations research; Engineering; Algorithm; Mathematics; Routing (electronic design automation)","score_opus":0.017666043508759385,"score_gpt":0.2346691047409842,"score_spread":0.21700306123222482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167803807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20140176,0.0031434547,0.76707643,0.0018896861,0.00045099662,0.0006322823,0.000033699576,0.0011120819,0.024259618],"genre_scores_gemma":[0.8881701,0.00023404475,0.090288855,0.00033799635,0.00014358346,0.000026248283,0.00007353489,0.00008578972,0.020639831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989545,0.00008175093,0.00019998684,0.0002059546,0.00014732736,0.00041051666],"domain_scores_gemma":[0.99937505,0.000102605656,0.00003213485,0.00019819639,0.00019489702,0.00009711972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031734968,0.00016646445,0.00020120069,0.000022360462,0.00020360634,0.00009602262,0.00006821107,0.0001767162,0.00003163402],"category_scores_gemma":[0.00004724532,0.00017538728,0.000081187936,0.00022932197,0.000073752344,0.00006873237,0.00008445536,0.00018671708,2.2269693e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007997534,0.00002832456,0.0008102683,0.0028007985,0.0001066385,0.00004605532,0.004477593,0.9779791,0.00050280185,0.0064034974,0.0053296373,0.0015072399],"study_design_scores_gemma":[0.0005642786,0.000017797123,0.00024724883,0.000040750194,0.00003363626,0.000004778766,0.04304912,0.94863236,0.001358415,0.0025246488,0.0032582504,0.00026873747],"about_ca_topic_score_codex":0.00012220426,"about_ca_topic_score_gemma":0.0000070640212,"teacher_disagreement_score":0.68676835,"about_ca_system_score_codex":0.00019372671,"about_ca_system_score_gemma":0.0001434554,"threshold_uncertainty_score":0.7152086},"labels":[],"label_agreement":null},{"id":"W3171114511","doi":"10.5267/j.jpm.2021.5.002","title":"Solving open travelling salesman subset-tour problem through a hybrid genetic algorithm","year":2021,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Tree traversal; Crossover; Christofides algorithm; Benchmark (surveying); 2-opt; Computer science; Selection (genetic algorithm); Genetic algorithm; Traverse; Set (abstract data type); Bottleneck traveling salesman problem; Lin–Kernighan heuristic; Nearest neighbour algorithm; Mathematical optimization; Mutation; Permutation (music); Algorithm; Mathematics; Artificial intelligence; Machine learning; Geography; Biology","score_opus":0.03150600752234208,"score_gpt":0.29639048382187294,"score_spread":0.2648844762995309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171114511","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032625212,0.0008675035,0.978422,0.00010658812,0.000463716,0.00047159937,0.0000034385744,0.00007711601,0.016325533],"genre_scores_gemma":[0.012714182,0.0011059265,0.98499817,0.00009115367,0.0002218966,0.000015533858,0.0000041986177,0.00006938275,0.00077954744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815875,0.00015704901,0.0007548955,0.00021067288,0.0003767286,0.00034192333],"domain_scores_gemma":[0.99919724,0.000047961785,0.00024378786,0.00026573494,0.0001828981,0.000062354746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091632945,0.00020570855,0.0003591932,0.00018123616,0.000101417616,0.00032135658,0.00052763417,0.000042828236,0.00007745965],"category_scores_gemma":[0.000024475929,0.00020596465,0.00012690827,0.00045584867,0.000015512132,0.00038640623,0.00023033562,0.00030063782,0.0000095786445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001674701,0.00016197683,0.00019205955,0.0006416574,0.00088656717,0.0021046367,0.0017934374,0.7009419,0.0006409853,0.00041100456,0.00916117,0.28304785],"study_design_scores_gemma":[0.003837195,0.00023795052,0.0014504518,0.0012683135,0.0006025511,0.001377383,0.002366064,0.887586,0.012537257,0.0032108722,0.08443755,0.0010883926],"about_ca_topic_score_codex":0.000008548479,"about_ca_topic_score_gemma":0.0000028297686,"teacher_disagreement_score":0.28195944,"about_ca_system_score_codex":0.0001694159,"about_ca_system_score_gemma":0.00008105096,"threshold_uncertainty_score":0.8398994},"labels":[],"label_agreement":null},{"id":"W3171468365","doi":"10.5267/j.ijiec.2021.4.002","title":"Solution of capacitated vehicle routing problem with invasive weed and hybrid algorithms","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Vehicle routing problem; Metaheuristic; Mathematical optimization; Set (abstract data type); Genetic algorithm; Computer science; Routing (electronic design automation); Hybrid algorithm (constraint satisfaction); Weed; Mathematics","score_opus":0.02588579521446102,"score_gpt":0.2501091145931175,"score_spread":0.2242233193786565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171468365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3666318,0.00009681451,0.6320146,0.00031616905,0.0006988458,0.00008670615,0.000020862894,0.00006214391,0.000072071736],"genre_scores_gemma":[0.84765625,0.000016608969,0.15202829,0.000008104341,0.000240437,0.0000026508878,0.000015515061,0.000024895713,0.0000072429884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988934,0.00004620984,0.00050393434,0.00009562783,0.00033022396,0.00013060862],"domain_scores_gemma":[0.9983883,0.0003195246,0.00021857995,0.00006138304,0.0009345448,0.00007770539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029700054,0.00012479619,0.00022147912,0.00025271194,0.00003176878,0.000062557825,0.00013490474,0.00006198555,0.000007971506],"category_scores_gemma":[0.00040610507,0.00012888899,0.000052729116,0.0002884116,0.000029854898,0.00025346907,0.000031598905,0.00031525164,5.3690746e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013576333,0.000022043356,0.00039047102,0.000013129834,0.00027274434,0.000047946334,0.00024162432,0.97508633,0.017204637,0.00020054575,0.000066927336,0.006440051],"study_design_scores_gemma":[0.0018243582,0.00008017035,0.00068867416,0.00048383127,0.000053728036,0.0005367894,0.00014050398,0.9610263,0.03478892,0.000070468384,0.00014027499,0.00016596999],"about_ca_topic_score_codex":0.000012188179,"about_ca_topic_score_gemma":0.000001908741,"teacher_disagreement_score":0.48102447,"about_ca_system_score_codex":0.00011365426,"about_ca_system_score_gemma":0.00015963624,"threshold_uncertainty_score":0.52559406},"labels":[],"label_agreement":null},{"id":"W3172443659","doi":"10.21203/rs.3.rs-315613/v1","title":"An optimization approach for green tourist trip design","year":2021,"lang":"en","type":"preprint","venue":"Research Square","topic":"Vehicle Routing Optimization Methods","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":"École de Technologie Supérieure","funders":"","keywords":"Tourism; Business; Computer science; Transport engineering; Architectural engineering; Engineering; Geography","score_opus":0.1338843360683134,"score_gpt":0.4060421232160737,"score_spread":0.2721577871477603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172443659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043826786,0.0006439779,0.99436957,0.0000596777,0.0002056387,0.0022272558,0.00008096069,0.0006198418,0.0013548104],"genre_scores_gemma":[0.025899533,0.00023274751,0.97010726,0.000007624049,0.0005485871,0.0010313741,0.0016075505,0.00021528233,0.00035002522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959019,0.0014263084,0.000437055,0.00072935736,0.0007905579,0.0007148204],"domain_scores_gemma":[0.9970141,0.00052528485,0.00006096653,0.0010625585,0.0010739209,0.00026314578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004534236,0.00032239492,0.00044580046,0.00049684034,0.00024996785,0.000496549,0.0006709705,0.0006291771,0.00010495551],"category_scores_gemma":[0.0006976073,0.00036924088,0.00016250591,0.00067901623,0.00006479225,0.00019273532,0.00028781733,0.0012472941,0.00000232054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027890519,0.000081728685,0.000044269098,0.0016907974,0.00006238676,0.00000551116,0.00049013685,0.99077785,0.00017861198,0.000032127096,0.00068782724,0.0059208693],"study_design_scores_gemma":[0.0003693236,0.00008924316,0.000046260382,0.00016364982,0.000020434822,0.000002790983,0.00038943955,0.9971058,0.0012457941,0.000089849294,0.000118674136,0.00035875844],"about_ca_topic_score_codex":0.0000660644,"about_ca_topic_score_gemma":0.0000029691325,"teacher_disagreement_score":0.025461266,"about_ca_system_score_codex":0.00040826405,"about_ca_system_score_gemma":0.00032421132,"threshold_uncertainty_score":0.99987596},"labels":[],"label_agreement":null},{"id":"W3172863303","doi":"10.1007/s40314-021-01548-w","title":"Integrated hub location and flow processing schedule problem under renewable capacity constraint","year":2021,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Vehicle Routing Optimization Methods","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Lagrangian relaxation; Schedule; Flow network; Integer programming; Scheduling (production processes); Profitability index; Linear programming; Operations research; Job shop scheduling; Engineering; Mathematics","score_opus":0.02633252222274936,"score_gpt":0.24093024207064648,"score_spread":0.2145977198478971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172863303","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042066567,0.00011701925,0.95535547,0.00007291915,0.000018246148,0.00011113459,0.000005057059,0.00015237369,0.0021012397],"genre_scores_gemma":[0.35127467,0.0000059760337,0.648603,0.000031802007,0.000012737181,0.000009354311,0.000028960962,0.000013033196,0.000020439342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941766,0.000011121661,0.00021398293,0.0001405061,0.00010944894,0.0001072949],"domain_scores_gemma":[0.99959916,0.000101843965,0.000041567786,0.000056823596,0.00014828777,0.00005230039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016697984,0.00011174569,0.0001442404,0.000034594967,0.00009994995,0.00009553076,0.000029134002,0.00005700133,0.000013050762],"category_scores_gemma":[0.000025655683,0.00011202293,0.000009463422,0.00020909621,0.000066855064,0.000058213078,0.00002367825,0.00009345526,0.0000024444362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.997125e-7,0.000024948908,0.000006662564,0.00047500254,0.0000152166,3.7277442e-7,0.0005100346,0.9656719,0.001928357,0.02329286,0.000029486535,0.008044464],"study_design_scores_gemma":[0.00021954153,0.000003087166,0.000057918453,0.00009193918,0.000013949295,0.000031950647,0.000526319,0.92702425,0.0024420985,0.069441326,0.000027026317,0.00012062417],"about_ca_topic_score_codex":6.817073e-7,"about_ca_topic_score_gemma":0.0000015029606,"teacher_disagreement_score":0.3092081,"about_ca_system_score_codex":0.000027205235,"about_ca_system_score_gemma":0.000058485035,"threshold_uncertainty_score":0.45681623},"labels":[],"label_agreement":null},{"id":"W3173319990","doi":"10.1609/aaai.v35i5.16512","title":"Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies","year":2021,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":53,"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":"Institut de Valorisation des Données; Compute Canada; Canadian Institute for Advanced Research","keywords":"Branching (polymer chemistry); Generalization; Branch and bound; Computer science; Tree (set theory); Benchmark (surveying); Search tree; Integer programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Search algorithm; Algorithm; Combinatorics","score_opus":0.030937053087930263,"score_gpt":0.3004092617432398,"score_spread":0.2694722086553095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173319990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69903857,0.00018158361,0.29296985,0.00047769953,0.00011435071,0.00006029387,0.0000017238059,0.0003779286,0.006778036],"genre_scores_gemma":[0.832525,0.00004579211,0.16595684,0.00033496172,0.00007646538,0.0000046752752,0.0000026116422,0.00004074236,0.0010129298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910855,0.000086677945,0.00017721986,0.00018878416,0.00014110074,0.00029766044],"domain_scores_gemma":[0.9994439,0.00018631852,0.000007953611,0.00019687158,0.00004447281,0.000120498364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028519664,0.00012275124,0.00017222267,0.0001000809,0.000105177205,0.00020352982,0.00008120373,0.000054894488,0.00011986744],"category_scores_gemma":[0.00016170666,0.00013063462,0.00003605181,0.00037201814,0.000020770744,0.00012581926,0.00008303435,0.00015762071,0.00003426239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037261127,0.000010824851,0.006459753,0.000075990436,0.000048659713,0.000007993401,0.0026940347,0.7342113,0.17257133,0.00114716,0.0001976918,0.0825715],"study_design_scores_gemma":[0.0007702989,0.00006345731,0.06400644,0.00016029704,0.000033369488,0.000114403265,0.0013009893,0.6107487,0.312485,0.0004963033,0.008828674,0.0009920463],"about_ca_topic_score_codex":0.000052969615,"about_ca_topic_score_gemma":0.000052010793,"teacher_disagreement_score":0.13991366,"about_ca_system_score_codex":0.000032844502,"about_ca_system_score_gemma":0.00001765665,"threshold_uncertainty_score":0.5327125},"labels":[],"label_agreement":null},{"id":"W3173475768","doi":"10.1287/trsc.2021.1045","title":"Machine-learning-based column selection for column generation","year":2021,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":109,"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; Column (typography); Crew scheduling; Scheduling (production processes); Computer science; Selection (genetic algorithm); Vehicle routing problem; Mathematical optimization; Row and column spaces; Routing (electronic design automation); Artificial intelligence; Mathematics; Row","score_opus":0.01780381453618663,"score_gpt":0.2344738495249914,"score_spread":0.21667003498880477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173475768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11715135,0.00034395885,0.8557645,0.00066131674,0.00096223,0.000697194,0.00023925854,0.0009446936,0.023235472],"genre_scores_gemma":[0.86021674,0.00022792596,0.10580629,0.00030595594,0.000369405,0.000081608014,0.0013801116,0.0001516774,0.031460274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980159,0.00027409493,0.00032760607,0.0005469011,0.00029367488,0.0005418503],"domain_scores_gemma":[0.9989145,0.0002665658,0.00010084838,0.00024876563,0.0003294293,0.00013992639],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031685588,0.0003264493,0.00037043524,0.00023053249,0.00067958725,0.00009896877,0.00022580942,0.00015300153,0.00017182218],"category_scores_gemma":[0.00009877256,0.0004146059,0.00017143354,0.00052538665,0.00008933419,0.00019238146,0.00011852052,0.00030411032,0.00004644594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064058906,0.00011311777,0.012595416,0.00013837087,0.00021465722,0.00003870487,0.00020906796,0.962507,0.01283297,0.0064903544,0.0038118807,0.0009843812],"study_design_scores_gemma":[0.0014169858,0.00011680732,0.003397308,0.000029841756,0.00014831494,0.000038278875,0.00009849966,0.9107313,0.008598722,0.000059701346,0.07486447,0.0004997249],"about_ca_topic_score_codex":0.00001537041,"about_ca_topic_score_gemma":0.00022217269,"teacher_disagreement_score":0.7499582,"about_ca_system_score_codex":0.00031895438,"about_ca_system_score_gemma":0.0001599609,"threshold_uncertainty_score":0.9998306},"labels":[],"label_agreement":null},{"id":"W3175587957","doi":"10.3390/su13126940","title":"Optimization of Conventional and Green Vehicles Composition under Carbon Emission Cap","year":2021,"lang":"en","type":"article","venue":"Sustainability","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"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 Manitoba","funders":"","keywords":"Benchmark (surveying); Vehicle routing problem; Metaheuristic; Ant colony optimization algorithms; Computer science; Mathematical optimization; Variable (mathematics); Composition (language); Routing (electronic design automation); Operations research; Engineering; Algorithm; Mathematics; Embedded system","score_opus":0.00933232368733773,"score_gpt":0.25987730161910505,"score_spread":0.25054497793176733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175587957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80524355,0.00024709004,0.19337688,0.00046483226,0.0000703903,0.00014430437,0.0000058788387,0.00011935103,0.00032771777],"genre_scores_gemma":[0.9767855,0.000017057304,0.023005519,0.000012446638,0.00002111603,0.0000054900597,0.00004040208,0.000015333502,0.00009717034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991909,0.0001525979,0.00023506081,0.00016409604,0.0001320171,0.0001252927],"domain_scores_gemma":[0.9990929,0.00008561663,0.000039850936,0.00016586874,0.00056234514,0.000053422635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002963493,0.00008944637,0.00014305006,0.000046801713,0.000046963243,0.000014004662,0.0000379005,0.00008467513,0.000033351014],"category_scores_gemma":[0.00013724035,0.000102093836,0.000033627002,0.0002077255,0.00006747443,0.000079928635,0.00003992772,0.000087638495,8.497129e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011268716,0.000037629114,0.01637463,0.00045028396,0.00001730918,0.0000024273647,0.00016359035,0.97607875,0.0044143368,0.0007769721,0.00001113643,0.0016616418],"study_design_scores_gemma":[0.00038798552,0.000015022334,0.021425676,0.000026162863,0.000021786003,0.000007396487,0.00037020975,0.9561519,0.016695363,0.004745497,0.000027828119,0.00012515833],"about_ca_topic_score_codex":0.000038801172,"about_ca_topic_score_gemma":0.0000019210684,"teacher_disagreement_score":0.17154191,"about_ca_system_score_codex":0.0002229381,"about_ca_system_score_gemma":0.00010067739,"threshold_uncertainty_score":0.41632658},"labels":[],"label_agreement":null},{"id":"W3179633369","doi":"","title":"A Branch-And-Check Solution Method for a Tourist Trip Design Problem with Rich Constraints","year":2019,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal","funders":"","keywords":"Computer science; Tourism; Mathematical optimization; Mathematics; Geography","score_opus":0.02312201320111373,"score_gpt":0.25865185113404404,"score_spread":0.2355298379329303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179633369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015180288,0.0012649032,0.97045124,0.007835558,0.00029246352,0.0027415701,0.00012038466,0.00043486824,0.0153409755],"genre_scores_gemma":[0.06562445,0.00044636565,0.9230307,0.000055139877,0.000044261098,0.0003710127,0.00025702326,0.00016566605,0.010005382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9868016,0.009880835,0.00093924964,0.0011844516,0.00044406575,0.0007497612],"domain_scores_gemma":[0.98755187,0.007240947,0.0007149231,0.0016669291,0.0025299091,0.00029542742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.017018491,0.0006739287,0.00084892806,0.0002634909,0.0004612791,0.00051874574,0.0008195462,0.0006428357,0.00012652737],"category_scores_gemma":[0.0024538194,0.00074116857,0.00021874307,0.00058925175,0.00040165926,0.00023421101,0.00049681164,0.0009171489,0.00003339254],"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.00017705547,0.0006660857,0.001560508,0.0028186068,0.00080044096,0.0000051427933,0.020512657,0.3497083,0.011362293,0.12444812,0.0015325489,0.48640826],"study_design_scores_gemma":[0.002343004,0.000003360136,0.00079103163,0.003467326,0.00029662452,0.00006951813,0.00012894656,0.9482121,0.03282157,0.004047175,0.0068850815,0.0009343013],"about_ca_topic_score_codex":0.0005901208,"about_ca_topic_score_gemma":0.00023804672,"teacher_disagreement_score":0.59850377,"about_ca_system_score_codex":0.00039138983,"about_ca_system_score_gemma":0.00056332734,"threshold_uncertainty_score":0.9995039},"labels":[],"label_agreement":null},{"id":"W3181596661","doi":"10.1287/trsc.2022.1176","title":"Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Metaheuristic; Computer science; Vehicle routing problem; Mathematical optimization; Combinatorial optimization; Routing (electronic design automation); Traveling purchaser problem; Heuristic; 2-opt; Mathematics; Artificial intelligence; Computer network","score_opus":0.020268344787622763,"score_gpt":0.25714307200236775,"score_spread":0.23687472721474498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181596661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32097143,0.00016452334,0.677252,0.0002432969,0.00036575797,0.00046164467,0.0000332371,0.00023716433,0.00027093344],"genre_scores_gemma":[0.9263094,0.000032207117,0.07333547,0.00007872069,0.000026248304,0.00013594839,0.000007475953,0.000018925015,0.000055588713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894905,0.000024117388,0.00024245659,0.00021906423,0.00034337142,0.00022191244],"domain_scores_gemma":[0.9994064,0.00028181466,0.00004459678,0.00014857529,0.00006559826,0.000053023265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219824,0.000091608075,0.00008899943,0.00005783864,0.0007275656,0.00005858074,0.00027814053,0.000016882565,0.00007142961],"category_scores_gemma":[0.000030112222,0.000083634804,0.000037797905,0.00060174766,0.00012201269,0.00022710634,0.000007977354,0.000120915065,9.153301e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001000534,0.000008867509,0.0010826836,0.00002865651,0.0000083376735,6.061478e-7,0.0035438032,0.96215814,0.021020107,0.0026091642,0.00003389177,0.009495721],"study_design_scores_gemma":[0.000656446,0.000051060095,0.059005585,0.000010126095,0.000051499035,0.000004570145,0.001334376,0.93100905,0.005120205,0.00069800694,0.0017902307,0.00026882163],"about_ca_topic_score_codex":0.000013924296,"about_ca_topic_score_gemma":0.000009805669,"teacher_disagreement_score":0.605338,"about_ca_system_score_codex":0.000043968786,"about_ca_system_score_gemma":0.00006178426,"threshold_uncertainty_score":0.559592},"labels":[],"label_agreement":null},{"id":"W3183470606","doi":"","title":"Multiperiod Dispatching and Routing for On-Time Delivery in a Dynamic and Stochastic Environment.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Toronto","funders":"","keywords":"Computer science; Routing (electronic design automation); Set (abstract data type); Markov decision process; Mathematical optimization; TRIPS architecture; Operations research; Engineering; Computer network; Markov process; Mathematics","score_opus":0.025875795795027284,"score_gpt":0.17797134776877654,"score_spread":0.15209555197374927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183470606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56374764,0.000082866405,0.4357975,0.0000059386716,0.000053142503,0.00020577792,0.000016413009,0.00006778332,0.000022902188],"genre_scores_gemma":[0.98261255,0.00019021696,0.01700676,0.000011738333,0.000015129913,0.0000026901387,0.000034047225,0.000050970048,0.00007588798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988641,0.00008155956,0.00017269708,0.00058569934,0.000040131275,0.00025578283],"domain_scores_gemma":[0.9992536,0.00031556163,0.00006530638,0.00026283244,0.000015924377,0.00008679093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022829807,0.00026411182,0.00031756822,0.00017823682,0.00008604648,0.000066055785,0.00012971094,0.00021338358,0.000011113942],"category_scores_gemma":[0.00007240097,0.00035807365,0.000061425606,0.00010451566,0.000049674596,0.000105727646,0.00034378658,0.00040006608,0.000002261807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018478506,0.000016959582,0.0011101419,0.00012181637,0.000043985558,0.000029599616,0.00040274483,0.9965962,0.00031207752,0.00013716718,5.691083e-7,0.0012102427],"study_design_scores_gemma":[0.00065896683,0.00001656384,0.0025788362,0.000246818,0.000054528067,0.0000026711648,0.0002552466,0.9956131,0.000020107593,0.00022334403,0.0000024156336,0.00032737872],"about_ca_topic_score_codex":0.000029693172,"about_ca_topic_score_gemma":0.000020580228,"teacher_disagreement_score":0.41886488,"about_ca_system_score_codex":0.00023502509,"about_ca_system_score_gemma":0.000021425953,"threshold_uncertainty_score":0.9998871},"labels":[],"label_agreement":null},{"id":"W3184432724","doi":"10.4230/lipics.icalp.2021.67","title":"Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"University of Waterloo; University of Alberta","funders":"","keywords":"Rounding; Approximation algorithm; Combinatorics; Orienteering; Metric space; Path (computing); Constant (computer programming); Mathematics; Travelling salesman problem; Binary logarithm; Randomized rounding; Metric (unit); Point (geometry); Time complexity; Computer science; Discrete mathematics; Mathematical optimization","score_opus":0.014313825941000835,"score_gpt":0.2530143342341167,"score_spread":0.23870050829311584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184432724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57485,0.000202942,0.4137,0.000375602,0.00075505144,0.0019636152,0.00051111775,0.00067371025,0.0069679455],"genre_scores_gemma":[0.8211452,0.00008810379,0.17716977,0.00029867282,0.00005275013,0.00013383928,0.0006440945,0.00011870581,0.0003488635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756014,0.00006238796,0.0012690872,0.0002384337,0.00028214362,0.0005877947],"domain_scores_gemma":[0.99881095,0.00017203487,0.00016354151,0.00041006622,0.00022499006,0.00021841865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058185507,0.00035130355,0.00048030028,0.0003199277,0.000113318296,0.0002060419,0.0002050085,0.00027419676,0.000084200154],"category_scores_gemma":[0.00033490747,0.0003739687,0.000087322944,0.000682065,0.000051619492,0.0007246133,0.00013353096,0.00040395043,0.00006278894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020204455,0.0012828084,0.08994833,0.009265878,0.0009952569,0.000058441554,0.105148695,0.66341394,0.01074154,0.011720096,0.003090909,0.10413204],"study_design_scores_gemma":[0.0031786188,0.000118156895,0.0019946084,0.00041308143,0.00003216115,0.00012146584,0.0012675826,0.9831808,0.0035760682,0.0003515431,0.0050845547,0.00068132085],"about_ca_topic_score_codex":0.000006385709,"about_ca_topic_score_gemma":0.00002042737,"teacher_disagreement_score":0.31976688,"about_ca_system_score_codex":0.00019547087,"about_ca_system_score_gemma":0.00006150484,"threshold_uncertainty_score":0.99987125},"labels":[],"label_agreement":null},{"id":"W3186291209","doi":"10.1287/opre.2021.2185","title":"Single Allocation Hub Location with Heterogeneous Economies of Scale","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"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; Wilfrid Laurier University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Mathematical optimization; Quadratic growth; Linear programming; Piecewise; Lagrangian relaxation; Column generation; Economies of scale; Computer science; Constant function; Scale (ratio); Returns to scale; Consolidation (business); Scalability; Integer programming; Constant (computer programming); Mathematics; Production (economics); Economics; Algorithm","score_opus":0.05497484970647972,"score_gpt":0.33477250748693355,"score_spread":0.27979765778045385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186291209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7373689,0.00032438876,0.2559046,0.0003393096,0.0000655417,0.00022992134,0.000007366906,0.00010229368,0.005657706],"genre_scores_gemma":[0.90736234,0.000047619964,0.09171984,0.0000075468606,0.00003539922,0.000041832165,0.000047682668,0.000023818417,0.0007138925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991183,0.00016773195,0.00019478575,0.0001506822,0.0002010773,0.00016739448],"domain_scores_gemma":[0.9986842,0.0000830063,0.00000810399,0.00029572108,0.00088293775,0.000046019493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043912197,0.00006480522,0.000099066645,0.00013600066,0.00014207758,0.00009577774,0.00009217946,0.00005061036,0.00014308418],"category_scores_gemma":[0.00013092055,0.00006728402,0.00001525025,0.0006546322,0.000071193856,0.00016968223,0.00002812471,0.000121871024,0.000032011558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027860867,0.000038550625,0.00021636723,0.000035089524,0.000015312167,0.0000010277652,0.00030501315,0.9441539,0.05094326,0.00028987727,0.000053666132,0.003945125],"study_design_scores_gemma":[0.00013713652,0.000043600245,0.0003669531,0.000027968988,0.0000039740653,0.000012455497,0.0002272597,0.5825557,0.41613084,0.000017498875,0.00040298185,0.00007361915],"about_ca_topic_score_codex":0.000030495337,"about_ca_topic_score_gemma":0.00049785007,"teacher_disagreement_score":0.3651876,"about_ca_system_score_codex":0.000109997985,"about_ca_system_score_gemma":0.00013576957,"threshold_uncertainty_score":0.27437627},"labels":[],"label_agreement":null},{"id":"W3187408980","doi":"10.48550/arxiv.2009.14628","title":"Meta Partial Benders Decomposition for the Logistics Service Network\\n Design Problem","year":2020,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Benders' decomposition; Decomposition; Computer science; Benchmark (surveying); Mathematical optimization; Service (business); Operations research; Scheme (mathematics); Product (mathematics); Reverse logistics; Decomposition method (queueing theory); Network planning and design; Supply chain; Engineering; Mathematics; Computer network","score_opus":0.2511091973975603,"score_gpt":0.23398495898147642,"score_spread":0.017124238416083903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187408980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030078407,0.0003758313,0.9952608,0.0017521657,0.00039522353,0.0013310978,0.000036270663,0.0003305063,0.00021737283],"genre_scores_gemma":[0.79780364,0.00033429227,0.2002342,0.0009750223,0.00045625825,0.00000627269,0.000021687241,0.000090863985,0.000077780074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974975,0.0005247283,0.00042122396,0.0007288265,0.00010483285,0.00072288566],"domain_scores_gemma":[0.9970585,0.0016082699,0.0002410586,0.00048350598,0.00029726652,0.00031137065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009152652,0.0004512772,0.0005086489,0.00005485177,0.0006303721,0.0001393415,0.0007377049,0.00026848633,0.00018135816],"category_scores_gemma":[0.00010743039,0.00045939785,0.00034508973,0.0015012096,0.00010510523,0.0003253452,0.00018830982,0.00042465594,0.000052471845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002490543,0.000032164033,0.000066747954,0.0001809019,0.0021440953,0.000019730658,0.00040759155,0.9678879,0.000069496506,0.02790614,0.0006743034,0.00036188512],"study_design_scores_gemma":[0.0010480214,0.00015497133,0.000020539408,0.000024737386,0.0064011514,0.0000025734507,0.0002356042,0.9869902,0.00029988037,0.0030318783,0.001310084,0.0004803465],"about_ca_topic_score_codex":0.00003105562,"about_ca_topic_score_gemma":0.000015033963,"teacher_disagreement_score":0.7975028,"about_ca_system_score_codex":0.00016898227,"about_ca_system_score_gemma":0.00011293482,"threshold_uncertainty_score":0.9997858},"labels":[],"label_agreement":null},{"id":"W3187835696","doi":"10.1109/cec45853.2021.9504700","title":"Caching and Vectorization Schemes to Accelerate Local Search Algorithms for Assignment Problems","year":2021,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Computer science; Quadratic assignment problem; Leverage (statistics); Solver; Parallel computing; Vectorization (mathematics); Assignment problem; Local search (optimization); Weapon target assignment problem; Block (permutation group theory); Algorithm; Optimization problem; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.04627111951563646,"score_gpt":0.30776134058308147,"score_spread":0.261490221067445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187835696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010343916,0.00007631847,0.9882356,0.00022114058,0.00013499252,0.00024838786,0.0000037496513,0.0001988166,0.00053708133],"genre_scores_gemma":[0.48294702,0.000017549546,0.51644003,0.000071887385,0.00006488312,0.000042128282,0.000017762948,0.000032179094,0.00036653876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993354,0.000037054568,0.00014479345,0.00017649261,0.000115161245,0.00019109463],"domain_scores_gemma":[0.9996434,0.00007498354,0.000008038035,0.00009879298,0.00009548052,0.00007933599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030474094,0.00008945914,0.000103814855,0.00004692727,0.00007308779,0.000093916206,0.000042984713,0.00004897585,0.000036595095],"category_scores_gemma":[0.00005585778,0.0000928385,0.000016347434,0.00020753047,0.0000074519085,0.00009606596,0.000041195908,0.00007209003,0.0000034976772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013364532,0.0000072319217,0.0001814093,0.0000701808,0.000016796346,9.720816e-7,0.0002137579,0.93714535,0.023927746,0.0003719817,0.000107152315,0.037956063],"study_design_scores_gemma":[0.00021401118,0.000018799967,0.00012894406,0.000020411553,0.0000052549353,0.000003231176,0.000081148755,0.88740414,0.11013918,0.00003213503,0.0018388014,0.00011395897],"about_ca_topic_score_codex":0.000006120126,"about_ca_topic_score_gemma":0.0000040489913,"teacher_disagreement_score":0.4726031,"about_ca_system_score_codex":0.000070849106,"about_ca_system_score_gemma":0.000023527715,"threshold_uncertainty_score":0.3785844},"labels":[],"label_agreement":null},{"id":"W3190147417","doi":"10.1016/j.eswa.2021.115683","title":"Solving the battery swap station location-routing problem with a mixed fleet of electric and conventional vehicles using a heuristic branch-and-price algorithm with an adaptive selection scheme","year":2021,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Key Research and Development Program of China; Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Swap (finance); Computer science; Scheme (mathematics); Selection (genetic algorithm); Heuristic; Mathematical optimization; Vehicle routing problem; Routing (electronic design automation); Algorithm; Computer network; Artificial intelligence; Mathematics; Finance","score_opus":0.015929789995386485,"score_gpt":0.2521296384471959,"score_spread":0.23619984845180939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190147417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07056713,0.00091237394,0.92750716,0.00004123267,0.000016364238,0.0007596247,0.000008781351,0.00013899305,0.00004831919],"genre_scores_gemma":[0.66436213,0.000018944693,0.3350356,0.000012158324,0.00006111497,0.0004265203,0.000028551474,0.000041086347,0.000013886106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868655,0.0001654942,0.00033969778,0.0003342842,0.00026014645,0.00021381442],"domain_scores_gemma":[0.99871284,0.00022500895,0.0002102414,0.00021359442,0.00056400464,0.00007430799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032731454,0.00019374109,0.00022780252,0.00010621968,0.0003469253,0.000109261826,0.000073819174,0.00006150591,0.0000023510806],"category_scores_gemma":[0.000018002978,0.00014905186,0.000013027783,0.0009962481,0.00007582616,0.0002652705,0.000016437301,0.000154634,5.1308234e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012821701,0.00019295551,0.00902691,0.0007118633,0.0005824411,0.0000033838978,0.0045460714,0.8989822,0.06823934,0.0060852896,0.000038708502,0.011462571],"study_design_scores_gemma":[0.00053167733,0.00011071692,0.0022551226,0.00026957085,0.000052364343,0.00023682199,0.0014511162,0.9915899,0.003203672,0.00003148269,0.000048847847,0.00021867722],"about_ca_topic_score_codex":0.00013948188,"about_ca_topic_score_gemma":0.000031587453,"teacher_disagreement_score":0.593795,"about_ca_system_score_codex":0.000102788465,"about_ca_system_score_gemma":0.00016488694,"threshold_uncertainty_score":0.60781586},"labels":[],"label_agreement":null},{"id":"W3190827665","doi":"10.5267/j.dsl.2021.6.001","title":"A hybrid FJA-ALNS algorithm for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles for the fuel delivery problem","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Khon Kaen University","keywords":"Algorithm; Vehicle routing problem; Hybrid algorithm (constraint satisfaction); Computer science; Heuristic; Mathematical optimization; Mathematics; Routing (electronic design automation)","score_opus":0.02836788013487987,"score_gpt":0.2811055917875958,"score_spread":0.25273771165271597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190827665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2003916,0.00021864753,0.79708916,0.0010334909,0.0001847243,0.00096190703,0.000023949431,0.00008978061,0.0000067175806],"genre_scores_gemma":[0.40255383,0.000013221361,0.5966534,0.000524351,0.000043131928,0.00016902322,0.0000030331912,0.000032398573,0.000007644548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976855,0.000057398174,0.0005237903,0.0004899598,0.00065574876,0.00058759644],"domain_scores_gemma":[0.99702454,0.0017805127,0.00017083013,0.00056322943,0.00037343075,0.000087486405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023574017,0.00022497705,0.00027363785,0.000110116154,0.0006481572,0.00028890587,0.00073224783,0.000034037388,0.0000038586836],"category_scores_gemma":[0.0002355427,0.0001396765,0.00014244986,0.0006918243,0.00030070936,0.00027560085,0.00015804768,0.00015244294,0.0000019601882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018751278,0.000033519595,0.00019104332,0.00003711177,0.000043820157,0.000005402647,0.0007940922,0.81911325,0.054340903,0.000030681753,0.00027436178,0.12511705],"study_design_scores_gemma":[0.00085008994,0.000047848902,0.00023263793,0.00010451969,0.0000401757,0.00004148692,0.0002387494,0.93047506,0.06688418,0.00009382969,0.0008039801,0.00018746135],"about_ca_topic_score_codex":0.000008567384,"about_ca_topic_score_gemma":0.0000098731125,"teacher_disagreement_score":0.2021622,"about_ca_system_score_codex":0.00012673979,"about_ca_system_score_gemma":0.00010381826,"threshold_uncertainty_score":0.5695842},"labels":[],"label_agreement":null},{"id":"W3191258758","doi":"10.5267/j.dsl.2021.5.003","title":"An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Computer science; Genetic algorithm; Constraint (computer-aided design); Tree traversal; 2-opt; Integer programming; Algorithm; Mathematics","score_opus":0.019935957969724697,"score_gpt":0.2902609772048175,"score_spread":0.27032501923509283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191258758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28681397,0.00002029101,0.7123448,0.000093731804,0.00018740422,0.00036180846,0.0000065458607,0.000104355626,0.00006708437],"genre_scores_gemma":[0.32432655,0.000002317794,0.6752782,0.00030101306,0.000034559052,0.000024275683,0.0000028819463,0.000027320164,0.0000028858558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977539,0.000038818715,0.00037786286,0.00062792416,0.0006657226,0.0005357436],"domain_scores_gemma":[0.99855435,0.000439247,0.000070503345,0.00046379704,0.0002713959,0.00020068792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019479847,0.0001871826,0.00023178985,0.0001505957,0.00040752444,0.0007172506,0.00074342836,0.000046282366,0.000015561089],"category_scores_gemma":[0.00023367767,0.00017261598,0.000041431933,0.0009338669,0.00020716985,0.0003267064,0.00010674529,0.00014518309,0.000005737085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034817292,0.000013661051,0.00029651582,0.0000073445885,0.000004211145,0.000016906268,0.00043823518,0.7617692,0.10343201,0.000011292358,0.000021771973,0.13398537],"study_design_scores_gemma":[0.0007208026,0.000029336354,0.0013642709,0.00012195957,0.0000088314555,0.0000588214,0.0002610113,0.96390325,0.033137918,0.000025501478,0.00011079276,0.00025752757],"about_ca_topic_score_codex":0.000007417595,"about_ca_topic_score_gemma":0.000008103002,"teacher_disagreement_score":0.20213403,"about_ca_system_score_codex":0.00023355377,"about_ca_system_score_gemma":0.0002148472,"threshold_uncertainty_score":0.70390755},"labels":[],"label_agreement":null},{"id":"W3191774642","doi":"10.1016/j.jii.2021.100246","title":"Bi-level programming for home health care supply chain considering outsourcing","year":2021,"lang":"en","type":"article","venue":"Journal of Industrial Information Integration","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":false,"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":"Stackelberg competition; Heuristics; Outsourcing; Supply chain; Health care; Novelty; Business; Operations management; Computer science; Operations research; Marketing; Economics; Microeconomics; Engineering; Psychology","score_opus":0.06443391656776795,"score_gpt":0.303664331238838,"score_spread":0.23923041467107006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191774642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014603525,0.00020716075,0.98111165,0.00086530007,0.002562929,0.00036415414,0.00004081113,0.000098340046,0.00014612539],"genre_scores_gemma":[0.5807736,0.00006497038,0.41747886,0.00030691514,0.0010162583,0.00002713339,0.00025977014,0.000038631006,0.000033865384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980762,0.00009547372,0.0012668545,0.00006100509,0.0002776836,0.00022279582],"domain_scores_gemma":[0.9979611,0.00016872717,0.0006176047,0.000105758765,0.0010371231,0.00010967832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061069,0.0001498739,0.00031101023,0.0003429911,0.0001432566,0.0002676277,0.000093853334,0.00017548338,0.000019249832],"category_scores_gemma":[0.0012138204,0.0001464247,0.00013255146,0.00037523155,0.000014128203,0.0014462327,0.000014349623,0.00042839083,0.0000025546385],"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.00004982604,0.000011116199,0.0003264593,0.00011539548,0.000065107095,0.0000015105502,0.010412768,0.39966288,0.00044493325,0.00053554395,0.004523362,0.5838511],"study_design_scores_gemma":[0.012119213,0.0010650895,0.0005082062,0.0028236296,0.00015644751,0.0005937563,0.08824216,0.66113514,0.09624729,0.00027122453,0.13559085,0.0012469947],"about_ca_topic_score_codex":0.000008531406,"about_ca_topic_score_gemma":0.000012527869,"teacher_disagreement_score":0.5826041,"about_ca_system_score_codex":0.00046211545,"about_ca_system_score_gemma":0.00043553486,"threshold_uncertainty_score":0.5971026},"labels":[],"label_agreement":null},{"id":"W3192094171","doi":"10.1007/978-3-030-76724-2_30","title":"Home Health Care Services Management: Districting Problem Revisited","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in management and industrial engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Ottawa","funders":"","keywords":"Heuristic; Workload; Mathematical optimization; Computer science; Crew; Integer (computer science); Integer programming; Operations research; Assignment problem; Function (biology); Mathematics; Engineering","score_opus":0.014480454550387897,"score_gpt":0.22654076287118943,"score_spread":0.21206030832080153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192094171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031777265,0.047474146,0.66090554,0.00048821577,0.0031847802,0.0052725705,0.00015157953,0.003229523,0.27897584],"genre_scores_gemma":[0.08475376,0.04726291,0.8064052,0.00094861427,0.0059904777,0.00044439777,0.0054912274,0.0028573133,0.04584612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792093,0.00002849742,0.00067482534,0.0005719475,0.00030168932,0.0005020827],"domain_scores_gemma":[0.9992431,0.00009214423,0.0001356687,0.00038330205,0.000032966094,0.000112846945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027720272,0.0006107848,0.0006986714,0.00063322537,0.000090142945,0.00018969204,0.00024346806,0.0004805275,0.000063629835],"category_scores_gemma":[0.000012275151,0.00071575696,0.00010272677,0.00039818225,0.000013612361,0.00011553045,0.00024714865,0.0009775085,0.0000041261183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008084023,0.0000045121647,0.00007180644,0.007172996,0.00035865817,0.00009748446,0.00037460556,0.811202,0.0000033406266,0.0071025994,0.00009063716,0.17351328],"study_design_scores_gemma":[0.010043359,0.00025579857,0.00029065792,0.040189486,0.0013251237,0.000049838767,0.00051041873,0.54242337,0.00020727627,0.0037238598,0.39332414,0.0076567004],"about_ca_topic_score_codex":0.0000070379733,"about_ca_topic_score_gemma":0.000005578865,"teacher_disagreement_score":0.39323348,"about_ca_system_score_codex":0.00037117535,"about_ca_system_score_gemma":0.0000105087365,"threshold_uncertainty_score":0.99952936},"labels":[],"label_agreement":null},{"id":"W3196241247","doi":"10.1007/s11356-021-15907-x","title":"A multiobjective model for the green capacitated location-routing problem considering drivers’ satisfaction and time window with uncertain demand","year":2021,"lang":"en","type":"article","venue":"Environmental Science and Pollution Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Genetic algorithm; Vehicle routing problem; Sorting; Computer science; Routing (electronic design automation); Facility location problem; Integer programming; Operations research; Mathematics; Algorithm","score_opus":0.03675962874608778,"score_gpt":0.29468325688427316,"score_spread":0.25792362813818537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196241247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79578143,0.0002047332,0.20253365,0.0005817166,0.00001885411,0.0006310308,0.000020098845,0.00004844767,0.00018002282],"genre_scores_gemma":[0.9759618,0.000076648095,0.023690082,0.000026818157,0.000012875091,0.0000402304,0.0000029393148,0.000010240452,0.00017837153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890983,0.00008206905,0.000102219936,0.00024163083,0.0003866101,0.0002776438],"domain_scores_gemma":[0.99954194,0.0001899356,0.00002092463,0.00010264885,0.00006663016,0.0000778973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014739931,0.00008000518,0.000070894195,0.000082319726,0.0009210433,0.000100088786,0.00005205487,0.000035812744,0.000010100422],"category_scores_gemma":[0.00010659678,0.000063996675,0.000008251312,0.00043315318,0.00071662053,0.0002957497,0.00005873305,0.00014988724,0.0000026996024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013090766,0.000007806961,0.00603855,0.000020949434,0.00001765424,0.0000011342538,0.004260872,0.83166534,0.1451333,0.00016088867,0.000013093741,0.012667341],"study_design_scores_gemma":[0.00032847244,0.000027517312,0.0321465,0.00002234724,0.000007259302,0.000017758059,0.001881085,0.959678,0.0056552906,0.00013210275,0.000019820942,0.00008386048],"about_ca_topic_score_codex":0.00010165339,"about_ca_topic_score_gemma":0.000053774977,"teacher_disagreement_score":0.18018036,"about_ca_system_score_codex":0.00025474955,"about_ca_system_score_gemma":0.000092466034,"threshold_uncertainty_score":0.7084013},"labels":[],"label_agreement":null},{"id":"W3199751886","doi":"10.5539/jmr.v13n5p14","title":"A Comprehensive Comparison of Label Setting Algorithm and Dynamic Programming Algorithm in Solving Shortest Path Problems","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Shortest path problem; Computer science; Algorithm; Dynamic programming; K shortest path routing; Path (computing); Mathematical optimization; Mathematics; Theoretical computer science; Graph; Computer network","score_opus":0.07689474368349493,"score_gpt":0.4005593809347281,"score_spread":0.3236646372512332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199751886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21686122,0.0036914686,0.7787805,0.00009151456,0.00010171987,0.00031534547,0.000006800564,0.00003391586,0.00011749147],"genre_scores_gemma":[0.1090749,0.0002859008,0.8905435,0.0000018622393,0.000029827637,0.000005272556,0.000001979023,0.00004056001,0.000016151864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740547,0.0002800517,0.0010237644,0.00013060197,0.0007726355,0.0003874896],"domain_scores_gemma":[0.99734944,0.0011452006,0.00023457417,0.00017522626,0.0009860558,0.00010950876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030959279,0.00013756583,0.0005384326,0.00040622393,0.000073750954,0.00010396503,0.00018869643,0.000101705635,0.0000082523375],"category_scores_gemma":[0.00058689463,0.00013423874,0.00005226218,0.0007155267,0.000081436,0.00015148497,0.00013759873,0.0009230954,8.8884667e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003982924,0.0007063288,0.0032886239,0.0026830968,0.00019164392,0.00020733487,0.013352807,0.15630248,0.02200054,0.0000680682,0.00006448761,0.8011306],"study_design_scores_gemma":[0.00053363387,0.000092637965,0.0004242454,0.0011344055,0.000013739676,0.00018765031,0.0052669765,0.9897014,0.0019973381,0.0004768196,0.000059984675,0.00011114866],"about_ca_topic_score_codex":0.0000043411883,"about_ca_topic_score_gemma":0.000004966249,"teacher_disagreement_score":0.83339894,"about_ca_system_score_codex":0.00013764814,"about_ca_system_score_gemma":0.00011468698,"threshold_uncertainty_score":0.5474097},"labels":[],"label_agreement":null},{"id":"W3202848248","doi":"10.1016/j.cie.2021.107723","title":"Efficient flow models for the uncapacitated multiple allocation p-hub median problem on non-triangular networks","year":2021,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","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":"Royal Military College of Canada","funders":"","keywords":"Solver; Mathematical optimization; Triangle inequality; Mathematics; Flow network; Maximum flow problem; Linear programming; Flow (mathematics); Graph; Integer programming; Computer science; Combinatorics","score_opus":0.03162924463575501,"score_gpt":0.22251291745337867,"score_spread":0.19088367281762367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202848248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050549493,0.00015385775,0.98992497,0.00024034402,0.0032868166,0.0007657902,0.000012738904,0.00052098156,0.000039537274],"genre_scores_gemma":[0.70874,0.000019992562,0.28920135,0.00007059943,0.0015299349,0.00015808108,0.000114298295,0.0001417046,0.00002403944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985424,0.000052187104,0.00041517537,0.0003109841,0.00022398279,0.0004552341],"domain_scores_gemma":[0.9982749,0.0010203288,0.00005425293,0.00038371806,0.00013850757,0.00012826773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006063651,0.0002867698,0.00028559682,0.0001214784,0.00013503029,0.00012190359,0.00025966545,0.00026446753,0.0000047108074],"category_scores_gemma":[0.00026252642,0.0002737231,0.00012987724,0.0006318682,0.000018255745,0.00006535844,0.000050831695,0.0004823373,0.0000030261062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014271246,0.000017054726,0.0000032085454,0.00002459357,0.00010373232,0.00000387636,0.00025347562,0.97512674,0.00055768545,0.00014807918,0.00064913346,0.023098154],"study_design_scores_gemma":[0.0015966939,0.000029027271,0.000011237912,0.00015494297,0.000039054794,0.0000046979526,0.000029473873,0.9949383,0.0020533479,0.00001190008,0.0008444942,0.00028679677],"about_ca_topic_score_codex":0.0000049310497,"about_ca_topic_score_gemma":0.0000014051907,"teacher_disagreement_score":0.70368505,"about_ca_system_score_codex":0.00019254196,"about_ca_system_score_gemma":0.000053027743,"threshold_uncertainty_score":0.9999715},"labels":[],"label_agreement":null},{"id":"W3204221696","doi":"10.1016/j.orl.2022.01.018","title":"Guidelines for the computational testing of machine learning approaches to vehicle routing problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"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":"Heuristics; Vehicle routing problem; Computer science; Routing (electronic design automation); Work (physics); Machine learning; Management science; Operations research; Engineering","score_opus":0.38072239786165063,"score_gpt":0.3906359972719764,"score_spread":0.009913599410325769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204221696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07793654,0.0001239726,0.9038987,0.016616184,0.00008239972,0.001010269,0.000036807614,0.00013717027,0.00015791888],"genre_scores_gemma":[0.60226786,0.0000015544485,0.39664906,0.00025076602,0.00008175218,0.0005593747,0.000042195865,0.0000370029,0.00011042601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831474,0.00035820977,0.0003557861,0.00017980605,0.0004955992,0.00029584952],"domain_scores_gemma":[0.99800926,0.0013792247,0.000019417794,0.00016543898,0.0003794681,0.00004717313],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039905556,0.00008800356,0.00011002088,0.00019569196,0.00140151,0.00010410637,0.00029877672,0.000016060212,0.000033697284],"category_scores_gemma":[0.0024603882,0.00007897461,0.00003736222,0.0010073244,0.000047963575,0.000087542525,0.0001765456,0.00041751645,0.0000028343293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033654414,0.000010791064,0.0006260025,0.000022886445,0.000022575761,2.2959587e-7,0.0007935879,0.9815492,0.010189262,0.00045858114,0.0009454181,0.005378068],"study_design_scores_gemma":[0.00017524221,0.000045658457,0.00015154439,0.00001224393,0.0000044321787,0.0000029467176,0.00044497754,0.9963211,0.00044803607,0.000018412973,0.0022910612,0.000084358515],"about_ca_topic_score_codex":0.00012770444,"about_ca_topic_score_gemma":0.000015151826,"teacher_disagreement_score":0.52433133,"about_ca_system_score_codex":0.000115117335,"about_ca_system_score_gemma":0.000052272288,"threshold_uncertainty_score":0.99989855},"labels":[],"label_agreement":null},{"id":"W3205122045","doi":"10.1002/net.22112","title":"The consistent production routing problem","year":2022,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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; Consistency (knowledge bases); Computer science; Routing (electronic design automation); Local consistency; Production (economics); Heuristic; Consistency model; Linear programming; Mathematics; Data consistency; Distributed computing; Constraint satisfaction; Probabilistic logic","score_opus":0.011754787796061596,"score_gpt":0.22163534045340202,"score_spread":0.20988055265734043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205122045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033428505,0.003836206,0.90747535,0.0026585213,0.01042742,0.0014772459,0.0000034399736,0.0032062377,0.037487093],"genre_scores_gemma":[0.98508805,0.00005156992,0.013615886,0.000054404878,0.00032629474,0.00010756132,0.0000056489703,0.000035186236,0.00071542495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992574,0.00012753272,0.0001632422,0.00011210691,0.00013196563,0.00020778103],"domain_scores_gemma":[0.99964434,0.00009004565,0.000034335797,0.00018385402,0.000023589513,0.000023832301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087266235,0.00006858355,0.0000621839,0.000016371172,0.00062535866,0.00004071305,0.000114170696,0.000021523927,0.000029249142],"category_scores_gemma":[0.000037056074,0.00006020413,0.00002930039,0.0002527366,0.000018769631,0.00003186847,0.000067161636,0.00029912512,0.000002627894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021903722,0.0000031795917,0.0003039475,0.0000025990087,0.000011645654,5.1233997e-7,0.000096830365,0.9655225,0.000032695618,0.00051158335,0.0042729285,0.029239355],"study_design_scores_gemma":[0.000061357285,0.000009082506,0.00018022636,0.0000041081194,0.000006739934,0.000014344952,0.00013142414,0.972374,0.000038915303,0.00007885481,0.02702343,0.00007750632],"about_ca_topic_score_codex":0.0000018680126,"about_ca_topic_score_gemma":0.0000021711448,"teacher_disagreement_score":0.9516595,"about_ca_system_score_codex":0.00009690973,"about_ca_system_score_gemma":0.000008859164,"threshold_uncertainty_score":0.48098162},"labels":[],"label_agreement":null},{"id":"W3205317538","doi":"10.5267/j.ijiec.2021.6.001","title":"A granular tabu search for the refrigerated vehicle routing problem with homogeneous fleet","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Vehicle routing problem; Benchmark (surveying); Energy consumption; Homogeneous; Computer science; Mathematical optimization; Selection (genetic algorithm); Routing (electronic design automation); Truck; Operations research; Engineering; Automotive engineering; Mathematics; Artificial intelligence; Computer network","score_opus":0.033558854195274,"score_gpt":0.2816800808341932,"score_spread":0.24812122663891922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205317538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06741128,0.00019783259,0.9294805,0.0012589715,0.0012731365,0.00018927497,0.00002772724,0.00010538429,0.00005589049],"genre_scores_gemma":[0.8672597,0.000026320822,0.13155557,0.000035335084,0.0009922578,0.00001357606,0.000025945943,0.000057088982,0.00003423283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873525,0.000052082094,0.00046811596,0.00011323534,0.000424879,0.00020643928],"domain_scores_gemma":[0.99766845,0.00073668757,0.00011725435,0.00011039615,0.0012880854,0.00007915055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005831814,0.00014589587,0.0001930269,0.00017904889,0.00010583307,0.00020209765,0.00032154637,0.00008665278,0.000014009041],"category_scores_gemma":[0.00027193036,0.00011945965,0.00010442775,0.00044521672,0.00002152649,0.00016262491,0.0000325455,0.00043566272,0.0000015532338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029694738,0.000021440697,0.00022662788,0.0000071335635,0.00028471847,0.00004991068,0.00021697213,0.9884347,0.0025452927,0.00053005555,0.0002376966,0.0074157678],"study_design_scores_gemma":[0.0015931115,0.000058726968,0.0001399642,0.00016629226,0.00005990633,0.0003889771,0.00011404113,0.984421,0.010384883,0.00002772491,0.0024969503,0.00014837955],"about_ca_topic_score_codex":0.0000049968094,"about_ca_topic_score_gemma":0.0000019331283,"teacher_disagreement_score":0.7998484,"about_ca_system_score_codex":0.00016412135,"about_ca_system_score_gemma":0.00021941194,"threshold_uncertainty_score":0.48714232},"labels":[],"label_agreement":null},{"id":"W3205680747","doi":"10.1155/2021/6619539","title":"Two-Echelon Multidepot Logistics Network Design with Resource Sharing","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Crossover; Mathematical optimization; Computer science; Sorting; Genetic algorithm; Greedy algorithm; Operations research; Cluster analysis; Engineering; Mathematics; Algorithm","score_opus":0.023175313279072973,"score_gpt":0.2695580455629636,"score_spread":0.24638273228389063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205680747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054770708,0.0004081957,0.94432193,0.000029678766,0.00019788684,0.00006503076,0.0000017684179,0.00007321237,0.00013159162],"genre_scores_gemma":[0.35014668,0.00008643132,0.64956,0.00002261368,0.000120474855,0.0000013841055,0.000010418464,0.000032048833,0.000019973737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894077,0.00004929891,0.0004859704,0.000113297516,0.00022710858,0.00018353497],"domain_scores_gemma":[0.9991672,0.0001580018,0.00020743745,0.00012410001,0.00026640136,0.00007683341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039114628,0.00012559588,0.00021947423,0.000057237867,0.000052793323,0.000025777897,0.00009096704,0.000050848834,0.000012432287],"category_scores_gemma":[0.000066122666,0.00012087592,0.000053665954,0.00035448087,0.000015798954,0.0002390264,0.0000015935692,0.00027270569,7.819849e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008030364,0.000013053635,0.0017127843,0.00003599336,0.00004547245,0.00015189995,0.00038519918,0.9878609,0.0045609954,0.00013082444,0.000020794809,0.0050017466],"study_design_scores_gemma":[0.008231789,0.0005070039,0.08380018,0.0015409209,0.00057230616,0.00042220284,0.0019416633,0.80995756,0.086973466,0.0022656815,0.0026592654,0.0011279314],"about_ca_topic_score_codex":6.5485216e-7,"about_ca_topic_score_gemma":0.0000124241005,"teacher_disagreement_score":0.29537597,"about_ca_system_score_codex":0.00006151142,"about_ca_system_score_gemma":0.000041237578,"threshold_uncertainty_score":0.49291772},"labels":[],"label_agreement":null},{"id":"W3207420437","doi":"10.5267/j.ijiec.2021.8.001","title":"Cockpit crew pairing Pareto optimisation in a budget airline","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chulalongkorn University","keywords":"Crew; Cockpit; Crew scheduling; Pareto principle; Computer science; Operations research; Reliability engineering; Mathematical optimization; Aeronautics; Engineering; Operations management; Mathematics","score_opus":0.03306707408553632,"score_gpt":0.287297977414064,"score_spread":0.25423090332852766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207420437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30389565,0.00028940072,0.6900583,0.0011813721,0.0041041323,0.000099072335,0.000021174823,0.00015768189,0.00019323135],"genre_scores_gemma":[0.91301906,0.00005831795,0.085716866,0.00004337012,0.0010696993,0.0000043977743,0.00004441144,0.00002804727,0.000015853791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985606,0.000060360202,0.0007024552,0.00011194997,0.00039404712,0.00017056015],"domain_scores_gemma":[0.9987291,0.00038101317,0.0001450894,0.00007878563,0.0005731902,0.00009279539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045776065,0.00014867229,0.00023900965,0.0003712666,0.000022405815,0.00010236091,0.0002410857,0.0001228893,0.000052014333],"category_scores_gemma":[0.0008096411,0.00016094338,0.000103402184,0.00048422604,0.0000093562185,0.00028392702,0.000039604573,0.00048437854,0.0000037462785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009405011,0.0000340996,0.0012577944,0.0000064477617,0.00010771648,0.00011518723,0.00014836465,0.98276633,0.0017916411,0.00019596968,0.00031770754,0.013249338],"study_design_scores_gemma":[0.0014062319,0.000023940087,0.0018431657,0.00030015974,0.000019791925,0.00023241295,0.000083592124,0.9901697,0.0030055633,0.00007034611,0.002657219,0.00018788937],"about_ca_topic_score_codex":0.000005429783,"about_ca_topic_score_gemma":0.0000062321005,"teacher_disagreement_score":0.6091234,"about_ca_system_score_codex":0.00031753135,"about_ca_system_score_gemma":0.00013628148,"threshold_uncertainty_score":0.65630805},"labels":[],"label_agreement":null},{"id":"W3211240821","doi":"10.1155/2021/8711964","title":"Study on the Optimization of Hub-and-Spoke Logistics Network regarding Traffic Congestion","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spoke-hub distribution paradigm; Network traffic control; Computer science; Network planning and design; Traffic congestion; Flow network; Operations research; Transport engineering; Computer network; Engineering; Mathematical optimization","score_opus":0.024728834219215574,"score_gpt":0.27574437810458213,"score_spread":0.25101554388536657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211240821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.561601,0.00020303021,0.43757135,0.00008371116,0.00034724982,0.00011683637,0.0000027834528,0.000026428312,0.000047638496],"genre_scores_gemma":[0.9105447,0.00027136257,0.08905174,0.000015972091,0.00007920396,0.0000022273746,0.000008578177,0.000020312498,0.000005908763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989353,0.000108989225,0.0005459791,0.00008440898,0.00022606156,0.00009927123],"domain_scores_gemma":[0.9989775,0.00028965622,0.00027354684,0.000104260944,0.00032025288,0.00003479063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468475,0.00010025862,0.00021542546,0.00006124354,0.000057112175,0.000016185097,0.000059119695,0.000048620324,0.000008972851],"category_scores_gemma":[0.0001716157,0.000083558734,0.00005377022,0.00030587582,0.000022005204,0.00015468268,0.0000013242427,0.0001975511,1.6332321e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042273976,0.00004112624,0.0010112916,0.000022502372,0.00005126597,0.000016009477,0.0010762688,0.9941466,0.0004356175,0.00030480858,0.000011229146,0.002841025],"study_design_scores_gemma":[0.005032549,0.0010966668,0.2760333,0.000886424,0.00074399315,0.00007088555,0.011774455,0.6978118,0.005262399,0.00053555483,0.00018843223,0.0005635179],"about_ca_topic_score_codex":1.7771737e-7,"about_ca_topic_score_gemma":0.0000043312602,"teacher_disagreement_score":0.34894374,"about_ca_system_score_codex":0.00003232208,"about_ca_system_score_gemma":0.000024231542,"threshold_uncertainty_score":0.34074265},"labels":[],"label_agreement":null},{"id":"W3213457727","doi":"10.48550/arxiv.2111.04536","title":"Network Migration Problem: A Logic-based Benders Decomposition Approach Driven by Column Generation and Constraint Programming","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","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":"University of Toronto","funders":"","keywords":"Column generation; Constraint programming; Computer science; Upgrade; Purchasing; Mathematical optimization; Integer programming; Constraint logic programming; Node (physics); Constraint (computer-aided design); Stochastic programming; Engineering; Mathematics; Operations management; Algorithm","score_opus":0.05995537691616206,"score_gpt":0.20210791226161792,"score_spread":0.14215253534545585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213457727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1720016,0.0001515102,0.82636297,0.000037649377,0.00014334405,0.00062478177,0.00001522036,0.00037532594,0.00028760193],"genre_scores_gemma":[0.73000693,0.00008163799,0.26871076,0.000039797105,0.00007176934,0.000008905024,0.001022878,0.00003584773,0.000021480722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983779,0.00027633275,0.0002656208,0.00068094465,0.00008323516,0.00031591914],"domain_scores_gemma":[0.9992075,0.00006031893,0.00015950346,0.0003021233,0.00014558519,0.00012496766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031784957,0.0003152617,0.00031507967,0.00011299155,0.00018956604,0.00023438608,0.000158808,0.0004091949,0.000013374669],"category_scores_gemma":[0.000016865304,0.0004326574,0.000094640855,0.000377577,0.00009786184,0.00016846838,0.00012019856,0.00045930382,0.0000010501371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007762822,0.000048179023,0.0020426577,0.00020157064,0.000081827944,0.000014083105,0.00012867867,0.9944539,0.0006959319,0.0011926094,0.0002585836,0.00087420625],"study_design_scores_gemma":[0.00043571513,0.000028789114,0.00011147685,0.00009426546,0.00013400862,0.0000045953466,0.00017346744,0.9979863,0.00023586935,0.00032980024,0.000052449,0.0004132397],"about_ca_topic_score_codex":0.000053798864,"about_ca_topic_score_gemma":0.00008297968,"teacher_disagreement_score":0.55800533,"about_ca_system_score_codex":0.0002869792,"about_ca_system_score_gemma":0.00009062019,"threshold_uncertainty_score":0.99981254},"labels":[],"label_agreement":null},{"id":"W3213598897","doi":"10.1108/srt-08-2021-0008","title":"Modeling a robust multi-objective locating-routing problem with bounded delivery time using meta-heuristic algorithms","year":2021,"lang":"en","type":"article","venue":"Smart and Resilient Transport","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Computer science; Tardiness; Sorting; Genetic algorithm; Particle swarm optimization; Bottleneck; Routing (electronic design automation); Heuristic; Algorithm; Mathematics; Job shop scheduling","score_opus":0.03633847495880669,"score_gpt":0.24317006625681004,"score_spread":0.20683159129800335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213598897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35352138,0.00072860427,0.64488953,0.000012275854,0.00006889262,0.0002177025,0.000011844876,0.00025531094,0.0002944411],"genre_scores_gemma":[0.552267,0.000048229816,0.4473612,0.000016603819,0.00003704182,0.000015175161,0.00003398306,0.00006744504,0.00015329062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998267,0.00008670552,0.00045547553,0.00048197724,0.00027510806,0.00043374998],"domain_scores_gemma":[0.99927753,0.00005925375,0.000051131938,0.00023904964,0.00023415494,0.00013889928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045209695,0.00032760703,0.00049467647,0.000104362094,0.0002727035,0.0000604697,0.000088609326,0.00012398337,0.00002728191],"category_scores_gemma":[0.000020293666,0.00029146933,0.00011084378,0.00042682493,0.00006721796,0.000176969,0.000020045538,0.0002952895,0.0000034055458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017919821,0.000042857773,0.0032279477,0.00013876353,0.00049533794,0.00006818763,0.0007917246,0.99359185,0.0011952749,0.000017363385,0.0000016189912,0.0004111366],"study_design_scores_gemma":[0.00070902787,0.000026390695,0.0004916602,0.00014736243,0.000876873,0.00007531565,0.00026145965,0.9956835,0.0013181192,0.000017197875,0.000012719335,0.00038040537],"about_ca_topic_score_codex":0.00011373148,"about_ca_topic_score_gemma":0.00010592434,"teacher_disagreement_score":0.19874565,"about_ca_system_score_codex":0.00008080895,"about_ca_system_score_gemma":0.00012297898,"threshold_uncertainty_score":0.99995375},"labels":[],"label_agreement":null},{"id":"W3214868035","doi":"10.1016/j.cor.2021.105643","title":"Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood","year":2020,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":197,"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","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Compute Canada","keywords":"Swap (finance); Computer science; Vehicle routing problem; Sophistication; Metaheuristic; Mathematical optimization; Open source; Simplicity; Operations research; Routing (electronic design automation); Algorithm; Mathematics; Software","score_opus":0.084428929637477,"score_gpt":0.23377888125092935,"score_spread":0.14934995161345235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214868035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20144066,0.00004658498,0.79748064,0.00020862973,0.000037109803,0.00036176553,0.000011009836,0.00010641032,0.0003071562],"genre_scores_gemma":[0.993128,0.00009385722,0.0064389375,0.00017506343,0.000050066352,0.0000015672609,0.0000068247205,0.000028029612,0.00007762708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994116,0.00005670057,0.000093987284,0.0002243569,0.00003393356,0.00017944298],"domain_scores_gemma":[0.9995166,0.00017107846,0.000023372342,0.00015463486,0.000041212053,0.000093104856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016223536,0.00009554976,0.00009531098,0.000031131443,0.0001577284,0.00007712185,0.00030092592,0.000024765166,0.00006308955],"category_scores_gemma":[0.000017104927,0.000096428266,0.0000302164,0.00022791195,0.000030290525,0.00015737915,0.00014499183,0.000088190165,0.000009319844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019203197,0.0000046312152,0.005162411,0.000028359105,0.000046268255,0.000004790883,0.0002776069,0.9793345,0.00027250827,0.0052185347,0.0002759989,0.009355229],"study_design_scores_gemma":[0.00079301215,0.00004460692,0.0022105402,0.0000031854502,0.000045312063,0.0000019882218,0.0005722336,0.9928612,0.0015762493,0.00024633203,0.0015221711,0.00012313352],"about_ca_topic_score_codex":0.000020905738,"about_ca_topic_score_gemma":0.0000036714139,"teacher_disagreement_score":0.79168737,"about_ca_system_score_codex":0.00003381893,"about_ca_system_score_gemma":0.00001805473,"threshold_uncertainty_score":0.39322308},"labels":[],"label_agreement":null},{"id":"W35147626","doi":"10.1039/d1fo02409d","title":"On Export Intermodal Transportation Problem","year":2012,"lang":"en","type":"article","venue":"Food & Function","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business; Transport engineering; Engineering","score_opus":0.01648786916203184,"score_gpt":0.2288026113357905,"score_spread":0.21231474217375865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35147626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5249272,0.000044172033,0.46743506,0.000014640712,0.0010890599,0.00013985678,0.0000050253598,0.0005797964,0.005765159],"genre_scores_gemma":[0.9891154,0.0000031383822,0.010487915,0.000038810027,0.00019768185,0.00003130684,0.00005642479,0.000034312794,0.000034987337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9994153,0.000023070499,0.00016796224,0.00009130256,0.000119249795,0.00018314009],"domain_scores_gemma":[0.9997552,0.00002141214,0.00002818582,0.00011218901,0.000023685341,0.000059338898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019423733,0.00010017407,0.000078466335,0.00007281463,0.000038065005,0.000012253571,0.000034837452,0.000069554895,0.00013338108],"category_scores_gemma":[0.000011042932,0.00010491575,0.00003805366,0.0001363707,0.000006227141,0.000234261,0.0000016887147,0.000114504815,0.0000776353],"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.0011361603,0.00027615973,0.02458081,0.00025318956,0.00026497644,0.0000012770056,0.0037471387,0.8100961,0.009650495,0.021808183,0.0027894995,0.125396],"study_design_scores_gemma":[0.003785939,0.017114183,0.7039846,0.00031720163,0.0004250126,0.000025807818,0.0006181266,0.1971065,0.031092606,0.0044716205,0.038702026,0.0023563392],"about_ca_topic_score_codex":0.0000011214997,"about_ca_topic_score_gemma":0.0000015902182,"teacher_disagreement_score":0.67940384,"about_ca_system_score_codex":0.00005257413,"about_ca_system_score_gemma":0.0000043107398,"threshold_uncertainty_score":0.427834},"labels":[],"label_agreement":null},{"id":"W407282568","doi":"","title":"枝コストに制限を加えたk-Canadian Traveller Problemの競合比解析","year":2010,"lang":"ja","type":"article","venue":"電子情報通信学会技術研究報告. COMP, コンピュテーション","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.01567056958695733,"score_gpt":0.24469134619955182,"score_spread":0.22902077661259448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W407282568","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20790978,0.002041394,0.06728314,0.007433399,0.02940325,0.004905713,0.0008016586,0.0041180593,0.6761036],"genre_scores_gemma":[0.8085963,0.00014614999,0.17999059,0.0007176782,0.0016947245,0.00008133739,0.00014158874,0.0005328312,0.008098808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99329203,0.000374377,0.0015621482,0.0013695434,0.0008708216,0.002531059],"domain_scores_gemma":[0.9946856,0.00043388456,0.00030935797,0.0020831428,0.00045260732,0.0020354204],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0018973851,0.0012890549,0.0011837387,0.0010661948,0.00079149584,0.0006734765,0.001596124,0.0013794401,0.010341644],"category_scores_gemma":[0.0004816552,0.0015179381,0.0004868355,0.0016247896,0.00037019185,0.00053400715,0.00022949647,0.003280564,0.004795246],"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.00023713794,0.0015171085,0.01832631,0.0030910631,0.0027882494,0.0010577327,0.024677185,0.4067485,0.1470079,0.0636028,0.10390958,0.22703643],"study_design_scores_gemma":[0.0028303696,0.0001917641,0.015947305,0.00035302367,0.00032614204,0.0002726943,0.00039666804,0.5253128,0.0060373116,0.0008504866,0.4441134,0.003368077],"about_ca_topic_score_codex":0.008832008,"about_ca_topic_score_gemma":0.025615077,"teacher_disagreement_score":0.6680048,"about_ca_system_score_codex":0.0004624068,"about_ca_system_score_gemma":0.0007832611,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W41672188","doi":"","title":"School bus selection, routing and scheduling.","year":2005,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"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":"Scheduling (production processes); Computer science; Selection (genetic algorithm); School bus; Engineering; Operations management; Artificial intelligence; Transport engineering","score_opus":0.013201532391812345,"score_gpt":0.21982026003128138,"score_spread":0.20661872763946904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41672188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9761491,0.00028638085,0.019804705,0.00033041183,0.000103750914,0.00015070007,0.000008478507,0.00046455505,0.002701935],"genre_scores_gemma":[0.85563135,0.00005957106,0.14317524,0.00004852749,0.000112965885,2.655732e-7,0.000006689469,0.000040494466,0.0009248733],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986593,0.00012762059,0.00022250392,0.0003331081,0.0002755509,0.0003819044],"domain_scores_gemma":[0.99912024,0.00009711738,0.00010465532,0.00025273976,0.00016080835,0.0002644143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077070476,0.00021903972,0.0002817136,0.0002805839,0.00044116276,0.00004874601,0.0002854475,0.0002454105,0.0004878198],"category_scores_gemma":[0.00022878182,0.0003078022,0.00008985187,0.000577958,0.00010425746,0.00086274405,0.00014401568,0.0005232739,0.00012736776],"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.00012169565,0.0000853069,0.52438587,0.00018744441,0.0002769505,0.000013845868,0.0026572314,0.39745456,0.051006295,0.0006177505,0.00043653816,0.022756543],"study_design_scores_gemma":[0.0038664388,0.0001199059,0.5419658,0.00025357184,0.0002311549,0.0001240847,0.0015876043,0.4208921,0.0196982,0.00023229045,0.009682054,0.0013467916],"about_ca_topic_score_codex":0.0000187896,"about_ca_topic_score_gemma":0.0000710877,"teacher_disagreement_score":0.123370536,"about_ca_system_score_codex":0.00022534271,"about_ca_system_score_gemma":0.0000471675,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W4200307786","doi":"10.18280/jesa.540614","title":"A Heterogeneous Vehicle Routing Problem with Soft Time Windows for 3PL Company’s Deliveries: A Case Study","year":2021,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Consolidation (business); Operations research; Computer science; Interval (graph theory); Service (business); Fleet management; Process (computing); Routing (electronic design automation); Mathematical optimization; Engineering; Business; Mathematics; Computer network","score_opus":0.020891603396323382,"score_gpt":0.2612998627086541,"score_spread":0.2404082593123307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200307786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7391624,0.00043216036,0.25836232,0.000026808353,0.00015250246,0.0007290233,0.000020406913,0.00079040707,0.0003240031],"genre_scores_gemma":[0.78627276,0.000011962216,0.21295431,0.00003711092,0.00016069916,0.000047690723,0.000004502523,0.00017224293,0.00033871282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971669,0.00052287197,0.0008896235,0.00036041113,0.00041714738,0.0006430787],"domain_scores_gemma":[0.99812114,0.00036906067,0.00028757486,0.00037446682,0.00057607814,0.0002716481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091478106,0.00040169802,0.0006234262,0.00015751587,0.0006618382,0.000587099,0.00024532957,0.00009148975,0.0001215463],"category_scores_gemma":[0.00021267693,0.00036665908,0.00016122835,0.00053865666,0.00006273537,0.00037985184,0.00009210978,0.00038643333,0.00004278082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003986034,0.00020702298,0.002603226,0.00031260925,0.0006184999,0.011204978,0.0065629305,0.8905423,0.0015108491,0.000012795145,0.0002961084,0.0860888],"study_design_scores_gemma":[0.0020161942,0.00045613004,0.0017831475,0.0003406398,0.00021039185,0.063365154,0.0018522351,0.92865354,0.0005464486,0.00005573772,0.00023355485,0.00048684698],"about_ca_topic_score_codex":0.00002328638,"about_ca_topic_score_gemma":0.00004600302,"teacher_disagreement_score":0.085601956,"about_ca_system_score_codex":0.00030969532,"about_ca_system_score_gemma":0.00016339864,"threshold_uncertainty_score":0.9998785},"labels":[],"label_agreement":null},{"id":"W4205362405","doi":"10.1108/ijicc-08-2021-0163","title":"Designing a locating-routing three-echelon supply chain network under uncertainty","year":2022,"lang":"en","type":"article","venue":"International Journal of Intelligent Computing and Cybernetics","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":"Carleton University","funders":"","keywords":"Computer science; Vehicle routing problem; Genetic algorithm; Sorting; Mathematical optimization; Particle swarm optimization; Supply chain; Routing (electronic design automation); Operations research; Distributor; Service (business); Algorithm; Mathematics","score_opus":0.018780576492913353,"score_gpt":0.27131172033245793,"score_spread":0.25253114383954456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205362405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19578655,0.0008922763,0.80086756,0.00024405007,0.0017587068,0.00007426819,0.000003078325,0.000080131555,0.00029338722],"genre_scores_gemma":[0.90472084,0.00010130047,0.09425444,0.00021199357,0.00063153805,0.0000014981639,0.0000061820574,0.00004072366,0.000031462667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979491,0.00018096877,0.00079639093,0.00016079284,0.0006153048,0.00029739362],"domain_scores_gemma":[0.99854285,0.0005285167,0.00037321454,0.00010801038,0.00034361435,0.000103815764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018461344,0.00019044534,0.00025080887,0.0001820021,0.00020889794,0.0001283099,0.00048635437,0.00005317858,0.000067420326],"category_scores_gemma":[0.00016350143,0.00020473164,0.000104728184,0.00024226375,0.000045094213,0.000060200146,0.00025716884,0.0006556911,0.0000019598108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022892287,0.00002529281,0.004610025,0.000007633277,0.00016758892,0.000023519444,0.0009629989,0.9450365,0.00027599715,0.0011365268,0.00027896778,0.047452103],"study_design_scores_gemma":[0.00032107625,0.00010645701,0.0007870284,0.00015869552,0.000029856184,0.0004072044,0.0011032413,0.9938019,0.00067946775,0.0015610438,0.00082822115,0.0002158117],"about_ca_topic_score_codex":0.000022317874,"about_ca_topic_score_gemma":0.0000050220942,"teacher_disagreement_score":0.7089343,"about_ca_system_score_codex":0.00030715918,"about_ca_system_score_gemma":0.000060614937,"threshold_uncertainty_score":0.8348714},"labels":[],"label_agreement":null},{"id":"W4205537357","doi":"10.1016/j.ejor.2021.12.050","title":"A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Transport Canada","funders":"Shanghai Jiao Tong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Compute Canada; Polytechnique Montréal","keywords":"Vehicle routing problem; Branch and cut; Computer science; Mathematical optimization; Routing (electronic design automation); Integer programming; Branch and bound; Algorithm; Mathematics; Computer network","score_opus":0.05341610305665129,"score_gpt":0.3333075957489059,"score_spread":0.2798914926922546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205537357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13386077,0.00076336163,0.8564956,0.0029950899,0.00032606884,0.00085443206,0.00005611802,0.00006749795,0.0045810193],"genre_scores_gemma":[0.82838005,0.000007822722,0.17100352,0.00008878149,0.0002725915,0.000013603367,0.0000043408045,0.000047033456,0.00018224219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974604,0.000908238,0.00037849142,0.00012995125,0.0008483347,0.00027453073],"domain_scores_gemma":[0.99805707,0.0011197155,0.00007189066,0.000096682495,0.0005554918,0.00009917991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009783415,0.00009663709,0.00012777292,0.00015130288,0.00096872164,0.00016694098,0.0002659944,0.000008610956,0.00016773552],"category_scores_gemma":[0.00023726044,0.00007039735,0.000043667394,0.00029841333,0.00015294853,0.00016558447,0.00012446022,0.00072500424,0.0000040671616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004188344,0.000019676476,0.00014231562,0.000009001773,0.000081747196,0.00003872908,0.0005082809,0.92560154,0.00445495,0.00080211536,0.0007214073,0.06757835],"study_design_scores_gemma":[0.001638042,0.0003319413,0.00078435394,0.000050618422,0.000013708701,0.0006782102,0.00037315922,0.9931034,0.0007326948,0.000074184136,0.0020975189,0.00012215594],"about_ca_topic_score_codex":0.0000015594757,"about_ca_topic_score_gemma":4.5566156e-7,"teacher_disagreement_score":0.6945193,"about_ca_system_score_codex":0.00010976523,"about_ca_system_score_gemma":0.00017675804,"threshold_uncertainty_score":0.7450721},"labels":[],"label_agreement":null},{"id":"W4205600329","doi":"10.5267/j.ijiec.2021.10.001","title":"Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Integer programming; Time horizon; Ant colony optimization algorithms; Computer science; Metaheuristic; Routing (electronic design automation); Scheduling (production processes); Linear programming; Algorithm; Simulated annealing; Variable (mathematics); Set (abstract data type); Mathematics","score_opus":0.02123064897644581,"score_gpt":0.2451079673216813,"score_spread":0.2238773183452355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205600329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018141102,0.0000999144,0.97811055,0.0012165516,0.0020028527,0.00026655223,0.00007918597,0.00004874375,0.000034536337],"genre_scores_gemma":[0.74602675,0.0000045464435,0.25326893,0.000055530152,0.0005418455,0.000037352274,0.000012138891,0.00003973418,0.000013208325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876976,0.00006132781,0.00046348103,0.00007916987,0.00048071195,0.00014552134],"domain_scores_gemma":[0.9985187,0.00047237487,0.000292057,0.00010818788,0.00057486,0.000033829427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007419076,0.00011190222,0.00014694562,0.00013484036,0.00021896765,0.000057883168,0.0005796286,0.000031299915,0.000020209302],"category_scores_gemma":[0.00013387491,0.000083406136,0.00008715234,0.00041477146,0.00002003648,0.00015162531,0.000078631216,0.00046682556,2.3356704e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000980814,0.00002002848,0.00011498872,0.0000060902375,0.00020611513,0.0000013667974,0.00023503506,0.98541903,0.0009841823,0.0005093845,0.0001712252,0.012322717],"study_design_scores_gemma":[0.0009911904,0.000059405716,0.0001231926,0.000079494435,0.000058457375,0.00014072834,0.0001063187,0.99621934,0.0006532605,0.00012682246,0.0013509745,0.00009083157],"about_ca_topic_score_codex":0.000030741387,"about_ca_topic_score_gemma":9.659735e-7,"teacher_disagreement_score":0.7278856,"about_ca_system_score_codex":0.00024467203,"about_ca_system_score_gemma":0.00020227258,"threshold_uncertainty_score":0.34012035},"labels":[],"label_agreement":null},{"id":"W4205601287","doi":"10.5267/j.ijiec.2021.10.002","title":"An exact algorithm for constrained k-cardinality unbalanced assignment problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cardinality (data modeling); Assignment problem; Set (abstract data type); Generalized assignment problem; Weapon target assignment problem; Mathematical optimization; Algorithm; Computer science; Basis (linear algebra); Mathematics; Data mining","score_opus":0.03363362699043817,"score_gpt":0.3011088124539641,"score_spread":0.26747518546352594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205601287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010351851,0.000027221804,0.9855357,0.0003629758,0.0031232461,0.00023029515,0.00017664643,0.00014060948,0.00005145857],"genre_scores_gemma":[0.64013296,0.0000030740382,0.35889813,0.000024493347,0.00079696596,0.000036506823,0.00006502549,0.00003572864,0.000007132053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985572,0.00008244696,0.0005649165,0.00011666793,0.000503528,0.00017520414],"domain_scores_gemma":[0.99892354,0.0002929524,0.00020442948,0.00009133014,0.0003759468,0.00011178241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009123922,0.00014372605,0.00022775898,0.000314025,0.00008908563,0.000088708155,0.00041719805,0.000056324727,0.000051187795],"category_scores_gemma":[0.00012039129,0.00016780174,0.00013686593,0.00022391582,0.00001603063,0.00022226798,0.000035801444,0.00041511442,5.4655675e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015147512,0.00005118009,0.00006640838,0.0000032459209,0.00023177506,0.00001021624,0.000148881,0.9418563,0.0010261021,0.00032059196,0.00042350387,0.05584664],"study_design_scores_gemma":[0.0017570942,0.00017481668,0.00008028869,0.000027308108,0.000032053067,0.0001317265,0.00013742717,0.99291396,0.00050603965,0.00016716788,0.0039074067,0.00016470405],"about_ca_topic_score_codex":0.0000025996824,"about_ca_topic_score_gemma":8.982248e-8,"teacher_disagreement_score":0.6297811,"about_ca_system_score_codex":0.00046498532,"about_ca_system_score_gemma":0.00013046371,"threshold_uncertainty_score":0.6842756},"labels":[],"label_agreement":null},{"id":"W4205882819","doi":"10.5267/j.ijiec.2021.12.002","title":"Clustering and heuristics algorithm for the vehicle routing problem with time windows","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Nacional de Colombia; Massachusetts Institute of Technology","keywords":"Vehicle routing problem; Heuristics; Cluster analysis; Computer science; Set (abstract data type); Mathematical optimization; Algorithm; Routing (electronic design automation); Mathematics; Artificial intelligence","score_opus":0.021013029719480766,"score_gpt":0.2563518208738407,"score_spread":0.2353387911543599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205882819","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005786598,0.00008143332,0.99219126,0.00057658606,0.0010090995,0.00020915373,0.00004229583,0.0000765279,0.000027067043],"genre_scores_gemma":[0.48373207,0.000012692218,0.5148793,0.0000501895,0.0011484439,0.00004015702,0.000017470773,0.000074163254,0.00004550701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990468,0.000034442794,0.00035936688,0.00008259886,0.00033491474,0.00014189736],"domain_scores_gemma":[0.9987757,0.0007169595,0.00015299348,0.00006123557,0.0002398069,0.00005328732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059648324,0.000115749164,0.00014860128,0.00017357197,0.00016946344,0.000109781715,0.00027849647,0.0000335792,0.000012870114],"category_scores_gemma":[0.00012452998,0.000100867685,0.00005161218,0.00019347406,0.000018425731,0.00012383536,0.00007788398,0.00040624183,4.2275354e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014722102,0.0000103892025,0.000054192013,0.0000030007106,0.00018802682,0.0000072435646,0.00018570655,0.9485289,0.00015064012,0.00007173157,0.00023720699,0.05054826],"study_design_scores_gemma":[0.0011922398,0.00009328002,0.000067376815,0.000042791078,0.000042175245,0.00025146492,0.0000929157,0.99515694,0.00007171211,0.000022522912,0.0028560094,0.00011055711],"about_ca_topic_score_codex":0.0000028172676,"about_ca_topic_score_gemma":2.474964e-7,"teacher_disagreement_score":0.47794548,"about_ca_system_score_codex":0.00015704765,"about_ca_system_score_gemma":0.000059030583,"threshold_uncertainty_score":0.41132647},"labels":[],"label_agreement":null},{"id":"W4205930499","doi":"10.1287/ijoc.2021.1110","title":"Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"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; Computer science; Column generation; Algorithm; Mathematical optimization; Branch and cut; Routing (electronic design automation); Integer programming; Mathematics","score_opus":0.013169023414246587,"score_gpt":0.253346230159968,"score_spread":0.2401772067457214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205930499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31825945,0.0001882226,0.6800103,0.0003209906,0.00016422936,0.00025369952,0.0000025273223,0.0001904994,0.0006100968],"genre_scores_gemma":[0.84756666,0.0000044758776,0.15184452,0.0003008062,0.00019423234,0.000002669922,0.000003512945,0.000043034288,0.00004007075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998658,0.00006568107,0.00043266732,0.00017572688,0.00026968113,0.0003982205],"domain_scores_gemma":[0.9978744,0.0014668837,0.00019798249,0.00010063053,0.00022259366,0.0001375306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014744798,0.00021087365,0.00024912652,0.00008631832,0.0007371149,0.00034513275,0.00010337115,0.000064434746,0.000020382364],"category_scores_gemma":[0.00025678883,0.0001504556,0.00005769519,0.00023589445,0.000087517554,0.00019460433,0.000054277552,0.0006895005,0.0000038658413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001924899,0.000006471595,0.0012687617,0.000030100515,0.000068314686,0.000012311388,0.00033622,0.90196866,0.00076945015,0.00005136126,0.000013302493,0.095455796],"study_design_scores_gemma":[0.001880443,0.00011509743,0.00089378475,0.00035281753,0.000028090288,0.00064203545,0.00011066434,0.9936768,0.0018315153,0.00004197777,0.00020844777,0.00021834217],"about_ca_topic_score_codex":0.0000012969184,"about_ca_topic_score_gemma":3.946128e-7,"teacher_disagreement_score":0.52930725,"about_ca_system_score_codex":0.00007194916,"about_ca_system_score_gemma":0.00010286398,"threshold_uncertainty_score":0.6135401},"labels":[],"label_agreement":null},{"id":"W4206161370","doi":"10.5267/j.ijiec.2021.12.003","title":"How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadratic assignment problem; Metaheuristic; Mathematical optimization; Heuristic; Bounding overwatch; Computation; Computer science; Weapon target assignment problem; Quadratic equation; Quadratic programming; Combinatorial optimization; Optimization problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.042516963782441256,"score_gpt":0.28286103164726606,"score_spread":0.24034406786482482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206161370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014396713,0.000058938807,0.9740269,0.006125674,0.00486001,0.00035417304,0.000044280747,0.00009123407,0.000042085234],"genre_scores_gemma":[0.89285475,0.0000025455547,0.10593532,0.00008999525,0.00093601074,0.00007139316,0.000011110944,0.00004774503,0.000051152747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985465,0.00005150844,0.00048388654,0.00011180645,0.0005949347,0.00021138077],"domain_scores_gemma":[0.9986018,0.0006723527,0.000175292,0.000104172505,0.0003499417,0.00009645702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093228515,0.00014940252,0.00018861175,0.00033354858,0.0001847786,0.00031809843,0.00051431893,0.000040562514,0.000021977474],"category_scores_gemma":[0.0006623737,0.00014161835,0.00013226595,0.00031840758,0.000012247424,0.00018169585,0.000094618554,0.0004713809,8.176805e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002531724,0.000027750011,0.000029755449,0.000006055574,0.0001892411,0.00000869706,0.00054816523,0.98956394,0.00094875746,0.0008695855,0.0035351287,0.00424761],"study_design_scores_gemma":[0.00090358924,0.0001810991,0.000031543084,0.000075565426,0.000041644656,0.00008963602,0.0005313342,0.9609828,0.00030491577,0.00018691822,0.03649152,0.000179429],"about_ca_topic_score_codex":0.000002359249,"about_ca_topic_score_gemma":6.450374e-7,"teacher_disagreement_score":0.878458,"about_ca_system_score_codex":0.0005244871,"about_ca_system_score_gemma":0.00012313419,"threshold_uncertainty_score":0.5775029},"labels":[],"label_agreement":null},{"id":"W4210545694","doi":"10.1108/ecam-02-2021-0177","title":"A multiproject scheduling and resource management model in projects construction","year":2022,"lang":"en","type":"article","venue":"Engineering Construction & Architectural Management","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Profit (economics); Scheduling (production processes); Exploit; Computer science; Multimodal transport; Operations research; Project management; Transport engineering; Operations management; Engineering; Systems engineering; Computer security","score_opus":0.009417982647277704,"score_gpt":0.21047230024238253,"score_spread":0.20105431759510484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210545694","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.501015,0.00012977756,0.49400732,0.00007340016,0.00046247037,0.0008139037,0.0000071419026,0.0009222925,0.0025686692],"genre_scores_gemma":[0.4935803,0.000026624946,0.50606257,0.000016236316,0.000024586434,0.0001911305,0.0000091601905,0.000043571938,0.0000458073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983961,0.00007245417,0.0003945159,0.0004195201,0.00030733968,0.0004100784],"domain_scores_gemma":[0.9995678,0.000039032937,0.000053256357,0.00025676034,0.000011598433,0.00007155593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040588566,0.00028103887,0.0002230282,0.0008996881,0.0001897247,0.00005956671,0.0001669528,0.000039732582,0.000017818533],"category_scores_gemma":[0.000012299707,0.00034461726,0.000051971878,0.00075426354,0.00005214996,0.00011147392,0.0002927919,0.00046383077,0.0000012078232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018070863,0.000008153957,0.00031655157,0.00025052344,0.00006714267,0.000018361003,0.00041575433,0.90279007,0.00022454638,0.0042818636,0.0000076037486,0.091601364],"study_design_scores_gemma":[0.000874298,0.00001914622,0.0008350067,0.000058710088,0.000032804717,0.000201926,0.0012262925,0.9955399,0.00012366743,0.0001582324,0.0005807758,0.00034921657],"about_ca_topic_score_codex":0.0000054429684,"about_ca_topic_score_gemma":0.0000011457116,"teacher_disagreement_score":0.092749864,"about_ca_system_score_codex":0.00030464333,"about_ca_system_score_gemma":0.000006850447,"threshold_uncertainty_score":0.9999006},"labels":[],"label_agreement":null},{"id":"W4210652853","doi":"10.1155/2022/5538113","title":"Dynamic Multicompartment Refrigerated Vehicle Routing Problem with Multigraph Based on Real-Time Traffic Information","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multigraph; Computer science; Routing (electronic design automation); Scheme (mathematics); Path (computing); Vehicle routing problem; Selection (genetic algorithm); Variable (mathematics); Adaptive routing; Chaotic; Genetic algorithm; Operations research; Mathematical optimization; Real-time computing; Routing protocol; Computer network; Static routing; Artificial intelligence; Engineering; Machine learning; Mathematics; Theoretical computer science","score_opus":0.00497834148271386,"score_gpt":0.2267176048472236,"score_spread":0.22173926336450975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210652853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9386657,0.000011732405,0.060512774,0.00006573278,0.00013739962,0.00031090088,0.00002607023,0.00017967088,0.0000900504],"genre_scores_gemma":[0.8108333,0.000010730939,0.18894544,0.000026470721,0.000008041688,0.000020153111,0.00012364451,0.000027028636,0.000005196989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844444,0.0000948304,0.0007033221,0.00009514944,0.00047291687,0.00018932279],"domain_scores_gemma":[0.9991362,0.000090226866,0.0004098293,0.0001124153,0.00017810658,0.0000732081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047307697,0.00016289676,0.00023080202,0.00030408794,0.00016095748,0.000026443306,0.000103955455,0.000036670892,0.00003782801],"category_scores_gemma":[0.00001129126,0.0001545595,0.00007275041,0.0005062817,0.00001325654,0.0005932319,0.0000012237545,0.0003440788,0.000002282098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003330635,0.00006740463,0.0001939672,0.000037850074,0.0000306737,0.000009550478,0.0017145067,0.9818026,0.008110524,0.000009140051,0.000007920947,0.0076828147],"study_design_scores_gemma":[0.002745092,0.00047729458,0.017698808,0.00008167805,0.000044746055,0.000006088841,0.00059001305,0.976977,0.0010303328,0.0000052853566,0.00016096733,0.00018267507],"about_ca_topic_score_codex":0.000001929757,"about_ca_topic_score_gemma":0.000005171308,"teacher_disagreement_score":0.12843266,"about_ca_system_score_codex":0.0002569652,"about_ca_system_score_gemma":0.000052531257,"threshold_uncertainty_score":0.6302753},"labels":[],"label_agreement":null},{"id":"W4211174428","doi":"10.1007/978-3-319-91086-4_3","title":"Variable Neighborhood Search","year":2018,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":106,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Royal Military College of Canada; HEC Montréal","funders":"","keywords":"Variable neighborhood search; Metaheuristic; Mathematical optimization; Mathematical proof; Mathematics; Combinatorial optimization; Guided Local Search; Integer programming; Linear programming; Nonlinear programming; Nonlinear system; Computer science","score_opus":0.060288739394379905,"score_gpt":0.398312244958024,"score_spread":0.3380235055636441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211174428","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013262932,0.00010712975,0.013291513,0.0043333764,0.0038759452,0.0033261422,0.00017630491,0.0003258701,0.97323745],"genre_scores_gemma":[0.08723812,0.0075137382,0.17435639,0.00018327587,0.00094851514,0.0017540297,0.0005125254,0.00027758605,0.7272158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9806645,0.00041478913,0.0018752761,0.0027024932,0.011817464,0.0025254781],"domain_scores_gemma":[0.9923724,0.00026104526,0.00006682135,0.002064609,0.004728266,0.00050683913],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.024777869,0.00080147944,0.00058385567,0.015757624,0.0031576317,0.0057998,0.009801193,0.00031793508,0.008143189],"category_scores_gemma":[0.0012493418,0.0008907275,0.0001356389,0.007751512,0.009629058,0.008264717,0.006000623,0.002472893,0.0011786757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006126873,0.00012625613,0.00008075803,0.00007810279,0.000102721446,0.00011149587,0.00059793977,0.41348052,0.00040981526,0.58127505,0.0016723493,0.0020037212],"study_design_scores_gemma":[0.0014155975,0.0002585584,0.001370129,0.0012792228,0.000022828204,0.000056915473,0.004379775,0.7536773,0.00084634585,0.039791647,0.19535153,0.0015501651],"about_ca_topic_score_codex":0.00032924063,"about_ca_topic_score_gemma":0.0017939302,"teacher_disagreement_score":0.5414834,"about_ca_system_score_codex":0.0074046324,"about_ca_system_score_gemma":0.00093880686,"threshold_uncertainty_score":0.99982846},"labels":[],"label_agreement":null},{"id":"W4211246340","doi":"10.1007/978-3-030-32177-2_12","title":"Hub Location Problems","year":2019,"lang":"en","type":"book-chapter","venue":"Location Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network planning and design; Computer science; Cover (algebra); Integer programming; Key (lock); Facility location problem; Network topology; Operations research; Class (philosophy); Focus (optics); Modal; Flow network; Mathematical optimization; Engineering; Computer network; Artificial intelligence; Mathematics; Computer security","score_opus":0.028624032868462122,"score_gpt":0.266979153600706,"score_spread":0.23835512073224388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211246340","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025855397,0.00031989263,0.4624078,0.00006605514,0.0008227325,0.0003876536,0.0000026983923,0.0004166569,0.53555065],"genre_scores_gemma":[0.18851264,0.0002893232,0.06801407,0.00023905945,0.00038674037,0.000041173764,0.00007698019,0.00023853152,0.7422015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843353,0.000010044687,0.00034365695,0.00040426728,0.0005757152,0.00023277655],"domain_scores_gemma":[0.99852407,0.000052036008,0.00012643708,0.0005950807,0.00061731436,0.00008507074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00086239586,0.00021437068,0.00018488658,0.00034140397,0.00011246972,0.00012574765,0.00047442198,0.00017646061,0.00013359214],"category_scores_gemma":[0.00011992805,0.0002355505,0.00002927615,0.00047155653,0.00020766466,0.00037475303,0.000050163973,0.00023492315,0.00101617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.3744947e-7,0.0000026993348,0.0000131860625,0.00020662017,0.000004402189,1.7460562e-7,0.00018026675,0.9262599,0.00068369944,0.05745897,0.00033792984,0.014851668],"study_design_scores_gemma":[0.00020054117,0.000030741296,0.00036494763,0.0005281908,0.000029559651,0.000010138771,0.000016084841,0.93487287,0.0014479937,0.0037635297,0.05798846,0.0007469493],"about_ca_topic_score_codex":0.000002819919,"about_ca_topic_score_gemma":0.00000264353,"teacher_disagreement_score":0.3943937,"about_ca_system_score_codex":0.00029557873,"about_ca_system_score_gemma":0.00036273635,"threshold_uncertainty_score":0.99976164},"labels":[],"label_agreement":null},{"id":"W4214807431","doi":"10.1016/j.cor.2022.105761","title":"The doubly open park-and-loop routing problem","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"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; Canada First Research Excellence Fund","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Heuristic; Extension (predicate logic); Mathematical optimization; Set (abstract data type); Quality (philosophy); Loop (graph theory); Operations research; Mathematics; Artificial intelligence; Computer network","score_opus":0.0847938384632459,"score_gpt":0.38310976878355396,"score_spread":0.29831593032030806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214807431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113904774,0.001401599,0.84199023,0.011671273,0.0013426968,0.004425694,0.0000306015,0.000891478,0.02434163],"genre_scores_gemma":[0.7912988,0.00012530196,0.20454498,0.0001262617,0.00013931013,0.0007695992,0.000030640524,0.00007141295,0.0028936777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978627,0.0007954429,0.00025840325,0.00024619757,0.00042280377,0.00041447816],"domain_scores_gemma":[0.9988163,0.00053612853,0.000009978022,0.00038344745,0.00016443519,0.00008972747],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0041934354,0.000098539385,0.000114185146,0.00012605128,0.00355897,0.0012305271,0.0009523021,0.000026814787,0.0000613124],"category_scores_gemma":[0.000107286796,0.0000871799,0.000022874812,0.000803818,0.00009124951,0.00021782135,0.0016050108,0.0006541932,0.000016495935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043468417,0.000012679744,0.00010661083,0.0000062170616,0.000020773787,0.0000024181957,0.0007997155,0.9589892,0.0002864212,0.007988343,0.0046419953,0.027141264],"study_design_scores_gemma":[0.00027074837,0.00004157581,0.00015556277,0.0000087108665,0.0000023169548,0.0000139421645,0.00042329112,0.979722,0.00013568303,0.00011592328,0.019001175,0.00010904921],"about_ca_topic_score_codex":0.00010340384,"about_ca_topic_score_gemma":0.000038452847,"teacher_disagreement_score":0.67739403,"about_ca_system_score_codex":0.0001744168,"about_ca_system_score_gemma":0.00010888023,"threshold_uncertainty_score":0.9998063},"labels":[],"label_agreement":null},{"id":"W4220699348","doi":"10.1155/2022/9241112","title":"Advanced Phasmatodea Population Evolution Algorithm for Capacitated Vehicle Routing Problem","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Local optimum; Convergence (economics); Vehicle routing problem; Population; Algorithm; Jump; Computer science; Closing (real estate); Mathematical optimization; Metaheuristic; Routing (electronic design automation); Mathematics","score_opus":0.009819368436302486,"score_gpt":0.25512469360238754,"score_spread":0.24530532516608505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220699348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33914453,0.00014666276,0.6596293,0.00003831136,0.00054817257,0.00030864243,0.000047592202,0.00011832965,0.000018484787],"genre_scores_gemma":[0.6021143,0.000010261566,0.39761466,0.000009668435,0.00005519639,0.00003570561,0.000109169945,0.000039149232,0.000011870457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836046,0.00007106499,0.00082917506,0.00014264241,0.00036082632,0.00023583802],"domain_scores_gemma":[0.9990167,0.00008125856,0.00046523355,0.000094461255,0.00027407106,0.00006826119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060300535,0.00015509759,0.00026328486,0.00021757178,0.00023801165,0.000016689073,0.00011953564,0.00004672902,0.000017052093],"category_scores_gemma":[0.000032916454,0.00018151618,0.0001333694,0.00046613894,0.000011658916,0.0006904302,0.0000023814007,0.00028284494,4.0258624e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006611331,0.00003191989,0.0004980224,0.00004054947,0.000031992688,0.0000030240199,0.00093722634,0.8999253,0.016669806,0.000206323,0.000012916184,0.0815768],"study_design_scores_gemma":[0.004574603,0.0004317274,0.026806185,0.00008907138,0.00012247318,0.00003419043,0.0020696253,0.95800596,0.0038788065,0.0029278223,0.0006550491,0.00040451006],"about_ca_topic_score_codex":0.000004423157,"about_ca_topic_score_gemma":0.00000546702,"teacher_disagreement_score":0.26296982,"about_ca_system_score_codex":0.00040146607,"about_ca_system_score_gemma":0.00003478121,"threshold_uncertainty_score":0.7402015},"labels":[],"label_agreement":null},{"id":"W4220718688","doi":"10.1007/s00291-022-00670-3","title":"Mobile healthcare services in rural areas: an application with periodic location routing problem","year":2022,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"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 Toronto","funders":"","keywords":"Health care; Christian ministry; Heuristic; Computer science; Routing (electronic design automation); Population; Rural area; Focus (optics); Operations research; Business; Computer network; Mathematics; Artificial intelligence; Economic growth; Medicine; Economics; Environmental health","score_opus":0.007366936327757205,"score_gpt":0.25197933688144364,"score_spread":0.24461240055368644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220718688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94531244,0.00023771916,0.0518478,0.0003346875,0.000092317605,0.001006892,0.000011451986,0.00064652215,0.000510165],"genre_scores_gemma":[0.9814069,0.000011995912,0.017780805,0.000057202822,0.000052601255,0.00052303827,0.00007247275,0.000050601866,0.00004435486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901134,0.00010569264,0.00022612538,0.00020378226,0.00019211897,0.00026095644],"domain_scores_gemma":[0.99957794,0.000015428708,0.00006659153,0.00025648903,0.000024195582,0.00005936979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032807793,0.00012742403,0.00013629561,0.00011813934,0.00018665053,0.000048429345,0.00017376742,0.000035297282,0.00006364865],"category_scores_gemma":[0.0000024712733,0.00012540763,0.000012459151,0.0007744157,0.000011159973,0.00014965989,0.000038177957,0.00023262147,0.000005291154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036682497,0.000035077977,0.030344645,0.00014489637,0.0000058355517,0.0000029996907,0.003541395,0.95359904,0.00041673597,0.00038659322,0.0000026647713,0.011483441],"study_design_scores_gemma":[0.00042214314,0.0002885119,0.009741032,0.000049973547,0.0000065115714,0.00003862263,0.0055919904,0.98260903,0.00040835835,0.00013814708,0.0004687205,0.00023696233],"about_ca_topic_score_codex":0.0004314561,"about_ca_topic_score_gemma":0.0011141222,"teacher_disagreement_score":0.036094483,"about_ca_system_score_codex":0.00034384357,"about_ca_system_score_gemma":0.0000531633,"threshold_uncertainty_score":0.5113975},"labels":[],"label_agreement":null},{"id":"W4221015978","doi":"10.5325/transportationj.61.1.0060","title":"Sustainable Pricing-Production-Workforce-Routing Problem for Perishable Products by Considering Demand Uncertainty; A Case Study from the Dairy Industry","year":2022,"lang":"en","type":"article","venue":"Transportation Journal","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":"Concordia University","funders":"","keywords":"Supply chain; Greenhouse gas; Vehicle routing problem; Production (economics); Pareto principle; Profit (economics); Environmental economics; Workforce; Production planning; Computer science; Business; Operations research; Routing (electronic design automation); Economics; Operations management; Microeconomics; Engineering; Marketing","score_opus":0.025502268843888787,"score_gpt":0.2715234489447433,"score_spread":0.2460211801008545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221015978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9487065,0.0003766892,0.048266623,0.00057846465,0.0004622889,0.0013139282,0.00004566808,0.00020953578,0.00004029863],"genre_scores_gemma":[0.98217076,0.000009907448,0.016532617,0.000063515006,0.00032602053,0.00023749999,0.00006054006,0.000078270976,0.00052087655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9979288,0.00023637658,0.0006808332,0.00032501374,0.00036237363,0.00046658484],"domain_scores_gemma":[0.9988944,0.000229783,0.00023528068,0.00023969194,0.00029992397,0.00010094943],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021374116,0.00022509132,0.00024594466,0.000088941866,0.0019278256,0.00018545474,0.00019769381,0.000075660726,0.000117654374],"category_scores_gemma":[0.00018098162,0.0002090397,0.000067643596,0.00061003095,0.00003272778,0.0003649842,0.000012422861,0.0011268945,4.1917863e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036011726,0.00006859226,0.015207974,0.000045467288,0.00011159992,0.00024871595,0.023996308,0.95592445,0.00040358733,0.000032176053,0.0030689542,0.0008561461],"study_design_scores_gemma":[0.0059338994,0.00065900804,0.0035972483,0.00015477947,0.0007712257,0.0038821152,0.70063096,0.26041564,0.0027362222,0.0008432816,0.018927904,0.0014477398],"about_ca_topic_score_codex":0.0002858253,"about_ca_topic_score_gemma":0.000057565667,"teacher_disagreement_score":0.69550884,"about_ca_system_score_codex":0.000249284,"about_ca_system_score_gemma":0.000167747,"threshold_uncertainty_score":0.9993715},"labels":[],"label_agreement":null},{"id":"W4221122161","doi":"10.1287/trsc.2022.1129","title":"Vehicle Routing with Stochastic Demands and Partial Reoptimization","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Vehicle routing problem; A priori and a posteriori; Context (archaeology); Operations research; Routing (electronic design automation); Stochastic dominance; Mathematics","score_opus":0.011874176218330378,"score_gpt":0.24106467431340253,"score_spread":0.22919049809507216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221122161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45055518,0.000012782107,0.54896975,0.00003185696,0.000060463663,0.00008101761,0.000004805999,0.00015956041,0.00012458317],"genre_scores_gemma":[0.97149897,0.0000020732077,0.028383547,0.000031702184,0.000011788517,0.00002744069,0.0000110232895,0.000015442332,0.00001798685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999034,0.000023873452,0.00017189156,0.00020515583,0.0003744477,0.00019061528],"domain_scores_gemma":[0.9996934,0.000038145885,0.000040889714,0.00010475221,0.000053528147,0.00006930386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006022437,0.00007924337,0.000079663936,0.00011100843,0.00045625243,0.00004563028,0.000112463546,0.000012729276,0.00005392186],"category_scores_gemma":[0.000019063382,0.00008256258,0.000009438196,0.0009190473,0.00011245026,0.00031725172,0.0000060144807,0.00010637832,9.376037e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007931173,0.000004845123,0.0023671354,0.0000054030247,0.000002154872,0.0000013578508,0.0013852029,0.99253726,0.0017351178,0.00075020484,0.0000023096472,0.0012010504],"study_design_scores_gemma":[0.0002935741,0.000040352246,0.017525958,0.0000054099464,0.000011784658,0.0000045437623,0.00031006802,0.9806826,0.00096400036,0.000022318947,0.00002133482,0.00011805851],"about_ca_topic_score_codex":0.000006664756,"about_ca_topic_score_gemma":0.000004428391,"teacher_disagreement_score":0.5209438,"about_ca_system_score_codex":0.000049387694,"about_ca_system_score_gemma":0.000047618305,"threshold_uncertainty_score":0.3509171},"labels":[],"label_agreement":null},{"id":"W4224271542","doi":"10.1007/s11750-022-00632-6","title":"Analysis of the selective traveling salesman problem with time-dependent profits","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"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é Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Junta de Andalucía; European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades","keywords":"Travelling salesman problem; Solver; Profit (economics); Mathematical optimization; Computer science; Time horizon; Graph; Piecewise; Mathematics; Combinatorics; Operations research; Economics","score_opus":0.007919825672221409,"score_gpt":0.22200185495626706,"score_spread":0.21408202928404566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224271542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89731556,0.00006587718,0.08918643,0.00010644916,0.00007394803,0.000527629,0.000029459483,0.0003209729,0.012373676],"genre_scores_gemma":[0.9851324,8.317742e-7,0.014065259,0.00001433925,0.000009366173,0.00003461416,0.0000051990305,0.000021550512,0.0007164261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932164,0.000107265,0.0001379425,0.000109034045,0.0002087392,0.00011536936],"domain_scores_gemma":[0.9996821,0.00003915638,0.00004829808,0.00017257736,0.000040015428,0.000017852948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032747685,0.00006993924,0.00014284742,0.000086236905,0.000095041396,0.0000074606623,0.00014567192,0.000017129281,0.00014412735],"category_scores_gemma":[0.000011252711,0.00005427244,0.000048951588,0.0012502344,0.000012533323,0.000025111964,0.000045506134,0.00015237904,0.0000018641814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005048592,0.000009905646,0.007901453,0.0000094657435,0.00030609188,4.8131875e-7,0.0010306878,0.9876764,0.0020221088,0.000040654064,0.000021313397,0.00097640546],"study_design_scores_gemma":[0.0001893306,0.000034893004,0.009940992,0.0000066171747,0.00038446588,0.000003831177,0.00014738571,0.9767359,0.012344283,0.000022930015,0.00007284648,0.00011653756],"about_ca_topic_score_codex":0.000011822698,"about_ca_topic_score_gemma":0.0000074024656,"teacher_disagreement_score":0.08781686,"about_ca_system_score_codex":0.00007889682,"about_ca_system_score_gemma":0.000024490162,"threshold_uncertainty_score":0.22131659},"labels":[],"label_agreement":null},{"id":"W4224281875","doi":"10.1109/sm55505.2022.9758346","title":"Multi-criteria Optimal Routing for Last-mile Parcel Delivery","year":2022,"lang":"en","type":"article","venue":"","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":"General Motors (Canada); University of Toronto","funders":"","keywords":"Simulated annealing; Travelling salesman problem; Computer science; Genetic algorithm; Metaheuristic; Mathematical optimization; Cluster analysis; Vehicle routing problem; Routing (electronic design automation); Adaptive simulated annealing; Algorithm; Artificial intelligence; Mathematics; Computer network","score_opus":0.031500689323713874,"score_gpt":0.2871309209264886,"score_spread":0.25563023160277476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224281875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12348873,0.00005518943,0.8738358,0.000038168244,0.00050009735,0.00025670964,0.000031664484,0.0007571586,0.0010364745],"genre_scores_gemma":[0.4199494,0.0000027204546,0.57913256,0.000083012485,0.00005813541,0.00010409948,0.000025313533,0.00004716927,0.00059760694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990651,0.00007398067,0.00023760015,0.00018943188,0.00012407098,0.00030981345],"domain_scores_gemma":[0.9995325,0.00016554543,0.000027344428,0.00017470075,0.000040275394,0.000059589536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055323815,0.00012942616,0.000147115,0.00007368187,0.00024986567,0.000041378597,0.00017526025,0.000034945464,0.00074798294],"category_scores_gemma":[0.00007305599,0.00015235765,0.00007321781,0.00017279557,0.00001107348,0.00009502554,0.00012961571,0.00014623332,0.000011369335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006180975,0.00002277033,0.00034465638,0.000019156578,0.000021722097,0.0000021688713,0.00033141542,0.9832862,0.010937555,0.000061330764,0.0016482841,0.003318542],"study_design_scores_gemma":[0.0005888655,0.00003215812,0.00028289176,0.0000032443372,0.000010428621,0.000008552882,0.00040698962,0.98790604,0.0026229164,0.0000057437196,0.007938359,0.00019382076],"about_ca_topic_score_codex":0.000009027458,"about_ca_topic_score_gemma":0.0000023090417,"teacher_disagreement_score":0.2964607,"about_ca_system_score_codex":0.00009773807,"about_ca_system_score_gemma":0.000016314962,"threshold_uncertainty_score":0.81898886},"labels":[],"label_agreement":null},{"id":"W4224298808","doi":"10.1007/s43069-022-00136-w","title":"Distributed Integral Column Generation for Set Partitioning Problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Scheduling (production processes); Heuristic; Crew scheduling; Column (typography); Heuristics; Set (abstract data type); Tree (set theory); Integer programming; Algorithm; Mathematics; Combinatorics","score_opus":0.12749409430182423,"score_gpt":0.3847809595954399,"score_spread":0.25728686529361566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224298808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057670124,0.00009293112,0.93664944,0.0020470277,0.00036420827,0.0014934612,0.00078375795,0.0003347739,0.00056429324],"genre_scores_gemma":[0.93257207,0.000014341771,0.059298597,0.000046577185,0.00013094,0.003570113,0.003235473,0.000049849616,0.0010820663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984094,0.00025994857,0.00026269088,0.00021492154,0.0003819771,0.00047107632],"domain_scores_gemma":[0.99926764,0.00008841882,0.0000099097215,0.00023576144,0.00031664476,0.0000816319],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017188855,0.000093698356,0.00010948093,0.00018703594,0.0019663791,0.00026890513,0.00019297563,0.000042183477,0.00037640124],"category_scores_gemma":[0.00030349812,0.00010953002,0.000046561934,0.0006876673,0.000043444357,0.00024174068,0.0001112917,0.00038801398,0.000014535187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003498118,0.00002223434,0.00029152932,0.000012451298,0.000015521759,3.6139247e-7,0.00022828647,0.959419,0.008631924,0.0036559575,0.026822444,0.000896785],"study_design_scores_gemma":[0.00030232905,0.000097755874,0.0000363098,0.0000051233246,0.0000036307858,0.000004349706,0.00061600725,0.955868,0.002667821,0.00017079209,0.040109914,0.000117936965],"about_ca_topic_score_codex":0.000050071292,"about_ca_topic_score_gemma":0.0002844448,"teacher_disagreement_score":0.8773508,"about_ca_system_score_codex":0.00037370098,"about_ca_system_score_gemma":0.000098280056,"threshold_uncertainty_score":0.9993329},"labels":[],"label_agreement":null},{"id":"W4225279627","doi":"10.1155/2022/4124950","title":"Expected Length of the Shortest Path of the Traveling Salesman Problem in 3D Space","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Shortest path problem; Travelling salesman problem; Constrained Shortest Path First; Yen's algorithm; Path length; K shortest path routing; Euclidean shortest path; Mathematical optimization; Path (computing); Any-angle path planning; Longest path problem; Shortest Path Faster Algorithm; Mathematics; Widest path problem; Computer science; Motion planning; Dijkstra's algorithm; Combinatorics; Artificial intelligence; Graph","score_opus":0.00833214409765692,"score_gpt":0.22956270176309485,"score_spread":0.22123055766543792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225279627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97474897,0.00014066795,0.024517765,0.000082447834,0.0002604445,0.00017004252,0.00001200626,0.00001216225,0.000055484914],"genre_scores_gemma":[0.93963313,0.000037866113,0.0602745,0.000005813843,0.000015253782,0.0000045245656,0.000002469476,0.00001914379,0.000007283694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99879104,0.00009980347,0.00063117704,0.00006138267,0.00032103527,0.000095544565],"domain_scores_gemma":[0.99928325,0.00007194136,0.00040475148,0.00012296018,0.000099207806,0.00001788639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966516,0.0000802168,0.00018475352,0.00007180628,0.00004878457,0.0000026171003,0.00019017163,0.0000257326,0.000012850004],"category_scores_gemma":[0.000033416258,0.00005951824,0.00009691732,0.00055211736,0.000021932023,0.00011850623,0.0000037479851,0.00032625877,2.3629962e-8],"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.0000247694,0.000031155425,0.015780732,0.0000337224,0.000015396385,0.0000015380643,0.004694718,0.93562955,0.042242818,0.00008494387,0.0000021538642,0.0014585009],"study_design_scores_gemma":[0.0017146649,0.00012962853,0.90719783,0.00033703056,0.000087778,0.000016232509,0.0042499397,0.047890596,0.03768472,0.00037661535,0.00013802454,0.00017694416],"about_ca_topic_score_codex":0.00000440344,"about_ca_topic_score_gemma":0.000032025666,"teacher_disagreement_score":0.8914171,"about_ca_system_score_codex":0.0000682895,"about_ca_system_score_gemma":0.000048008373,"threshold_uncertainty_score":0.24270834},"labels":[],"label_agreement":null},{"id":"W4225691621","doi":"10.1007/s10479-022-04658-8","title":"Optimization of the technician routing and scheduling problem for a telecommunication industry","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Technician; Computer science; Scheduling (production processes); Operations research; Job shop scheduling; Metaheuristic; Service provider; Time horizon; Routing (electronic design automation); Service (business); Mathematical optimization; Computer network; Operations management; Artificial intelligence; Engineering; Business","score_opus":0.1611433904965729,"score_gpt":0.4261114328978416,"score_spread":0.2649680424012687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225691621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49505594,0.0007099957,0.4939414,0.0055016056,0.0000773316,0.0023510573,0.000080562386,0.00012764343,0.0021544637],"genre_scores_gemma":[0.78556263,0.000060210954,0.21408893,0.000016724243,0.000010986323,0.00017468803,0.000011402502,0.000016903085,0.00005753664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988769,0.00032302388,0.000291764,0.00009697616,0.0002523445,0.00015898305],"domain_scores_gemma":[0.99896854,0.00019744581,0.000032958924,0.00029983546,0.00047804235,0.000023175759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731756,0.00005267732,0.00009672324,0.00018079215,0.0005944839,0.000030738818,0.000282993,0.000064900414,0.000024758814],"category_scores_gemma":[0.0005510121,0.000050384755,0.000029051362,0.0008470341,0.00007417463,0.00011155772,0.00022002256,0.00048300254,9.2635254e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035415742,0.000022056614,0.00025946085,0.00003647546,0.000011917375,1.5660989e-8,0.00040926097,0.9899687,0.004684906,0.0023092115,0.000060012535,0.00223445],"study_design_scores_gemma":[0.00010978488,0.000043252796,0.00020272822,0.00003013426,0.0000030734607,0.000001418024,0.000665357,0.9849743,0.013674464,0.000097505545,0.00015024819,0.00004772158],"about_ca_topic_score_codex":0.000032748478,"about_ca_topic_score_gemma":0.00000828128,"teacher_disagreement_score":0.2905067,"about_ca_system_score_codex":0.000027982298,"about_ca_system_score_gemma":0.000084196145,"threshold_uncertainty_score":0.45723495},"labels":[],"label_agreement":null},{"id":"W4226110099","doi":"10.1109/tits.2022.3156685","title":"Stochastic Multi-Objective Vehicle Routing Model in Green Environment With Customer Satisfaction","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Customer satisfaction; Vehicle routing problem; Computer science; Routing (electronic design automation); Transport engineering; Business; Engineering; Marketing; Computer network","score_opus":0.024506810086741965,"score_gpt":0.24317703609207894,"score_spread":0.21867022600533698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226110099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11589548,0.000035546007,0.882375,0.000012019011,0.00043290702,0.00075320003,0.00014039729,0.00030906804,0.000046397592],"genre_scores_gemma":[0.99407905,0.000019387957,0.0047622644,0.000017211887,0.000016112803,0.00075941964,0.000024111947,0.00009750543,0.00022493974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793804,0.00016479522,0.00064948574,0.00039298873,0.0005272996,0.00032740858],"domain_scores_gemma":[0.9994173,0.0000983283,0.00010584811,0.00024223316,0.00004127532,0.00009500402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003845013,0.0002873653,0.0002903611,0.00043195902,0.0002750915,0.000029516259,0.00011898127,0.00008404829,0.00011600554],"category_scores_gemma":[0.000001088489,0.00032164276,0.00008629729,0.00052205677,0.00003272038,0.00020862912,4.7225288e-7,0.0005697043,0.00003366324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079186306,0.00010822413,0.00046446014,0.000044327866,0.0000685786,0.000005969621,0.0041960855,0.99058235,0.0010531793,0.00004017698,0.0000023301652,0.003355145],"study_design_scores_gemma":[0.00072249066,0.00008809228,0.0012626348,0.000050767507,0.00005337462,0.000007676298,0.0024184424,0.993005,0.0020266976,0.0000042062657,0.000020286761,0.00034033894],"about_ca_topic_score_codex":0.0006736552,"about_ca_topic_score_gemma":0.00038043875,"teacher_disagreement_score":0.87818354,"about_ca_system_score_codex":0.0007704045,"about_ca_system_score_gemma":0.00003906178,"threshold_uncertainty_score":0.9999236},"labels":[],"label_agreement":null},{"id":"W4226200202","doi":"10.1609/aaai.v36i4.20294","title":"Learning to Search in Local Branching","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","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","funders":"","keywords":"Leverage (statistics); Local search (optimization); Mathematical optimization; Heuristic; Computer science; Linear programming; Mathematics; Integer programming; Algorithm; Constraint (computer-aided design); Local optimum; Artificial intelligence","score_opus":0.05860159410969267,"score_gpt":0.3077845184515558,"score_spread":0.24918292434186312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226200202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93694806,0.000012546233,0.05244656,0.000692865,0.00030532802,0.00035792543,0.0000028797094,0.00016473282,0.0090691205],"genre_scores_gemma":[0.9960514,0.000006079326,0.0036465605,0.00007610987,0.000027152977,0.000038521473,3.7369372e-7,0.000027115311,0.00012671329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986094,0.000044242475,0.00038745973,0.00023910092,0.00041017338,0.00030960256],"domain_scores_gemma":[0.9995551,0.000090277645,0.000057600053,0.00010554604,0.000128755,0.0000626822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080865,0.0001358667,0.0001819171,0.00022197902,0.00019884124,0.000061349594,0.0006550254,0.00003754304,0.00022371481],"category_scores_gemma":[0.00028951705,0.0001321592,0.000050473915,0.001054397,0.000065194414,0.000096935226,0.00029137835,0.00073969894,0.000029654315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003350855,0.000028329048,0.0007586865,0.000027383176,0.000004395362,3.6127557e-7,0.0039776587,0.85985297,0.028761348,0.023088442,0.000018654997,0.08344829],"study_design_scores_gemma":[0.000020214275,0.00011047527,0.00026746132,0.00007214972,0.000002879979,0.0000025347529,0.004890411,0.8038375,0.18735108,0.0031796969,0.00010705904,0.0001585627],"about_ca_topic_score_codex":0.000032689655,"about_ca_topic_score_gemma":0.000005346755,"teacher_disagreement_score":0.15858974,"about_ca_system_score_codex":0.00014939695,"about_ca_system_score_gemma":0.00003422554,"threshold_uncertainty_score":0.5389296},"labels":[],"label_agreement":null},{"id":"W4229363931","doi":"10.1016/j.eswa.2022.117292","title":"Formulation and exact algorithms for electric vehicle production routing problem","year":2022,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"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 Windsor","funders":"European Regional Development Fund; Ministerio de Ciencia e Innovación; Agencia Estatal de Investigación; Generalitat Valenciana; European Commission","keywords":"Computer science; Solver; Vehicle routing problem; Mathematical optimization; Electric vehicle; Algorithm; Production (economics); Benchmark (surveying); Supply chain; Decomposition; Routing (electronic design automation); Mathematics","score_opus":0.01764929647510787,"score_gpt":0.2651405152044407,"score_spread":0.24749121872933283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229363931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009997082,0.0007837646,0.9850833,0.00015263565,0.000120121294,0.0028384358,0.000011301149,0.0006214478,0.00039195069],"genre_scores_gemma":[0.90585387,0.000017167946,0.08211252,0.000015602553,0.00025335202,0.011408455,0.00005557676,0.00006681816,0.00021666345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903136,0.00005091649,0.00026021947,0.0002726993,0.00016861365,0.00021617171],"domain_scores_gemma":[0.9994783,0.00007360146,0.00008704433,0.00022825389,0.0000808451,0.000051945837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041633323,0.0001265017,0.00014066751,0.00011386152,0.00056988007,0.000053623055,0.00008840523,0.000034610126,0.000003870093],"category_scores_gemma":[0.000013664067,0.00012889186,0.000020268082,0.0005350568,0.000008340344,0.00014579971,0.000021916561,0.000111567155,0.000001480229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000139094645,0.00004283063,0.0005666654,0.00011923987,0.000045730863,1.9386222e-7,0.0011550669,0.9457363,0.026126748,0.0038247972,0.00075392175,0.021614589],"study_design_scores_gemma":[0.00030628158,0.000057149595,0.00015977483,0.000012027118,0.000012132486,0.000044229386,0.00044329968,0.9804971,0.0012591331,0.000057715777,0.016956056,0.00019510803],"about_ca_topic_score_codex":0.00002170634,"about_ca_topic_score_gemma":0.000001207932,"teacher_disagreement_score":0.90297073,"about_ca_system_score_codex":0.00018252313,"about_ca_system_score_gemma":0.000023223745,"threshold_uncertainty_score":0.52560574},"labels":[],"label_agreement":null},{"id":"W4229698747","doi":"10.1007/978-0-387-74759-0_667","title":"Stochastic Vehicle Routing Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Environmental science; Routing (electronic design automation); Mathematical optimization; Mathematics; Computer network","score_opus":0.014853531005721492,"score_gpt":0.22130532858053298,"score_spread":0.2064517975748115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229698747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016400043,0.0005636813,0.53335375,0.000009723304,0.00040820695,0.00033917496,0.000017031374,0.00040869985,0.46488333],"genre_scores_gemma":[0.007540598,0.01811783,0.6471233,0.000048433983,0.001192554,0.00007550812,0.00078520144,0.0011657645,0.32395086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998119,0.000028329188,0.0008202409,0.00034366988,0.00039589664,0.00029286396],"domain_scores_gemma":[0.9987989,0.00013925078,0.00033324998,0.0004119194,0.00021413203,0.000102557584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002182062,0.00043960998,0.00053745083,0.00028767472,0.00008972056,0.000019884903,0.00023881106,0.00047278593,0.00039865126],"category_scores_gemma":[0.000121924895,0.0005232043,0.00013833094,0.00013026802,0.00008012552,0.00018433567,0.000059648566,0.0004167694,0.00004135875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031645698,0.000008320671,0.000008764016,0.00010871862,0.000053159725,0.000002857978,0.00034907766,0.9941281,0.000007784321,0.0005496428,0.0011146611,0.0036657422],"study_design_scores_gemma":[0.00031487484,0.00003467659,0.000009672741,0.00030775982,0.00007759654,0.000011980302,0.000005496733,0.9908237,0.000018365079,0.00013183155,0.007744524,0.00051955285],"about_ca_topic_score_codex":0.0000030938088,"about_ca_topic_score_gemma":0.0000010192083,"teacher_disagreement_score":0.14093249,"about_ca_system_score_codex":0.0001345767,"about_ca_system_score_gemma":0.000074479234,"threshold_uncertainty_score":0.99972194},"labels":[],"label_agreement":null},{"id":"W4230415688","doi":"10.1002/net.20208","title":"Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs","year":2007,"lang":"en","type":"article","venue":"Networks","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":"Université de Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Maxima and minima; Guided Local Search; Local optimum; Local search (optimization); Multi-commodity flow problem; Convergence (economics); Flow network; Heuristic; Mathematics; Minimum-cost flow problem; Computer science; Algorithm","score_opus":0.01783978272861802,"score_gpt":0.2649947361305507,"score_spread":0.24715495340193266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230415688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021783183,0.00040872488,0.99343824,0.000041494102,0.0007170809,0.0009141879,0.000010942245,0.000865855,0.0014251528],"genre_scores_gemma":[0.27569634,0.000022101694,0.7227364,0.0002738641,0.0008516232,0.000108302615,0.00009887153,0.00014094042,0.00007154372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800795,0.00006444369,0.00039904137,0.00032327216,0.00020971958,0.0009955408],"domain_scores_gemma":[0.99847585,0.0006710718,0.00008733827,0.00039604647,0.00014938615,0.00022032343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001539875,0.00030696456,0.00036585671,0.0000626915,0.00021882947,0.00007261543,0.00020971209,0.0002630925,0.00003321854],"category_scores_gemma":[0.00003961959,0.00029836362,0.000081395054,0.0004917108,0.00006076896,0.00012216526,0.000026463716,0.00037632062,0.00000695141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000583923,0.00003216715,0.0013134808,0.0000460709,0.00004851758,0.0000043329082,0.000036704885,0.95392376,0.0000113435935,0.00003577447,0.00320687,0.0412826],"study_design_scores_gemma":[0.0015934944,0.00007424855,0.0006317828,0.00010337294,0.00004280705,0.000004708829,0.00000684291,0.99029803,0.0001515581,0.0000429584,0.0066662105,0.00038400307],"about_ca_topic_score_codex":0.000013057101,"about_ca_topic_score_gemma":0.00007084248,"teacher_disagreement_score":0.27351803,"about_ca_system_score_codex":0.00016746207,"about_ca_system_score_gemma":0.000026980213,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W4233980123","doi":"10.1287/opre.1110.0994","title":"Contributors","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Computer science; Mathematical economics; Mathematics","score_opus":0.16710939077760506,"score_gpt":0.38864849971291304,"score_spread":0.22153910893530798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233980123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2211336,0.0002540907,0.47741407,0.00017660802,0.0004107904,0.00057464937,0.000018193945,0.00082891673,0.29918906],"genre_scores_gemma":[0.90301085,0.000033856366,0.09522065,0.000009905697,0.00005212683,0.00005111956,0.000007123644,0.000021839734,0.001592538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992329,0.00014331703,0.0001139403,0.00009028673,0.0001835296,0.00023602169],"domain_scores_gemma":[0.99944407,0.00005502188,0.0000014425426,0.00020320453,0.0002273611,0.00006889688],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009278147,0.00004772683,0.000057548114,0.00014926259,0.00019103776,0.000053821375,0.00013626747,0.00004700602,0.0010172194],"category_scores_gemma":[0.00024221884,0.00004749859,0.000015355488,0.0004483343,0.000047042795,0.00012206935,0.000028004844,0.00021273307,0.0004056952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011639521,0.00012436928,0.0030514074,0.000039359715,0.00008011716,0.000019588153,0.0057802172,0.8653103,0.02127719,0.069765784,0.011243982,0.023296049],"study_design_scores_gemma":[0.00021644587,0.00003273486,0.00227152,0.000008573844,0.0000024600406,0.0000042108686,0.0001996698,0.9624001,0.028242474,0.00017555304,0.006313086,0.00013318929],"about_ca_topic_score_codex":0.000053823664,"about_ca_topic_score_gemma":0.000030945375,"teacher_disagreement_score":0.68187726,"about_ca_system_score_codex":0.00005240384,"about_ca_system_score_gemma":0.000030328121,"threshold_uncertainty_score":0.999896},"labels":[],"label_agreement":null},{"id":"W4235662733","doi":"10.4018/978-1-5225-2237-9.ch010","title":"Modeling and Simulation Analyses of Healthcare Delivery Operations for Inter-Hospital Patient Transfers","year":2017,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","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":true,"ca_institutions":"Queen's University","funders":"","keywords":"Sizing; Operations research; Health care; Computer science; Transfer (computing); Operations management; Healthcare service; Healthcare delivery; Medical emergency; Engineering; Medicine; Economics","score_opus":0.04929670372028253,"score_gpt":0.3279334174875206,"score_spread":0.27863671376723803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235662733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011116021,0.00057669135,0.93558455,0.000035346577,0.00041175843,0.0008898288,0.00073152944,0.00017874766,0.05047554],"genre_scores_gemma":[0.9734976,0.000017927496,0.026066568,0.00001866601,0.000053362473,0.000014314954,0.00002254241,0.000048360485,0.00026064052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990345,0.000013539584,0.0004360609,0.00023063725,0.00013428758,0.00015096304],"domain_scores_gemma":[0.99930656,0.00003873652,0.000058468984,0.0002655909,0.0002537035,0.00007691148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007940876,0.00024362442,0.00035876487,0.00007230389,0.00011578451,0.000053475243,0.00010883108,0.0002448541,0.0000023918521],"category_scores_gemma":[0.00003141627,0.0002700091,0.00013843537,0.0000060462617,0.000036761492,0.00007057082,0.000026213893,0.00011997935,6.417022e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011936139,0.0000025433817,0.0000034146765,0.00014683403,0.000101060345,7.320197e-7,0.00025752152,0.9587678,0.00002928592,0.022829477,0.000004559021,0.01784484],"study_design_scores_gemma":[0.00023492741,0.00013713785,0.0000014712219,0.00025502147,0.00011121239,9.856847e-7,0.000029007077,0.9953699,0.000100738725,0.0034495036,0.00007168651,0.00023840962],"about_ca_topic_score_codex":0.000126456,"about_ca_topic_score_gemma":0.00010781655,"teacher_disagreement_score":0.9623816,"about_ca_system_score_codex":0.000121788595,"about_ca_system_score_gemma":0.00005077953,"threshold_uncertainty_score":0.9999752},"labels":[],"label_agreement":null},{"id":"W4239618018","doi":"10.1002/net.20182","title":"A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":78,"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; Regret; Heuristic; Mathematical optimization; Computer science; Vehicle routing problem; Routing (electronic design automation); Class (philosophy); Process (computing); Operations research; Mathematics; Artificial intelligence; Machine learning","score_opus":0.00953183509274726,"score_gpt":0.24791674975548805,"score_spread":0.23838491466274078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239618018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07699477,0.0010727231,0.92091805,0.000024852798,0.00021851536,0.00031767602,0.000002540019,0.000288917,0.00016197682],"genre_scores_gemma":[0.9657492,0.000027177723,0.03391341,0.000040889765,0.00013538163,0.000018171386,0.000007756953,0.00005762762,0.000050354283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990772,0.000021057274,0.00024388294,0.00019664686,0.00007371215,0.00038747228],"domain_scores_gemma":[0.9992256,0.00047642534,0.00004071332,0.00012276792,0.00003368848,0.00010076658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007458464,0.00014829551,0.00017610421,0.00005445692,0.000113147915,0.000050331808,0.000060172682,0.00012328388,0.0000036527663],"category_scores_gemma":[0.00010962543,0.00015998624,0.000025254278,0.00015650182,0.000038503345,0.00006417789,0.000029699162,0.0001889414,8.815511e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009095479,0.0000040746227,0.00056511647,0.00006171155,0.000016026557,7.716836e-7,0.00022077115,0.94355005,0.00012656278,0.00017596608,0.000027853363,0.05524202],"study_design_scores_gemma":[0.00047539244,0.000029456101,0.003400398,0.00008177896,0.00002360208,0.0000127231315,0.00002484127,0.99541366,0.0000095775595,0.00029850603,0.00005687045,0.00017316731],"about_ca_topic_score_codex":0.0000033235376,"about_ca_topic_score_gemma":0.000016985385,"teacher_disagreement_score":0.8887545,"about_ca_system_score_codex":0.000038285714,"about_ca_system_score_gemma":0.000005083383,"threshold_uncertainty_score":0.65240496},"labels":[],"label_agreement":null},{"id":"W4242959047","doi":"10.1504/ijor.2019.096942","title":"An integrated production and distribution problem with direct shipment: a case from Moroccan bottled-water market","year":2018,"lang":"en","type":"article","venue":"International Journal of Operational Research","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":"Université de Montréal","funders":"","keywords":"Production (economics); Context (archaeology); Bottled water; Product (mathematics); Operations research; Computer science; Routing (electronic design automation); Vehicle routing problem; Distribution (mathematics); Integer programming; Business; Operations management; Mathematics; Economics; Environmental science; Microeconomics; Algorithm","score_opus":0.03279020252808257,"score_gpt":0.35582834798141716,"score_spread":0.3230381454533346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242959047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93798757,0.00007491598,0.059148945,0.0010836092,0.00042068204,0.00020277704,0.00010784858,0.00004407213,0.00092958385],"genre_scores_gemma":[0.9620346,0.00005282914,0.036729313,0.000019296762,0.00086256175,0.000012581627,0.00012611624,0.000024020283,0.00013869852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979945,0.00032315074,0.0003727096,0.00019187725,0.00091546477,0.00020232137],"domain_scores_gemma":[0.99659646,0.0001301264,0.000052319774,0.00011432381,0.0029729868,0.00013381372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020941158,0.00012043018,0.00013429714,0.0002480714,0.00017249862,0.00033812554,0.00021723864,0.000061374565,0.0004083629],"category_scores_gemma":[0.00034845006,0.000085558124,0.00002303499,0.00015986392,0.0001642861,0.00076616026,0.00003817486,0.00036195244,0.000008026045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049352827,0.0010440329,0.02493881,0.00009079227,0.0024459579,0.0036746438,0.010336139,0.690893,0.15187691,0.0015257035,0.020092249,0.0881465],"study_design_scores_gemma":[0.0020249733,0.001260319,0.006873463,0.00051872403,0.000053048054,0.0063738488,0.0010879672,0.8226914,0.14273779,0.00090395927,0.014927075,0.0005474284],"about_ca_topic_score_codex":0.000107724954,"about_ca_topic_score_gemma":0.00012558517,"teacher_disagreement_score":0.13179843,"about_ca_system_score_codex":0.00030715665,"about_ca_system_score_gemma":0.000120427,"threshold_uncertainty_score":0.4471287},"labels":[],"label_agreement":null},{"id":"W4243772339","doi":"10.1002/9780470400531.eorms1045.pub2","title":"Tabu Search","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management 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é de Montréal; Polytechnique Montréal","funders":"","keywords":"Tabu search; Guided Local Search; Metaheuristic; Mathematical optimization; Local optimum; Hill climbing; Computer science; Beam search; Local search (optimization); Function (biology); Algorithm; Search algorithm; Mathematics","score_opus":0.042940432336543086,"score_gpt":0.33719461061731015,"score_spread":0.29425417828076705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243772339","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013080453,0.0008013343,0.020587455,0.000023826635,0.00020752345,0.00068358483,0.000018266923,0.00017806161,0.9773691],"genre_scores_gemma":[0.0010670032,0.07857766,0.21378833,0.000009840101,0.00013147587,0.00014060746,0.000017749015,0.00022365166,0.70604366],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980417,0.000070040056,0.00021435354,0.00038364093,0.0008069472,0.0004833481],"domain_scores_gemma":[0.9991321,0.00003098407,0.000013523045,0.00050188525,0.00014777087,0.00017374687],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016618591,0.00015338974,0.00017572739,0.0014932546,0.00021970535,0.000103752725,0.0006216773,0.00008186033,0.0010467517],"category_scores_gemma":[0.0000769604,0.00014922528,0.000018279457,0.0014744785,0.00091427984,0.00019123076,0.00035655632,0.00026036156,0.00009500762],"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.000009245551,0.00023416356,0.0006015138,0.0020456873,0.00017595205,0.000031731568,0.0015646473,0.035177954,0.0005664487,0.077008106,0.7712305,0.111354046],"study_design_scores_gemma":[0.0005040826,0.00017582798,0.00093758455,0.0008209608,0.000029191562,0.0000046494597,0.00047091863,0.12008756,0.0004887356,0.00021743888,0.87556744,0.00069560274],"about_ca_topic_score_codex":0.00020197289,"about_ca_topic_score_gemma":0.0000958438,"teacher_disagreement_score":0.27132547,"about_ca_system_score_codex":0.000047895257,"about_ca_system_score_gemma":0.000080947575,"threshold_uncertainty_score":0.9998664},"labels":[],"label_agreement":null},{"id":"W4245026044","doi":"10.1002/net.20178","title":"Path inequalities for the vehicle routing problem with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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":"HEC Montréal; Deakin University","keywords":"Vehicle routing problem; Context (archaeology); Polytope; Path (computing); Travelling salesman problem; Mathematical optimization; Node (physics); Mathematics; Computer science; Dimension (graph theory); Routing (electronic design automation); Combinatorics","score_opus":0.014139643962934432,"score_gpt":0.2414425082797293,"score_spread":0.22730286431679486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245026044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080912905,0.00028035714,0.9871503,0.00006670962,0.00013339853,0.00043234762,0.0000024529952,0.00045032206,0.003392787],"genre_scores_gemma":[0.8652211,0.0000143299685,0.13336541,0.0001533693,0.00060082093,0.000046915353,0.000011034504,0.000083515864,0.00050351594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904764,0.00003569844,0.0002432423,0.00013330967,0.00012535864,0.00041474478],"domain_scores_gemma":[0.9988293,0.0007980864,0.000051084804,0.0002091379,0.00006164307,0.000050727762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014643433,0.00014007794,0.00014200434,0.000027649467,0.00016884679,0.00005949319,0.00014776891,0.000091751164,0.000020674872],"category_scores_gemma":[0.000035459812,0.00009918712,0.00003972361,0.00023265475,0.00003220301,0.00008250477,0.000022337828,0.00020103612,0.0000058295736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020617015,0.0000046444566,0.00095129514,0.000019852398,0.000032750097,0.0000010182928,0.00038465968,0.97643906,0.00006432827,0.0005603373,0.0006383513,0.020883096],"study_design_scores_gemma":[0.0003688293,0.000036252775,0.0007810053,0.000048906884,0.000021800886,0.000003831012,0.00012975688,0.9960519,0.00018624171,0.00005633071,0.0021597838,0.00015532378],"about_ca_topic_score_codex":0.0000067162696,"about_ca_topic_score_gemma":0.000008664168,"teacher_disagreement_score":0.8571298,"about_ca_system_score_codex":0.000043642143,"about_ca_system_score_gemma":0.0000108757795,"threshold_uncertainty_score":0.40447333},"labels":[],"label_agreement":null},{"id":"W4245400092","doi":"10.1007/978-1-4939-7131-2_101379","title":"Trip Planning Problem","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","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":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.03160166859799997,"score_gpt":0.2646704322950444,"score_spread":0.23306876369704443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245400092","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000334386,0.00018083013,0.18730336,0.000009212094,0.00024770532,0.00012436861,0.0000043358605,0.000987131,0.8111397],"genre_scores_gemma":[0.000052288295,0.000024829713,0.28137487,0.000040542953,0.0003376337,0.0000039948122,0.000019149798,0.00014030846,0.7180064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921465,0.0000069093862,0.00026621745,0.00018851859,0.00014231533,0.00018139833],"domain_scores_gemma":[0.99953914,0.000049704566,0.00004607923,0.00025033188,0.000051258263,0.00006351774],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019923967,0.00024575606,0.0002439401,0.0001281083,0.000034678753,0.000036159538,0.000140911,0.0003240089,0.004552596],"category_scores_gemma":[0.000011036866,0.00024952152,0.00006740699,0.00002285725,0.00002695265,0.0000454022,0.00003412211,0.0002650637,0.0006333793],"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.000014428476,0.000008328923,0.000033625598,0.0006721868,0.00054433447,0.000051838662,0.0011842956,0.49492735,0.00017300837,0.109257475,0.35071707,0.042416077],"study_design_scores_gemma":[0.00023044931,0.000034527224,0.0000037412515,0.00033801197,0.000049142818,0.00001527071,0.0000072714365,0.10648478,0.00025514883,0.009205503,0.8826841,0.0006920158],"about_ca_topic_score_codex":5.287765e-7,"about_ca_topic_score_gemma":4.274993e-7,"teacher_disagreement_score":0.53196704,"about_ca_system_score_codex":0.000060113347,"about_ca_system_score_gemma":0.000015342292,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W4245527820","doi":"10.1002/net.20063","title":"Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem","year":2005,"lang":"en","type":"article","venue":"Networks","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":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Probabilistic logic; Computation; Computer science; Mathematical optimization; Traveling purchaser problem; Mathematics; Bottleneck traveling salesman problem; Algorithm; Artificial intelligence","score_opus":0.01835366463530712,"score_gpt":0.24281943364682573,"score_spread":0.2244657690115186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245527820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03151119,0.001323255,0.96534145,0.00015425522,0.00012512048,0.0006295686,0.0000021708431,0.00020183656,0.0007111469],"genre_scores_gemma":[0.91016465,0.000103234095,0.08912108,0.000051088387,0.00040658694,0.000057804016,0.0000040658188,0.00004304571,0.000048447968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916667,0.000043501703,0.00019729628,0.00017134499,0.00010368905,0.0003175207],"domain_scores_gemma":[0.9991509,0.00054413767,0.000020077303,0.00017052644,0.000053104504,0.00006128941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006074476,0.00012502221,0.0001185952,0.00003172392,0.00016621614,0.00006178251,0.00011927042,0.000087249275,0.000010914682],"category_scores_gemma":[0.000017521515,0.00010014483,0.00003729768,0.00015472605,0.000042387637,0.00002439815,0.00002638001,0.00021442563,0.000002771001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007649162,0.000009567872,0.00015010248,0.000036196678,0.000018267325,1.9548959e-7,0.0002887082,0.927133,0.000022686718,0.00076551485,0.00009111339,0.07147696],"study_design_scores_gemma":[0.00027843757,0.000022762657,0.00036604758,0.000030559753,0.000027263042,0.0000041324774,0.00003146975,0.99846536,0.00004769225,0.000041480773,0.0005654216,0.00011936489],"about_ca_topic_score_codex":0.0000020346367,"about_ca_topic_score_gemma":0.000006257997,"teacher_disagreement_score":0.87865347,"about_ca_system_score_codex":0.000052047013,"about_ca_system_score_gemma":0.00001359362,"threshold_uncertainty_score":0.40837875},"labels":[],"label_agreement":null},{"id":"W4245993692","doi":"10.1007/978-3-030-32177-2_15","title":"Location-Routing and Location-Arc Routing","year":2019,"lang":"en","type":"book-chapter","venue":"Location Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"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":"Static routing; Policy-based routing; Equal-cost multi-path routing; Computer science; Link-state routing protocol; Multipath routing; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Geographic routing; Computer network; Arc routing; Routing (electronic design automation); Routing protocol","score_opus":0.02579907249741598,"score_gpt":0.27499470653268526,"score_spread":0.2491956340352693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245993692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040575486,0.0011158744,0.7234407,0.00020332602,0.0011582637,0.0006822732,0.000005203599,0.00072186405,0.27226675],"genre_scores_gemma":[0.90539205,0.00014437741,0.034328546,0.00018495257,0.00027920894,0.00001708254,0.00003331572,0.00014581674,0.059474625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973854,0.000027765967,0.0006686766,0.0007391329,0.00074727746,0.00043175777],"domain_scores_gemma":[0.99708205,0.0002624095,0.00028927514,0.00075098535,0.0014438281,0.00017144598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017923311,0.00038805642,0.00034651693,0.0004659265,0.00038750315,0.0003202183,0.000550009,0.0002602497,0.00006506916],"category_scores_gemma":[0.0008204448,0.00044541754,0.00003302767,0.0010443827,0.00042122017,0.00063057017,0.00014165725,0.00042284664,0.00030964505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030370798,0.000008068425,0.00045372214,0.00046093974,0.000029745755,0.0000011080261,0.0012805936,0.74082935,0.00080713007,0.21528313,0.00020275978,0.04064042],"study_design_scores_gemma":[0.00023819444,0.000020652778,0.0014934683,0.00080136576,0.000043147098,0.00002086448,0.000116144365,0.9913164,0.00057980313,0.0011769434,0.0034478176,0.0007452211],"about_ca_topic_score_codex":0.00001535983,"about_ca_topic_score_gemma":0.000006972072,"teacher_disagreement_score":0.9049863,"about_ca_system_score_codex":0.00039740506,"about_ca_system_score_gemma":0.00071461877,"threshold_uncertainty_score":0.9997998},"labels":[],"label_agreement":null},{"id":"W4246068167","doi":"10.1007/978-0-387-74759-0_702","title":"Vehicle Routing","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Computer science","score_opus":0.01355077143882855,"score_gpt":0.22493575977178323,"score_spread":0.2113849883329547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246068167","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022985741,0.00055725285,0.26441604,0.000011295318,0.00046657553,0.00020776122,0.000016238599,0.00042650066,0.73387533],"genre_scores_gemma":[0.0018243245,0.03229615,0.63182634,0.000041010753,0.0007744995,0.000019225432,0.0004171543,0.0006086611,0.33219263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843186,0.000024368917,0.00069553574,0.00028034498,0.00033264107,0.00023526623],"domain_scores_gemma":[0.99898183,0.0001109641,0.00025941813,0.00038879167,0.00017385613,0.00008515188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017959997,0.00036760722,0.00046533038,0.00024177217,0.00007281459,0.000014709685,0.0002124503,0.00045140577,0.0005832489],"category_scores_gemma":[0.00009197848,0.00044437693,0.00013652237,0.000103602455,0.00006656111,0.00016328497,0.00005059097,0.0003476382,0.000045188117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030945532,0.000005520474,0.000028273682,0.00006453493,0.00004447117,0.000005160967,0.00020813182,0.989853,0.000007121874,0.00087878015,0.0029900623,0.005911797],"study_design_scores_gemma":[0.0003019508,0.000027950058,0.00002239289,0.00018023283,0.00006940534,0.00001146719,0.000005879923,0.9435469,0.000091289425,0.00010584828,0.05509192,0.0005447795],"about_ca_topic_score_codex":0.0000021768356,"about_ca_topic_score_gemma":5.81393e-7,"teacher_disagreement_score":0.4016827,"about_ca_system_score_codex":0.00010840739,"about_ca_system_score_gemma":0.000058935297,"threshold_uncertainty_score":0.9998008},"labels":[],"label_agreement":null},{"id":"W4247344008","doi":"10.1002/net.20312","title":"A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO and LIFO accounting; Travelling salesman problem; Pickup; Computer science; Traveling purchaser problem; Mathematical optimization; Branch and cut; Algorithm; Mathematics; Set (abstract data type); Bottleneck traveling salesman problem; Integer programming; FIFO (computing and electronics); Artificial intelligence","score_opus":0.010209518403106783,"score_gpt":0.22035149513800273,"score_spread":0.21014197673489596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247344008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010404816,0.0020138882,0.9866517,0.00012003596,0.00007440209,0.00031664944,0.0000015072183,0.0001924255,0.00022456706],"genre_scores_gemma":[0.586503,0.0005004982,0.41235328,0.00017616595,0.00036136102,0.000021954378,0.0000040337427,0.000037454036,0.000042253414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935365,0.000022917604,0.00014707046,0.00015892305,0.00006843976,0.0002490218],"domain_scores_gemma":[0.9995255,0.00024157333,0.000028987231,0.00011388405,0.00003260714,0.00005744818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031592746,0.00013552446,0.00014109546,0.00002532651,0.00016394453,0.00007949559,0.00006946672,0.000085186126,0.0000021688825],"category_scores_gemma":[0.000007549956,0.0001027864,0.000021872938,0.00012377853,0.000028151051,0.00008091085,0.000011305597,0.0001839063,3.1505851e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006425662,0.0000024478927,0.00012235438,0.000010583974,0.000021411339,6.701829e-7,0.00020079673,0.5603572,0.000029065886,0.000054232885,0.000074235046,0.4391206],"study_design_scores_gemma":[0.00045014365,0.000062446044,0.000962589,0.00007873185,0.000040616844,0.000021713871,0.00003241767,0.99757487,0.000052248015,0.00010774423,0.00047263264,0.0001438396],"about_ca_topic_score_codex":0.0000032707142,"about_ca_topic_score_gemma":0.0000069975786,"teacher_disagreement_score":0.5760982,"about_ca_system_score_codex":0.00001778573,"about_ca_system_score_gemma":0.00000711371,"threshold_uncertainty_score":0.41915077},"labels":[],"label_agreement":null},{"id":"W4247553243","doi":"10.1287/inte.1110.0609","title":"Contributors","year":2011,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Business; Computer science","score_opus":0.0281790540709295,"score_gpt":0.24338214228324614,"score_spread":0.21520308821231665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247553243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03413164,0.00003414347,0.5653725,0.000027680866,0.00070305954,0.0001382815,0.0000060448774,0.00047279953,0.3991138],"genre_scores_gemma":[0.95518553,0.00008616591,0.04405455,0.0002970853,0.00017084712,0.0000023009047,0.0000025523739,0.00003918659,0.00016177772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990167,0.0000064832425,0.00040874633,0.000063686646,0.00022492523,0.00027944596],"domain_scores_gemma":[0.999448,0.00004118018,0.0000976102,0.00016452411,0.000069985785,0.00017871615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044099486,0.00014946042,0.00019052306,0.00019406682,0.00008581925,0.00006607749,0.00018966799,0.0000955131,0.00024844636],"category_scores_gemma":[0.000046713954,0.000121829544,0.00007623993,0.00025755545,0.000026132571,0.00011467699,0.000015303014,0.00043586193,0.0001859189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007732027,0.00006867868,0.0014287244,0.00003418427,0.000361335,0.000049828268,0.0013969503,0.8659715,0.00038929423,0.058200035,0.0041248933,0.06789727],"study_design_scores_gemma":[0.0045810402,0.00037688133,0.006503583,0.0001279067,0.00024318011,0.00038521586,0.0008869324,0.8470684,0.032662656,0.015892426,0.089378536,0.0018932145],"about_ca_topic_score_codex":4.1573688e-7,"about_ca_topic_score_gemma":2.5266903e-7,"teacher_disagreement_score":0.9210539,"about_ca_system_score_codex":0.00010402839,"about_ca_system_score_gemma":0.000023602306,"threshold_uncertainty_score":0.49680647},"labels":[],"label_agreement":null},{"id":"W4248514134","doi":"10.1002/atr.5670420402","title":"Multiple objective optimization of the fleet sizing problem for road freight transportation","year":2008,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sizing; Operations research; Computer science; Set (abstract data type); Mathematical optimization; Queueing theory; Sample (material); Transportation theory; Decision maker; Pareto principle; Fleet management; Mathematical model; Engineering; Mathematics","score_opus":0.012733425649113827,"score_gpt":0.24238161638303124,"score_spread":0.2296481907339174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248514134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35644305,0.00014438857,0.6426331,0.0000287887,0.00030694553,0.00033921847,0.000036524958,0.00003629203,0.000031710348],"genre_scores_gemma":[0.63123596,0.00012744965,0.36850467,0.0000075776593,0.000046023084,0.000011113224,0.000030941177,0.000028516632,0.000007739043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986038,0.000039071507,0.00082801393,0.00010710418,0.00027603094,0.0001459485],"domain_scores_gemma":[0.99865884,0.00013083038,0.0005353349,0.0001082574,0.0005215001,0.000045240573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023981497,0.00014365964,0.0002667974,0.00012451535,0.00010673901,0.0000056432104,0.00012906172,0.00008527355,0.0000070226215],"category_scores_gemma":[0.00006744784,0.000121949866,0.0001913507,0.00037187964,0.000037682446,0.0005403068,5.2349804e-7,0.00016112998,1.2393832e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010192636,0.000031325722,0.0037899576,0.00009986839,0.000048591985,0.0000015184827,0.003887702,0.9771855,0.012376641,0.000049901653,0.000009888262,0.002417199],"study_design_scores_gemma":[0.0062586903,0.00035094132,0.4320636,0.0004930493,0.00031458595,0.000024319752,0.00124392,0.42257166,0.13531658,0.00055021537,0.00031636812,0.00049604947],"about_ca_topic_score_codex":0.000004177085,"about_ca_topic_score_gemma":0.00002934381,"teacher_disagreement_score":0.5546138,"about_ca_system_score_codex":0.000068733956,"about_ca_system_score_gemma":0.000057470963,"threshold_uncertainty_score":0.49729714},"labels":[],"label_agreement":null},{"id":"W4249802611","doi":"10.1007/0-306-48213-4_16","title":"TSP Software","year":2006,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fortran; Travelling salesman problem; Java; Software; Pascal (unit); Heuristic; Programming language; Theoretical computer science; Focus (optics); Source code; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.011471762972186987,"score_gpt":0.2210551803163071,"score_spread":0.20958341734412012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249802611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012858392,0.0003297791,0.5795809,0.000010177171,0.0055469535,0.00027885442,0.000028782193,0.0013679037,0.41285536],"genre_scores_gemma":[0.0006563603,0.00061825383,0.63268894,0.00007038014,0.003731081,0.000053264088,0.002743041,0.0012426187,0.35819605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983987,0.000028700584,0.0005580059,0.00035960966,0.0003733748,0.00028156035],"domain_scores_gemma":[0.9989119,0.00010950846,0.00016986599,0.0004730251,0.00023571364,0.00009995963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019682579,0.00048940163,0.0004761152,0.0002475518,0.00011067812,0.00010535591,0.00025814038,0.0008101025,0.00059028843],"category_scores_gemma":[0.00009210894,0.00061051577,0.00015188374,0.00010066867,0.000049847644,0.00015804476,0.00006091703,0.0004545894,0.00011269477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044746926,0.000008436168,0.000004754239,0.00006283446,0.000041012838,0.00000512854,0.000011188264,0.95327306,0.0000025626894,0.028310938,0.017005607,0.0012699882],"study_design_scores_gemma":[0.0011484066,0.000057315072,0.0000038137466,0.00021220578,0.00016919251,0.000007156406,0.0000010905376,0.8211206,0.0000921632,0.01744962,0.15849623,0.0012422005],"about_ca_topic_score_codex":0.0000026246764,"about_ca_topic_score_gemma":3.1663475e-7,"teacher_disagreement_score":0.14149062,"about_ca_system_score_codex":0.0003094077,"about_ca_system_score_gemma":0.00005608203,"threshold_uncertainty_score":0.9996346},"labels":[],"label_agreement":null},{"id":"W4250150436","doi":"10.1002/net.20170","title":"Locating a cycle in a transportation or a telecommunications network","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Hamiltonian path; Computer science; Graph; Mathematical optimization; Hamiltonian path problem; Hamiltonian (control theory); Mathematics; Theoretical computer science","score_opus":0.014452696560842734,"score_gpt":0.27393892333761466,"score_spread":0.2594862267767719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250150436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047588643,0.00039512152,0.9483387,0.00003086102,0.00016164817,0.00016382041,6.4007907e-7,0.0003668974,0.0029536635],"genre_scores_gemma":[0.79234636,0.00006573301,0.20728283,0.00006380229,0.00014704828,0.000016362826,0.00001969322,0.000032692697,0.000025506624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904907,0.00004643117,0.0003646638,0.00011155028,0.00007555743,0.00035275728],"domain_scores_gemma":[0.9993279,0.0003057018,0.000039421324,0.0002447352,0.00002687859,0.000055379467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008771574,0.00010332834,0.00012913994,0.00006947615,0.00007095701,0.000019505826,0.00014729069,0.0001166473,0.00004014106],"category_scores_gemma":[0.000035556124,0.000109362736,0.000027102014,0.0009219258,0.000016819731,0.00008634363,0.0000067925375,0.00030112543,0.000004599799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009828001,0.000010346105,0.00556482,0.000008911509,0.0000056606905,0.0000036248139,0.00032287688,0.95601255,0.000011915603,0.00016281033,0.00010939532,0.03777725],"study_design_scores_gemma":[0.00023993841,0.000008686559,0.028145848,0.00005036037,0.0000064398723,0.000002202414,0.000072913295,0.9706702,0.000019002986,0.00007168547,0.0005852696,0.0001274027],"about_ca_topic_score_codex":0.000027120113,"about_ca_topic_score_gemma":0.0017723494,"teacher_disagreement_score":0.7447577,"about_ca_system_score_codex":0.00006926566,"about_ca_system_score_gemma":0.0000126195955,"threshold_uncertainty_score":0.4459683},"labels":[],"label_agreement":null},{"id":"W4250280589","doi":"10.1002/net.20307","title":"A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem","year":2009,"lang":"en","type":"article","venue":"Networks","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Travelling salesman problem; Undirected graph; Orienteering; Vertex (graph theory); Bottleneck traveling salesman problem; Computer science; Branch and cut; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; 2-opt; Mathematics; Algorithm; Traveling purchaser problem; Mathematical optimization; Linear programming; Artificial intelligence","score_opus":0.015512761032151857,"score_gpt":0.2532832045046128,"score_spread":0.23777044347246093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250280589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014407927,0.000904537,0.99510795,0.0001500093,0.00024287455,0.00052830315,0.0000018211632,0.00053686043,0.0010868785],"genre_scores_gemma":[0.34164566,0.00022862044,0.6568667,0.00020075701,0.0006353867,0.00006179798,0.000009994282,0.000065796405,0.00028528264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991422,0.000048187412,0.0002316835,0.00016930532,0.000083777566,0.00032478885],"domain_scores_gemma":[0.9991829,0.00052691024,0.000043178177,0.00014273511,0.000051113915,0.000053195967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054584857,0.00014644967,0.00016792704,0.000032694345,0.000274199,0.00008498696,0.000110556284,0.00012020312,0.0000058731525],"category_scores_gemma":[0.000053019805,0.00012543665,0.000048226186,0.00036884853,0.00001839918,0.000053493277,0.000011591624,0.00023974372,6.864885e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029454814,0.0000037947405,0.000028793622,0.000007253493,0.000022582251,2.9701383e-7,0.00019129836,0.59197736,0.00007009343,0.000051099345,0.00027653945,0.40736791],"study_design_scores_gemma":[0.00042887995,0.000027716847,0.00075387524,0.000047093905,0.00003295986,0.000009615672,0.000020842414,0.99703056,0.00012977317,0.00026427658,0.0011026196,0.00015177445],"about_ca_topic_score_codex":0.0000028753834,"about_ca_topic_score_gemma":0.0000067468004,"teacher_disagreement_score":0.40721616,"about_ca_system_score_codex":0.00004120714,"about_ca_system_score_gemma":0.000012668787,"threshold_uncertainty_score":0.5115158},"labels":[],"label_agreement":null},{"id":"W4255492803","doi":"10.1002/net.20061","title":"Exact solution of the centralized network design problem on directed graphs","year":2005,"lang":"en","type":"article","venue":"Networks","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":"McGill University; University of Alberta","funders":"","keywords":"Column generation; Cutting-plane method; Lagrangian relaxation; Spanning tree; Steiner tree problem; Mathematical optimization; Branch and bound; Directed graph; Linear programming relaxation; Interior point method; Branch and cut; Mathematics; Relaxation (psychology); Constraint (computer-aided design); Upper and lower bounds; Tree (set theory); Point (geometry); Computer science; Linear programming; Integer programming; Combinatorics","score_opus":0.01629736232607209,"score_gpt":0.23421502231816474,"score_spread":0.21791765999209264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255492803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037354329,0.000502415,0.9913509,0.00011296329,0.00054164213,0.00044046188,0.0000010926849,0.00064580666,0.0026692697],"genre_scores_gemma":[0.744341,0.0001542704,0.25495362,0.000082413164,0.0003122051,0.000018486773,0.000004575482,0.000046644083,0.00008677759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988103,0.00027754993,0.00027422805,0.00013262463,0.00015285799,0.00035245545],"domain_scores_gemma":[0.9993789,0.00018427064,0.000077441146,0.00027293692,0.000038551774,0.000047895635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049909606,0.0001421458,0.00016879952,0.000030803338,0.00009230384,0.000016945696,0.00017260802,0.00013358751,0.000045641715],"category_scores_gemma":[0.000029305455,0.000113766575,0.000082117884,0.0005524272,0.000030936386,0.00005566368,0.000021520775,0.00024037322,0.000003872243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017354316,0.000013673914,0.0005026048,0.000006955669,0.000025857566,1.3680273e-7,0.000051423518,0.9736042,0.00012946042,0.00034170234,0.008123526,0.01718309],"study_design_scores_gemma":[0.00030517078,0.000016217982,0.0024892425,0.000084764695,0.00002020799,0.0000011264896,0.0000013441019,0.99459845,0.0006622553,0.000176293,0.0015266878,0.00011824374],"about_ca_topic_score_codex":0.0000035763333,"about_ca_topic_score_gemma":0.000005052309,"teacher_disagreement_score":0.74060553,"about_ca_system_score_codex":0.00006388223,"about_ca_system_score_gemma":0.000010519101,"threshold_uncertainty_score":0.4639266},"labels":[],"label_agreement":null},{"id":"W4280493947","doi":"10.1016/j.ejor.2023.01.007","title":"Small and large neighborhood search for the park-and-loop routing problem with parking selection","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"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":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Computer science; City logistics; Benchmark (surveying); Routing (electronic design automation); Selection (genetic algorithm); Metaheuristic; Parking lot; Set (abstract data type); Iterated local search; Transport engineering; Operations research; Mathematical optimization; Computer network; Artificial intelligence; Engineering; Geography; Mathematics","score_opus":0.10177030843987613,"score_gpt":0.34285156255309185,"score_spread":0.24108125411321574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280493947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34060228,0.0004736221,0.6530633,0.0023214326,0.0000993372,0.0005904075,0.000008581982,0.000095679185,0.0027453424],"genre_scores_gemma":[0.96624774,0.0002418023,0.032763932,0.000025333053,0.0003256653,0.000007917943,0.000003446073,0.00005408557,0.00033007082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998123,0.0006718219,0.00029016388,0.00012710383,0.00045542125,0.000332482],"domain_scores_gemma":[0.99804515,0.0011059672,0.00003874309,0.00007085714,0.0006443876,0.00009487452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012250135,0.000088600194,0.00010939771,0.00021132313,0.0005863117,0.00030523783,0.00015222053,0.000019043535,0.000014311739],"category_scores_gemma":[0.0004035056,0.000060316026,0.00002406836,0.00054642116,0.000053199306,0.0001650564,0.000073719835,0.0005162191,0.0000048056922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019254477,0.000034057746,0.022815524,0.00015750778,0.00025028476,0.00004673399,0.0037356825,0.9056363,0.0065807244,0.0068639433,0.0014239403,0.052262742],"study_design_scores_gemma":[0.0010258283,0.00030757504,0.0231129,0.0001230328,0.000014539505,0.00014552819,0.0007826779,0.97068036,0.0007859881,0.000044348188,0.0028622055,0.00011499845],"about_ca_topic_score_codex":0.0000013724056,"about_ca_topic_score_gemma":0.0000030508022,"teacher_disagreement_score":0.62564546,"about_ca_system_score_codex":0.0000412075,"about_ca_system_score_gemma":0.00009103556,"threshold_uncertainty_score":0.45094946},"labels":[],"label_agreement":null},{"id":"W4280615951","doi":"10.1016/j.cor.2022.105870","title":"Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"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; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Piecewise linear function; Computer science; Routing (electronic design automation); Mathematical optimization; Piecewise; Operations research; Mathematics; Computer network","score_opus":0.041906010411408796,"score_gpt":0.3142522808123648,"score_spread":0.272346270400956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280615951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301622,0.00067216007,0.7921162,0.002100418,0.000063530395,0.0015660303,0.000030509565,0.00028222607,0.00015269895],"genre_scores_gemma":[0.7991824,0.0001688949,0.19947092,0.00009436543,0.000085169915,0.00054335804,0.00004490151,0.00008289694,0.00032709606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809855,0.0004545001,0.0002714067,0.0003501338,0.0003384134,0.00048702167],"domain_scores_gemma":[0.9978658,0.0014970733,0.000024586418,0.00023096033,0.00027554733,0.000106043226],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026598582,0.0001571313,0.00017816384,0.00033512723,0.0025490033,0.00033181492,0.000204068,0.00004074173,0.000018786584],"category_scores_gemma":[0.00019380078,0.00014021804,0.000020334937,0.0012807583,0.00008753774,0.00025428543,0.00017732987,0.00065268326,0.0000026907592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019377567,0.000015811069,0.00015144328,0.00004494884,0.00006660359,0.0000014523476,0.0033704303,0.96737593,0.012593458,0.0011116385,0.00026845833,0.014980466],"study_design_scores_gemma":[0.0006119982,0.000117762065,0.00023091452,0.000032472362,0.000017307964,0.00003344457,0.0004263183,0.9968584,0.00079088256,0.0000693229,0.00064044655,0.00017068618],"about_ca_topic_score_codex":0.00005612512,"about_ca_topic_score_gemma":0.000012338303,"teacher_disagreement_score":0.5961662,"about_ca_system_score_codex":0.00016314517,"about_ca_system_score_gemma":0.00010406414,"threshold_uncertainty_score":0.99874955},"labels":[],"label_agreement":null},{"id":"W4280622413","doi":"10.1155/2022/4825018","title":"The Optimization of Path Planning for Express Delivery Based on Clone Adaptive Ant Colony Optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shihezi University; China Postdoctoral Science Foundation","keywords":"Ant colony optimization algorithms; Computer science; Simulated annealing; Mathematical optimization; Operations research; Path (computing); Ant colony; Genetic algorithm; Convergence (economics); Metaheuristic; Context (archaeology); Engineering; Economics; Artificial intelligence; Mathematics; Computer network","score_opus":0.014371953632756907,"score_gpt":0.2557198655593098,"score_spread":0.24134791192655292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280622413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03487293,0.00022152734,0.96392685,0.000047065194,0.00048412528,0.0003229027,0.000062059735,0.000037983256,0.000024554247],"genre_scores_gemma":[0.52570117,0.000068727684,0.4740384,0.000022004506,0.00003803629,0.00003351619,0.000061650586,0.000031719723,0.000004753212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863154,0.00009904083,0.000651686,0.00010384611,0.0003678217,0.00014605215],"domain_scores_gemma":[0.9984676,0.0004788382,0.00054862123,0.00011049484,0.0003525032,0.000041941188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612858,0.00012439769,0.00021229434,0.00015331137,0.00023821,0.000013904004,0.0001438976,0.000040897237,0.000013929289],"category_scores_gemma":[0.000070553106,0.00011494845,0.00010668303,0.00029450963,0.00002202597,0.00024076014,0.0000022993631,0.00019871446,3.724477e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009093589,0.000044584256,0.000078935416,0.000032421776,0.000032590193,0.000003746591,0.0007321125,0.9946049,0.001762614,0.00006135934,0.000048448313,0.001688928],"study_design_scores_gemma":[0.0015098634,0.0005771195,0.00054015,0.00007736193,0.000055732962,0.0000021504914,0.0008937704,0.9938094,0.0022185887,0.000026991569,0.00017561237,0.000113239825],"about_ca_topic_score_codex":7.948485e-7,"about_ca_topic_score_gemma":3.7407176e-7,"teacher_disagreement_score":0.49082828,"about_ca_system_score_codex":0.00013225732,"about_ca_system_score_gemma":0.000059139904,"threshold_uncertainty_score":0.4687462},"labels":[],"label_agreement":null},{"id":"W4280625240","doi":"10.1155/2022/6599089","title":"Truck and Unmanned Vehicle Routing Problem with Time Windows: A Satellite Synchronization Perspective","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Truck; Synchronization (alternating current); Real-time computing; Computer science; Satellite; Benchmark (surveying); Simulation; Engineering; Computer network; Automotive engineering; Aerospace engineering","score_opus":0.004842788618287535,"score_gpt":0.22255379647548207,"score_spread":0.21771100785719452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280625240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83832496,0.00073222275,0.15999761,0.00016730335,0.00010937813,0.0002836597,0.0000120542845,0.00011944044,0.00025338243],"genre_scores_gemma":[0.8988571,0.0000867753,0.100915246,0.000018010383,0.000038673123,0.0000072434923,0.000014399787,0.000038710714,0.000023817965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901146,0.00006754289,0.0003833943,0.00012016575,0.00027328887,0.00014418033],"domain_scores_gemma":[0.9993673,0.00005776143,0.00024421522,0.00006535219,0.0002080605,0.000057329496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032247463,0.00012024952,0.00020376795,0.00014132497,0.00013611194,0.000022266424,0.00006727625,0.000027106487,0.000030323574],"category_scores_gemma":[0.000015186702,0.00012001329,0.000036691377,0.00039582537,0.000020966705,0.0004563928,0.0000025919203,0.00024993255,5.95646e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013159466,0.00001937282,0.0018877713,0.000030284393,0.00004938308,0.000016244468,0.0058740727,0.97772366,0.0057063624,0.00019876596,0.0000024634876,0.008360023],"study_design_scores_gemma":[0.014071528,0.003058822,0.25183237,0.00058922754,0.0006334047,0.00048410497,0.030226324,0.68191314,0.011074283,0.0033315488,0.0012894766,0.0014958036],"about_ca_topic_score_codex":0.0000018314943,"about_ca_topic_score_gemma":0.000004489051,"teacher_disagreement_score":0.29581055,"about_ca_system_score_codex":0.00021608658,"about_ca_system_score_gemma":0.000040150993,"threshold_uncertainty_score":0.4894},"labels":[],"label_agreement":null},{"id":"W4281386812","doi":"10.1016/j.trb.2022.05.005","title":"Robust ship fleet deployment with shipping revenue management","year":2022,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"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":"Software deployment; Revenue; Operations research; Revenue management; Profit (economics); Fleet management; Computer science; Randomness; Constraint (computer-aided design); Service (business); Mathematical optimization; Business; Engineering; Economics; Finance; Mathematics","score_opus":0.42309109817170615,"score_gpt":0.41881113404199244,"score_spread":0.004279964129713709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281386812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2097108,0.00018221396,0.78492564,0.0005433155,0.00024128158,0.0010121781,0.0000837836,0.0006709229,0.0026298498],"genre_scores_gemma":[0.33248898,0.00012240147,0.66516495,0.000109549066,0.00008664086,0.001040724,0.0001406746,0.000075108925,0.00077099015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9944826,0.0029315958,0.00041901902,0.00043704253,0.0011106787,0.0006190904],"domain_scores_gemma":[0.9983062,0.0010532013,0.00004597436,0.00033414504,0.000095950265,0.0001645315],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009558424,0.00018148139,0.0002758488,0.00026614816,0.00049569574,0.000044488763,0.00035393052,0.00006933459,0.0010905443],"category_scores_gemma":[0.00010623063,0.00016903094,0.00006716509,0.001117744,0.00010474416,0.00009416037,0.000032282645,0.0009033175,0.000017591034],"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.00013021154,0.000059449027,0.0038745787,0.00011191545,0.00007406642,0.00015675098,0.0004962026,0.98438907,0.00032915454,0.003490092,0.0017419588,0.0051465384],"study_design_scores_gemma":[0.007846147,0.0027642297,0.3655832,0.00042527443,0.0003834375,0.00008119716,0.01312738,0.28962263,0.008596031,0.009714299,0.29850578,0.0033503848],"about_ca_topic_score_codex":0.00001460261,"about_ca_topic_score_gemma":0.000028416296,"teacher_disagreement_score":0.69476646,"about_ca_system_score_codex":0.00018729645,"about_ca_system_score_gemma":0.000026218388,"threshold_uncertainty_score":0.9998226},"labels":[],"label_agreement":null},{"id":"W4283797864","doi":"10.1609/aaai.v36i9.21262","title":"MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"McGill University; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute; University of Toronto","funders":"Deutscher Akademischer Austauschdienst","keywords":"Solver; Heuristics; Computer science; Integer programming; Bipartite graph; Leverage (statistics); Variable (mathematics); Graph; Theoretical computer science; Heuristic; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.16559871495142212,"score_gpt":0.3409592441482524,"score_spread":0.1753605291968303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15688324,0.000097780656,0.8117621,0.0036525002,0.011201464,0.0029523682,0.00041842906,0.0010844404,0.011947677],"genre_scores_gemma":[0.93375164,0.000013735178,0.06577583,0.00008148734,0.00018473523,0.00009656366,0.000008073681,0.00004679474,0.00004113812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982214,0.000026339492,0.0005388994,0.0003999541,0.00045741023,0.0003559852],"domain_scores_gemma":[0.9986889,0.00031166215,0.00023274402,0.00039985345,0.00029673165,0.00007013594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009946263,0.00021055584,0.00028034294,0.000112088615,0.0004188011,0.00011784515,0.0019246375,0.000088260946,0.00019891601],"category_scores_gemma":[0.0012262476,0.00020145968,0.00010016745,0.0005655788,0.000116420546,0.00020374417,0.00059672893,0.0003767814,0.000010249823],"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.00011721029,0.000088311135,0.00010378792,0.00009151258,0.000054893415,2.3929002e-7,0.0013101599,0.08931455,0.01581787,0.878163,0.0015298208,0.01340868],"study_design_scores_gemma":[0.000048741917,0.00011691324,0.000006895797,0.000085483094,0.000033746077,0.0000019609695,0.0012521811,0.7773602,0.082051866,0.13779117,0.0010093246,0.00024153729],"about_ca_topic_score_codex":0.000009179263,"about_ca_topic_score_gemma":9.74904e-7,"teacher_disagreement_score":0.7768684,"about_ca_system_score_codex":0.00011670023,"about_ca_system_score_gemma":0.00006552829,"threshold_uncertainty_score":0.82152873},"labels":[],"label_agreement":null},{"id":"W4283810538","doi":"10.1609/aaai.v36i4.20294","title":"Learning to Search in Local Branching","year":2022,"lang":"en","type":"article","venue":"","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":"Leverage (statistics); Local search (optimization); Mathematical optimization; Heuristic; Computer science; Mathematics; Linear programming; Integer programming; Constraint (computer-aided design); Algorithm; Artificial intelligence","score_opus":0.014469335138050234,"score_gpt":0.2739315645870722,"score_spread":0.259462229449022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283810538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34327912,0.00001184447,0.6466113,0.000091261005,0.000080732025,0.00006138704,2.766812e-7,0.0002812209,0.009582913],"genre_scores_gemma":[0.94310814,8.651433e-7,0.056190807,0.00008607974,0.000014243556,0.00001350211,0.0000014173395,0.000021978156,0.00056298776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936837,0.00012258696,0.000104833685,0.00009280745,0.00013587189,0.00017555105],"domain_scores_gemma":[0.9998142,0.00006425533,0.0000031865914,0.00007058511,0.000006492878,0.000041268762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006452145,0.00004772569,0.000066395645,0.00014276049,0.00007671817,0.000014543259,0.00009008269,0.000012868946,0.00060459104],"category_scores_gemma":[0.000032887783,0.000058471083,0.000012945779,0.00047234792,0.0000036539982,0.00003642739,0.00009769721,0.0003481765,0.000027312568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017391893,0.0000032710993,0.0022779983,0.000004966349,0.000001583525,0.0000031493155,0.0012526624,0.9546572,0.0007578975,0.00010436109,0.000064614214,0.040870573],"study_design_scores_gemma":[0.00011147773,0.000019890938,0.0012151509,0.0000025866968,4.2045687e-7,0.0000031568886,0.0011393118,0.9941928,0.0007245859,0.000009193976,0.0025034547,0.00007796476],"about_ca_topic_score_codex":0.00003992977,"about_ca_topic_score_gemma":0.000008285445,"teacher_disagreement_score":0.599829,"about_ca_system_score_codex":0.00012824335,"about_ca_system_score_gemma":0.00000897238,"threshold_uncertainty_score":0.6619848},"labels":[],"label_agreement":null},{"id":"W4284896812","doi":"10.3390/technologies10040081","title":"Distribution Path Optimization by an Improved Genetic Algorithm Combined with a Divide-and-Conquer Strategy","year":2022,"lang":"en","type":"article","venue":"Technologies","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":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Crossover; Divide and conquer algorithms; Computer science; Path (computing); Genetic algorithm; Metaheuristic; Scheduling (production processes); Operator (biology); Vehicle routing problem; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","score_opus":0.007743080449083273,"score_gpt":0.2171983023533931,"score_spread":0.20945522190430982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284896812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04972441,0.0003430346,0.9429206,0.00011022034,0.000044382996,0.00027176616,0.00013426007,0.0064191697,0.000032144588],"genre_scores_gemma":[0.77256,0.00008625233,0.22686163,0.000008400391,0.0000049793975,0.0001559178,0.00027390316,0.00003452022,0.000014402393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991949,0.000052343337,0.00017242644,0.00022808988,0.00012905545,0.00022319453],"domain_scores_gemma":[0.99958855,0.000027925009,0.00005168092,0.00026866334,0.000036774964,0.000026410684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015636608,0.00015816116,0.00015254131,0.00006601912,0.00018737592,0.000055683176,0.00018578238,0.00009120648,0.000014953282],"category_scores_gemma":[0.000032480784,0.0001537509,0.000013312633,0.00035428972,0.00007977394,0.00013412986,0.00011287351,0.0002419963,5.129175e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009269592,0.000026620242,0.00025206993,0.000011239105,0.000018961497,0.0000024959559,0.000036943184,0.91720384,0.0009958034,0.00009681777,0.00031713862,0.08102879],"study_design_scores_gemma":[0.00042916895,0.00044193002,0.00025928763,0.000003983743,0.000017191462,0.000014453732,0.00049633085,0.99518615,0.0025438757,0.00021081598,0.00018345384,0.00021335209],"about_ca_topic_score_codex":0.000013892586,"about_ca_topic_score_gemma":9.333442e-7,"teacher_disagreement_score":0.7228356,"about_ca_system_score_codex":0.000095798285,"about_ca_system_score_gemma":0.000014277985,"threshold_uncertainty_score":0.626978},"labels":[],"label_agreement":null},{"id":"W4285164761","doi":"10.5267/j.ijiec.2022.1.001","title":"Multi-depot heterogeneous fleet vehicle routing problem with time windows: Airline and roadway integrated routing","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Anadolu Üniversitesi","keywords":"Vehicle routing problem; Genetic algorithm; Computer science; Variable neighborhood search; Aviation; Variable (mathematics); Routing (electronic design automation); Range (aeronautics); Mathematical optimization; Node (physics); Operations research; Engineering; Metaheuristic; Computer network; Algorithm; Mathematics","score_opus":0.021445372266146498,"score_gpt":0.25305417389850543,"score_spread":0.23160880163235892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285164761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4124888,0.00010493257,0.5853954,0.00032530652,0.0010673575,0.00023248114,0.000052385065,0.00028937502,0.00004396321],"genre_scores_gemma":[0.88600075,0.000005024208,0.113455236,0.000028421713,0.00037034048,0.000010876646,0.000032651194,0.00006745447,0.000029259863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982255,0.00011842422,0.0007003993,0.00017303425,0.0005334251,0.00024923563],"domain_scores_gemma":[0.9988376,0.00029866528,0.0002920409,0.0000948602,0.000347476,0.00012937076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074671174,0.00023107124,0.0003020563,0.00043794894,0.00015624765,0.00014975424,0.00036074975,0.000083668405,0.000049205933],"category_scores_gemma":[0.00025040685,0.00023597572,0.000081690734,0.00044196568,0.00002599568,0.00025293796,0.00011927518,0.0009002775,0.000002428383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004036018,0.00004523926,0.0007648823,0.000004259327,0.0002990594,0.00007092734,0.00039403688,0.9874417,0.0028806566,0.000036736415,0.00007689021,0.007945259],"study_design_scores_gemma":[0.0021554152,0.00017556506,0.00017053749,0.00013378903,0.00004155746,0.00079666043,0.00014075753,0.9946569,0.0008777263,0.0000065218,0.0006072231,0.00023730504],"about_ca_topic_score_codex":0.00001459822,"about_ca_topic_score_gemma":0.0000013698008,"teacher_disagreement_score":0.47351193,"about_ca_system_score_codex":0.00036718365,"about_ca_system_score_gemma":0.0001169482,"threshold_uncertainty_score":0.96228105},"labels":[],"label_agreement":null},{"id":"W4285267076","doi":"10.1109/access.2022.3174081","title":"A Vehicle Routing Problem With Option for Outsourcing and Time-Dependent Travel Time","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"HEC Montréal","funders":"University of Science and Technology of China; National University of Singapore","keywords":"Vehicle routing problem; Computer science; Mathematical optimization; Tabu search; Integer programming; Benchmark (surveying); Routing (electronic design automation); Outsourcing; Operations research; Engineering; Mathematics; Algorithm; Computer network","score_opus":0.017026437850412232,"score_gpt":0.2602245517578018,"score_spread":0.24319811390738955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285267076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27651188,0.000042962176,0.72130287,0.00007636543,0.000102748934,0.0005899343,0.000022911318,0.00039514975,0.00095517474],"genre_scores_gemma":[0.959056,0.000002268559,0.03992679,0.00005355997,0.000084014566,0.00018957649,0.000012858045,0.00008343687,0.0005914903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999015,0.00006924997,0.00021158524,0.00023828211,0.00019862829,0.00026726708],"domain_scores_gemma":[0.9995679,0.00011595704,0.000067101384,0.00014863376,0.000041137653,0.000059270653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006232735,0.00014296242,0.00017845709,0.00009155438,0.0002707392,0.00014615446,0.00020393869,0.000038335125,0.00005924755],"category_scores_gemma":[0.000016336373,0.00014977565,0.000027486207,0.00021284471,0.000014419002,0.00027854493,0.000073391755,0.00017044703,0.000006237556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002694033,0.000014347133,0.0005030107,0.0000516554,0.000029311437,0.0000022511192,0.0005863798,0.97530574,0.018665701,0.000025425003,0.00010429038,0.0046849377],"study_design_scores_gemma":[0.00075505336,0.00006821797,0.00037948988,0.000022855862,0.000031181436,0.00002127163,0.00008373253,0.9895254,0.008700919,0.00011001008,0.00008049098,0.00022142434],"about_ca_topic_score_codex":0.000015774553,"about_ca_topic_score_gemma":0.0000012947472,"teacher_disagreement_score":0.6825441,"about_ca_system_score_codex":0.00010482687,"about_ca_system_score_gemma":0.000018286108,"threshold_uncertainty_score":0.6107673},"labels":[],"label_agreement":null},{"id":"W4285580373","doi":"","title":"Tactical capacity planning in an integrated multi-stakeholder freight transportation system","year":2021,"lang":"en","type":"report","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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é Laval","funders":"","keywords":"Stakeholder; Business; Transport engineering; Traffic management; Transportation planning; Engineering; Economics; Management","score_opus":0.07525117030348033,"score_gpt":0.283816822004861,"score_spread":0.2085656517013807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285580373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07248774,0.0012415865,0.9008447,0.00014834003,0.00064500916,0.00045650185,0.00019357017,0.0010452933,0.022937246],"genre_scores_gemma":[0.6057409,0.00021356199,0.38889825,0.0000118038415,0.000043888744,0.00007833582,0.0030728646,0.00017878789,0.0017616043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929045,0.004349327,0.0009720621,0.00068346673,0.000662208,0.00042844447],"domain_scores_gemma":[0.9946565,0.00082118803,0.0003122781,0.001228735,0.0027670586,0.00021421885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0065118778,0.00043922916,0.0006279428,0.0003597346,0.00016529894,0.00028788342,0.00053097395,0.0006163401,0.00010433346],"category_scores_gemma":[0.0014428019,0.0005050211,0.00014398758,0.0008683399,0.00009088863,0.0002969727,0.000040747553,0.0011400371,0.000008388234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070125796,0.003864453,0.13878681,0.011737316,0.001617586,0.0010001194,0.106561676,0.56836784,0.019758021,0.021928305,0.00473817,0.12156959],"study_design_scores_gemma":[0.001169723,6.553984e-7,0.030404406,0.009149636,0.00018664892,0.00006821926,0.0010845207,0.9233575,0.02067534,0.000017490425,0.012645419,0.0012404658],"about_ca_topic_score_codex":0.0011601732,"about_ca_topic_score_gemma":0.0039683813,"teacher_disagreement_score":0.53325313,"about_ca_system_score_codex":0.00077273254,"about_ca_system_score_gemma":0.00047207237,"threshold_uncertainty_score":0.9997401},"labels":[],"label_agreement":null},{"id":"W4285600159","doi":"10.24963/ijcai.2022/253","title":"Large Neighbourhood Search for Anytime MaxSAT Solving","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","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":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Solver; Neighbourhood (mathematics); Computer science; Boolean satisfiability problem; Limit (mathematics); Mathematical optimization; Satisfiability; Algorithm; Mathematics; Boolean function","score_opus":0.06885179694586264,"score_gpt":0.3000225798449502,"score_spread":0.23117078289908755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285600159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3718718,0.00010488252,0.5161995,0.0146944905,0.007528091,0.0030337751,0.0006696238,0.0011053883,0.084792435],"genre_scores_gemma":[0.9903582,0.000026334994,0.008774809,0.00016661843,0.00017249142,0.00013552807,0.000008516247,0.000052195668,0.00030531402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977557,0.000024969226,0.0006684676,0.00036302194,0.0007694593,0.00041837012],"domain_scores_gemma":[0.99869543,0.00017040427,0.00021512495,0.0001794863,0.00066044356,0.00007911964],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013303483,0.00023861778,0.00026353964,0.00025413794,0.00048670155,0.00016107796,0.0011926353,0.000069427304,0.0011534961],"category_scores_gemma":[0.00039723687,0.00022250597,0.00019873619,0.00041211207,0.00009203827,0.00021889142,0.0004630266,0.0005280475,0.000028758352],"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.00017189067,0.00025266115,0.00065218704,0.0001342752,0.00012625771,8.046417e-7,0.0032351061,0.1957548,0.034879647,0.75429493,0.00072462484,0.009772807],"study_design_scores_gemma":[0.00008724739,0.00011265669,0.00021389915,0.00010467498,0.00001664261,0.000009515999,0.0019875865,0.7723817,0.20393704,0.020044891,0.0008458476,0.0002582994],"about_ca_topic_score_codex":0.0000126808245,"about_ca_topic_score_gemma":0.0000052821165,"teacher_disagreement_score":0.73425007,"about_ca_system_score_codex":0.00027486327,"about_ca_system_score_gemma":0.00005984716,"threshold_uncertainty_score":0.9997596},"labels":[],"label_agreement":null},{"id":"W4285804020","doi":"10.3390/su14148661","title":"Solving the Green Open Vehicle Routing Problem Using a Membrane-Inspired Hybrid Algorithm","year":2022,"lang":"en","type":"article","venue":"Sustainability","topic":"Vehicle Routing Optimization Methods","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":"McMaster University","funders":"","keywords":"Tabu search; Crossover; Neighbourhood (mathematics); Vehicle routing problem; Genetic algorithm; Heuristics; Mathematical optimization; Algorithm; Travelling salesman problem; Computer science; Guided Local Search; Local search (optimization); Routing (electronic design automation); Mathematics; Artificial intelligence","score_opus":0.019340144163954943,"score_gpt":0.2829914870382855,"score_spread":0.26365134287433056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285804020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.599072,0.0002228701,0.3896625,0.002301498,0.00056146353,0.0041529024,0.00006658035,0.0014704842,0.0024897417],"genre_scores_gemma":[0.922318,0.0000015285094,0.07690861,0.00012268432,0.000090507434,0.00020145938,0.000011066654,0.00008637854,0.00025980224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719703,0.00080009265,0.000508347,0.00044407917,0.00038700228,0.0006634522],"domain_scores_gemma":[0.9984699,0.0002676383,0.000114515344,0.00075236266,0.0002982476,0.00009733162],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004119699,0.00024283965,0.00030271112,0.00008076857,0.0013649451,0.00023024374,0.0010487881,0.000042137537,0.0001589664],"category_scores_gemma":[0.00043886458,0.0002320751,0.00010563895,0.0007681572,0.00008995716,0.0003785345,0.0013989945,0.00058585504,0.000001757748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012457462,0.00004438158,0.002116375,0.00013819298,0.000039072107,0.000022479999,0.00200831,0.9432441,0.0003677091,0.0003053597,0.000057936206,0.051643636],"study_design_scores_gemma":[0.0004403849,0.000029837827,0.00064492086,0.000008204347,0.00002872666,0.000031804357,0.002304345,0.990665,0.00075611,0.0031184673,0.0016774314,0.00029475713],"about_ca_topic_score_codex":0.0014317041,"about_ca_topic_score_gemma":0.000012650115,"teacher_disagreement_score":0.323246,"about_ca_system_score_codex":0.0021152887,"about_ca_system_score_gemma":0.0003683943,"threshold_uncertainty_score":0.99993515},"labels":[],"label_agreement":null},{"id":"W4286750933","doi":"10.48550/arxiv.2207.10254","title":"The Two-Stripe Symmetric Circulant TSP is in P","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Circulant matrix; Hamiltonian path; Travelling salesman problem; Combinatorics; Mathematics; Parameterized complexity; Time complexity; Hamiltonian (control theory); Symmetric function; Circulant graph; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.06163703261836798,"score_gpt":0.20852244558304925,"score_spread":0.14688541296468127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286750933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6676441,0.0010508947,0.29619893,0.0001531306,0.0026111193,0.0008636042,0.00009571704,0.0010186707,0.030363837],"genre_scores_gemma":[0.9967532,0.0009164051,0.0012562027,0.000045559893,0.000054370717,0.000002910458,0.000021086207,0.000056587207,0.00089366175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984443,0.00026395978,0.00025782178,0.0005317016,0.00011259724,0.00038960172],"domain_scores_gemma":[0.998581,0.00033363362,0.00010688927,0.0008375727,0.000050586925,0.000090304115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006959013,0.000272847,0.0002842543,0.00049357786,0.00019367637,0.00006997121,0.00088799663,0.0001763787,0.00020420487],"category_scores_gemma":[0.00010069679,0.00030224372,0.00016163124,0.0017988394,0.0000516359,0.00007146706,0.00074695854,0.0011353632,0.00003386021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071833047,0.000015206235,0.00572248,0.000043400378,0.000062377105,0.00010412621,0.0001125562,0.9830492,0.000008996655,0.009768688,0.00019548088,0.00091028865],"study_design_scores_gemma":[0.00042848865,0.000008650844,0.0021083865,0.000028359591,0.000047127764,0.0000029093198,0.00020229406,0.99052453,0.000048970665,0.0035215847,0.0027236457,0.00035507808],"about_ca_topic_score_codex":0.00014903088,"about_ca_topic_score_gemma":0.000028018943,"teacher_disagreement_score":0.3291091,"about_ca_system_score_codex":0.00067060586,"about_ca_system_score_gemma":0.00008555849,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W4287327884","doi":"","title":"The electric vehicle routing problem with capacitated charging stations","year":2019,"lang":"en","type":"other","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Electric vehicle; Computer science; Routing (electronic design automation); Business; Computer network; Physics","score_opus":0.008264213883118479,"score_gpt":0.20940731867852835,"score_spread":0.20114310479540987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287327884","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006145827,0.00097214076,0.37530077,0.0009940802,0.00011704327,0.00062508415,0.000024061237,0.0013150251,0.6200372],"genre_scores_gemma":[0.047804322,0.001081776,0.25106743,0.000051847594,0.000057329333,0.0001494685,0.00026032596,0.0011258735,0.69840163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965158,0.0019918494,0.00034560595,0.00037352304,0.00032543138,0.0004477588],"domain_scores_gemma":[0.99664855,0.001284566,0.0002890675,0.001114073,0.00056836597,0.00009534996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002842983,0.00030464595,0.00026271638,0.00021824302,0.00036773618,0.00031816383,0.00061191886,0.00018075838,0.00009505821],"category_scores_gemma":[0.000421087,0.0002599599,0.00006710684,0.00088696316,0.00008718663,0.000088408175,0.00008213232,0.00048437424,0.00010309931],"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.000043498658,0.00066275976,0.0045959554,0.0017337427,0.002110675,0.000020334624,0.04010302,0.09201328,0.025598163,0.2833422,0.21876124,0.33101514],"study_design_scores_gemma":[0.0009124571,8.3860516e-7,0.00034519407,0.0022913197,0.00008582448,0.000012806743,0.00024337234,0.78166944,0.009245906,0.00019035565,0.20412798,0.0008744887],"about_ca_topic_score_codex":0.00030704355,"about_ca_topic_score_gemma":0.00069219794,"teacher_disagreement_score":0.6896562,"about_ca_system_score_codex":0.00012550058,"about_ca_system_score_gemma":0.00011846714,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W4288061053","doi":"10.1016/j.cor.2022.105974","title":"Trip planning for visitors in a service system with capacity constraints","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"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 Alberta","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China; Zhejiang Office of Philosophy and Social Science","keywords":"Computer science; Capacity planning; Operations research; Service (business); Operations management; Business; Mathematical optimization; Mathematics; Marketing; Economics","score_opus":0.09284608348410901,"score_gpt":0.3549047532957981,"score_spread":0.2620586698116891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288061053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25533885,0.000029149625,0.7427978,0.00017016866,0.00021422766,0.00072209403,0.000029152745,0.00019143455,0.00050713617],"genre_scores_gemma":[0.8573592,4.4490224e-7,0.14207083,0.00003095966,0.000060345057,0.00039139306,0.000028669034,0.000029419665,0.00002875397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984485,0.00041611283,0.00022195143,0.0002208566,0.00034720046,0.00034540787],"domain_scores_gemma":[0.99913836,0.0003454607,0.0000087831795,0.00021401588,0.00022012657,0.00007323868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016368454,0.000098180884,0.00015315971,0.00040142983,0.0005886718,0.00013543974,0.00027666477,0.00003495975,0.000019859279],"category_scores_gemma":[0.000041657313,0.000105731604,0.000020148105,0.0011641893,0.000047389123,0.00011666794,0.000096914024,0.00044559085,0.000003813807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001430281,0.00001774437,0.0003323726,0.00009816483,0.000017014692,0.000008167689,0.0020814885,0.9944792,0.00036600832,0.0012974095,0.00029132847,0.0009968444],"study_design_scores_gemma":[0.00067781284,0.00007125622,0.00031428423,0.000062586616,0.0000021943247,0.000027229773,0.0020299407,0.99607384,0.00019149615,0.0000034021796,0.000429996,0.00011595805],"about_ca_topic_score_codex":0.00008375702,"about_ca_topic_score_gemma":0.000043321146,"teacher_disagreement_score":0.6020203,"about_ca_system_score_codex":0.00047992988,"about_ca_system_score_gemma":0.00011617797,"threshold_uncertainty_score":0.45276472},"labels":[],"label_agreement":null},{"id":"W4288380286","doi":"","title":"Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions","year":2019,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal","funders":"","keywords":"Nonlinear system; Electric vehicle; Mathematical optimization; Vehicle routing problem; Routing (electronic design automation); Computer science; Mathematics; Physics; Computer network","score_opus":0.00980659822219835,"score_gpt":0.2129487585893551,"score_spread":0.20314216036715677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288380286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1717672,0.00017708611,0.82404387,0.0010688491,0.00005789026,0.0007355019,0.000013864693,0.000285356,0.0018503582],"genre_scores_gemma":[0.7316136,0.000041164756,0.26696467,0.00002446933,0.000016258558,0.00007653546,0.000064591506,0.000046232344,0.0011524702],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868876,0.00039716996,0.00024896217,0.00025234336,0.00013517006,0.00027761722],"domain_scores_gemma":[0.99740255,0.001383212,0.00010684778,0.00051034323,0.0005297735,0.00006724954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019671412,0.00015180754,0.00014821354,0.00009233737,0.00045753576,0.00016987706,0.00023482174,0.00006188784,0.000017088458],"category_scores_gemma":[0.00018302676,0.00012866932,0.000047674657,0.00044818135,0.0000376137,0.00018608413,0.0000692521,0.00020025343,0.000007475904],"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.00007784734,0.000514316,0.03437923,0.00057042047,0.000620177,9.990437e-7,0.016414357,0.1780114,0.37666214,0.038382325,0.00025381686,0.35411298],"study_design_scores_gemma":[0.0006731565,8.7350077e-7,0.0032348153,0.00012270646,0.000029038261,0.0000053803183,0.00007408477,0.98500526,0.009375675,0.0000632555,0.0012582687,0.0001575088],"about_ca_topic_score_codex":0.00008486083,"about_ca_topic_score_gemma":0.00007495479,"teacher_disagreement_score":0.80699384,"about_ca_system_score_codex":0.000058953523,"about_ca_system_score_gemma":0.000035012665,"threshold_uncertainty_score":0.52469826},"labels":[],"label_agreement":null},{"id":"W4288468789","doi":"10.2139/ssrn.4174007","title":"Intermodal Hub Network Design with Generalized Capacity Constraints and Non-Synchronized Train-Truck Operations","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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; Concordia University","funders":"","keywords":"Truck; Computer science; Transport engineering; Engineering; Automotive engineering","score_opus":0.013553896276201065,"score_gpt":0.22559449900493858,"score_spread":0.2120406027287375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288468789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22392529,0.00042811997,0.7748782,0.00011145188,0.00016618417,0.00021393383,0.0000050329727,0.000100900106,0.00017085462],"genre_scores_gemma":[0.8602057,0.00027156353,0.13906796,0.0000708617,0.00018508248,0.00003644791,0.000005981591,0.00005692174,0.00009945909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973663,0.00042924524,0.0003227685,0.00019800515,0.00023722228,0.0014464583],"domain_scores_gemma":[0.9995402,0.00007933804,0.00006119703,0.0001471908,0.00005737144,0.00011467123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002351329,0.00021313249,0.00026619888,0.00009947998,0.0006906896,0.00010841036,0.0002096945,0.00005320493,0.00018799934],"category_scores_gemma":[0.00003092864,0.00020661998,0.000054970384,0.00029114497,0.00010719898,0.00015628264,0.0000426263,0.0018383702,0.0000017606645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047890408,0.000014424184,0.00019782143,0.0000045898696,0.00020069712,0.0000058523738,0.0004262604,0.98536694,0.0009915375,0.006486482,0.00007280285,0.006184703],"study_design_scores_gemma":[0.0035362765,0.00049485406,0.00025026835,0.000022293942,0.00009171272,0.0031030911,0.00089539995,0.98150474,0.0002467202,0.009209825,0.0001692177,0.0004756124],"about_ca_topic_score_codex":0.000014130789,"about_ca_topic_score_gemma":0.000101225094,"teacher_disagreement_score":0.6362804,"about_ca_system_score_codex":0.00092699163,"about_ca_system_score_gemma":0.0008123582,"threshold_uncertainty_score":0.8425718},"labels":[],"label_agreement":null},{"id":"W4293227094","doi":"10.1287/opre.2021.2241","title":"A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs","year":2022,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Group for Research in Decision Analysis; Wilfrid Laurier University; Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Quadratic equation; Class (philosophy); Mathematical optimization; Quadratic programming; Regular polygon; Bilinear interpolation; Variable (mathematics); Mathematics; Quadratic unconstrained binary optimization; Convex optimization; Computer science; Applied mathematics; Artificial intelligence; Arithmetic; Mathematical analysis","score_opus":0.09093636409137897,"score_gpt":0.403254417085231,"score_spread":0.31231805299385207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293227094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72448224,0.00006703765,0.2729101,0.0002748189,0.000068719935,0.0016051228,0.000052168398,0.00012388467,0.00041593143],"genre_scores_gemma":[0.89992297,0.000005609213,0.09863162,0.00000928197,0.000030559684,0.00082927925,0.00028420426,0.000025181396,0.00026127335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998801,0.00031125505,0.0002341587,0.0001512184,0.00029485917,0.00020750865],"domain_scores_gemma":[0.9994092,0.000079066696,0.000012784787,0.00020620666,0.00024409615,0.00004864199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020430405,0.000064515145,0.00010737754,0.00023408099,0.0005487765,0.000078025274,0.00010032953,0.00003975497,0.0000547096],"category_scores_gemma":[0.00010363782,0.00006712572,0.00001956201,0.00046968122,0.000028476818,0.0002858846,0.00006626554,0.00018555211,0.0000013633096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031488875,0.0001924841,0.0005497558,0.00020581661,0.000023810675,6.7815546e-7,0.004574137,0.9447473,0.023460576,0.017189024,0.00014644225,0.008878471],"study_design_scores_gemma":[0.0004155722,0.00025628664,0.00027018832,0.0000070925043,0.0000041631797,0.0000026437197,0.001044872,0.9961606,0.0007119831,0.00012125656,0.000933461,0.00007183605],"about_ca_topic_score_codex":0.00001802441,"about_ca_topic_score_gemma":0.000032149317,"teacher_disagreement_score":0.17544076,"about_ca_system_score_codex":0.00009875712,"about_ca_system_score_gemma":0.000049831728,"threshold_uncertainty_score":0.42208004},"labels":[],"label_agreement":null},{"id":"W4293252833","doi":"10.5267/j.ijiec.2022.5.001","title":"A new metaheuristic approach for the meat routing problem by considering heterogeneous fleet with time windows","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Vehicle routing problem; Metaheuristic; Travelling salesman problem; Computer science; Mathematical optimization; Heuristic; Routing (electronic design automation); Operations research; Engineering; Mathematics; Algorithm; Computer network; Artificial intelligence","score_opus":0.02869746294506607,"score_gpt":0.25335996152448875,"score_spread":0.2246624985794227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026765484,0.0002407913,0.995186,0.00043513434,0.0008600646,0.00035097654,0.00005748423,0.00012457985,0.000068464906],"genre_scores_gemma":[0.53802806,0.0000071815753,0.46073818,0.00005026851,0.0008660647,0.00004969983,0.00005418678,0.00009557286,0.0001107616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985412,0.000060373917,0.00053093553,0.00013135633,0.00052559824,0.00021053088],"domain_scores_gemma":[0.99851394,0.00080804905,0.00023551023,0.00010312292,0.00024176807,0.00009762238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005778505,0.0001852373,0.00024850902,0.0002215079,0.00017176098,0.00014843479,0.0004909504,0.00004875283,0.00004180972],"category_scores_gemma":[0.00022374517,0.00016024025,0.00012382654,0.00028336776,0.000015909449,0.00013887418,0.0000701613,0.0005147206,8.053007e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040820592,0.000019271089,0.00003487767,0.0000045275956,0.0006029474,0.000008132956,0.00019920357,0.99055827,0.0006304856,0.00013470459,0.0032099136,0.004556837],"study_design_scores_gemma":[0.0015535573,0.00009553397,0.0000043774708,0.000037080474,0.00010501044,0.00055673585,0.00006198341,0.9912544,0.0005970393,0.000026774766,0.0055353865,0.000172137],"about_ca_topic_score_codex":0.000007987103,"about_ca_topic_score_gemma":2.5561508e-7,"teacher_disagreement_score":0.5353515,"about_ca_system_score_codex":0.0002251403,"about_ca_system_score_gemma":0.00014936586,"threshold_uncertainty_score":0.6534408},"labels":[],"label_agreement":null},{"id":"W4293252951","doi":"10.5267/j.ijiec.2022.7.004","title":"Two-stage stochastic programming for the inventory routing problem with stochastic demands in fuel delivery","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Vehicle routing problem; Mathematical optimization; Computer science; Solver; Stochastic programming; Routing (electronic design automation); Context (archaeology); Operations research; Heuristic; Mathematics","score_opus":0.0322007951797287,"score_gpt":0.2770254553558977,"score_spread":0.24482466017616897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04601765,0.0001445395,0.95160955,0.00027929197,0.0014248156,0.0004088024,0.000020524032,0.000082503815,0.000012317786],"genre_scores_gemma":[0.9510953,0.000001705414,0.048250094,0.000017905506,0.00046955654,0.00009102827,0.000013309181,0.00004809497,0.0000130413455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855953,0.00005414012,0.0005629717,0.00011459527,0.0004831805,0.00022557139],"domain_scores_gemma":[0.998508,0.00083577796,0.0002364541,0.00008111904,0.00027604698,0.00006261702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009734114,0.00015697358,0.00019654736,0.00046448337,0.00011852561,0.00010101862,0.00043598836,0.00004002094,0.000012058142],"category_scores_gemma":[0.000282758,0.00014250987,0.00008871966,0.00042509486,0.000021738353,0.00018736617,0.000071596776,0.000667503,3.2944786e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058967813,0.000031923064,0.00011394308,0.000008965893,0.00019175856,0.000012317399,0.00079011405,0.99284256,0.000041501808,0.0005875077,0.000035203204,0.005285219],"study_design_scores_gemma":[0.0023188146,0.000103388826,0.00005536355,0.0001253254,0.000042186355,0.00010710198,0.00068304513,0.9960011,0.00000950737,0.000039736668,0.0003656571,0.00014873815],"about_ca_topic_score_codex":0.000013881619,"about_ca_topic_score_gemma":0.000006579952,"teacher_disagreement_score":0.90507764,"about_ca_system_score_codex":0.00046345606,"about_ca_system_score_gemma":0.00016235393,"threshold_uncertainty_score":0.5811384},"labels":[],"label_agreement":null},{"id":"W4293253022","doi":"10.5267/j.ijiec.2022.6.001","title":"Memetic algorithm for the dynamic vehicle routing problem with simultaneous delivery and pickup","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pickup; Memetic algorithm; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Genetic algorithm; Computer science; Set (abstract data type); Local search (optimization); Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.015429245592927108,"score_gpt":0.2521010675512609,"score_spread":0.23667182195833378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293253022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0372508,0.00017912444,0.9605729,0.00055864704,0.0010985715,0.000216499,0.00003759766,0.000075137665,0.0000107093965],"genre_scores_gemma":[0.80861336,0.00001572654,0.1909883,0.0000264902,0.0002732872,0.000021243837,0.0000086645805,0.00003630023,0.000016629472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999029,0.00003699921,0.00035073634,0.000088975605,0.00035177942,0.00014254512],"domain_scores_gemma":[0.9981301,0.001318261,0.0001447478,0.000061467756,0.00029393574,0.000051527237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004884057,0.00011777893,0.0001433629,0.0001980506,0.00016406529,0.00009340201,0.00028448208,0.00003468672,0.000009841037],"category_scores_gemma":[0.00016877719,0.00010157001,0.000056517245,0.0002180871,0.000020212568,0.000117305615,0.00005897482,0.00041530305,2.460633e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015598724,0.000012330425,0.00003638393,0.0000029309358,0.00021606106,0.000013307525,0.00019382856,0.90454155,0.00016160263,0.00008713613,0.000047929538,0.09467134],"study_design_scores_gemma":[0.0011852599,0.00011632708,0.000041010666,0.00003816021,0.000054414264,0.00026232377,0.00019837951,0.99617124,0.000058597256,0.00003190908,0.0017302602,0.00011212484],"about_ca_topic_score_codex":0.0000055044925,"about_ca_topic_score_gemma":8.596177e-7,"teacher_disagreement_score":0.77136254,"about_ca_system_score_codex":0.0002129322,"about_ca_system_score_gemma":0.00007100074,"threshold_uncertainty_score":0.41419047},"labels":[],"label_agreement":null},{"id":"W4293255076","doi":"10.1139/cjfr-2021-0203","title":"A goal programming model for the optimization of log logistics considering sorting decisions and social objective","year":2022,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Western Forest Products; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Truck; Operations research; Workload; Sorting; Time horizon; Procurement; Goal programming; Total cost; Computer science; sort; Programming paradigm; Operations management; Transport engineering; Mathematical optimization; Engineering; Business; Mathematics; Marketing","score_opus":0.12002311095704515,"score_gpt":0.3643242071465311,"score_spread":0.24430109618948592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293255076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041254845,0.00033628117,0.9576685,0.00024507812,0.00010010904,0.00027921493,0.000027787577,0.000007686721,0.000080491416],"genre_scores_gemma":[0.8600174,0.000013761642,0.13984072,0.000008077988,0.0000584154,0.000020435953,0.000002287676,0.000023399958,0.000015513495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987989,0.00013334658,0.00034962263,0.00007855671,0.00029575572,0.00034381571],"domain_scores_gemma":[0.9979521,0.0011798114,0.00010815366,0.00008201945,0.0005349058,0.00014299121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002893961,0.000067856454,0.00015084246,0.00036165482,0.00088709744,0.00007188904,0.00020997814,0.000041323605,0.000011841635],"category_scores_gemma":[0.0020200824,0.00006227108,0.00005468236,0.00034592932,0.00018532142,0.0000736379,0.00004599235,0.00050440565,5.4006698e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001290079,0.000003572643,0.002702043,0.000019799914,0.000032880806,0.00000703479,0.0021487544,0.9869144,0.00002221061,0.0011172922,0.00013758121,0.006881557],"study_design_scores_gemma":[0.00026797468,0.000068603505,0.00050636486,0.000018783858,0.000016336346,0.000042001422,0.0021208886,0.9955379,0.000021516651,0.0011751802,0.00016720644,0.000057241094],"about_ca_topic_score_codex":0.00025393485,"about_ca_topic_score_gemma":0.0031646206,"teacher_disagreement_score":0.81876254,"about_ca_system_score_codex":0.00027488268,"about_ca_system_score_gemma":0.0008616517,"threshold_uncertainty_score":0.68229264},"labels":[],"label_agreement":null},{"id":"W4294724286","doi":"10.1016/j.cor.2022.106015","title":"A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"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":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Drone; Computer science; Pickup; Payload (computing); Truck; Last mile (transportation); TRIPS architecture; Mile; Operations research; Real-time computing; Engineering; Artificial intelligence; Computer security; Network packet; Automotive engineering; Geography","score_opus":0.08399262146980647,"score_gpt":0.3299644542793425,"score_spread":0.24597183280953605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294724286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23773183,0.00021583647,0.7594631,0.0006190928,0.000099822806,0.0011467687,0.000029338888,0.00033704378,0.0003571591],"genre_scores_gemma":[0.4367903,0.000029874833,0.56201684,0.00007355472,0.000053942065,0.00036485546,0.000051880255,0.00006120335,0.00055754045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974123,0.00059902616,0.00032067165,0.0004552734,0.0006874725,0.00052523945],"domain_scores_gemma":[0.99874824,0.0002322554,0.000014731373,0.000432174,0.00032855352,0.00024402597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629156,0.00018060778,0.0002576838,0.00058528647,0.0010703505,0.0003283189,0.00037245674,0.00005613844,0.00012784005],"category_scores_gemma":[0.000055393913,0.00020394227,0.000030058543,0.0015112795,0.00008979567,0.00022470395,0.00051090604,0.0006949865,0.000034313507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033922486,0.00017518151,0.00029311783,0.000050374972,0.000079622085,0.000011376551,0.0015509299,0.97347426,0.0072598876,0.00019013685,0.000968282,0.015912877],"study_design_scores_gemma":[0.001377443,0.00035296555,0.0033734983,0.000057954916,0.000013706773,0.000027450353,0.00030847907,0.9918335,0.00060820015,0.000007385732,0.001762138,0.00027728686],"about_ca_topic_score_codex":0.00011272511,"about_ca_topic_score_gemma":0.00018095715,"teacher_disagreement_score":0.19905844,"about_ca_system_score_codex":0.00036224505,"about_ca_system_score_gemma":0.00015705307,"threshold_uncertainty_score":0.8316524},"labels":[],"label_agreement":null},{"id":"W4296912568","doi":"10.1109/access.2022.3208899","title":"Green Vehicle Routing Problem: State of the Art and Future Directions","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Vehicle routing problem; Routing (electronic design automation); State (computer science); Computer network; Algorithm","score_opus":0.01676633303061775,"score_gpt":0.26835497069416964,"score_spread":0.2515886376635519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296912568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9814604,0.000344368,0.010978731,0.0007681044,0.00125476,0.00035556016,0.000041486368,0.00034407125,0.0044525024],"genre_scores_gemma":[0.9953244,0.000062395,0.0037341905,0.00007481783,0.00013211815,0.000043557327,0.0000019586348,0.000035673464,0.00059094356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993552,0.000099199744,0.00016511897,0.00010598885,0.0001438968,0.00013060115],"domain_scores_gemma":[0.99966896,0.00004720573,0.000054346463,0.0001758016,0.00002791995,0.000025768932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028156655,0.00007331531,0.00009465616,0.00004445219,0.00021635006,0.00003449013,0.00023529929,0.000016812011,0.000040847335],"category_scores_gemma":[0.000008090888,0.00006459526,0.000028491444,0.00045952087,0.0000213025,0.00013972452,0.00013147332,0.00019809027,9.2082786e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005187594,0.000020087351,0.014217876,0.00007227566,0.000043327927,0.0000011627083,0.0016115063,0.8928948,0.0039892867,0.00006319887,0.0010487352,0.08603257],"study_design_scores_gemma":[0.0008446473,0.000044696495,0.0691236,0.000041716663,0.00007031034,0.000035640853,0.0003033618,0.8103617,0.024768788,0.001585149,0.092290275,0.00053009536],"about_ca_topic_score_codex":0.000055651053,"about_ca_topic_score_gemma":0.000022573142,"teacher_disagreement_score":0.091241546,"about_ca_system_score_codex":0.000036119593,"about_ca_system_score_gemma":0.000012816084,"threshold_uncertainty_score":0.26341185},"labels":[],"label_agreement":null},{"id":"W4297145754","doi":"10.1155/2022/5052897","title":"The Value of Preemptive Pick-Up Services in Dynamic Vehicle Routing for Last-Mile Delivery: Space-Time Network-Based Formulation and Solution Algorithms","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hohai University; Arizona State University","keywords":"Computer science; Service (business); Lagrangian relaxation; Process (computing); Last mile (transportation); Task (project management); Vehicle routing problem; Dynamic programming; Flow network; Routing (electronic design automation); Service delivery framework; Operations research; Distributed computing; Algorithm; Mathematical optimization; Computer network; Engineering; Mile","score_opus":0.00563360387497039,"score_gpt":0.2381974020183943,"score_spread":0.2325637981434239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297145754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71939754,0.00026225555,0.27979854,0.000052850348,0.0002005899,0.00024386164,0.00002081642,0.000019965546,0.0000035848223],"genre_scores_gemma":[0.8909896,0.000048883667,0.10883714,0.00000853482,0.000028412649,0.000016663735,0.000041677034,0.000021941303,0.0000071475583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989249,0.000079834776,0.0005246018,0.00009079375,0.0002125023,0.00016736751],"domain_scores_gemma":[0.99906904,0.00030202218,0.0003825814,0.000068139154,0.00014927721,0.000028966144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000810789,0.00009792704,0.00018348156,0.00009575775,0.00017340637,0.000012584363,0.00008465471,0.00003710644,0.0000026753466],"category_scores_gemma":[0.000018202829,0.00009520493,0.00006300204,0.00026690625,0.000013839603,0.00032586436,0.0000036953754,0.00016701996,6.273684e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019496337,0.000012959077,0.0025910104,0.000059279668,0.000021806822,6.96229e-7,0.0011218416,0.9770911,0.009306201,0.000093228475,0.0000014497737,0.009505476],"study_design_scores_gemma":[0.0014159839,0.00016389941,0.08045189,0.00007610758,0.00003890914,0.0000014873283,0.0004758624,0.91607594,0.0007832035,0.00037608022,0.00005855141,0.00008207252],"about_ca_topic_score_codex":0.0000076213673,"about_ca_topic_score_gemma":0.000081819344,"teacher_disagreement_score":0.17159206,"about_ca_system_score_codex":0.0001376093,"about_ca_system_score_gemma":0.000034255045,"threshold_uncertainty_score":0.38823444},"labels":[],"label_agreement":null},{"id":"W4297415396","doi":"","title":"A metaheuristic for the Capacitated Location Routing Problem Combining Lagrangean Relaxation with Granular Tabu Search heuristic.","year":2005,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal; Université Laval","funders":"","keywords":"Tabu search; Metaheuristic; Relaxation (psychology); Mathematical optimization; Computer science; Routing (electronic design automation); Heuristic; Guided Local Search; Vehicle routing problem; Mathematics","score_opus":0.019780005110038437,"score_gpt":0.24022277752694915,"score_spread":0.2204427724169107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297415396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014872092,0.0010912996,0.9745828,0.0023108744,0.00016985768,0.001576802,0.000053404307,0.000782545,0.004560342],"genre_scores_gemma":[0.6375345,0.00020500887,0.36048648,0.000026427288,0.00004271117,0.00028322684,0.0005636043,0.00012538086,0.0007326302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944269,0.003158973,0.00073236244,0.00065488863,0.000526532,0.0005003418],"domain_scores_gemma":[0.99112326,0.0037145196,0.00044415583,0.0015172085,0.0030641048,0.00013673819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009779412,0.00043884251,0.00043605728,0.00022307024,0.0006661222,0.0005173308,0.0009028445,0.00028811322,0.000024667792],"category_scores_gemma":[0.0020452854,0.00039359214,0.00013969518,0.00075745845,0.00019898378,0.00016262922,0.00028231702,0.0009658013,0.000011494307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003133743,0.00017346267,0.00084636436,0.000831114,0.00029176287,0.0000019082925,0.01752666,0.92535746,0.0009857931,0.01470519,0.00048267512,0.038766254],"study_design_scores_gemma":[0.0007312769,9.703937e-7,0.0010720467,0.0015246724,0.00021887106,0.000009241482,0.00026889375,0.98793256,0.006159971,0.00052872376,0.0010942407,0.0004585316],"about_ca_topic_score_codex":0.00043850965,"about_ca_topic_score_gemma":0.0004707315,"teacher_disagreement_score":0.6226624,"about_ca_system_score_codex":0.0002582342,"about_ca_system_score_gemma":0.00020490258,"threshold_uncertainty_score":0.9998516},"labels":[],"label_agreement":null},{"id":"W4297628801","doi":"10.1287/trsc.2022.0342","title":"Solving a Continent-Scale Inventory Routing Problem at Renault","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scale (ratio); Context (archaeology); Routing (electronic design automation); Benchmark (surveying); Heuristic; Commodity; Morse code; Relaxation (psychology); Operations research; Mathematical optimization; Artificial intelligence; Mathematics; Computer network; Business; Telecommunications; Geography","score_opus":0.02124898207473498,"score_gpt":0.2729537527922278,"score_spread":0.2517047707174928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297628801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92866206,0.000020251397,0.066626415,0.00011557137,0.0003011529,0.00018436932,0.000007990707,0.0014746014,0.002607596],"genre_scores_gemma":[0.9668825,0.000020253607,0.03240966,0.000031567113,0.000029565832,0.000021835076,0.000026540716,0.00002688627,0.00055117114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998543,0.00001990175,0.00033174278,0.00027458096,0.000442632,0.0003881441],"domain_scores_gemma":[0.9994932,0.000049666327,0.000058244845,0.00017794246,0.0001084105,0.00011257221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059066,0.000112686444,0.00011964267,0.0002241642,0.00027497608,0.00005581412,0.00023177691,0.00004270264,0.000048967555],"category_scores_gemma":[0.0000506336,0.00012289471,0.000039509923,0.0018855189,0.00013401968,0.00041755242,0.000009405653,0.000100025754,0.00010320518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003882823,0.0000072951416,0.05298446,0.00007097539,0.000005762315,0.0000063660523,0.007329731,0.7950415,0.1406219,0.0005389781,0.00032531578,0.0030638056],"study_design_scores_gemma":[0.00033097217,0.000010315117,0.12802163,0.0000707367,0.000011583776,0.0000018003068,0.00034332398,0.8437167,0.026266823,0.00010667449,0.0008552808,0.00026415472],"about_ca_topic_score_codex":0.000013172148,"about_ca_topic_score_gemma":0.00005839795,"teacher_disagreement_score":0.11435507,"about_ca_system_score_codex":0.000103337596,"about_ca_system_score_gemma":0.000045125365,"threshold_uncertainty_score":0.5011501},"labels":[],"label_agreement":null},{"id":"W4298006032","doi":"10.1155/2022/8253175","title":"Metaheuristics for a Large-Scale Vehicle Routing Problem of Same-Day Delivery in E-Commerce Logistics System","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Metaheuristic; Computer science; Variable neighborhood search; Routing (electronic design automation); Mathematical optimization; Scale (ratio); City logistics; Algorithm; Operations research; Mathematics; Transport engineering; Engineering; Computer network","score_opus":0.014224420468865984,"score_gpt":0.2574567881279074,"score_spread":0.2432323676590414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298006032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2979831,0.00020179634,0.7011564,0.000022753104,0.00025981036,0.00021158856,0.00009775711,0.000036947717,0.00002987299],"genre_scores_gemma":[0.7092864,0.00002616366,0.29057887,0.00000954465,0.000029086932,0.000013109192,0.000022210757,0.000027998542,0.000006622797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998362,0.00010366654,0.00097616203,0.00009730369,0.00026898546,0.00019186539],"domain_scores_gemma":[0.9989004,0.00027431257,0.00046033922,0.0000921776,0.0002285463,0.000044204688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012866408,0.00011416457,0.00034725512,0.00018485637,0.00007154708,0.000006774111,0.0001369574,0.000042372136,0.000005833912],"category_scores_gemma":[0.00005456452,0.00012890968,0.000111208,0.00035544747,0.000010237427,0.00016857863,0.0000041919607,0.00027349996,1.260669e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008121208,0.00005343903,0.0030846533,0.00031325183,0.000031559895,0.000008715107,0.002651032,0.9849388,0.005927313,0.000600285,0.000009350424,0.0023004143],"study_design_scores_gemma":[0.0041111256,0.00037738332,0.029355962,0.00031924274,0.00024131843,0.000018815168,0.011465536,0.94733185,0.005119943,0.00037065367,0.00095087825,0.00033727544],"about_ca_topic_score_codex":0.0000037264838,"about_ca_topic_score_gemma":0.000020464107,"teacher_disagreement_score":0.4113033,"about_ca_system_score_codex":0.00019037994,"about_ca_system_score_gemma":0.000041078325,"threshold_uncertainty_score":0.52567846},"labels":[],"label_agreement":null},{"id":"W4298328583","doi":"","title":"A cooperative lagrangean relaxation-granular tabu search heuristic for the Capacitated Location Routing Problem","year":2005,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Relaxation (psychology); Heuristic; Routing (electronic design automation); Computer science; Vehicle routing problem; Mathematics; Computer network","score_opus":0.020525277868537493,"score_gpt":0.25124643415415765,"score_spread":0.23072115628562015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298328583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011162929,0.0013489737,0.97525615,0.0042305435,0.00022680852,0.001735854,0.000093288174,0.0007035268,0.0052419417],"genre_scores_gemma":[0.69056696,0.00043827906,0.30566627,0.00005047745,0.000075440905,0.00040931202,0.00076997135,0.00012811214,0.0018951695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99416214,0.003598194,0.0007322236,0.0006206729,0.00042387148,0.00046287285],"domain_scores_gemma":[0.99032575,0.0038030653,0.0003251752,0.0014486341,0.0039666146,0.00013078333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008819886,0.00040516956,0.0003795086,0.00019027494,0.0007019897,0.0005141397,0.00095770473,0.00033177377,0.00005052774],"category_scores_gemma":[0.0029314589,0.00038665748,0.0001606686,0.0007388941,0.00019264071,0.00015810644,0.00033394055,0.000938939,0.000023596109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012476529,0.00013413365,0.00032691367,0.00046264144,0.00017392567,8.238216e-7,0.027796065,0.91346705,0.0012521711,0.020277178,0.0007280714,0.03536857],"study_design_scores_gemma":[0.0004992158,4.561375e-7,0.0006808701,0.0010360824,0.00009233334,0.000004256584,0.00035723558,0.984283,0.010333163,0.00051557925,0.0017906087,0.00040724737],"about_ca_topic_score_codex":0.00042808097,"about_ca_topic_score_gemma":0.0006934348,"teacher_disagreement_score":0.679404,"about_ca_system_score_codex":0.00030599203,"about_ca_system_score_gemma":0.0002508575,"threshold_uncertainty_score":0.99985856},"labels":[],"label_agreement":null},{"id":"W4299395974","doi":"","title":"A Heuristic for the Time-Dependent Vehicle Routing Problem with Time Windows","year":2016,"lang":"en","type":"book","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal","funders":"","keywords":"Heuristic; Computer science; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Computer network; Mathematics; Artificial intelligence","score_opus":0.008809374254177509,"score_gpt":0.20878557429573735,"score_spread":0.19997620004155983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299395974","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000648655,0.0005307957,0.6972363,0.0016963532,0.000083550694,0.0011704238,0.00011065932,0.00074252085,0.29836452],"genre_scores_gemma":[0.0033936375,0.00014581764,0.13502707,0.00006571939,0.0001023282,0.00022926359,0.0002432186,0.00030844097,0.8604845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662846,0.0013809623,0.0005376921,0.00053586153,0.00043632693,0.00048070712],"domain_scores_gemma":[0.9919203,0.0049037915,0.00034926718,0.0014885659,0.0012005904,0.00013750888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005330944,0.00042657685,0.0004264225,0.00012427116,0.00044450726,0.00028773735,0.0009968325,0.0002720408,0.00022983649],"category_scores_gemma":[0.0007453348,0.00032112323,0.00015972534,0.0001947884,0.00017413968,0.00013032347,0.00022551315,0.00044483156,0.00031206093],"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.0002467727,0.00078602566,0.00042638925,0.0024705182,0.0030985358,0.00003698053,0.02259038,0.14406918,0.017910719,0.101356916,0.12717795,0.57982963],"study_design_scores_gemma":[0.0017844324,0.000002240388,0.000058868514,0.0040831435,0.00029597856,0.000033404576,0.00002507654,0.8564819,0.008403699,0.0024360833,0.12527367,0.0011214741],"about_ca_topic_score_codex":0.000018711919,"about_ca_topic_score_gemma":0.000049802813,"teacher_disagreement_score":0.7124128,"about_ca_system_score_codex":0.0002978765,"about_ca_system_score_gemma":0.0002720994,"threshold_uncertainty_score":0.99992406},"labels":[],"label_agreement":null},{"id":"W4301154667","doi":"","title":"The Generalized Minimum Spanning Tree Problem: Polyhedral Analysis and Branch-and-Cut Algorithm","year":2002,"lang":"en","type":"article","venue":"","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é Laval","funders":"","keywords":"Minimum spanning tree; Spanning tree; Distributed minimum spanning tree; Computer science; Tree (set theory); Combinatorics; Algorithm; Steiner tree problem; Mathematics","score_opus":0.01486572632310597,"score_gpt":0.23942728725460607,"score_spread":0.2245615609315001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301154667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07354202,0.0020649584,0.91194934,0.00067687,0.00010118093,0.00017982005,0.000003786598,0.00050630595,0.0109757325],"genre_scores_gemma":[0.31756136,0.0006660003,0.6771042,0.00009952378,0.00009888103,0.000017578093,0.0000042955953,0.000043609023,0.004404584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991317,0.00007391244,0.00023495771,0.00018035556,0.00012160949,0.00025746282],"domain_scores_gemma":[0.9995281,0.00014158386,0.000030619263,0.00018807057,0.000025987818,0.00008562813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998283,0.00014443419,0.00020615617,0.00012384218,0.00017734239,0.00013688339,0.000087714114,0.00006356784,0.00009819227],"category_scores_gemma":[0.000027867281,0.00010785425,0.00006025737,0.0005280049,0.000050563907,0.000098009485,0.000038477887,0.000103559,0.0000052181294],"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.0000051291586,0.000018927662,0.010352519,0.00003445718,0.0011193407,0.0000052923087,0.0016499566,0.11160999,0.0030186528,0.0005937038,0.001535917,0.8700561],"study_design_scores_gemma":[0.0003276291,0.000009221518,0.0025057716,0.0000036807025,0.00015326156,0.0000068207723,0.000041415668,0.9952263,0.0007680732,0.00006959946,0.0007346442,0.00015352952],"about_ca_topic_score_codex":0.0000329078,"about_ca_topic_score_gemma":0.000040188665,"teacher_disagreement_score":0.8836164,"about_ca_system_score_codex":0.000016545244,"about_ca_system_score_gemma":0.000002109382,"threshold_uncertainty_score":0.43981686},"labels":[],"label_agreement":null},{"id":"W4302011011","doi":"10.1155/2022/3017196","title":"Optimal Method for Allocation of Tractors and Trailers in Daily Dispatches of Road Drops and Pull Transport","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Wuyi University; National Natural Science Foundation of China","keywords":"Tractor; Scheduling (production processes); Skid (aerodynamics); Transport engineering; Vehicle routing problem; Drop (telecommunication); Automotive engineering; Computer science; Engineering; Routing (electronic design automation); Operations management; Computer network","score_opus":0.010162741559574823,"score_gpt":0.27090387508600416,"score_spread":0.26074113352642936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302011011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70130485,0.00022897884,0.29818398,0.000031032596,0.000071389935,0.00013570224,0.000033285938,0.0000070604324,0.0000036984925],"genre_scores_gemma":[0.6902254,0.000120604695,0.30959952,0.000002730014,0.000007594868,0.000008418397,0.000017959559,0.000015800424,0.0000019896368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9988655,0.000046919176,0.000715237,0.000094518095,0.00018108558,0.000096772004],"domain_scores_gemma":[0.9993753,0.00012391832,0.0003186686,0.000051181316,0.00008937976,0.000041541174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006785914,0.00009782405,0.00030569194,0.00020897145,0.000025979,0.0000023702753,0.0000583019,0.000039540355,0.000006461262],"category_scores_gemma":[0.000019871857,0.000107330656,0.000064933985,0.00021580142,0.000023952916,0.00028237933,8.530048e-7,0.00015089632,3.762878e-9],"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.0002105502,0.000037533544,0.00876969,0.00018644327,0.000029929526,0.0000017682211,0.0056295064,0.9091264,0.054259155,0.00005807071,5.437798e-7,0.021690419],"study_design_scores_gemma":[0.002606774,0.00040249072,0.9027774,0.00008133813,0.000125551,0.00001215408,0.0036636381,0.07395097,0.01598005,0.00017798858,0.000058344,0.0001633022],"about_ca_topic_score_codex":0.000009966925,"about_ca_topic_score_gemma":0.000029990777,"teacher_disagreement_score":0.8940077,"about_ca_system_score_codex":0.00003364099,"about_ca_system_score_gemma":0.000028094348,"threshold_uncertainty_score":0.4376817},"labels":[],"label_agreement":null},{"id":"W4304609420","doi":"10.1287/ijoo.2022.0082","title":"Machine-Learning–Based Arc Selection for Constrained Shortest Path Problems in Column Generation","year":2022,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"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; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Computer science; Mathematical optimization; Shortest path problem; Scheduling (production processes); Heuristic; Operations research; Selection (genetic algorithm); Crew scheduling; Artificial intelligence; Graph; Mathematics; Theoretical computer science","score_opus":0.019399511709611655,"score_gpt":0.24546731220356632,"score_spread":0.22606780049395467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304609420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007938353,0.000031388307,0.99003434,0.00010312283,0.00044910476,0.0006099052,0.000021016147,0.00023082354,0.0005819339],"genre_scores_gemma":[0.79424393,0.000060919952,0.20439306,0.00023530253,0.00017901589,0.00023089375,0.00044825676,0.00008211481,0.00012649443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984787,0.00012317812,0.00062491954,0.0001498153,0.00033749783,0.00028589455],"domain_scores_gemma":[0.9993309,0.00010413491,0.00022218007,0.00008481845,0.0001745921,0.00008340654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012301307,0.00018304808,0.00019413061,0.000485885,0.00047055318,0.0001664484,0.000122063284,0.0000842712,0.00025514254],"category_scores_gemma":[0.00023413007,0.00019801538,0.000074612566,0.00064719963,0.000015665402,0.000368104,0.000014712052,0.0006227643,0.000001569194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003402514,0.00004531183,0.0022551948,0.000015862708,0.000015001206,0.0000011299724,0.00018325653,0.99352866,0.0003396853,0.00009254812,0.00015969382,0.0033296254],"study_design_scores_gemma":[0.0015322802,0.00042412055,0.0000779244,0.000022230746,0.000011688047,0.000051789197,0.00004970543,0.99540323,0.00026905842,0.000030879433,0.0018999686,0.00022713795],"about_ca_topic_score_codex":0.000005482453,"about_ca_topic_score_gemma":0.000009277071,"teacher_disagreement_score":0.7863056,"about_ca_system_score_codex":0.0005663604,"about_ca_system_score_gemma":0.00012112177,"threshold_uncertainty_score":0.80748326},"labels":[],"label_agreement":null},{"id":"W4306160204","doi":"10.3390/su142013130","title":"Optimization of Snowplow Routes for Real-World Conditions","year":2022,"lang":"en","type":"article","venue":"Sustainability","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"University of Alberta; Ontario Tech University","funders":"","keywords":"Dijkstra's algorithm; Tabu search; Truck; Metaheuristic; Process (computing); Computer science; Mathematical optimization; Route planning; Transport engineering; Shortest path problem; Engineering; Automotive engineering; Algorithm; Mathematics","score_opus":0.013033691881806453,"score_gpt":0.29862575106111067,"score_spread":0.2855920591793042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306160204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0571477,0.000033916593,0.9381114,0.00044807917,0.00029167652,0.001160857,0.00021498077,0.00054795237,0.0020434004],"genre_scores_gemma":[0.9098492,0.0000038799367,0.089133345,0.000015382264,0.000027084749,0.00036493945,0.00012120674,0.00003361702,0.0004513311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990642,0.00013726979,0.0003012606,0.00016201827,0.00013389648,0.0002013249],"domain_scores_gemma":[0.9988951,0.0002950146,0.000060590235,0.00029096872,0.00041794367,0.00004039681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007286389,0.0000943091,0.00016978038,0.00014394891,0.0001969053,0.000011032141,0.00013232658,0.00002651143,0.00027775078],"category_scores_gemma":[0.0005743509,0.00011704006,0.00007874918,0.0005532466,0.00005061349,0.00009608591,0.000058761583,0.00010660327,2.1347554e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011942225,0.000041659554,0.004811751,0.00020231307,0.000014730672,3.0755825e-7,0.00025878494,0.9867295,0.000037759608,0.006812404,0.00053587666,0.0005429806],"study_design_scores_gemma":[0.00033850464,0.000050966388,0.0036884104,0.0000025294964,0.000022824996,6.4619445e-7,0.0006562777,0.9856059,0.00059996493,0.0074128862,0.0014810286,0.00014007847],"about_ca_topic_score_codex":0.000043750533,"about_ca_topic_score_gemma":0.0000091723405,"teacher_disagreement_score":0.85270154,"about_ca_system_score_codex":0.00077786297,"about_ca_system_score_gemma":0.00012999924,"threshold_uncertainty_score":0.4772755},"labels":[],"label_agreement":null},{"id":"W4307865551","doi":"10.5267/j.jpm.2022.10.001","title":"Development of a robust multi-objective model for green capacitated location-routing under crisis conditions","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sorting; Computer science; Mathematical optimization; Genetic algorithm; Operations research; Supply chain network; Supply chain; Set (abstract data type); Reliability (semiconductor); Routing (electronic design automation); Integer programming; Vehicle routing problem; Robust optimization; Facility location problem; Linear programming; Network planning and design; Supply chain management; Engineering; Business; Mathematics; Algorithm","score_opus":0.07756697463210986,"score_gpt":0.3183241950681378,"score_spread":0.24075722043602793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307865551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01166392,0.000039110488,0.9872413,0.0000718879,0.00015785648,0.0005206004,0.000017976554,0.000046659046,0.00024068524],"genre_scores_gemma":[0.40315863,0.0000046942764,0.59647477,0.00003640001,0.000014667622,0.000084054336,0.000008424284,0.000025967462,0.00019237238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986552,0.000076308505,0.00067206623,0.00011320135,0.0003040438,0.00017917897],"domain_scores_gemma":[0.9991634,0.000056260465,0.00032969084,0.00011652171,0.00030103125,0.000033089393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011058958,0.00012266703,0.00021401193,0.0004688994,0.00021228332,0.000016244301,0.0001903943,0.000024684894,0.000016482949],"category_scores_gemma":[0.000030430792,0.000131022,0.00008315921,0.0005215219,0.000013243149,0.00012673812,0.00007692509,0.000166048,4.8512777e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018462448,0.00008752344,0.000020648788,0.00016242938,0.0003803994,0.0000017903646,0.0062961485,0.99041706,0.00032651084,0.000486558,0.00086957973,0.0009328841],"study_design_scores_gemma":[0.0009715023,0.000038526912,0.00023621513,0.000039774863,0.00010628782,0.000007790076,0.013272147,0.9842883,0.0005072531,0.00013848407,0.00025551775,0.00013823404],"about_ca_topic_score_codex":0.000010259697,"about_ca_topic_score_gemma":0.000007931684,"teacher_disagreement_score":0.39149472,"about_ca_system_score_codex":0.00047013685,"about_ca_system_score_gemma":0.000117194235,"threshold_uncertainty_score":0.53429216},"labels":[],"label_agreement":null},{"id":"W4308195387","doi":"10.1016/j.ejor.2022.10.045","title":"Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"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":"Computer science; Vehicle routing problem; Bayesian probability; Benchmark (surveying); Iterated function; Mathematical optimization; Operations research; Feature (linguistics); Constraint (computer-aided design); Cover (algebra); Key (lock); Routing (electronic design automation); Artificial intelligence; Mathematics; Engineering","score_opus":0.029701638751559324,"score_gpt":0.31939307167857384,"score_spread":0.2896914329270145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308195387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5007042,0.0060460498,0.49091852,0.0007640087,0.00012088315,0.0003899572,0.000005784395,0.000032612978,0.001017944],"genre_scores_gemma":[0.9834443,0.0008297282,0.015481624,0.000034696044,0.000086883265,0.000010108322,0.000009625814,0.000043056472,0.000060004182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773645,0.0009334846,0.0004172693,0.00014686775,0.0005045873,0.0002613324],"domain_scores_gemma":[0.9989613,0.0005521795,0.00007658701,0.000056166737,0.00025160587,0.00010210684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060119387,0.00009675727,0.00015426264,0.00028364532,0.00046487205,0.00009070783,0.00013194888,0.000011985703,0.00008442272],"category_scores_gemma":[0.00049855415,0.00009006873,0.0000177311,0.00037684242,0.000046161033,0.00029339944,0.00009069529,0.00077742385,7.417982e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016943234,0.000018462486,0.0038316739,0.000020732456,0.000024678498,0.000027521684,0.00071539,0.95931745,0.000589482,0.0001235121,0.000048936803,0.035112727],"study_design_scores_gemma":[0.0021106254,0.0007146707,0.0060004075,0.0001048957,0.000009856349,0.00015944561,0.0008571038,0.98584694,0.00008023583,0.00006013478,0.0039157555,0.00013992823],"about_ca_topic_score_codex":7.8766277e-7,"about_ca_topic_score_gemma":0.0000032469654,"teacher_disagreement_score":0.48274004,"about_ca_system_score_codex":0.00013277345,"about_ca_system_score_gemma":0.00007339962,"threshold_uncertainty_score":0.36728963},"labels":[],"label_agreement":null},{"id":"W4308232794","doi":"10.1145/3557991.3567776","title":"Solving a multi-trip VRP with real heterogeneous fleet and time windows based on ant colony optimization","year":2022,"lang":"en","type":"article","venue":"","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":true,"ca_institutions":"National Research Council Canada; University of Calgary","funders":"","keywords":"Vehicle routing problem; Ant colony optimization algorithms; Computer science; Heuristics; TRIPS architecture; Constructive; Heuristic; Mathematical optimization; Metaheuristic; Routing (electronic design automation); Operations research; Algorithm; Artificial intelligence; Engineering; Process (computing); Mathematics; Parallel computing","score_opus":0.011954159391129465,"score_gpt":0.23061564973959228,"score_spread":0.21866149034846283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308232794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043469433,0.00003565447,0.95133704,0.00007191456,0.00010328522,0.00049365626,0.00002261916,0.00087627233,0.0035901498],"genre_scores_gemma":[0.4505236,0.000010399709,0.5486961,0.00018992266,0.000025022135,0.00006415877,0.000041290878,0.000078025296,0.000371505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895227,0.00014561214,0.00019382486,0.00024951965,0.00022164549,0.00023715297],"domain_scores_gemma":[0.9994907,0.00013614574,0.000044138764,0.00021175701,0.000034773908,0.00008252403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003405004,0.0001712145,0.00018019257,0.00014099291,0.00021657032,0.000051762316,0.0000962908,0.000047039237,0.00042000398],"category_scores_gemma":[0.0000332629,0.00016807848,0.000025886036,0.00027822456,0.000021275808,0.000066397,0.000049091574,0.00016258637,0.0000052421196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050038998,0.000037031037,0.0005381877,0.0000142677645,0.00001831413,0.000017192848,0.00011575592,0.99767953,0.00078650087,0.000008094474,0.00009827829,0.00063678005],"study_design_scores_gemma":[0.0010644343,0.00021745126,0.00015412914,0.0000113366805,0.000016923728,0.000025645475,0.000026184885,0.9971373,0.0009995262,7.951982e-7,0.00012872125,0.00021751923],"about_ca_topic_score_codex":0.000022277547,"about_ca_topic_score_gemma":0.000005002568,"teacher_disagreement_score":0.40705416,"about_ca_system_score_codex":0.0001384491,"about_ca_system_score_gemma":0.000029134399,"threshold_uncertainty_score":0.6854041},"labels":[],"label_agreement":null},{"id":"W4308272905","doi":"10.17771/pucrio.acad.61096","title":"EXPLORING THE FRONTIER OF COMBINATORIAL OPTIMIZATION AND MACHINE LEARNING: APPLICATIONS TO VEHICLE ROUTING AND SUPPORT VECTOR MACHINES","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Pontifícia Universidade Católica do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Compute Canada; Polytechnique Montréal","keywords":"Vehicle routing problem; Computer science; Crossover; Metaheuristic; Context (archaeology); Support vector machine; Artificial intelligence; Machine learning; Scheduling (production processes); Integer programming; Mathematical optimization; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.02842710578212716,"score_gpt":0.2698469731593704,"score_spread":0.24141986737724325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308272905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3135686,0.0019517639,0.6540888,0.00034951366,0.0056678727,0.004496012,0.00015575174,0.0018811009,0.01784061],"genre_scores_gemma":[0.8593784,0.0009870412,0.13121594,0.000044852353,0.0003827134,0.0013191638,0.0017614438,0.00036485877,0.004545593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878234,0.00011441816,0.0004081227,0.0002768172,0.00023469992,0.00018359012],"domain_scores_gemma":[0.99933153,0.00017796454,0.000124862,0.00020685745,0.000082371196,0.00007643596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048112223,0.0002375856,0.0003085982,0.0001707626,0.00029432515,0.00006634855,0.00015801142,0.00008097804,0.00018276293],"category_scores_gemma":[0.00012569193,0.00022110276,0.000041292205,0.0003795621,0.000018315888,0.00014076379,0.0000756684,0.0004073195,0.0000011639634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028955752,0.00001918507,0.0016070633,0.0002135637,0.000076123004,4.412024e-7,0.002999252,0.9725687,0.0007472037,0.0014200385,0.0000577001,0.020261804],"study_design_scores_gemma":[0.0004781734,0.00008148291,0.0032142831,0.0000327693,0.00011932384,0.0000032864837,0.0012874315,0.9892584,0.0015387367,0.00004851303,0.0035290343,0.0004085572],"about_ca_topic_score_codex":0.00007228366,"about_ca_topic_score_gemma":0.0000123811005,"teacher_disagreement_score":0.5458098,"about_ca_system_score_codex":0.000048788483,"about_ca_system_score_gemma":0.000023021712,"threshold_uncertainty_score":0.9016309},"labels":[],"label_agreement":null},{"id":"W4308453111","doi":"10.3390/a15110412","title":"Branch and Price Algorithm for Multi-Trip Vehicle Routing with a Variable Number of Wagons and Time Windows","year":2022,"lang":"en","type":"article","venue":"Algorithms","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":"University of Lethbridge","funders":"","keywords":"Column generation; Vehicle routing problem; Computer science; Variable (mathematics); TRIPS architecture; Truck; Routing (electronic design automation); Column (typography); Mathematical optimization; Branch and price; Variable neighborhood search; Algorithm; Integer programming; Mathematics; Metaheuristic; Parallel computing; Engineering; Computer network","score_opus":0.013957518895598283,"score_gpt":0.2573606026811846,"score_spread":0.2434030837855863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308453111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03666838,0.00021729473,0.96163076,0.00002634391,0.00009772316,0.0005054636,0.0001232739,0.00020021941,0.0005305589],"genre_scores_gemma":[0.044272203,0.000013399749,0.95493853,0.000036548245,0.000044062817,0.000119471,0.000018934177,0.00007358815,0.0004832712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989429,0.00007269794,0.0002529606,0.00025900293,0.0001710971,0.00030135285],"domain_scores_gemma":[0.99935627,0.00024559384,0.000074668154,0.00016981637,0.00007130665,0.00008232841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061840715,0.00016729026,0.00027901147,0.00006138718,0.00022216215,0.000032226417,0.00010241916,0.00005438599,0.00007494576],"category_scores_gemma":[0.00004459039,0.00017506654,0.000026333206,0.00036390117,0.00004603338,0.00012860898,0.00010349274,0.00018384053,0.0000015854738],"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.00008215238,0.00033082897,0.011538288,0.00045752715,0.0006748814,0.000025066942,0.0052030203,0.40172166,0.0115525285,0.00084432826,0.0003883749,0.56718135],"study_design_scores_gemma":[0.0016780625,0.0000768506,0.00065007247,0.000018829289,0.000043493215,0.00011129478,0.000106660955,0.99531144,0.00090419274,0.00007381619,0.0008032599,0.00022201771],"about_ca_topic_score_codex":0.000036656867,"about_ca_topic_score_gemma":4.1355744e-7,"teacher_disagreement_score":0.5935898,"about_ca_system_score_codex":0.00004681335,"about_ca_system_score_gemma":0.000029716555,"threshold_uncertainty_score":0.7139006},"labels":[],"label_agreement":null},{"id":"W4308600751","doi":"10.1016/j.eswa.2022.119228","title":"A bi-objective green vehicle routing problem with a mixed fleet of conventional and electric trucks: Considering charging power and density of stations","year":2022,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; Greenhouse gas; Computer science; Vehicle routing problem; Minification; Constraint (computer-aided design); Routing (electronic design automation); Mathematical optimization; Total cost; Automotive engineering; Function (biology); Operations research; Mathematics; Engineering; Business; Computer network","score_opus":0.009149907028323509,"score_gpt":0.23046276061699422,"score_spread":0.2213128535886707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308600751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5284634,0.0007152413,0.46907675,0.000053054104,0.00002151622,0.001155563,0.00004106687,0.00014698526,0.0003264143],"genre_scores_gemma":[0.9588828,0.000009836091,0.04017145,0.0000074777226,0.000012937948,0.0008503858,0.00001153756,0.000034081197,0.0000195099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989387,0.000110007655,0.00033931746,0.00022889758,0.00021716022,0.00016596174],"domain_scores_gemma":[0.99921525,0.00019466001,0.00019447478,0.00017965065,0.0001559603,0.000059995014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033080595,0.00013373901,0.00026157385,0.00017678892,0.00026041115,0.000019854368,0.000068347166,0.00002964361,0.0000069415196],"category_scores_gemma":[0.000012612368,0.00013093668,0.000018693974,0.0005826432,0.000056415705,0.00009496555,0.00004497979,0.00012858734,2.250148e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021157431,0.00032443786,0.12450794,0.0012384896,0.0011299648,0.000007764933,0.03309536,0.5662683,0.22423168,0.045840513,0.00013981047,0.003004142],"study_design_scores_gemma":[0.0038210484,0.00050800206,0.028117808,0.00037622126,0.00014607537,0.00051182724,0.021260712,0.9246585,0.018515937,0.00030863035,0.00086319563,0.0009120582],"about_ca_topic_score_codex":0.00023802296,"about_ca_topic_score_gemma":0.000018396016,"teacher_disagreement_score":0.4304194,"about_ca_system_score_codex":0.00007435851,"about_ca_system_score_gemma":0.00006193194,"threshold_uncertainty_score":0.53394425},"labels":[],"label_agreement":null},{"id":"W4309241540","doi":"10.1155/2022/5714991","title":"A Review of Heuristics and Hybrid Methods for Green Vehicle Routing Problems considering Emissions","year":2022,"lang":"en","type":"review","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Nacional de Investigación y Desarrollo; Universidad Técnica Federico Santa María","keywords":"Greenhouse gas; Vehicle routing problem; Heuristics; Green logistics; Sustainability; Carbon footprint; Heuristic; Fuel efficiency; Computer science; Routing (electronic design automation); Environmental economics; Operations research; Transport engineering; Environmental science; Engineering; Automotive engineering; Economics","score_opus":0.057185492030025785,"score_gpt":0.3793666147285397,"score_spread":0.32218112269851396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309241540","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000055221876,0.70221007,0.2969923,0.000009187243,0.0002114352,0.00048088862,0.000053350763,0.000026746882,0.000010522765],"genre_scores_gemma":[0.0000028164045,0.6127348,0.3870874,0.000009477783,0.00003508504,0.000026786025,0.000044139928,0.000054863853,0.000004626747],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974336,0.00021707929,0.0018445377,0.0001576542,0.00017577436,0.00017135325],"domain_scores_gemma":[0.9971157,0.001077206,0.0013630553,0.00014756284,0.00020198085,0.0000945497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001687155,0.00026020315,0.0015015461,0.00019252552,0.00007336422,0.000008673102,0.00014455388,0.000073595555,0.00002222696],"category_scores_gemma":[0.0005452847,0.00024773733,0.00037479526,0.0003107493,0.000023416402,0.00016122758,0.0000061963547,0.00045661937,6.03024e-8],"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.0000035169317,0.000009617139,0.000001526884,0.13490832,0.00011127209,0.0000035803625,0.00014623633,0.05123847,0.000039487353,0.000019467652,0.000016434666,0.8135021],"study_design_scores_gemma":[0.0004396917,0.00010500925,0.0000058428386,0.10080845,0.0016915175,0.00009816031,0.000050794588,0.0039540296,0.000049379843,0.00020234202,0.8922847,0.00031006965],"about_ca_topic_score_codex":9.95063e-7,"about_ca_topic_score_gemma":4.822162e-7,"teacher_disagreement_score":0.8922683,"about_ca_system_score_codex":0.00008816954,"about_ca_system_score_gemma":0.00012669717,"threshold_uncertainty_score":0.9999975},"labels":[],"label_agreement":null},{"id":"W4309400251","doi":"10.1016/j.omega.2022.102805","title":"A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty","year":2022,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Western University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Staffing; Benders' decomposition; Scheduling (production processes); Robustness (evolution); Schedule; Integer programming; Job shop scheduling; Operations research; Mathematics","score_opus":0.013367532368724823,"score_gpt":0.25770738352579703,"score_spread":0.2443398511570722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309400251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46692872,0.00027311433,0.5321804,0.000012546098,0.000061566185,0.00030851676,0.000057941717,0.00011180021,0.00006532654],"genre_scores_gemma":[0.89102906,0.000008573916,0.108751684,0.00001819154,0.000011050248,0.00010230067,0.00002838579,0.00003548489,0.000015277014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922323,0.000043674514,0.00021534709,0.00019903875,0.00013108081,0.00018761975],"domain_scores_gemma":[0.99955815,0.000118598924,0.000078327634,0.00013379585,0.000063561725,0.000047567042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043133617,0.00013662153,0.00019138782,0.00012357971,0.00014861285,0.000032275126,0.0000983671,0.000052344778,0.0000115554485],"category_scores_gemma":[0.000025284755,0.00014254986,0.0000282591,0.00025013293,0.000025286883,0.00003772482,0.00010665393,0.00015974442,6.5310616e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011961494,0.00001745325,0.00078809104,0.0002133449,0.000024998344,2.7623958e-7,0.0012728987,0.9474834,0.049007423,0.0002406503,0.0000025834136,0.00093687075],"study_design_scores_gemma":[0.0007599858,0.00008301994,0.00040209855,0.00007721576,0.000026640502,0.000007911747,0.005316787,0.9854966,0.007325044,0.000029041343,0.00027713328,0.00019852829],"about_ca_topic_score_codex":0.000057413967,"about_ca_topic_score_gemma":0.000009057338,"teacher_disagreement_score":0.4241003,"about_ca_system_score_codex":0.00014296359,"about_ca_system_score_gemma":0.000025978467,"threshold_uncertainty_score":0.5813015},"labels":[],"label_agreement":null},{"id":"W4309462577","doi":"10.3390/math10224308","title":"Comparison of Genetic Operators for the Multiobjective Pickup and Delivery Problem","year":2022,"lang":"en","type":"article","venue":"Mathematics","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":"Queen's University","funders":"","keywords":"Pickup; Crossover; Benchmark (surveying); Mathematical optimization; Genetic algorithm; Computer science; Multi-objective optimization; Pareto principle; Operations research; Mathematics; Artificial intelligence","score_opus":0.03248189451337303,"score_gpt":0.2975622854662641,"score_spread":0.2650803909528911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309462577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30358356,0.0004929522,0.69502944,0.000020159929,0.00007798269,0.00051948155,0.000013022809,0.000068931506,0.00019443707],"genre_scores_gemma":[0.55498356,0.0000075199155,0.44486687,0.0000066382195,0.000008146686,0.00008370223,9.2050857e-7,0.000017330784,0.000025344374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995377,0.000026683176,0.00020470898,0.000059047474,0.000090481604,0.00008136486],"domain_scores_gemma":[0.9994311,0.00035825715,0.000045918565,0.000116008836,0.000034590325,0.00001413332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000244303,0.000062397354,0.0001312581,0.000028360017,0.0001222458,0.000011861669,0.000090231566,0.000015932865,0.000018678884],"category_scores_gemma":[0.000041722775,0.000051654137,0.000022849452,0.000096706564,0.000020810578,0.000016381633,0.000052594776,0.00007268357,4.3090913e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018682899,0.00003325014,0.0012317062,0.00019132312,0.000036570047,8.365374e-8,0.007322253,0.9863915,0.0008062057,0.00046791104,0.00019581859,0.003321543],"study_design_scores_gemma":[0.00017455399,0.000035069548,0.00035909814,0.0000075743883,0.000030102943,0.0000025121312,0.0021673387,0.99479216,0.0017687652,0.0003499982,0.00025146882,0.000061327555],"about_ca_topic_score_codex":0.0000023981406,"about_ca_topic_score_gemma":0.0000012006623,"teacher_disagreement_score":0.25139996,"about_ca_system_score_codex":0.000027669064,"about_ca_system_score_gemma":0.00000877539,"threshold_uncertainty_score":0.21063945},"labels":[],"label_agreement":null},{"id":"W4309716785","doi":"10.5267/j.ijiec.2022.8.004","title":"Metaheuristic algorithm for the location, routing and packing problem in the collection of recyclable waste","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Vehicle routing problem; GRASP; Metaheuristic; Mathematical optimization; Greedy randomized adaptive search procedure; Routing (electronic design automation); Guided Local Search; Computer science; Set (abstract data type); Packing problems; Greedy algorithm; Local search (optimization); Combinatorial optimization; Scheme (mathematics); Algorithm; Mathematics","score_opus":0.030770653385703135,"score_gpt":0.275353779444464,"score_spread":0.24458312605876084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010636002,0.00021759917,0.98673326,0.00080209126,0.0012891582,0.0002660927,0.000014738407,0.000020182822,0.000020883488],"genre_scores_gemma":[0.91002756,0.000020217345,0.089510016,0.000019354793,0.00034864462,0.00003844103,0.0000071002128,0.00001939887,0.000009244308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989386,0.000091518545,0.00049035315,0.000063148254,0.00031896165,0.000097372154],"domain_scores_gemma":[0.9980477,0.0013384479,0.00021493348,0.000059265018,0.00032150617,0.000018121027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016089592,0.00008042152,0.00013322741,0.0002721326,0.000121925084,0.000054922653,0.00028301732,0.00003035362,0.0000042734523],"category_scores_gemma":[0.000469939,0.00006556412,0.000049426322,0.0005525941,0.000015188011,0.000108719076,0.00003491286,0.00035365872,5.8647665e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074513873,0.000015195336,0.00012877598,0.000005629192,0.000099725745,0.0000014220302,0.0007420138,0.98075515,0.00009126184,0.00043170154,0.00027190917,0.017449765],"study_design_scores_gemma":[0.00073626277,0.000048135455,0.00018392291,0.00005274458,0.00003649402,0.000090615526,0.00067276414,0.99703515,0.00014125735,0.00016198793,0.0007806991,0.000059997972],"about_ca_topic_score_codex":0.000015042151,"about_ca_topic_score_gemma":0.0000010375687,"teacher_disagreement_score":0.8993916,"about_ca_system_score_codex":0.00014932078,"about_ca_system_score_gemma":0.00007389176,"threshold_uncertainty_score":0.2673627},"labels":[],"label_agreement":null},{"id":"W4310033065","doi":"10.1016/j.ejor.2022.11.040","title":"An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"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; Computer science; Benchmark (surveying); Integer (computer science); Mathematical optimization; TRIPS architecture; Branch and cut; Routing (electronic design automation); Operations research; Integer programming; Algorithm; Mathematics","score_opus":0.04175022239280719,"score_gpt":0.3241135125620981,"score_spread":0.2823632901692909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310033065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021198964,0.00019768506,0.9771648,0.0005489797,0.000053377273,0.00034097608,0.000014214317,0.00002611837,0.0004549101],"genre_scores_gemma":[0.8517485,0.000006896813,0.14749871,0.000055166904,0.00030842604,0.000020577427,0.000007840167,0.000064596825,0.0002892711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768466,0.0009708269,0.00032042255,0.00012349406,0.0006665804,0.00023404033],"domain_scores_gemma":[0.9984735,0.0007339007,0.000059221064,0.000118830874,0.0005104532,0.00010409199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00887902,0.00009160926,0.00012039819,0.00014942474,0.0007545258,0.00020800364,0.00032232623,0.0000099383915,0.00014237539],"category_scores_gemma":[0.00019946901,0.00006432672,0.00002928587,0.0002773701,0.0000710887,0.00022988032,0.0000874135,0.0006278672,0.000004642805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005679418,0.000024946774,0.00004291208,0.000005766223,0.000051490286,0.000016363798,0.0007278393,0.9705176,0.003103659,0.00015714242,0.00029669644,0.024998832],"study_design_scores_gemma":[0.0007898451,0.00062731,0.00064724335,0.000021295213,0.000011372411,0.00017289518,0.0003919677,0.9964594,0.00006708296,0.000024371337,0.0007048332,0.00008233056],"about_ca_topic_score_codex":9.781708e-7,"about_ca_topic_score_gemma":3.0497696e-7,"teacher_disagreement_score":0.83054954,"about_ca_system_score_codex":0.00008318417,"about_ca_system_score_gemma":0.000112890506,"threshold_uncertainty_score":0.58032787},"labels":[],"label_agreement":null},{"id":"W4310251926","doi":"10.1287/trsc.2022.1185","title":"Constrained Local Search for Last-Mile Routing","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mile; Routing (electronic design automation); Last mile (transportation); Transport engineering; Computer science; Local search (optimization); Mathematical optimization; Operations research; Engineering; Computer network; Mathematics; Geography; Algorithm","score_opus":0.028058050547799737,"score_gpt":0.30090013077915523,"score_spread":0.2728420802313555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310251926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15930554,0.00000865557,0.8390584,0.000050848288,0.00019969913,0.00018813291,0.00004978185,0.00023127228,0.0009076481],"genre_scores_gemma":[0.9335795,9.173465e-7,0.06622097,0.000047665,0.000015182489,0.000052790718,0.00002672914,0.000014939252,0.000041325013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989082,0.00002276123,0.0002071537,0.00019548209,0.0003963135,0.00027009577],"domain_scores_gemma":[0.99959636,0.00010565914,0.000022958178,0.000110575274,0.00009441892,0.00007001244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013324484,0.000070346905,0.00008384479,0.00012482551,0.00044404654,0.000030778938,0.0002248536,0.00001490048,0.00014966307],"category_scores_gemma":[0.00002188413,0.00008408323,0.000032363456,0.0008938315,0.00018208903,0.00018312554,0.0000053109748,0.0001155038,0.0000031905977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041026833,0.0000060023144,0.0008251551,0.0000124367425,0.0000020768841,9.1152737e-7,0.001279935,0.975687,0.009026364,0.0033436506,0.000020015399,0.009792339],"study_design_scores_gemma":[0.00036680838,0.00003402798,0.006614857,0.000003848823,0.0000058481837,0.0000024421056,0.0015073667,0.97650605,0.014191872,0.00006259383,0.0005706397,0.00013361215],"about_ca_topic_score_codex":0.000006333208,"about_ca_topic_score_gemma":0.0000061134183,"teacher_disagreement_score":0.77427393,"about_ca_system_score_codex":0.00009340187,"about_ca_system_score_gemma":0.00012218821,"threshold_uncertainty_score":0.34288144},"labels":[],"label_agreement":null},{"id":"W4311356531","doi":"10.18280/mmep.090505","title":"Hotel Capacity Planning Using Queuing Systems and Meta-Heuristic Algorithms","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Meta heuristic; Queueing theory; Heuristic; Computer science; Algorithm; Operations research; Mathematical optimization; Artificial intelligence; Engineering; Mathematics; Computer network","score_opus":0.09723651375150587,"score_gpt":0.2553161065363599,"score_spread":0.158079592784854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311356531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078428656,0.0020572168,0.91845393,0.000008525344,0.00018107748,0.00021579486,0.00001140695,0.00054123084,0.00010213286],"genre_scores_gemma":[0.6666573,0.000021775226,0.33308756,0.000005170087,0.00003531163,0.00007765254,0.0000024484125,0.000082669234,0.000030063202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862087,0.000055728506,0.00041874006,0.00027422004,0.0002512265,0.00037920265],"domain_scores_gemma":[0.9993727,0.00023362643,0.000046645575,0.00018054854,0.000024273733,0.00014219577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008697178,0.00027805645,0.000504826,0.00015088776,0.0002397159,0.00013318876,0.00010246433,0.00007184825,0.000014097638],"category_scores_gemma":[0.000040646348,0.00028151777,0.00005590511,0.00020020275,0.000027012253,0.00010833296,0.00009609093,0.00044150298,8.453434e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.658442e-7,0.000009743558,0.0000054525017,0.0008745029,0.00018684092,0.000005589329,0.00084759947,0.99583715,0.00046104012,0.0017262028,0.0000033471415,0.000041665255],"study_design_scores_gemma":[0.00013473305,0.000017163402,8.3696955e-7,0.0000667211,0.0003737688,0.00018726644,0.00008165818,0.9973647,0.000048056976,0.0013100738,0.00010253463,0.00031248422],"about_ca_topic_score_codex":0.00001914644,"about_ca_topic_score_gemma":2.4132559e-8,"teacher_disagreement_score":0.5882287,"about_ca_system_score_codex":0.00007322737,"about_ca_system_score_gemma":0.0000061551286,"threshold_uncertainty_score":0.9999637},"labels":[],"label_agreement":null},{"id":"W4312068629","doi":"10.1080/14942119.2022.2142367","title":"Planning methods and decision support systems in vehicle routing problems for timber transportation: a review","year":2022,"lang":"en","type":"review","venue":"International Journal of Forest Engineering","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":"Université Laval; Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Software deployment; Routing (electronic design automation); Context (archaeology); Transport engineering; Transportation planning; Decision support system; Operations research; Computer science; Engineering","score_opus":0.050798096494515416,"score_gpt":0.3840646319962774,"score_spread":0.333266535501762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312068629","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016419692,0.62325704,0.3750665,0.000005212135,0.0012065887,0.00036644598,0.000023542641,0.000038486043,0.00001976137],"genre_scores_gemma":[0.000034028588,0.8099482,0.18951304,0.000008709676,0.00022280702,0.00011068851,0.00005664131,0.000099461664,0.000006393364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99728996,0.00008164894,0.001764417,0.00019929835,0.00042474395,0.000239933],"domain_scores_gemma":[0.9979234,0.0011765441,0.0005342082,0.00012657224,0.00014842152,0.00009089637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002605691,0.00032797141,0.0011965827,0.0006181913,0.000029340013,0.000083053004,0.00043803162,0.0001392808,0.000029758241],"category_scores_gemma":[0.0004486752,0.00032116682,0.00031159967,0.00032687743,0.000008935264,0.00025717763,0.000030631407,0.0006170562,6.056196e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003227481,0.0000067073934,0.0000223849,0.0094444705,0.00015256308,0.000037696773,0.000077419914,0.658982,0.0000010113275,0.000069515554,0.00007356851,0.33112943],"study_design_scores_gemma":[0.0003909724,0.00003823738,0.000022892873,0.04917389,0.00022751982,0.00038648205,0.000013376949,0.2747433,5.1977554e-7,0.000020504209,0.674701,0.00028134102],"about_ca_topic_score_codex":0.0000030009035,"about_ca_topic_score_gemma":9.777519e-7,"teacher_disagreement_score":0.6746274,"about_ca_system_score_codex":0.0003655684,"about_ca_system_score_gemma":0.00008892986,"threshold_uncertainty_score":0.99992406},"labels":[],"label_agreement":null},{"id":"W4312179191","doi":"10.1287/msom.2022.1171","title":"On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand","year":2022,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Computer science; Routing (electronic design automation); Operations research; Dynamic pricing; Mathematical optimization; Set (abstract data type); Markov decision process; Curse of dimensionality; Economics; Microeconomics; Markov process; Engineering; Mathematics; Computer network","score_opus":0.005321924987864247,"score_gpt":0.205691340433367,"score_spread":0.20036941544550277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312179191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7984938,0.00011942409,0.19927976,0.00021236758,0.00020913314,0.0005075288,0.000028408554,0.0003368866,0.0008126603],"genre_scores_gemma":[0.9625382,0.00006456967,0.03629926,0.0005142371,0.00003928969,0.0001820577,0.00011299351,0.000074864365,0.0001745659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849033,0.00016447133,0.00029381175,0.00041981315,0.0003316245,0.00029994687],"domain_scores_gemma":[0.99930185,0.0001528263,0.000041901745,0.0003909926,0.000032149343,0.00008027487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040380622,0.00027658744,0.00023144821,0.00018217025,0.000951181,0.00025020295,0.00024180817,0.00003171334,0.00016107305],"category_scores_gemma":[0.000008443871,0.00027462697,0.000032083444,0.00018755847,0.000014299787,0.0002312406,0.00029999416,0.00029937993,0.000011264836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043823497,0.000028261895,0.00012866678,0.00007312525,0.0001603823,0.000017141094,0.0011625837,0.9950434,0.00007759806,0.00016132099,0.00004050279,0.0030631914],"study_design_scores_gemma":[0.0019863094,0.00004364251,0.007087705,0.0000826528,0.000120534336,0.0000041158323,0.0016376165,0.9874692,0.0004679642,0.0001227024,0.0005693297,0.0004082014],"about_ca_topic_score_codex":0.00021846688,"about_ca_topic_score_gemma":0.0003811526,"teacher_disagreement_score":0.16404434,"about_ca_system_score_codex":0.00021750409,"about_ca_system_score_gemma":0.0000084928715,"threshold_uncertainty_score":0.9999706},"labels":[],"label_agreement":null},{"id":"W4312579180","doi":"10.1016/j.ifacol.2022.10.218","title":"A simulation-optimization approach for solving the forestry logistics problem","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","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":"General Motors (Canada)","funders":"","keywords":"Truck; Computer science; Vehicle routing problem; Scheduling (production processes); Operations research; Mathematical optimization; Routing (electronic design automation); Optimization problem; Engineering; Mathematics; Algorithm","score_opus":0.030288823830019792,"score_gpt":0.2753424155240616,"score_spread":0.24505359169404178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312579180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006776146,0.00013367114,0.9965991,0.00021557757,0.00019464988,0.00070553104,0.00009495662,0.00043403872,0.0009449105],"genre_scores_gemma":[0.09243132,0.000007631775,0.9063262,0.00014804568,0.0002012926,0.00023143375,0.00033481303,0.00007513337,0.0002441517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884886,0.000068224756,0.00030956435,0.0002293988,0.00024521182,0.00029873362],"domain_scores_gemma":[0.9989595,0.000552055,0.0000837319,0.00026953226,0.00008658638,0.00004863767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057847647,0.00017734054,0.0001682094,0.000069484915,0.0005295783,0.00005925188,0.00026309743,0.00006677907,0.00009622025],"category_scores_gemma":[0.0002976131,0.00015874284,0.00008360327,0.00036572592,0.0000358141,0.00009094053,0.00008079397,0.00027323514,9.5095925e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011504832,0.000033177428,0.00014107978,0.000060939492,0.000030989624,4.909977e-7,0.00042701553,0.9970737,0.00010137112,0.00026499663,0.000014545354,0.0018401822],"study_design_scores_gemma":[0.00040174986,0.00003681152,0.000020446381,0.0000046812816,0.000038145234,0.000004193594,0.00040066295,0.9984,0.000024577572,0.00007090419,0.00040421908,0.00019363119],"about_ca_topic_score_codex":0.0000041666804,"about_ca_topic_score_gemma":0.0000011324222,"teacher_disagreement_score":0.09175371,"about_ca_system_score_codex":0.00013554972,"about_ca_system_score_gemma":0.00003595686,"threshold_uncertainty_score":0.6473345},"labels":[],"label_agreement":null},{"id":"W4312638287","doi":"10.1109/tsmc.2022.3199096","title":"Group Role Assignment With Constraints (GRA+): A New Category of Assignment Problems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Assignment problem; Generalized assignment problem; Group (periodic table); Computer science; Series (stratigraphy); Weapon target assignment problem; Mathematics; Mathematical optimization; Theoretical computer science","score_opus":0.012316112574734762,"score_gpt":0.20077963983724864,"score_spread":0.1884635272625139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312638287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013213522,0.00073468534,0.9810289,0.000015104785,0.0010441918,0.0010966809,0.00006112284,0.00025534042,0.002550453],"genre_scores_gemma":[0.9971085,0.000041109768,0.0010113411,0.00001030108,0.000051781848,0.000356974,0.0000064522796,0.00008365889,0.0013298384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976605,0.00037190501,0.0006648639,0.00034338632,0.0006299698,0.00032938464],"domain_scores_gemma":[0.99908054,0.00010994389,0.00019012977,0.00036809553,0.000045114255,0.00020618524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064202724,0.00030349504,0.00048039618,0.00020896076,0.00019716454,0.00009047783,0.000176561,0.000094276555,0.000046588586],"category_scores_gemma":[0.0000012573978,0.00029679676,0.000066866574,0.00028970774,0.0000856649,0.000056510187,0.0000038324497,0.00032449697,0.0000058305295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020206116,0.000092666145,0.00007229864,0.00038476742,0.00018344533,0.0000038986836,0.0009814022,0.99073106,0.003826253,0.0007787264,0.0001551344,0.0027701429],"study_design_scores_gemma":[0.002955353,0.0014104052,0.00012480542,0.0006029018,0.00024535097,0.00041578762,0.008071599,0.9749951,0.0023388437,0.000038173082,0.007842156,0.00095956394],"about_ca_topic_score_codex":0.00039445845,"about_ca_topic_score_gemma":0.000017271253,"teacher_disagreement_score":0.983895,"about_ca_system_score_codex":0.0002473521,"about_ca_system_score_gemma":0.00004897069,"threshold_uncertainty_score":0.99994844},"labels":[],"label_agreement":null},{"id":"W4312688152","doi":"10.1016/j.ifacol.2022.10.175","title":"A Vehicle Routing Problem with Time Windows and Workload Balancing for COVID-19 Testers: A Case Study","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","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":"HEC Montréal","funders":"","keywords":"Workload; Solver; Computer science; Vehicle routing problem; Integer programming; Coronavirus disease 2019 (COVID-19); Routing (electronic design automation); Operations research; Engineering; Embedded system; Operating system; Algorithm; Medicine","score_opus":0.019501941498570194,"score_gpt":0.27644497070991386,"score_spread":0.25694302921134365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312688152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9417164,0.00023868629,0.054668546,0.00045552064,0.00006769025,0.0018966882,0.00008395309,0.0007159524,0.00015659792],"genre_scores_gemma":[0.53064954,0.000002114039,0.4683815,0.00029997306,0.00008338639,0.00028364357,0.000016491502,0.00008387373,0.00019945696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998339,0.00017403641,0.0003520823,0.00043617823,0.00025444105,0.00044428196],"domain_scores_gemma":[0.998853,0.0005051576,0.000096406875,0.00027158254,0.000047498434,0.00022631514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010537581,0.00027540495,0.00034093196,0.00012760494,0.00058484625,0.00009414186,0.00014862057,0.000049989267,0.00008814465],"category_scores_gemma":[0.0001747188,0.000273893,0.00004753939,0.0004949231,0.00003355738,0.00015194509,0.0001263459,0.00031525773,0.0000030008434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010730815,0.00017919349,0.019937351,0.0001547744,0.00015216303,0.00081115135,0.011827667,0.9542754,0.002756031,0.0000047674584,0.000013215785,0.009780971],"study_design_scores_gemma":[0.0037984317,0.00059969485,0.00027164936,0.00004257851,0.0001119768,0.001726536,0.01208983,0.98056644,0.000055457764,0.0000072754256,0.00027001515,0.00046009832],"about_ca_topic_score_codex":0.000119125914,"about_ca_topic_score_gemma":0.00007221606,"teacher_disagreement_score":0.41371295,"about_ca_system_score_codex":0.00026774217,"about_ca_system_score_gemma":0.000089937894,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W4313328297","doi":"10.32907/ro-133-37011672744","title":"A divide-and-conquer strategy for the vehicle routing problem","year":2022,"lang":"en","type":"article","venue":"Research outreach","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":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Divide and conquer algorithms; Computer science; Routing (electronic design automation); Computer network; Algorithm","score_opus":0.11168350302747315,"score_gpt":0.37870891292929976,"score_spread":0.2670254099018266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313328297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23919775,0.008577642,0.6778261,0.012465341,0.00073187985,0.008783007,0.00027873114,0.002579925,0.049559634],"genre_scores_gemma":[0.99246365,0.00004151841,0.005354056,0.000028996963,0.000109408575,0.00067981076,0.000011059441,0.00005844934,0.0012530722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981346,0.00040679888,0.00020251922,0.00022726378,0.00046674142,0.0005620829],"domain_scores_gemma":[0.997946,0.0015569373,0.000021018363,0.00028315524,0.000110010114,0.00008288138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004901999,0.00010773464,0.00012759563,0.00011258005,0.00092505896,0.00014123514,0.00031478648,0.00003857815,0.0001078131],"category_scores_gemma":[0.00021289903,0.0000893417,0.000045915884,0.00045050387,0.00007046883,0.00008817254,0.00026346862,0.0006421883,0.000006951036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027003463,0.000039721017,0.0027224105,0.00010267178,0.00008907929,0.00000453469,0.0018206238,0.86505795,0.0028447786,0.008895239,0.0050333007,0.11336272],"study_design_scores_gemma":[0.0005423136,0.000107780106,0.0014738673,0.000010321169,0.000012483979,0.000010765103,0.0010178481,0.97344023,0.00059961114,0.0024511595,0.020170242,0.00016335922],"about_ca_topic_score_codex":0.00009607122,"about_ca_topic_score_gemma":0.000009057872,"teacher_disagreement_score":0.7532659,"about_ca_system_score_codex":0.000121382276,"about_ca_system_score_gemma":0.000057716963,"threshold_uncertainty_score":0.7114899},"labels":[],"label_agreement":null},{"id":"W4313593040","doi":"10.1016/j.trb.2023.01.002","title":"An exact algorithm for the two-echelon vehicle routing problem with drones","year":2023,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":122,"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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Drone; Computer science; Routing (electronic design automation); Mathematical optimization; Algorithm; Mathematics; Computer network","score_opus":0.2997001689468235,"score_gpt":0.46398993750047557,"score_spread":0.16428976855365207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313593040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079181306,0.000043887045,0.9179008,0.00042549564,0.00009860587,0.0010609153,0.000042169202,0.0011052121,0.00014161417],"genre_scores_gemma":[0.19392158,0.00009665317,0.804535,0.000033684366,0.00021981061,0.0007842751,0.000170584,0.00007685617,0.00016156115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962132,0.0015376948,0.00041683484,0.0004270492,0.00063746073,0.00076774956],"domain_scores_gemma":[0.99231845,0.0068073412,0.000049129205,0.0003544667,0.00030624087,0.00016435744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014007799,0.00019938266,0.00028509132,0.00017237503,0.00051386893,0.000103446,0.00037066155,0.00014699806,0.000085356194],"category_scores_gemma":[0.00035579313,0.00013262726,0.00007897895,0.0013860207,0.00018571349,0.0002151598,0.000008407552,0.00057247677,0.000025614137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086121836,0.000043062762,0.0027740465,0.00007142805,0.0000740131,0.000018445759,0.001153184,0.8128086,0.0058104256,0.0019579032,0.00034949178,0.17485331],"study_design_scores_gemma":[0.000786111,0.00028761887,0.02724186,0.000032818232,0.000029470793,0.0000018085868,0.001016071,0.96150994,0.0059588253,0.0012185037,0.0016867439,0.00023022875],"about_ca_topic_score_codex":0.0000453831,"about_ca_topic_score_gemma":0.000055192988,"teacher_disagreement_score":0.17462307,"about_ca_system_score_codex":0.00004822283,"about_ca_system_score_gemma":0.000047583217,"threshold_uncertainty_score":0.5408383},"labels":[],"label_agreement":null},{"id":"W4318820632","doi":"10.1145/3582500","title":"Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","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":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Approximation algorithm; Bounded function; Vehicle routing problem; Euclidean geometry; Treewidth; Discrete mathematics; Graph; Routing (electronic design automation); Pathwidth; Computer science; Line graph","score_opus":0.05042969397683607,"score_gpt":0.3004710953604926,"score_spread":0.25004140138365655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318820632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17752542,0.000014075308,0.8190044,0.00023344271,0.0007340459,0.000661167,0.00008505082,0.0016244601,0.000117936615],"genre_scores_gemma":[0.6778869,0.00005124642,0.32128644,0.000043243213,0.000045952096,0.00017501826,0.00008796405,0.00012012928,0.00030308275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998061,0.00010958361,0.00063276844,0.00037977612,0.00036695143,0.00044992406],"domain_scores_gemma":[0.9981407,0.00086038763,0.00013373098,0.0005798304,0.00018122018,0.0001041305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081939896,0.0002981848,0.0003919572,0.00063050335,0.00037624108,0.000079933016,0.00026208663,0.00021356945,0.000043337637],"category_scores_gemma":[0.00028075217,0.00028751427,0.00019919443,0.0016167519,0.00007340715,0.00025195754,0.000006386779,0.0002966208,0.000025683537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042957222,0.0003395802,0.0000451217,0.00039308076,0.00042614422,0.0000057673287,0.002086816,0.71841425,0.03553833,0.0016282311,0.00032270525,0.24037042],"study_design_scores_gemma":[0.0017931082,0.00025160558,0.00013449133,0.00012749077,0.00006499189,0.000003187242,0.00027782298,0.85787755,0.13703199,0.00170529,0.0004179436,0.00031451235],"about_ca_topic_score_codex":0.000021884496,"about_ca_topic_score_gemma":0.000012492449,"teacher_disagreement_score":0.5003615,"about_ca_system_score_codex":0.00013739131,"about_ca_system_score_gemma":0.000043743763,"threshold_uncertainty_score":0.9999577},"labels":[],"label_agreement":null},{"id":"W4319310318","doi":"10.1080/01605682.2023.2174052","title":"Mechanisms for feasibility and improvement for inventory-routing problems","year":2023,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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é Laval; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Mathematical optimization; Benchmark (surveying); Vehicle routing problem; Modular design; Routing (electronic design automation); Set (abstract data type); Exploit; Heuristic; Heuristics; Column generation; Scheme (mathematics); Class (philosophy); Operations research; Mathematics; Artificial intelligence","score_opus":0.1469068184216912,"score_gpt":0.4022142332776783,"score_spread":0.25530741485598707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319310318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2891212,0.000180459,0.70236564,0.0053127483,0.00065347867,0.0021864912,0.00005058175,0.000065084314,0.00006430794],"genre_scores_gemma":[0.73243123,0.00020766392,0.26572362,0.00016474685,0.0004004167,0.00016865064,0.000008868343,0.000052329757,0.0008424373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998761,0.000093400784,0.0003108495,0.00009737887,0.00049184996,0.00024554186],"domain_scores_gemma":[0.9984872,0.00056233816,0.000059472768,0.00010392747,0.0007184257,0.00006863875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009101466,0.00006733975,0.00011461539,0.000039515555,0.0004296441,0.000108121974,0.00019355194,0.00005794867,0.0000058291207],"category_scores_gemma":[0.0012466323,0.000048006597,0.00016768392,0.0002647208,0.000048375594,0.00014302741,0.000080280304,0.00025415584,5.4874624e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046618337,0.000060383652,0.0011006686,0.00058590533,0.00026932717,2.5586567e-7,0.0029466841,0.7141715,0.22437665,0.013326815,0.03892895,0.0041862293],"study_design_scores_gemma":[0.0007847064,0.00013444196,0.0007742576,0.000052438663,0.000009386586,0.000002794686,0.00048597806,0.9758487,0.006393918,0.014179119,0.0012687567,0.00006553076],"about_ca_topic_score_codex":0.0000014046634,"about_ca_topic_score_gemma":0.0000015304179,"teacher_disagreement_score":0.44331005,"about_ca_system_score_codex":0.0002509085,"about_ca_system_score_gemma":0.00014677049,"threshold_uncertainty_score":0.33045185},"labels":[],"label_agreement":null},{"id":"W4319441355","doi":"10.1016/j.ejor.2023.01.066","title":"Multiple allocation hub location with service level constraints for two shipment classes","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Indian Institute of Management Ahmedabad","keywords":"Computer science; Service (business); Context (archaeology); Constraint (computer-aided design); Network planning and design; Operations research; Service provider; Service level; Queue; Class (philosophy); Location-allocation; Total cost; Variable (mathematics); Computer network; Mathematical optimization; Business; Mathematics","score_opus":0.19997675261540043,"score_gpt":0.39961275720255024,"score_spread":0.1996360045871498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319441355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15278558,0.000070694856,0.8418072,0.0021573538,0.00021350403,0.00045612856,0.000024652682,0.00009629051,0.002388608],"genre_scores_gemma":[0.9001396,0.000029949748,0.09914221,0.00006609114,0.00028076174,0.000011898227,0.000054174478,0.00005054517,0.00022479071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979671,0.00054462877,0.00041039538,0.00012624805,0.0007027685,0.00024883598],"domain_scores_gemma":[0.99618495,0.00071426464,0.000065394626,0.00012388719,0.0027988898,0.00011259739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060143946,0.00009854063,0.00011778453,0.0003319542,0.000206252,0.0001659836,0.0002437714,0.000018742547,0.00003855196],"category_scores_gemma":[0.001071813,0.000086464024,0.000027697932,0.0006798411,0.00006353622,0.00030846006,0.000031960044,0.00028564234,0.00009084021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064011394,0.00002433821,0.0003432639,0.00006410786,0.000052075444,0.000017167284,0.0004900108,0.97620606,0.010234751,0.00077669474,0.0014629932,0.010264533],"study_design_scores_gemma":[0.0027359498,0.0003058135,0.025430514,0.00024289291,0.00001412959,0.00007066632,0.0009035536,0.95695204,0.009108132,0.0000819125,0.003938183,0.00021622259],"about_ca_topic_score_codex":0.0000019618928,"about_ca_topic_score_gemma":0.000010911157,"teacher_disagreement_score":0.747354,"about_ca_system_score_codex":0.00012830547,"about_ca_system_score_gemma":0.00026093374,"threshold_uncertainty_score":0.35259005},"labels":[],"label_agreement":null},{"id":"W4320033621","doi":"10.1016/j.cor.2023.106184","title":"The road train optimization problem with load assignment","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; Solver; Computer science; Train; Iterated local search; Computation; Vehicle routing problem; Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Iterated function; Trailer; Optimization problem; Algorithm; Local search (optimization); Mathematics; Automotive engineering; Computer network; Engineering","score_opus":0.055466430265227865,"score_gpt":0.34737811217694564,"score_spread":0.2919116819117178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320033621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034783443,0.00007500246,0.9907748,0.0017394925,0.00015805854,0.00066599646,0.000003791887,0.0006159165,0.0024885614],"genre_scores_gemma":[0.24537304,0.00039449846,0.74937594,0.00005944748,0.00027317888,0.00065086276,0.000104588944,0.0001394403,0.003628998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799705,0.00037985595,0.00023187202,0.00022789124,0.00069487066,0.00046846227],"domain_scores_gemma":[0.9988287,0.00030608656,0.000008474155,0.00037023018,0.00038900448,0.00009747302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023670825,0.00012093385,0.00010303495,0.0001938309,0.00095630385,0.0005346415,0.0003461253,0.000056827226,0.000026213584],"category_scores_gemma":[0.000096619944,0.00008919099,0.000025232392,0.0016920104,0.000116539435,0.00018062728,0.00009375861,0.00033033165,0.00010523528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041557005,0.000010275889,0.000013893907,0.000010805713,0.000026187963,0.0000047741596,0.00064279774,0.9674841,0.00017995984,0.00054866815,0.0046347985,0.026439589],"study_design_scores_gemma":[0.00025750714,0.000054923716,0.00017701295,0.000029815981,0.0000028391416,0.0000054597613,0.00020385097,0.9964026,0.00025953163,0.00001992975,0.0024726924,0.00011381093],"about_ca_topic_score_codex":0.000022768272,"about_ca_topic_score_gemma":0.0000438316,"teacher_disagreement_score":0.24189469,"about_ca_system_score_codex":0.0002734358,"about_ca_system_score_gemma":0.00016763114,"threshold_uncertainty_score":0.7355213},"labels":[],"label_agreement":null},{"id":"W4320149362","doi":"10.1007/978-3-031-24866-5_8","title":"Learning to Solve a Stochastic Orienteering Problem with Time Windows","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Orienteering; Vehicle routing problem; Computer science; Reinforcement learning; Mathematical optimization; Combinatorial optimization; Variety (cybernetics); Travelling salesman problem; Routing (electronic design automation); Optimization problem; Artificial intelligence; Algorithm; Mathematics","score_opus":0.008960571633318136,"score_gpt":0.222514940281767,"score_spread":0.21355436864844884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320149362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018183881,0.000056230063,0.9951873,0.00005950123,0.00037262758,0.0004795386,0.0000029845762,0.00045664958,0.0032033701],"genre_scores_gemma":[0.023092687,0.000002831038,0.9759554,0.00015399462,0.0002086873,0.0000331245,0.000008043961,0.00013709127,0.0004081211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978088,0.000018348195,0.00030189462,0.000709801,0.0006452085,0.0005159123],"domain_scores_gemma":[0.9990106,0.0002690434,0.00008169551,0.00040459583,0.000091723414,0.00014229692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006615876,0.0003910215,0.0003791695,0.0006057976,0.00022202008,0.00016434454,0.0006699218,0.000117242715,0.00016268532],"category_scores_gemma":[0.000076640965,0.00038762423,0.000046458877,0.00063530303,0.00012205724,0.0001656937,0.00043276005,0.0010637123,0.000036258058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005246932,0.0000030058338,0.0000069588345,0.000027966638,0.000010052808,0.000017783823,0.0011833652,0.92925763,0.00016095051,0.00016874363,0.000003004307,0.0691553],"study_design_scores_gemma":[0.00015766406,0.00020878915,0.000007133879,0.00029775826,0.000010238207,0.000046844496,4.74343e-7,0.99683356,0.0001340148,0.0006416142,0.0011658361,0.0004960939],"about_ca_topic_score_codex":0.0000047692315,"about_ca_topic_score_gemma":0.000006793859,"teacher_disagreement_score":0.06865921,"about_ca_system_score_codex":0.00045046443,"about_ca_system_score_gemma":0.00013705407,"threshold_uncertainty_score":0.99985754},"labels":[],"label_agreement":null},{"id":"W4320341229","doi":"","title":"A railroad maintenance problem solved with a cut and column generation matheuristic","year":2015,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Polytechnique Montréal","funders":"","keywords":"Column generation; Column (typography); Computer science; Mathematics; Environmental science; Mathematical optimization; Geometry","score_opus":0.01708505729145844,"score_gpt":0.2164264915894708,"score_spread":0.19934143429801238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320341229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103633896,0.00027893565,0.8730128,0.0011483008,0.000053171858,0.00028527871,0.0000073841434,0.00040990824,0.021170318],"genre_scores_gemma":[0.52744615,0.00007646667,0.46979794,0.000033603446,0.000013149057,0.00004083111,0.000040227576,0.00004018396,0.0025114727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980295,0.001038985,0.00023769979,0.00026618098,0.00020152687,0.00022615888],"domain_scores_gemma":[0.99811316,0.0002560792,0.00009226058,0.00051824824,0.0008579511,0.000162295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026422588,0.0001534667,0.00016399131,0.000073020456,0.00013197846,0.00019806983,0.00020751594,0.000070713555,0.00001649141],"category_scores_gemma":[0.00055064075,0.00015235084,0.00002401623,0.00030649683,0.000101812664,0.0001598272,0.000077356744,0.00015033767,0.0000133386675],"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.00015038239,0.0012755315,0.025338236,0.0009870473,0.00053791644,0.00006066821,0.093063086,0.2110525,0.07683804,0.24850793,0.028476978,0.31371167],"study_design_scores_gemma":[0.0009709275,9.873012e-7,0.0006816704,0.00029937676,0.000023361503,0.000036558537,0.000119769815,0.9778793,0.013822927,0.0006303043,0.005246251,0.00028856288],"about_ca_topic_score_codex":0.00009816334,"about_ca_topic_score_gemma":0.00050349376,"teacher_disagreement_score":0.7668268,"about_ca_system_score_codex":0.000075916534,"about_ca_system_score_gemma":0.0000706961,"threshold_uncertainty_score":0.6212687},"labels":[],"label_agreement":null},{"id":"W4321460198","doi":"10.1016/j.cie.2023.109108","title":"A robust multi-objective routing problem for heavy-duty electric trucks with uncertain energy consumption","year":2023,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; Heavy duty; Energy consumption; Automotive engineering; Routing (electronic design automation); Electric energy consumption; Computer science; Consumption (sociology); Energy (signal processing); Electric energy; Mathematical optimization; Engineering; Electrical engineering; Computer network; Mathematics; Physics","score_opus":0.0625244726374785,"score_gpt":0.25376819391579636,"score_spread":0.19124372127831785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321460198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028556347,0.00005569987,0.9674378,0.00003274947,0.0008834105,0.00057676644,0.00001214418,0.0024149227,0.000030142406],"genre_scores_gemma":[0.6287313,0.000032713542,0.36956266,0.000028282613,0.0009190149,0.00029597568,0.00010597004,0.0002545168,0.00006955359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815553,0.000060094666,0.0004417041,0.0004169602,0.00020678967,0.0007189409],"domain_scores_gemma":[0.9989145,0.00052262464,0.00008668222,0.00023122269,0.00009355228,0.00015142733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005621747,0.000376487,0.00040637713,0.00048024222,0.00014505167,0.00011653519,0.0002252065,0.0002784453,0.000004298028],"category_scores_gemma":[0.0001446975,0.00040534508,0.00009916975,0.0013485006,0.00001848446,0.00019367595,0.000053467294,0.0004160049,0.0000051664474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041972882,0.000011349332,0.0002339155,0.000062803614,0.00012016249,0.000007180877,0.00020496611,0.9758086,0.0015078542,0.00023820945,0.00025762778,0.021505361],"study_design_scores_gemma":[0.0023708239,0.000090823814,0.00025051905,0.00020404963,0.00003945755,0.000016923403,0.000028344644,0.99207747,0.003968249,0.0000052384103,0.00047733556,0.00047078065],"about_ca_topic_score_codex":0.000026085387,"about_ca_topic_score_gemma":0.0000036240783,"teacher_disagreement_score":0.60017496,"about_ca_system_score_codex":0.000363712,"about_ca_system_score_gemma":0.00006938909,"threshold_uncertainty_score":0.99983984},"labels":[],"label_agreement":null},{"id":"W4323342234","doi":"10.5267/j.ijiec.2022.12.003","title":"Airline operational crew-aircraft planning considering revenue management: A robust optimization model under disruption","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Crew; Crew scheduling; Schedule; Operations research; Cockpit; Scheduling (production processes); Revenue; Operational planning; Flight planning; Computer science; Operations management; Aeronautics; Engineering; Business","score_opus":0.06599283233639251,"score_gpt":0.30826771150392507,"score_spread":0.24227487916753254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019202726,0.000044876375,0.97708535,0.0007434469,0.002270308,0.00014099007,0.00004425115,0.00032959922,0.00013845679],"genre_scores_gemma":[0.56234735,0.00007447959,0.4358965,0.00007148728,0.0011858479,0.00001636208,0.00018330677,0.00009583081,0.00012887694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983153,0.000041932548,0.0007113796,0.00015345881,0.000551576,0.00022639192],"domain_scores_gemma":[0.998917,0.00028011296,0.00018110119,0.00010614394,0.00040736955,0.00010831015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055159134,0.00020136662,0.00022775341,0.00090717094,0.000090972644,0.00017344348,0.00030721514,0.00013442543,0.00002297176],"category_scores_gemma":[0.0003053391,0.00023575076,0.00011212808,0.0006223517,0.000020956866,0.0005026403,0.000066555986,0.0004118575,0.000009874781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013871732,0.000017671775,0.00010660739,0.000012797787,0.00024949427,0.000044450066,0.00018601105,0.9953495,0.00021092202,0.00096924376,0.001692778,0.0011466158],"study_design_scores_gemma":[0.0011134635,0.000017522727,0.0001857977,0.00030038058,0.000041872707,0.00008852483,0.00009587988,0.99733114,0.00008038662,0.00015719362,0.00038373857,0.00020408016],"about_ca_topic_score_codex":0.0000019216116,"about_ca_topic_score_gemma":3.4541554e-7,"teacher_disagreement_score":0.5431446,"about_ca_system_score_codex":0.00025657486,"about_ca_system_score_gemma":0.00007396136,"threshold_uncertainty_score":0.9613637},"labels":[],"label_agreement":null},{"id":"W4323342349","doi":"10.5267/j.ijiec.2023.2.001","title":"General variable neighborhood search for electric vehicle routing problem with time-dependent speeds and soft time windows","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science Fund of the Republic of Serbia; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Vehicle routing problem; Benchmark (surveying); Metaheuristic; Mathematical optimization; Computer science; Electric vehicle; Variable (mathematics); Variable neighborhood search; Set (abstract data type); Routing (electronic design automation); Quality (philosophy); Integer (computer science); Local search (optimization); Operations research; Mathematics; Power (physics)","score_opus":0.020586449861546043,"score_gpt":0.26197481995658256,"score_spread":0.24138837009503653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14647534,0.000038695012,0.851457,0.0004675103,0.00064117665,0.00033849024,0.000034722518,0.00034185624,0.00020519021],"genre_scores_gemma":[0.8503757,0.0000184767,0.14677411,0.000032492124,0.0021879505,0.000022064167,0.00006906227,0.00015327825,0.00036683228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860835,0.00004104916,0.00047417392,0.00014256679,0.00044217613,0.00029168837],"domain_scores_gemma":[0.99866253,0.0005293873,0.00012614288,0.00007310476,0.00048743942,0.00012136928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008345539,0.00017421975,0.0002474948,0.00059371046,0.00007502275,0.00017867135,0.00025734244,0.00011121889,0.000019747038],"category_scores_gemma":[0.0001942425,0.00017510979,0.000060109713,0.00064880383,0.000012721123,0.00027299265,0.000045429995,0.00038935363,0.000013038312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034671135,0.000016753853,0.00031985444,0.000009864841,0.00028009602,0.000012118383,0.0001138458,0.97848856,0.013602635,0.00040500585,0.0003772351,0.006339347],"study_design_scores_gemma":[0.0017900948,0.00012457719,0.00020530439,0.00011719493,0.00004160174,0.00012021216,0.000015140328,0.9954289,0.0016616504,0.00008285662,0.00023470273,0.00017775445],"about_ca_topic_score_codex":0.000004228558,"about_ca_topic_score_gemma":1.1516187e-7,"teacher_disagreement_score":0.7046829,"about_ca_system_score_codex":0.0001787531,"about_ca_system_score_gemma":0.00014695454,"threshold_uncertainty_score":0.714077},"labels":[],"label_agreement":null},{"id":"W4323357131","doi":"10.1287/trsc.2023.1199","title":"Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Computer science; Scalability; Scheduling (production processes); Context (archaeology); Operations research; Heuristic; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Mathematics","score_opus":0.03936776487769003,"score_gpt":0.2945584043615546,"score_spread":0.25519063948386456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323357131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82970554,0.000077261146,0.16872898,0.00009608819,0.00020964291,0.00013959524,0.0000070514598,0.0006458795,0.00038994465],"genre_scores_gemma":[0.9320843,0.00018675222,0.06744657,0.00005816955,0.00004544012,0.000019131738,0.000030012387,0.000021420281,0.00010818066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987878,0.000022731036,0.0002545612,0.00028775612,0.00033242235,0.0003146886],"domain_scores_gemma":[0.99958307,0.000046515746,0.000037766004,0.0001476713,0.00011007425,0.00007492977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973244,0.00010302488,0.00011048116,0.00018280903,0.0002958283,0.00011262663,0.00013502364,0.00005374354,0.000022532668],"category_scores_gemma":[0.000067767134,0.000118409705,0.000019050985,0.0029526216,0.00006959825,0.000867491,0.0000037218738,0.00010626477,0.0000397165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018260982,0.0000046735313,0.0038958145,0.000022846638,0.0000036964873,0.0000018715199,0.0010886632,0.58778405,0.40184775,0.0012625864,0.00006869899,0.004017514],"study_design_scores_gemma":[0.00018690225,0.000011916977,0.024243046,0.0000113881415,0.000007754768,8.758753e-7,0.0000627891,0.90172714,0.07325912,0.00016883647,0.00018298111,0.00013726298],"about_ca_topic_score_codex":0.000022733324,"about_ca_topic_score_gemma":0.00002088689,"teacher_disagreement_score":0.32858863,"about_ca_system_score_codex":0.0000611415,"about_ca_system_score_gemma":0.000060649792,"threshold_uncertainty_score":0.48286077},"labels":[],"label_agreement":null},{"id":"W4360592163","doi":"10.5267/j.dsl.2022.11.004","title":"Design of a hybridization between Tabu search and PAES algorithms to solve a multi-depot, multi-product green vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Metaheuristic; Mathematical optimization; Vehicle routing problem; Pareto principle; Computer science; Genetic algorithm; Algorithm; Heuristic; Routing (electronic design automation); Mathematics","score_opus":0.08550765019336246,"score_gpt":0.34109869896779027,"score_spread":0.25559104877442784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360592163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40942928,0.000010608513,0.5895974,0.00033836128,0.000077455676,0.00033151553,0.000005243622,0.00020820179,0.0000019547397],"genre_scores_gemma":[0.39087427,0.000008224597,0.608933,0.00009263291,0.000039691764,0.000012849724,0.000002503731,0.000029529221,0.0000073578053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974482,0.00009205009,0.00049622107,0.00059483614,0.0008121535,0.0005565316],"domain_scores_gemma":[0.9986684,0.0004985872,0.000063767846,0.00038540384,0.00018585613,0.00019800021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004573907,0.00018495764,0.0002652275,0.00074200385,0.00026673576,0.00015255208,0.0004812255,0.0000454966,0.000003281912],"category_scores_gemma":[0.00078167114,0.00018175898,0.00003365,0.0036043597,0.00018964296,0.0004690496,0.00026511104,0.00017168061,0.000033242282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032970568,0.000005898567,0.005187951,0.0000151272825,0.0000053152776,0.0000038389344,0.0013240062,0.6376889,0.27283758,0.0000021274557,0.000052783475,0.08287321],"study_design_scores_gemma":[0.0003766097,0.000023378372,0.036173183,0.00007473322,0.0000071371214,0.0000028109985,0.00012097682,0.9091057,0.05389862,0.0000106370035,0.000011245497,0.00019494955],"about_ca_topic_score_codex":0.000062771265,"about_ca_topic_score_gemma":0.0000021822148,"teacher_disagreement_score":0.27141684,"about_ca_system_score_codex":0.00008951667,"about_ca_system_score_gemma":0.000042728538,"threshold_uncertainty_score":0.7411916},"labels":[],"label_agreement":null},{"id":"W4361003883","doi":"10.1287/ijoc.2023.1280","title":"Network Migration Problem: A Hybrid Logic-Based Benders Decomposition Approach","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":true,"ca_institutions":"Ciena (Canada); HEC Montréal","funders":"","keywords":"Computer science; Constraint programming; Column generation; Upgrade; Purchasing; Mathematical optimization; Integer programming; Node (physics); Decomposition; Process (computing); Stochastic programming; Engineering; Mathematics; Algorithm; Operations management","score_opus":0.028400209408477067,"score_gpt":0.2788438215552102,"score_spread":0.25044361214673316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361003883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08372898,0.000025141999,0.91063404,0.00019205506,0.0005180903,0.00017420991,0.0000012731275,0.00090771966,0.0038185022],"genre_scores_gemma":[0.6859511,0.0000121979365,0.31307232,0.00038719043,0.00046797836,0.0000036899191,0.00005132769,0.000041123058,0.0000130673825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844617,0.00006671253,0.0005586537,0.000134818,0.00032554485,0.00046809003],"domain_scores_gemma":[0.99927497,0.00018703073,0.00018396095,0.00013532543,0.0000974736,0.00012124662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013702658,0.00019709965,0.00020168432,0.00028978658,0.00037814598,0.00024760174,0.00017975547,0.00007560564,0.000009169062],"category_scores_gemma":[0.00005385453,0.00017854167,0.00010085598,0.0006984225,0.000017111,0.00025029792,0.000028340275,0.00051923713,0.000050372433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107408705,0.00001048901,0.00049014227,0.00003711562,0.000023077393,0.0000103834145,0.00015105153,0.975009,0.00006490582,0.0002473245,0.0027196396,0.021226099],"study_design_scores_gemma":[0.00044447478,0.00006946112,0.0007824272,0.00012789703,0.000009789051,0.00009729726,0.000052007315,0.9965129,0.00023561354,0.0008762515,0.00057803397,0.00021387175],"about_ca_topic_score_codex":0.0000014319721,"about_ca_topic_score_gemma":4.3945425e-7,"teacher_disagreement_score":0.60222214,"about_ca_system_score_codex":0.00016908212,"about_ca_system_score_gemma":0.000038109916,"threshold_uncertainty_score":0.7280718},"labels":[],"label_agreement":null},{"id":"W4361221305","doi":"10.1287/ijoc.2023.1288","title":"Decomposition Strategies for Vehicle Routing Heuristics","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"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":"Heuristics; Merge (version control); Decomposition; Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Local search (optimization); Decomposition method (queueing theory); Heuristic; Mathematics; Algorithm; Discrete mathematics; Information retrieval","score_opus":0.026847903887107456,"score_gpt":0.3186934770919792,"score_spread":0.29184557320487176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361221305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32371154,0.000012001337,0.6727443,0.000060666895,0.00087132177,0.00010541022,0.0000033533083,0.0006979956,0.0017934187],"genre_scores_gemma":[0.9241338,0.000014975774,0.075110406,0.00011289316,0.00054471317,0.0000022139138,0.000012287204,0.000048234728,0.000020527033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987061,0.000025847552,0.0005234725,0.000099900826,0.00021720244,0.00042749767],"domain_scores_gemma":[0.9990448,0.00046642026,0.00013810935,0.00011173474,0.00013579098,0.00010314238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011048045,0.00016111445,0.0001837356,0.00023760014,0.00042206442,0.0004011364,0.00017452906,0.00008007394,0.0000063924163],"category_scores_gemma":[0.00017076432,0.00015381143,0.00009874558,0.00041136114,0.000015351508,0.00032514994,0.00003436244,0.00036183026,0.000047829675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008259266,0.000004470184,0.00024876685,0.00003507109,0.000024407185,0.00000722622,0.00043576027,0.95440704,0.00050875155,0.0018360363,0.0006987797,0.04178541],"study_design_scores_gemma":[0.00046325076,0.00007588133,0.0012610292,0.00012426251,0.0000086958535,0.000051731935,0.00043612358,0.99429274,0.00066359795,0.0014757307,0.0009568757,0.00019010366],"about_ca_topic_score_codex":6.63791e-7,"about_ca_topic_score_gemma":2.6508138e-7,"teacher_disagreement_score":0.6004222,"about_ca_system_score_codex":0.000114157425,"about_ca_system_score_gemma":0.00004308874,"threshold_uncertainty_score":0.6272248},"labels":[],"label_agreement":null},{"id":"W4361247967","doi":"10.1016/j.cie.2023.109215","title":"Optimal distribution of perishable foods with storage temperature control and quality requirements: An integrated vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"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 Toronto","funders":"","keywords":"Truck; Warehouse; Vehicle routing problem; Product (mathematics); Quality (philosophy); Control (management); Heuristic; Routing (electronic design automation); Integer programming; Energy storage; Distribution (mathematics); Operations research; Computer science; Mathematical optimization; Automotive engineering; Engineering; Mathematics; Business; Algorithm","score_opus":0.03291222639858158,"score_gpt":0.2625058560046067,"score_spread":0.2295936296060251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361247967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70756626,0.000026775082,0.29096398,0.000025238729,0.0002757365,0.00028483968,0.00005611635,0.00079132296,0.00000974156],"genre_scores_gemma":[0.97335696,0.0000055151218,0.026170878,0.000005881432,0.00018506576,0.000020113228,0.00018500804,0.000061023544,0.000009523172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984768,0.00011755502,0.00048230952,0.0002924276,0.00023396744,0.00039696493],"domain_scores_gemma":[0.99926716,0.00014570465,0.000094133626,0.00023790606,0.00011124496,0.00014382746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095010526,0.00027022703,0.00040502008,0.00013125442,0.000088190485,0.00011506639,0.00017110766,0.00022524611,0.0000028053462],"category_scores_gemma":[0.00012687863,0.00027088012,0.000042099793,0.0008753737,0.000036972924,0.00037761024,0.000051120627,0.00046305475,8.6033515e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042490123,0.00001353277,0.0012465153,0.00007234838,0.00008440792,0.0000043815207,0.0002808799,0.98075855,0.01455498,0.00011483494,0.00007314845,0.0027539174],"study_design_scores_gemma":[0.0021495852,0.00017025997,0.002974843,0.00024779444,0.000029365001,0.0000046226946,0.00017089937,0.9913432,0.0023909416,0.0000010921442,0.00020294066,0.00031445842],"about_ca_topic_score_codex":0.000032194883,"about_ca_topic_score_gemma":0.0000011834774,"teacher_disagreement_score":0.26579073,"about_ca_system_score_codex":0.00014171994,"about_ca_system_score_gemma":0.000041646148,"threshold_uncertainty_score":0.9999743},"labels":[],"label_agreement":null},{"id":"W4361267542","doi":"10.48550/arxiv.2303.15573","title":"On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National d’Etudes Spatiales","keywords":"Linear programming; Integer programming; Decomposition; Mathematical optimization; Mathematics; Integer (computer science); Branch and price; Space (punctuation); Dual (grammatical number); Geometric programming; Computer science","score_opus":0.09003054661395556,"score_gpt":0.21807598194548547,"score_spread":0.1280454353315299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361267542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17854644,0.00001385999,0.81924754,0.000068083034,0.00031166748,0.00017243405,0.000059262737,0.000279343,0.0013013807],"genre_scores_gemma":[0.99380875,0.00017469833,0.005467976,0.000018717117,0.000033276476,0.0000026786533,0.00009142561,0.000032887565,0.00036960735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924606,0.00012259214,0.00018014763,0.0002652877,0.000062640385,0.00012329085],"domain_scores_gemma":[0.99900466,0.00041371258,0.00008852874,0.0003234381,0.000120055745,0.000049592934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023520652,0.00016735127,0.00016291518,0.00023174191,0.00016127333,0.000029202385,0.00019466977,0.00015366996,0.000050160434],"category_scores_gemma":[0.00009152053,0.00016796181,0.00007732298,0.0004873883,0.000083139865,0.00008183597,0.00015500814,0.00034223613,0.000016113649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004887169,0.000017103095,0.0004764489,0.000033451295,0.00006294968,0.0000027000322,0.00011894886,0.94708365,0.00045846438,0.051444102,0.00018488818,0.00011241549],"study_design_scores_gemma":[0.00010455833,0.0000124359885,0.003265689,0.00009835209,0.00006630019,0.0000018054487,0.00007462746,0.9791629,0.001051823,0.015982462,0.00002073779,0.00015832632],"about_ca_topic_score_codex":0.000060831764,"about_ca_topic_score_gemma":0.000048539205,"teacher_disagreement_score":0.81526226,"about_ca_system_score_codex":0.00010252731,"about_ca_system_score_gemma":0.000032585394,"threshold_uncertainty_score":0.6849284},"labels":[],"label_agreement":null},{"id":"W4362665816","doi":"10.1002/net.22147","title":"The probabilistic uncapacitated open vehicle routing location problem","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Heuristics; Computer science; Service (business); Probabilistic logic; Simple (philosophy); Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Tree (set theory); Computer network; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.02512845140514344,"score_gpt":0.27067178824854166,"score_spread":0.2455433368433982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362665816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03363268,0.00043932436,0.9263089,0.0011077553,0.0016814836,0.002429142,0.0000037071932,0.005047913,0.029349146],"genre_scores_gemma":[0.9887626,0.00006652991,0.009953896,0.000044996283,0.00017447537,0.00013778868,0.00002881507,0.00006840906,0.00076244987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989081,0.00013519579,0.00027552457,0.00017152575,0.00012869843,0.00038095785],"domain_scores_gemma":[0.9990841,0.00041566486,0.00004811738,0.0002949154,0.000102180406,0.00005499809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014397119,0.00012014146,0.00011477223,0.00003299955,0.00034472707,0.000284176,0.00040808553,0.00008763368,0.000009418676],"category_scores_gemma":[0.00021253864,0.0000988595,0.000022615528,0.00132075,0.00003953085,0.00014205978,0.000119701355,0.00023421054,0.00007061017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033756046,0.00000308443,0.0003051187,0.000013446509,0.000014745688,8.432646e-7,0.00015869392,0.969932,0.000037058384,0.0017733423,0.0038660823,0.023892166],"study_design_scores_gemma":[0.00017299366,0.000010056884,0.0015101088,0.000046701534,0.000008242191,0.0000012724372,0.000071642826,0.99525034,0.000027638362,0.00095474184,0.0018211515,0.00012509945],"about_ca_topic_score_codex":0.000013051685,"about_ca_topic_score_gemma":0.000021292306,"teacher_disagreement_score":0.95513,"about_ca_system_score_codex":0.00008081628,"about_ca_system_score_gemma":0.000022401502,"threshold_uncertainty_score":0.40313733},"labels":[],"label_agreement":null},{"id":"W4366813960","doi":"10.1016/j.ejor.2023.04.016","title":"Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Heuristics; Bottleneck; Computer science; Mathematical optimization; Truck; Context (archaeology); Operations research; Shortest path problem; Simulated annealing; Mathematics; Theoretical computer science; Graph; Engineering","score_opus":0.1523891100965274,"score_gpt":0.3881574141298987,"score_spread":0.2357683040333713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366813960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28186813,0.0002407446,0.6560927,0.0034539194,0.0006789002,0.0017347619,0.00009629726,0.0009605095,0.054874014],"genre_scores_gemma":[0.6500728,0.00006389985,0.34857187,0.000022171791,0.00018980463,0.0000057670322,0.000012038276,0.00008333159,0.0009783107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597394,0.0012946536,0.0007984273,0.00024528187,0.0011445095,0.00054319156],"domain_scores_gemma":[0.997997,0.0003783317,0.0001244919,0.00022246553,0.0010097516,0.0002679795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0087409895,0.00019009228,0.00027200536,0.00077275623,0.0004301161,0.00037587955,0.00041215506,0.000024239725,0.0003896711],"category_scores_gemma":[0.0006377687,0.00016478245,0.00007554143,0.001047398,0.00020370065,0.0003260525,0.00011727859,0.0008571065,0.00016374944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009034594,0.00011392794,0.006619207,0.00011586799,0.00023383209,0.0013399798,0.0023815362,0.9063303,0.06783058,0.0005206637,0.0044847713,0.009939009],"study_design_scores_gemma":[0.003535887,0.00037066158,0.07960312,0.00054011244,0.000020188512,0.00046527304,0.0010384425,0.9088602,0.0021610835,0.0000071126756,0.0029945292,0.00040339128],"about_ca_topic_score_codex":0.000004870917,"about_ca_topic_score_gemma":0.000014537635,"teacher_disagreement_score":0.36820465,"about_ca_system_score_codex":0.0002608817,"about_ca_system_score_gemma":0.00023786948,"threshold_uncertainty_score":0.67196333},"labels":[],"label_agreement":null},{"id":"W4367396193","doi":"10.1016/j.dib.2023.109189","title":"Real operational data for the concrete delivery problem","year":2023,"lang":"en","type":"article","venue":"Data in Brief","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Sherbrooke","funders":"Mitacs","keywords":"Benchmarking; Raw data; Computer science; Data mining; Production (economics); Operations research; Database; Engineering","score_opus":0.0870573047467152,"score_gpt":0.330298184589255,"score_spread":0.24324087984253978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367396193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03506917,0.0006656949,0.90358955,0.005953424,0.0020548054,0.0033780509,0.04162412,0.0027175045,0.0049476596],"genre_scores_gemma":[0.03480791,0.0015929017,0.86420506,0.0005545502,0.00086248305,0.00020044307,0.09702465,0.00015904888,0.0005929746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925435,0.0000381832,0.00018800527,0.00023709411,0.0001143475,0.00016803716],"domain_scores_gemma":[0.9980705,0.00056504534,0.000016081076,0.0012997311,0.00002649376,0.000022177745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013085698,0.00007121241,0.000083995874,0.000039596427,0.00007245924,0.000071246635,0.0010716413,0.00004077121,0.00002749651],"category_scores_gemma":[0.00030579144,0.000062076215,0.000007659577,0.00027321358,0.000024128474,0.00038683432,0.0005320863,0.00009361051,0.000025940553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015292988,0.0000033162398,0.0011886306,0.0000916439,0.0000674085,0.000005814125,0.00020043741,0.5670701,0.0011178881,0.0025742278,0.4102207,0.017444506],"study_design_scores_gemma":[0.00022421389,0.0000033402212,0.0014337437,0.000010989677,0.00000769676,0.0000015470781,0.000023895247,0.9012343,0.000037067093,0.000028473156,0.09692087,0.0000738193],"about_ca_topic_score_codex":0.00016114106,"about_ca_topic_score_gemma":0.00004516996,"teacher_disagreement_score":0.33416423,"about_ca_system_score_codex":0.000018847271,"about_ca_system_score_gemma":0.0000369423,"threshold_uncertainty_score":0.25313947},"labels":[],"label_agreement":null},{"id":"W4376456745","doi":"10.1109/tits.2023.3271430","title":"Logistics in the Sky: A Two-Phase Optimization Approach for the Drone Package Pickup and Delivery System","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"University of Alberta","funders":"China Scholarship Council; Natural Science Foundation for Distinguished Young Scholars of Hunan Province; National Natural Science Foundation of China","keywords":"Drone; Notation; Pickup; Simulated annealing; Computer science; Mathematics; Algorithm; Artificial intelligence; Arithmetic","score_opus":0.05128302992592292,"score_gpt":0.2945357512435078,"score_spread":0.24325272131758485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376456745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004328046,0.00017477905,0.99210733,0.000041650634,0.00084767415,0.0016903088,0.00022489604,0.0004995651,0.00008576821],"genre_scores_gemma":[0.98643154,0.00032102535,0.01194497,0.0000223433,0.00006742151,0.0009549907,0.00012964397,0.00006269846,0.000065378095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983065,0.00017499868,0.0006624263,0.00027579223,0.00030201388,0.00027826065],"domain_scores_gemma":[0.99867314,0.00077071914,0.000083091625,0.00031456706,0.00010412149,0.000054379692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116429,0.00023425386,0.00024968476,0.00027305636,0.00027426728,0.00011981335,0.0002033929,0.000120046396,0.0000045883194],"category_scores_gemma":[0.000008301031,0.00017494726,0.00009793616,0.0008698877,0.0000580528,0.00012550609,2.62772e-7,0.00024264703,0.000006651969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039887815,0.00006807096,0.000014655159,0.00037113027,0.00006375484,0.0000033770814,0.0026383812,0.9934831,0.000087381915,0.00051751814,0.000044288277,0.002668415],"study_design_scores_gemma":[0.00088899647,0.000059331192,0.000038796694,0.00008116104,0.00011612695,0.000008401028,0.00737922,0.99047685,0.0006591704,0.0000030572705,0.00010756598,0.00018131956],"about_ca_topic_score_codex":0.00009150817,"about_ca_topic_score_gemma":0.00004729856,"teacher_disagreement_score":0.98210347,"about_ca_system_score_codex":0.00011434741,"about_ca_system_score_gemma":0.000021534648,"threshold_uncertainty_score":0.71341425},"labels":[],"label_agreement":null},{"id":"W4376564152","doi":"10.1111/tgis.13057","title":"Trailer allocation and truck routing using bipartite graph assignment and deep reinforcement learning","year":2023,"lang":"en","type":"article","venue":"Transactions in GIS","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Northern Digital (Canada); National Research Council Canada; University of Calgary","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; Bipartite graph; Trailer; Computer science; Routing (electronic design automation); Heuristics; Vehicle routing problem; Graph; Mathematical optimization; Transport engineering; Operations research; Engineering; Computer network; Mathematics; Automotive engineering; Theoretical computer science","score_opus":0.027206449989939884,"score_gpt":0.2731889428976228,"score_spread":0.24598249290768293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376564152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22392412,0.00006230826,0.77533495,0.00004552756,0.00008467981,0.00011387491,4.4501147e-7,0.00025625262,0.00017783741],"genre_scores_gemma":[0.97803426,0.00032900338,0.021463213,0.000008349105,0.0000138407995,0.000021319624,0.000004679297,0.000028280381,0.00009705455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923533,0.000056592067,0.00024280458,0.00015309252,0.000107412445,0.00020475124],"domain_scores_gemma":[0.9997535,0.00007591189,0.00002590675,0.00008165522,0.000013956771,0.00004910238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040223097,0.00010768524,0.00011521651,0.0002578609,0.00014424948,0.000041970015,0.000030765706,0.00006310814,0.000049918515],"category_scores_gemma":[0.000016923905,0.00012754703,0.00002096948,0.0005504606,0.00002773992,0.00016433222,0.000004332522,0.00017841627,0.0000029198586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002156811,0.000003257022,0.0012974786,0.000030843545,0.000016578035,9.129123e-7,0.0017163655,0.97116977,0.0037420758,0.00003623604,9.498521e-7,0.02198338],"study_design_scores_gemma":[0.0003035272,0.0000126002715,0.0046643508,0.00004861103,0.000020557572,0.000005075338,0.00050540635,0.9929791,0.0011937906,0.000029752517,0.00010647077,0.00013075859],"about_ca_topic_score_codex":0.000035560315,"about_ca_topic_score_gemma":0.000024451037,"teacher_disagreement_score":0.75411016,"about_ca_system_score_codex":0.00007093771,"about_ca_system_score_gemma":0.000006873402,"threshold_uncertainty_score":0.5201217},"labels":[],"label_agreement":null},{"id":"W4377030783","doi":"10.1016/j.cor.2023.106282","title":"The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"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; Université de Montréal; Università degli studi di Bergamo; Université du Québec à Montréal","keywords":"Transshipment (information security); Computer science; Context (archaeology); Operations research; Service (business); Port (circuit theory); Flow network; Supply chain; Heuristic; Service provider; Truck; Flexibility (engineering); Mathematical optimization; Business; Mathematics; Computer security","score_opus":0.10521001024260995,"score_gpt":0.37416070598910345,"score_spread":0.2689506957464935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377030783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06853439,0.00018210549,0.92710316,0.0020991988,0.00016287838,0.0010361559,0.000009085121,0.00081115455,0.0000619031],"genre_scores_gemma":[0.5092865,0.0001745481,0.48958886,0.00004302855,0.00008362152,0.0004181864,0.00011623937,0.00007515517,0.00021383462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997569,0.0006390585,0.00033586667,0.00033444818,0.00052213663,0.0005994771],"domain_scores_gemma":[0.99799037,0.0005682578,0.0000149009165,0.00057381677,0.000716919,0.00013571105],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002158787,0.0001890429,0.00017017403,0.00028519347,0.0013985562,0.00055484846,0.0006070143,0.00009580435,0.00001104398],"category_scores_gemma":[0.00012030872,0.00014832622,0.000034076802,0.0027050504,0.000148125,0.00028940712,0.00011636647,0.0005717127,0.000228327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009218568,0.000050369224,0.0001853854,0.00008364825,0.00005102498,0.0000025554348,0.0010643569,0.98674184,0.0011971435,0.00046445295,0.00027194156,0.009878049],"study_design_scores_gemma":[0.0010229265,0.00003441138,0.0028223163,0.00008727446,0.0000071006716,0.000003283403,0.0003407075,0.9936179,0.0011696186,0.000012403867,0.00070348603,0.00017860864],"about_ca_topic_score_codex":0.00010893267,"about_ca_topic_score_gemma":0.0011755879,"teacher_disagreement_score":0.44075212,"about_ca_system_score_codex":0.00022125138,"about_ca_system_score_gemma":0.00017162526,"threshold_uncertainty_score":0.9999015},"labels":[],"label_agreement":null},{"id":"W4377157592","doi":"10.1155/2023/8390619","title":"Improved Ant Colony Optimization for the Operational Aircraft Maintenance Routing Problem with Cruise Speed Control","year":2023,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Macau University of Science and Technology","keywords":"Cruise; Ant colony optimization algorithms; Vehicle routing problem; Computer science; Routing (electronic design automation); Cruise control; Operations research; Preprocessor; Control (management); Mathematical optimization; Engineering; Aerospace engineering; Artificial intelligence; Mathematics","score_opus":0.00921352009571012,"score_gpt":0.24818142244670333,"score_spread":0.23896790235099322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377157592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041183986,0.00006089277,0.9569845,0.00063622365,0.00030181542,0.0006591447,0.000032144373,0.00012622098,0.000015047562],"genre_scores_gemma":[0.6405403,0.00010004026,0.35901248,0.00006136496,0.00013067608,0.000030445473,0.000044430315,0.00004435275,0.000035902627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988051,0.000030858795,0.00059171184,0.00011857895,0.00023074007,0.0002230188],"domain_scores_gemma":[0.99865496,0.00033185774,0.00029168764,0.00009457201,0.0005718236,0.00005508933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065524067,0.00014562465,0.0002220405,0.00010839005,0.00015111837,0.00004440903,0.00012338276,0.00005477804,0.000009945159],"category_scores_gemma":[0.00009694995,0.00010437045,0.000083307474,0.00042310706,0.000028695093,0.00045670656,0.0000010775607,0.00017226298,6.239335e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025590326,0.000011993868,0.0005051416,0.000045105793,0.00006440995,0.000004672687,0.0006088558,0.9892221,0.006797769,0.00014310454,0.00006919623,0.002271764],"study_design_scores_gemma":[0.0031361047,0.00015943892,0.010205174,0.00010291625,0.000094907096,0.000010327732,0.0003820852,0.98443246,0.001037015,0.000053945892,0.00024649058,0.00013913093],"about_ca_topic_score_codex":0.000001729847,"about_ca_topic_score_gemma":0.000012763968,"teacher_disagreement_score":0.5993563,"about_ca_system_score_codex":0.00007765574,"about_ca_system_score_gemma":0.00007317198,"threshold_uncertainty_score":0.42561033},"labels":[],"label_agreement":null},{"id":"W4377249550","doi":"10.1007/978-3-031-33271-5_13","title":"Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"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":"Crossover; Computer science; Vehicle routing problem; Heuristic; Local search (optimization); Greedy algorithm; Task (project management); Artificial intelligence; Machine learning; Graph; Mathematical optimization; Routing (electronic design automation); Theoretical computer science; Algorithm; Mathematics","score_opus":0.025084770520473625,"score_gpt":0.2802680108674099,"score_spread":0.25518324034693624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377249550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016356984,0.00019977255,0.99651694,0.000079813966,0.0007937799,0.00034608395,0.000006076551,0.0002090663,0.00021275958],"genre_scores_gemma":[0.8221972,0.00003453956,0.1766443,0.00028044567,0.00040473812,0.000013165733,0.00000824377,0.00012495431,0.00029240994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807143,0.000023545814,0.0003453958,0.00062561856,0.0003229562,0.00061107805],"domain_scores_gemma":[0.9987413,0.00072155497,0.000040484916,0.00031897388,0.00007896924,0.00009871658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009905583,0.000295492,0.00034567906,0.00039890327,0.00011919763,0.00026643704,0.00042744906,0.00030974104,0.0000048900297],"category_scores_gemma":[0.000092240574,0.00029717482,0.00005506791,0.00049704796,0.00034323116,0.0001676299,0.00031392003,0.000712096,0.0000024250019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006895007,0.0000023950215,0.00029408812,0.00003850909,0.000003492261,0.000011160415,0.00023998035,0.82883,0.000012531988,0.0003243149,0.000003201522,0.17023344],"study_design_scores_gemma":[0.00038662972,0.000044313245,0.00065989664,0.00017273036,0.0000035822532,0.000009727913,4.3548883e-7,0.9955424,0.000107485466,0.0027399324,0.00002136891,0.00031146107],"about_ca_topic_score_codex":0.000019600802,"about_ca_topic_score_gemma":0.000076104945,"teacher_disagreement_score":0.8205615,"about_ca_system_score_codex":0.00021397583,"about_ca_system_score_gemma":0.00007199277,"threshold_uncertainty_score":0.999948},"labels":[],"label_agreement":null},{"id":"W4379644131","doi":"10.1016/j.cor.2023.106246","title":"Heterogeneous instant delivery orders scheduling and routing problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"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":"National Natural Science Foundation of China","keywords":"Instant; Computer science; Mathematical optimization; Column generation; Scheduling (production processes); Job shop scheduling; Integer programming; Vehicle routing problem; Heuristic; Routing (electronic design automation); Algorithm; Mathematics; Computer network","score_opus":0.0665305166915655,"score_gpt":0.3491616430742612,"score_spread":0.28263112638269566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379644131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65359384,0.00016980866,0.34404588,0.00030344428,0.0001467861,0.0003723637,0.0000042897946,0.0007763301,0.0005872315],"genre_scores_gemma":[0.7827651,0.00018523794,0.21679842,0.000024953682,0.000060446644,0.000037271984,0.000020539324,0.00004314279,0.000064917236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845153,0.00022592966,0.00025485773,0.000274904,0.00031314674,0.00047965502],"domain_scores_gemma":[0.9991585,0.00025412487,0.000006854953,0.00023472439,0.00022371327,0.00012207426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013010076,0.00012404396,0.00013626291,0.00045396242,0.00058088056,0.0003579767,0.00019929522,0.000074581265,0.000012989354],"category_scores_gemma":[0.0001200778,0.00013597439,0.000026895294,0.0013023516,0.00008151685,0.00019502241,0.00022713804,0.00036493177,0.00007328663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017260429,0.000006249894,0.00015130358,0.000034009874,0.000023016508,0.000012906056,0.00063080544,0.981333,0.0026655735,0.000666975,0.00015431656,0.014320102],"study_design_scores_gemma":[0.00020813587,0.000026303824,0.00014069445,0.000055855722,0.0000026284713,0.00001334668,0.00018163922,0.9977626,0.00091500883,0.000030019552,0.00052443054,0.00013934099],"about_ca_topic_score_codex":0.00004461106,"about_ca_topic_score_gemma":0.000029458319,"teacher_disagreement_score":0.12917121,"about_ca_system_score_codex":0.00010195563,"about_ca_system_score_gemma":0.000080644575,"threshold_uncertainty_score":0.55448747},"labels":[],"label_agreement":null},{"id":"W4380086371","doi":"10.1051/ro/2023083","title":"A robust optimization approach for the production-routing problem with lateral transshipment and outsourcing","year":2023,"lang":"en","type":"article","venue":"RAIRO. Operations research","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":"Concordia University","funders":"","keywords":"Simulated annealing; Mathematical optimization; Transshipment (information security); Computer science; Outsourcing; Solver; Integer programming; Routing (electronic design automation); Production (economics); Vehicle routing problem; Linear programming; Operations research; Algorithm; Mathematics; Economics; Business; Microeconomics","score_opus":0.11166082914835454,"score_gpt":0.33306997018856654,"score_spread":0.221409141040212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380086371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102500655,0.00006142668,0.9853122,0.0016669763,0.000056051565,0.001771694,0.000007765448,0.00040284113,0.00047093452],"genre_scores_gemma":[0.38989896,0.0000821085,0.60711503,0.0000100705465,0.00016130775,0.0010500647,0.00007097395,0.00007044138,0.0015410713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985168,0.00017636505,0.00023276465,0.00030999357,0.00034424738,0.00041980675],"domain_scores_gemma":[0.9991091,0.00028580695,0.000010257742,0.00024654897,0.00028441515,0.000063909036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025709774,0.00013103944,0.00012328202,0.00024066551,0.0011112649,0.00033096306,0.00014640568,0.00006387427,0.000014249642],"category_scores_gemma":[0.0002494541,0.000095498806,0.000024450575,0.001177589,0.000091739545,0.00023373686,0.000037926187,0.00029968756,0.0000028089985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010784397,0.000013884741,0.00018876133,0.00008913768,0.00003658095,3.3479262e-7,0.0027534477,0.99428284,0.00049437734,0.00027946365,0.00021055617,0.0016398169],"study_design_scores_gemma":[0.0002776806,0.000038317547,0.0002502913,0.00003858908,0.00001304602,0.000008541432,0.0010623747,0.9976444,0.00045893757,0.0000039000347,0.00007973517,0.00012416413],"about_ca_topic_score_codex":0.000024317202,"about_ca_topic_score_gemma":0.000027940036,"teacher_disagreement_score":0.37964886,"about_ca_system_score_codex":0.000083749175,"about_ca_system_score_gemma":0.000055752404,"threshold_uncertainty_score":0.85470635},"labels":[],"label_agreement":null},{"id":"W4380741948","doi":"10.1016/j.ejor.2023.05.038","title":"Fifty years of operational research: 1972–2022","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"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":"HEC Montréal; Canada Research Chairs","keywords":"Medal; Operations research; Ceremony; Vehicle routing problem; Gold medal; Routing (electronic design automation); Work (physics); Presentation (obstetrics); Engineering management; Computer science; Seriation (archaeology); Operations management; Engineering; History; Computer network","score_opus":0.21609100974847759,"score_gpt":0.43141629121043973,"score_spread":0.21532528146196214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380741948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433625,0.0007490151,0.014940215,0.003012891,0.0009356153,0.00045865975,0.00007742746,0.0001430434,0.03632063],"genre_scores_gemma":[0.9716316,0.00047397873,0.024542052,0.00003442347,0.0008147231,0.0000049485766,0.00003585223,0.00008896837,0.0023734658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929827,0.0030357526,0.0007780364,0.00017835718,0.0025703984,0.00045477328],"domain_scores_gemma":[0.9958109,0.0013536396,0.00006354701,0.00025166906,0.0023181052,0.00020212399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026448013,0.000105926374,0.00020827493,0.0011941683,0.00027119138,0.00017155311,0.000646181,0.000041499923,0.0007186545],"category_scores_gemma":[0.00396868,0.000107559346,0.00009189303,0.001991104,0.00021510648,0.00035374783,0.00020613916,0.0012072404,0.00046055234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075061835,0.00007537558,0.00074707007,0.0000600004,0.00011092902,0.00035520206,0.0015632539,0.8361855,0.04954631,0.0051937,0.0914285,0.014659068],"study_design_scores_gemma":[0.0039155795,0.0015743435,0.17812864,0.0006342117,0.000023102535,0.0003718857,0.0020597116,0.57709134,0.019367779,0.0012149595,0.21482268,0.00079575094],"about_ca_topic_score_codex":0.0000037457405,"about_ca_topic_score_gemma":0.0000011932638,"teacher_disagreement_score":0.25909418,"about_ca_system_score_codex":0.00013958913,"about_ca_system_score_gemma":0.00038428762,"threshold_uncertainty_score":0.91664064},"labels":[],"label_agreement":null},{"id":"W4380882365","doi":"10.1287/trsc.2022.0112","title":"Hub Network Design Problem with Capacity, Congestion, and Stochastic Demand Considerations","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Column generation; Mathematical optimization; Computer science; Routing (electronic design automation); Exploit; Network planning and design; Operations research; Engineering; Mathematics; Computer network","score_opus":0.043050717474767894,"score_gpt":0.2641178654701955,"score_spread":0.2210671479954276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380882365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12989047,0.000016193282,0.86910886,0.00011071186,0.00006356606,0.00024922387,0.0000049356668,0.0004626605,0.00009336956],"genre_scores_gemma":[0.7476354,0.000007503603,0.25226268,0.000023018418,0.000013514685,0.000025963986,0.0000052838936,0.000011586778,0.000015006976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991127,0.000030429872,0.00018166314,0.00019974222,0.00024385852,0.00023156691],"domain_scores_gemma":[0.9994095,0.00021926747,0.000031930227,0.000100946585,0.00014565398,0.000092722825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009124646,0.000093636205,0.00009564178,0.00012136044,0.00030703304,0.00008834074,0.00006081256,0.000030180781,0.000015821615],"category_scores_gemma":[0.000051341325,0.000089223126,0.000007517337,0.0011744829,0.00027323197,0.00033694055,0.000001989437,0.00007659585,0.000008558522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001983444,0.0000018719768,0.0011028451,0.00001690028,0.0000032697233,0.0000018502092,0.0009796154,0.9932308,0.0010234148,0.0034078849,0.000078259036,0.0001512952],"study_design_scores_gemma":[0.0003539031,0.00003962128,0.09124678,0.000061489445,0.000028406925,0.000011769215,0.000091277354,0.9024377,0.00082767,0.0046734563,0.000010716983,0.00021720897],"about_ca_topic_score_codex":0.0000049309037,"about_ca_topic_score_gemma":0.000039508363,"teacher_disagreement_score":0.617745,"about_ca_system_score_codex":0.000018365805,"about_ca_system_score_gemma":0.00007032459,"threshold_uncertainty_score":0.36384135},"labels":[],"label_agreement":null},{"id":"W4381740798","doi":"10.5267/j.ijiec.2023.3.002","title":"A new matheheuristic approach based on Chu-Beasley genetic approach for the multi-depot electric vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genetic algorithm; Routing (electronic design automation); Vehicle routing problem; Electric vehicle; Mathematical optimization; Sensitivity (control systems); Range (aeronautics); Electric power; Computer science; Power (physics); Operations research; Engineering; Reliability engineering; Computer network; Mathematics; Electronic engineering","score_opus":0.04788489507255627,"score_gpt":0.28168451647574455,"score_spread":0.23379962140318827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381740798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032704677,0.000055338834,0.9942823,0.00049172284,0.0011094331,0.00040625254,0.00001485625,0.00029618226,0.00007345098],"genre_scores_gemma":[0.44931275,0.000009016366,0.54938483,0.00003434532,0.0010966142,0.000033690674,0.00002500131,0.00007380481,0.000029937224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983407,0.000048450842,0.0006366347,0.00016809993,0.0005116522,0.00029445568],"domain_scores_gemma":[0.9982143,0.0009333966,0.00020919034,0.00014248719,0.00037927326,0.00012136241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007582684,0.00021494606,0.00023508104,0.0005839866,0.000099603436,0.00017565578,0.00057151605,0.00012491438,0.0000045750644],"category_scores_gemma":[0.0009208886,0.00018863115,0.00018538052,0.0008515125,0.000011046304,0.00010367942,0.000031040938,0.0005267477,0.0000048348975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023248642,0.000043411947,0.00008098991,0.000014707923,0.00018100449,0.0000046345435,0.00015159896,0.98239744,0.0004201984,0.00019121438,0.0011563593,0.015335168],"study_design_scores_gemma":[0.0019465857,0.000060711864,0.0005447054,0.00007355572,0.000056623583,0.000037476148,0.00004391007,0.996443,0.00020454668,0.0000310046,0.00038240303,0.0001754955],"about_ca_topic_score_codex":0.0000060262523,"about_ca_topic_score_gemma":1.1292244e-7,"teacher_disagreement_score":0.4460423,"about_ca_system_score_codex":0.00020963987,"about_ca_system_score_gemma":0.00017177076,"threshold_uncertainty_score":0.7692155},"labels":[],"label_agreement":null},{"id":"W4382866766","doi":"10.1609/socs.v16i1.27296","title":"Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Heuristic; Computer science; Front and back ends; Front (military); Task (project management); Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Systems engineering","score_opus":0.02638776788821962,"score_gpt":0.28570968329370366,"score_spread":0.25932191540548405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808162,0.000013088492,0.00043557023,0.0024341582,0.003696258,0.0004975485,0.000024416862,0.00022010479,0.011862691],"genre_scores_gemma":[0.99626946,0.000030820305,0.002482131,0.000051235533,0.00037149395,0.00004347051,0.0000057299776,0.00005451014,0.00069113134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977455,0.000036732716,0.00040761146,0.00034766996,0.0010695427,0.00039294414],"domain_scores_gemma":[0.99899125,0.00029035204,0.000043980395,0.000117293275,0.00038857266,0.00016852227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016191152,0.00019394982,0.00026975712,0.00044692468,0.00011914669,0.00014739792,0.0007111633,0.000099952435,0.00004361844],"category_scores_gemma":[0.0004503546,0.00018880796,0.0000600788,0.00050067925,0.000063776795,0.00013323469,0.00053781917,0.0004433323,0.00010102608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006754184,0.0003049567,0.17762432,0.00032110183,0.000252469,0.000005367095,0.0049973032,0.6537867,0.11665661,0.027728137,0.014161415,0.0034862102],"study_design_scores_gemma":[0.0025538537,0.0002513354,0.14282367,0.000625716,0.00002332984,0.00001261971,0.0004622067,0.74243855,0.10091705,0.0027665528,0.0064260704,0.0006990339],"about_ca_topic_score_codex":0.0002595226,"about_ca_topic_score_gemma":0.000018338786,"teacher_disagreement_score":0.08865187,"about_ca_system_score_codex":0.0004842031,"about_ca_system_score_gemma":0.000036077916,"threshold_uncertainty_score":0.7699365},"labels":[],"label_agreement":null},{"id":"W4382866847","doi":"10.1609/icaps.v33i1.27201","title":"Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Travelling salesman problem; Mathematical optimization; Heuristic; Domain (mathematical analysis); Computer science; Constraint programming; Dynamic programming; Constraint satisfaction problem; Mathematics; Stochastic programming; Artificial intelligence","score_opus":0.029136682222907113,"score_gpt":0.28917392073227355,"score_spread":0.26003723850936644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916792,0.000032148477,0.0035764906,0.0003504037,0.00017045115,0.00022293442,0.0000060585658,0.001505991,0.0024563458],"genre_scores_gemma":[0.9597281,0.000014498381,0.04006394,0.000012721333,0.000022299597,0.000020602183,0.000007951144,0.000036608588,0.00009325466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986985,0.000010819125,0.00027599154,0.00024402855,0.00048806315,0.00028263376],"domain_scores_gemma":[0.99940604,0.00008009521,0.00010966321,0.00007112973,0.0002708674,0.00006221359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664034,0.0001778542,0.0001761263,0.00023094547,0.0001581351,0.00023616108,0.000368849,0.00007883961,0.000008613083],"category_scores_gemma":[0.00011043735,0.00013850706,0.000032491767,0.00040235906,0.000062500854,0.000148462,0.00010831054,0.00033850464,0.00000577233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045687113,0.000023777302,0.022075828,0.00033021977,0.00017348048,0.0000063475118,0.002896147,0.9209042,0.047721665,0.0031351272,0.000042215757,0.0026452746],"study_design_scores_gemma":[0.00029093502,0.000041546373,0.005430016,0.0011549172,0.000012080196,0.000028325743,0.0011531124,0.9888298,0.0026250307,0.00025260233,0.000017314253,0.00016432624],"about_ca_topic_score_codex":0.0000053984186,"about_ca_topic_score_gemma":5.9213596e-7,"teacher_disagreement_score":0.067925565,"about_ca_system_score_codex":0.00006676124,"about_ca_system_score_gemma":0.00003394063,"threshold_uncertainty_score":0.56481546},"labels":[],"label_agreement":null},{"id":"W4382930395","doi":"10.1016/j.orl.2023.06.006","title":"Unconstrained traveling tournament problem is APX-complete","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Hamiltonian path; Combinatorics; Complete graph; Mathematics; Travelling salesman problem; APX; Graph; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.09799900504041466,"score_gpt":0.3645096889024662,"score_spread":0.26651068386205157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382930395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5316176,0.00007671212,0.41132084,0.044970363,0.00045228595,0.0014850146,0.000099981466,0.001834789,0.008142457],"genre_scores_gemma":[0.7157285,0.00016231381,0.28011653,0.0012445663,0.0003942128,0.0003799116,0.0001398115,0.0001469018,0.0016872452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998109,0.00023090317,0.0002981581,0.0002417622,0.0005367767,0.0005834287],"domain_scores_gemma":[0.99924767,0.00016696428,0.0000070313536,0.00029792587,0.00014946633,0.00013094919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730694,0.00012856667,0.00013338005,0.00038342047,0.00046478008,0.00030148527,0.0002477888,0.000054091222,0.00028152947],"category_scores_gemma":[0.00013282482,0.00013434922,0.000050973464,0.0014224023,0.00008851163,0.00018918593,0.000058897822,0.0004455558,0.0005710966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011576907,0.0000058945097,0.00004504759,0.000023040457,0.000027128575,0.000010546701,0.0010494232,0.85077655,0.12584805,0.00022580725,0.017050147,0.0049371966],"study_design_scores_gemma":[0.00026710646,0.000015703363,0.00015319085,0.00003831655,0.0000036939152,0.000005716967,0.0003188698,0.9856899,0.0049183425,0.000036957284,0.008384718,0.00016750298],"about_ca_topic_score_codex":0.00004127171,"about_ca_topic_score_gemma":0.000015292879,"teacher_disagreement_score":0.18411095,"about_ca_system_score_codex":0.00018092325,"about_ca_system_score_gemma":0.000055454693,"threshold_uncertainty_score":0.73404825},"labels":[],"label_agreement":null},{"id":"W4385226489","doi":"10.1016/j.engappai.2023.106802","title":"An efficient adaptive large neighborhood search algorithm based on heuristics and reformulations for the generalized quadratic assignment problem","year":2023,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":62,"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":"Universiti Teknologi Malaysia; King Saud University","keywords":"Computer science; Mathematical optimization; Tabu search; Metaheuristic; Quadratic assignment problem; Heuristics; Optimization problem; Algorithm; Mathematics","score_opus":0.034130435469824166,"score_gpt":0.3130402453982657,"score_spread":0.2789098099284415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385226489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012177418,0.000039930474,0.9970784,0.00009669367,0.000064818385,0.001013485,0.000099776866,0.0003630686,0.00002604026],"genre_scores_gemma":[0.652683,0.000013148713,0.34660503,0.00000747084,0.00005747316,0.00055781787,0.000034475517,0.000035878344,0.0000056575605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989163,0.000029706935,0.00037256494,0.00021628723,0.00020431959,0.0002608138],"domain_scores_gemma":[0.9986928,0.0006677905,0.000042325835,0.00039511747,0.00012691786,0.00007502056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071531755,0.0001474179,0.00014449225,0.00018924077,0.00019693158,0.00004444034,0.0002039324,0.00006103279,0.000006010832],"category_scores_gemma":[0.00006608139,0.00013220968,0.000042843665,0.0007496647,0.00003593375,0.00003552706,0.000022384878,0.00013639417,0.000008854462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045402044,0.000049921124,0.0000050551325,0.0000356027,0.000015262907,9.992181e-8,0.00022069525,0.9306585,0.0009667209,0.032088064,0.0000065907698,0.03594896],"study_design_scores_gemma":[0.000046308644,0.00006470151,0.00006229641,0.000020581116,0.000020335976,2.9718697e-7,0.00022024201,0.989569,0.009162006,0.0005920035,0.000106812186,0.00013538104],"about_ca_topic_score_codex":0.0000057817647,"about_ca_topic_score_gemma":0.0000012209103,"teacher_disagreement_score":0.6514653,"about_ca_system_score_codex":0.00006131581,"about_ca_system_score_gemma":0.000025438852,"threshold_uncertainty_score":0.53913546},"labels":[],"label_agreement":null},{"id":"W4385318392","doi":"10.3389/fams.2023.1128181","title":"A machine learning framework for neighbor generation in metaheuristic search","year":2023,"lang":"en","type":"article","venue":"Frontiers in Applied Mathematics and Statistics","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":false,"ca_institutions":"Polytechnique Montréal","funders":"Polytechnique Montréal","keywords":"Metaheuristic; Tabu search; Computer science; Mathematical optimization; Guided Local Search; Artificial intelligence; Heuristic; Local search (optimization); Machine learning; Hyper-heuristic; Mathematics","score_opus":0.030151435582191192,"score_gpt":0.28724854583237924,"score_spread":0.25709711025018805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385318392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013431316,0.00013740054,0.9975056,0.000015612835,0.00017390594,0.00037240188,0.000075227355,0.000119349905,0.00025737757],"genre_scores_gemma":[0.016855499,0.0003793418,0.9824001,0.000009143596,0.00003820344,0.00009147167,0.00012883518,0.000054114254,0.00004326163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991049,0.000019520898,0.00033422976,0.00015614452,0.00012712729,0.00025806614],"domain_scores_gemma":[0.99936736,0.00042232926,0.000036522608,0.0001090103,0.000019645904,0.00004511267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246764,0.00013193024,0.00027259355,0.00025741756,0.00005621785,0.000050985727,0.00007014434,0.000094859824,0.0000062468803],"category_scores_gemma":[0.00035033957,0.00014445874,0.00001338286,0.0004066239,0.000024983965,0.000019033452,0.000025088617,0.00024521048,0.0000030600136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007432337,0.000023906689,0.00051676546,0.00063934113,0.000026236115,0.0000052955866,0.0018164401,0.764683,0.0002294605,0.18320958,0.0013305704,0.04751194],"study_design_scores_gemma":[0.0003010699,0.000011499951,0.000062188716,0.000023021417,0.000012318294,5.3096585e-7,0.00026604475,0.92054135,0.00008283851,0.07836158,0.00020160429,0.00013598804],"about_ca_topic_score_codex":0.0000018666103,"about_ca_topic_score_gemma":0.000004033057,"teacher_disagreement_score":0.1558583,"about_ca_system_score_codex":0.000050705217,"about_ca_system_score_gemma":0.0000115519,"threshold_uncertainty_score":0.58908564},"labels":[],"label_agreement":null},{"id":"W4385438103","doi":"10.1016/j.tre.2023.103226","title":"A branch-and-regret algorithm for the same-day delivery problem","year":2023,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"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é Laval","funders":"","keywords":"Regret; Computer science; Vehicle routing problem; Routing (electronic design automation); Variety (cybernetics); Mathematical optimization; Operations research; Scheme (mathematics); Look-ahead; Algorithm; Mathematics; Computer network; Artificial intelligence","score_opus":0.10634184700762042,"score_gpt":0.3734209020231644,"score_spread":0.26707905501554396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385438103","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024740847,0.039178044,0.9505791,0.002437187,0.0002280787,0.0032866898,0.0011087131,0.0005954493,0.00011265605],"genre_scores_gemma":[0.105328955,0.8141149,0.07262333,0.00066535576,0.00023828667,0.0025522993,0.0035632823,0.00019474784,0.00071884325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811685,0.00012956376,0.000600895,0.0003144081,0.00042712924,0.00041117077],"domain_scores_gemma":[0.99802804,0.0012020026,0.000064624444,0.00020334103,0.00036564126,0.0001363487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026140814,0.00019837658,0.0003209869,0.0001355904,0.0003257453,0.00005451489,0.00013762143,0.00009492497,0.000051228006],"category_scores_gemma":[0.00008045357,0.00016002638,0.00008519658,0.00085250544,0.00019366098,0.00011907261,0.0000019190354,0.00029047328,0.000012622836],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021762697,0.000045790806,0.0024666884,0.01263799,0.0002713614,0.000026590376,0.0017443496,0.09407486,0.000108214794,0.01802838,0.011841373,0.85873264],"study_design_scores_gemma":[0.0018476953,0.0002037452,0.09310824,0.0031250003,0.00065768237,0.0000028951983,0.00037827293,0.58736795,0.00015269454,0.0053940015,0.3068648,0.0008970375],"about_ca_topic_score_codex":0.000049921382,"about_ca_topic_score_gemma":0.00023874623,"teacher_disagreement_score":0.8779558,"about_ca_system_score_codex":0.000016096363,"about_ca_system_score_gemma":0.000043774486,"threshold_uncertainty_score":0.65256864},"labels":[],"label_agreement":null},{"id":"W4385622316","doi":"10.1155/2023/1200526","title":"An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies","year":2023,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"Humanities and Social Science Fund of Ministry of Education of China; Natural Science Foundation of Fujian Province","keywords":"Vehicle routing problem; Benchmark (surveying); Solver; Heuristic; Computer science; Mathematical optimization; Integer programming; Routing (electronic design automation); Set (abstract data type); Linear programming; Series (stratigraphy); Operations research; Algorithm; Mathematics; Computer network","score_opus":0.015029798025990642,"score_gpt":0.2708631476375044,"score_spread":0.25583334961151377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385622316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39084378,0.00015911361,0.60850745,0.00005064699,0.00004829301,0.00026800463,0.000009429685,0.00009758811,0.000015673588],"genre_scores_gemma":[0.9681462,0.00013548501,0.03156203,0.0000074176323,0.00007142662,0.000013310467,0.000014180441,0.000042175318,0.000007772625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990702,0.00004742535,0.0003249066,0.000109532615,0.00020116601,0.00024672705],"domain_scores_gemma":[0.9992054,0.0003193354,0.00013348245,0.00008032117,0.00020430562,0.000057115103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078362954,0.00011580483,0.00017137948,0.00013793314,0.00015217732,0.00005642998,0.00009064163,0.00004111359,0.0000031662373],"category_scores_gemma":[0.00002540081,0.0000872238,0.000035489797,0.0005380491,0.000013347928,0.000614777,0.0000010848074,0.00022912578,7.5482285e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011130753,0.000011019598,0.00046286237,0.00004715304,0.00004573602,0.000004956854,0.0027279085,0.971245,0.01844504,0.00031862617,0.0000022261868,0.006578198],"study_design_scores_gemma":[0.0011810601,0.00045869968,0.031770926,0.000101696445,0.0000680915,0.000008677588,0.0030008825,0.96091634,0.001903865,0.0004487527,0.000015378759,0.0001256286],"about_ca_topic_score_codex":0.0000013016182,"about_ca_topic_score_gemma":0.000007672286,"teacher_disagreement_score":0.5773024,"about_ca_system_score_codex":0.000034606855,"about_ca_system_score_gemma":0.000051133997,"threshold_uncertainty_score":0.35568833},"labels":[],"label_agreement":null},{"id":"W4385763708","doi":"10.24963/ijcai.2023/739","title":"Machine Learning for Cutting Planes in Integer Programming: A Survey","year":2023,"lang":"en","type":"article","venue":"","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":"University of Toronto","funders":"","keywords":"Integer programming; Computer science; Linear programming; Linear programming relaxation; Set (abstract data type); Node (physics); Heuristic; Task (project management); Selection (genetic algorithm); Mathematical optimization; Tree (set theory); Machine learning; Process (computing); Integer (computer science); Decision tree; Branch and bound; Branch and price; Artificial intelligence; Algorithm; Mathematics; Programming language; Engineering","score_opus":0.045671819724117234,"score_gpt":0.3069942294338229,"score_spread":0.26132240970970566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385763708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16925117,0.000106330466,0.8228049,0.00010568731,0.00037686896,0.0006372838,0.000010089442,0.0040347204,0.0026728972],"genre_scores_gemma":[0.8627981,0.00001962264,0.13535067,0.000014777631,0.000044232154,0.00007612505,0.00019195736,0.00007489521,0.0014296162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.000088172535,0.00020585387,0.0001314649,0.000069963455,0.0002770017],"domain_scores_gemma":[0.9992324,0.0006098029,0.000018780944,0.00007702266,0.000028680242,0.000033292083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015843651,0.000097041535,0.00013474646,0.000180641,0.000040870913,0.00003898232,0.00007841408,0.000057210993,0.0000185831],"category_scores_gemma":[0.0008620329,0.00009646862,0.000025718922,0.00061443984,0.0000073473434,0.000055630513,0.0000255861,0.00015968777,0.000024150682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054201396,0.0000047679973,0.12559639,0.000059912014,0.000009347561,0.0000019997813,0.0002996324,0.8413626,0.00011114564,0.00011213294,0.000116523035,0.032320123],"study_design_scores_gemma":[0.00023372173,0.000013758921,0.010000001,0.000018126766,0.0000017643459,0.0000013334561,0.00008551442,0.9850494,0.00030911586,0.00001980268,0.004150058,0.00011736715],"about_ca_topic_score_codex":0.000108394685,"about_ca_topic_score_gemma":0.00015521103,"teacher_disagreement_score":0.69354695,"about_ca_system_score_codex":0.000026863807,"about_ca_system_score_gemma":0.0000066986713,"threshold_uncertainty_score":0.3933876},"labels":[],"label_agreement":null},{"id":"W4385802534","doi":"10.1007/s10009-023-00714-1","title":"Publisher Correction: Algorithm selection for SMT","year":2023,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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":"Theory of computation; Computer science; Selection (genetic algorithm); Algorithm; Artificial intelligence","score_opus":0.024416113692210247,"score_gpt":0.29348725613433285,"score_spread":0.2690711424421226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385802534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038502843,0.000025450961,0.9786312,0.0016622947,0.012639159,0.0003443155,0.000046679394,0.0026718872,0.00012874439],"genre_scores_gemma":[0.06917712,0.0003105047,0.9210983,0.00072954426,0.0021693434,0.0010408591,0.00033935724,0.00035638278,0.004778587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987655,0.000019513102,0.0003917988,0.00021771809,0.00027512325,0.00033029754],"domain_scores_gemma":[0.99875003,0.00039986774,0.000034234792,0.00010590383,0.0006494821,0.000060458693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046549737,0.0001853609,0.00019389167,0.0009418895,0.00017693825,0.00025940564,0.000398507,0.000324095,0.00005744217],"category_scores_gemma":[0.00073095807,0.00019262564,0.00018606524,0.0006297617,0.000038987528,0.00051426294,0.000011600148,0.00044439625,0.000029751987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007884433,0.000041876145,0.000516703,0.000014209316,0.00033945148,0.0000068649497,0.000054648048,0.11200387,0.0003866616,0.0013938982,0.051908754,0.8332542],"study_design_scores_gemma":[0.0041590417,0.0006564609,0.0006428054,0.0001536313,0.00008922833,0.00069642195,0.00015227203,0.5588568,0.012635496,0.01835965,0.40286162,0.0007365625],"about_ca_topic_score_codex":5.2566827e-7,"about_ca_topic_score_gemma":0.0000021432431,"teacher_disagreement_score":0.8325177,"about_ca_system_score_codex":0.00023641356,"about_ca_system_score_gemma":0.00004165622,"threshold_uncertainty_score":0.7855046},"labels":[],"label_agreement":null},{"id":"W4385840258","doi":"10.3390/math11163521","title":"Optimization Models for the Vehicle Routing Problem under Disruptions","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Routing (electronic design automation); Computer science; Mathematical optimization; Operations research; Heuristic; Generalization; Plan (archaeology); Property (philosophy); Mathematics; Artificial intelligence; Computer network","score_opus":0.056174691931972394,"score_gpt":0.2983257588552173,"score_spread":0.2421510669232449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385840258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011471137,0.000025880874,0.9952192,0.00036305643,0.00012207235,0.00047579006,0.000011056141,0.0010611401,0.0015747381],"genre_scores_gemma":[0.12637742,0.000052039806,0.8724894,0.00004035295,0.000083643645,0.00020222955,0.000024928026,0.00009861194,0.0006313877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992319,0.000019050409,0.0002672019,0.00010479376,0.00013513431,0.00024195894],"domain_scores_gemma":[0.9990172,0.0005904967,0.0000458805,0.0002507208,0.00006255982,0.000033137832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006031587,0.00011264591,0.00011840413,0.000060255155,0.00022506304,0.00008257748,0.0001545647,0.000060976807,0.00001642071],"category_scores_gemma":[0.00009172605,0.00009019187,0.000057753234,0.00046549368,0.00002034813,0.00012535168,0.000037512647,0.00008475635,0.000027199878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2530786e-7,0.000008992256,0.000003983026,0.0000858163,0.000023165112,1.0524349e-7,0.0010055361,0.97755,0.000099493016,0.020016734,0.00044386927,0.0007618747],"study_design_scores_gemma":[0.00014736672,0.000004988627,0.00000954858,0.000030178067,0.000031307085,0.0000015212265,0.00055488345,0.9827962,0.000115766044,0.01612706,0.00007082155,0.00011035586],"about_ca_topic_score_codex":0.0000010111829,"about_ca_topic_score_gemma":0.000001088437,"teacher_disagreement_score":0.12523031,"about_ca_system_score_codex":0.000042940304,"about_ca_system_score_gemma":0.000010523547,"threshold_uncertainty_score":0.36779177},"labels":[],"label_agreement":null},{"id":"W4385840825","doi":"10.1016/j.cor.2023.106385","title":"Enhanced iterated local search for the technician routing and scheduling problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"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é Laval","funders":"European Regional Development Fund; Région Hauts-de-France","keywords":"Iterated local search; Computer science; Scheduling (production processes); Operations research; Job shop scheduling; Mathematical optimization; Local optimum; Local search (optimization); Routing (electronic design automation); Engineering; Mathematics; Artificial intelligence; Computer network","score_opus":0.07122862884273742,"score_gpt":0.3804832934992185,"score_spread":0.3092546646564811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385840825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04145518,0.00010509755,0.9556779,0.0010190215,0.00011708769,0.0009031097,0.0000057432258,0.0005431552,0.00017368411],"genre_scores_gemma":[0.8139364,0.0000788278,0.18539108,0.00002561422,0.00013137837,0.0002107043,0.00002720914,0.000044329114,0.00015443887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984639,0.00020794339,0.0002453543,0.00026300517,0.0002995706,0.000520217],"domain_scores_gemma":[0.9982561,0.00097477,0.0000059759054,0.00027092107,0.00041073962,0.000081483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002763325,0.0001146612,0.00012562484,0.00032558464,0.001036845,0.0004548605,0.0002929364,0.00008012244,0.00000721762],"category_scores_gemma":[0.00014452547,0.00009750737,0.000030337242,0.0016244933,0.00014637693,0.00015249173,0.00019187758,0.0004513794,0.000029534838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033582542,0.0000050624194,0.000013641973,0.000038923168,0.000021661159,9.3440553e-7,0.00093558274,0.93236494,0.010061092,0.0015554565,0.00020374445,0.054795597],"study_design_scores_gemma":[0.00023944682,0.00003453472,0.00011902751,0.00006354608,0.0000034708803,0.0000028169698,0.00058172824,0.98790914,0.010658764,0.000027954162,0.00025215605,0.000107438806],"about_ca_topic_score_codex":0.000024418363,"about_ca_topic_score_gemma":0.00001863639,"teacher_disagreement_score":0.7724812,"about_ca_system_score_codex":0.00009677101,"about_ca_system_score_gemma":0.00007575546,"threshold_uncertainty_score":0.7974679},"labels":[],"label_agreement":null},{"id":"W4385877360","doi":"10.1287/trsc.2022.0261","title":"A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems","year":2023,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval; Transport Canada","funders":"","keywords":"Branch and cut; Benchmark (surveying); Mathematical optimization; Computer science; Branch and bound; Routing (electronic design automation); Production (economics); Heuristic; Time horizon; Algorithm; Vendor-managed inventory; Integer programming; Supply chain; Mathematics; Supply chain management","score_opus":0.03466089813080044,"score_gpt":0.2828480735673259,"score_spread":0.24818717543652544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385877360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24473163,0.000059364927,0.75410116,0.00011510805,0.00021574307,0.00035423966,0.0000065703603,0.00038459193,0.000031587042],"genre_scores_gemma":[0.77697265,0.00007702914,0.22264051,0.000018220488,0.00005922757,0.000103459046,0.000018252576,0.000024576417,0.00008609193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990775,0.000007732501,0.00020884725,0.00027786146,0.00020314803,0.00022490321],"domain_scores_gemma":[0.99967957,0.000032531065,0.0000376613,0.00009805255,0.0000825895,0.00006961957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401721,0.000090291804,0.000098385346,0.00014646318,0.00019908066,0.00004620663,0.000076964185,0.00003320471,0.0000027546018],"category_scores_gemma":[0.00006823888,0.000094753894,0.000016884498,0.00053307525,0.00016422938,0.0003987287,0.0000034737552,0.000060815888,0.0000029617906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057252605,0.000012188383,0.017270647,0.00025951592,0.000015133305,9.858452e-7,0.010449426,0.77056783,0.01633618,0.0009793601,0.00012588206,0.1839771],"study_design_scores_gemma":[0.00019165651,0.000015327207,0.06038183,0.000039056053,0.00001017272,0.0000014821534,0.00012848689,0.93703014,0.0012128137,0.00077504735,0.0000883387,0.00012567759],"about_ca_topic_score_codex":0.0000140090615,"about_ca_topic_score_gemma":0.000094917086,"teacher_disagreement_score":0.532241,"about_ca_system_score_codex":0.000025381325,"about_ca_system_score_gemma":0.000028974557,"threshold_uncertainty_score":0.38639516},"labels":[],"label_agreement":null},{"id":"W4385945676","doi":"10.2139/ssrn.4544139","title":"Multi-Objective Particle Swarm Optimization Algorithm Based on Multiple Adaptive Methods for Fire Trucks Dispatching in Mixed Uncertain Forest Fire Environments","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"University of Waterloo","funders":"","keywords":"Truck; Particle swarm optimization; Computer science; Swarm behaviour; Mathematical optimization; Algorithm; Environmental science; Engineering; Automotive engineering; Mathematics; Artificial intelligence","score_opus":0.029614203628022667,"score_gpt":0.31016849617341763,"score_spread":0.280554292545395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385945676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015014275,0.0005330988,0.9819843,0.00010783893,0.00082147174,0.001209757,0.00007009883,0.00025348872,0.0000056771464],"genre_scores_gemma":[0.27086967,0.0008483928,0.72721523,0.0000231685,0.00017787039,0.0003504113,0.00014651884,0.00025030551,0.00011847074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949723,0.00089195586,0.00084416004,0.0006921286,0.000347431,0.0022520474],"domain_scores_gemma":[0.9974989,0.0014842162,0.00036827876,0.00041903617,0.000071584356,0.00015797775],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0044243243,0.00060955837,0.0006587077,0.0002575523,0.00027297463,0.00011377641,0.0004619565,0.00049618934,0.0000059905888],"category_scores_gemma":[0.001093283,0.00065930403,0.0003164111,0.00037249044,0.000045932866,0.00017687994,0.00014662325,0.0036560132,0.0000045212514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009806098,0.00010702394,0.0010580391,0.000038070717,0.00019462712,0.0000040230325,0.00042695753,0.8891957,0.00006595922,0.000031947086,0.0000035816238,0.10877605],"study_design_scores_gemma":[0.0026905993,0.00022767103,0.0016698883,0.0002654979,0.000089616944,0.00000814535,0.000878909,0.98958105,0.0005358452,0.003430723,0.0000140286775,0.0006080107],"about_ca_topic_score_codex":0.00022547557,"about_ca_topic_score_gemma":0.00056395,"teacher_disagreement_score":0.25585538,"about_ca_system_score_codex":0.0042908,"about_ca_system_score_gemma":0.0006646913,"threshold_uncertainty_score":0.9995858},"labels":[],"label_agreement":null},{"id":"W4386003478","doi":"10.1016/j.cie.2023.109552","title":"Last mile delivery routing problem using autonomous electric vehicles","year":2023,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vehicle routing problem; Metaheuristic; Simulated annealing; Computer science; Solver; Integer programming; Ant colony optimization algorithms; Routing (electronic design automation); Variable neighborhood search; Mathematical optimization; Operations research; Engineering; Algorithm; Mathematics; Computer network","score_opus":0.0374162422301799,"score_gpt":0.23784974006442802,"score_spread":0.20043349783424813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386003478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6261933,0.00011903807,0.36712426,0.00002442493,0.0017694806,0.0003277585,0.000005851913,0.0043053706,0.00013053234],"genre_scores_gemma":[0.89056605,0.00003683512,0.107655205,0.000022303686,0.0014053631,0.00002247651,0.000029562632,0.00022327303,0.00003894751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806565,0.000054938526,0.00052096334,0.0003415968,0.00024186823,0.00077498704],"domain_scores_gemma":[0.9991579,0.000285319,0.00006828899,0.0002677794,0.000053304982,0.00016741743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056193507,0.00034764176,0.00036662887,0.0005682982,0.0001437709,0.00015155066,0.00032428248,0.0002771466,0.000007758398],"category_scores_gemma":[0.00008332039,0.00043484717,0.000114992945,0.00195631,0.000013996713,0.00024653054,0.000106757565,0.000598545,0.000043597975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029945759,0.0000057376865,0.00021094216,0.000033036336,0.00005976865,0.000019456109,0.00015200018,0.9496514,0.026813624,0.00006509097,0.0004350818,0.022550873],"study_design_scores_gemma":[0.0006163533,0.000022857286,0.00019368387,0.00014887971,0.000026518159,0.00002061625,0.000018225906,0.99185693,0.005033755,0.000007840927,0.0016192705,0.00043504135],"about_ca_topic_score_codex":0.000016118358,"about_ca_topic_score_gemma":4.3705896e-7,"teacher_disagreement_score":0.26437277,"about_ca_system_score_codex":0.00031429634,"about_ca_system_score_gemma":0.00006570337,"threshold_uncertainty_score":0.99981034},"labels":[],"label_agreement":null},{"id":"W4386326396","doi":"10.1287/ijoc.2022.0175","title":"Fast Continuous and Integer L-Shaped Heuristics Through Supervised Learning","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":true,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Operations research; Integer (computer science); Knapsack problem; Integer programming; Mathematical optimization; Container (type theory); Mathematics; Algorithm; Engineering","score_opus":0.02120533820114971,"score_gpt":0.2735105454951502,"score_spread":0.25230520729400047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386326396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5054522,0.000060691076,0.48864463,0.00008551929,0.0007512152,0.00008009625,0.0000012186233,0.00083176413,0.0040926426],"genre_scores_gemma":[0.9555507,0.00014917663,0.043523792,0.00017664935,0.000368327,7.458683e-7,0.00000617378,0.00006263272,0.00016184124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865514,0.000052575906,0.0005146631,0.00011783024,0.0002507137,0.00040906438],"domain_scores_gemma":[0.9991486,0.00040213187,0.00011873856,0.00010134612,0.0001124866,0.00011666834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088092824,0.0001944912,0.00026629335,0.00019241514,0.0003303878,0.0002822493,0.00015150722,0.000093482086,0.000025424579],"category_scores_gemma":[0.00048974436,0.00017367819,0.00006417873,0.0004392636,0.000032318545,0.00025087572,0.00008746224,0.00091090397,0.00007530074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074044265,0.000004146252,0.0028749425,0.00003539435,0.000037895035,0.000040691542,0.0021992633,0.9122768,0.00022664906,0.00019097973,0.0002976229,0.08180823],"study_design_scores_gemma":[0.00054499944,0.000076648656,0.0017649175,0.00016352546,0.000009020604,0.00018026288,0.00073626684,0.9929196,0.00012985738,0.00013500499,0.0031214983,0.00021838775],"about_ca_topic_score_codex":0.0000016751629,"about_ca_topic_score_gemma":1.988299e-7,"teacher_disagreement_score":0.45009843,"about_ca_system_score_codex":0.000062025145,"about_ca_system_score_gemma":0.000019228639,"threshold_uncertainty_score":0.7082391},"labels":[],"label_agreement":null},{"id":"W4386365073","doi":"10.1016/j.tre.2023.103267","title":"Scheduling trucks and drones for cooperative deliveries","year":2023,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":48,"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":"National Natural Science Foundation of China","keywords":"Truck; Drone; Computer science; Scheduling (production processes); Job shop scheduling; Integer programming; Operations research; Heuristic; Simulation; Transport engineering; Engineering; Automotive engineering; Operations management; Algorithm; Schedule","score_opus":0.13029055133490883,"score_gpt":0.3975847856348976,"score_spread":0.2672942342999888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386365073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11231467,0.041925307,0.8371379,0.0017356074,0.00033886897,0.0037424527,0.0014677596,0.0010805158,0.00025691118],"genre_scores_gemma":[0.5601315,0.39374164,0.041953813,0.00018289138,0.00009145518,0.0008254363,0.0027589435,0.000099891186,0.00021443618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984924,0.000083044695,0.0005185935,0.00029057893,0.00028522417,0.00033011485],"domain_scores_gemma":[0.9987692,0.00049770245,0.000047241523,0.00012289612,0.0004272236,0.00013572333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012105614,0.00017422947,0.0003247037,0.00015586325,0.0002716426,0.000051101702,0.00007181575,0.00008568643,0.00004262996],"category_scores_gemma":[0.0001418776,0.00017365173,0.000047985504,0.00066375814,0.00018429168,0.0001511695,0.0000013260598,0.00019846714,0.0000071161085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014395056,0.00009173961,0.016022349,0.048289284,0.00042622225,0.00007641269,0.005675027,0.6589561,0.0011242421,0.17169584,0.00615173,0.09134709],"study_design_scores_gemma":[0.004614746,0.0007005176,0.18869339,0.008549859,0.00089599227,0.000005038007,0.0025909564,0.59797823,0.0015066868,0.009395617,0.18278928,0.0022796795],"about_ca_topic_score_codex":0.00001705667,"about_ca_topic_score_gemma":0.00017482697,"teacher_disagreement_score":0.7951841,"about_ca_system_score_codex":0.000013121566,"about_ca_system_score_gemma":0.000036401012,"threshold_uncertainty_score":0.7081312},"labels":[],"label_agreement":null},{"id":"W4386773677","doi":"10.5267/j.ijiec.2023.6.001","title":"Inventory routing problem with backhaul considering returnable transport items collection","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Backhaul (telecommunications); Vehicle routing problem; Supply chain; Operations research; Economic order quantity; Routing (electronic design automation); Environmental economics; Business; Operations management; Computer network; Economics; Engineering","score_opus":0.03594425694504643,"score_gpt":0.26429579503772316,"score_spread":0.22835153809267672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39539623,0.000051781673,0.5978699,0.000733992,0.0042462316,0.00025773508,0.000014086185,0.0007819957,0.0006480563],"genre_scores_gemma":[0.950568,0.000032802727,0.048303254,0.000016085894,0.000877613,0.0000092213795,0.000026848991,0.00007325266,0.00009290956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845046,0.000037387243,0.0006396712,0.00012243644,0.0005114753,0.00023856875],"domain_scores_gemma":[0.9988772,0.00023496375,0.00021062551,0.00008189424,0.00047743844,0.00011784055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006708529,0.0001791748,0.0002456892,0.0007668659,0.000073986615,0.0000935209,0.0002507481,0.00011987643,0.00001994654],"category_scores_gemma":[0.00019991556,0.00018483492,0.000094451905,0.00094162417,0.000022672302,0.0003809696,0.000020322424,0.000521661,0.000007649036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020411793,0.00001208963,0.0027100588,0.000011910117,0.00025815147,0.000072385184,0.0004207604,0.9932453,0.0008174479,0.0001870984,0.001132517,0.0011118812],"study_design_scores_gemma":[0.0015086466,0.000070738206,0.0007699901,0.0004267138,0.000040995426,0.00030178472,0.00016772546,0.9922843,0.0011732631,0.00006287558,0.00296061,0.00023235292],"about_ca_topic_score_codex":0.000010582258,"about_ca_topic_score_gemma":0.0000032707949,"teacher_disagreement_score":0.5551718,"about_ca_system_score_codex":0.00028664898,"about_ca_system_score_gemma":0.00015832421,"threshold_uncertainty_score":0.75373495},"labels":[],"label_agreement":null},{"id":"W4386773874","doi":"10.5267/j.ijiec.2023.9.004","title":"A modified clustering search based genetic algorithm for the proactive electric vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Cluster analysis; Genetic algorithm; Mathematical optimization; Electric vehicle; Routing (electronic design automation); Computer science; Integer programming; Plan (archaeology); Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.05167001046008366,"score_gpt":0.3033825025772423,"score_spread":0.2517124921171586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017806605,0.00003998017,0.9792734,0.0007321774,0.0015001349,0.00037440765,0.000019378094,0.0002333952,0.000020535546],"genre_scores_gemma":[0.7547548,0.00001630301,0.24377923,0.00002277872,0.001278424,0.00004777475,0.0000146872235,0.0000709842,0.000015017169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857104,0.000051952196,0.00052276335,0.000120199424,0.00045475396,0.00027929296],"domain_scores_gemma":[0.9978963,0.0012441331,0.00013121025,0.000093446004,0.00055760395,0.000077278506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008505915,0.00015571348,0.0001827331,0.0005559958,0.000102530874,0.00015757768,0.00044398333,0.00009711353,0.0000040370237],"category_scores_gemma":[0.00033659194,0.00014177478,0.00013861647,0.0007989324,0.000013974814,0.00015543961,0.00004184914,0.00045550885,0.0000033566157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012094885,0.000011744118,0.000027694046,0.0000060020516,0.00023059905,0.0000074696886,0.00019855906,0.8867712,0.0009125837,0.000040884886,0.00014579413,0.11163535],"study_design_scores_gemma":[0.0012774231,0.00005339422,0.0004155194,0.00008041577,0.00003889764,0.000031182426,0.000065762135,0.99635696,0.0013672517,0.000033062326,0.00014477634,0.00013537386],"about_ca_topic_score_codex":0.0000064599985,"about_ca_topic_score_gemma":3.616112e-7,"teacher_disagreement_score":0.7369482,"about_ca_system_score_codex":0.00025305687,"about_ca_system_score_gemma":0.00015060508,"threshold_uncertainty_score":0.5781408},"labels":[],"label_agreement":null},{"id":"W4386893171","doi":"10.1007/978-3-031-32338-6_13","title":"Hub Location Models Under Uncertainty","year":2023,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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":"Robust optimization; Computer science; Mathematical optimization; Mathematics","score_opus":0.11089164277173964,"score_gpt":0.4179775263247292,"score_spread":0.30708588355298955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386893171","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015267414,0.000118394484,0.024790986,0.010119257,0.0050955475,0.0044585215,0.00019052792,0.0006596782,0.95304036],"genre_scores_gemma":[0.21192323,0.0129317725,0.0479571,0.00019413757,0.00055092474,0.0026093444,0.0007782405,0.0003090247,0.72274625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98231137,0.00035190722,0.0018613212,0.0025050044,0.010863368,0.0021070277],"domain_scores_gemma":[0.9930406,0.0002960288,0.00008222393,0.0018067077,0.0043633883,0.00041103724],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.020163473,0.00075964275,0.00053462206,0.015761064,0.00273016,0.004577325,0.007855946,0.00030206726,0.0012020732],"category_scores_gemma":[0.0010320231,0.00085190026,0.00013550461,0.008629835,0.006828799,0.0087344255,0.0045063323,0.002167639,0.0007993591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036159552,0.000067738634,0.000016286429,0.0000720252,0.00006106934,0.00006533399,0.00034990968,0.5280394,0.00012978277,0.46886906,0.0007149429,0.001578298],"study_design_scores_gemma":[0.0007498312,0.00008494767,0.00081407645,0.0008641534,0.000014142793,0.000018381888,0.0034697729,0.91378284,0.00014594993,0.05707192,0.02208283,0.00090113585],"about_ca_topic_score_codex":0.0005539334,"about_ca_topic_score_gemma":0.0056756367,"teacher_disagreement_score":0.41179714,"about_ca_system_score_codex":0.0081577115,"about_ca_system_score_gemma":0.000802277,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W4386968557","doi":"10.1016/j.cor.2023.106434","title":"Split demand and deliveries in an integrated three-level lot sizing and replenishment problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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; Université du Québec à Montréal","funders":"","keywords":"Heuristics; Sizing; Computer science; Production (economics); Time horizon; Mathematical optimization; Heuristic; Routing (electronic design automation); Operations research; Holding cost; Mathematics; Economics; Microeconomics","score_opus":0.12825433258663296,"score_gpt":0.375426004235031,"score_spread":0.247171671648398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386968557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7496402,0.00019953738,0.24909087,0.00030345665,0.00005159198,0.00039495784,0.000008944555,0.00023957666,0.00007082673],"genre_scores_gemma":[0.68187207,0.00024728882,0.3176168,0.00001595921,0.0000319277,0.000067732886,0.00004654796,0.00003095894,0.00007073264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987215,0.00022924865,0.00023560849,0.00028648818,0.00020863621,0.00031855816],"domain_scores_gemma":[0.99930453,0.00019877769,0.0000057798666,0.00020965603,0.00017485031,0.00010643126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014897304,0.00011135874,0.00014039647,0.00042976817,0.00027739938,0.00038845246,0.0001329621,0.00006343964,0.0000095534715],"category_scores_gemma":[0.00009248542,0.00011399428,0.000009663684,0.00093784876,0.000104395396,0.00032426935,0.00017683177,0.00029467858,0.000008326482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069222197,0.000016204061,0.0049881637,0.000065972185,0.00001440343,0.00001194543,0.002661964,0.9388124,0.0018565877,0.0008370948,0.0002447264,0.050483666],"study_design_scores_gemma":[0.00027174575,0.000060496484,0.017578987,0.00007369471,0.0000019112526,0.00000607794,0.0004359621,0.980804,0.00034092608,0.000101123296,0.00020675408,0.00011826657],"about_ca_topic_score_codex":0.00015326653,"about_ca_topic_score_gemma":0.00089484476,"teacher_disagreement_score":0.068525925,"about_ca_system_score_codex":0.00008356298,"about_ca_system_score_gemma":0.000046825244,"threshold_uncertainty_score":0.4648552},"labels":[],"label_agreement":null},{"id":"W4386989678","doi":"10.2139/ssrn.4581245","title":"The Pollution-Routing Problem with Speed Optimization and Uneven Topography","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Routing (electronic design automation); Pollution; Computer science; Environmental science; Mathematical optimization; Computer network; Mathematics; Ecology","score_opus":0.010993315755688876,"score_gpt":0.2400125813362227,"score_spread":0.22901926558053382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386989678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008742192,0.003060809,0.9847787,0.0013004036,0.00049414905,0.00048557008,0.000006287632,0.0006195345,0.00051237084],"genre_scores_gemma":[0.8009596,0.04634842,0.14932935,0.000051796364,0.0010651618,0.000047081714,0.00005418375,0.00047850254,0.0016659409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705374,0.00018604418,0.0004597172,0.00028485293,0.0003227088,0.0016929284],"domain_scores_gemma":[0.99912876,0.00012513388,0.00024131278,0.00027788559,0.00013908213,0.00008782206],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0030901015,0.00032130454,0.00027993246,0.00022189453,0.0005521525,0.00037525353,0.00033943556,0.000218272,0.0000034530815],"category_scores_gemma":[0.00007731808,0.00024248063,0.000098845325,0.00045940976,0.00007692833,0.00011538468,0.0001458972,0.003463518,0.0000023423959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011564409,0.000004395338,0.0005778749,0.000029033568,0.00033282983,0.0000015252313,0.00016126166,0.9877325,0.000013596257,0.005952955,0.000034597313,0.005147852],"study_design_scores_gemma":[0.0005932866,0.00010187904,0.00042224902,0.00026464416,0.00015769858,0.0002731152,0.0010737404,0.9434143,0.000030112511,0.05290998,0.00022955581,0.00052945275],"about_ca_topic_score_codex":0.00003780755,"about_ca_topic_score_gemma":0.00021275986,"teacher_disagreement_score":0.83544934,"about_ca_system_score_codex":0.00061410875,"about_ca_system_score_gemma":0.00073488057,"threshold_uncertainty_score":0.9988355},"labels":[],"label_agreement":null},{"id":"W4387087085","doi":"10.1016/j.ejor.2023.09.031","title":"Multi-attribute two-echelon location routing: Formulation and dynamic discretization discovery approach","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"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; Université de Montréal; Transport Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Vehicle routing problem; Transshipment (information security); Routing (electronic design automation); Discretization; Integer programming; Operations research; Synchronization (alternating current); Job shop scheduling; Mathematical optimization; Distributed computing; Computer network; Mathematics; Algorithm","score_opus":0.08653340626897581,"score_gpt":0.37327542406983916,"score_spread":0.28674201780086334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387087085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18863913,0.00012202173,0.8100187,0.00027753922,0.00012554579,0.00017415725,0.0000074400573,0.00007482161,0.000560649],"genre_scores_gemma":[0.9356446,0.00016186232,0.06338884,0.000010917297,0.00016281962,0.0000031426425,0.00013193804,0.000054394026,0.00044146914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974211,0.00091001857,0.0005321621,0.00016808964,0.00070180907,0.00026680832],"domain_scores_gemma":[0.9986369,0.00025799978,0.000089435365,0.00013755144,0.00077186077,0.00010623472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071685174,0.000121481564,0.00014639151,0.0005018003,0.00027642053,0.00034875053,0.00019360977,0.000032512056,0.000007833151],"category_scores_gemma":[0.0011116304,0.00011246805,0.000038245187,0.0010717505,0.00005386738,0.000928299,0.00008436441,0.00044367605,0.000030208781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015063598,0.000024102737,0.0020792175,0.0000428093,0.000027028667,0.0000105247755,0.00057902705,0.97991914,0.013177967,0.00091797503,0.00021099996,0.0029961688],"study_design_scores_gemma":[0.0007049279,0.000054386353,0.074018046,0.00006437997,0.0000069031407,0.000036250574,0.00025712585,0.92419124,0.0004175746,0.000028107632,0.00011123245,0.000109834684],"about_ca_topic_score_codex":0.0000017270006,"about_ca_topic_score_gemma":0.0000010880018,"teacher_disagreement_score":0.74700546,"about_ca_system_score_codex":0.00016105406,"about_ca_system_score_gemma":0.00008413047,"threshold_uncertainty_score":0.4586314},"labels":[],"label_agreement":null},{"id":"W4387430419","doi":"10.1007/978-981-99-6441-3_1","title":"Crew Scheduling Problem: Integer Optimization Using Set-Covering Model","year":2023,"lang":"en","type":"book-chapter","venue":"Applied economics and policy studies","topic":"Vehicle Routing Optimization Methods","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":"University of Toronto","funders":"","keywords":"Crew scheduling; Crew; Integer programming; Operations research; Scheduling (production processes); Mathematical optimization; Computer science; MATLAB; Linear programming; Job shop scheduling; Branch and price; Engineering; Schedule; Mathematics; Aeronautics; Operating system","score_opus":0.08088362128537244,"score_gpt":0.30145352918369095,"score_spread":0.2205699078983185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387430419","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022991374,0.0024645855,0.5052663,0.00026668605,0.0005147888,0.0010897892,0.00018969276,0.001315126,0.4865939],"genre_scores_gemma":[0.01044339,0.08660607,0.86292887,0.0004100525,0.0014570897,0.000101940735,0.00011048203,0.0010420867,0.036900003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877924,0.0000044698913,0.0004975953,0.0003649992,0.000050791205,0.00030289387],"domain_scores_gemma":[0.99942833,0.00007988007,0.0001568893,0.00021895586,0.000045022887,0.00007094372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002541083,0.0004265937,0.000596287,0.00032821432,0.00017754796,0.000087250424,0.000107287655,0.00026497385,0.0000043607006],"category_scores_gemma":[0.000020287007,0.0005081443,0.000068736816,0.00005145644,0.00007118474,0.00008715442,0.00021843625,0.00027153303,0.0000148421805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022002043,7.331009e-7,6.936177e-7,0.00017088879,0.00029201672,2.3011529e-7,0.0006094667,0.86766726,0.000011269488,0.12985349,0.000039175968,0.0013525566],"study_design_scores_gemma":[0.00016514551,0.0000042077977,3.6063133e-7,0.000113383816,0.00007574337,0.0000023210982,0.000091954666,0.976241,0.00002988473,0.022234773,0.000590155,0.00045105405],"about_ca_topic_score_codex":0.000010702426,"about_ca_topic_score_gemma":0.000009379956,"teacher_disagreement_score":0.4496939,"about_ca_system_score_codex":0.00028082123,"about_ca_system_score_gemma":0.000057208446,"threshold_uncertainty_score":0.999737},"labels":[],"label_agreement":null},{"id":"W4387642517","doi":"10.1111/itor.13387","title":"A hybrid adaptive iterated local search heuristic for the maximal covering location problem","year":2023,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Metaheuristic; Iterated local search; Vehicle routing problem; Mathematical optimization; Heuristic; Iterated function; Local search (optimization); Computer science; Routing (electronic design automation); Mathematics","score_opus":0.09645886260686357,"score_gpt":0.3898434265457198,"score_spread":0.29338456393885626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387642517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054547247,0.00005341535,0.9897565,0.0020422626,0.000432871,0.00079964224,0.00012910373,0.00019886631,0.0011325994],"genre_scores_gemma":[0.9798077,0.00013207579,0.017247092,0.00003334363,0.00018521231,0.00093419396,0.00015738998,0.000048914142,0.0014541277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978613,0.00018506056,0.00038259567,0.00028624723,0.00087949936,0.0004052555],"domain_scores_gemma":[0.9967858,0.0018959796,0.000014568736,0.00016638066,0.0010754958,0.000061758736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024003189,0.00013491984,0.00011412081,0.0006500633,0.00040094327,0.00022375656,0.00039248777,0.000068340465,0.000300616],"category_scores_gemma":[0.00022767816,0.00012649859,0.000055320448,0.0011949912,0.00014864269,0.00034614143,0.000022540617,0.0005755852,0.0001246598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078636534,0.00003511282,0.000041661195,0.000027743281,0.00006427575,0.0000051960264,0.00036935997,0.9792991,0.00044423155,0.0037014936,0.00038511126,0.015548078],"study_design_scores_gemma":[0.0005146154,0.000039431125,0.0009950825,0.000054384265,0.0000043598898,0.000015227112,0.00041575634,0.99318147,0.0015738148,0.00071525195,0.002366769,0.00012381587],"about_ca_topic_score_codex":0.00010426495,"about_ca_topic_score_gemma":0.00006395312,"teacher_disagreement_score":0.9743529,"about_ca_system_score_codex":0.00056610926,"about_ca_system_score_gemma":0.00023819179,"threshold_uncertainty_score":0.51584625},"labels":[],"label_agreement":null},{"id":"W4388740479","doi":"10.1007/978-3-031-38310-6_8","title":"Variable Neighborhood Search","year":2023,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Vehicle Routing Optimization Methods","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":"Royal Military College of Canada","funders":"","keywords":"Heuristics; Variable neighborhood search; Diversity (politics); Variable (mathematics); Mathematical optimization; Descent (aeronautics); Local search (optimization); Computer science; Gradient descent; Metaheuristic; Mathematics; Artificial intelligence; Geography; Sociology","score_opus":0.02533726015697855,"score_gpt":0.252314370603558,"score_spread":0.22697711044657945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388740479","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.778216e-7,0.00042152984,0.649857,0.00007623288,0.00010909594,0.00053081615,0.000060122966,0.0010323289,0.34791252],"genre_scores_gemma":[0.00043456862,0.008238826,0.39599568,0.00013676286,0.00053774845,0.00041621857,0.0006129926,0.0006807695,0.59294647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986826,0.000014012713,0.00039630715,0.00041368115,0.00022924045,0.00026413935],"domain_scores_gemma":[0.9990454,0.00011690525,0.0000722703,0.00040445244,0.0002015395,0.00015948188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024386273,0.00031974365,0.00028887868,0.00029459386,0.00019445334,0.00011328455,0.00019794088,0.00036608527,0.0006706186],"category_scores_gemma":[0.000023565159,0.00038355115,0.000053637097,0.00023592818,0.000036204186,0.00011838125,0.000102238875,0.0003828491,0.0003604355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.7641904e-7,0.0000037326442,0.0000014534846,0.00008364134,0.000040778225,3.158142e-7,0.000025219952,0.65275097,0.000025497095,0.3447676,0.0002710373,0.0020291782],"study_design_scores_gemma":[0.00016263315,0.000007763205,0.0000047287726,0.00006599416,0.000062149156,0.000003527249,0.0000068255476,0.9315531,0.000048499813,0.0025404042,0.065127596,0.00041678033],"about_ca_topic_score_codex":9.883811e-7,"about_ca_topic_score_gemma":5.126158e-7,"teacher_disagreement_score":0.3422272,"about_ca_system_score_codex":0.00007240268,"about_ca_system_score_gemma":0.000050446186,"threshold_uncertainty_score":0.99986166},"labels":[],"label_agreement":null},{"id":"W4388820886","doi":"10.23919/iccas59377.2023.10316850","title":"FS-ACO: An Algorithm for Unsafe U-Turn Detours in Service Vehicle Route Optimization Applications","year":2023,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Intersection (aeronautics); Ant colony optimization algorithms; Vehicle routing problem; Computer science; Routing (electronic design automation); Operator (biology); Mathematical optimization; Algorithm; Service (business); Engineering; Mathematics; Computer network; Transport engineering","score_opus":0.023729412389067395,"score_gpt":0.2939906766645964,"score_spread":0.270261264275529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388820886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028021475,0.000016516313,0.9937421,0.00029996855,0.00014010644,0.0006702028,0.000042452408,0.0015998546,0.0006866611],"genre_scores_gemma":[0.007969516,0.00004042018,0.9902692,0.00020810496,0.00013948737,0.00053988385,0.00035789874,0.000102259255,0.00037323794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989037,0.00004951678,0.00031975107,0.00026264248,0.0001274699,0.00033691133],"domain_scores_gemma":[0.99930114,0.00012861188,0.000037382255,0.0003082999,0.0001221454,0.000102437065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046227538,0.00015837458,0.0001706205,0.00022926994,0.00009232667,0.000058981703,0.00021131124,0.00012735807,0.00004014141],"category_scores_gemma":[0.000025693565,0.00018282194,0.000037482365,0.0016065536,0.000010391546,0.00030460412,0.000031734096,0.00011306741,0.00004830519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017042364,0.00001630348,0.00017871113,0.000027920918,0.000008833885,4.7334055e-7,0.00017102943,0.94500256,0.00032486295,0.00020216088,0.00011981838,0.053945627],"study_design_scores_gemma":[0.00047219277,0.000014077519,0.0006073927,0.000009525852,0.000010528707,0.0000012441652,0.00022260068,0.99593985,0.0009842307,0.00014578701,0.0013779468,0.0002146099],"about_ca_topic_score_codex":0.00004266065,"about_ca_topic_score_gemma":0.00006656522,"teacher_disagreement_score":0.053731017,"about_ca_system_score_codex":0.0000972219,"about_ca_system_score_gemma":0.000026951575,"threshold_uncertainty_score":0.74552625},"labels":[],"label_agreement":null},{"id":"W4388853132","doi":"10.47749/t/unicamp.2022.1254700","title":"Geometric decomposition problems","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Convex hull; Combinatorics; Heuristics; Mathematics; Partition (number theory); Vertex (graph theory); Integer programming; Graph partition; Regular polygon; Algorithm; Discrete mathematics; Mathematical optimization; Graph; Geometry","score_opus":0.012351702519640803,"score_gpt":0.2905012375673073,"score_spread":0.2781495350476665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388853132","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050439354,0.002831946,0.22097231,0.000022257718,0.0062723816,0.0010624173,0.00003756191,0.004562191,0.7137996],"genre_scores_gemma":[0.3199228,0.0019041944,0.46055543,0.0001662894,0.00069467374,0.0012611076,0.028144037,0.0012468768,0.18610457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910986,0.00004138695,0.00026029485,0.00017958148,0.000234518,0.00017436383],"domain_scores_gemma":[0.999628,0.000057803314,0.000051694842,0.00017684868,0.000042364765,0.000043253407],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021430441,0.0001789247,0.000184558,0.0005735612,0.00008685172,0.000043494452,0.00014952921,0.00014703999,0.0048136557],"category_scores_gemma":[0.000027539143,0.00021029497,0.00006904473,0.000938581,0.0000024489339,0.000066198234,0.000011484216,0.0003358667,0.00006004811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032861824,0.000016571781,0.000033066914,0.0003333763,0.000053288186,0.0000030276603,0.00024327623,0.9659273,0.00078253547,0.00016711852,0.0038854307,0.028551716],"study_design_scores_gemma":[0.0008492289,0.000128719,0.0035143795,0.00015236037,0.0002252578,0.00003290025,0.00096908794,0.90438557,0.014375636,0.0005524001,0.07269737,0.0021170762],"about_ca_topic_score_codex":0.000011658724,"about_ca_topic_score_gemma":0.000013355399,"teacher_disagreement_score":0.527695,"about_ca_system_score_codex":0.00015770424,"about_ca_system_score_gemma":0.000019041998,"threshold_uncertainty_score":0.9960961},"labels":[],"label_agreement":null},{"id":"W4389219889","doi":"10.1016/j.ejor.2023.11.047","title":"A multiphase dynamic programming algorithm for the shortest path problem with resource constraints","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"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":"Computer science; Mathematical optimization; Column generation; Linear subspace; Scheduling (production processes); Shortest path problem; Crew scheduling; Dynamic programming; Disjoint sets; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.06122002784236803,"score_gpt":0.36021484830249323,"score_spread":0.2989948204601252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389219889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058774166,0.00013790796,0.9911016,0.0008905168,0.00007251501,0.0006346723,0.000025697334,0.00009432383,0.0011653551],"genre_scores_gemma":[0.2869832,0.000060232025,0.7119371,0.000030417463,0.00029612475,0.000030913125,0.0000277734,0.00009979184,0.000534415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978116,0.00056845695,0.0004045693,0.00013018289,0.0007344742,0.0003507168],"domain_scores_gemma":[0.99775165,0.0011148811,0.000058187994,0.00014419244,0.0008082106,0.00012287966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009159861,0.00010911726,0.0001262341,0.00023519206,0.0003770803,0.00025136088,0.0003454805,0.000018875218,0.000027805761],"category_scores_gemma":[0.00056138233,0.00007173426,0.000055393266,0.0006521112,0.0001941252,0.00014583641,0.000047493428,0.0005259209,0.00002165343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026458154,0.000025259997,0.00006352948,0.00001571067,0.0000741407,0.00012788635,0.0004967756,0.58650464,0.00070450286,0.00008793553,0.001595577,0.41027758],"study_design_scores_gemma":[0.0009178501,0.00030178082,0.00089983054,0.00011549734,0.000010914567,0.00017600095,0.00063759147,0.97726053,0.00009644932,0.0000095965115,0.019472346,0.000101613216],"about_ca_topic_score_codex":4.9708757e-7,"about_ca_topic_score_gemma":8.549822e-7,"teacher_disagreement_score":0.41017595,"about_ca_system_score_codex":0.00007631991,"about_ca_system_score_gemma":0.00014971686,"threshold_uncertainty_score":0.31746435},"labels":[],"label_agreement":null},{"id":"W4389304834","doi":"10.1016/j.cor.2023.106502","title":"A heuristic approach for the integrated production–transportation problem with process flexibility","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"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":"Fundo de Apoio ao Ensino, à Pesquisa e Extensão, Universidade Estadual de Campinas; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Flexibility (engineering); Computer science; Mathematical optimization; Sizing; Production (economics); Heuristic; Process (computing); Integer programming; Linear programming; Investment (military); Operations research; Constraint (computer-aided design); Mathematics; Algorithm; Economics; Artificial intelligence","score_opus":0.09606306208765346,"score_gpt":0.3827119897256506,"score_spread":0.28664892763799715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389304834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03854691,0.000038064176,0.95781475,0.0005998554,0.00012215195,0.0020753795,0.00002107483,0.00067049486,0.00011134189],"genre_scores_gemma":[0.6648911,0.000022701915,0.33251244,0.000011096959,0.00012864928,0.0015908707,0.00038686476,0.000052322648,0.0004039125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985407,0.0001668364,0.0002428558,0.0003405124,0.00036574685,0.0003433284],"domain_scores_gemma":[0.9983617,0.00030444263,0.000010332936,0.0003579759,0.0009069663,0.000058560156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018864211,0.00012478119,0.0001232295,0.00022740503,0.000675284,0.00020457387,0.00028482242,0.000053123735,0.0000063711536],"category_scores_gemma":[0.00020477512,0.000087570246,0.000028686043,0.0024418535,0.00014082619,0.00019192585,0.000013372679,0.0003467273,0.000010396048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001828185,0.00003050857,0.000121286284,0.00018436818,0.00003561208,4.7876154e-7,0.0014224483,0.99185926,0.00025765155,0.00030331072,0.001666938,0.0040998543],"study_design_scores_gemma":[0.00020226899,0.000052171574,0.0009975703,0.000030563584,0.000010449878,0.0000025255479,0.0005983669,0.9968494,0.0007301508,0.00006668749,0.00035007333,0.000109725544],"about_ca_topic_score_codex":0.000024965084,"about_ca_topic_score_gemma":0.000056668472,"teacher_disagreement_score":0.6263442,"about_ca_system_score_codex":0.00009008901,"about_ca_system_score_gemma":0.00015116166,"threshold_uncertainty_score":0.5193807},"labels":[],"label_agreement":null},{"id":"W4389738699","doi":"10.1002/net.22200","title":"Learning to repeatedly solve routing problems","year":2023,"lang":"en","type":"article","venue":"Networks","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","funders":"","keywords":"Heuristics; Benchmark (surveying); Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Focus (optics); Routing (electronic design automation); Optimization problem; Resolution (logic); Combinatorial optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01633280587669093,"score_gpt":0.2509699629027951,"score_spread":0.2346371570261042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389738699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064107895,0.00007429473,0.91853696,0.00011227334,0.0007880369,0.0002570542,5.818101e-7,0.0053420705,0.010780807],"genre_scores_gemma":[0.963487,0.00005497934,0.034629066,0.00008203613,0.00042629658,0.00003496307,0.000021514028,0.00010692328,0.0011572089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896777,0.00005016053,0.00022498769,0.00019390804,0.00012332076,0.00043983824],"domain_scores_gemma":[0.9995381,0.00012131076,0.000024198558,0.00017791841,0.000037705482,0.00010075335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197172,0.00012654261,0.00014043745,0.000103687016,0.00012250664,0.00006401489,0.00012284174,0.00010907206,0.00003168608],"category_scores_gemma":[0.00014875845,0.00014244094,0.000039877985,0.0010542837,0.000007499088,0.000063709755,0.00006719781,0.0003524102,0.00020341213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010541636,0.0000013010601,0.0017537709,0.00001005435,0.000012085009,0.0000039907827,0.0006215654,0.96787703,0.00022127587,0.000037368605,0.0023206023,0.027139928],"study_design_scores_gemma":[0.00009494781,0.000019113484,0.0011761923,0.000061742016,0.000005370688,0.0000023721486,0.000092354894,0.9943155,0.00008365681,0.000018128314,0.00396698,0.00016361118],"about_ca_topic_score_codex":0.0000052696582,"about_ca_topic_score_gemma":0.0000027040344,"teacher_disagreement_score":0.89937913,"about_ca_system_score_codex":0.000048640282,"about_ca_system_score_gemma":0.0000057399357,"threshold_uncertainty_score":0.58085734},"labels":[],"label_agreement":null},{"id":"W4389829004","doi":"10.5267/j.jpm.2023.8.003","title":"A constraint programming approach for multi-objective tourist trip design problem with mandatory visits: A case study for İzmir Turkey","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orienteering; Operations research; Mathematical optimization; Profit (economics); Integer programming; Vehicle routing problem; Computer science; Interval (graph theory); Profit maximization; Constraint programming; Linear programming; Tourism; Programming paradigm; Routing (electronic design automation); Stochastic programming; Mathematics; Geography; Economics; Computer network","score_opus":0.0754302478022522,"score_gpt":0.33967537219242133,"score_spread":0.2642451243901691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389829004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060266606,0.00004551599,0.9847994,0.000012263434,0.00011256597,0.008613649,0.000010419757,0.0002415073,0.0001380042],"genre_scores_gemma":[0.09785769,0.00000986324,0.9004278,0.000008746631,0.000099579556,0.0013285895,0.000005160732,0.00008072648,0.00018182772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820673,0.0002048065,0.00062631734,0.00026465475,0.00029061938,0.000406844],"domain_scores_gemma":[0.9989796,0.00017583033,0.00029706198,0.00018255656,0.00028645995,0.00007847668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037196542,0.00025804108,0.00040165943,0.00061637186,0.00017138744,0.00014568312,0.00019298788,0.000056045257,0.000001292484],"category_scores_gemma":[0.00006590721,0.0002092243,0.00013191768,0.00069129915,0.000027008324,0.00018867622,0.000048339538,0.00019928161,5.165415e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004557655,0.0007963995,0.00022205115,0.0017457437,0.0019881728,0.0015093798,0.009717672,0.89757437,0.000040554136,0.000046470966,0.0018761533,0.08402727],"study_design_scores_gemma":[0.008932811,0.0022618677,0.000077607874,0.00016801339,0.00057091133,0.00085878256,0.050960418,0.9344407,0.00014786224,0.000018685369,0.0011535924,0.00040879383],"about_ca_topic_score_codex":0.000009858226,"about_ca_topic_score_gemma":0.0000044970434,"teacher_disagreement_score":0.09183103,"about_ca_system_score_codex":0.0002338248,"about_ca_system_score_gemma":0.00007716709,"threshold_uncertainty_score":0.8531919},"labels":[],"label_agreement":null},{"id":"W4390103296","doi":"10.5267/j.ijiec.2023.9.011","title":"Heterogeneous multi-drone and helicopter routing problem for reconnaissance","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Drone; Heuristics; Computer science; Orienteering; Routing (electronic design automation); Simulated annealing; Integer programming; Linear programming; Sorting; Mathematical optimization; Real-time computing; Operations research; Algorithm; Engineering; Computer network; Mathematics","score_opus":0.06545099294135076,"score_gpt":0.3112549915261021,"score_spread":0.24580399858475133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08136215,0.00007837799,0.9152245,0.00054777344,0.0023091848,0.00018579862,0.000027314107,0.0002473168,0.000017574346],"genre_scores_gemma":[0.8250827,0.000038022805,0.17393585,0.000021042772,0.00081191526,0.000013725828,0.00001693946,0.000049644415,0.00003016805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990599,0.000019472043,0.00046506457,0.000098936616,0.00018488642,0.00017169926],"domain_scores_gemma":[0.9990773,0.00035117476,0.00013030136,0.00005423964,0.00030584118,0.00008112216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046116175,0.00012563383,0.00018002735,0.00037048358,0.000045424465,0.00009461842,0.00018677805,0.000086893284,0.0000048366637],"category_scores_gemma":[0.00038284727,0.00013855544,0.00007667952,0.00022506295,0.000016233009,0.0001747902,0.000032084517,0.00021662423,0.0000034422198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008976905,0.00000833785,0.00016107908,0.00001044007,0.00013803688,0.000009056687,0.0001610703,0.9837867,0.00085990864,0.00012229996,0.0003831729,0.014350904],"study_design_scores_gemma":[0.0012773235,0.00003720929,0.00018141221,0.00014835065,0.000016846307,0.00010923999,0.000022455602,0.9951139,0.0011295166,0.000058850605,0.0017731353,0.00013172583],"about_ca_topic_score_codex":0.0000013882668,"about_ca_topic_score_gemma":4.861941e-7,"teacher_disagreement_score":0.74372053,"about_ca_system_score_codex":0.000087977205,"about_ca_system_score_gemma":0.000030642837,"threshold_uncertainty_score":0.5650127},"labels":[],"label_agreement":null},{"id":"W4390103319","doi":"10.5267/j.ijiec.2023.9.006","title":"A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Standard deviation; Mathematical optimization; Heuristic; Routing (electronic design automation); Function (biology); Computer science; Variable (mathematics); Genetic algorithm; Operations research; Value (mathematics); Mathematics; Statistics","score_opus":0.05862155019185327,"score_gpt":0.30389646599607206,"score_spread":0.24527491580421878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390103319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012349976,0.00006638548,0.9845008,0.00032611884,0.0020673415,0.00034162303,0.000043036922,0.0002865408,0.000018162655],"genre_scores_gemma":[0.6867553,0.000014694269,0.31223425,0.000014644232,0.00083802384,0.00003495963,0.000027203454,0.000055785542,0.000025161624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986415,0.00004739789,0.0005859514,0.00013206307,0.0003479573,0.00024512343],"domain_scores_gemma":[0.99794954,0.001143925,0.00019778576,0.0000982505,0.00052952743,0.000080949605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087189814,0.00017325449,0.00021201212,0.00038028203,0.00010881006,0.00014498713,0.00046235387,0.00007836742,0.0000029345338],"category_scores_gemma":[0.0012590796,0.00015402038,0.00016459699,0.00040708232,0.000023881219,0.00018655304,0.000054292123,0.0004716604,0.0000043608297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013689878,0.000031720327,0.00019787264,0.000010112966,0.000320107,0.000009039694,0.00035899846,0.9907186,0.00046755574,0.00014397362,0.00049849163,0.007229846],"study_design_scores_gemma":[0.0017743632,0.000027767055,0.0005225512,0.00007631466,0.00004738519,0.00007262172,0.00015055045,0.99618506,0.0005730881,0.000026267115,0.0003946622,0.00014936399],"about_ca_topic_score_codex":0.0000068179093,"about_ca_topic_score_gemma":4.5008255e-7,"teacher_disagreement_score":0.6744053,"about_ca_system_score_codex":0.00019702045,"about_ca_system_score_gemma":0.00008268684,"threshold_uncertainty_score":0.6280769},"labels":[],"label_agreement":null},{"id":"W4390122151","doi":"10.5267/j.ijiec.2023.10.007","title":"The optimal design of differentiated subsidy policies for new energy vehicle firms by considering the difference in market share and endurance mileage","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Transit (satellite); Vehicle routing problem; Routing (electronic design automation); Computer science; Cash; Genetic algorithm; Mathematical optimization; Transport engineering; Engineering; Business; Public transport; Computer network; Finance; Mathematics","score_opus":0.04426574693649306,"score_gpt":0.2758473466521813,"score_spread":0.23158159971568826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390122151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21853903,0.00026599853,0.7791312,0.0009774148,0.0008368614,0.0001377859,0.000048585473,0.000057661862,0.0000054866696],"genre_scores_gemma":[0.9911646,0.00019532471,0.008294492,0.0000127041485,0.00022342442,0.00001187722,0.000010828938,0.000027731236,0.00005899158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989864,0.00006093247,0.00048049566,0.00007772612,0.00022570096,0.00016873522],"domain_scores_gemma":[0.99728024,0.0022801966,0.00015235659,0.00007150073,0.00016243754,0.000053245374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042252103,0.00012128438,0.00017541386,0.00020816531,0.00006242773,0.0000976671,0.00031915956,0.00006812722,0.0000050813865],"category_scores_gemma":[0.0007240525,0.00009291569,0.00005456097,0.00031967193,0.000035316545,0.00009579536,0.000043263943,0.00021972462,1.7094368e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031717573,0.0000067393776,0.0004018454,0.0000050283084,0.00010721169,0.0000022439342,0.0002476454,0.9854309,0.0044174273,0.0001796978,0.002414527,0.006755014],"study_design_scores_gemma":[0.0009770049,0.000027590866,0.0049338206,0.00014101792,0.000013158937,0.000015120002,0.0000879792,0.9901813,0.0029102867,0.00010346849,0.00051890395,0.00009035116],"about_ca_topic_score_codex":0.000027205038,"about_ca_topic_score_gemma":0.000004147953,"teacher_disagreement_score":0.7726256,"about_ca_system_score_codex":0.000058574624,"about_ca_system_score_gemma":0.000057009405,"threshold_uncertainty_score":0.3788992},"labels":[],"label_agreement":null},{"id":"W4390826113","doi":"10.1080/23302674.2023.2301610","title":"Heuristic approach for optimising reliable supply chain network using drones in last-mile delivery under uncertainty","year":2024,"lang":"en","type":"article","venue":"International Journal of Systems Science Operations & Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Drone; Last mile (transportation); Supply chain; Computer science; Supply chain network; Reliability (semiconductor); Operations research; Stochastic programming; Heuristic; Supply chain management; Reliability engineering; Engineering; Mile; Business; Mathematical optimization; Marketing","score_opus":0.04302151775393111,"score_gpt":0.3164280432353582,"score_spread":0.27340652548142713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390826113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017223774,0.0009831464,0.9771624,0.00007495297,0.00401722,0.00021909416,0.000038468777,0.00004747318,0.0002334695],"genre_scores_gemma":[0.6901534,0.00007635435,0.30909145,0.000019015155,0.000555395,0.000008352613,0.000009723353,0.000020798108,0.000065487824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812096,0.000058909114,0.000768441,0.00020409109,0.00055156765,0.00029605418],"domain_scores_gemma":[0.9984946,0.00027417843,0.00008903322,0.0001239314,0.00093358604,0.000084659034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023738726,0.000146221,0.00022567087,0.0005098925,0.00018187091,0.0008054953,0.00050090376,0.000071316215,0.000006472167],"category_scores_gemma":[0.00040983252,0.00013730336,0.000063207684,0.0007169051,0.00016251684,0.00061033794,0.000048786853,0.00023477411,0.0000017171716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064953147,0.000019551744,0.00023377976,0.00004282176,0.000034140183,0.000013299814,0.00013468546,0.98949355,0.0019999929,0.007579746,0.0002273814,0.00021453056],"study_design_scores_gemma":[0.00019805518,0.000027578137,0.000056637415,0.00038826693,0.000022425924,0.00019946207,0.00036466532,0.998094,0.00005709029,0.00021903131,0.00023135824,0.00014137808],"about_ca_topic_score_codex":0.00009845571,"about_ca_topic_score_gemma":0.000021536642,"teacher_disagreement_score":0.67292964,"about_ca_system_score_codex":0.00082568824,"about_ca_system_score_gemma":0.0004837089,"threshold_uncertainty_score":0.77674097},"labels":[],"label_agreement":null},{"id":"W4390862194","doi":"10.1016/j.ejor.2024.05.031","title":"A competitive heuristic algorithm for vehicle routing problems with drones","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"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":"China Scholarship Council; Northwestern Polytechnical University; Northwestern University","keywords":"Vehicle routing problem; Drone; Computer science; Heuristic; Routing (electronic design automation); Mathematical optimization; Algorithm; Operations research; Artificial intelligence; Mathematics; Computer network","score_opus":0.06020974464802066,"score_gpt":0.34766038793449233,"score_spread":0.2874506432864717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390862194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062183756,0.00079766015,0.9835933,0.0005143378,0.00023051737,0.00025615082,0.00002095149,0.00007763385,0.008291068],"genre_scores_gemma":[0.6962597,0.00005990385,0.30223745,0.000019136434,0.0007147775,0.0000080500795,0.000009737559,0.00009008173,0.00060120266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809784,0.000531159,0.00038011873,0.00013630858,0.00059129874,0.0002632989],"domain_scores_gemma":[0.9981437,0.0007371341,0.000030584903,0.00008267469,0.0008982262,0.00010772924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005249176,0.00010390734,0.00014028895,0.00025318022,0.00018364101,0.00036942936,0.00019959717,0.000016948108,0.000055609424],"category_scores_gemma":[0.00032165044,0.00008227378,0.000051809722,0.00038553224,0.000074791285,0.00026626507,0.000032396172,0.0005037017,0.000037334532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004863769,0.000060637674,0.00009466954,0.0002517257,0.00027263854,0.00040879348,0.0020145401,0.8450232,0.007009054,0.019370008,0.0030511704,0.122394934],"study_design_scores_gemma":[0.0005041937,0.0004218122,0.00043705496,0.0004924432,0.000012393752,0.00018428713,0.00021831143,0.9807534,0.00078967115,0.00009437038,0.015968565,0.00012348461],"about_ca_topic_score_codex":8.265835e-7,"about_ca_topic_score_gemma":6.739134e-7,"teacher_disagreement_score":0.6900413,"about_ca_system_score_codex":0.00010975595,"about_ca_system_score_gemma":0.00016426592,"threshold_uncertainty_score":0.35624158},"labels":[],"label_agreement":null},{"id":"W4391407522","doi":"10.1007/978-3-031-53025-8_6","title":"A Pattern Mining Heuristic for the Extension of Multi-trip Vehicle Routing","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Vehicle Routing Optimization Methods","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":"Queen's University","funders":"","keywords":"Extension (predicate logic); Vehicle routing problem; Computer science; Heuristic; Routing (electronic design automation); Information retrieval; Artificial intelligence; Computer network; Programming language","score_opus":0.06408659692197742,"score_gpt":0.32001787985576213,"score_spread":0.2559312829337847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391407522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001400677,0.0010152753,0.9882924,0.00015788087,0.00032092212,0.00036901652,0.000021808992,0.00009455596,0.009588102],"genre_scores_gemma":[0.5187801,0.002510863,0.4774317,0.00025539412,0.00006372827,0.00005823963,0.00004936831,0.000042125273,0.00080842647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905515,0.00001187622,0.00053804857,0.00010791699,0.00016308592,0.0001239185],"domain_scores_gemma":[0.99818987,0.0006491365,0.00013147289,0.0007767775,0.0002240225,0.000028713528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012236496,0.00012211892,0.00015567336,0.00034068077,0.0002186258,0.0001524234,0.0007273645,0.000070447626,0.0000023488444],"category_scores_gemma":[0.00009660017,0.000104783554,0.000037379057,0.00021583756,0.00029905638,0.0007085238,0.00045662487,0.00022684078,0.0000055645783],"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.0000016994841,0.0000066175508,0.000055013956,0.00025973533,0.000017786342,1.3900676e-7,0.005654463,0.22763354,0.000024683975,0.029782685,0.00012021618,0.7364434],"study_design_scores_gemma":[0.0001306104,0.000010428339,0.00031614752,0.00032378995,0.000012640487,0.0000041608205,0.000060731007,0.99222493,0.000014882469,0.0002455822,0.0065485975,0.0001074758],"about_ca_topic_score_codex":0.000003918608,"about_ca_topic_score_gemma":0.0000030302947,"teacher_disagreement_score":0.7645914,"about_ca_system_score_codex":0.000060875424,"about_ca_system_score_gemma":0.000044429842,"threshold_uncertainty_score":0.42729494},"labels":[],"label_agreement":null},{"id":"W4391486815","doi":"10.1016/j.eng.2023.10.014","title":"Unmanned Aerial Vehicle Inspection Routing and Scheduling for Engineering Management","year":2024,"lang":"en","type":"article","venue":"Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"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 Natural Science Foundation of China","keywords":"Scalability; Computer science; Scheduling (production processes); Vehicle routing problem; Integer programming; Metaheuristic; Routing (electronic design automation); Variable neighborhood search; Real-time computing; Engineering; Artificial intelligence; Algorithm; Embedded system","score_opus":0.008557602085211521,"score_gpt":0.23182048571791994,"score_spread":0.2232628836327084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391486815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13380396,0.000894857,0.85941976,0.000033888435,0.0017664343,0.00027722516,0.00000477995,0.0036164278,0.00018267364],"genre_scores_gemma":[0.75888586,0.000061377934,0.24036317,0.0000050775693,0.00045934715,0.000067174275,0.00000723055,0.00011908395,0.00003168135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895674,0.000007024052,0.00027123498,0.0002764134,0.00011422434,0.00037438437],"domain_scores_gemma":[0.99962074,0.00012258672,0.000010468131,0.00014141967,0.000019107301,0.00008567084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037046036,0.00022927942,0.00017849072,0.00026957405,0.0000756341,0.0001982623,0.00008461246,0.000093387294,0.0000050721246],"category_scores_gemma":[0.000069009424,0.00027782962,0.000062326806,0.0003592552,0.000007333415,0.0002479544,0.000043762284,0.00020325699,0.000006796784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031530963,0.0000026105079,0.000017288614,0.00064408494,0.000084528896,0.0000066963157,0.00020354112,0.9730672,0.013014338,0.0058473093,0.000027559394,0.0070816916],"study_design_scores_gemma":[0.0002930072,0.000014312822,0.00019319689,0.00026485155,0.000036612648,0.000011691529,0.000039328956,0.9908848,0.005068999,0.000021028292,0.0028801046,0.0002920986],"about_ca_topic_score_codex":0.0000018088913,"about_ca_topic_score_gemma":3.3916496e-7,"teacher_disagreement_score":0.6250819,"about_ca_system_score_codex":0.00013275402,"about_ca_system_score_gemma":0.0000054284797,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W4391608031","doi":"10.4236/wjet.2024.121009","title":"Optimizing a Transportation System Using Metaheuristics Approaches (EGD/GA/ACO): A Forest Vehicle Routing Case Study","year":2024,"lang":"en","type":"article","venue":"World Journal of Engineering and Technology","topic":"Vehicle Routing Optimization Methods","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":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Metaheuristic; Vehicle routing problem; Ant colony optimization algorithms; Routing (electronic design automation); Computer science; Transport engineering; Mathematical optimization; Operations research; Engineering; Algorithm; Computer network; Mathematics","score_opus":0.02713596508855586,"score_gpt":0.24900663179514645,"score_spread":0.22187066670659059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391608031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59287286,0.0025190024,0.40353146,0.000025128948,0.00037208412,0.00011068616,0.0000023311682,0.0005439815,0.000022467679],"genre_scores_gemma":[0.8622562,0.000016759444,0.13754937,9.721516e-7,0.00010071918,0.0000049907017,6.084993e-7,0.000063789645,0.0000065747827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987858,0.000030381001,0.0006177243,0.00016739337,0.00013918079,0.000259498],"domain_scores_gemma":[0.9994846,0.00013429698,0.00009137563,0.0001412714,0.000073562194,0.00007491687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000687033,0.00021180413,0.00037728544,0.0011638036,0.0000802217,0.00009319784,0.00011365839,0.0001089133,9.859119e-7],"category_scores_gemma":[0.00005917709,0.00021027573,0.00006487182,0.0011627038,0.000026268066,0.00017098259,0.000016519478,0.0005793164,3.898225e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029188413,0.000017969625,0.0013863595,0.0003251487,0.00022105049,0.0027813457,0.00080563745,0.98786193,0.0011710515,0.0017060022,0.0000031996674,0.0037173582],"study_design_scores_gemma":[0.00031337127,0.0000653551,0.00006561112,0.00037991974,0.0002562585,0.0043557878,0.0026103104,0.9912781,0.00036905444,0.0000144179285,0.00010335426,0.00018846938],"about_ca_topic_score_codex":0.000010023807,"about_ca_topic_score_gemma":0.000014239364,"teacher_disagreement_score":0.26938337,"about_ca_system_score_codex":0.00012210026,"about_ca_system_score_gemma":0.000024406409,"threshold_uncertainty_score":0.8574795},"labels":[],"label_agreement":null},{"id":"W4391677279","doi":"10.1016/j.swevo.2024.101507","title":"A customized adaptive large neighborhood search algorithm for solving a multi-objective home health care problem in a pandemic environment","year":2024,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"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":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; Ministry of Education of the People's Republic of China","keywords":"Computer science; Heuristics; Workload; Pareto principle; Simulated annealing; Mathematical optimization; Heuristic; Multi-objective optimization; Constraint programming; Vehicle routing problem; Context (archaeology); Scheduling (production processes); Solver; Operations research; Algorithm; Routing (electronic design automation); Machine learning; Artificial intelligence; Stochastic programming; Mathematics","score_opus":0.017681700088664726,"score_gpt":0.28390980542097294,"score_spread":0.26622810533230823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391677279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075775366,0.007404803,0.9834128,0.00006575233,0.00015463449,0.00091910653,0.000108932545,0.00032515955,0.00003129208],"genre_scores_gemma":[0.5500175,0.0001881462,0.44944733,0.000015409774,0.000053051805,0.00011497107,0.0001199088,0.00003156887,0.000012142914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988171,0.00011491883,0.0002836473,0.00031519597,0.00014425961,0.0003248767],"domain_scores_gemma":[0.99958974,0.00020781036,0.000027517972,0.000057511483,0.000045363235,0.00007202779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046662896,0.00015894594,0.00020918678,0.00024734857,0.00014069382,0.000036063873,0.000042788928,0.00008211342,0.00000365619],"category_scores_gemma":[0.000008680642,0.00017446389,0.000049478105,0.00024501013,0.00002372224,0.0001881532,0.000037430065,0.00020283498,0.000005704744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002463769,0.000035792287,0.00046561132,0.00023232742,0.00004293978,0.0000026023606,0.009170112,0.85710454,0.000033526117,0.0001474417,0.00006822109,0.13267228],"study_design_scores_gemma":[0.0016433257,0.00009913615,0.0048981933,0.00013377429,0.000011344591,0.000010525623,0.001700133,0.9906074,0.000009001088,0.00064684876,0.0000639433,0.0001764072],"about_ca_topic_score_codex":0.000030967425,"about_ca_topic_score_gemma":0.000008128372,"teacher_disagreement_score":0.54243994,"about_ca_system_score_codex":0.00077613525,"about_ca_system_score_gemma":0.00012397308,"threshold_uncertainty_score":0.71144307},"labels":[],"label_agreement":null},{"id":"W4392135127","doi":"10.1016/j.eswa.2024.123561","title":"An efficient hybrid adaptive large neighborhood search method for the capacitated team orienteering problem","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"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é Laval; Air Liquide (Canada)","funders":"","keywords":"Orienteering; Computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.017482284406608904,"score_gpt":0.3035203629416793,"score_spread":0.28603807853507035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392135127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017232315,0.0022053998,0.991842,0.0000955199,0.00021509793,0.0030394925,0.00013063525,0.0012441049,0.0010554527],"genre_scores_gemma":[0.64320374,0.000017222004,0.34776148,0.000019073694,0.00030242195,0.008379926,0.000050310395,0.00012759426,0.000138258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849325,0.00011918689,0.00032055913,0.00040467436,0.00025299686,0.000409335],"domain_scores_gemma":[0.99859256,0.00050677586,0.000032508106,0.0005573609,0.00018765985,0.00012315474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010097948,0.00022000473,0.0002034145,0.00012335261,0.00035811734,0.00021978136,0.00028846462,0.000058362428,0.00000776637],"category_scores_gemma":[0.000012347387,0.00015497618,0.000055173317,0.0006572804,0.000032159674,0.00010826106,0.000022320704,0.00021777186,0.000021516003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075172698,0.000040947372,0.000007947539,0.00013006487,0.000120101686,8.404948e-7,0.0028806438,0.96414596,0.001774463,0.027223071,0.0006909812,0.0029774588],"study_design_scores_gemma":[0.00021436081,0.000050860253,0.00000547265,0.00009244237,0.000026968331,0.000037418416,0.0022072894,0.96360075,0.0014311644,0.000022948743,0.032104146,0.0002061655],"about_ca_topic_score_codex":0.00005576304,"about_ca_topic_score_gemma":0.000004050108,"teacher_disagreement_score":0.64408046,"about_ca_system_score_codex":0.00017745454,"about_ca_system_score_gemma":0.00006491375,"threshold_uncertainty_score":0.6319745},"labels":[],"label_agreement":null},{"id":"W4392587943","doi":"10.5194/egusphere-egu24-1959","title":"SWOT Level-3 Overview algorithms and examples","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"SWOT analysis; Computer science; Algorithm; Economics; Management","score_opus":0.10961080565806787,"score_gpt":0.3271106569669713,"score_spread":0.21749985130890342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392587943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074154474,0.039455745,0.9051522,0.00037411743,0.0031550163,0.00052588806,0.00018275129,0.0038514817,0.03988738],"genre_scores_gemma":[0.015668338,0.0038424835,0.9765929,0.00009319611,0.00034425082,0.000048389644,0.00004840384,0.00016870022,0.0031933382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899495,0.00004750554,0.00027402982,0.0003468236,0.00014097482,0.00019572329],"domain_scores_gemma":[0.9994309,0.00009652354,0.000022426915,0.0003389417,0.000032080316,0.000079143814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037989375,0.0002692111,0.00030465075,0.000120682664,0.000024243325,0.00017449073,0.00014906045,0.0002611407,0.00024320891],"category_scores_gemma":[0.000038400263,0.0002610887,0.00006740266,0.000118842276,0.000022707049,0.000026140555,0.0007332951,0.0005820778,0.00006344366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010373818,0.000010540028,0.000105357154,0.00508762,0.00031406808,0.000021346345,0.0006694568,0.68881524,0.00016925168,0.0069402372,0.009056157,0.2888097],"study_design_scores_gemma":[0.00007671793,0.0000046916307,0.0004952023,0.00036856855,0.00006449305,0.000012777094,0.00002601653,0.97940916,0.0004605189,0.008191594,0.010465947,0.00042429916],"about_ca_topic_score_codex":0.00005517263,"about_ca_topic_score_gemma":0.000009294184,"teacher_disagreement_score":0.29059395,"about_ca_system_score_codex":0.000056283352,"about_ca_system_score_gemma":0.000028995692,"threshold_uncertainty_score":0.99998415},"labels":[],"label_agreement":null},{"id":"W4392784336","doi":"10.1142/s1793830924300017","title":"Proposed theoretical value for TSP constant","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","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":"University of British Columbia","funders":"","keywords":"Constant (computer programming); Value (mathematics); Mathematics; Computer science; Statistics","score_opus":0.012324863491558058,"score_gpt":0.28830243177306103,"score_spread":0.275977568281503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392784336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022778701,0.0004343488,0.99206537,0.00022324044,0.000056160858,0.0008100977,0.00011401261,0.00048038733,0.0055885767],"genre_scores_gemma":[0.08645752,0.000113063295,0.9124541,0.000023320672,0.00014837758,0.00057290454,0.00004473531,0.000073457624,0.00011248422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931014,0.00000968857,0.0002400116,0.00017899586,0.00009404349,0.00016709701],"domain_scores_gemma":[0.999392,0.00029143013,0.000016761269,0.00018859643,0.000037330734,0.00007392971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028523142,0.00012933234,0.00014669095,0.00003796216,0.00010019012,0.00015279526,0.00008693524,0.00006154288,0.000021993554],"category_scores_gemma":[0.000026837202,0.00010948199,0.000051833278,0.00017685564,0.00012305185,0.00004705038,0.000022365572,0.00008968273,0.000011792136],"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":[3.749764e-7,0.000011840994,6.1887437e-7,0.00036316251,0.000031617164,3.3519444e-7,0.00026407297,0.0024741727,0.0004245486,0.974249,0.00007955426,0.02210069],"study_design_scores_gemma":[0.00008750162,0.000010264957,0.0000011397017,0.000048268015,0.00004410609,0.000009298746,0.00013276124,0.8632871,0.00081337866,0.12820145,0.0072316173,0.00013313713],"about_ca_topic_score_codex":3.4872278e-7,"about_ca_topic_score_gemma":8.856168e-8,"teacher_disagreement_score":0.8608129,"about_ca_system_score_codex":0.000019919536,"about_ca_system_score_gemma":0.000014338866,"threshold_uncertainty_score":0.44645458},"labels":[],"label_agreement":null},{"id":"W4393121399","doi":"10.5267/j.ijiec.2024.1.003","title":"A GRASP algorithm for the bus crew scheduling problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"GRASP; Crew scheduling; Crew; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Algorithm; Engineering; Mathematics; Embedded system; Aeronautics; Programming language","score_opus":0.03539057958593704,"score_gpt":0.3015435518242727,"score_spread":0.26615297223833567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010431906,0.00090304605,0.9890439,0.0017198842,0.0068327165,0.00017533389,0.000028412,0.00021537059,0.000038135473],"genre_scores_gemma":[0.2157877,0.0000922841,0.77972496,0.000031211017,0.0042052143,0.00002669986,0.000015431384,0.00007939465,0.000037094538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989474,0.000018861447,0.00047429412,0.00009057426,0.00031588683,0.0001529862],"domain_scores_gemma":[0.9983336,0.0010692565,0.00007389113,0.00006699717,0.00039343993,0.000062825144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006230777,0.00013404439,0.00014807646,0.0003436969,0.000049669394,0.00029225202,0.00036120418,0.00008779522,0.000012662694],"category_scores_gemma":[0.00028523162,0.00011105654,0.00016316421,0.00032429106,0.000016661863,0.00023750657,0.000024542123,0.00044805033,0.0000040762743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028030279,0.000006516749,0.0000041142875,0.000009087829,0.0003428343,0.000009927165,0.0001444406,0.83438146,0.00015081246,0.00084500824,0.00076885615,0.16333416],"study_design_scores_gemma":[0.00045741195,0.000028057377,0.0000146082875,0.0002711724,0.000057888326,0.00014242278,0.000043061562,0.9854287,0.00030007688,0.00024077967,0.012906604,0.00010924493],"about_ca_topic_score_codex":0.0000026066593,"about_ca_topic_score_gemma":2.2679579e-7,"teacher_disagreement_score":0.21474451,"about_ca_system_score_codex":0.00016406045,"about_ca_system_score_gemma":0.000112454654,"threshold_uncertainty_score":0.45287544},"labels":[],"label_agreement":null},{"id":"W4393128897","doi":"10.1016/j.ejor.2024.03.031","title":"Vehicle routing with stochastic demand, service and waiting times — The case of food bank collection problems","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","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":true,"ca_institutions":"HEC Montréal","funders":"HORIZON EUROPE Framework Programme","keywords":"Vehicle routing problem; Computer science; Service (business); Operations research; Routing (electronic design automation); Limit (mathematics); Set (abstract data type); Plan (archaeology); Variety (cybernetics); Mathematical optimization; Business; Marketing; Computer network; Mathematics","score_opus":0.050957089695265,"score_gpt":0.31425548329844916,"score_spread":0.26329839360318413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393128897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.855931,0.0012462756,0.13908948,0.0009950144,0.000093665076,0.00022252653,0.0000054049547,0.00003751348,0.0023791178],"genre_scores_gemma":[0.9921849,0.000022430508,0.0074931365,0.000012089894,0.00017076526,0.0000020749717,0.0000010471625,0.00003788109,0.00007568519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998266,0.00075562386,0.00035512532,0.00009996555,0.00035966164,0.00016364167],"domain_scores_gemma":[0.9983995,0.0007408914,0.000045757024,0.00007891728,0.0006702785,0.00006468091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057128794,0.000080956794,0.00010679028,0.000187806,0.00031808196,0.00023593634,0.000117483476,0.000015586873,0.000033935554],"category_scores_gemma":[0.00034350398,0.000054206972,0.00002264771,0.00065500726,0.000057955887,0.00022925866,0.0000473688,0.00049204443,0.000004826034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000222631,0.000009547867,0.000042182754,0.00012543406,0.000091952556,0.00019981769,0.00213764,0.9886537,0.003934674,0.0013271812,0.00015895617,0.0032966088],"study_design_scores_gemma":[0.0002933924,0.00028005356,0.00023707423,0.0003580544,0.000016600832,0.0025657692,0.0006239969,0.9946058,0.00082676613,0.00004084275,0.00008783676,0.000063845306],"about_ca_topic_score_codex":0.0000068212175,"about_ca_topic_score_gemma":0.000014658362,"teacher_disagreement_score":0.13625388,"about_ca_system_score_codex":0.00005077331,"about_ca_system_score_gemma":0.000097930664,"threshold_uncertainty_score":0.24464615},"labels":[],"label_agreement":null},{"id":"W4393236743","doi":"10.1016/j.cor.2024.106632","title":"Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","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":"HEC Montréal","funders":"Ministerio de Ciencia e Innovación; European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades","keywords":"Travelling salesman problem; Computer science; Service (business); Traveling purchaser problem; Operations research; Mathematical optimization; Bottleneck traveling salesman problem; Mathematics; Algorithm; Business; Marketing","score_opus":0.07149047988899913,"score_gpt":0.347697424587011,"score_spread":0.2762069446980118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393236743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39206812,0.0012782472,0.60311496,0.0018402427,0.000086038766,0.00074623455,0.0000072622465,0.0002732487,0.0005856325],"genre_scores_gemma":[0.75103974,0.00005992627,0.2486216,0.000055201977,0.000064827196,0.00003892155,0.000009678348,0.000028136312,0.000081960214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876785,0.00035895887,0.00016638268,0.00023703986,0.00022000939,0.00024975758],"domain_scores_gemma":[0.9992039,0.00047943168,0.0000029795976,0.00013219855,0.00013260383,0.000048891652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014015983,0.00010203279,0.000101102545,0.0002269207,0.00025421949,0.0006575556,0.00016571996,0.000058950027,0.000005602385],"category_scores_gemma":[0.000056853976,0.00008652448,0.000012047575,0.00087867223,0.00005749582,0.00022126189,0.00008483104,0.00046014017,0.00001680732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028116372,0.000026500507,0.00013956317,0.00014886977,0.00003148673,0.000017149534,0.017846188,0.94369566,0.0129746655,0.0005685204,0.00019484789,0.024353707],"study_design_scores_gemma":[0.00014726387,0.000028867113,0.0011272649,0.00009830446,0.0000040967875,0.000036950587,0.00038554228,0.99739224,0.0005029876,0.000055236884,0.00012731936,0.000093957286],"about_ca_topic_score_codex":0.00004821915,"about_ca_topic_score_gemma":0.0001990815,"teacher_disagreement_score":0.35897163,"about_ca_system_score_codex":0.00007864873,"about_ca_system_score_gemma":0.000049085254,"threshold_uncertainty_score":0.6340824},"labels":[],"label_agreement":null},{"id":"W4393302837","doi":"10.1155/2024/8753106","title":"Modification of the Clarke and Wright Algorithm with a Dynamic Savings Matrix","year":2024,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agentúra na Podporu Výskumu a Vývoja","keywords":"Wright; Algorithm; Matrix (chemical analysis); Computer science; Mathematics; Materials science","score_opus":0.005119081544223749,"score_gpt":0.25660713447021577,"score_spread":0.251488052925992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393302837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.408827,0.0009533279,0.58985627,0.00008410399,0.00016216266,0.00006815771,0.000007458942,0.000028486833,0.00001301081],"genre_scores_gemma":[0.7359462,0.00026702214,0.26373,0.0000028681368,0.00001551567,0.0000013906958,0.000003198174,0.000016832197,0.000017017499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938315,0.000018348883,0.00031109696,0.000060925482,0.00016399722,0.00006246209],"domain_scores_gemma":[0.9996533,0.00004692255,0.000111539885,0.000066440276,0.00009713307,0.000024667817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017933898,0.00007119838,0.0001131933,0.00008894227,0.000022680448,0.00001487914,0.00005634177,0.000035872166,0.0000038428534],"category_scores_gemma":[0.000006801124,0.000048172882,0.00004119643,0.0002581482,0.000024875024,0.00028451142,6.448017e-7,0.00015344165,1.7084379e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017144224,0.000006580975,0.00021969042,0.00015005472,0.00003898658,0.0000043247533,0.0011988549,0.9196857,0.019892773,0.0002059751,0.0000036683105,0.058576226],"study_design_scores_gemma":[0.0009651476,0.00014125516,0.1529655,0.0009072589,0.00025542092,0.00009092224,0.0004948764,0.8294499,0.012439963,0.0013366141,0.0007412703,0.00021186603],"about_ca_topic_score_codex":7.948079e-7,"about_ca_topic_score_gemma":0.0000045277666,"teacher_disagreement_score":0.32711917,"about_ca_system_score_codex":0.00003480118,"about_ca_system_score_gemma":0.000023409684,"threshold_uncertainty_score":0.19644332},"labels":[],"label_agreement":null},{"id":"W4393352772","doi":"10.3390/systems12040117","title":"Resilient Network Design: Disjoint Shortest Path Problem for Power Transmission Application","year":2024,"lang":"en","type":"article","venue":"Systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Computer science; Disjoint sets; Redundancy (engineering); Constrained Shortest Path First; Mathematical optimization; Integer programming; Routing (electronic design automation); Path (computing); Distributed computing; K shortest path routing; Graph; Algorithm; Theoretical computer science; Computer network; Mathematics","score_opus":0.016956475143771035,"score_gpt":0.260923422866855,"score_spread":0.24396694772308397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393352772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014994145,0.0038324767,0.99229145,0.00006187321,0.00067977246,0.0014262773,0.0000075456232,0.0009195686,0.0006311014],"genre_scores_gemma":[0.7325509,0.000047814156,0.26597068,0.0000069269176,0.00022556787,0.00069867435,0.00002801082,0.00009671164,0.0003747012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899244,0.00007467745,0.00032302208,0.00023424184,0.00013483167,0.00024078118],"domain_scores_gemma":[0.9995172,0.00015006292,0.00002233278,0.000199841,0.00003885167,0.0000717282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008715636,0.00013644295,0.00015763371,0.000046408335,0.00006481881,0.00010086897,0.00008703874,0.00009493186,0.0000060533034],"category_scores_gemma":[0.000009631902,0.000121455545,0.000057952584,0.0002538981,0.000008221167,0.000070897506,0.0000069308167,0.000092268216,0.000019958812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004929157,0.0000060582056,0.000015657164,0.0003397136,0.000020465855,9.890502e-7,0.00025442417,0.9794478,0.0035383238,0.0011002633,0.0046249568,0.0106464485],"study_design_scores_gemma":[0.000078761375,0.000033860608,0.00002483943,0.00033063212,0.000016751244,0.000006047845,0.000024047386,0.9420491,0.00033999153,0.00020556859,0.0567477,0.00014271907],"about_ca_topic_score_codex":0.0000028962484,"about_ca_topic_score_gemma":2.828054e-7,"teacher_disagreement_score":0.73240095,"about_ca_system_score_codex":0.00009692053,"about_ca_system_score_gemma":0.000021398877,"threshold_uncertainty_score":0.49528134},"labels":[],"label_agreement":null},{"id":"W4394693707","doi":"10.1016/j.ejor.2024.04.007","title":"An exact method for a last-mile delivery routing problem with multiple deliverymen","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","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é Laval","funders":"Alliance de recherche numérique du Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Mile; Computer science; Last mile (transportation); Routing (electronic design automation); Mathematical optimization; Operations research; Mathematics; Computer network; Geography","score_opus":0.06314009654853942,"score_gpt":0.3729746432483227,"score_spread":0.3098345466997833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394693707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049577493,0.0003678884,0.9466432,0.00020326718,0.000121546625,0.00028629377,0.000020183707,0.00009460531,0.0026855739],"genre_scores_gemma":[0.44636765,0.000030998017,0.55294394,0.00001917871,0.00039228253,0.0000064475153,0.000010321599,0.000073050796,0.00015608298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706227,0.0012443261,0.0004704147,0.00020282809,0.0006828247,0.00033733662],"domain_scores_gemma":[0.9973205,0.00121892,0.000041460004,0.00014578605,0.0010922528,0.00018112505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010227422,0.00013780335,0.00017178229,0.0003721526,0.00022997783,0.00049659936,0.00032758876,0.00002787591,0.00007255447],"category_scores_gemma":[0.00040358966,0.00011069813,0.00007068932,0.00042983194,0.00004041821,0.000656154,0.000039836894,0.00058579125,0.000025448908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108455824,0.000038052876,0.0002552815,0.000093611096,0.00012897405,0.00013792104,0.0010326728,0.92532194,0.034508437,0.00064039504,0.0017741341,0.035960123],"study_design_scores_gemma":[0.0006007204,0.000601595,0.00062250724,0.00024203195,0.000015885129,0.00016826906,0.00024346015,0.9861265,0.0026000012,0.0000312828,0.008601885,0.00014589762],"about_ca_topic_score_codex":0.0000037177872,"about_ca_topic_score_gemma":0.0000044747485,"teacher_disagreement_score":0.39679018,"about_ca_system_score_codex":0.00015032676,"about_ca_system_score_gemma":0.00024889057,"threshold_uncertainty_score":0.4788719},"labels":[],"label_agreement":null},{"id":"W4394744190","doi":"10.2139/ssrn.4763354","title":"A Mathheuristic Approach for the Vehicle Routing Problem with Queuing Considerations","year":2024,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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é du Québec à Trois-Rivières; Université Laval","funders":"","keywords":"Download; Computer science; Queueing theory; Routing (electronic design automation); Computer network; World Wide Web","score_opus":0.01250580493827293,"score_gpt":0.2464209292636225,"score_spread":0.23391512432534955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394744190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002239475,0.0037049663,0.9917446,0.0004742914,0.00011779666,0.0003247248,0.000002647411,0.00035298784,0.0010385601],"genre_scores_gemma":[0.8912288,0.00028072024,0.10772906,0.000025537558,0.0002837619,0.000059590042,0.0000028945865,0.00007858906,0.00031102585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982192,0.000062549574,0.00025425447,0.00015514894,0.00015295275,0.0011559012],"domain_scores_gemma":[0.99924797,0.00047217158,0.00003762275,0.00012702099,0.00007206202,0.000043133205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021024416,0.00014772404,0.00012747303,0.00007695095,0.00041939423,0.00035703182,0.00012004688,0.00005057745,0.000008269534],"category_scores_gemma":[0.00009681506,0.00010042102,0.000068417416,0.00024329817,0.000030957464,0.00016466594,0.000012495397,0.0012355269,0.0000037580307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066049142,0.000008966751,0.000055702523,0.00006029253,0.00026268975,0.0000022577522,0.00052432483,0.796202,0.0003164692,0.19129524,0.00012214288,0.0111432895],"study_design_scores_gemma":[0.00024845646,0.00006138243,0.000013105522,0.00005145517,0.00009541358,0.0007809625,0.00084953755,0.9698675,0.00008881893,0.027455688,0.0003400273,0.00014760716],"about_ca_topic_score_codex":0.0000064225246,"about_ca_topic_score_gemma":0.000029532743,"teacher_disagreement_score":0.8889893,"about_ca_system_score_codex":0.0004383951,"about_ca_system_score_gemma":0.00065054116,"threshold_uncertainty_score":0.53678185},"labels":[],"label_agreement":null},{"id":"W4394910141","doi":"10.1016/j.ejor.2024.04.011","title":"A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"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; Polytechnique Montréal","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; Ministry of Education - Singapore","keywords":"Vehicle routing problem; Solver; Computer science; Algorithm; Monotone polygon; Queue; Mathematical optimization; Genetic algorithm; Computation; Routing (electronic design automation); Dynamic programming; Mathematics","score_opus":0.046085922399229394,"score_gpt":0.34650779066864007,"score_spread":0.3004218682694107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394910141","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02088133,0.0025001725,0.9748149,0.00083673006,0.00012721159,0.0006346604,0.00002195121,0.00007215312,0.00011091887],"genre_scores_gemma":[0.41469133,0.0000840395,0.5842236,0.000021769372,0.00027491784,0.000019071647,0.00000749957,0.000096647156,0.0005811087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972157,0.00087141834,0.00050157355,0.00021161493,0.00080485956,0.000394826],"domain_scores_gemma":[0.99795485,0.0010499783,0.000029126479,0.0001490757,0.0006716401,0.00014532442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01032474,0.00013751356,0.00014584386,0.0002740086,0.00036072612,0.0007856217,0.00034133715,0.000022488577,0.000046273934],"category_scores_gemma":[0.00034106176,0.00010281748,0.00007983228,0.0002971829,0.000108067645,0.00016891725,0.00008244923,0.00073301,0.0000425129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015421594,0.000029051398,0.00004031116,0.00008359244,0.00007739665,0.000107972744,0.00023482108,0.5921427,0.0027441443,0.000041152856,0.00018628736,0.40429717],"study_design_scores_gemma":[0.0006197063,0.00019465931,0.000729633,0.00014866472,0.00001679465,0.00013740455,0.000056449655,0.99480957,0.0007330181,0.000011357673,0.002434824,0.00010794595],"about_ca_topic_score_codex":0.000002757106,"about_ca_topic_score_gemma":7.366639e-7,"teacher_disagreement_score":0.40418923,"about_ca_system_score_codex":0.00015884773,"about_ca_system_score_gemma":0.00024976832,"threshold_uncertainty_score":0.7575768},"labels":[],"label_agreement":null},{"id":"W4395678464","doi":"10.1016/j.omega.2024.103100","title":"Increasing schedule reliability in the multiple depot vehicle scheduling problem with stochastic travel time","year":2024,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"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; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Schedule; Scheduling (production processes); Computer science; Reliability (semiconductor); Mathematical optimization; Operations research; Stochastic dominance; Public transport; Service quality; Service (business); Transport engineering; Engineering; Mathematics; Economics","score_opus":0.010892364363572445,"score_gpt":0.23617127959774442,"score_spread":0.22527891523417198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395678464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7526704,0.00025063468,0.24480817,0.00016100878,0.00006526758,0.0003272573,0.0000043985124,0.00042615263,0.0012866746],"genre_scores_gemma":[0.8121381,0.0000022650256,0.18763342,0.000023430006,0.00006813182,0.00004230567,0.000005714252,0.00005332485,0.000033317214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987077,0.00019118299,0.0002698633,0.00027816126,0.00022874578,0.00032432648],"domain_scores_gemma":[0.99887776,0.0007150164,0.00002028372,0.00029800992,0.000033983048,0.000054931472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015007365,0.00017890538,0.00018036006,0.00012707555,0.000092157075,0.00016210623,0.00019655112,0.00008674653,0.000018824217],"category_scores_gemma":[0.00029639364,0.0001340904,0.00004003197,0.0007877184,0.000047853628,0.00021751528,0.000027452008,0.00043612334,0.00006014464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001691758,0.000025706502,0.0015772482,0.00013526635,0.00001593459,0.000012364371,0.0009035416,0.9872629,0.007923567,0.00016176853,0.000013178316,0.0019515996],"study_design_scores_gemma":[0.00031862155,0.000026410253,0.0026643544,0.00023030792,0.000018398641,0.00004014436,0.00015577917,0.9953688,0.000766194,0.00016838673,0.00005651231,0.00018613078],"about_ca_topic_score_codex":0.00003730502,"about_ca_topic_score_gemma":0.000012298584,"teacher_disagreement_score":0.059467647,"about_ca_system_score_codex":0.00011706661,"about_ca_system_score_gemma":0.000048528058,"threshold_uncertainty_score":0.5468048},"labels":[],"label_agreement":null},{"id":"W4396609541","doi":"10.1287/msom.2022.0339","title":"Robust Drone Delivery with Weather Information","year":2024,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Vehicle Routing Optimization Methods","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; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Drone; Scheduling (production processes); Operations research; Scalability; Cluster analysis; Mathematical optimization; Engineering; Mathematics","score_opus":0.011017275093000661,"score_gpt":0.2025417523027919,"score_spread":0.19152447720979124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396609541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10766161,0.00013766732,0.8591401,0.0008783723,0.00045033282,0.0006126702,0.000011718758,0.0022769363,0.028830564],"genre_scores_gemma":[0.73790514,0.00014734014,0.25875255,0.00073885964,0.00011416052,0.00019129954,0.00016052107,0.000092165785,0.0018979376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991273,0.00002360466,0.00024328411,0.00017382253,0.00020926296,0.00022266978],"domain_scores_gemma":[0.9995772,0.000017798215,0.000010920712,0.00029924986,0.00004230591,0.000052492225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001814602,0.00019293738,0.00010636176,0.00025637783,0.00015211834,0.00056646706,0.0001644251,0.000046334066,0.00025364137],"category_scores_gemma":[0.0000012582723,0.00017545398,0.00002682257,0.00031746295,0.000008853932,0.0010669808,0.000066387525,0.0001454321,0.00050551986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026346272,0.000007632782,0.0000059771096,0.00038121422,0.00010760806,0.000007460525,0.00056850427,0.97617775,0.00002365512,0.0007770224,0.00046240177,0.021478156],"study_design_scores_gemma":[0.00022379505,0.00001469779,0.0008482435,0.000151825,0.000074588854,0.0000079289375,0.0004110345,0.95914525,0.0023611512,0.000019082594,0.03646131,0.00028108084],"about_ca_topic_score_codex":0.00004669202,"about_ca_topic_score_gemma":0.00008331532,"teacher_disagreement_score":0.63024354,"about_ca_system_score_codex":0.00014261295,"about_ca_system_score_gemma":0.000010170606,"threshold_uncertainty_score":0.71548057},"labels":[],"label_agreement":null},{"id":"W4396768746","doi":"10.1016/j.ejor.2024.05.012","title":"A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Monotonic function; Integer programming; Integer (computer science); Mathematical optimization; Computer science; Routing (electronic design automation); Mathematics; Computer network","score_opus":0.0710932116016096,"score_gpt":0.3777479419120455,"score_spread":0.30665473031043594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396768746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010029918,0.00067601696,0.986299,0.0010438038,0.00021315098,0.0003754183,0.000010865996,0.000098100274,0.0012537733],"genre_scores_gemma":[0.7332157,0.000028217331,0.2655423,0.000022700568,0.00042752747,0.000017213733,0.000007954009,0.00012629812,0.0006121242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971717,0.0010056095,0.0005665119,0.00021023976,0.0006692408,0.00037668238],"domain_scores_gemma":[0.99742836,0.001210923,0.000057658857,0.00014541698,0.0009935908,0.00016405348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010349891,0.00015555813,0.0002074479,0.00039876133,0.0001948607,0.00045039397,0.0003033333,0.00003212985,0.00009711836],"category_scores_gemma":[0.0010112125,0.00011995061,0.000085453365,0.00065633014,0.00006204787,0.000389764,0.000045965087,0.00084227504,0.00004011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008441635,0.000025768051,0.000012203561,0.000090824906,0.00014989682,0.00006387277,0.0009527795,0.9651281,0.012393346,0.0009967652,0.0010978662,0.01900413],"study_design_scores_gemma":[0.00060442486,0.000369671,0.00011562767,0.0006122266,0.000023124103,0.00016643011,0.00015686566,0.9950687,0.00056560215,0.00010138334,0.0020714886,0.00014442962],"about_ca_topic_score_codex":0.0000017390747,"about_ca_topic_score_gemma":0.0000016936614,"teacher_disagreement_score":0.7231857,"about_ca_system_score_codex":0.00019082769,"about_ca_system_score_gemma":0.0002842791,"threshold_uncertainty_score":0.48914438},"labels":[],"label_agreement":null},{"id":"W4398230519","doi":"10.48550/arxiv.2405.12876","title":"Approximating Traveling Salesman Problems Using a Bridge Lemma","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; European Commission","keywords":"Lemma (botany); Bridge (graph theory); Mathematics; Combinatorics; Computer science; Biology; Botany; Anatomy","score_opus":0.1344195853920871,"score_gpt":0.2186557351095713,"score_spread":0.0842361497174842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398230519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40686974,0.00015638286,0.58897686,0.0000073411966,0.00056906155,0.00029493205,0.000022837887,0.0010986177,0.0020042402],"genre_scores_gemma":[0.94562364,0.00007437447,0.05364338,0.000011106512,0.00019923497,0.0000014959631,0.00003156539,0.00016853136,0.00024666445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980298,0.00013074849,0.00042566494,0.00082756625,0.00009868905,0.00048748055],"domain_scores_gemma":[0.998904,0.000089328205,0.00014656938,0.00061660784,0.00009330973,0.00015020183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005954697,0.00047047008,0.00046964106,0.0003209189,0.00013664608,0.00017002404,0.000495437,0.000437331,0.00002968692],"category_scores_gemma":[0.000050902265,0.00062089716,0.00024110332,0.000707552,0.00006541331,0.0001222071,0.00076791144,0.0013094255,0.000057605383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031988181,0.000013109361,0.0002870648,0.0013028781,0.00015418393,0.000100585654,0.00045096574,0.99037874,0.00051695586,0.0062808758,0.000023069226,0.0004883776],"study_design_scores_gemma":[0.00020772566,0.000007305121,0.000069755166,0.0007618985,0.00021339854,0.000015167779,0.00007413377,0.98384374,0.00023202345,0.013925387,0.000046798246,0.00060264015],"about_ca_topic_score_codex":0.00007901689,"about_ca_topic_score_gemma":0.000012994574,"teacher_disagreement_score":0.5387539,"about_ca_system_score_codex":0.00047094826,"about_ca_system_score_gemma":0.000108909095,"threshold_uncertainty_score":0.99962425},"labels":[],"label_agreement":null},{"id":"W4399058371","doi":"10.1007/978-3-031-60597-0_18","title":"A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Benders' decomposition; Computer science; Decomposition; Operations research; Mathematical optimization; Engineering; Mathematics","score_opus":0.02216477098698155,"score_gpt":0.2545022546696616,"score_spread":0.23233748368268003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399058371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005483436,0.00018064551,0.9964901,0.0000275438,0.00039204492,0.0007006281,0.00005031823,0.0004730404,0.0011372862],"genre_scores_gemma":[0.10350334,0.000010060007,0.89579046,0.00006594682,0.00011506547,0.000054590422,0.00003573102,0.00008727908,0.00033753278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821204,0.000013697447,0.00033823212,0.0006780314,0.0003143799,0.00044362876],"domain_scores_gemma":[0.9992192,0.00019857839,0.00006905804,0.0002978389,0.00012740519,0.0000879367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041601382,0.0004053152,0.00035830418,0.0004839939,0.000109621,0.00028803293,0.00041343397,0.00020819457,0.000006483393],"category_scores_gemma":[0.000023198818,0.00036878485,0.00007662364,0.00027992087,0.00028931984,0.00023306716,0.00011813255,0.0005338966,0.0000040095024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010088889,0.0000071414565,0.000010003126,0.0005012623,0.000031540385,0.0000066360094,0.0019491825,0.972078,0.0004352311,0.00023769928,0.000005902708,0.024727263],"study_design_scores_gemma":[0.00034036936,0.00009252494,0.000009458982,0.00048057167,0.000018959488,0.000024075713,0.0000038712556,0.9942024,0.0013388295,0.0029484797,0.00009996248,0.0004405474],"about_ca_topic_score_codex":0.000010014546,"about_ca_topic_score_gemma":0.000038558817,"teacher_disagreement_score":0.102955,"about_ca_system_score_codex":0.00036287488,"about_ca_system_score_gemma":0.00009118511,"threshold_uncertainty_score":0.99987644},"labels":[],"label_agreement":null},{"id":"W4399261791","doi":"10.1609/socs.v17i1.31550","title":"On the Properties of All-Pair Heuristics","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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 Alberta","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Computer science; Mathematics; Mathematical optimization","score_opus":0.026655059834424417,"score_gpt":0.2642059223824091,"score_spread":0.23755086254798466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399261791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681872,0.00006476485,0.00008876414,0.0068644434,0.005863398,0.00034310648,0.000014094985,0.0001782601,0.018395972],"genre_scores_gemma":[0.99915123,0.00002818992,0.00017466336,0.000050254133,0.00026913398,0.000018450593,7.5571467e-7,0.000035510835,0.0002717998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985868,0.000018650418,0.00028351284,0.00015096442,0.0008107046,0.00014937246],"domain_scores_gemma":[0.9991907,0.00027923987,0.000046191584,0.00010636011,0.0003478981,0.000029641331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793578,0.00012491182,0.00012659321,0.000080557686,0.00005413591,0.00010014536,0.0007952173,0.00006429776,0.00002837334],"category_scores_gemma":[0.00038026462,0.00007568076,0.00009614417,0.0002554714,0.000091916474,0.00007971117,0.0001458191,0.00033957677,0.000012406904],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009722838,0.00009620262,0.0002907607,0.00028861215,0.00022360866,4.3790055e-7,0.000767942,0.02400205,0.23768844,0.73012704,0.006102399,0.00031528878],"study_design_scores_gemma":[0.0002405105,0.00011897702,0.0000676871,0.0005674478,0.000021185973,0.0000030659971,0.00007529378,0.18084444,0.80796725,0.0072889454,0.0026807382,0.00012448942],"about_ca_topic_score_codex":0.0000152546545,"about_ca_topic_score_gemma":1.1373297e-7,"teacher_disagreement_score":0.7228381,"about_ca_system_score_codex":0.00014610671,"about_ca_system_score_gemma":0.000026889655,"threshold_uncertainty_score":0.30861717},"labels":[],"label_agreement":null},{"id":"W4399348317","doi":"10.1016/j.trb.2024.102968","title":"The consistent vehicle routing problem with stochastic customers and demands","year":2024,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"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":"Vehicle routing problem; Routing (electronic design automation); Computer science; Transport engineering; Operations research; Mathematical optimization; Economics; Engineering; Mathematics; Computer network","score_opus":0.18988650726679812,"score_gpt":0.4088746423061573,"score_spread":0.21898813503935916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399348317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24256235,0.0017529087,0.75137234,0.0011058109,0.00018917954,0.00077838835,0.000015650063,0.0009136021,0.0013097484],"genre_scores_gemma":[0.9026314,0.00022973442,0.096653126,0.00001760191,0.00006566064,0.00015933631,0.0000129828895,0.00003957607,0.00019057794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729735,0.0010406821,0.0003405838,0.00032564078,0.0004963878,0.0004993626],"domain_scores_gemma":[0.99381745,0.005708655,0.000019969517,0.00016216564,0.00013984612,0.00015188628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074690934,0.00015243808,0.00019750718,0.00011074777,0.00038925686,0.00019846034,0.00013175393,0.000107674045,0.000034132307],"category_scores_gemma":[0.00032056507,0.00009384511,0.0000438711,0.00065404933,0.00037789645,0.00011074731,0.000009179242,0.000666009,0.0000132142895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018645097,0.00002835408,0.0024456817,0.00040354053,0.00024351482,0.00010928311,0.0024624234,0.88513607,0.0028753176,0.04592349,0.0006894494,0.059496447],"study_design_scores_gemma":[0.0006911989,0.00035309346,0.017544722,0.00034388286,0.00009428482,0.00002590239,0.001799836,0.9656698,0.0011708156,0.0025241822,0.009318554,0.0004637404],"about_ca_topic_score_codex":0.000009745188,"about_ca_topic_score_gemma":0.000033363704,"teacher_disagreement_score":0.66006905,"about_ca_system_score_codex":0.00004787087,"about_ca_system_score_gemma":0.00004936524,"threshold_uncertainty_score":0.38268927},"labels":[],"label_agreement":null},{"id":"W4399534518","doi":"10.1016/j.ejor.2024.06.016","title":"A review of recent advances in time-dependent vehicle routing","year":2024,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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":"Ministero dell'Istruzione e del Merito; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vehicle routing problem; Computer science; Discretization; Routing (electronic design automation); Field (mathematics); Travel time; Operations research; Graph; Data science; Machine learning; Artificial intelligence; Theoretical computer science; Transport engineering; Computer network; Mathematics; Engineering","score_opus":0.13910451194393095,"score_gpt":0.45000431415672326,"score_spread":0.31089980221279234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399534518","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014440776,0.99073076,0.0008497368,0.00008571701,0.00022351598,0.00033310935,0.000015913252,0.000019030824,0.0077407937],"genre_scores_gemma":[0.0000059645618,0.9945803,0.004681071,0.00002149816,0.00032990074,0.0000057257294,0.000015173182,0.00011189026,0.00024843626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99249464,0.0037392224,0.0019634557,0.00020904129,0.0012925906,0.0003010362],"domain_scores_gemma":[0.998014,0.0005706127,0.00025339675,0.00022664874,0.0008176788,0.00011766721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020840226,0.00023379714,0.0010366165,0.0007124441,0.000047571622,0.000106490486,0.00071688613,0.00005408491,0.0004419102],"category_scores_gemma":[0.002178096,0.00018259634,0.0002438181,0.001215003,0.000052712207,0.0002492466,0.0001803744,0.0017094829,0.00028748403],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041614007,0.000030809635,0.0000013464439,0.052968815,0.000076605575,0.00016236244,0.000050838375,0.009190721,0.000008774328,0.000060153714,0.0026322014,0.9348132],"study_design_scores_gemma":[0.000114778864,0.00006374613,0.0000011369895,0.16421455,0.0000718702,0.00011749105,0.0000062437025,0.001988664,0.000004748898,0.0000065878003,0.83327734,0.0001328263],"about_ca_topic_score_codex":2.6363912e-7,"about_ca_topic_score_gemma":2.4449406e-7,"teacher_disagreement_score":0.9346804,"about_ca_system_score_codex":0.00035543603,"about_ca_system_score_gemma":0.0004925172,"threshold_uncertainty_score":0.74460626},"labels":[],"label_agreement":null},{"id":"W4399635305","doi":"10.5267/j.dsl.2024.5.008","title":"Stas crossover with K-mean clustering for vehicle routing problem with time window","year":2024,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Crossover; Cluster analysis; Vehicle routing problem; Window (computing); Computer science; Path (computing); Routing (electronic design automation); Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Computer network","score_opus":0.013378693451587877,"score_gpt":0.2747596204419801,"score_spread":0.2613809269903922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399635305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33811438,0.0000168846,0.660378,0.00035018875,0.00013813555,0.00027638947,0.000005409525,0.00042554663,0.00029505815],"genre_scores_gemma":[0.5442316,9.2389223e-7,0.4551969,0.0003634069,0.00006593,0.00002363695,0.0000018926154,0.00005779954,0.000057912166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793667,0.000019236362,0.00027208377,0.00052852934,0.0006859575,0.00055752374],"domain_scores_gemma":[0.9990038,0.00040714673,0.000038386508,0.00033428453,0.00008819713,0.0001281391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014539835,0.000205212,0.00018211188,0.00028003386,0.00030421015,0.00089579023,0.00039845594,0.00004176952,0.000026887054],"category_scores_gemma":[0.00007331993,0.00015335101,0.000041327246,0.0014465486,0.00022432413,0.0009009537,0.00007436182,0.00018239651,0.00005129078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042697975,0.0000042486504,0.00034475882,0.000036339887,0.00001336761,0.000016996366,0.0007355094,0.88838387,0.08558711,0.00005384108,0.00042847547,0.024352808],"study_design_scores_gemma":[0.00049733196,0.000064153086,0.0006801248,0.0003156109,0.000013562809,0.000034904107,0.00005200255,0.990012,0.0067375996,0.00003600713,0.0012736681,0.00028307244],"about_ca_topic_score_codex":0.0000035308979,"about_ca_topic_score_gemma":0.000003868582,"teacher_disagreement_score":0.20611721,"about_ca_system_score_codex":0.00018302159,"about_ca_system_score_gemma":0.00006303761,"threshold_uncertainty_score":0.86381257},"labels":[],"label_agreement":null},{"id":"W4399640490","doi":"10.1007/s11067-024-09633-3","title":"The Classical p-median Problem as a Surrogate Model in Hub Location","year":2024,"lang":"en","type":"article","venue":"Networks and Spatial Economics","topic":"Vehicle Routing Optimization Methods","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":"Royal Military College of Canada","funders":"","keywords":"Solver; Mathematical optimization; Heuristic; Spoke-hub distribution paradigm; Mathematics; Limit (mathematics); Fraction (chemistry); Flow network; Facility location problem; Variable (mathematics); Computer science; Engineering","score_opus":0.00905182457387664,"score_gpt":0.22379274917860567,"score_spread":0.21474092460472904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399640490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057053793,0.0009909814,0.9371449,0.0011007534,0.0005714777,0.00019713145,0.0000023153202,0.00017838654,0.0027602557],"genre_scores_gemma":[0.99386096,0.001643919,0.0040651415,0.000041552423,0.0002137358,0.000020592033,0.0000074995796,0.00002889872,0.000117702555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994723,0.000022606078,0.00020044713,0.000114277325,0.000021867134,0.00016848478],"domain_scores_gemma":[0.99971074,0.00012767236,0.000013885512,0.000089866786,0.000010208888,0.000047606605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003302914,0.000084739164,0.00009386075,0.000032380507,0.00005323899,0.0001571865,0.00006020661,0.00009330604,0.000003093951],"category_scores_gemma":[0.000011729577,0.0000746921,0.00001866722,0.00008253278,0.000030177276,0.00007986107,0.000021257672,0.00019299616,0.0000055496066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031778072,0.0000016200315,0.00008728854,0.000010299407,0.0000061297924,4.8116283e-7,0.0001414762,0.85185903,9.969873e-7,0.0037546563,0.00009288056,0.14404194],"study_design_scores_gemma":[0.00009654568,0.000008239362,0.000108896005,0.000024106772,0.000004156045,0.0000019100082,0.000013973744,0.9949799,0.0000041101666,0.0024277405,0.0022466956,0.00008371564],"about_ca_topic_score_codex":0.000055246954,"about_ca_topic_score_gemma":0.0012582673,"teacher_disagreement_score":0.93680716,"about_ca_system_score_codex":0.000067065645,"about_ca_system_score_gemma":0.000035729583,"threshold_uncertainty_score":0.30458555},"labels":[],"label_agreement":null},{"id":"W4399715246","doi":"10.1007/978-3-031-62912-9_8","title":"A Memetic Algorithm for Large-Scale Real-World Vehicle Routing Problems with Simultaneous Pickup and Delivery with Time Windows","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","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":"Brock University","funders":"","keywords":"Pickup; Vehicle routing problem; Computer science; Memetic algorithm; Routing (electronic design automation); Scale (ratio); Algorithm; Local search (optimization); Embedded system; Artificial intelligence","score_opus":0.00935294862045187,"score_gpt":0.22789409507101396,"score_spread":0.2185411464505621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399715246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003656059,0.00030671863,0.9965968,0.00005872511,0.00021046869,0.00079272286,0.000027657052,0.00040878405,0.0012325163],"genre_scores_gemma":[0.026738673,0.000030540003,0.9714573,0.00011327654,0.0002561524,0.000025673695,0.000012229055,0.000152429,0.001213723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775594,0.000017110886,0.0003445639,0.0008694377,0.00043058163,0.00058236],"domain_scores_gemma":[0.99843305,0.00077167986,0.00009449165,0.00039792663,0.00017731784,0.00012555804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006524954,0.000468466,0.00047951392,0.0004516788,0.00017380613,0.0003019258,0.00037972673,0.00017532845,0.000010374137],"category_scores_gemma":[0.000024953852,0.00038154528,0.00004675523,0.0005238813,0.00022677843,0.00016067394,0.00018201485,0.0005659356,0.000007476951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066760012,0.0000059580693,0.000027934915,0.00013459013,0.000027310212,0.000037076155,0.0006199002,0.84267044,0.00007620367,0.00007896867,0.0000022412398,0.15631267],"study_design_scores_gemma":[0.00041899353,0.00020328016,0.000008261952,0.00097472075,0.00005371896,0.000056266585,7.298805e-7,0.9957039,0.00033961903,0.001324455,0.00039418353,0.0005218774],"about_ca_topic_score_codex":0.000017352124,"about_ca_topic_score_gemma":0.0002398708,"teacher_disagreement_score":0.1557908,"about_ca_system_score_codex":0.0002242986,"about_ca_system_score_gemma":0.00012772808,"threshold_uncertainty_score":0.9998636},"labels":[],"label_agreement":null},{"id":"W4399828009","doi":"10.32920/26052727","title":"Electric Vehicle Routing Problem and Solution Approaches","year":2024,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Vehicle routing problem; Routing (electronic design automation); Computer science; Computer network","score_opus":0.03867867903395701,"score_gpt":0.2503435447999927,"score_spread":0.21166486576603571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08429307,0.0048862044,0.79476434,0.0004933572,0.00078671484,0.0009364169,0.000008693226,0.0053065303,0.108524695],"genre_scores_gemma":[0.7828204,0.00010975118,0.21612641,0.000012047952,0.00015695332,0.000053531287,0.000014863171,0.000093061855,0.0006129922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987971,0.00006473254,0.00030557704,0.00039367247,0.00013903443,0.00029986896],"domain_scores_gemma":[0.9995828,0.00005737406,0.000038393187,0.00023075454,0.000025267771,0.0000653699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006059333,0.0002576,0.00024155894,0.00018389449,0.000055053053,0.00020033384,0.00012152379,0.0003157699,0.000014693838],"category_scores_gemma":[0.000033544373,0.00026317313,0.00005919241,0.00026607604,0.0000152204675,0.000042677017,0.0004676299,0.00085889176,0.00002539857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019512654,0.000011358756,0.00024927052,0.0015233302,0.00012541385,0.0000028844663,0.0005726422,0.9040977,0.003063095,0.007971212,0.0005562072,0.08182498],"study_design_scores_gemma":[0.000065600885,0.0000066243547,0.00011903764,0.00011391034,0.00005007504,0.0000065601125,0.000019644865,0.99097914,0.001777365,0.0065133716,0.000063792715,0.00028487603],"about_ca_topic_score_codex":0.000021706157,"about_ca_topic_score_gemma":0.0000032067676,"teacher_disagreement_score":0.69852734,"about_ca_system_score_codex":0.00013215296,"about_ca_system_score_gemma":0.00003802211,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W4399828222","doi":"10.32920/26052727.v1","title":"Electric Vehicle Routing Problem and Solution Approaches","year":2024,"lang":"en","type":"preprint","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Vehicle routing problem; Computer science; Electric vehicle; Routing (electronic design automation); Mathematical optimization; Mathematics; Computer network; Physics","score_opus":0.03867867903395701,"score_gpt":0.2503435447999927,"score_spread":0.21166486576603571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08429307,0.0048862044,0.79476434,0.0004933572,0.00078671484,0.0009364169,0.000008693226,0.0053065303,0.108524695],"genre_scores_gemma":[0.7828204,0.00010975118,0.21612641,0.000012047952,0.00015695332,0.000053531287,0.000014863171,0.000093061855,0.0006129922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987971,0.00006473254,0.00030557704,0.00039367247,0.00013903443,0.00029986896],"domain_scores_gemma":[0.9995828,0.00005737406,0.000038393187,0.00023075454,0.000025267771,0.0000653699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006059333,0.0002576,0.00024155894,0.00018389449,0.000055053053,0.00020033384,0.00012152379,0.0003157699,0.000014693838],"category_scores_gemma":[0.000033544373,0.00026317313,0.00005919241,0.00026607604,0.0000152204675,0.000042677017,0.0004676299,0.00085889176,0.00002539857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019512654,0.000011358756,0.00024927052,0.0015233302,0.00012541385,0.0000028844663,0.0005726422,0.9040977,0.003063095,0.007971212,0.0005562072,0.08182498],"study_design_scores_gemma":[0.000065600885,0.0000066243547,0.00011903764,0.00011391034,0.00005007504,0.0000065601125,0.000019644865,0.99097914,0.001777365,0.0065133716,0.000063792715,0.00028487603],"about_ca_topic_score_codex":0.000021706157,"about_ca_topic_score_gemma":0.0000032067676,"teacher_disagreement_score":0.69852734,"about_ca_system_score_codex":0.00013215296,"about_ca_system_score_gemma":0.00003802211,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W4399924090","doi":"10.2139/ssrn.4872999","title":"A Contextual Framework for Learning Routing Experiences in Last-Mile Delivery","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"","keywords":"Mile; Last mile (transportation); Routing (electronic design automation); Computer science; Business; Geography; Computer network","score_opus":0.015909885999673502,"score_gpt":0.2856285855236928,"score_spread":0.2697186995240193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399924090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3263254,0.009957797,0.6613333,0.00008085196,0.0013875138,0.000274066,0.0000032579962,0.0003376668,0.00030013238],"genre_scores_gemma":[0.94354886,0.0023425512,0.052742947,0.000020395664,0.00080854277,0.00013687272,0.000009244999,0.00014302695,0.0002475811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625105,0.00019146361,0.000662746,0.0003910512,0.00026077224,0.0022429053],"domain_scores_gemma":[0.99900776,0.0004734316,0.00016696562,0.0001767468,0.00009252629,0.00008255338],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0032743337,0.0003681066,0.0004672569,0.00033968844,0.00015880165,0.00027519438,0.0004243084,0.00047879515,0.000024592704],"category_scores_gemma":[0.00071462814,0.00039176972,0.0002427548,0.00027995513,0.000036741752,0.00009165093,0.00025500465,0.010582718,0.000012477515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026607451,0.000015034073,0.0004409207,0.00014950027,0.00023224845,0.000008679284,0.0100714415,0.9200662,0.00007648209,0.02608477,0.000027638142,0.042800505],"study_design_scores_gemma":[0.00036449067,0.00011965816,0.000017033877,0.00095930713,0.000058243284,0.0001112558,0.029131206,0.7484718,0.00012492845,0.21975741,0.00033243178,0.0005522618],"about_ca_topic_score_codex":0.000019359033,"about_ca_topic_score_gemma":0.00013038797,"teacher_disagreement_score":0.61722344,"about_ca_system_score_codex":0.0016510146,"about_ca_system_score_gemma":0.0013371347,"threshold_uncertainty_score":0.99985343},"labels":[],"label_agreement":null},{"id":"W4400083685","doi":"10.1007/978-3-031-57603-4_17","title":"Express Package Delivery Optimization Using Walkers, Cargo Tricycles and Delivery Trucks","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Vehicle Routing Optimization Methods","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":"University of Toronto","funders":"","keywords":"Truck; Transport engineering; Computer science; Business; Engineering; Automotive engineering","score_opus":0.05921402736840863,"score_gpt":0.3765023370451528,"score_spread":0.31728830967674415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400083685","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021212626,0.0012658375,0.033575565,0.005728756,0.006708003,0.006692206,0.00051437353,0.00067739515,0.92362523],"genre_scores_gemma":[0.28247958,0.042348303,0.28114504,0.0001528863,0.00076955045,0.0015501766,0.00065949466,0.00040647556,0.3904885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98733175,0.00027172908,0.0015549393,0.0022761277,0.006976804,0.0015886257],"domain_scores_gemma":[0.99586624,0.000226895,0.000068247624,0.0011955854,0.0022755037,0.0003675412],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.011064486,0.00071269704,0.00050663395,0.013645107,0.0022595332,0.005667466,0.004492063,0.00026951067,0.0010198025],"category_scores_gemma":[0.00056123134,0.00078809145,0.000121879704,0.0046212208,0.006046428,0.0074165748,0.004448092,0.0017584782,0.00013441635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005483342,0.00006328008,0.00007647223,0.00012886395,0.00010744475,0.00018164511,0.0005712958,0.70101744,0.00065677916,0.29456636,0.0003113798,0.0022641716],"study_design_scores_gemma":[0.00066329225,0.000076249285,0.0003741647,0.0010134988,0.000028607192,0.000044674507,0.0030181694,0.9644585,0.0003985009,0.0056506586,0.023436511,0.00083714107],"about_ca_topic_score_codex":0.000463866,"about_ca_topic_score_gemma":0.0011968225,"teacher_disagreement_score":0.5331367,"about_ca_system_score_codex":0.0053467215,"about_ca_system_score_gemma":0.0004854062,"threshold_uncertainty_score":0.9998934},"labels":[],"label_agreement":null},{"id":"W4400083698","doi":"10.1007/978-3-031-57603-4_16","title":"Production Inventory Technician Routing Problem: A Bi-objective Post-sales Application","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Vehicle Routing Optimization Methods","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é du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Technician; Routing (electronic design automation); Production (economics); Operations research; Business; Manufacturing engineering; Computer science; Operations management; Engineering; Computer network; Economics; Electrical engineering; Microeconomics","score_opus":0.04092022036264643,"score_gpt":0.3819230771249259,"score_spread":0.3410028567622795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400083698","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030482556,0.0002659076,0.007776382,0.0131928595,0.0044915257,0.007534403,0.00017184902,0.00078668905,0.96273214],"genre_scores_gemma":[0.3522617,0.007879693,0.07072022,0.00012714187,0.0009240498,0.00561121,0.0008248176,0.0003312816,0.5613199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98524743,0.00026534815,0.0017644505,0.0027635177,0.008228767,0.0017304767],"domain_scores_gemma":[0.9941073,0.00013121172,0.00009437136,0.0015212026,0.0038401708,0.0003057359],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["sts"],"category_scores_codex":[0.018196784,0.0007302411,0.00048088908,0.015916027,0.0024279393,0.004125463,0.005734383,0.00027510704,0.00048138577],"category_scores_gemma":[0.0010811544,0.00080286857,0.00014541017,0.0070885313,0.006021609,0.0069978596,0.0039722794,0.0024065857,0.0006642799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004924313,0.00011269585,0.000071101174,0.000148962,0.00010432232,0.00007241717,0.0008587537,0.41179174,0.00185702,0.5805343,0.00046875546,0.0039307266],"study_design_scores_gemma":[0.00088306365,0.00026188546,0.0016371072,0.0027898443,0.0000483528,0.000089091634,0.008944833,0.7991329,0.0016765785,0.05333918,0.12929694,0.0019002318],"about_ca_topic_score_codex":0.00045172474,"about_ca_topic_score_gemma":0.0052716536,"teacher_disagreement_score":0.5271951,"about_ca_system_score_codex":0.008966424,"about_ca_system_score_gemma":0.0006659739,"threshold_uncertainty_score":0.9998949},"labels":[],"label_agreement":null},{"id":"W4400278253","doi":"10.2139/ssrn.4884036","title":"An Analytical Approach to Planning for and Managing Random Disruption in Rail Intermodal Networks","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"McMaster University","funders":"","keywords":"Computer science; Business; Operations research; Transport engineering; Engineering","score_opus":0.01748252304989184,"score_gpt":0.3081381141617294,"score_spread":0.2906555911118376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400278253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06789436,0.003157062,0.9274278,0.00011153841,0.00042958427,0.00041381115,0.000003093094,0.00015612753,0.0004065865],"genre_scores_gemma":[0.9659046,0.00068561465,0.032478195,0.000023362622,0.0006430707,0.00005954967,0.000032012995,0.000112742,0.00006084405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973264,0.00014304837,0.00048888364,0.00040130617,0.00015105326,0.0014893115],"domain_scores_gemma":[0.99946994,0.00009628588,0.00006384771,0.00019078786,0.00003691383,0.00014224008],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036912516,0.00029776362,0.00042995,0.0004854477,0.00007372511,0.0003173917,0.0002603706,0.00026310963,0.000001256915],"category_scores_gemma":[0.00006360235,0.0003053124,0.000116526964,0.00021375144,0.000018908553,0.00009157274,0.0001687487,0.0042529483,7.335177e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010851606,0.000014652945,0.00021672482,0.00013067195,0.0001473177,0.0000030003425,0.0005592835,0.95917076,0.000013611339,0.006913504,0.000016792837,0.032705154],"study_design_scores_gemma":[0.0007881347,0.00006195022,0.00012756351,0.000264552,0.000086461805,0.00012666179,0.00045052342,0.94580793,0.000002415481,0.051971734,0.00002154006,0.00029054141],"about_ca_topic_score_codex":0.0000073876668,"about_ca_topic_score_gemma":0.000020712054,"teacher_disagreement_score":0.89801025,"about_ca_system_score_codex":0.00101892,"about_ca_system_score_gemma":0.00022332164,"threshold_uncertainty_score":0.9999399},"labels":[],"label_agreement":null},{"id":"W4400338818","doi":"10.1016/j.cor.2024.106761","title":"An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Column generation; Pickup; Computer science; Vehicle routing problem; Mathematical optimization; Solver; Algorithm; Heuristic; Routing (electronic design automation); Mathematics; Artificial intelligence","score_opus":0.024986264957067815,"score_gpt":0.32485885482482557,"score_spread":0.2998725898677578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400338818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0647748,0.00064370845,0.93326354,0.0001235536,0.00004668409,0.00075309654,0.000023639082,0.00026443353,0.000106544896],"genre_scores_gemma":[0.1974639,0.00009978477,0.80183566,0.00001622735,0.0001219364,0.00007994643,0.000040301806,0.00005206667,0.00029019223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889845,0.00013952544,0.00015641225,0.0003245769,0.00019093412,0.0002901051],"domain_scores_gemma":[0.9988144,0.00065385946,0.0000035663697,0.00018473528,0.00020225182,0.00014117798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007634969,0.00012885006,0.00013845651,0.00023376876,0.00030598693,0.0007392406,0.00011547113,0.00006651859,0.0000133009125],"category_scores_gemma":[0.000027400021,0.00011578977,0.000014268511,0.00032759603,0.000097644086,0.00031274525,0.000052759064,0.0002297078,0.000009237903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055057726,0.000012569628,0.00001167725,0.00008932317,0.000039737053,0.000016746586,0.0006054236,0.7979921,0.0012692513,0.000172193,0.0002386663,0.19954681],"study_design_scores_gemma":[0.0002770613,0.0002374466,0.000038843387,0.000085960295,0.000010936374,0.000050156923,0.000043511653,0.997668,0.00027190687,0.000037912745,0.0011331259,0.00014512976],"about_ca_topic_score_codex":0.00001812897,"about_ca_topic_score_gemma":0.000011450585,"teacher_disagreement_score":0.19967592,"about_ca_system_score_codex":0.000060180042,"about_ca_system_score_gemma":0.000069741975,"threshold_uncertainty_score":0.7128514},"labels":[],"label_agreement":null},{"id":"W4400684999","doi":"10.1287/opre.2023.0569","title":"Hardness of Pricing Routes for Two-Stage Stochastic Vehicle Routing Problems with Scenarios","year":2024,"lang":"en","type":"article","venue":"Operations Research","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":"University of Waterloo","funders":"","keywords":"Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Operations research; Stage (stratigraphy); Mathematics; Computer network; Geology","score_opus":0.06734017771732487,"score_gpt":0.37508820165387585,"score_spread":0.307748023936551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400684999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082727194,0.0002531939,0.91463906,0.00014808758,0.00012084279,0.00095084397,0.00003127239,0.00027433387,0.00085518404],"genre_scores_gemma":[0.9115941,0.000005351127,0.08624484,0.0000036435724,0.0000846099,0.00026702386,0.000021402535,0.00007282716,0.001706199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855787,0.00012197381,0.00029287464,0.0002556448,0.00037433047,0.00039733812],"domain_scores_gemma":[0.99879277,0.00042918924,0.000009028441,0.0002560908,0.0004421,0.0000708173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017671208,0.00012178635,0.00017159944,0.00031865528,0.00030476486,0.0003223331,0.00018107143,0.000054745087,0.00003790584],"category_scores_gemma":[0.0003482333,0.00010717114,0.000036377263,0.0010320325,0.00007501848,0.00029427584,0.00005011325,0.0003362161,0.000014171841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006061767,0.000016496406,0.0000551466,0.00033077138,0.000040500876,0.0000011389363,0.0014976981,0.9646433,0.027562799,0.003623488,0.000060680955,0.0021619264],"study_design_scores_gemma":[0.00030276482,0.00007505472,0.00002898945,0.0003479152,0.000010991028,0.0000031729578,0.0003692647,0.989967,0.008550615,0.000019345609,0.00019991709,0.00012497061],"about_ca_topic_score_codex":0.000114394774,"about_ca_topic_score_gemma":0.00012912932,"teacher_disagreement_score":0.8288669,"about_ca_system_score_codex":0.00013470574,"about_ca_system_score_gemma":0.00018123677,"threshold_uncertainty_score":0.4370312},"labels":[],"label_agreement":null},{"id":"W4400765328","doi":"10.1007/s00291-024-00781-z","title":"New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty","year":2024,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Time travel; Vehicle routing problem; Travel time; Computer science; Routing (electronic design automation); Operations research; Transport engineering; Engineering; Computer network; Artificial intelligence","score_opus":0.016687559788272018,"score_gpt":0.24562073554589928,"score_spread":0.22893317575762726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400765328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004103883,0.00027156493,0.99099654,0.001845504,0.00006918763,0.00060796144,0.000014478955,0.0004411706,0.0016497087],"genre_scores_gemma":[0.59340346,0.000041967378,0.38972098,0.00011712529,0.00053517154,0.00007673597,0.00003440665,0.00022072335,0.015849404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916613,0.000022420763,0.00018800476,0.00021108071,0.000114300026,0.00029808818],"domain_scores_gemma":[0.99926275,0.00045285196,0.000023926808,0.00016815435,0.000016778162,0.00007552665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033045356,0.0001654171,0.00015480572,0.00005903804,0.00019528983,0.00020588278,0.0001000164,0.00006533714,0.00018252147],"category_scores_gemma":[0.000021742855,0.00010673858,0.00004000221,0.0003107485,0.000025293664,0.00016466063,0.000022350654,0.00015299892,0.000034865647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023001108,0.0000037827547,0.000052415002,0.000045740435,0.000093227885,0.0000017402293,0.00037215554,0.9904249,0.0008832471,0.003019034,0.0008784798,0.004202295],"study_design_scores_gemma":[0.0004337868,0.00005958665,0.00067417155,0.000079435646,0.00008131513,0.000027550734,0.000045570836,0.99576443,0.00054648065,0.0012398817,0.00087068457,0.0001771172],"about_ca_topic_score_codex":0.000021596063,"about_ca_topic_score_gemma":0.000049736627,"teacher_disagreement_score":0.60127556,"about_ca_system_score_codex":0.00007954465,"about_ca_system_score_gemma":0.00007132515,"threshold_uncertainty_score":0.43526733},"labels":[],"label_agreement":null},{"id":"W4401084216","doi":"10.1287/ijoc.2023.0106","title":"AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Iterated local search; Mathematical optimization; Scale (ratio); Heuristic; Computer science; Local search (optimization); Routing (electronic design automation); Iterated function; Mathematics; Geography","score_opus":0.02699017078605199,"score_gpt":0.2916248504667616,"score_spread":0.26463467968070964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401084216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15907052,0.00017355265,0.8383776,0.00015783336,0.00074916775,0.00033168032,0.00001553819,0.00057833246,0.0005457855],"genre_scores_gemma":[0.93501973,0.000010403697,0.064041816,0.0001500622,0.00060942984,0.0000067583387,0.000010326269,0.000089035944,0.00006240615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977976,0.00010696022,0.00072656915,0.00022713306,0.00039460784,0.00074714725],"domain_scores_gemma":[0.9983212,0.0008684675,0.00009325913,0.0002029659,0.00031606763,0.00019809257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029075402,0.00027977364,0.00026152295,0.00023124661,0.0010979146,0.00074443995,0.0003495522,0.00012676754,0.00002286116],"category_scores_gemma":[0.00011547219,0.00019939804,0.00013945065,0.00067821343,0.00005903715,0.0005449179,0.00008183771,0.0012179383,0.000024373812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038542657,0.00001937714,0.00004447205,0.000062171464,0.00010001276,0.000017337448,0.0075392104,0.917905,0.00018322495,0.0009437556,0.0002116984,0.072935246],"study_design_scores_gemma":[0.00053685845,0.00036604592,0.00013311591,0.00044921297,0.000030009565,0.00016335791,0.001692187,0.9943713,0.0007045195,0.00026506404,0.0010211845,0.00026717523],"about_ca_topic_score_codex":0.0000068550344,"about_ca_topic_score_gemma":0.0000039397905,"teacher_disagreement_score":0.77594924,"about_ca_system_score_codex":0.0002887279,"about_ca_system_score_gemma":0.000106740394,"threshold_uncertainty_score":0.8444383},"labels":[],"label_agreement":null},{"id":"W4401328212","doi":"10.1016/j.trb.2024.103040","title":"Sustainable hub location under uncertainty","year":2024,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":14,"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":"Transport engineering; Computer science; Operations research; Engineering; Environmental science","score_opus":0.30516005378843936,"score_gpt":0.4689050529878287,"score_spread":0.16374499919938934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401328212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06948128,0.0010367648,0.92412794,0.0007545244,0.00033643568,0.0004755031,0.000012228722,0.0014686559,0.0023066544],"genre_scores_gemma":[0.8517377,0.00035983892,0.1437169,0.00006935917,0.0002670316,0.0002472748,0.00016972747,0.000073573785,0.003358621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996333,0.0015257257,0.00042540662,0.00041212092,0.0006148137,0.0006889315],"domain_scores_gemma":[0.99626744,0.0028571282,0.000015424817,0.0002550564,0.00043283743,0.0001721424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008853176,0.00017489422,0.00023607479,0.0003347778,0.00019239669,0.00016123262,0.00020978067,0.00023082671,0.0007854547],"category_scores_gemma":[0.0006643489,0.00015472875,0.00008303955,0.0018406622,0.00017298404,0.0002640899,0.000009097286,0.0007638937,0.00014158837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022062566,0.000019464249,0.00017956561,0.00036569577,0.000038983257,0.000058714137,0.0004824164,0.91254526,0.0010957863,0.077100925,0.003180227,0.004910873],"study_design_scores_gemma":[0.0005222463,0.00021441565,0.019312793,0.00020459131,0.00005937557,0.000007833849,0.004121018,0.8204584,0.0050471816,0.044835664,0.10452992,0.00068654935],"about_ca_topic_score_codex":0.00006435975,"about_ca_topic_score_gemma":0.000025538522,"teacher_disagreement_score":0.78225636,"about_ca_system_score_codex":0.00019431995,"about_ca_system_score_gemma":0.0001138032,"threshold_uncertainty_score":0.86001784},"labels":[],"label_agreement":null},{"id":"W4401515398","doi":"10.1287/trsc.2023.0252","title":"A Unified Branch-Price-and-Cut Algorithm for Multicompartment Pickup and Delivery Problems","year":2024,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Compartment (ship); Benchmark (surveying); Computer science; Flexibility (engineering); Branch and cut; Pickup; Mathematical optimization; Running time; Algorithm; Operations research; Mathematics; Integer programming; Artificial intelligence; Statistics","score_opus":0.026585570824390187,"score_gpt":0.2830538029403578,"score_spread":0.25646823211596764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401515398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20175532,0.00038604767,0.7970058,0.00005443264,0.0001784008,0.0002696694,0.000021662961,0.00025433194,0.00007438329],"genre_scores_gemma":[0.7371734,0.00009228354,0.2625998,0.000020151894,0.000015628075,0.00003674361,0.000009325773,0.0000125489005,0.000040140763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992442,0.000007455666,0.00018097379,0.0002340355,0.00016155436,0.00017179562],"domain_scores_gemma":[0.99968404,0.00009028125,0.000014021253,0.00007366413,0.00005886632,0.000079125406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044533904,0.000088514666,0.00009111927,0.00012354934,0.00010040993,0.00010680586,0.000069021306,0.00002676451,0.000006978582],"category_scores_gemma":[0.000008871854,0.000085910695,0.000017563907,0.00039177938,0.00010952747,0.00032783582,0.000002373136,0.000054858072,0.00000220874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000652226,0.000025844953,0.00090177695,0.00068125717,0.00003862545,0.0000046837417,0.009960654,0.40156275,0.041494306,0.004845442,0.000060129543,0.54041797],"study_design_scores_gemma":[0.00023070858,0.000017928447,0.008484312,0.000045630924,0.000017154958,0.0000018597088,0.00004863386,0.9858733,0.003959372,0.00031521491,0.0008904115,0.00011548746],"about_ca_topic_score_codex":0.000008704054,"about_ca_topic_score_gemma":0.0000107578935,"teacher_disagreement_score":0.58431053,"about_ca_system_score_codex":0.00002931404,"about_ca_system_score_gemma":0.00003687424,"threshold_uncertainty_score":0.35033366},"labels":[],"label_agreement":null},{"id":"W4401541814","doi":"10.1007/978-981-97-3682-9_7","title":"Waste Collection Route Optimization for the City of Oshawa","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Vehicle Routing Optimization Methods","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":true,"ca_institutions":"Lakeridge Health; Ontario Tech University","funders":"","keywords":"Computer science; Business","score_opus":0.011512280624056128,"score_gpt":0.2306307699567984,"score_spread":0.21911848933274228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401541814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015894426,0.004003217,0.9901371,0.00008966804,0.0007380884,0.0006446121,0.00002346358,0.000412147,0.003935835],"genre_scores_gemma":[0.1674525,0.0030703521,0.81210154,0.00011896481,0.0024296572,0.00044578637,0.00024762593,0.0014704309,0.012663115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985622,0.000009664976,0.00054058176,0.0003121443,0.00023034925,0.00034504844],"domain_scores_gemma":[0.99822366,0.0012840296,0.00007665311,0.00027702277,0.00009058191,0.00004805988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003101901,0.00040489918,0.00047462378,0.00047111537,0.000044787197,0.000043693588,0.00021844957,0.0005650214,0.00004453772],"category_scores_gemma":[0.00046877694,0.00035940725,0.00020378287,0.0005181602,0.00002075009,0.00004981777,0.000033579392,0.0009291559,0.0000017879174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012558184,0.0000036107413,0.0000035375683,0.00026114745,0.00011695863,0.0000017011632,0.00005760815,0.9877826,0.00021325135,0.003947496,0.000030503059,0.0075690215],"study_design_scores_gemma":[0.0002029977,0.0000470178,0.0000030432223,0.00021572743,0.0001181336,0.000007886182,3.3848363e-7,0.9932233,0.002023385,0.0018431115,0.0019841555,0.00033092397],"about_ca_topic_score_codex":0.000006368892,"about_ca_topic_score_gemma":0.000007862713,"teacher_disagreement_score":0.17803551,"about_ca_system_score_codex":0.00041371613,"about_ca_system_score_gemma":0.00004325521,"threshold_uncertainty_score":0.9998858},"labels":[],"label_agreement":null},{"id":"W4401665365","doi":"10.1016/j.cor.2024.106807","title":"A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"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":"Fundamental Research Funds for the Central Universities; National University's Basic Research Foundation of China; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Computer science; Combinatorial auction; Branch and cut; Routing (electronic design automation); Combinatorial optimization; Algorithm; Common value auction; Mathematical optimization; Integer programming; Mathematics; Computer network","score_opus":0.023290804997226442,"score_gpt":0.3124205499573705,"score_spread":0.28912974496014404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401665365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005401353,0.0005356143,0.99064964,0.0012626087,0.00031064518,0.001174104,0.000024405226,0.00038440156,0.0002572096],"genre_scores_gemma":[0.44137576,0.00017073753,0.55313617,0.00006418268,0.0012280069,0.0008081336,0.00006167819,0.00020594975,0.0029493908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986797,0.00018328513,0.00020300433,0.00030085226,0.00029673125,0.0003364086],"domain_scores_gemma":[0.9985843,0.00088999723,0.0000065223053,0.00021410894,0.00021159397,0.00009349455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014128331,0.00013685177,0.00014419584,0.00017653726,0.00083218544,0.00088241586,0.0001683525,0.00006905821,0.000021268854],"category_scores_gemma":[0.000048835256,0.00010574239,0.000028237944,0.0005034151,0.00013942055,0.0002538745,0.00012034811,0.00040529165,0.000034562825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008227203,0.00002452863,0.000015404636,0.00006477349,0.00015293012,0.0000039511974,0.0013361849,0.85154766,0.0018607798,0.0022809182,0.0015918656,0.14111277],"study_design_scores_gemma":[0.00049432664,0.00009564355,0.000037082507,0.000078925055,0.000021480748,0.0000338177,0.00005079607,0.99691784,0.0004895432,0.00014995421,0.0015006195,0.00012997496],"about_ca_topic_score_codex":0.000032818534,"about_ca_topic_score_gemma":0.000008756381,"teacher_disagreement_score":0.4375135,"about_ca_system_score_codex":0.00009492296,"about_ca_system_score_gemma":0.000095085845,"threshold_uncertainty_score":0.8509157},"labels":[],"label_agreement":null},{"id":"W4402125184","doi":"10.1287/ijoc.2023.0404","title":"The Electric Vehicle Routing and Overnight Charging Scheduling Problem on a Multigraph","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Multigraph; Vehicle routing problem; Scheduling (production processes); Computer science; Parallel computing; Operations research; Mathematical optimization; Routing (electronic design automation); Mathematics; Computer network; Theoretical computer science","score_opus":0.010682196198372724,"score_gpt":0.25409578791987375,"score_spread":0.24341359172150104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402125184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82089233,0.001873731,0.17028148,0.00038361156,0.0011396665,0.00022461303,9.025213e-7,0.00086142664,0.0043422277],"genre_scores_gemma":[0.97849053,0.00024102507,0.020553036,0.00013825779,0.00048028733,0.0000019263107,5.4980023e-7,0.000058960002,0.000035408026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829984,0.00005824677,0.0005642548,0.00017603044,0.00035673383,0.00054490304],"domain_scores_gemma":[0.9986295,0.00092258194,0.00011315223,0.00013973122,0.00006193086,0.00013307943],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002010701,0.00023553486,0.00018573694,0.0002934167,0.00088875345,0.0011371515,0.00020304753,0.00008402823,0.0000038341773],"category_scores_gemma":[0.00022056856,0.00016191116,0.00009925112,0.00061820133,0.000022492286,0.00029980723,0.000048957445,0.0012519534,0.00002297932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009190151,0.000004750941,0.00043084694,0.000047306305,0.000065549284,0.000021692267,0.00083482475,0.7121342,0.001071873,0.0026071128,0.000046880206,0.28272578],"study_design_scores_gemma":[0.00026435105,0.00006961958,0.0006514183,0.0007210697,0.000010761749,0.00017188015,0.000109267356,0.99460447,0.0011256215,0.00022598534,0.0018336434,0.00021193874],"about_ca_topic_score_codex":0.0000017495668,"about_ca_topic_score_gemma":4.2386284e-7,"teacher_disagreement_score":0.28251383,"about_ca_system_score_codex":0.00016932184,"about_ca_system_score_gemma":0.000040632356,"threshold_uncertainty_score":0.99989974},"labels":[],"label_agreement":null},{"id":"W4402130536","doi":"10.1016/j.eswa.2024.125183","title":"Prize-collecting Electric Vehicle routing model for parcel delivery problem","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vehicle routing problem; Operations research; Service (business); Last mile (transportation); Electric vehicle; Outsourcing; Metaheuristic; Total cost; Loyalty; Routing (electronic design automation); Total cost of ownership; Integer programming; Quality of service; Work (physics); Business; Computer network; Engineering; Marketing","score_opus":0.022918078238572306,"score_gpt":0.2738865281985426,"score_spread":0.2509684499599703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402130536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021936947,0.0028094873,0.9885528,0.00007732019,0.0000941237,0.0020872222,0.0000131256575,0.0018752442,0.0022969602],"genre_scores_gemma":[0.7716752,0.000046240624,0.21968809,0.00002455835,0.00028218568,0.0071685463,0.000019636802,0.00014117427,0.00095433934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985874,0.000038911134,0.0004064965,0.00038502473,0.00017941197,0.00040274023],"domain_scores_gemma":[0.99910873,0.00029909037,0.000052389412,0.0003166074,0.00012636698,0.00009679464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044783598,0.00021674653,0.00022273927,0.00017716663,0.0003167082,0.00022772381,0.00018338922,0.00010540886,0.0000027645924],"category_scores_gemma":[0.000019682471,0.00020321556,0.00006225312,0.0009387988,0.0000146130305,0.00017393098,0.000019660827,0.00017766989,0.000020354279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005178053,0.00001640262,0.0000345067,0.00030913335,0.00007238946,6.5651426e-7,0.0013601207,0.9688943,0.018741459,0.0041815587,0.001253886,0.0051304162],"study_design_scores_gemma":[0.00019728695,0.000018140023,0.0000041254675,0.00013866,0.000021601267,0.0000196262,0.0001529465,0.9916581,0.0010927132,0.00010383852,0.0063308594,0.00026210502],"about_ca_topic_score_codex":0.00002753447,"about_ca_topic_score_gemma":0.0000035422888,"teacher_disagreement_score":0.76948154,"about_ca_system_score_codex":0.00024095134,"about_ca_system_score_gemma":0.00010744392,"threshold_uncertainty_score":0.82868904},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013122357018105244,"score_gpt":0.24962707871012074,"score_spread":0.2365047216920155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402615264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0427496,0.0005651257,0.9548364,0.0002351205,0.00021612593,0.00045937006,0.000054133685,0.00036039468,0.00052371825],"genre_scores_gemma":[0.96672106,0.00013793033,0.03238757,0.00012916519,0.00025044335,0.00001241422,0.000049894774,0.00008879405,0.00022275327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998736,0.000091062924,0.00040727525,0.00024813527,0.00024202338,0.00027548865],"domain_scores_gemma":[0.99925965,0.00032247955,0.00009015686,0.00008893336,0.000098935256,0.00013985204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064042635,0.00022231815,0.0002369655,0.000112781076,0.00021140819,0.00024302593,0.00006180187,0.000067597095,0.000029381425],"category_scores_gemma":[0.00006452072,0.00019272909,0.000041675685,0.00023380885,0.00004019441,0.00012994139,0.00000207772,0.00033770487,0.000013534971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012843883,0.000023663868,0.0002981761,0.00012790298,0.00009075161,0.000070501286,0.00036515118,0.9797353,0.000519114,0.0013287879,0.00014390063,0.017168306],"study_design_scores_gemma":[0.0011175754,0.0005276068,0.002474643,0.0003775401,0.00019755385,0.000048944315,0.000018956169,0.99385995,0.00014467062,0.00042311096,0.0005600483,0.00024939465],"about_ca_topic_score_codex":0.0000019644604,"about_ca_topic_score_gemma":0.0000040102964,"teacher_disagreement_score":0.9239714,"about_ca_system_score_codex":0.000057334288,"about_ca_system_score_gemma":0.000039476978,"threshold_uncertainty_score":0.78592646},"labels":[],"label_agreement":null},{"id":"W4402669414","doi":"10.1016/j.omega.2024.103196","title":"Strategic expansion of freight transportation hub networks under demand uncertainty","year":2024,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"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":"Traffic management; Business; Transport engineering; Industrial organization; Operations research; Engineering","score_opus":0.020982257667322944,"score_gpt":0.2583771455770698,"score_spread":0.23739488790974686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402669414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27483413,0.0011877072,0.7207134,0.00002515288,0.000433358,0.000084807965,0.000006589261,0.00035546583,0.0023594298],"genre_scores_gemma":[0.98801076,0.00013172634,0.0115893,0.000011368846,0.00007367702,0.000005932048,0.00004567807,0.0000325461,0.000099021025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.00003168666,0.00021685079,0.00012692263,0.00010920768,0.00013579568],"domain_scores_gemma":[0.9997211,0.00007769144,0.000017219092,0.00011822763,0.000026771188,0.00003898788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019353643,0.0000996269,0.00012286416,0.000076415934,0.000023362023,0.000027501108,0.000059243022,0.00009460842,0.00008224196],"category_scores_gemma":[0.000003218939,0.00009504818,0.000047974292,0.00032739094,0.000018537876,0.00009484366,0.000002315362,0.00012801486,0.000005613745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028411885,0.0000035208889,0.00009260317,0.000084386345,0.000024327559,0.0000035880214,0.00018426146,0.9902917,0.0019023836,0.0054489584,0.00010821256,0.0018532051],"study_design_scores_gemma":[0.0001274266,0.000014225018,0.0007315653,0.00008839878,0.000025898438,0.0000012522012,0.000096494165,0.9954397,0.0015285083,0.0016635826,0.00017428504,0.00010865282],"about_ca_topic_score_codex":0.0000073824626,"about_ca_topic_score_gemma":0.000012744938,"teacher_disagreement_score":0.7131766,"about_ca_system_score_codex":0.00003291184,"about_ca_system_score_gemma":0.000019700654,"threshold_uncertainty_score":0.3875952},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04209613403359662,"score_gpt":0.28176092578484135,"score_spread":0.23966479175124472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402827990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018145742,0.0004197114,0.9798648,0.0001692957,0.00038341345,0.00018819937,0.00006946898,0.00027785008,0.00048151767],"genre_scores_gemma":[0.91726184,0.00019699644,0.08196922,0.00013639146,0.00016504372,0.0000058728842,0.00006554129,0.000059118658,0.00013997176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989055,0.00007101058,0.00045261765,0.00017234456,0.0001887277,0.00020981632],"domain_scores_gemma":[0.99912524,0.00050924125,0.000054958815,0.00007464937,0.00011798255,0.00011794668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010926194,0.00015136345,0.00017322296,0.0001628538,0.0001298768,0.00016006337,0.000065681554,0.00008186427,0.00006407544],"category_scores_gemma":[0.00018407217,0.00014581138,0.00007941029,0.0002962237,0.00003724312,0.00010828043,0.0000014325836,0.00037227917,0.000005530768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024955241,0.000021880962,0.000452868,0.00029018108,0.000057271638,0.000019755404,0.00050141686,0.9796565,0.0006046669,0.0076599987,0.00021237186,0.010498129],"study_design_scores_gemma":[0.00029264032,0.00009474937,0.001046492,0.00012529558,0.00008725281,0.000012388012,0.00010291252,0.99199045,0.0002290731,0.0028772582,0.0029428846,0.00019859789],"about_ca_topic_score_codex":0.0000017317694,"about_ca_topic_score_gemma":0.0000039104543,"teacher_disagreement_score":0.8991161,"about_ca_system_score_codex":0.00010931544,"about_ca_system_score_gemma":0.00005017224,"threshold_uncertainty_score":0.5946016},"labels":[],"label_agreement":null},{"id":"W4403210609","doi":"10.1109/icecet61485.2024.10698631","title":"Electric-vehicle routing problem with time windows and energy minimization: green logistics with same-day delivery approaches","year":2024,"lang":"en","type":"article","venue":"","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":"Concordia University","funders":"","keywords":"Vehicle routing problem; Minification; Computer science; Energy minimization; Routing (electronic design automation); Energy (signal processing); Mathematical optimization; Automotive engineering; Engineering; Embedded system; Mathematics; World Wide Web; Physics","score_opus":0.01817089141925737,"score_gpt":0.20366100383655444,"score_spread":0.18549011241729707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403210609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004817957,0.0006842484,0.9733732,0.00020585823,0.000034505392,0.00016724331,0.000005211476,0.0014505098,0.019261314],"genre_scores_gemma":[0.6473931,0.00007978244,0.34632272,0.000106358784,0.0001589731,0.000038110073,0.0000320677,0.00016059435,0.0057083275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987435,0.00008649742,0.00025032705,0.00036281827,0.00021307732,0.0003438189],"domain_scores_gemma":[0.99937165,0.0002356739,0.00003363749,0.00019020787,0.00006626068,0.00010257186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026544943,0.0002621195,0.00023061024,0.00014493028,0.000096271164,0.00018648565,0.00010950068,0.000111365785,0.000056438395],"category_scores_gemma":[0.000018761011,0.00020261505,0.00002296354,0.0006909294,0.000052503925,0.00019874718,0.000038393875,0.00017924399,0.00001051967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001855444,0.000016210737,0.00087378226,0.00014042815,0.00015495354,0.000026532767,0.00041263647,0.9399621,0.00052052253,0.003456338,0.00037960705,0.054038357],"study_design_scores_gemma":[0.00027004434,0.000102578706,0.00011558577,0.000089587535,0.00007141763,0.00005778871,0.00006161465,0.99568725,0.0016142313,0.000068557696,0.0015258089,0.00033556385],"about_ca_topic_score_codex":0.00007687259,"about_ca_topic_score_gemma":0.000030315161,"teacher_disagreement_score":0.64257514,"about_ca_system_score_codex":0.00007098515,"about_ca_system_score_gemma":0.000057968024,"threshold_uncertainty_score":0.8262402},"labels":[],"label_agreement":null},{"id":"W4403238270","doi":"10.1007/s12532-024-00262-y","title":"Local elimination in the traveling salesman problem","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","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":"University of Waterloo","funders":"Rheinische Friedrich-Wilhelms-Universität Bonn; Deutsche Forschungsgemeinschaft","keywords":"Travelling salesman problem; Theory of computation; Mathematical optimization; Computer science; Mathematics; Algorithm","score_opus":0.020716518062968307,"score_gpt":0.2932313392360823,"score_spread":0.272514821173114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403238270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008115669,0.00011515527,0.9887057,0.00031516116,0.00009092921,0.00040586045,3.821202e-7,0.00069021503,0.0015609486],"genre_scores_gemma":[0.6905298,0.000001925215,0.30932432,0.000013484046,0.000033038486,0.000049710998,0.0000117406,0.000025051968,0.000010870704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989378,0.000105759165,0.00035053852,0.00015633323,0.00024171191,0.00020787239],"domain_scores_gemma":[0.99938536,0.0004541098,0.000017661729,0.00008761892,0.000027763246,0.000027518681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011844833,0.00012280319,0.000119276265,0.00010719087,0.000050186045,0.00033216787,0.00010906058,0.00007033758,0.0000065909035],"category_scores_gemma":[0.00005639661,0.00009651205,0.00004383359,0.00055693364,0.000039201524,0.00019241011,0.000011567083,0.00023744217,0.00004733158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.663873e-7,0.000029174993,0.0000052019655,0.00052028237,0.000008290336,0.000008798793,0.0031099936,0.49720648,0.00003576117,0.022553487,0.00003416882,0.4764875],"study_design_scores_gemma":[0.00008373784,0.0000201266,0.000092466275,0.00020140306,0.000014610394,0.000024281542,0.0003635208,0.97577864,0.000068800386,0.022995532,0.00024776036,0.000109099914],"about_ca_topic_score_codex":0.0000011983566,"about_ca_topic_score_gemma":0.0000014386588,"teacher_disagreement_score":0.6824142,"about_ca_system_score_codex":0.00008132537,"about_ca_system_score_gemma":0.0000113831675,"threshold_uncertainty_score":0.39356473},"labels":[],"label_agreement":null},{"id":"W4403268005","doi":"10.1016/j.tcs.2024.114900","title":"Algorithms for the thief orienteering problem on directed acyclic graphs","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Directed acyclic graph; Computer science; Combinatorics; Mathematics; Directed graph; Theoretical computer science; Algorithm; Mathematical optimization","score_opus":0.014807567598796405,"score_gpt":0.2794228516752325,"score_spread":0.2646152840764361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403268005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034790074,0.0001048591,0.9914302,0.00038327425,0.0013042801,0.00029495778,0.0000035484334,0.0013790828,0.0016207589],"genre_scores_gemma":[0.6274757,0.000011957526,0.37221667,0.00008614499,0.00013858378,0.00003311914,7.8743756e-7,0.000025403011,0.000011683268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987762,0.000038244412,0.00017311834,0.00032788992,0.00030526344,0.00037931572],"domain_scores_gemma":[0.998584,0.0009502848,0.000009688089,0.00030269555,0.00006277819,0.000090579764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013726874,0.0001388176,0.0001095507,0.00012719871,0.00026774564,0.00034658157,0.000563754,0.00003770653,0.000018815243],"category_scores_gemma":[0.000087857276,0.00009095445,0.000060392696,0.0011256823,0.00069031684,0.00013745604,0.00010576634,0.00020553933,0.00001884734],"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.000002832454,0.000006720777,0.0000031539903,0.000029177572,0.000010162858,0.0000015516126,0.0003248805,0.14191088,0.000390213,0.7640412,0.000101645324,0.09317758],"study_design_scores_gemma":[0.00006877878,0.00005636549,0.00006575706,0.00006730098,0.000009177382,0.0000068174386,0.000004050284,0.9653233,0.0029692906,0.030560207,0.0007447116,0.0001241896],"about_ca_topic_score_codex":5.249317e-7,"about_ca_topic_score_gemma":7.788539e-8,"teacher_disagreement_score":0.8234125,"about_ca_system_score_codex":0.000050574257,"about_ca_system_score_gemma":0.000023008291,"threshold_uncertainty_score":0.37090147},"labels":[],"label_agreement":null},{"id":"W4403306216","doi":"10.1080/01605682.2024.2412214","title":"An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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; Giro (Canada); Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dial; Scale (ratio); Purchasing; Project management; Algorithm; Operations research; Mathematical optimization; Economics; Mathematics; Operations management; Engineering; Management; Electrical engineering","score_opus":0.04458444319968899,"score_gpt":0.40219240256818095,"score_spread":0.357607959368492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403306216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058431424,0.0015140071,0.9269698,0.012150154,0.00022571284,0.00045876077,0.00004530811,0.000040779334,0.0001640554],"genre_scores_gemma":[0.12592499,0.0013230856,0.87141365,0.0001428981,0.0007332024,0.000026139245,0.0000036067147,0.000042930493,0.00038949674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986591,0.00022270012,0.00025233437,0.00013251057,0.0005023297,0.00023107514],"domain_scores_gemma":[0.99837744,0.0010373568,0.000027302727,0.000087609566,0.00032432924,0.00014595012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051544644,0.00008594979,0.00013536093,0.0000465409,0.00032281445,0.0004255789,0.000105937506,0.00008292817,0.00001988074],"category_scores_gemma":[0.00041676368,0.00005878121,0.00008605712,0.00019324287,0.00009503598,0.00052645535,0.00007131892,0.0006326152,7.425746e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002666753,0.0008013467,0.0044814693,0.0028740596,0.002754667,0.00005689418,0.049317736,0.21955904,0.13641961,0.046260484,0.14734074,0.38986728],"study_design_scores_gemma":[0.00036492324,0.00008714286,0.00081265566,0.00007593977,0.000019644993,0.0001638686,0.00025577025,0.98766553,0.000797179,0.0020774528,0.0076049278,0.00007498032],"about_ca_topic_score_codex":0.0000021916467,"about_ca_topic_score_gemma":0.0000023508312,"teacher_disagreement_score":0.76810646,"about_ca_system_score_codex":0.00009354714,"about_ca_system_score_gemma":0.00029523877,"threshold_uncertainty_score":0.41038674},"labels":[],"label_agreement":null},{"id":"W4403496846","doi":"10.3390/engproc2024076017","title":"Formulation and Solution of the Stochastic Truck and Trailer Routing Problem","year":2024,"lang":"en","type":"article","venue":"","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":"University of Regina","funders":"","keywords":"Trailer; Truck; Routing (electronic design automation); Computer science; Vehicle routing problem; Mathematical optimization; Operations research; Automotive engineering; Engineering; Computer network; Mathematics","score_opus":0.013600623187200154,"score_gpt":0.24183447012161718,"score_spread":0.22823384693441703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403496846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16588156,0.00017430107,0.8323205,0.00007891505,0.000083170984,0.00012811997,0.0000012419301,0.00015621383,0.0011759731],"genre_scores_gemma":[0.96010274,0.0000043794007,0.039749295,0.000004578163,0.000016816904,0.0000028581394,6.075091e-7,0.000011635046,0.00010710561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967045,0.000016140772,0.000119301825,0.00006921793,0.000054756176,0.00007014478],"domain_scores_gemma":[0.999847,0.00006654325,0.000010849071,0.000049695052,0.000011703735,0.000014213232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019438143,0.000049965205,0.000054160264,0.00003150636,0.00003363858,0.000027329945,0.000020480355,0.000033005068,0.000008804276],"category_scores_gemma":[0.000024385366,0.000036104357,0.000012644068,0.00011557453,0.000013626231,0.00009684458,0.00001779296,0.000056651297,4.192774e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022504291,0.0000033912809,0.00096118456,0.00033985762,0.000030957373,1.3259933e-7,0.0021514923,0.87492424,0.015287016,0.025105355,0.00006110249,0.08113302],"study_design_scores_gemma":[0.00006811866,0.000005055157,0.004826549,0.00006314968,0.000012664388,0.0000047927138,0.000025609948,0.99352306,0.00074627425,0.0006622493,0.000018899656,0.000043548745],"about_ca_topic_score_codex":0.000004663221,"about_ca_topic_score_gemma":0.0000035236628,"teacher_disagreement_score":0.79422116,"about_ca_system_score_codex":0.000013853278,"about_ca_system_score_gemma":0.0000051919556,"threshold_uncertainty_score":0.1472293},"labels":[],"label_agreement":null},{"id":"W4403556658","doi":"10.1002/net.22251","title":"Layered Graph Models for the Electric Vehicle Routing Problem With Nonlinear Charging Functions","year":2024,"lang":"en","type":"article","venue":"Networks","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":"HEC Montréal","funders":"","keywords":"Vehicle routing problem; Nonlinear system; Electric vehicle; Computer science; Graph; Mathematical optimization; Routing (electronic design automation); Mathematics; Computer network; Theoretical computer science; Physics; Power (physics)","score_opus":0.015748927321926454,"score_gpt":0.23598880879591413,"score_spread":0.22023988147398768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403556658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015579894,0.0022943444,0.9929009,0.0001783415,0.00035319218,0.00045833754,0.0000048434185,0.0010871307,0.0011649047],"genre_scores_gemma":[0.9171853,0.00014135671,0.08129497,0.0000634559,0.0006946359,0.00019205379,0.00001793573,0.00012555059,0.00028475965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903154,0.000033244334,0.0002011291,0.00021772245,0.000118941396,0.0003974359],"domain_scores_gemma":[0.99923915,0.00042742217,0.000023706147,0.00020397751,0.000057404955,0.00004834421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034655,0.00016099242,0.00013167893,0.000087138666,0.0002561093,0.00017083164,0.00013295608,0.00009074459,0.000009972554],"category_scores_gemma":[0.0000121432195,0.00011741784,0.000073256495,0.0009352376,0.000015005379,0.00017011717,0.000017329898,0.00036073272,0.000004711252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007901795,0.000004603713,0.000039624527,0.000035337573,0.00008458628,0.0000010427898,0.00014209488,0.9730016,0.00012385794,0.0009239098,0.0006630578,0.024972389],"study_design_scores_gemma":[0.00018423627,0.00002771521,0.000021157366,0.000084535655,0.00006040674,0.000007630428,0.000038924223,0.9976991,0.00007278398,0.0002178611,0.0014276231,0.00015806036],"about_ca_topic_score_codex":0.0000065035083,"about_ca_topic_score_gemma":0.0000071003915,"teacher_disagreement_score":0.9156273,"about_ca_system_score_codex":0.000053043583,"about_ca_system_score_gemma":0.000024901881,"threshold_uncertainty_score":0.47881606},"labels":[],"label_agreement":null},{"id":"W4403616496","doi":"10.1007/s10479-024-06351-4","title":"Migratory beekeeping routing: a combinatorial optimization problem in apiculture","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beekeeping; Theory of computation; Varroa; Computer science; Combinatorial optimization; Routing (electronic design automation); Mathematical optimization; Mathematics; Biology; Honey bee; Computer network; Ecology; Algorithm","score_opus":0.11323461520207793,"score_gpt":0.417617561499046,"score_spread":0.30438294629696805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403616496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3999031,0.010537903,0.5426433,0.00855588,0.0023442826,0.003886622,0.00010096593,0.0020430908,0.029984893],"genre_scores_gemma":[0.9332458,0.0003875648,0.06586675,0.000017849068,0.00014728722,0.00008822259,0.00003924547,0.00004391221,0.00016339456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983387,0.00031419034,0.00039768152,0.00021716247,0.00039800513,0.0003342541],"domain_scores_gemma":[0.9990739,0.00017697118,0.000007768412,0.00019388266,0.00048068096,0.00006675823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022442841,0.00010226209,0.000160122,0.0005436646,0.00012483129,0.00021312981,0.00018273406,0.00013456045,0.00005425064],"category_scores_gemma":[0.0003619892,0.00011057158,0.000047406542,0.0017005232,0.000060510392,0.00038563908,0.000050202743,0.0005028763,0.000017711582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033631138,0.0000325568,0.00007783851,0.00012506919,0.000020992284,0.0000050764143,0.0014786606,0.98148584,0.0021924677,0.011544476,0.0011281213,0.0019055252],"study_design_scores_gemma":[0.00013816258,0.000035737852,0.00010602601,0.0002287859,0.0000023432856,0.0000020829978,0.0002284117,0.991545,0.006631266,0.0002106865,0.0007596763,0.00011181784],"about_ca_topic_score_codex":0.00006987034,"about_ca_topic_score_gemma":0.000029177352,"teacher_disagreement_score":0.5333427,"about_ca_system_score_codex":0.00006142162,"about_ca_system_score_gemma":0.0001293659,"threshold_uncertainty_score":0.45089778},"labels":[],"label_agreement":null},{"id":"W4404094938","doi":"10.1016/j.cor.2024.106890","title":"Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","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":"HEC Montréal","funders":"","keywords":"Task (project management); Routing (electronic design automation); Computer science; Vehicle routing problem; Health care; Operations research; Emergency vehicle; Medical emergency; Aeronautics; Computer network; Transport engineering; Real-time computing; Systems engineering; Engineering; Medicine","score_opus":0.047266171689287956,"score_gpt":0.36209067222948693,"score_spread":0.31482450054019895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404094938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20665814,0.0014173475,0.7896361,0.000721632,0.00035872293,0.00087554456,0.00006540116,0.00023042661,0.000036725818],"genre_scores_gemma":[0.77486193,0.0001795269,0.22445536,0.000014424571,0.00015917241,0.00016952715,0.000066404864,0.000051455656,0.000042208725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827325,0.00023109581,0.0004209811,0.00035900783,0.0003205066,0.00039512684],"domain_scores_gemma":[0.9990394,0.0001856198,0.000010735217,0.000256521,0.0003801465,0.00012759032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085749367,0.00017125142,0.00021873265,0.0003093716,0.0005293116,0.00035911307,0.00020767265,0.000083376064,0.00001403779],"category_scores_gemma":[0.000028928887,0.00016154101,0.00004477186,0.0005809854,0.00006426605,0.0002743833,0.00010917334,0.00023571786,0.0000028530685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140258435,0.000019249812,0.000046127832,0.00046066713,0.00008551447,0.0000034683253,0.0033887639,0.9817688,0.00802018,0.0011409349,0.000066715475,0.0049855676],"study_design_scores_gemma":[0.0002905088,0.000199226,0.000029680099,0.00026005943,0.000015600375,0.000012468323,0.00041946536,0.99403805,0.0043151244,0.000022581908,0.00023656046,0.00016070105],"about_ca_topic_score_codex":0.0001328956,"about_ca_topic_score_gemma":0.00029063207,"teacher_disagreement_score":0.5682038,"about_ca_system_score_codex":0.00011673288,"about_ca_system_score_gemma":0.00011666822,"threshold_uncertainty_score":0.65874517},"labels":[],"label_agreement":null},{"id":"W4404202501","doi":"10.1016/j.trc.2024.104892","title":"Online algorithms for the multi-vehicle inventory-routing problem with real-time demands","year":2024,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"GLS Industries (Canada); Université Laval","funders":"","keywords":"Vehicle routing problem; Computer science; Routing algorithm; Routing (electronic design automation); Transport engineering; Algorithm; Real-time computing; Operations research; Engineering; Computer network; Routing protocol","score_opus":0.08574787846066453,"score_gpt":0.3780584446576243,"score_spread":0.2923105661969597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404202501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114502296,0.002415151,0.85708964,0.0054502804,0.0002770456,0.0025124475,0.00020007293,0.017315647,0.00023739538],"genre_scores_gemma":[0.46553215,0.002166143,0.52958405,0.000010511969,0.00012557927,0.00117033,0.00022389929,0.00020998572,0.0009773141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804246,0.00006485066,0.000410805,0.00038829324,0.0004658485,0.00062772044],"domain_scores_gemma":[0.9987004,0.0006194654,0.000036292215,0.0003568823,0.0002410487,0.000045901565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016495177,0.00021448093,0.00020295421,0.00036707486,0.00039812407,0.00013578773,0.00043215934,0.00016836834,0.000024369085],"category_scores_gemma":[0.00014111829,0.00015612962,0.00007451367,0.001396637,0.00025484437,0.00023236957,0.000019013169,0.0006191112,0.000013879653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049054415,0.00014602012,0.004374634,0.0013193163,0.0005440505,0.000052598298,0.0037963819,0.8056002,0.011012814,0.008927895,0.0057144426,0.15846257],"study_design_scores_gemma":[0.0003531621,0.000083848914,0.000484732,0.00031308655,0.00003904686,0.000001247879,0.0019788234,0.9804533,0.00544754,0.00045505707,0.010164,0.0002261485],"about_ca_topic_score_codex":0.000061532075,"about_ca_topic_score_gemma":0.00014787636,"teacher_disagreement_score":0.35102987,"about_ca_system_score_codex":0.00009107563,"about_ca_system_score_gemma":0.000064162836,"threshold_uncertainty_score":0.63667816},"labels":[],"label_agreement":null},{"id":"W4404299638","doi":"10.1287/ijoc.2023.0061","title":"An Iterative Exact Algorithm over a Time-Expanded Network for the Transportation of Biomedical Samples","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Concordia University; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Flow network; Computer science; Mathematical optimization; Mathematics","score_opus":0.01660145908052911,"score_gpt":0.30073011913337855,"score_spread":0.2841286600528494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404299638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046761982,0.00016572546,0.9519171,0.000044592212,0.00076432084,0.00013960128,0.000021994369,0.00014190201,0.000042749838],"genre_scores_gemma":[0.55886835,0.00003257931,0.43966502,0.00009621085,0.0012360971,0.00000342976,0.000041830812,0.000043281285,0.000013188931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894726,0.000029695653,0.00049471715,0.00008400914,0.00022708606,0.0002172247],"domain_scores_gemma":[0.99872404,0.00094539375,0.00009145119,0.000089912246,0.0000750637,0.000074107964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010246362,0.0001255904,0.00017294777,0.00010984787,0.00015902714,0.0001672245,0.0001440987,0.00006827566,0.000039746483],"category_scores_gemma":[0.000046423127,0.00008168388,0.0001083204,0.00029480763,0.000030572493,0.00025321057,0.000004180889,0.00030217902,0.0000024677088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009398356,0.000006614058,0.00006947386,0.000026956279,0.000078958445,0.0000026370885,0.0012520662,0.6999509,0.00015526856,0.00017043443,0.00042070195,0.29785663],"study_design_scores_gemma":[0.00027425887,0.0001490959,0.0019487065,0.00027296995,0.000025653198,0.000020301834,0.000059386286,0.9940684,0.00025512837,0.00024201417,0.0025822746,0.000101853315],"about_ca_topic_score_codex":0.0000023758673,"about_ca_topic_score_gemma":5.309706e-7,"teacher_disagreement_score":0.5122521,"about_ca_system_score_codex":0.000049934504,"about_ca_system_score_gemma":0.000040444767,"threshold_uncertainty_score":0.33309722},"labels":[],"label_agreement":null},{"id":"W4404443165","doi":"10.1016/j.cie.2024.110730","title":"Set Covering Routing Problems: A review and classification scheme","year":2024,"lang":"en","type":"review","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École Nationale d'Administration Publique; Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; Gina Cody School of Engineering and Computer Science, Concordia University","keywords":"Classification scheme; Scheme (mathematics); Routing (electronic design automation); Set (abstract data type); Computer science; Operations research; Engineering; Computer network; Mathematics; Information retrieval","score_opus":0.12311227486092223,"score_gpt":0.32317628869671466,"score_spread":0.20006401383579242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404443165","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013802644,0.9311047,0.0642157,0.00002168642,0.001826665,0.0011297471,0.000032599128,0.0015793201,0.00008816765],"genre_scores_gemma":[0.000007639462,0.98378974,0.0147792995,0.000016873473,0.0008148712,0.00014778176,0.000121068646,0.00028592502,0.000036813522],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743044,0.000094864256,0.0011399104,0.00060559326,0.0002221908,0.0005069782],"domain_scores_gemma":[0.9988836,0.0002540863,0.00017831357,0.0004560657,0.000039808012,0.00018811664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008579678,0.0007849937,0.001839336,0.0003949051,0.000060840164,0.0002658739,0.0003693509,0.00061802357,0.000008746411],"category_scores_gemma":[0.0002283132,0.0007954251,0.00029159157,0.0010746496,0.00002346522,0.00019353756,0.00023343368,0.0015789043,0.000048859278],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5140985e-7,0.0000039268716,6.842746e-7,0.124283746,0.00049767044,0.000012470835,0.00008871315,0.059482053,0.000005028632,0.00024920638,0.0032618146,0.81211436],"study_design_scores_gemma":[0.00010992475,0.000008572764,1.3647039e-7,0.08093744,0.0009657914,0.00006317467,0.0000023055027,0.34059635,4.5160576e-7,0.0000010656237,0.57678646,0.00052834785],"about_ca_topic_score_codex":0.000001761569,"about_ca_topic_score_gemma":9.851511e-8,"teacher_disagreement_score":0.81158596,"about_ca_system_score_codex":0.0004079827,"about_ca_system_score_gemma":0.00010133813,"threshold_uncertainty_score":0.9994497},"labels":[],"label_agreement":null},{"id":"W4404536325","doi":"10.1287/inte.2023.0069","title":"Freight Gateway Consolidation for Purolator International Using Integer Programming","year":2024,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","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":"McMaster University; DuPont (Canada); Saint Mary's University","funders":"","keywords":"Consolidation (business); Integer programming; Gateway (web page); Computer science; Business; Operations research; Computer network; Engineering; World Wide Web; Finance; Algorithm","score_opus":0.028474612331637006,"score_gpt":0.300931678086638,"score_spread":0.272457065755001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404536325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104366,0.000052689393,0.9823263,0.00010362536,0.0014319175,0.00022351573,0.000012980248,0.0003065037,0.005105859],"genre_scores_gemma":[0.77740484,0.000062244144,0.22127606,0.00015844672,0.00082557526,0.000015968853,0.000032886594,0.00008284328,0.0001411546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987722,0.0000066623834,0.0005386713,0.00012557623,0.00028985654,0.00026704048],"domain_scores_gemma":[0.9994108,0.00012829764,0.000093240196,0.00011368701,0.00013619335,0.00011774392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060444925,0.00018397954,0.00017899828,0.00042877463,0.000110264635,0.00063727907,0.00018607551,0.00011629084,0.00007887663],"category_scores_gemma":[0.00007967942,0.0001558867,0.0001234787,0.0003144426,0.000026414406,0.0003148315,0.000021015796,0.00043996307,0.00003119931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025518206,0.000014171359,0.00005471121,0.00007959618,0.00026537816,0.0000088038105,0.00024910623,0.91064274,0.001346511,0.016091345,0.0005561034,0.07066604],"study_design_scores_gemma":[0.00029932134,0.000025245487,0.0000082832275,0.0000974613,0.000051300027,0.0000715461,0.0000872753,0.9334801,0.0025473863,0.00095893635,0.062181443,0.00019172813],"about_ca_topic_score_codex":2.7896456e-7,"about_ca_topic_score_gemma":2.58403e-7,"teacher_disagreement_score":0.7669682,"about_ca_system_score_codex":0.00030794818,"about_ca_system_score_gemma":0.00007127048,"threshold_uncertainty_score":0.63568753},"labels":[],"label_agreement":null},{"id":"W4404595747","doi":"10.1155/2024/5754231","title":"An Interval Integrated Optimization to Air‐Cargo Hub Network Design and Airline Fleet Planning","year":2024,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; Civil Aviation Administration of China; National Science Foundation","keywords":"Interval (graph theory); Network planning and design; Air cargo; Transport engineering; Operations research; Air travel; Aviation; Computer science; Marine engineering; Engineering; Telecommunications; Aerospace engineering; Mathematics","score_opus":0.014839273126343483,"score_gpt":0.29033313804278993,"score_spread":0.27549386491644645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404595747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08710246,0.00064768066,0.9111521,0.000085414125,0.00067616766,0.00013705876,0.0000048592537,0.00018431227,0.000009921498],"genre_scores_gemma":[0.41011444,0.00007262997,0.5895725,0.0000323379,0.00013938078,0.00000281781,0.000026535401,0.000034592467,0.0000047579315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989385,0.00007238322,0.0005343966,0.00013353978,0.00016016989,0.00016103436],"domain_scores_gemma":[0.9994815,0.00010088945,0.00008230514,0.00007408195,0.0001345492,0.0001266677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005485281,0.00014842342,0.00021446278,0.00021495408,0.00004269238,0.000055658635,0.00008244995,0.00007136863,0.000013456062],"category_scores_gemma":[0.000027640119,0.00014334911,0.0000460619,0.00048380677,0.000011348065,0.0007285199,0.0000012287002,0.00024587923,7.848722e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101171725,0.000008640346,0.00013728991,0.000051007715,0.000041609994,0.00003272445,0.0019092553,0.98147935,0.0022081488,0.000058595673,0.0000763859,0.013895814],"study_design_scores_gemma":[0.00034284862,0.000271634,0.0025103288,0.00055311446,0.000062883715,0.000022249287,0.0002675782,0.99378884,0.0014448444,0.00013334338,0.00044093857,0.00016137873],"about_ca_topic_score_codex":7.748905e-7,"about_ca_topic_score_gemma":0.0000020111281,"teacher_disagreement_score":0.32301196,"about_ca_system_score_codex":0.00006389312,"about_ca_system_score_gemma":0.000031067062,"threshold_uncertainty_score":0.5845607},"labels":[],"label_agreement":null},{"id":"W4404612065","doi":"10.1145/3678717.3691208","title":"EFECTIW-ROTER: Deep Reinforcement Learning Approach for Solving Heterogeneous Fleet and Demand Vehicle Routing Problem With Time-Window Constraints","year":2024,"lang":"en","type":"article","venue":"","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":true,"ca_institutions":"National Research Council Canada; University of Calgary","funders":"","keywords":"Reinforcement learning; Vehicle routing problem; Computer science; Window (computing); Routing (electronic design automation); Artificial intelligence; Operations research; Real-time computing; Computer network; Engineering; World Wide Web","score_opus":0.010073285972453673,"score_gpt":0.22795512371466814,"score_spread":0.21788183774221448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404612065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043679405,0.0002852533,0.9471446,0.000017596305,0.000046448586,0.00073212554,0.0000011425685,0.0010572126,0.0070362114],"genre_scores_gemma":[0.71454847,0.00001152155,0.28485692,0.000019969699,0.000054381857,0.000059802875,0.000016541122,0.00007736457,0.00035504682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986553,0.000046696186,0.0003188207,0.0003714129,0.0001619528,0.00044578183],"domain_scores_gemma":[0.9994091,0.0002544441,0.0000385305,0.00013760843,0.00004965581,0.000110676825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008457622,0.0002574741,0.0002511715,0.000113520786,0.00021973359,0.00029707944,0.00008497886,0.00010537232,0.00006413918],"category_scores_gemma":[0.00005478102,0.00022908537,0.00005592054,0.00019292536,0.000062564046,0.0001952084,0.00005178816,0.00028878657,0.000008852315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011381295,0.0000056654217,0.00047988654,0.00040175536,0.00013714534,0.0000054557486,0.0006917473,0.97783554,0.004699163,0.00017349768,0.000015432688,0.015543313],"study_design_scores_gemma":[0.0005245324,0.00011792621,0.000021453767,0.00012974521,0.000054631324,0.00009884133,0.00011339921,0.9913825,0.007134543,0.000019186176,0.000097299926,0.000305972],"about_ca_topic_score_codex":0.0000042699035,"about_ca_topic_score_gemma":0.000001508704,"teacher_disagreement_score":0.67086905,"about_ca_system_score_codex":0.000083081046,"about_ca_system_score_gemma":0.000023034103,"threshold_uncertainty_score":0.93418306},"labels":[],"label_agreement":null},{"id":"W4404632811","doi":"10.1016/j.trc.2024.104932","title":"The Heterogeneous-Fleet Electric Vehicle Routing Problem with Nonlinear Charging Functions","year":2024,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"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":"Fundamental Research Funds for the Central Universities","keywords":"Electric vehicle; Vehicle routing problem; Nonlinear system; Routing (electronic design automation); Engineering; Automotive engineering; Computer science; Transport engineering; Computer network; Physics; Power (physics)","score_opus":0.03463670212720022,"score_gpt":0.320661306216311,"score_spread":0.2860246040891108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404632811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64527655,0.010835919,0.29406866,0.008757929,0.00075359317,0.0021844627,0.00007669442,0.03570825,0.002337981],"genre_scores_gemma":[0.98090225,0.0013673747,0.016766539,0.0000059812987,0.000075935975,0.0003806466,0.000041788415,0.0001126053,0.00034685078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976719,0.000102441336,0.00041248708,0.00039771383,0.0005962876,0.00081915536],"domain_scores_gemma":[0.9987932,0.0004952375,0.00003321504,0.0004163757,0.00020990953,0.000052097486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014903587,0.00022137759,0.00016897311,0.00048468547,0.0008717189,0.00029491668,0.00039686455,0.00014505112,0.000020773648],"category_scores_gemma":[0.00010965875,0.00016591915,0.00006684876,0.0027363594,0.00018411245,0.00025523716,0.000018169703,0.0009998726,0.00005217996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004170832,0.000037355057,0.0032250597,0.00040818838,0.0003254661,0.00009265127,0.0012336997,0.82239825,0.012500592,0.0076779546,0.002554468,0.14950462],"study_design_scores_gemma":[0.00020542271,0.00011621645,0.00028490712,0.00029446348,0.000033390195,0.0000075825783,0.0017085798,0.9226107,0.023302536,0.00071588974,0.05037492,0.00034539573],"about_ca_topic_score_codex":0.000024353072,"about_ca_topic_score_gemma":0.00012552502,"teacher_disagreement_score":0.33562577,"about_ca_system_score_codex":0.0001263862,"about_ca_system_score_gemma":0.00007523558,"threshold_uncertainty_score":0.67659867},"labels":[],"label_agreement":null},{"id":"W4404864841","doi":"10.1080/01605682.2024.2432605","title":"Adaptive large neighbourhood search for the multi-depot arc routing problem with flexible assignment of end depot and different arc types","year":2024,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"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; Université du Québec à Trois-Rivières","funders":"Mitacs","keywords":"Depot; Arc (geometry); Arc routing; Neighbourhood (mathematics); Computer science; Operations research; Routing (electronic design automation); Mathematical optimization; Computer network; Engineering; Mathematics; Geography; Mechanical engineering","score_opus":0.07232362554463277,"score_gpt":0.3580735006696667,"score_spread":0.2857498751250339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404864841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06996908,0.0019682138,0.9230626,0.0036405737,0.00015745003,0.0008567155,0.000054891887,0.000028943432,0.0002615215],"genre_scores_gemma":[0.90740794,0.00026499646,0.09176348,0.000028419772,0.00017179434,0.000027681996,0.000001570158,0.00003204163,0.00030206944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979266,0.00027043882,0.00034865065,0.00013545461,0.0009992775,0.00031961338],"domain_scores_gemma":[0.9975795,0.0015923532,0.00005690312,0.00013574272,0.00055447844,0.00008102305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041335057,0.000121653145,0.00017985563,0.00005458612,0.00042401484,0.00021310049,0.00028068895,0.00006146758,0.000041086645],"category_scores_gemma":[0.00019257015,0.000061245715,0.00015240665,0.00029474107,0.00013710117,0.00017237442,0.00013358444,0.0007597986,6.1821373e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011619611,0.00015069843,0.0035789032,0.00034462538,0.0010824788,0.000002653859,0.0058834385,0.946239,0.023824513,0.011476775,0.0012619522,0.0060387654],"study_design_scores_gemma":[0.0006610666,0.0001863566,0.0047982424,0.0002831045,0.000040283245,0.000026637179,0.0013340681,0.9742039,0.017925963,0.00021601982,0.0002407835,0.00008358171],"about_ca_topic_score_codex":0.000009938138,"about_ca_topic_score_gemma":0.000008566193,"teacher_disagreement_score":0.8374389,"about_ca_system_score_codex":0.0002241621,"about_ca_system_score_gemma":0.0003063986,"threshold_uncertainty_score":0.33009893},"labels":[],"label_agreement":null},{"id":"W4405026148","doi":"10.1007/s10878-024-01237-4","title":"Approximation algorithms for the airport and railway problem","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Approximation algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.015325515364176581,"score_gpt":0.26801951362225956,"score_spread":0.252693998258083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405026148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021613998,0.0013059801,0.993133,0.00037041018,0.0042515513,0.00030960687,0.000002560666,0.00010470456,0.00030606447],"genre_scores_gemma":[0.06514512,0.0006845385,0.9328098,0.000019802994,0.0011684571,0.000024718902,0.000008630486,0.00006586311,0.00007304744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991302,0.000043415734,0.00043109735,0.0000806162,0.0002020578,0.00011259464],"domain_scores_gemma":[0.9991747,0.0003427036,0.000112882226,0.000079671605,0.00024388659,0.000046159745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011751396,0.00010617819,0.00015899043,0.00012974741,0.000086170934,0.00019254393,0.00010065659,0.000083876505,0.000013296063],"category_scores_gemma":[0.00014335083,0.00007830736,0.00006842007,0.00026753003,0.000023847004,0.00040203927,0.000012259051,0.0001668901,5.614325e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013988034,0.000009320858,0.000009869741,0.00010059601,0.00006386087,0.0000011081875,0.00023838297,0.9715592,0.00007641578,0.0060690986,0.0009024359,0.020955686],"study_design_scores_gemma":[0.0005602824,0.00007867414,0.000014304984,0.00007850715,0.00008085548,0.00003839247,0.000032796204,0.9906297,0.0003987182,0.00364047,0.0043592323,0.000088078334],"about_ca_topic_score_codex":4.6468668e-7,"about_ca_topic_score_gemma":2.6894678e-8,"teacher_disagreement_score":0.064928986,"about_ca_system_score_codex":0.000066825414,"about_ca_system_score_gemma":0.000049118025,"threshold_uncertainty_score":0.31932816},"labels":[],"label_agreement":null},{"id":"W4405036614","doi":"10.4236/ajor.2024.146009","title":"An Elementary Approach to the Vehicle Routing Problem via Python and Google API","year":2024,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Queen's University; Queen's University Belfast","keywords":"Python (programming language); Computer science; Vehicle routing problem; Programming language; World Wide Web; Information retrieval; Routing (electronic design automation); Computer network","score_opus":0.03696489952496746,"score_gpt":0.37009940208506703,"score_spread":0.3331345025600996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405036614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41552946,0.00043490855,0.5803069,0.002077956,0.000096234944,0.00031716848,0.0000058123865,0.00007993548,0.001151664],"genre_scores_gemma":[0.767467,0.00005934256,0.23211926,0.00004553191,0.00020430925,0.000017006942,0.0000026632074,0.000032737404,0.000052128547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827754,0.00051426695,0.00034081988,0.00015108992,0.0004291979,0.0002871036],"domain_scores_gemma":[0.99919647,0.00017169205,0.000015954784,0.00020111364,0.0002441511,0.00017064034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034946639,0.00009237679,0.0001468239,0.00031038816,0.00030316028,0.00044833773,0.00028058185,0.000020631107,0.000021254378],"category_scores_gemma":[0.00007961147,0.000067564106,0.0000320702,0.001195932,0.00011837855,0.00036343446,0.000055454693,0.0005878104,0.000011534257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066833054,0.00003001236,0.0001929205,0.000018418159,0.000048310736,0.000004907759,0.0038553893,0.8373274,0.01316436,0.00042320855,0.0005760243,0.14435236],"study_design_scores_gemma":[0.00008184001,0.00031363041,0.00038374626,0.000040511834,0.000010299071,0.00009475649,0.0032111334,0.9930301,0.0009007724,0.000026499289,0.0018177159,0.000089041154],"about_ca_topic_score_codex":0.000102918435,"about_ca_topic_score_gemma":0.000016314165,"teacher_disagreement_score":0.35193756,"about_ca_system_score_codex":0.00011404275,"about_ca_system_score_gemma":0.00009038626,"threshold_uncertainty_score":0.4323331},"labels":[],"label_agreement":null},{"id":"W4405045402","doi":"10.1016/j.eswa.2024.125996","title":"A new branch-and-Benders-cut algorithm for the time-dependent vehicle routing problem","year":2024,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Vehicle routing problem; Branch and cut; Computer science; Algorithm; Mathematical optimization; Routing (electronic design automation); Integer programming; Mathematics; Computer network","score_opus":0.012920647537111862,"score_gpt":0.2621486258310455,"score_spread":0.24922797829393362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405045402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022443874,0.006062881,0.989243,0.0005306489,0.00014332106,0.0018376372,0.00001922055,0.0010228939,0.0011179715],"genre_scores_gemma":[0.21941952,0.00024609017,0.7589457,0.00015642882,0.0020809893,0.010511295,0.00004898589,0.00037439264,0.008216579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895877,0.000032429627,0.00027642548,0.0003001571,0.0001738238,0.00025842406],"domain_scores_gemma":[0.99910235,0.00037728157,0.00003585134,0.00033137682,0.000053326734,0.00009981725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036512117,0.00018007387,0.00017010601,0.00006213868,0.00024736847,0.0002833357,0.00017853579,0.000076007826,0.0000134967195],"category_scores_gemma":[0.000007220496,0.00013014956,0.00004234343,0.00031448007,0.000025882173,0.00012764556,0.000026969856,0.00013964559,0.0000533702],"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.0000069116045,0.000026810818,0.000031523225,0.0004051353,0.0004983229,0.0000022851975,0.005112244,0.32388777,0.0063233385,0.013611924,0.016676752,0.633417],"study_design_scores_gemma":[0.00022480967,0.0000151778695,0.0000056877443,0.00009594723,0.000030547842,0.00004320321,0.00031543287,0.94138694,0.0005836997,0.00009027357,0.057026755,0.00018152223],"about_ca_topic_score_codex":0.00010005839,"about_ca_topic_score_gemma":0.0000053674366,"teacher_disagreement_score":0.63323545,"about_ca_system_score_codex":0.000085383814,"about_ca_system_score_gemma":0.000056129742,"threshold_uncertainty_score":0.53073454},"labels":[],"label_agreement":null},{"id":"W4405402617","doi":"10.1002/net.22250","title":"The workforce scheduling and routing problem with park‐and‐loop","year":2024,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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; Institut de Valorisation des Données","keywords":"Vehicle routing problem; Loop (graph theory); Workforce; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Job shop scheduling; Routing (electronic design automation); Mathematics; Economics; Computer network; Combinatorics; Economic growth","score_opus":0.010000771375888149,"score_gpt":0.23543693567133323,"score_spread":0.22543616429544508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405402617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03389039,0.013070082,0.9481543,0.00020893726,0.00023795756,0.00016557385,2.9426772e-7,0.00071279856,0.0035596993],"genre_scores_gemma":[0.8957331,0.00090837735,0.10277267,0.000028779285,0.00023591743,0.000016701697,0.000001367128,0.000054074368,0.00024900047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993657,0.00003525752,0.00013195735,0.00015037466,0.00007356733,0.00024315453],"domain_scores_gemma":[0.9994892,0.0003220424,0.000013708668,0.00010822632,0.000015300495,0.000051554798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005123989,0.00011090895,0.00008792355,0.00002030887,0.00017798817,0.0002977615,0.000056073844,0.00006744548,0.0000021578178],"category_scores_gemma":[0.00001821641,0.000075837714,0.000012543277,0.00023220753,0.000042859905,0.000084496336,0.000033533022,0.00029945702,0.0000012911532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025148408,5.090601e-7,0.00089672743,0.000023195293,0.000021887889,0.000002551768,0.00014575472,0.8566838,0.000008185025,0.0019830205,0.000051714735,0.14018017],"study_design_scores_gemma":[0.000076730204,0.000009510293,0.00016465805,0.00024763038,0.000017284885,0.000018889628,0.00006272513,0.9972842,0.000013086266,0.00009863703,0.0019005483,0.00010611217],"about_ca_topic_score_codex":0.0000016751951,"about_ca_topic_score_gemma":0.000003952757,"teacher_disagreement_score":0.86184275,"about_ca_system_score_codex":0.000017023009,"about_ca_system_score_gemma":0.000007824912,"threshold_uncertainty_score":0.3092572},"labels":[],"label_agreement":null},{"id":"W4405676638","doi":"10.1145/3704657.3704673","title":"Research on solving time-varying vehicle routing with modular operation genetic algorithm based on ALNS","year":2024,"lang":"en","type":"article","venue":"","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":"Coquitlam College","funders":"","keywords":"Modular design; Computer science; Genetic algorithm; Vehicle routing problem; Routing (electronic design automation); Algorithm design; Algorithm; Embedded system; Machine learning; Operating system","score_opus":0.02904260432139993,"score_gpt":0.3114693240944435,"score_spread":0.28242671977304357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405676638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03192906,0.000079881385,0.9531251,0.00021579284,0.00015801283,0.00030487234,0.0000036877555,0.0012422762,0.0129413],"genre_scores_gemma":[0.63503885,0.0000054561497,0.36412168,0.000082158745,0.00015792398,0.000017803162,0.000011274917,0.00010371456,0.0004611395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804705,0.00024070521,0.00024648276,0.00041588774,0.0005805061,0.00046939185],"domain_scores_gemma":[0.9989477,0.00049486867,0.000011939501,0.00035125503,0.00009483178,0.00009945386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013262632,0.00020051096,0.00015641842,0.00038689526,0.0002513197,0.00038108203,0.00015658364,0.000105670544,0.0002519829],"category_scores_gemma":[0.00006483196,0.00017736873,0.000040582232,0.0007535338,0.00002934796,0.00016525589,0.000031279335,0.0005315537,0.0003423185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005790002,0.000015573005,0.000024522204,0.000039517996,0.000019355723,0.000028683287,0.0001497247,0.9536552,0.0075626574,0.00014449512,0.00016459504,0.038189884],"study_design_scores_gemma":[0.00023843581,0.00014901297,0.00016912361,0.00028813712,0.000009320814,0.000004099364,0.000047562986,0.9789331,0.019793939,0.00001677774,0.00012923591,0.0002212745],"about_ca_topic_score_codex":0.000020748577,"about_ca_topic_score_gemma":9.216401e-7,"teacher_disagreement_score":0.6031098,"about_ca_system_score_codex":0.00024400334,"about_ca_system_score_gemma":0.00006421165,"threshold_uncertainty_score":0.72328866},"labels":[],"label_agreement":null},{"id":"W4406106880","doi":"10.1007/s10479-024-06442-2","title":"Sustainable vehicle route planning under uncertainty for modular integrated construction: multi-trip time-dependent VRP with time windows and data analytics","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Vehicle routing problem; Modular design; Truck; Computer science; Transport engineering; Integer programming; Operations research; Ant colony optimization algorithms; Routing (electronic design automation); Engineering; Computer network","score_opus":0.15333913247327524,"score_gpt":0.4288628080374323,"score_spread":0.2755236755641571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406106880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14162044,0.0005982265,0.8538199,0.001483243,0.00004057645,0.0012787661,0.00025923815,0.00016488049,0.0007347167],"genre_scores_gemma":[0.7574651,0.00015662,0.2248714,0.000102715545,0.000062789884,0.00012470625,0.0007214153,0.00007744476,0.016417764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839085,0.00022195943,0.0003364531,0.00034129753,0.00029333372,0.00041610503],"domain_scores_gemma":[0.9974361,0.00034418603,0.000022081602,0.0006033831,0.0015074494,0.0000867805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00215245,0.00014510458,0.00025461882,0.0004420421,0.00039926675,0.00022943964,0.00035450963,0.000108285814,0.00005053692],"category_scores_gemma":[0.00063892145,0.00013474586,0.000023826524,0.0009995429,0.0001937465,0.0004185296,0.0001919755,0.0003068233,0.000005078705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005196673,0.000036140194,0.00033829163,0.00009097184,0.00016944655,0.0000032695377,0.00013303338,0.993665,0.002400079,0.000897946,0.0011736542,0.0010402028],"study_design_scores_gemma":[0.00073027617,0.00007039622,0.00019399467,0.00008639813,0.000022695538,0.0000037526945,0.0012436883,0.99228024,0.004249885,0.00009384672,0.00089543225,0.00012939329],"about_ca_topic_score_codex":0.00020476159,"about_ca_topic_score_gemma":0.000032723787,"teacher_disagreement_score":0.6289485,"about_ca_system_score_codex":0.000077631936,"about_ca_system_score_gemma":0.0003361718,"threshold_uncertainty_score":0.5494777},"labels":[],"label_agreement":null},{"id":"W4406226854","doi":"10.1016/j.trpro.2024.12.115","title":"Mixed integer linear programming model for a multi-depot arc routing problem with different arc types and flexible assignment of end depot","year":2025,"lang":"en","type":"article","venue":"Transportation research procedia","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"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; Université du Québec à Trois-Rivières","funders":"Mitacs","keywords":"Depot; Integer programming; Arc (geometry); Arc routing; Mathematical optimization; Linear programming; Routing (electronic design automation); Integer (computer science); Computer science; Mathematics; Computer network; Geography","score_opus":0.09595747101197241,"score_gpt":0.366136574342881,"score_spread":0.27017910333090855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406226854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1620412,0.00009753597,0.83611125,0.000070630645,0.000021217149,0.0013246306,0.000022282575,0.0002437263,0.00006753911],"genre_scores_gemma":[0.6292674,0.000027826929,0.3700008,0.0000048074726,0.0000106433135,0.000448745,0.00003436021,0.000041487296,0.00016391024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836206,0.000052486605,0.00044663573,0.0003114539,0.00039654336,0.0004308151],"domain_scores_gemma":[0.9990634,0.00021114323,0.00006450474,0.00014306529,0.00041807952,0.000099836965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008159,0.00018558791,0.00026565604,0.00027439976,0.00012182406,0.00004193701,0.0001289019,0.00010106305,0.000004216839],"category_scores_gemma":[0.00011492944,0.0001607064,0.000042180964,0.00044954062,0.00010125739,0.00012178953,0.000010147614,0.00031197784,3.8557042e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021579093,0.00020500297,0.019321088,0.0035984758,0.00017990307,0.0000022797924,0.004526455,0.9323613,0.008667133,0.005106588,0.00003576389,0.025780238],"study_design_scores_gemma":[0.0011361751,0.0001051368,0.006143005,0.00034791767,0.000039623323,3.3034337e-7,0.00038908212,0.9640742,0.02736348,0.00021763575,0.000029861294,0.00015355367],"about_ca_topic_score_codex":0.0000258566,"about_ca_topic_score_gemma":0.0002294478,"teacher_disagreement_score":0.4672262,"about_ca_system_score_codex":0.00006921174,"about_ca_system_score_gemma":0.00012672118,"threshold_uncertainty_score":0.65534174},"labels":[],"label_agreement":null},{"id":"W4406570280","doi":"10.1016/j.tre.2025.103967","title":"A learning-based robust optimization framework for synchromodal freight transportation under uncertainty","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Transport engineering; Robust optimization; Computer science; Traffic management; Operations research; Engineering; Business; Mathematical optimization; Mathematics","score_opus":0.07722718735032036,"score_gpt":0.3717103736926973,"score_spread":0.29448318634237697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406570280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014860795,0.0063876146,0.9878949,0.00097505335,0.00024626206,0.0019503334,0.00052314275,0.00041922106,0.00011739776],"genre_scores_gemma":[0.58218366,0.056978304,0.34197983,0.0009425405,0.00014016715,0.0018306045,0.015503175,0.00019529284,0.00024639795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967839,0.00025032528,0.0011780753,0.0006084807,0.00059891527,0.00058027264],"domain_scores_gemma":[0.9972581,0.0011187866,0.0001659587,0.00031241437,0.00094647345,0.00019821049],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015558981,0.00039007192,0.00061297725,0.0003693494,0.00045129744,0.000092590264,0.00021122054,0.00032561235,0.00020043885],"category_scores_gemma":[0.00021162498,0.00041340134,0.00019243332,0.001408902,0.00022830981,0.00019977013,9.297686e-7,0.0006945496,0.000004039968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005201505,0.000062671126,0.0014098037,0.006652202,0.00008489342,0.0000050442554,0.00013569376,0.94908494,0.00001395582,0.039849944,0.00041069236,0.002238166],"study_design_scores_gemma":[0.001667143,0.00021442311,0.012805478,0.005686339,0.00059074594,2.8597137e-7,0.00017731958,0.9570557,0.00013184398,0.0060311486,0.014941783,0.00069780543],"about_ca_topic_score_codex":0.00006187876,"about_ca_topic_score_gemma":0.0004537442,"teacher_disagreement_score":0.64591503,"about_ca_system_score_codex":0.00010119107,"about_ca_system_score_gemma":0.00020701515,"threshold_uncertainty_score":0.9998318},"labels":[],"label_agreement":null},{"id":"W4406959045","doi":"10.1145/3681772.3698216","title":"Clustering-Based Enhanced Ant Colony Optimization for Multi-Trip Vehicle Routing Problem with Heterogeneous Fleet and Time Windows: An Industrial Case Study","year":2024,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"National Research Council Canada; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Ant colony optimization algorithms; Cluster analysis; Computer science; ANT; Routing (electronic design automation); Ant colony; Travelling salesman problem; Artificial intelligence; Computer network; Algorithm","score_opus":0.04106927700715379,"score_gpt":0.2969030575333903,"score_spread":0.2558337805262365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406959045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3707894,0.00002661944,0.62674844,0.00001163931,0.000097166085,0.0014567317,0.000014247313,0.0008249189,0.000030842428],"genre_scores_gemma":[0.6817012,9.1298415e-7,0.317877,0.00001805676,0.000085285865,0.00014891042,0.000021256741,0.000092881965,0.000054489108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844486,0.00015239058,0.0004109118,0.00047534573,0.00015852609,0.00035795363],"domain_scores_gemma":[0.99927646,0.00019911051,0.000051665967,0.00023260844,0.00009703817,0.000143136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006744003,0.00028985066,0.00029531043,0.00016379269,0.00018007238,0.0003110622,0.00009499746,0.00015619532,0.000038212744],"category_scores_gemma":[0.00005319476,0.00026495862,0.00003722443,0.00037382985,0.000030136116,0.00027853958,0.000037438844,0.00019074792,0.000002460315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008234912,0.00010253577,0.00019704438,0.000086224354,0.00008227665,0.00020880596,0.0010453359,0.99124855,0.001382417,0.0000014466809,0.000009757976,0.005553232],"study_design_scores_gemma":[0.003114382,0.0008395234,0.000005456888,0.00008495538,0.00009134166,0.00023964148,0.00044976905,0.990392,0.0044198204,6.0228786e-7,0.000012417537,0.00035003145],"about_ca_topic_score_codex":0.00006225502,"about_ca_topic_score_gemma":0.00016267045,"teacher_disagreement_score":0.3109118,"about_ca_system_score_codex":0.00012038515,"about_ca_system_score_gemma":0.00006607995,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W4407011375","doi":"10.1016/j.tre.2025.103991","title":"Designing hub-based regional transportation networks with service level constraints","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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; Université Laval; Center for Interuniversity Research and Analysis on Organizations; Centre for Interdisciplinary Research in Rehabilitation","funders":"","keywords":"Transport engineering; Service (business); Computer science; Level of service; Flow network; Business; Computer network; Engineering; Marketing","score_opus":0.13894294849498845,"score_gpt":0.3687718858812177,"score_spread":0.22982893738622923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407011375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025356591,0.0070181303,0.9867616,0.0012697411,0.000110431014,0.0012739303,0.0003327821,0.00032233616,0.00037536732],"genre_scores_gemma":[0.8421106,0.03550293,0.112959586,0.0022898354,0.000072604,0.0006449662,0.0061467076,0.00013152881,0.0001412523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9970651,0.00021428708,0.0009868809,0.00052019797,0.0006712636,0.00054225686],"domain_scores_gemma":[0.99775255,0.0005465215,0.00013313879,0.00030080823,0.0010563025,0.00021071087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013750339,0.00036291606,0.0005329883,0.00029127122,0.0003064395,0.00007357891,0.00020316562,0.0001966356,0.00015841007],"category_scores_gemma":[0.000040374056,0.00035510483,0.00009049028,0.0017497466,0.00034519922,0.00021189525,6.715672e-7,0.00059943326,0.0000054242996],"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.00011161969,0.00009256191,0.010914344,0.008908786,0.00017888725,0.00005624828,0.00034335695,0.9492302,0.00012356971,0.01621971,0.0018842234,0.011936477],"study_design_scores_gemma":[0.0088113565,0.0004871187,0.5267787,0.031360656,0.0021016914,0.0000055566584,0.0009468152,0.34935823,0.0011697032,0.0015217832,0.074570395,0.0028879934],"about_ca_topic_score_codex":0.0000873807,"about_ca_topic_score_gemma":0.0018646587,"teacher_disagreement_score":0.873802,"about_ca_system_score_codex":0.000054712476,"about_ca_system_score_gemma":0.00023968126,"threshold_uncertainty_score":0.9998901},"labels":[],"label_agreement":null},{"id":"W4407182114","doi":"10.1111/itor.13620","title":"Smart selective navigator (SSN): enhancing urban winter road maintenance through optimized arc routing with hard turn restrictions","year":2025,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Ontario Tech University","funders":"Mitacs","keywords":"Arc (geometry); Routing (electronic design automation); Turn (biochemistry); Computer science; Arc routing; Environmental science; Business; Transport engineering; Engineering; Computer network","score_opus":0.03379930696044189,"score_gpt":0.3572425382447277,"score_spread":0.3234432312842858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407182114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020741599,0.00008078088,0.943789,0.0024744095,0.00085897587,0.00061159616,0.0000621692,0.00025000193,0.03113148],"genre_scores_gemma":[0.862365,0.00013110077,0.12967882,0.00013758945,0.00014653703,0.00045124578,0.00005117369,0.000054282184,0.0069842255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969518,0.0003456206,0.0006709424,0.0005395509,0.00092467613,0.00056740904],"domain_scores_gemma":[0.9975766,0.000792497,0.000044058597,0.00029159785,0.0012077532,0.00008749541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014093915,0.00026263518,0.0002705179,0.00078512495,0.00048935495,0.00030566903,0.00047486168,0.00016706722,0.00046263417],"category_scores_gemma":[0.0004967447,0.00026453924,0.00009955564,0.001846195,0.00018037832,0.00083054067,0.00003090317,0.0014103833,0.000038900816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021051412,0.00014789727,0.0021340873,0.000027704436,0.00028090944,0.000015261588,0.0011850845,0.9839481,0.0039657336,0.0046688556,0.0010506483,0.002365171],"study_design_scores_gemma":[0.0028501758,0.000090137764,0.009582461,0.0008611323,0.000028822607,0.000054734614,0.0012810645,0.95633656,0.020045996,0.0007687946,0.007579003,0.0005210999],"about_ca_topic_score_codex":0.00037916063,"about_ca_topic_score_gemma":0.00041225675,"teacher_disagreement_score":0.8416234,"about_ca_system_score_codex":0.001412842,"about_ca_system_score_gemma":0.00050901435,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W4407538937","doi":"10.1504/ijise.2025.144406","title":"Vehicle routing decision-support system development using integer programming and heuristics: a model-driven structured approach","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial and Systems Engineering","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":"University of Windsor","funders":"","keywords":"Heuristics; Integer programming; Computer science; Decision support system; Vehicle routing problem; Development (topology); Routing (electronic design automation); Mathematical optimization; Operations research; Artificial intelligence; Engineering; Algorithm; Mathematics; Computer network","score_opus":0.0334414799586438,"score_gpt":0.26796601452145824,"score_spread":0.23452453456281444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407538937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26986802,0.00020588672,0.72812325,0.000005589355,0.0015265837,0.00012522838,0.000003737266,0.000064674176,0.000077030614],"genre_scores_gemma":[0.8307652,0.000008228175,0.16888012,0.0000030194308,0.0003056058,0.000004176581,0.0000021105889,0.000021394946,0.000010164177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983974,0.000034282788,0.0008845245,0.00014574268,0.00034716344,0.00019086862],"domain_scores_gemma":[0.99921304,0.00012551864,0.0001886036,0.00007423866,0.00029638503,0.00010219724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007479281,0.00019144021,0.00034812206,0.00039023327,0.00006417347,0.00024268296,0.0002030986,0.00016351166,6.017976e-7],"category_scores_gemma":[0.00018934066,0.00017743855,0.000046891382,0.00016448705,0.000015598678,0.00018960671,0.00008169915,0.00036550622,1.5211224e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022958715,0.0000065227,0.00096738647,0.00008825159,0.00023318178,0.000022644841,0.00034697034,0.97872204,0.0010369004,0.0005108949,0.000017633798,0.018024607],"study_design_scores_gemma":[0.00074109505,0.000010556235,0.000054699005,0.0010362052,0.000033738972,0.00037752374,0.00043307876,0.9965768,0.00030257014,0.0000035882017,0.00028142554,0.00014874729],"about_ca_topic_score_codex":0.0000058969913,"about_ca_topic_score_gemma":2.2402367e-7,"teacher_disagreement_score":0.5608972,"about_ca_system_score_codex":0.00032423597,"about_ca_system_score_gemma":0.00010502839,"threshold_uncertainty_score":0.7235734},"labels":[],"label_agreement":null},{"id":"W4407658241","doi":"10.1016/j.trb.2025.103172","title":"A contextual framework for learning routing experiences in last-mile delivery","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part B Methodological","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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":"Mile; Routing (electronic design automation); Last mile (transportation); Computer science; Transport engineering; Environmental science; Engineering; Geology; Computer network","score_opus":0.29881428823957445,"score_gpt":0.47494993983353617,"score_spread":0.17613565159396172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407658241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38371688,0.00014178516,0.6149089,0.000093248695,0.00015624128,0.0003646803,0.00000411868,0.0002124871,0.0004016653],"genre_scores_gemma":[0.55766,0.00006673476,0.44152123,0.00003778697,0.00004712813,0.00051862624,0.000021477317,0.000015297655,0.00011171296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964189,0.0017278321,0.0005531666,0.00037592367,0.0003288828,0.0005953179],"domain_scores_gemma":[0.98819417,0.011327574,0.000037872218,0.00014844886,0.0002067146,0.00008524002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007832596,0.00015718749,0.00035054082,0.00031762157,0.0002262796,0.000057325542,0.00023435039,0.00027573027,0.00016283728],"category_scores_gemma":[0.005384279,0.00015266892,0.00009135714,0.0010598013,0.000159284,0.00012709838,0.000011395684,0.0009091635,0.000006086639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039704525,0.00011327871,0.061074246,0.0002975682,0.00007568108,0.00002759395,0.018063389,0.8035538,0.0034255735,0.06712011,0.00047756586,0.04537414],"study_design_scores_gemma":[0.0025850642,0.00048847153,0.08081881,0.0008187162,0.00003812241,0.0000013255946,0.061755087,0.7989702,0.015146516,0.024347657,0.014147263,0.0008827222],"about_ca_topic_score_codex":0.000019160967,"about_ca_topic_score_gemma":0.000050723884,"teacher_disagreement_score":0.17394312,"about_ca_system_score_codex":0.00007711325,"about_ca_system_score_gemma":0.00006064205,"threshold_uncertainty_score":0.6445874},"labels":[],"label_agreement":null},{"id":"W4407722540","doi":"10.1016/j.seps.2025.102185","title":"The time-definite hub line location problem","year":2025,"lang":"en","type":"article","venue":"Socio-Economic Planning Sciences","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":"Université du Québec à Montréal; Université Laval","funders":"","keywords":"Line (geometry); Computer science; Mathematics; Geometry","score_opus":0.01842435965363123,"score_gpt":0.2911151290782471,"score_spread":0.2726907694246159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407722540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47280765,0.005094918,0.256763,0.008144592,0.0035862064,0.0008391482,0.000021333944,0.0023640129,0.25037915],"genre_scores_gemma":[0.9385358,0.00009414787,0.05688536,0.00028463753,0.00017454132,0.00004391021,0.000009676726,0.000025320855,0.0039466084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991778,0.00005699376,0.000250704,0.00019033099,0.00007091342,0.0002532635],"domain_scores_gemma":[0.99926233,0.0004885404,0.000057764773,0.00014007044,0.000023078353,0.000028209919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014842936,0.00010381507,0.00011353377,0.000087821645,0.00065809174,0.00020959551,0.00036309476,0.000060225248,0.000016099699],"category_scores_gemma":[0.00008413639,0.00008582853,0.000030743227,0.00027655516,0.0002344586,0.00017212325,0.000039697592,0.00012376245,0.0001314786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011262467,0.0000017624294,0.003078109,0.000010133419,0.000014639504,1.379095e-7,0.0003378843,0.98620975,0.0001266401,0.003157455,0.0026089686,0.004453379],"study_design_scores_gemma":[0.00012338412,0.000014555742,0.0011277471,0.00006130703,0.000009030409,0.0000012336156,0.0005444578,0.9880293,0.00029608424,0.004173088,0.0054772925,0.00014254444],"about_ca_topic_score_codex":0.000009142071,"about_ca_topic_score_gemma":0.0000013167814,"teacher_disagreement_score":0.46572816,"about_ca_system_score_codex":0.00013021968,"about_ca_system_score_gemma":0.00012693054,"threshold_uncertainty_score":0.5061576},"labels":[],"label_agreement":null},{"id":"W4407871667","doi":"10.2139/ssrn.5117161","title":"Tactical Routing and Fleet Planning in Drone-Assisted Last-Mile Delivery","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"University of Toronto; York University","funders":"","keywords":"Drone; Mile; Last mile (transportation); Routing (electronic design automation); Aeronautics; Computer science; Transport engineering; Engineering; Operations management; Computer network; Geography","score_opus":0.015104458336358543,"score_gpt":0.2822653026075462,"score_spread":0.26716084427118764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407871667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47860172,0.008736001,0.50461084,0.00024176565,0.0011646983,0.00034333635,0.0000126202085,0.00044948165,0.0058395793],"genre_scores_gemma":[0.9725056,0.0037224067,0.023058675,0.000037349466,0.00026576102,0.000013598954,0.000016836017,0.00007026604,0.00030949156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965725,0.00026934626,0.00063203997,0.00035241837,0.00024426798,0.0019294497],"domain_scores_gemma":[0.99917555,0.0002699159,0.00015162479,0.00022755188,0.000071239665,0.00010409045],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025418578,0.0003541935,0.0004884705,0.00043372874,0.00013787743,0.00016658615,0.00030181324,0.00043115436,0.0000099939125],"category_scores_gemma":[0.00026148534,0.00040341148,0.00010558509,0.00027615405,0.000031798038,0.000135956,0.00028830313,0.007105994,0.0000025516836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045127785,0.000039734838,0.01343036,0.00018742577,0.0004052627,0.000041017858,0.000643703,0.9243572,0.00030443343,0.0044293255,0.00006129722,0.056055147],"study_design_scores_gemma":[0.0013801318,0.00007372211,0.0060400288,0.001220483,0.00015712177,0.00058049645,0.0013221697,0.9698016,0.00012837704,0.018151298,0.0003026455,0.0008419425],"about_ca_topic_score_codex":0.000038706035,"about_ca_topic_score_gemma":0.00018387318,"teacher_disagreement_score":0.4939039,"about_ca_system_score_codex":0.001831336,"about_ca_system_score_gemma":0.0013256249,"threshold_uncertainty_score":0.99984175},"labels":[],"label_agreement":null},{"id":"W4408247425","doi":"10.1111/anzs.12439","title":"A seminal contribution of Ailsa Land and Alison Doig Harcourt to the field of mathematical programming","year":2025,"lang":"en","type":"article","venue":"Australian & New Zealand Journal of Statistics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics","score_opus":0.012317149472729097,"score_gpt":0.3102088968377304,"score_spread":0.2978917473650013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408247425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06870284,0.00008607256,0.92793447,0.0028534115,0.00015037088,0.00015984324,0.00005313448,0.000010550922,0.00004928535],"genre_scores_gemma":[0.5762809,0.00008518904,0.4227447,0.00005797557,0.000090836,0.0000013316928,0.000004940566,0.000011771435,0.0007223556],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912614,0.00004391178,0.00048670973,0.000050292125,0.00016052504,0.00013242326],"domain_scores_gemma":[0.99902314,0.00048246142,0.00015439827,0.000084154795,0.000173807,0.00008206799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051937153,0.00008228262,0.00025004367,0.00008537834,0.00002364028,0.000027307395,0.00009727938,0.00005775123,0.000021824368],"category_scores_gemma":[0.0005268239,0.000061074425,0.000029961226,0.0001596342,0.000028103752,0.000042143234,0.000015556752,0.0001719658,4.4446196e-7],"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.00056408404,0.00025138605,0.11767247,0.0016528615,0.0008995809,0.0000778251,0.0048609003,0.10160158,0.0058726193,0.016770305,0.52740085,0.22237556],"study_design_scores_gemma":[0.020788083,0.007926912,0.21746282,0.013623936,0.00450725,0.0013560464,0.0029791729,0.17226414,0.1479732,0.06375193,0.34508327,0.0022832586],"about_ca_topic_score_codex":0.000017217755,"about_ca_topic_score_gemma":0.000009372025,"teacher_disagreement_score":0.5075781,"about_ca_system_score_codex":0.000017072822,"about_ca_system_score_gemma":0.000042616077,"threshold_uncertainty_score":0.24905428},"labels":[],"label_agreement":null},{"id":"W4408382245","doi":"10.1111/itor.70012","title":"Workload equity in multiperiod vehicle routing problems","year":2025,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"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; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Institut de Valorisation des Données; Compute Canada","keywords":"Workload; Equity (law); Time horizon; Computer science; Context (archaeology); Operations research; Routing (electronic design automation); Vehicle routing problem; Mathematical optimization; Computer network; Mathematics; Geography","score_opus":0.09813934638325195,"score_gpt":0.448750739662477,"score_spread":0.3506113932792251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408382245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095583685,0.00038102057,0.78180075,0.0038431587,0.0013980963,0.00088818447,0.000035998353,0.00025939365,0.1158097],"genre_scores_gemma":[0.97827464,0.0001709729,0.019030752,0.000057097383,0.00005373391,0.00025354265,0.000015087987,0.000020328107,0.0021238178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979546,0.0002220467,0.0005092527,0.00028866323,0.00064819196,0.00037721996],"domain_scores_gemma":[0.99890333,0.00054838153,0.000013204987,0.00016620745,0.00032160617,0.000047261114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022208912,0.00012554527,0.00014087667,0.0010506191,0.00015808751,0.00019338231,0.00041008764,0.00012791563,0.0006879616],"category_scores_gemma":[0.0003479273,0.00014751016,0.00004574594,0.0014215457,0.00008205211,0.00039911934,0.00004097086,0.0008617764,0.000039139733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001829107,0.00008945853,0.005070932,0.000023064445,0.000024369934,0.0000045248066,0.00033976758,0.9520673,0.0030236063,0.0031113802,0.00004841129,0.036178853],"study_design_scores_gemma":[0.00082467706,0.0000088856395,0.014624379,0.0002729438,0.000001470938,0.0000024852866,0.0002116453,0.9792487,0.0018591019,0.0010930905,0.0017200003,0.00013262412],"about_ca_topic_score_codex":0.00022387646,"about_ca_topic_score_gemma":0.0006839542,"teacher_disagreement_score":0.88269097,"about_ca_system_score_codex":0.0010126457,"about_ca_system_score_gemma":0.00021796185,"threshold_uncertainty_score":0.7532697},"labels":[],"label_agreement":null},{"id":"W4408741510","doi":"10.1016/j.trc.2025.105100","title":"The container drayage problem for electric trucks with charging resource constraints","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Shanghai Education Development Foundation; Shanghai Municipal Education Commission; National Natural Science Foundation of China","keywords":"Truck; Container (type theory); Resource (disambiguation); Transport engineering; Engineering; Computer science; Operations research; Automotive engineering; Computer network","score_opus":0.027236116427368538,"score_gpt":0.33034308501846327,"score_spread":0.3031069685910947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408741510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080854125,0.0020310846,0.8863829,0.010375347,0.00017380962,0.0036995006,0.000048299094,0.008500428,0.007934506],"genre_scores_gemma":[0.95460385,0.00049714255,0.04254281,0.000025033489,0.000022469278,0.0013058024,0.000045787856,0.00006418393,0.00089290197],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981552,0.00008918765,0.0003896809,0.00030556062,0.00034953968,0.00071083126],"domain_scores_gemma":[0.9982919,0.0009389212,0.00005120947,0.00038537115,0.0003010062,0.000031601347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017736991,0.00018420638,0.00020214675,0.00048600967,0.00074305665,0.00010627617,0.0004572505,0.00015090854,0.000007716283],"category_scores_gemma":[0.00033169053,0.00013955121,0.00005280015,0.0016965824,0.0003964172,0.00010996103,0.000011680853,0.0005841272,0.0000022761983],"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.00036053098,0.00007290853,0.010157229,0.001019199,0.0005875752,0.000024234612,0.001688214,0.25132388,0.015246579,0.2713899,0.020496512,0.42763326],"study_design_scores_gemma":[0.0045481543,0.00047862172,0.0043745246,0.0012001725,0.00014684258,0.00000475811,0.020654347,0.33493587,0.137553,0.024747906,0.4700268,0.0013290235],"about_ca_topic_score_codex":0.000008383993,"about_ca_topic_score_gemma":0.000067221714,"teacher_disagreement_score":0.87374973,"about_ca_system_score_codex":0.000094700656,"about_ca_system_score_gemma":0.000084765445,"threshold_uncertainty_score":0.5715066},"labels":[],"label_agreement":null},{"id":"W4409175666","doi":"10.1080/14942119.2025.2480017","title":"Dynamic cost allocation in horizontal collaboration – a case study in forest transportation in Québec","year":2025,"lang":"en","type":"article","venue":"International Journal of Forest Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université TÉLUQ; Université Laval","funders":"Université Laval","keywords":"Transport engineering; Business; Environmental resource management; Operations research; Environmental science; Engineering","score_opus":0.006037188396702747,"score_gpt":0.28148067825615053,"score_spread":0.2754434898594478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409175666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.897689,0.0001494723,0.10105242,0.00011404547,0.0006647332,0.00027294183,0.0000038574385,0.000029008685,0.000024530831],"genre_scores_gemma":[0.9944391,0.000035423902,0.0054229824,0.000006571596,0.000028851422,0.000030700863,0.000010513713,0.000020933765,0.0000048873057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986952,0.00003586596,0.0007967763,0.00010795208,0.00022458218,0.0001396508],"domain_scores_gemma":[0.99951035,0.00012026865,0.00009531024,0.00007346197,0.00016938342,0.000031198793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005248077,0.00013235112,0.00020120837,0.0010928033,0.000009791528,0.000048992362,0.00017613807,0.00006865164,0.0000031218065],"category_scores_gemma":[0.00016254625,0.00015616765,0.00003628837,0.00060311094,0.0000073739343,0.00044629196,0.0000074295103,0.000288884,5.32583e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026778456,0.00007711649,0.2632922,0.000016054759,0.000026175241,0.0008183327,0.001242451,0.7320305,0.0002818205,0.000083315244,0.000002943425,0.0021023313],"study_design_scores_gemma":[0.0015438067,0.000035208657,0.29046008,0.00019864844,0.0000075871317,0.00009796052,0.0012445464,0.70619774,0.000058828165,0.00002397842,0.00003696151,0.00009466603],"about_ca_topic_score_codex":0.0028499125,"about_ca_topic_score_gemma":0.2953999,"teacher_disagreement_score":0.29255,"about_ca_system_score_codex":0.0011162317,"about_ca_system_score_gemma":0.00014230171,"threshold_uncertainty_score":0.7174572},"labels":[],"label_agreement":null},{"id":"W4409430417","doi":"10.1287/trsc.2024.0725","title":"Branch-Price-and-Cut for the Electric Vehicle Routing Problem with Heterogeneous Recharging Technologies and Nonlinear Recharging Functions","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Nonlinear system; Routing (electronic design automation); Vehicle routing problem; Electric vehicle; Mathematical optimization; Computer science; Operations research; Engineering; Computer network; Mathematics; Power (physics); Physics","score_opus":0.013599852196323897,"score_gpt":0.26021661817717856,"score_spread":0.24661676598085466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409430417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30514097,0.00030626135,0.6930509,0.00042728044,0.000060514136,0.00037419188,0.000005248401,0.0005226261,0.0001119967],"genre_scores_gemma":[0.9079201,0.00012711037,0.0917698,0.000036508904,0.000008492141,0.000073336254,0.000002647449,0.000014451418,0.000047522997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907166,0.000012084344,0.00021321047,0.0002798625,0.00015015637,0.00027304373],"domain_scores_gemma":[0.9993857,0.00026053467,0.000050172668,0.00015923433,0.00011674927,0.000027587916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075838534,0.00011782136,0.00011511741,0.00022078671,0.0005891571,0.000109299355,0.00016241963,0.000048734964,0.0000013930638],"category_scores_gemma":[0.000084971594,0.000092189846,0.000018382661,0.0015467615,0.00014378733,0.00025735423,0.000006827456,0.0001483683,4.496724e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032502703,0.000014118143,0.008194214,0.00018737445,0.00004520243,0.0000012398909,0.0016239657,0.6341943,0.09285009,0.0028340146,0.00001147181,0.2600115],"study_design_scores_gemma":[0.00033995832,0.000037877828,0.00390631,0.0000797955,0.000043866643,0.0000052671394,0.00049017847,0.9503807,0.043976303,0.00036484285,0.00021836955,0.00015654448],"about_ca_topic_score_codex":0.000008624987,"about_ca_topic_score_gemma":0.00002515532,"teacher_disagreement_score":0.60277915,"about_ca_system_score_codex":0.00004323248,"about_ca_system_score_gemma":0.000057384357,"threshold_uncertainty_score":0.45313796},"labels":[],"label_agreement":null},{"id":"W4409687729","doi":"10.1155/atr/5584617","title":"Applying a Hybrid Gray Wolf‐Enhanced Whale Optimization Algorithm to the Capacitated Vehicle Routing Problem","year":2025,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Viet Nam National University Ho Chi Minh City; Ho Chi Minh City University of Technology and Education","keywords":"Vehicle routing problem; Whale; Gray (unit); Computer science; Optimization algorithm; Routing (electronic design automation); Algorithm; Gray wolf; Mathematical optimization; Mathematics; Fishery; Computer network; Biology; Ecology","score_opus":0.006983923984710725,"score_gpt":0.24657330889182913,"score_spread":0.2395893849071184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409687729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06335365,0.00015237054,0.9347999,0.00022949917,0.0005713595,0.0005610118,0.000010287877,0.00013357535,0.0001883107],"genre_scores_gemma":[0.49106884,0.00006868068,0.5085734,0.00009391212,0.0000627876,0.000052183554,0.00001734784,0.000029460993,0.000033388325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841696,0.000071847215,0.000814497,0.00015741543,0.00028629723,0.00025301092],"domain_scores_gemma":[0.9989622,0.00012209144,0.00026128822,0.0001560555,0.00041933262,0.00007900243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006082255,0.00018386715,0.00026996192,0.0002489849,0.00016138282,0.000060184342,0.00020143608,0.00005577138,0.0000113082115],"category_scores_gemma":[0.000077769786,0.00015988894,0.00010071644,0.0009092383,0.000018621105,0.00051154435,0.000003438245,0.00031512263,0.000002232115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029033428,0.000016478376,0.000055561537,0.00003984402,0.000049595237,0.0000042747156,0.0012757746,0.8959197,0.012181393,0.000043066284,0.000048995476,0.09033632],"study_design_scores_gemma":[0.0017618558,0.00010671896,0.0025965907,0.00059055147,0.00014374965,0.000010821136,0.0015792326,0.9255219,0.065771446,0.00031780347,0.0012513598,0.00034795233],"about_ca_topic_score_codex":0.000003846075,"about_ca_topic_score_gemma":0.000010071523,"teacher_disagreement_score":0.42771518,"about_ca_system_score_codex":0.00013664595,"about_ca_system_score_gemma":0.000051458486,"threshold_uncertainty_score":0.6520082},"labels":[],"label_agreement":null},{"id":"W4409728692","doi":"10.1287/ijoc.2023.0367","title":"Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","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":"HEC Montréal","funders":"","keywords":"Benders' decomposition; Flow (mathematics); Decomposition; Computer science; Mathematical optimization; Operations research; Industrial engineering; Mathematics; Engineering; Chemistry","score_opus":0.013507336622891448,"score_gpt":0.3022088723143746,"score_spread":0.28870153569148316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409728692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05442438,0.00012252734,0.94137037,0.0002494737,0.0007242428,0.00018934732,0.0000012115959,0.00018801719,0.0027304403],"genre_scores_gemma":[0.8770958,0.000029952129,0.12242198,0.00024346373,0.0000973269,0.0000032366754,0.000022610922,0.000026011867,0.000059607468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988201,0.000054453485,0.00058411836,0.000110572946,0.00014333901,0.00028739686],"domain_scores_gemma":[0.9992342,0.00034699208,0.00012863851,0.00010224639,0.0001290959,0.000058826074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010612397,0.00016056975,0.00020670565,0.00045999078,0.00023682429,0.00013845686,0.00016243657,0.00009847337,0.000008902011],"category_scores_gemma":[0.00028146053,0.00016121707,0.00007357146,0.00049752893,0.000011972751,0.00022801098,0.000027464112,0.0006146209,0.0000056073172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026426686,0.00001295228,0.00172275,0.00004974056,0.000023273386,0.0000012189304,0.00027904773,0.85824084,0.00008288878,0.00025815316,0.00011862262,0.13918407],"study_design_scores_gemma":[0.0011037563,0.00007902114,0.0025148091,0.0003199773,0.000008377527,0.00001943044,0.00010063128,0.9930043,0.00043253857,0.0002907742,0.001971077,0.00015526976],"about_ca_topic_score_codex":0.000004139113,"about_ca_topic_score_gemma":0.0000038090652,"teacher_disagreement_score":0.8226714,"about_ca_system_score_codex":0.00030364608,"about_ca_system_score_gemma":0.000042151336,"threshold_uncertainty_score":0.65742415},"labels":[],"label_agreement":null},{"id":"W4410252793","doi":"10.1016/j.ejor.2025.04.019","title":"First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Dominance (genetics); Stochastic dominance; Computer science; Mathematical optimization; Operations research; Mathematics; Biology","score_opus":0.07134054237777429,"score_gpt":0.39701539868102026,"score_spread":0.325674856303246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410252793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5824058,0.000049903316,0.4134726,0.00089053554,0.00018523446,0.0007336844,0.000008580843,0.000024944895,0.0022287355],"genre_scores_gemma":[0.94256777,0.000025629453,0.05624395,0.00016948301,0.00016465153,0.00001584047,0.0000068299046,0.000046918958,0.0007589514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957632,0.0011766864,0.00096687087,0.00030684442,0.0013230128,0.00046337905],"domain_scores_gemma":[0.9978011,0.00042468993,0.000052928444,0.00026296912,0.0012218998,0.00023636129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009837165,0.00018228732,0.00027060354,0.00094603345,0.0002781178,0.0002968927,0.0006640172,0.000026643283,0.00016604498],"category_scores_gemma":[0.000505674,0.00016157348,0.000047150683,0.001255713,0.00007939692,0.00040397194,0.00023786197,0.00085172587,0.000074568925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003218151,0.00055789563,0.0012532839,0.00004109326,0.000057735753,0.0001939997,0.0013283584,0.9533833,0.0012368965,0.00029483406,0.00067237293,0.040658392],"study_design_scores_gemma":[0.00489296,0.0060557984,0.046932384,0.0004030535,0.0000163805,0.000030659474,0.004644086,0.93212646,0.0017076959,0.00012565524,0.002694157,0.0003706967],"about_ca_topic_score_codex":0.000022434464,"about_ca_topic_score_gemma":0.000117643685,"teacher_disagreement_score":0.36016196,"about_ca_system_score_codex":0.0004803448,"about_ca_system_score_gemma":0.0004622283,"threshold_uncertainty_score":0.65887755},"labels":[],"label_agreement":null},{"id":"W4410815503","doi":"10.1016/j.cor.2025.107152","title":"Learning-based column generation approach for the vehicle routing problem with release dates and incompatible loading constraints","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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 Toronto","funders":"National Natural Science Foundation of China","keywords":"Column generation; Vehicle routing problem; Column (typography); Computer science; Routing (electronic design automation); Mathematical optimization; Operations research; Mathematics; Computer network","score_opus":0.047957797486706706,"score_gpt":0.3309234114648892,"score_spread":0.2829656139781825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410815503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04351199,0.00012734586,0.9541068,0.00045052366,0.000054245225,0.0011185546,0.000005168707,0.00017862744,0.00044671388],"genre_scores_gemma":[0.67533934,0.0000104976825,0.32415465,0.00004066974,0.000050597733,0.00021043512,0.0000576829,0.000020936985,0.00011521711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985784,0.00033291895,0.00024326665,0.00029436892,0.00021966163,0.00033134484],"domain_scores_gemma":[0.9985101,0.00078326295,0.000015897169,0.00023526579,0.00039085693,0.000064574495],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016901685,0.0001309366,0.00014822258,0.00022560285,0.0013540313,0.000608669,0.00020792836,0.00006468979,0.000006243919],"category_scores_gemma":[0.00021183486,0.00010942766,0.000022979459,0.0007625816,0.00022814547,0.00016813951,0.00007350812,0.00041290047,0.0000014438658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010046415,0.000022692624,0.0009513207,0.000077910954,0.000040645788,4.1976529e-7,0.00035347615,0.9812114,0.0022088932,0.0011343457,0.00049297884,0.01349586],"study_design_scores_gemma":[0.00070392556,0.000075797754,0.0002191253,0.00006519723,0.000013981557,0.000001986227,0.0003149409,0.9952185,0.003039822,0.000008263683,0.0002203508,0.00011809936],"about_ca_topic_score_codex":0.000046616806,"about_ca_topic_score_gemma":0.00003473262,"teacher_disagreement_score":0.63182735,"about_ca_system_score_codex":0.00011135374,"about_ca_system_score_gemma":0.00017654157,"threshold_uncertainty_score":0.99994606},"labels":[],"label_agreement":null},{"id":"W4411297645","doi":"10.1016/j.cie.2025.111279","title":"Holding inventory for shipment consolidation in hub location modeling","year":2025,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Consolidation (business); Operations management; Business; Operations research; Transport engineering; Computer science; Engineering; Finance","score_opus":0.05197102613057943,"score_gpt":0.27309306049818466,"score_spread":0.22112203436760522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411297645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09854652,0.00015881547,0.89842606,0.000056599834,0.0019587162,0.00040480425,0.0000013845737,0.00037860332,0.00006852253],"genre_scores_gemma":[0.9443074,0.000013071806,0.055239215,0.000029045737,0.0002532912,0.000078423844,0.000025693367,0.0000377371,0.000016111471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989939,0.000027157213,0.00041449387,0.0002018442,0.00009237053,0.0002702806],"domain_scores_gemma":[0.9995613,0.00015247069,0.000029228704,0.00015582067,0.000053294803,0.00004789839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545658,0.00016745123,0.00020718324,0.0004509301,0.000042776835,0.00006574885,0.00015044797,0.00017463067,0.0000015381572],"category_scores_gemma":[0.00020778421,0.00022419287,0.000043663986,0.00048377694,0.000006757429,0.00016680082,0.00003756526,0.0002505176,0.0000010790482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006611448,0.0000070544697,0.00014667414,0.00007630477,0.000023036026,5.532374e-7,0.00013742223,0.9848404,0.00077735685,0.00069119834,0.00009977988,0.013193599],"study_design_scores_gemma":[0.0010511345,0.0000084766825,0.000033292996,0.0003613532,0.0000120743525,4.6144768e-7,0.000033067954,0.9958198,0.0018947877,0.000046103785,0.000558752,0.00018066006],"about_ca_topic_score_codex":0.000009625895,"about_ca_topic_score_gemma":0.0000015686709,"teacher_disagreement_score":0.8457609,"about_ca_system_score_codex":0.0003891352,"about_ca_system_score_gemma":0.00005228456,"threshold_uncertainty_score":0.914232},"labels":[],"label_agreement":null},{"id":"W4411690650","doi":"10.1016/j.ejor.2025.06.014","title":"Beyond fifty years of vehicle routing: Insights into the history and the future","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"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é Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Computer science; Operations research; Routing (electronic design automation); History; Engineering; Computer network","score_opus":0.02854984090072116,"score_gpt":0.31013046177736303,"score_spread":0.2815806208766419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411690650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88709944,0.030488743,0.018296018,0.010657494,0.0016179616,0.00037250863,0.0000016931128,0.00003137228,0.051434737],"genre_scores_gemma":[0.99312085,0.0006259604,0.004962216,0.00014990866,0.00032089156,0.000001094363,7.227316e-7,0.000016168946,0.00080220285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973862,0.0016016709,0.00036117944,0.00007202873,0.00046787638,0.00011103749],"domain_scores_gemma":[0.99849826,0.0007707592,0.000055896442,0.00015925545,0.00047474666,0.00004106409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063369367,0.000060547736,0.00012122216,0.00015199375,0.0001651654,0.00005643256,0.00035322303,0.000019835617,0.000037663194],"category_scores_gemma":[0.0007242944,0.00003705936,0.00004611983,0.00026910336,0.0002936571,0.00011516398,0.00009869354,0.0005881024,0.000004503288],"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.00060877285,0.00011235651,0.0016661059,0.00016454245,0.000556845,0.000112530724,0.06107828,0.412911,0.022364417,0.23785272,0.09016076,0.17241165],"study_design_scores_gemma":[0.005982108,0.00027074426,0.106857575,0.00033184706,0.000065339045,0.000058566995,0.004181482,0.36562005,0.0023606392,0.0036375928,0.510315,0.0003190455],"about_ca_topic_score_codex":0.0000034369548,"about_ca_topic_score_gemma":0.0000023709788,"teacher_disagreement_score":0.42015424,"about_ca_system_score_codex":0.0001043553,"about_ca_system_score_gemma":0.00015884051,"threshold_uncertainty_score":0.2555045},"labels":[],"label_agreement":null},{"id":"W4412448016","doi":"10.1016/j.tre.2025.104278","title":"Learning for routing: A guided review of recent developments and future directions","year":2025,"lang":"en","type":"review","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Chalmers Tekniska Högskola; Energimyndigheten; VINNOVA; European Commission","keywords":"Computer science; Engineering","score_opus":0.16195595960732687,"score_gpt":0.44384761012884455,"score_spread":0.28189165052151766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412448016","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.7615817e-7,0.9810798,0.014081808,0.00020039448,0.00021734051,0.003494321,0.00046584467,0.00013091537,0.0003291884],"genre_scores_gemma":[0.0000012454811,0.9822852,0.011914108,0.00007658698,0.000073177165,0.0010789254,0.0043500774,0.000071946066,0.00014871008],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960432,0.00040995632,0.0021090328,0.00053571287,0.00049414806,0.00040795567],"domain_scores_gemma":[0.9971978,0.000920683,0.00041448514,0.00026632842,0.0010309058,0.00016978149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00270609,0.00046112534,0.0019754476,0.00033364023,0.00024380266,0.000030815667,0.00018108787,0.00027748244,0.00010335802],"category_scores_gemma":[0.00049861387,0.00043363628,0.00026481503,0.0014919002,0.00012353392,0.000085742984,0.0000038377275,0.0006670228,0.0000016154916],"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.0000015773483,0.000013655544,0.000014159596,0.46633378,0.00010789879,0.0000017843462,0.00004972987,0.0000781383,5.3134773e-8,0.0011615135,0.00076138956,0.5314763],"study_design_scores_gemma":[0.0001679003,0.000031786636,0.00008170064,0.21131483,0.0011121309,0.0000011442693,0.000013972813,0.00009776356,5.367293e-7,0.000031321146,0.78687596,0.00027092962],"about_ca_topic_score_codex":0.000009266976,"about_ca_topic_score_gemma":0.00003357622,"teacher_disagreement_score":0.7861146,"about_ca_system_score_codex":0.00006529943,"about_ca_system_score_gemma":0.0003642071,"threshold_uncertainty_score":0.99981153},"labels":[],"label_agreement":null},{"id":"W4412456327","doi":"10.1016/j.ejor.2025.07.007","title":"Robot-aided electric vehicle routing problem with lockers and prime customers prioritization","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"École Nationale d'Administration Publique; Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Gina Cody School of Engineering and Computer Science, Concordia University; Qatar National Research Fund; Qatar Research, Development and Innovation Council","keywords":"Prioritization; Vehicle routing problem; Computer science; Prime (order theory); Routing (electronic design automation); Robot; Electric vehicle; Operations research; City logistics; Artificial intelligence; Business; Computer network; Transport engineering; Engineering; Mathematics; Combinatorics","score_opus":0.026315521792389274,"score_gpt":0.3180905560652358,"score_spread":0.2917750342728465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412456327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4919739,0.0012278956,0.4630639,0.0018557754,0.00017676209,0.0006051693,0.000002372189,0.00013367397,0.04096054],"genre_scores_gemma":[0.93775284,0.00011978447,0.06141842,0.000039331775,0.00010358181,0.0000018987417,0.0000027508136,0.000037114907,0.00052424736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774283,0.0008298019,0.00043363814,0.00014326983,0.0005769397,0.00027353913],"domain_scores_gemma":[0.99857366,0.00025826163,0.000063987754,0.00010532158,0.0008929138,0.000105864296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004462243,0.00011042162,0.00015296826,0.00052027433,0.00025174484,0.00023121168,0.00019015255,0.000026616945,0.00002540337],"category_scores_gemma":[0.0004520275,0.00009666733,0.000025581943,0.001059613,0.00006131961,0.00032210778,0.000048287824,0.0005758411,0.000013100837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001070505,0.000041515552,0.004638409,0.00007980235,0.00013597033,0.00006775331,0.0006206422,0.8691187,0.084473185,0.0016576638,0.0013481347,0.03771116],"study_design_scores_gemma":[0.0032652675,0.00064725144,0.062245373,0.00074353354,0.000048276193,0.00020658417,0.00043985914,0.90201265,0.025475746,0.00010999917,0.004378958,0.00042650962],"about_ca_topic_score_codex":0.0000014518148,"about_ca_topic_score_gemma":6.681432e-7,"teacher_disagreement_score":0.44577897,"about_ca_system_score_codex":0.00016238134,"about_ca_system_score_gemma":0.00025199764,"threshold_uncertainty_score":0.39419794},"labels":[],"label_agreement":null},{"id":"W4412694328","doi":"10.1007/978-3-030-54621-2_667-1","title":"Stochastic Vehicle RoutingProblems","year":2025,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"","keywords":"Computer science","score_opus":0.00927828317183463,"score_gpt":0.22586276670093255,"score_spread":0.21658448352909793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412694328","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002275256,0.00034692383,0.48292565,0.000014319587,0.00047055914,0.00023597175,0.000022297558,0.00029918112,0.5156828],"genre_scores_gemma":[0.0006626094,0.0023842542,0.4548564,0.000035891397,0.00031997552,0.000030231755,0.00038232695,0.0002830449,0.54104525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834865,0.00002468196,0.0007553998,0.0003252757,0.00030009172,0.00024590665],"domain_scores_gemma":[0.99884015,0.00017824929,0.0002482839,0.0004414376,0.00021644968,0.00007543026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024270405,0.0004015677,0.00051787705,0.00036734296,0.000060318573,0.000025324254,0.00025856734,0.00047664435,0.0005345649],"category_scores_gemma":[0.00015360724,0.0004832296,0.00013485739,0.00015062097,0.000057148955,0.00012609367,0.0000721055,0.00037642612,0.000024180608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004360326,0.0000070278575,0.0000052116056,0.00019644454,0.00006646096,0.0000011767979,0.000087527114,0.98227274,0.0000052673463,0.005688073,0.0022339683,0.0094317505],"study_design_scores_gemma":[0.00029475117,0.000024493662,0.000004628221,0.00044174626,0.00013529498,0.0000016258865,0.000004844278,0.98530346,0.000022614282,0.0008247771,0.012507458,0.00043432962],"about_ca_topic_score_codex":0.0000029805838,"about_ca_topic_score_gemma":0.0000011719566,"teacher_disagreement_score":0.028069243,"about_ca_system_score_codex":0.00013067263,"about_ca_system_score_gemma":0.0000949211,"threshold_uncertainty_score":0.99976194},"labels":[],"label_agreement":null},{"id":"W4412845438","doi":"10.1155/atr/6668589","title":"Logistics Distribution Path Optimization Considering Carbon Emissions and Multifuel‐Type Vehicles","year":2025,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Path (computing); Distribution (mathematics); Carbon fibers; Environmental science; Transport engineering; Automotive engineering; Computer science; Engineering; Mathematics; Algorithm","score_opus":0.011898958981986042,"score_gpt":0.2693034358198958,"score_spread":0.25740447683790973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412845438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30576617,0.000454728,0.6930866,0.000060317027,0.00042639126,0.000077302684,0.0000131939905,0.0000621742,0.000053102667],"genre_scores_gemma":[0.8295648,0.00053834583,0.1697859,0.00001177386,0.000027280092,0.000001277177,0.000048407965,0.000013303166,0.000008868335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917567,0.000030958327,0.00047276725,0.00008725009,0.00012138625,0.00011195925],"domain_scores_gemma":[0.99933225,0.00011835387,0.00015016495,0.00007215182,0.0002695283,0.00005758125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019133546,0.00010943409,0.0001823401,0.00010057061,0.000059741567,0.000020396401,0.000046967994,0.000079671176,0.000003204957],"category_scores_gemma":[0.00019812549,0.00011233503,0.000033207223,0.00028879344,0.000029514873,0.00018737983,0.0000020006814,0.00017605847,6.454969e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003308665,0.0000122153215,0.0022230616,0.000073904426,0.000024974592,0.0000062357894,0.00023481004,0.98408455,0.008408109,0.00016464599,0.000014667507,0.00471973],"study_design_scores_gemma":[0.0013445104,0.000072848954,0.035153553,0.00042033615,0.00015418272,0.000010517805,0.00048074347,0.95114774,0.010022333,0.000562204,0.00041977028,0.00021123746],"about_ca_topic_score_codex":0.000001833182,"about_ca_topic_score_gemma":0.000002656388,"teacher_disagreement_score":0.5237987,"about_ca_system_score_codex":0.000069277776,"about_ca_system_score_gemma":0.000039867886,"threshold_uncertainty_score":0.45808896},"labels":[],"label_agreement":null},{"id":"W4413940061","doi":"10.1016/j.omega.2025.103419","title":"Column generation and local search for the profit-oriented hub-line location problem with elastic demands","year":2025,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University; Group for Research in Decision Analysis; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Column (typography); Profit (economics); Mathematical optimization; Computer science; Mathematics; Structural engineering; Engineering; Economics; Microeconomics","score_opus":0.016857956068773276,"score_gpt":0.2726278391212295,"score_spread":0.25576988305245624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413940061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03861369,0.00019779247,0.95976293,0.00034586794,0.00009253069,0.0006104256,0.0000027833821,0.00011563746,0.0002583637],"genre_scores_gemma":[0.91855377,0.000019017589,0.08045642,0.000041056566,0.00006509764,0.00018523504,0.000026708682,0.000020117825,0.0006325886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946064,0.00003331594,0.00013771192,0.00013402132,0.00009396914,0.00014033461],"domain_scores_gemma":[0.9995234,0.00014985152,0.000016683953,0.00012456566,0.00015988547,0.000025635374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035855063,0.000082273364,0.000084917156,0.00006132803,0.00014712928,0.00004957141,0.000053077743,0.000049679562,0.0000026966884],"category_scores_gemma":[0.00003783573,0.00006227995,0.000010138612,0.0004096641,0.00004439161,0.0000674455,0.000016192194,0.00008618337,0.0000011123176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001967308,0.000006472715,0.0013849406,0.00013978123,0.0000332146,1.5262526e-7,0.0001322345,0.9800457,0.0009197708,0.002426153,0.00024674868,0.014645159],"study_design_scores_gemma":[0.00052956096,0.000055693334,0.0011963724,0.00004086158,0.0000339174,0.0000017984511,0.00006217195,0.99223375,0.0049082385,0.000024748915,0.00084150763,0.00007138897],"about_ca_topic_score_codex":0.000006369702,"about_ca_topic_score_gemma":0.000029755689,"teacher_disagreement_score":0.8799401,"about_ca_system_score_codex":0.000053706877,"about_ca_system_score_gemma":0.000044273478,"threshold_uncertainty_score":0.25397027},"labels":[],"label_agreement":null},{"id":"W4414015801","doi":"10.11159/cist25.154","title":"Solving the Vehicle Routing Problem via Distance-Aware Clustering and Simulated Annealing","year":2025,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Istanbul Teknik Üniversitesi","keywords":"Vehicle routing problem; Cluster analysis; Simulated annealing; Computer science; Routing (electronic design automation); Mathematical optimization; Computer network; Algorithm; Artificial intelligence; Mathematics","score_opus":0.0058794323783142345,"score_gpt":0.2164570457438098,"score_spread":0.21057761336549558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414015801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69653034,0.0019973635,0.29774818,0.00037561904,0.0016289214,0.00072396535,0.0000018187345,0.00048552197,0.0005082883],"genre_scores_gemma":[0.99761134,0.000025939564,0.002171341,0.000025853962,0.000054639295,0.000007368045,5.8677184e-8,0.000013600833,0.00008983237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989136,0.000009334964,0.00028476384,0.0002750942,0.00020078025,0.0003164147],"domain_scores_gemma":[0.9994581,0.00019325917,0.00007112605,0.000096820906,0.000114186434,0.00006651054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006880507,0.00016736455,0.00022285292,0.00017544017,0.00035946295,0.0003500455,0.0002935745,0.00003866516,1.0165369e-7],"category_scores_gemma":[0.000051209354,0.00011443905,0.000023231447,0.0011375778,0.00011775139,0.00016434224,0.00018815101,0.0002554976,4.4165382e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063591456,0.000005592608,0.0036247661,0.00037978427,0.000025319336,3.4293342e-7,0.000219121,0.9725136,0.0048703053,0.0070455023,0.000033606273,0.011275672],"study_design_scores_gemma":[0.00016021522,0.000018732797,0.0018073309,0.00064152706,0.000011236523,0.000008428908,0.000017182798,0.9958272,0.0012414379,0.00002360983,0.00011599469,0.0001270996],"about_ca_topic_score_codex":0.000013427001,"about_ca_topic_score_gemma":0.0000010759319,"teacher_disagreement_score":0.30108103,"about_ca_system_score_codex":0.000047139303,"about_ca_system_score_gemma":0.000012078122,"threshold_uncertainty_score":0.4666689},"labels":[],"label_agreement":null},{"id":"W4414449054","doi":"10.1080/00207543.2025.2557530","title":"An innovative framework integrating MILP and a parallel optimal algorithm for UAV-Enabled last-Mile delivery","year":2025,"lang":"en","type":"article","venue":"International Journal of Production Research","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":"McMaster University","funders":"","keywords":"Optimal design; Production (economics); Minification; Key (lock); Algorithm design; Efficient algorithm","score_opus":0.04409514489310777,"score_gpt":0.41156813893355976,"score_spread":0.367472994040452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414449054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10986327,0.0002786957,0.8866096,0.0012777423,0.0014746676,0.00023421973,0.000008730252,0.000045131543,0.00020791072],"genre_scores_gemma":[0.15715134,0.0001869165,0.8413863,0.00004540821,0.00089629355,0.000029049503,0.000008356828,0.000023068109,0.00027323543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983156,0.00021433583,0.00049665995,0.00020258132,0.00054568244,0.00022516507],"domain_scores_gemma":[0.9945201,0.00045947058,0.000111564346,0.00013133157,0.004711647,0.0000658427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030769573,0.000114116505,0.00018004715,0.0008784521,0.00013782512,0.00019064905,0.0003542776,0.00010082568,0.00002543878],"category_scores_gemma":[0.0022520788,0.00010954109,0.00004476555,0.00073975994,0.00009463297,0.00050560484,0.00006239147,0.0007381732,0.0000014318013],"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.00034671914,0.00021119554,0.0014194692,0.00009414569,0.00071892986,0.000021498287,0.002600173,0.3860408,0.023501808,0.005141874,0.005223253,0.57468015],"study_design_scores_gemma":[0.0010870158,0.0003079808,0.0012255694,0.0005207519,0.000018824527,0.00010189078,0.002459228,0.9639349,0.016765296,0.005109028,0.008253527,0.00021598507],"about_ca_topic_score_codex":0.0000074157742,"about_ca_topic_score_gemma":0.0000023407167,"teacher_disagreement_score":0.5778941,"about_ca_system_score_codex":0.00022611009,"about_ca_system_score_gemma":0.00016790567,"threshold_uncertainty_score":0.4466956},"labels":[],"label_agreement":null},{"id":"W4414516671","doi":"10.1016/j.clet.2025.101082","title":"From cost-centering to sustainability: A review of Pollution Routing Problems","year":2025,"lang":"en","type":"article","venue":"Cleaner Engineering and Technology","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","funders":"","keywords":"Blueprint; Sustainability; Service (business); Routing (electronic design automation); Service provider; Vehicle routing problem; Sustainable development","score_opus":0.005967532315502251,"score_gpt":0.24786932294119188,"score_spread":0.24190179062568962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414516671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13648954,0.012469325,0.844074,0.0032638807,0.00041058665,0.0008760018,0.000013359563,0.0020289633,0.00037435445],"genre_scores_gemma":[0.96979874,0.0010694824,0.028893534,0.00007732724,0.00002214597,0.00006564475,0.0000053664917,0.0000301317,0.000037597776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991777,0.0000136964445,0.00031845274,0.00019963385,0.000056827663,0.00023370348],"domain_scores_gemma":[0.9995161,0.000045195946,0.000027774426,0.0002755338,0.00009553404,0.000039836363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024924328,0.00014036962,0.00028434352,0.00035538248,0.000029100405,0.000010127431,0.00013287266,0.00012655754,0.000004793991],"category_scores_gemma":[0.0005647019,0.00015777069,0.000026738078,0.000915536,0.00002732608,0.000040682346,0.00010632428,0.00018518865,0.0000010611993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042650427,0.000023823693,0.0013451908,0.009201666,0.00011205778,0.0000043083915,0.00021158277,0.7238076,0.018997531,0.0056316056,0.00037934465,0.24028108],"study_design_scores_gemma":[0.00072538445,0.0000728103,0.0011765531,0.015954126,0.00011155342,0.000015869333,0.00033146192,0.9190611,0.024793481,0.0012876074,0.03584585,0.0006241682],"about_ca_topic_score_codex":0.000012862698,"about_ca_topic_score_gemma":8.250397e-7,"teacher_disagreement_score":0.83330923,"about_ca_system_score_codex":0.00011385689,"about_ca_system_score_gemma":0.000016938018,"threshold_uncertainty_score":0.64337015},"labels":[],"label_agreement":null},{"id":"W4414567829","doi":"10.1016/j.ifacol.2025.09.037","title":"A Decomposition-Based Framework for Large-Scale Multi-Period Log-Truck Routing and Scheduling: A Case Study in Canadian Forestry","year":2025,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","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; Cégep de Lévis; Université du Québec à Rimouski; Natural Resources Canada","funders":"","keywords":"Routing (electronic design automation); Scheduling (production processes); Work (physics); Heuristic; Decomposition; Linear programming; Forest industry","score_opus":0.018065031708536825,"score_gpt":0.32959342778408235,"score_spread":0.3115283960755455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414567829","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.604747,0.00014698789,0.39383832,0.00027139255,0.0001806467,0.00059238274,0.00005720267,0.00014085688,0.000025219795],"genre_scores_gemma":[0.49724653,0.0000015125748,0.5024575,0.00013845236,0.000034109293,0.000058478217,0.000020998898,0.000029497984,0.000012926096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984562,0.000083590356,0.00039901998,0.0003729801,0.000089818815,0.0005983935],"domain_scores_gemma":[0.99903077,0.00036710032,0.0000437938,0.0002672643,0.00006891787,0.00022212595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058094173,0.0002552212,0.00032840145,0.00033744748,0.0002638598,0.00009073855,0.00012706425,0.00023190773,0.000015345835],"category_scores_gemma":[0.00043910003,0.00029368352,0.00006296902,0.000511859,0.000024386676,0.00008212982,0.00002894754,0.00038525663,0.0000013925664],"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.000030918993,0.0002269426,0.4154778,0.000195486,0.00008031387,0.00045203802,0.00393334,0.57632494,0.00018444989,0.00020713717,0.0000010847104,0.0028855454],"study_design_scores_gemma":[0.0021910507,0.00004740399,0.008712506,0.00017672629,0.000044799614,0.00004784582,0.0054877424,0.9828834,0.00007791166,0.0000344794,0.000024488349,0.00027166537],"about_ca_topic_score_codex":0.009605725,"about_ca_topic_score_gemma":0.20397735,"teacher_disagreement_score":0.40676528,"about_ca_system_score_codex":0.00026749447,"about_ca_system_score_gemma":0.00021225034,"threshold_uncertainty_score":0.99995154},"labels":[],"label_agreement":null},{"id":"W4415191847","doi":"10.48550/arxiv.2508.05877","title":"Superadditivity-based valid inequalities and asymptotic bounds for the vehicle routing problem with stochastic demands","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Superadditivity; Integer (computer science); Computation; Function (biology); Integer programming; Exploit; Bounded function","score_opus":0.04194404882473119,"score_gpt":0.28145271826055074,"score_spread":0.23950866943581955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415191847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32748863,0.00033800298,0.669945,0.00031352468,0.00027540722,0.0008591811,0.00012004776,0.00045864919,0.00020151827],"genre_scores_gemma":[0.9624489,0.000019627787,0.036244646,0.00014896507,0.00018854959,0.0005042601,0.00009006338,0.00009416467,0.00026081892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822414,0.00017121025,0.00045089587,0.0004779001,0.0002169029,0.00045897777],"domain_scores_gemma":[0.9969781,0.0021165016,0.000120329925,0.00054237654,0.00016447219,0.000078244375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011013019,0.0004354377,0.0004883527,0.00013889135,0.00034591972,0.00020411982,0.00030022892,0.00025195567,0.000012853158],"category_scores_gemma":[0.0003341913,0.00035183865,0.0001038817,0.00022712184,0.00012307547,0.00009671951,0.00021094695,0.00063719443,0.0000018928398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023813709,0.000017404664,0.025064403,0.00097208197,0.00019222772,0.0000012284711,0.00078616367,0.9714969,0.00006728042,0.00039453804,0.000051101557,0.000932884],"study_design_scores_gemma":[0.0008753801,0.00006605789,0.008219921,0.0009269523,0.00028600552,0.000002904571,0.00021641322,0.9877948,0.00067738805,0.00027743183,0.00015381175,0.0005029361],"about_ca_topic_score_codex":0.00004668902,"about_ca_topic_score_gemma":0.000028402455,"teacher_disagreement_score":0.6349603,"about_ca_system_score_codex":0.000130616,"about_ca_system_score_gemma":0.00019856582,"threshold_uncertainty_score":0.99989337},"labels":[],"label_agreement":null},{"id":"W4415588099","doi":"10.1287/ijoc.2025.1140","title":"Exact Methods and a Two-Stage Iterative Heuristic for the Carrier-Vehicle Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"INFORMS journal on computing","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é Laval","funders":"","keywords":"Travelling salesman problem; Heuristics; Heuristic; 2-opt; Benchmark (surveying); Set (abstract data type); Traveling purchaser problem; Software; Bottleneck traveling salesman problem","score_opus":0.02174006309521651,"score_gpt":0.34764696089454084,"score_spread":0.3259068977993243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415588099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041286446,0.00038950908,0.9550745,0.00017343771,0.000511055,0.00034050125,0.0000056055915,0.00014531105,0.0020736484],"genre_scores_gemma":[0.51353526,0.000049487226,0.4856989,0.00031218483,0.00019788438,0.0000079490665,0.0000016258269,0.000033601922,0.00016306636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986187,0.00011853472,0.00060893025,0.00014845676,0.00014561244,0.0003597737],"domain_scores_gemma":[0.9973341,0.0020989361,0.00016283216,0.00016032375,0.00015001414,0.000093790375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022019704,0.00021644478,0.00027151598,0.00015582192,0.0006758473,0.00041521338,0.00021572247,0.000069754475,0.0000062357026],"category_scores_gemma":[0.00043650967,0.00015373951,0.000097940254,0.0003174567,0.000044967623,0.00019174989,0.000059384434,0.00062234554,8.8666775e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017505497,0.000004514254,0.0002392218,0.000085736865,0.000095251664,0.0000024662336,0.0016669977,0.769721,0.0003892638,0.0018315947,0.00005565105,0.22589082],"study_design_scores_gemma":[0.0008846493,0.000057375983,0.0005513107,0.00029230153,0.000036606492,0.000039163435,0.00046373604,0.99180865,0.001672263,0.0007331233,0.003285248,0.00017555703],"about_ca_topic_score_codex":0.0000033328151,"about_ca_topic_score_gemma":0.0000014535669,"teacher_disagreement_score":0.47224885,"about_ca_system_score_codex":0.00011508081,"about_ca_system_score_gemma":0.00005822881,"threshold_uncertainty_score":0.62693155},"labels":[],"label_agreement":null},{"id":"W4415616276","doi":"10.1016/j.tre.2025.104494","title":"The two-echelon location-routing problem: A comparative analysis of novel and existing compact formulations","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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é Laval","funders":"Alliance de recherche numérique du Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Arc routing; Benchmark (surveying); Linear programming; Polynomial; Vehicle routing problem; Integer programming; Routing (electronic design automation)","score_opus":0.19399182872757764,"score_gpt":0.4513913791284737,"score_spread":0.25739955040089607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415616276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019450294,0.018133197,0.95740896,0.00064775563,0.00007062715,0.0015650691,0.00029823123,0.00014351166,0.002282327],"genre_scores_gemma":[0.9678358,0.016330391,0.015064669,0.000041422085,0.000009538867,0.00007978314,0.0005561792,0.000013187172,0.00006907232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979572,0.0001404183,0.0009993935,0.0002625704,0.00036334482,0.00027703794],"domain_scores_gemma":[0.9973598,0.001339391,0.00017251915,0.00021648261,0.0008268068,0.00008498552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019477482,0.00017859475,0.00049609545,0.00030916874,0.00045045442,0.000060007504,0.0001231034,0.00006128097,0.000011695305],"category_scores_gemma":[0.0001366083,0.00015239595,0.00008098843,0.0027847115,0.00027123844,0.00012139244,0.0000020825548,0.00028327992,4.637638e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020297368,0.00006805758,0.02467758,0.00360581,0.0008158124,0.0000011972782,0.0013558388,0.69670326,0.00017567223,0.26609623,0.00016282426,0.006317415],"study_design_scores_gemma":[0.00089214224,0.000041399413,0.29955006,0.0024839041,0.0018134759,2.9780287e-7,0.000489204,0.68822336,0.00013020479,0.0010512063,0.005026533,0.00029819665],"about_ca_topic_score_codex":0.0001935726,"about_ca_topic_score_gemma":0.0018106096,"teacher_disagreement_score":0.9483855,"about_ca_system_score_codex":0.000031812808,"about_ca_system_score_gemma":0.000075895594,"threshold_uncertainty_score":0.6214527},"labels":[],"label_agreement":null},{"id":"W4415702155","doi":"10.19139/soic-2310-5070-2916","title":"Vehicle Routing Problem with Synchronization and Scheduling Constraints of support vehicles","year":2025,"lang":"en","type":"article","venue":"Statistics Optimization & Information Computing","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":"Group for Research in Decision Analysis","funders":"","keywords":"Scheduling (production processes); Vehicle routing problem; Robustness (evolution); Synchronization (alternating current); Flow network; Job shop scheduling; Computation; Linear programming","score_opus":0.005838467422967215,"score_gpt":0.23433599663862803,"score_spread":0.22849752921566083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415702155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039840974,0.000019680398,0.9910806,0.000034847377,0.000116929616,0.0003308722,0.000053756485,0.0003232591,0.0040559815],"genre_scores_gemma":[0.4630386,0.000018259958,0.53672063,0.00004410934,0.000009580361,0.0000030475337,0.00014535242,0.000013449353,0.0000069992157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849766,0.000060226943,0.00082827127,0.00014089825,0.00022769399,0.00024523566],"domain_scores_gemma":[0.99866676,0.0002576769,0.00030168542,0.00014926137,0.00056549616,0.000059136128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005336359,0.00019620369,0.0002508691,0.00031213893,0.00021435508,0.00015771485,0.000107000364,0.00009672704,0.000031417894],"category_scores_gemma":[0.00023372527,0.0002147691,0.00001737623,0.0006795154,0.00013805332,0.0006883657,0.000058567402,0.00016450722,0.0000026605203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007536713,0.000007420001,0.0023218535,0.0003410544,0.00004135264,2.749719e-7,0.0007761109,0.9313717,0.000028109711,0.011138177,0.00005696865,0.053909454],"study_design_scores_gemma":[0.0007263146,0.000033440545,0.00054189016,0.00022931858,0.000037445454,0.0000048323423,0.00043666747,0.9971906,0.00044454326,0.00011907018,0.00003972145,0.00019613202],"about_ca_topic_score_codex":0.0000052884884,"about_ca_topic_score_gemma":9.657424e-7,"teacher_disagreement_score":0.45905447,"about_ca_system_score_codex":0.000083157836,"about_ca_system_score_gemma":0.00012352808,"threshold_uncertainty_score":0.87580293},"labels":[],"label_agreement":null},{"id":"W4415896744","doi":"10.1016/j.tre.2025.104509","title":"Consistent home health care routing and scheduling problem under time uncertainty","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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é de Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Scheduling (production processes); Vehicle routing problem; Benchmark (surveying); Routing (electronic design automation); Consistency (knowledge bases); Set (abstract data type); Job shop scheduling; Home health","score_opus":0.06014247469206965,"score_gpt":0.3755320767420944,"score_spread":0.31538960205002475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415896744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029382195,0.28156966,0.6711724,0.0083186235,0.00035725997,0.0052624354,0.0009946692,0.001043575,0.0018991911],"genre_scores_gemma":[0.7847711,0.16129556,0.050275464,0.0010178989,0.000042406766,0.0002376418,0.0020937454,0.000071470735,0.00019470662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772745,0.0002107186,0.0008627518,0.00039523636,0.00037617312,0.00042766088],"domain_scores_gemma":[0.9987733,0.00030812153,0.000097370554,0.00019719942,0.00044010673,0.00018392556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014305118,0.00022933012,0.00048885384,0.00018279607,0.0003306153,0.00006794275,0.000097444536,0.00010287121,0.00005078126],"category_scores_gemma":[0.00004720681,0.00023286854,0.00006425788,0.000686266,0.0001837407,0.00010435589,0.0000026901475,0.00039873392,0.0000051961415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004993353,0.00009273788,0.011851803,0.04883319,0.00034217222,0.000027247343,0.0030636378,0.7400678,0.00012578412,0.12526737,0.0023180842,0.067960285],"study_design_scores_gemma":[0.010376972,0.00096123054,0.32434723,0.06928512,0.0019899409,0.000012031526,0.00728481,0.41421813,0.00028272643,0.015564588,0.15096246,0.004714778],"about_ca_topic_score_codex":0.00010187803,"about_ca_topic_score_gemma":0.00036559536,"teacher_disagreement_score":0.7553889,"about_ca_system_score_codex":0.000085116444,"about_ca_system_score_gemma":0.00017997652,"threshold_uncertainty_score":0.94961035},"labels":[],"label_agreement":null},{"id":"W4416027488","doi":"10.1016/j.tre.2025.104491","title":"Inventory routing with heterogeneous vehicles and hazardous material backhauling","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Hydro-Québec; HEC Montréal","funders":"Mitacs","keywords":"Routing (electronic design automation); Stockout; Vehicle routing problem; Hazardous waste; Heuristic; Decomposition; Delivery Performance","score_opus":0.0547987876728708,"score_gpt":0.34189014457411365,"score_spread":0.2870913569012429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416027488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6396051,0.059620243,0.2927521,0.001322418,0.00055803015,0.0033179668,0.0005782683,0.0009712193,0.001274657],"genre_scores_gemma":[0.93332577,0.057029206,0.00875485,0.00018245893,0.000039223803,0.00012309648,0.000426234,0.00004482207,0.00007432827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9982395,0.00013457633,0.00060353073,0.00033908282,0.0003383941,0.00034490478],"domain_scores_gemma":[0.99920565,0.00016130848,0.00006529474,0.00017923857,0.00025683918,0.00013165643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009350912,0.0002144762,0.0003661415,0.00015660461,0.00022276153,0.00007988602,0.00009488361,0.000098557684,0.000052032367],"category_scores_gemma":[0.00003933265,0.00020194887,0.0000396857,0.00047507844,0.00019899562,0.00011611526,0.0000022015993,0.00028081128,0.0000023627274],"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.00047306638,0.0002989243,0.14603572,0.07668385,0.0010993215,0.00052845204,0.003141187,0.5320314,0.002107339,0.094245434,0.0028469837,0.14050831],"study_design_scores_gemma":[0.010855652,0.0012931358,0.40061238,0.054925956,0.0033776895,0.000047299956,0.0015109528,0.3350696,0.009608054,0.008701415,0.16865985,0.005338011],"about_ca_topic_score_codex":0.000050542556,"about_ca_topic_score_gemma":0.00030323133,"teacher_disagreement_score":0.29372066,"about_ca_system_score_codex":0.000027904614,"about_ca_system_score_gemma":0.000058325117,"threshold_uncertainty_score":0.82352364},"labels":[],"label_agreement":null},{"id":"W4416118539","doi":"10.48550/arxiv.2504.05109","title":"Inverse Mixed Integer Optimization: An Interior Point Perspective","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cutting-plane method; Linear programming; Interior point method; Integer programming; Inverse; Point (geometry); Inverse problem; Norm (philosophy)","score_opus":0.03748786668656436,"score_gpt":0.3009208295311216,"score_spread":0.26343296284455725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416118539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106449425,0.00022040274,0.87700164,0.0004288682,0.0034118681,0.00056186266,0.00006171095,0.00164939,0.010214813],"genre_scores_gemma":[0.40993536,0.00031619737,0.58534545,0.00053837535,0.00070605945,0.00020922975,0.0002747764,0.00024163215,0.0024329424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978162,0.00028098834,0.00058199064,0.00073830446,0.00020090587,0.00038160663],"domain_scores_gemma":[0.99809957,0.00010403258,0.00014405654,0.0010328459,0.00044305748,0.00017644095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047941232,0.00052921596,0.00056594453,0.00038653926,0.000097587246,0.000119391574,0.0006130159,0.000531868,0.0005054127],"category_scores_gemma":[0.00045303453,0.00060648425,0.00019984234,0.00040669966,0.00008933257,0.00026238422,0.000675356,0.0011577781,0.00007234419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014964993,0.000029397417,0.005476898,0.00015023704,0.00017017426,0.000010009399,0.0021972547,0.99045485,0.0001314155,0.00022098084,0.00080999755,0.00033383077],"study_design_scores_gemma":[0.00039812777,0.000032913817,0.0014283843,0.000363613,0.00011085855,0.000007024191,0.0016288254,0.99342304,0.001206398,0.00018561739,0.0005495862,0.0006656116],"about_ca_topic_score_codex":0.00009068723,"about_ca_topic_score_gemma":0.000034107186,"teacher_disagreement_score":0.30348593,"about_ca_system_score_codex":0.0007241836,"about_ca_system_score_gemma":0.00015486137,"threshold_uncertainty_score":0.9996387},"labels":[],"label_agreement":null},{"id":"W4416223881","doi":"10.1080/01605682.2025.2579861","title":"Snowplough service area reconfiguration using workload balancing techniques with route optimisation for large municipalities","year":2025,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","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":"Surrey Place Centre; Ontario Tech University","funders":"","keywords":"Workload; Control reconfiguration; Scheduling (production processes); Service (business); Information technology; Information system; Information and Communications Technology","score_opus":0.07968452884789758,"score_gpt":0.38376901599018215,"score_spread":0.3040844871422846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416223881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19019027,0.00032981142,0.803176,0.00428855,0.00027901627,0.0007192041,0.000026032905,0.00006462168,0.00092649565],"genre_scores_gemma":[0.49429348,0.00017927449,0.5038389,0.00049555424,0.00029292604,0.000044096792,0.000009575362,0.00003372457,0.00081248407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846935,0.00023783639,0.00040131542,0.000103272985,0.0005345266,0.00025369757],"domain_scores_gemma":[0.9973579,0.0005266898,0.00010422631,0.00017798335,0.0017914729,0.000041694286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039326022,0.000108539796,0.00016867835,0.000092073446,0.0005632065,0.00020936172,0.00029696574,0.00010507025,0.000020046016],"category_scores_gemma":[0.0004193743,0.00007781767,0.00012360085,0.0006673645,0.000036643352,0.00045703189,0.000051072475,0.00047834532,2.4697852e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058522564,0.000034734807,0.00078349956,0.00016495417,0.00019910687,3.4716257e-7,0.002873973,0.97247005,0.017057827,0.0016372583,0.0034141177,0.0013056],"study_design_scores_gemma":[0.00054237264,0.000034739325,0.0006541133,0.0007566885,0.000031522453,0.0000117123645,0.0019087427,0.973933,0.018886117,0.00044890906,0.002687012,0.00010509164],"about_ca_topic_score_codex":0.00001983682,"about_ca_topic_score_gemma":0.000022512239,"teacher_disagreement_score":0.30410323,"about_ca_system_score_codex":0.0005507058,"about_ca_system_score_gemma":0.00047221687,"threshold_uncertainty_score":0.43317857},"labels":[],"label_agreement":null},{"id":"W4416254644","doi":"10.1016/j.omega.2025.103461","title":"Multi-driver transportation scheduling for improving supply chain resilience","year":2025,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","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":"Laurentian University","funders":"Humanities and Social Science Fund of Ministry of Education of China; Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; State Key Laboratory of Fluid Power and Mechatronic Systems; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Supply chain; Scheduling (production processes); Linear programming; Flexibility (engineering); Metaheuristic; Resilience (materials science); Job shop scheduling; Convergence (economics)","score_opus":0.012097279558888214,"score_gpt":0.2716048377932268,"score_spread":0.2595075582343386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416254644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1323654,0.000120540026,0.8665098,0.00006854465,0.00027411687,0.00021665634,0.000011953807,0.00027650455,0.00015651356],"genre_scores_gemma":[0.5353199,0.0000060845605,0.4642372,0.0000307013,0.00001991056,0.000030931547,0.000011696364,0.000014439484,0.00032910015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993809,0.000015966867,0.00018907772,0.00016157798,0.00006452038,0.00018796814],"domain_scores_gemma":[0.99966395,0.00009551436,0.000023648185,0.00013426298,0.00005179832,0.00003084526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000250882,0.00009427725,0.00010666286,0.00011085522,0.00008045327,0.000028328484,0.00010297943,0.00006952674,0.000006888477],"category_scores_gemma":[0.00011451374,0.00010839688,0.000042903433,0.00026172184,0.000015732208,0.000121460216,0.0000044728304,0.000088444096,0.0000029401547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069352686,0.000009057561,0.0029208127,0.000177967,0.000010881447,6.678094e-7,0.00032814447,0.9174257,0.05790026,0.00069645385,0.000047517093,0.020475628],"study_design_scores_gemma":[0.00050842314,0.000007400973,0.009820821,0.00003960557,0.000015054394,1.6658485e-7,0.000073117946,0.9719509,0.016873533,0.000045357694,0.0005510138,0.0001145961],"about_ca_topic_score_codex":0.00001004863,"about_ca_topic_score_gemma":0.000018635916,"teacher_disagreement_score":0.40295455,"about_ca_system_score_codex":0.000050918352,"about_ca_system_score_gemma":0.000022859644,"threshold_uncertainty_score":0.44202965},"labels":[],"label_agreement":null},{"id":"W4416323349","doi":"","title":"Algorithms for solving the On-Demand Bus Routing Problem with Bus Stops Assignment","year":2024,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"HEC Montréal","funders":"","keywords":"Routing (electronic design automation); Algorithm design; Vehicle routing problem; Class (philosophy)","score_opus":0.014789497403528673,"score_gpt":0.23765099254122743,"score_spread":0.22286149513769876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416323349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064356015,0.00067887374,0.9728473,0.003525702,0.00016974147,0.00054643955,0.000016085558,0.00069681206,0.015083454],"genre_scores_gemma":[0.6259136,0.00010605172,0.3704585,0.00006091835,0.00004679535,0.000156975,0.000043425665,0.00009335815,0.0031203493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789137,0.00080444594,0.0003084849,0.00036525435,0.00028709578,0.00034336778],"domain_scores_gemma":[0.9964164,0.0023045298,0.000076192686,0.0006957933,0.00042088883,0.000086222106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005077454,0.00021054689,0.00017215426,0.00009388071,0.00039852495,0.0004738187,0.0004263715,0.00008069913,0.000033295204],"category_scores_gemma":[0.00039948066,0.00016271349,0.000079214275,0.000492062,0.00007989928,0.00014326787,0.00009303629,0.0002915555,0.000017091856],"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.000028667684,0.0003055617,0.0009320726,0.0007111241,0.0004691374,0.000014642773,0.03407101,0.35223657,0.010706935,0.19648059,0.0036772205,0.4003665],"study_design_scores_gemma":[0.00031742943,0.0000011616813,0.00018578142,0.0010333105,0.00003606961,0.000011550693,0.00015377071,0.9623638,0.025751427,0.0005279964,0.00937685,0.00024090176],"about_ca_topic_score_codex":0.000034469558,"about_ca_topic_score_gemma":0.000046385987,"teacher_disagreement_score":0.619478,"about_ca_system_score_codex":0.000138255,"about_ca_system_score_gemma":0.00006984198,"threshold_uncertainty_score":0.66352636},"labels":[],"label_agreement":null},{"id":"W4416407132","doi":"10.1007/978-3-032-00563-2_1","title":"Moving Toward Sustainability: A Methodological Review of the Pollution-Routing Problem in the Optimization Literature","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Sustainability; Control (management); Sustainable development; Systematic review; Vehicle routing problem","score_opus":0.03936644087898629,"score_gpt":0.3091937171689351,"score_spread":0.26982727628994885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416407132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013814715,0.01985985,0.597162,0.0048980955,0.0002232033,0.0023371533,0.000024247161,0.00024792025,0.37524614],"genre_scores_gemma":[0.001010121,0.018287597,0.91858864,0.0026744101,0.00015025426,0.000119610115,0.00007206523,0.00010558314,0.05899174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973286,0.00078149524,0.0009352156,0.00033757533,0.0003567906,0.0002603144],"domain_scores_gemma":[0.9977915,0.0008862611,0.00023966367,0.0006750889,0.00038161807,0.000025813366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045850435,0.00036088028,0.00063997105,0.00016111511,0.00008087859,0.000058593436,0.0006002294,0.00045970807,0.00013229353],"category_scores_gemma":[0.0027689047,0.0002115848,0.00028919405,0.0005392796,0.000076883174,0.00008766161,0.00018774053,0.0009811613,5.5782306e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047277344,0.000011176017,0.000021220925,0.017056147,0.000057979658,0.000003819843,0.0007844293,0.81229347,0.000004031685,0.15613517,0.0012422531,0.012385559],"study_design_scores_gemma":[0.0007597601,0.00007820932,0.00018398244,0.108581476,0.0007117438,0.00007059503,0.00057530997,0.7972217,0.00008818743,0.050286457,0.03972703,0.0017155573],"about_ca_topic_score_codex":0.0000067499013,"about_ca_topic_score_gemma":0.0000017565635,"teacher_disagreement_score":0.3214266,"about_ca_system_score_codex":0.00030582046,"about_ca_system_score_gemma":0.00016105229,"threshold_uncertainty_score":0.86281776},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"review","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W4416539314","doi":"10.4230/lipics.socg.2025.53","title":"A PTAS for TSP with Neighbourhoods over Parallel Line Segments","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","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":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Neighbourhood (mathematics); Line segment; Approximation algorithm; Euclidean geometry; Line (geometry); Euclidean distance; Point (geometry)","score_opus":0.02501878103276981,"score_gpt":0.2937707257300304,"score_spread":0.26875194469726055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416539314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38632444,0.00012345583,0.60999775,0.00018326327,0.00023478174,0.00027589526,0.000008127097,0.00033133425,0.002520948],"genre_scores_gemma":[0.83205557,0.00002707307,0.1651318,0.00038790453,0.000099674166,0.00008350878,0.000020759624,0.00005485795,0.002138826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.000027198106,0.00021631818,0.00020927595,0.00009526731,0.00028391957],"domain_scores_gemma":[0.99946105,0.000105961335,0.000034190256,0.00028389832,0.000055407407,0.000059494858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018708738,0.00016951568,0.000192943,0.00008728673,0.00007563526,0.000028187005,0.0001444319,0.00008748647,0.000071561764],"category_scores_gemma":[0.00007577044,0.0001569137,0.000053336233,0.00030843687,0.000022583383,0.00010165586,0.000033944452,0.00013112901,0.000019607493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007540851,0.00006482657,0.42007643,0.00019022479,0.0002736135,0.0000047876715,0.00018596757,0.56830245,0.0023375305,0.0008098484,0.0026058345,0.0050730486],"study_design_scores_gemma":[0.0042549907,0.00016079945,0.2775,0.00021618581,0.00015478405,0.0000038527364,0.00006904328,0.69429547,0.009263082,0.00029327773,0.013176602,0.0006119417],"about_ca_topic_score_codex":0.0000080443715,"about_ca_topic_score_gemma":0.0000057867524,"teacher_disagreement_score":0.44573116,"about_ca_system_score_codex":0.0000618907,"about_ca_system_score_gemma":0.00003042754,"threshold_uncertainty_score":0.6398755},"labels":[],"label_agreement":null},{"id":"W4416554829","doi":"","title":"An Optimal Transport Based Goal-Oriented hr-Adaptive Mesh Pursuit","year":2025,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"Polytechnique Montréal; Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Focus (optics); Measure (data warehouse); Key (lock); Object (grammar)","score_opus":0.008591729561347718,"score_gpt":0.23611269874243318,"score_spread":0.22752096918108547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416554829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05731304,0.00016464629,0.90147924,0.001336821,0.00017424839,0.00028268335,0.000029967683,0.0008779164,0.03834145],"genre_scores_gemma":[0.65578413,0.000030418636,0.34220666,0.00009098945,0.0000097107295,0.00004044663,0.00015292651,0.000042597836,0.0016421267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651736,0.0019420636,0.0004292615,0.0004400913,0.00030728194,0.00036397044],"domain_scores_gemma":[0.9969376,0.00065574696,0.00009195227,0.0011922425,0.0009529679,0.0001695182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035686714,0.00025122162,0.00026379636,0.00024044025,0.0002557093,0.00011986518,0.00070737145,0.00016070397,0.00020621643],"category_scores_gemma":[0.00038026704,0.00029488106,0.00011696903,0.0009531998,0.00012991019,0.00024961223,0.000059118134,0.0003095467,0.000017312492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015881761,0.0016495415,0.013207259,0.00034092547,0.00038077263,0.000023931512,0.013765232,0.53069997,0.050449893,0.21735246,0.002450901,0.1695203],"study_design_scores_gemma":[0.0007129688,7.074414e-7,0.0048461356,0.0002991607,0.000040111874,0.0000015557866,0.00013444627,0.8804004,0.10681393,0.00011398179,0.0063451757,0.00029141133],"about_ca_topic_score_codex":0.00008053845,"about_ca_topic_score_gemma":0.00016424299,"teacher_disagreement_score":0.5984711,"about_ca_system_score_codex":0.00012696195,"about_ca_system_score_gemma":0.00013658547,"threshold_uncertainty_score":0.99995035},"labels":[],"label_agreement":null},{"id":"W4416731099","doi":"10.1016/j.ejor.2025.11.021","title":"Large neighborhood and hybrid genetic search for inventory routing problems","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Shenzhen Research Institute of Big Data; National Natural Science Foundation of China; Scale AI","keywords":"Benchmark (surveying); Routing (electronic design automation); Vehicle routing problem; Heuristic; Genetic algorithm; Operator (biology); Local search (optimization); Preprocessor","score_opus":0.06201460042252724,"score_gpt":0.3530211286014591,"score_spread":0.2910065281789319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416731099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19302285,0.0015686909,0.7930748,0.00076020585,0.00024229973,0.00037245854,0.000012571321,0.000034571593,0.01091159],"genre_scores_gemma":[0.9646808,0.0001547861,0.03427858,0.00005901216,0.00025867703,0.0000044368917,0.0000044290928,0.000037573383,0.00052171614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978163,0.000819959,0.00046170875,0.00013116753,0.00045135888,0.0003194629],"domain_scores_gemma":[0.99852115,0.0003707032,0.000033759556,0.00011311602,0.00084723724,0.00011401356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007993861,0.00009089341,0.00014044356,0.0003695991,0.00027089182,0.00019922908,0.00024267362,0.000017785698,0.000035654866],"category_scores_gemma":[0.00069633935,0.00008651333,0.000047295063,0.0002835074,0.000053219745,0.00016023418,0.000099166995,0.00047228046,0.0000075024227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001027727,0.00013923466,0.015413515,0.0004966206,0.00028365388,0.00009574831,0.001930204,0.90113384,0.016542682,0.01968602,0.01064901,0.033526726],"study_design_scores_gemma":[0.0020115662,0.00023837789,0.012034115,0.00029383288,0.000014402068,0.000073832176,0.00027133813,0.97155726,0.0029246707,0.00040574736,0.010011667,0.00016321953],"about_ca_topic_score_codex":4.9287183e-7,"about_ca_topic_score_gemma":3.6067468e-7,"teacher_disagreement_score":0.77165794,"about_ca_system_score_codex":0.00008916228,"about_ca_system_score_gemma":0.000183695,"threshold_uncertainty_score":0.35279113},"labels":[],"label_agreement":null},{"id":"W4416773034","doi":"10.1016/j.cor.2025.107341","title":"A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"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":"King Fahd University of Petroleum and Minerals","keywords":"Vehicle routing problem; Benchmark (surveying); Flexibility (engineering); Heuristic; Adaptability; Genetic algorithm; Crossover; Service (business)","score_opus":0.047575154236137486,"score_gpt":0.35770509348541674,"score_spread":0.31012993924927923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416773034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051657185,0.00013989741,0.9913719,0.0011023992,0.000112107366,0.0014776002,0.00007686705,0.0002858791,0.00026760463],"genre_scores_gemma":[0.5480638,0.000015817839,0.450302,0.0000624729,0.00007231856,0.00027729568,0.00020366877,0.000051812614,0.00095079484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983773,0.00024111813,0.0002801263,0.0003723567,0.00027997926,0.00044908148],"domain_scores_gemma":[0.99667966,0.002005894,0.000012782109,0.000871555,0.00036867813,0.000061450955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014588647,0.00014630813,0.00017236124,0.00020114404,0.0009317403,0.00043348531,0.000919534,0.00006187183,0.0000126207915],"category_scores_gemma":[0.00041731296,0.000114170296,0.000030075755,0.0008745641,0.00012332154,0.0002319388,0.00035995626,0.00040202567,0.000032753444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001293772,0.000024002285,0.00016568396,0.000050397517,0.00008183741,0.000001250451,0.00026323725,0.9824957,0.0007918481,0.0002675198,0.002346622,0.013498933],"study_design_scores_gemma":[0.0006121805,0.00003933591,0.00039926523,0.00009544466,0.000019450757,0.000002809784,0.00008892268,0.9964752,0.00009056755,0.000022039205,0.0020305475,0.00012423737],"about_ca_topic_score_codex":0.00003636824,"about_ca_topic_score_gemma":0.0001671535,"teacher_disagreement_score":0.5428981,"about_ca_system_score_codex":0.00015390824,"about_ca_system_score_gemma":0.00019223985,"threshold_uncertainty_score":0.7166287},"labels":[],"label_agreement":null},{"id":"W4417062269","doi":"10.2316/j.2026.206-1295","title":"RESEARCH ON OPTIMISATION OF COUNTY-LEVEL URBAN EXPRESS DELIVERY USING A MULTI-STRATEGY IMPROVED GENETIC ALGORITHM","year":2025,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genetic algorithm; Path (computing); Distribution (mathematics); Distribution center; Stability (learning theory)","score_opus":0.07587368645534594,"score_gpt":0.3677128739842457,"score_spread":0.29183918752889976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417062269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16636582,0.00017659989,0.83277863,0.00005399161,0.0004597285,0.00007438024,0.000013305853,0.000017916007,0.000059654372],"genre_scores_gemma":[0.53687114,0.000105735286,0.4629121,0.000010284505,0.000065359396,8.5518155e-7,0.0000035469325,0.000009085839,0.000021868816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988428,0.000095696676,0.0004961625,0.00008487266,0.0003759592,0.00010453038],"domain_scores_gemma":[0.9984794,0.000176871,0.00018621689,0.000075412354,0.001046907,0.00003519645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006484841,0.00008747467,0.00014304498,0.0005238105,0.00004650712,0.000082000784,0.00016870741,0.00007834305,0.000004633265],"category_scores_gemma":[0.00009387653,0.00008880822,0.000041827847,0.00018094857,0.000038574122,0.00017718774,0.000030081786,0.0001943462,3.3097098e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132041205,0.000039804512,0.00020473551,0.000026515672,0.0000824868,0.000002726181,0.00010618864,0.94751805,0.016972246,0.00024910705,0.000037486996,0.03474745],"study_design_scores_gemma":[0.00062455196,0.000046729914,0.0062434003,0.0002354129,0.000019042336,0.000015060903,0.000118472264,0.9860005,0.0064640534,0.00014669026,0.00002150925,0.0000645734],"about_ca_topic_score_codex":0.000014445203,"about_ca_topic_score_gemma":7.1146053e-7,"teacher_disagreement_score":0.37050533,"about_ca_system_score_codex":0.00016482703,"about_ca_system_score_gemma":0.00008446621,"threshold_uncertainty_score":0.36214942},"labels":[],"label_agreement":null},{"id":"W4417359070","doi":"10.23977/cpcs.2025.090113","title":"Research on delivery optimization of food delivery orders based on crowdsourcing platform","year":2025,"lang":"","type":"article","venue":"Computing Performance and Communication systems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Crowdsourcing; Food delivery; Order (exchange); Key (lock); Service delivery framework; Quality (philosophy); Weighting; Constraint (computer-aided design)","score_opus":0.058035303530947616,"score_gpt":0.320393985297898,"score_spread":0.2623586817669504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417359070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71597046,0.0028218196,0.26815465,0.00012905207,0.00060618186,0.0009071545,0.000009577327,0.00021758644,0.011183514],"genre_scores_gemma":[0.9786379,0.0015579071,0.019443993,0.00008665879,0.00006005852,0.000026725786,0.000038927257,0.00006222433,0.00008562218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960521,0.0009839578,0.0012697853,0.00048097534,0.00065367686,0.00055954343],"domain_scores_gemma":[0.99448305,0.0024481162,0.00041434594,0.0016233254,0.0009282803,0.00010288296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00489705,0.0003911372,0.0005993621,0.0013809919,0.0012785594,0.0002929369,0.0008513806,0.00036445318,0.000009555371],"category_scores_gemma":[0.00017885125,0.00044880484,0.000093769246,0.0020380304,0.00024678002,0.00029045713,0.00037087116,0.0010954204,0.000009159308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012462992,0.00010142961,0.0020129413,0.0011909376,0.00008833616,2.0302846e-7,0.00073025463,0.97776335,0.000038792765,0.0016981013,0.00017265082,0.016078357],"study_design_scores_gemma":[0.001178776,0.00044652482,0.0012256576,0.0073122024,0.000039331553,0.000001765592,0.0015392128,0.986832,0.0007170341,0.0000063494335,0.0003736537,0.00032746416],"about_ca_topic_score_codex":0.0000845964,"about_ca_topic_score_gemma":0.0000024962264,"teacher_disagreement_score":0.26266742,"about_ca_system_score_codex":0.00038855945,"about_ca_system_score_gemma":0.00022477495,"threshold_uncertainty_score":0.9997964},"labels":[],"label_agreement":null},{"id":"W4417437321","doi":"10.1287/trsc.2024.0556","title":"Fair Stochastic Vehicle Routing with Partial Deliveries","year":2025,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Bounding overwatch; Vehicle routing problem; Routing (electronic design automation); Resource allocation; Resource (disambiguation); Interdependence; Service (business); Equity (law)","score_opus":0.010843213677750973,"score_gpt":0.2616994611993252,"score_spread":0.2508562475215742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417437321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38796526,0.0000120058185,0.6109177,0.000039059218,0.000098680626,0.000070222035,0.0000026622258,0.00024568394,0.0006487319],"genre_scores_gemma":[0.96313494,0.0000016929639,0.03673416,0.00004291766,0.000010355386,0.0000116166575,0.0000035981825,0.0000091363945,0.000051551702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912834,0.000011466195,0.00018959957,0.00019574167,0.0002500841,0.00022474141],"domain_scores_gemma":[0.99961483,0.000051258794,0.000026203119,0.00014028708,0.00011469678,0.000052714982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034737546,0.000091796,0.00009367114,0.0001281865,0.00019846493,0.000061213665,0.00017029718,0.00002560318,0.000020857728],"category_scores_gemma":[0.000035705576,0.00008744478,0.000016242753,0.0012045017,0.00020556811,0.0003842899,0.0000027347817,0.00008294333,0.0000063034095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007900067,0.0000048123397,0.0039231903,0.000014010439,0.000004693432,0.0000011848954,0.0008441481,0.9829549,0.005611024,0.0037936326,0.0000062908075,0.0028342016],"study_design_scores_gemma":[0.0003688364,0.000019940815,0.06965616,0.00006178523,0.0000229958,6.686394e-7,0.00036657372,0.9087615,0.020376952,0.00010732685,0.0000818759,0.00017539058],"about_ca_topic_score_codex":0.0000133069125,"about_ca_topic_score_gemma":0.000025940217,"teacher_disagreement_score":0.5751697,"about_ca_system_score_codex":0.000044297725,"about_ca_system_score_gemma":0.00009850488,"threshold_uncertainty_score":0.35658944},"labels":[],"label_agreement":null},{"id":"W4417445704","doi":"10.20944/preprints202512.1327.v1","title":"MCAH-ACO: A Multi-Criteria Adaptive Hybrid Ant Colony Optimization for Last-Mile Delivery Vehicle Routing","year":2025,"lang":"","type":"preprint","venue":"Preprints.org","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"National Natural Science Foundation of China","keywords":"Vehicle routing problem; Ant colony optimization algorithms; Travelling salesman problem; Routing (electronic design automation); Scheme (mathematics); Ant colony; Decomposition; Baseline (sea)","score_opus":0.11449119753223537,"score_gpt":0.35888011226966193,"score_spread":0.24438891473742658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417445704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18134238,0.0003089948,0.8055165,0.00015515742,0.0038097363,0.0047524394,0.000887268,0.0012586449,0.0019688802],"genre_scores_gemma":[0.554245,0.0005671602,0.44104978,0.00014596147,0.00045586578,0.0011491643,0.00034955447,0.00028336106,0.0017541477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98989004,0.0012861019,0.002932547,0.0032961424,0.00073320954,0.0018619553],"domain_scores_gemma":[0.99243367,0.0014479035,0.0012640739,0.0025939944,0.001712807,0.00054752536],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.004162494,0.0017640168,0.0020704581,0.0007650976,0.0009160817,0.00026604696,0.0018138237,0.001219042,0.0011965036],"category_scores_gemma":[0.003405265,0.0023858782,0.00095132465,0.000950317,0.00026209655,0.0006529208,0.00387536,0.002158179,0.0003019535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004951685,0.00043754381,0.01941741,0.001302389,0.0009050488,0.00002149415,0.0024836753,0.9619895,0.009235264,0.00013966802,0.00008415681,0.0034886792],"study_design_scores_gemma":[0.0033215657,0.000096288466,0.008008758,0.0018034965,0.00059566787,0.000015867614,0.00042012637,0.947023,0.035571303,0.00008535035,0.0011841914,0.0018744188],"about_ca_topic_score_codex":0.00025880817,"about_ca_topic_score_gemma":0.000015826676,"teacher_disagreement_score":0.3729026,"about_ca_system_score_codex":0.0018229848,"about_ca_system_score_gemma":0.00085535,"threshold_uncertainty_score":0.9997165},"labels":[],"label_agreement":null},{"id":"W5534414","doi":"10.1007/978-3-642-21527-8_46","title":"An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"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; HEC Montréal","funders":"","keywords":"Computer science; Heuristic; Snow removal; Set (abstract data type); Routing (electronic design automation); Arc routing; Snow; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Computer network","score_opus":0.022629902807734154,"score_gpt":0.25866538093853747,"score_spread":0.2360354781308033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5534414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007234102,0.00019265887,0.9966209,0.00002377414,0.00030838573,0.000868771,0.000027044327,0.0003868564,0.0014992619],"genre_scores_gemma":[0.29228133,0.000009871554,0.70721173,0.00007351201,0.00022652817,0.00002878263,0.000013609555,0.00011129729,0.000043350898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747145,0.00004653205,0.000366943,0.00087691244,0.00048213874,0.0007560508],"domain_scores_gemma":[0.9982253,0.00059023633,0.00009151862,0.0006366999,0.00028687675,0.00016937942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010173775,0.0004929938,0.00052149745,0.0004617314,0.00021443219,0.00021297041,0.00088643335,0.00027457386,0.000028232944],"category_scores_gemma":[0.00007321212,0.0004396877,0.000075993514,0.00035611328,0.00023735796,0.0003447638,0.00015418247,0.00066784123,0.000006272916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003264829,0.000022357093,0.0000592693,0.00011537517,0.000033990484,0.000017020893,0.0015762693,0.8874986,0.00005789794,0.0029876379,0.0000020895043,0.10759683],"study_design_scores_gemma":[0.0005840006,0.00044951466,0.00002773367,0.00064790115,0.000027685033,0.000019677474,9.496562e-7,0.98565465,0.00083804317,0.011138491,0.00004228426,0.0005690652],"about_ca_topic_score_codex":0.000008461965,"about_ca_topic_score_gemma":0.00003856129,"teacher_disagreement_score":0.292209,"about_ca_system_score_codex":0.00029795198,"about_ca_system_score_gemma":0.00029558485,"threshold_uncertainty_score":0.9998055},"labels":[],"label_agreement":null},{"id":"W56282943","doi":"10.1007/0-387-34221-4_2","title":"Path-based formulations of a bilevel toll setting problem","year":2006,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"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; Group for Research in Decision Analysis; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Toll; Path (computing); Bilevel optimization; Computer science; Mathematical optimization; Mathematics; Computer network; Medicine; Algorithm; Optimization problem; Immunology","score_opus":0.013787655185918414,"score_gpt":0.23300002949434978,"score_spread":0.21921237430843138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56282943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000064387477,0.00048105654,0.8350427,0.00007588932,0.000036218487,0.000978337,0.00016195267,0.0004003148,0.16281709],"genre_scores_gemma":[0.0070581525,0.00038474868,0.96731687,0.000055906577,0.000143177,0.0003503334,0.00072366267,0.00025509647,0.023712046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984851,0.000014496321,0.0007189581,0.00035119656,0.00021928677,0.00021099497],"domain_scores_gemma":[0.99882287,0.00012563192,0.000299726,0.00036466806,0.00029448615,0.00009259172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019574052,0.00034081284,0.00035130073,0.0003367412,0.00016379436,0.00005081427,0.00015464766,0.00032751204,0.00017290126],"category_scores_gemma":[0.000017731956,0.00039602278,0.000098270866,0.00016310842,0.000048274775,0.00012194449,0.000044621687,0.00023809816,0.0000129808095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012111803,0.000015216244,0.0000148394365,0.00030381474,0.000029990993,1.5983231e-7,0.000025988116,0.9376546,0.00012250851,0.058795568,0.00030547392,0.0027306015],"study_design_scores_gemma":[0.00029598235,0.000011606061,0.000027049826,0.00017100772,0.00009500371,0.0000017831029,0.0000026005403,0.97147375,0.00030684707,0.001208978,0.025998717,0.0004066626],"about_ca_topic_score_codex":0.0000025635193,"about_ca_topic_score_gemma":0.0000018206115,"teacher_disagreement_score":0.13910504,"about_ca_system_score_codex":0.00007739664,"about_ca_system_score_gemma":0.00006971821,"threshold_uncertainty_score":0.99984914},"labels":[],"label_agreement":null},{"id":"W585220962","doi":"","title":"Addressing the Challenges of Planning Snow Plowing and Salt Spreading Routes in a Hybrid Rural and Urban Network","year":2014,"lang":"en","type":"article","venue":"Transportation Research Board 93rd Annual MeetingTransportation Research Board","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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":"Snow removal; Computer science; Metaheuristic; Truck; Operations research; Hierarchy; Snow; Order (exchange); Transport engineering; Engineering; Business; Geography; Economics; Meteorology","score_opus":0.08921472819173604,"score_gpt":0.37194492460491324,"score_spread":0.2827301964131772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W585220962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857226,0.0032894157,0.007939801,0.00074929226,0.0001225863,0.0009365496,0.000046386704,0.00023978367,0.0009535877],"genre_scores_gemma":[0.9901007,0.0013725207,0.007939326,0.000022028544,0.00021741018,0.00015406219,0.000050056464,0.0001134209,0.000030509222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9935322,0.0016119207,0.0011094353,0.00062858063,0.0017707481,0.001347144],"domain_scores_gemma":[0.99401575,0.004320378,0.00013924038,0.00040066784,0.0008009477,0.00032304265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.011314303,0.00036413834,0.0005948128,0.0008813162,0.00063282874,0.00017976032,0.00042297377,0.0002124678,0.000016050844],"category_scores_gemma":[0.0008412607,0.00034149605,0.00008970503,0.0013039456,0.0007019851,0.0006695738,0.000024256482,0.0016135814,0.0000027236938],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005256935,0.00010850736,0.3938727,0.0023045938,0.00018805079,0.00007940347,0.063966624,0.47362083,0.0051189763,0.017252332,0.0007031887,0.042259086],"study_design_scores_gemma":[0.0020865109,0.0003954897,0.8270299,0.0039085736,0.000050742936,0.0000027136405,0.021430116,0.13613975,0.0036269608,0.0032608134,0.0013256089,0.0007428506],"about_ca_topic_score_codex":0.00091292773,"about_ca_topic_score_gemma":0.0013794267,"teacher_disagreement_score":0.43315715,"about_ca_system_score_codex":0.00009028516,"about_ca_system_score_gemma":0.00008880776,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W593153863","doi":"10.71781/10045","title":"Algorithmes pour le problème de repositionnement","year":2008,"lang":"fr","type":"dissertation","venue":"Open MIND","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":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Vertex (graph theory); Graph; Heuristic; Computer science; Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Routing (electronic design automation)","score_opus":0.032139584593978365,"score_gpt":0.3157601848380647,"score_spread":0.2836206002440863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W593153863","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121252656,0.0017845469,0.70226985,0.0017310642,0.0015006176,0.0022514618,0.00009196472,0.000038492693,0.16907933],"genre_scores_gemma":[0.0070389607,0.00021672744,0.93846893,0.000025164747,0.0002208797,0.000105725805,0.00073957234,0.00011186361,0.05307218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794406,0.00022944831,0.0006425716,0.000499282,0.0002355389,0.00044910592],"domain_scores_gemma":[0.9988451,0.00010415784,0.00025997133,0.0003758521,0.00025531015,0.0001596025],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061868096,0.00037373553,0.00041923954,0.00013029858,0.00037359534,0.00031680684,0.0005442642,0.00040014012,0.0015379613],"category_scores_gemma":[0.0001724161,0.0004785823,0.000119346485,0.00028137627,0.00003152004,0.0002826784,0.00008858516,0.00038720988,0.0005840586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032496075,0.0002847242,0.00033939214,0.0001697566,0.000305366,0.00015858341,0.014805234,0.65901405,0.0116341235,0.0004977466,0.0025584458,0.31020007],"study_design_scores_gemma":[0.0014145568,0.00008877845,0.0026349216,0.0008197174,0.00021292301,0.00024219282,0.004301552,0.8031572,0.15759297,0.00022799574,0.028184697,0.0011224975],"about_ca_topic_score_codex":0.0010220478,"about_ca_topic_score_gemma":0.00013028868,"teacher_disagreement_score":0.30907756,"about_ca_system_score_codex":0.00043052965,"about_ca_system_score_gemma":0.000905038,"threshold_uncertainty_score":0.9997666},"labels":[],"label_agreement":null},{"id":"W644258566","doi":"10.71781/11127","title":"Étude d'un problème de tournées de véhicules sur les arcs avec contraintes de capacité et coûts de service dépendants du temps","year":2008,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Interval (graph theory); Variable (mathematics); Routing (electronic design automation); Piecewise linear function; Arc routing; Heuristic; Mathematical optimization; Arc (geometry); Service (business); Computer science; Mathematics; Operations research; Economics; Combinatorics; Computer network","score_opus":0.009369826602914988,"score_gpt":0.18538856244749358,"score_spread":0.17601873584457858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W644258566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87556666,0.006914865,0.11224036,0.0009707037,0.0005009809,0.0005695424,0.00016225397,0.0004909316,0.0025837168],"genre_scores_gemma":[0.8361474,0.003414776,0.15745631,0.0003003221,0.00031951303,0.00006270771,0.00039349805,0.0001635149,0.0017419552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544936,0.0008771589,0.00080871873,0.00079098874,0.0007386052,0.0013351834],"domain_scores_gemma":[0.99655116,0.00074488507,0.00057452824,0.00048591328,0.0008766831,0.00076682656],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001148211,0.0009276513,0.00082319236,0.00045918647,0.00562951,0.00017109825,0.00082097144,0.0011417363,0.00006859893],"category_scores_gemma":[0.0007322029,0.0012019686,0.000436243,0.00060034904,0.0002959621,0.00059918436,0.0001627516,0.0012958751,0.000025887228],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041930767,0.00031297375,0.08372151,0.0009302269,0.0009550777,0.0039805956,0.13132596,0.6730791,0.08208631,0.019757835,0.00014032585,0.0032908223],"study_design_scores_gemma":[0.0028725243,0.00012206904,0.3753607,0.0020545996,0.00086772116,0.008235157,0.030033937,0.5095013,0.064981155,0.0005234331,0.0035440673,0.0019033469],"about_ca_topic_score_codex":0.101203755,"about_ca_topic_score_gemma":0.05642747,"teacher_disagreement_score":0.29163918,"about_ca_system_score_codex":0.011187718,"about_ca_system_score_gemma":0.0035323482,"threshold_uncertainty_score":0.99904305},"labels":[],"label_agreement":null},{"id":"W648203179","doi":"","title":"Scheduled service network design with synchronization and transshipment constraints for intermodal container transportation networks","year":2012,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"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":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Compute Canada; Université du Québec à Montréal","keywords":"Container (type theory); Transshipment (information security); Computer science; Service (business); Network planning and design; Routing (electronic design automation); Vehicle routing problem; Operations research; Solver; Integer programming; Flow network; Transport engineering; Computer network; Mathematical optimization; Engineering; Business","score_opus":0.021017549410984396,"score_gpt":0.241143561860551,"score_spread":0.2201260124495666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W648203179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091961406,0.0007119815,0.9061502,0.000042665055,0.00015588292,0.0005799527,0.00009907216,0.00023942474,0.00005940023],"genre_scores_gemma":[0.8058284,0.00020105076,0.1917622,0.00014450804,0.00029552422,0.000049227136,0.0016470687,0.00006876043,0.0000032712685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838567,0.0001746669,0.0003585153,0.00036603925,0.00013116725,0.0005839616],"domain_scores_gemma":[0.9988522,0.00043640542,0.0000928956,0.00036332893,0.00004748015,0.0002077232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009990325,0.00030863355,0.00030558844,0.000051519703,0.00024220237,0.000104547704,0.00030025336,0.00010596672,0.000007580159],"category_scores_gemma":[0.0000051155203,0.00028172706,0.0000192471,0.0002580202,0.00007805925,0.00057699234,0.000037763766,0.00019370251,5.0621605e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014536332,0.0000190093,0.014670715,0.00039926736,0.00013746382,0.0000010419504,0.0025447553,0.9613111,0.00009325078,0.00019008617,0.000030364215,0.020457575],"study_design_scores_gemma":[0.0009489392,0.00005184015,0.018975211,0.0003925329,0.00017355975,0.000015412228,0.00038592517,0.978476,0.000022857223,0.000042565265,0.00017757232,0.00033761587],"about_ca_topic_score_codex":0.000027127973,"about_ca_topic_score_gemma":0.00031046462,"teacher_disagreement_score":0.714388,"about_ca_system_score_codex":0.000026099173,"about_ca_system_score_gemma":0.00001652176,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W65917153","doi":"","title":"Vehicle routing problems with multiple trips: using specific local search operators","year":2014,"lang":"en","type":"article","venue":"Open Repository and Bibliography (University of Liège)","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":"HEC Montréal","funders":"","keywords":"TRIPS architecture; Vehicle routing problem; Computer science; Routing (electronic design automation); Computer network","score_opus":0.0230776868708437,"score_gpt":0.22301247665745588,"score_spread":0.1999347897866122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W65917153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71952945,0.00012479733,0.27756864,0.00001701168,0.000060301172,0.00022989475,0.0000039493116,0.00008557426,0.0023804116],"genre_scores_gemma":[0.9299579,0.00015266304,0.069786675,0.0000056852136,0.000026674124,3.077108e-7,0.0000027856363,0.000021220927,0.0000460814],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896216,0.00019276228,0.00015229254,0.0002739186,0.00019218674,0.00022669707],"domain_scores_gemma":[0.9993557,0.00009470815,0.000064605934,0.00023979106,0.00011591454,0.00012931607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006039992,0.00014542716,0.00024845763,0.0019825674,0.00043619302,0.00017004502,0.00032815558,0.000093067596,0.00001332662],"category_scores_gemma":[3.1436818e-7,0.00015584956,0.000061260966,0.0053537413,0.00020270061,0.00060145993,0.00015367859,0.00017645094,0.0000010118066],"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.00008345788,0.00005062809,0.7054215,0.00010801716,0.00011146573,0.00001534327,0.0008070388,0.26833013,0.023579037,0.0000939371,0.00019815924,0.0012012976],"study_design_scores_gemma":[0.0020882024,0.00023130112,0.10680485,0.00028294252,0.00006891397,0.000041219322,0.002745328,0.8778958,0.0088983085,0.000009815519,0.00046089588,0.00047247083],"about_ca_topic_score_codex":0.00069934776,"about_ca_topic_score_gemma":0.000008073813,"teacher_disagreement_score":0.6095656,"about_ca_system_score_codex":0.000015805084,"about_ca_system_score_gemma":0.000015949712,"threshold_uncertainty_score":0.6355361},"labels":[],"label_agreement":null},{"id":"W6891564556","doi":"10.4230/lipics.cp.2025.30","title":"Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Vertex (graph theory); Solver; Preprocessor; Integer programming; Linear programming; Constraint programming; Dependency graph; Simple (philosophy)","score_opus":0.012088851120582863,"score_gpt":0.29377524430412555,"score_spread":0.28168639318354266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891564556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006560007,0.00022842169,0.9848082,0.0002085972,0.0005454114,0.002447662,0.000087026776,0.00087049184,0.004244186],"genre_scores_gemma":[0.04360841,0.00011392688,0.9549117,0.00035601345,0.00008343018,0.00050855556,0.00010761614,0.00012115027,0.00018916444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755675,0.00009116819,0.0010512199,0.0002482076,0.0002406271,0.0008120306],"domain_scores_gemma":[0.99737054,0.0014117582,0.00025041707,0.00056679355,0.0002900657,0.000110447916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002340471,0.0004765354,0.00050745264,0.00031751266,0.00058253476,0.0003525221,0.0006061552,0.000236286,0.000011022671],"category_scores_gemma":[0.00015326383,0.00035521595,0.0002660684,0.00068199344,0.00008128748,0.0005080663,0.00007847238,0.000505538,0.0000064567203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040923184,0.00025729658,0.0037788434,0.00838538,0.0027792281,0.0000018546573,0.033582572,0.68575907,0.00077765324,0.01800609,0.0038165124,0.24244629],"study_design_scores_gemma":[0.0022434294,0.00010237013,0.0001093012,0.00031506742,0.00022303466,0.000015173188,0.0021016106,0.9435756,0.0030730597,0.00044209213,0.047329787,0.00046946638],"about_ca_topic_score_codex":0.000005491233,"about_ca_topic_score_gemma":0.0000051425673,"teacher_disagreement_score":0.25781655,"about_ca_system_score_codex":0.00016788524,"about_ca_system_score_gemma":0.000071350805,"threshold_uncertainty_score":0.99988997},"labels":[],"label_agreement":null},{"id":"W6894072492","doi":"10.5281/zenodo.6812942","title":"Introducing a bi-objective cluster-based location-routing problem in e-commerce logistics with possible failed home deliveries","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Wilfrid Laurier University","funders":"","keywords":"Humanitarian Logistics; Work (physics); Key (lock); Outsourcing","score_opus":0.021182481125717523,"score_gpt":0.23538224944034095,"score_spread":0.21419976831462342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894072492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047458444,0.000069315574,0.93442,0.0005833033,0.0001229556,0.0009468379,0.00011630795,0.0021460983,0.014136754],"genre_scores_gemma":[0.95727086,0.000007768963,0.0408414,0.00009072903,0.00005572278,6.657025e-7,0.0005277507,0.0011026682,0.00010244268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786204,0.00062243425,0.0003354476,0.00039639606,0.00037268215,0.00041099105],"domain_scores_gemma":[0.9989129,0.000092212504,0.000100408826,0.00038552532,0.00041804757,0.00009092078],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012388894,0.00018146276,0.00019335955,0.0004318217,0.0016238211,0.00039712834,0.00059727364,0.000043470125,0.0015374649],"category_scores_gemma":[0.00047295875,0.00020703908,0.000025292673,0.0018020571,0.00010107037,0.00022069285,0.00057709747,0.00051487505,0.00016583862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007903011,0.00006715999,0.00014786248,0.00009852556,0.000025195382,0.000008042785,0.0027169788,0.98389745,0.00051734975,0.00053143746,0.0019099085,0.010001076],"study_design_scores_gemma":[0.0017959791,0.00043762065,0.0019770663,0.00009859952,0.000024912104,0.00006928767,0.003162971,0.95613796,0.0005291259,0.00009830896,0.035139628,0.0005285682],"about_ca_topic_score_codex":0.000036072484,"about_ca_topic_score_gemma":0.0000019046531,"teacher_disagreement_score":0.9098124,"about_ca_system_score_codex":0.0006087381,"about_ca_system_score_gemma":0.000014486326,"threshold_uncertainty_score":0.9996759},"labels":[],"label_agreement":null},{"id":"W6901467311","doi":"10.60692/3kejg-bte52","title":"Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search","year":2020,"lang":"en","type":"article","venue":"Greater South Information System","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":"McMaster University; Université Laval","funders":"","keywords":"Replicate; Set (abstract data type); Range (aeronautics); Variety (cybernetics); Domain (mathematical analysis); Layer (electronics); Implementation; Metaheuristic","score_opus":0.2394440626324139,"score_gpt":0.29707504850752525,"score_spread":0.05763098587511134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901467311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008122437,0.000012634598,0.9860956,0.00008621585,0.000060833776,0.0006540465,0.004014672,0.00012420627,0.00082934776],"genre_scores_gemma":[0.9896356,7.127424e-8,0.010062633,0.00010728297,0.00001821911,0.0000858336,0.0000668203,0.000014523624,0.000009023723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985158,0.00016886974,0.00067498174,0.00015033726,0.0002828031,0.0002072366],"domain_scores_gemma":[0.99894047,0.000047084748,0.00016682898,0.0006167325,0.00017335833,0.00005551951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946408,0.00014940262,0.0005741416,0.00024213846,0.000048137772,0.000045214412,0.0004781788,0.00008087233,0.000033301476],"category_scores_gemma":[0.00007162884,0.00010488392,0.00026841217,0.0013516181,0.0000125215165,0.00052596297,0.00016715143,0.00011987402,0.000019238521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004348416,0.0000016644485,0.0055999462,0.00019733628,0.013452021,2.3289257e-7,0.061034214,0.9187836,0.0000015307417,0.0007780953,0.00006996439,0.000037916187],"study_design_scores_gemma":[0.00041990916,0.000014394969,0.0027204682,0.000007924317,0.006847165,4.1451042e-7,0.009361967,0.9802919,0.00017866815,3.8409777e-7,0.00005309829,0.0001037113],"about_ca_topic_score_codex":0.0000037929276,"about_ca_topic_score_gemma":0.0000014509208,"teacher_disagreement_score":0.98151314,"about_ca_system_score_codex":0.00005649317,"about_ca_system_score_gemma":0.00002704862,"threshold_uncertainty_score":0.42770422},"labels":[],"label_agreement":null},{"id":"W6910549475","doi":"10.4230/lipics.isaac.2022.8","title":"Bi-Criteria Approximation Algorithms for Bounded-Degree Subset TSP","year":2022,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Approximation algorithm; Vertex (graph theory); Degree (music); Steiner tree problem; Multiset; Vertex cover; Graph; Spanning tree","score_opus":0.04451651043492749,"score_gpt":0.29754264998369145,"score_spread":0.25302613954876396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910549475","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448785,0.00007671415,0.9419662,0.00018096506,0.002668246,0.0026117056,0.0039434703,0.001047038,0.0030178272],"genre_scores_gemma":[0.20192818,0.000035696925,0.78590804,0.0007578577,0.0004968718,0.0023746402,0.007611353,0.00033549996,0.00055183267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698424,0.000075270575,0.0012818979,0.00026892105,0.0005348826,0.00085480406],"domain_scores_gemma":[0.9984296,0.00021688569,0.00030409102,0.00063203817,0.00023724209,0.00018016268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014550877,0.0004545943,0.00051046436,0.00039196722,0.0007555173,0.00035001273,0.00067129487,0.00018491887,0.00018982044],"category_scores_gemma":[0.0001505974,0.00050923484,0.00028667916,0.0004981755,0.00006603038,0.00095140806,0.00025054172,0.00047333987,0.00003465239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088177086,0.0012378335,0.0034621102,0.009276251,0.0017077238,0.000013052359,0.051307395,0.5796323,0.0021384205,0.018499509,0.123226635,0.20861702],"study_design_scores_gemma":[0.0026363116,0.00018161998,0.000117005526,0.000033517088,0.00005465015,0.000045739795,0.0013536524,0.87959886,0.0010212964,0.0007741625,0.11360444,0.00057875784],"about_ca_topic_score_codex":0.0000062010195,"about_ca_topic_score_gemma":0.000003603141,"teacher_disagreement_score":0.29996654,"about_ca_system_score_codex":0.0004208795,"about_ca_system_score_gemma":0.00006060274,"threshold_uncertainty_score":0.99973595},"labels":[],"label_agreement":null},{"id":"W6921793134","doi":"10.1016/j.cor.2025.107198","title":"Integrated and sequential algorithms for the robust two-echelon location-routing problem under demand uncertainty","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"GLS Industries (Canada); Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Robustness (evolution); Benchmark (surveying); Robust optimization; Heuristic; Facility location problem; Vehicle routing problem","score_opus":0.0952182887740222,"score_gpt":0.39118072464910475,"score_spread":0.29596243587508253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921793134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043932516,0.00036837233,0.9919022,0.0015925285,0.00023999026,0.0009851665,0.00000792011,0.00017331622,0.0003372713],"genre_scores_gemma":[0.54750705,0.00007435397,0.45132136,0.000104906234,0.000114587056,0.0002701019,0.00006837628,0.000032155112,0.00050711096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985876,0.00030114467,0.00029006452,0.00027437753,0.0002031648,0.00034362893],"domain_scores_gemma":[0.9979488,0.0009813893,0.000010887118,0.00027805284,0.00072332646,0.00005752936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093742,0.00013583252,0.00013995577,0.0002373157,0.0009553418,0.0005192971,0.00027846653,0.00007988353,0.000009390955],"category_scores_gemma":[0.00021658685,0.000110827605,0.000031128588,0.0011132461,0.000149983,0.00015008298,0.0001295803,0.00039366243,0.0000034528643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049879227,0.000011817277,0.00003475002,0.000044483684,0.00006581304,2.7769943e-7,0.00031358394,0.96575797,0.0005401001,0.010163204,0.00080500223,0.022258025],"study_design_scores_gemma":[0.0005073296,0.000018995595,0.00012920181,0.00009015272,0.000015595351,0.0000027918525,0.00043110267,0.9971847,0.00059394486,0.00030014728,0.0006184726,0.000107546075],"about_ca_topic_score_codex":0.00019846132,"about_ca_topic_score_gemma":0.00020046528,"teacher_disagreement_score":0.54311377,"about_ca_system_score_codex":0.00022187142,"about_ca_system_score_gemma":0.00022382043,"threshold_uncertainty_score":0.7347813},"labels":[],"label_agreement":null},{"id":"W6931278592","doi":"10.5281/zenodo.4370754","title":"Kalmia angustifolia Linnaeus 1753","year":2007,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Typification; Taxonomy (biology); Nomenclature; Subspecies; Nova scotia","score_opus":0.029129550432872547,"score_gpt":0.2613930308347663,"score_spread":0.23226348040189373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931278592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03571342,0.00019488936,0.58373386,0.00019272252,0.00045077017,0.00041092018,0.00007750092,0.0059246086,0.3733013],"genre_scores_gemma":[0.9680436,0.00007534075,0.02650582,0.00013794193,0.00043702064,2.3664867e-8,0.00063204044,0.003108267,0.0010599146],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985518,0.00013488879,0.000291812,0.0002648264,0.00028897644,0.00046768753],"domain_scores_gemma":[0.99897504,0.00004053402,0.00004726544,0.00040141575,0.00032692656,0.0002088338],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013374176,0.0001514974,0.00013471497,0.0002671244,0.0009088174,0.00036025207,0.0006333476,0.00009699784,0.0057195276],"category_scores_gemma":[0.00056827284,0.00017699404,0.000046430505,0.0007453557,0.00007691737,0.00018842025,0.00033463497,0.00030992008,0.005000197],"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.00007250277,0.00013322914,0.000036020305,0.00021677703,0.00012818635,0.00007758436,0.0025917373,0.051073536,0.031033657,0.006831857,0.26286942,0.6449355],"study_design_scores_gemma":[0.00040948446,0.00006732169,0.0014123402,0.000023733659,0.000013143818,0.00009829685,0.00017220037,0.022370018,0.00397548,0.00009303596,0.97109234,0.00027262868],"about_ca_topic_score_codex":0.0000040722184,"about_ca_topic_score_gemma":2.0141516e-7,"teacher_disagreement_score":0.9323302,"about_ca_system_score_codex":0.00017442483,"about_ca_system_score_gemma":0.0000016175178,"threshold_uncertainty_score":0.9957745},"labels":[],"label_agreement":null},{"id":"W6939168688","doi":"10.60692/tw6s4-es884","title":"Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution","year":2019,"lang":"en","type":"article","venue":"Greater South Information System","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":"HEC Montréal","funders":"","keywords":"Iterated local search; Vehicle routing problem; Routing (electronic design automation); Distribution (mathematics); Duration (music); Iterated function","score_opus":0.020793077873679948,"score_gpt":0.24499254781456617,"score_spread":0.22419946994088621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939168688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.588711,0.0000011491157,0.41007233,0.000008474882,0.00006326679,0.00037974815,0.000033410775,0.00044966463,0.00028093532],"genre_scores_gemma":[0.9941542,1.8977737e-7,0.0055852355,0.00005514884,0.000030123643,0.0000572392,0.00009158831,0.00001937953,0.000006905711],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988631,0.00006974804,0.0004154658,0.00016820974,0.0002203582,0.00026311373],"domain_scores_gemma":[0.99931663,0.000011789538,0.00008589245,0.00026726682,0.0001562612,0.00016215541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004080449,0.00017671438,0.00018981498,0.00010776722,0.000103927494,0.00015462413,0.000098876524,0.00009706193,0.0000066869475],"category_scores_gemma":[0.000013983362,0.00016080345,0.000015616019,0.0003936251,0.00001486032,0.0008592009,0.000035250207,0.000109173736,0.00022322196],"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.00012586937,0.000003999679,0.4904044,0.0007274641,0.000057773625,0.0000014797049,0.03430883,0.46871057,0.0004359006,0.0002698565,0.0000129254495,0.004940952],"study_design_scores_gemma":[0.0006659481,0.000049047165,0.07562481,0.000086006236,0.000024692883,0.000022259215,0.0032070298,0.9170176,0.0029893718,1.595986e-7,0.00008576225,0.00022732136],"about_ca_topic_score_codex":0.000005730252,"about_ca_topic_score_gemma":1.9602406e-7,"teacher_disagreement_score":0.44830704,"about_ca_system_score_codex":0.00014180751,"about_ca_system_score_gemma":0.000012886005,"threshold_uncertainty_score":0.65573746},"labels":[],"label_agreement":null},{"id":"W6939445248","doi":"10.60692/jvdfq-gva63","title":"An exact method for a last-mile delivery routing problem with multiple deliverymen","year":2024,"lang":"en","type":"article","venue":"Greater South Information System","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é Laval","funders":"","keywords":"Minification; Vehicle routing problem; Routing (electronic design automation); Traffic congestion; City logistics","score_opus":0.021972377054120144,"score_gpt":0.2391839431468658,"score_spread":0.21721156609274567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939445248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0753498,0.000008556554,0.9203012,0.0000070219016,0.00024499462,0.00074011023,0.00013486348,0.002095984,0.0011174661],"genre_scores_gemma":[0.6461846,1.2414714e-7,0.3534357,0.000020685184,0.00007480837,0.0001717439,0.000042408356,0.000042024873,0.00002789224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855316,0.000096376854,0.00057315954,0.00020279436,0.0002274946,0.0003469897],"domain_scores_gemma":[0.9992357,0.00007140569,0.00009279032,0.0002957221,0.00019263566,0.00011176006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009446211,0.0002519596,0.00025402452,0.00030143527,0.00014064016,0.00047706685,0.00016547686,0.00012642016,0.000009170231],"category_scores_gemma":[0.000017520108,0.00021194623,0.00007249548,0.00036354482,0.000011050812,0.001451791,0.000023221477,0.00013184312,0.00009741338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005677347,0.0000018897483,0.009016641,0.002113564,0.00016768642,0.0000037818852,0.057423595,0.92030936,0.00007750678,0.00020976686,0.00010199224,0.010517436],"study_design_scores_gemma":[0.0006161518,0.00006877698,0.00065822224,0.00036265052,0.00005120366,0.000044739278,0.004869433,0.9913286,0.0011761885,7.321578e-7,0.00053870655,0.00028458057],"about_ca_topic_score_codex":0.000008910202,"about_ca_topic_score_gemma":8.660483e-7,"teacher_disagreement_score":0.5708348,"about_ca_system_score_codex":0.00020511737,"about_ca_system_score_gemma":0.00004125987,"threshold_uncertainty_score":0.86429167},"labels":[],"label_agreement":null},{"id":"W6939501351","doi":"10.6084/m9.figshare.29663062.v1","title":"Overnight technician routing and scheduling problem with time windows and balanced workloads: a bi-objective zebra optimization algorithm","year":2025,"lang":"en","type":"dataset","venue":"Figshare","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Job shop scheduling; Solver; Scheduling (production processes); Schedule; Key (lock); Nonlinear programming; Routing (electronic design automation); Linear programming; Quadratic programming","score_opus":0.007408907945701544,"score_gpt":0.22835646116872463,"score_spread":0.2209475532230231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939501351","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.623533e-7,0.0006669552,0.019158829,0.000011352621,0.000033232107,0.00081743265,0.9784009,0.0004962835,0.00041424407],"genre_scores_gemma":[0.0000052683217,0.00006845946,0.22423334,0.000043403605,0.00010154685,0.00018989344,0.77523947,0.000054073495,0.00006456252],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982847,0.00009148699,0.0003740136,0.00059618714,0.00025307626,0.00040055023],"domain_scores_gemma":[0.9988697,0.00024729525,0.00021361592,0.00039742587,0.00015938519,0.00011258284],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015196315,0.0005152651,0.00054809405,0.00029979937,0.00018595031,0.00026909713,0.00022786346,0.0005152274,0.0025276407],"category_scores_gemma":[0.0004388913,0.0005172489,0.000041325715,0.0006620315,0.000017079632,0.00024380822,0.00022723452,0.00071361137,0.000018187788],"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.0000073389533,0.000009527567,0.0000029221098,0.000649299,0.00010297546,0.000013180263,0.00003888862,0.47361556,0.0000035950227,3.048809e-7,0.52174234,0.0038140337],"study_design_scores_gemma":[0.0006594441,0.000050897866,0.000018018403,0.012107868,0.00009929201,0.000029538001,0.000024327315,0.9047669,0.00006843144,0.000003374116,0.08143376,0.00073815155],"about_ca_topic_score_codex":0.0000068616478,"about_ca_topic_score_gemma":0.000004175948,"teacher_disagreement_score":0.4403086,"about_ca_system_score_codex":0.00014796382,"about_ca_system_score_gemma":0.00010421073,"threshold_uncertainty_score":0.9997279},"labels":[],"label_agreement":null},{"id":"W6949083032","doi":"10.5281/zenodo.10260963","title":"Evaluation Files: Multilayer Graph Partitioning for Enabling a Decentralized Path Planning for Large and Heterogeneous AGV Fleets","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Network topology; Metric (unit); Intersection (aeronautics); Bounding overwatch; Graph; Path (computing); Topology (electrical circuits)","score_opus":0.07208743064156531,"score_gpt":0.31309291176040677,"score_spread":0.24100548111884146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949083032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1480154,0.0005418125,0.84345835,0.00013825776,0.00028476058,0.002355222,0.00068709,0.003618799,0.000900329],"genre_scores_gemma":[0.9697409,0.00022986936,0.023901407,0.00007020938,0.00016956555,0.0000044753583,0.003968465,0.001838304,0.00007675047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827003,0.00025895712,0.0002969822,0.00034734388,0.000316044,0.0005106135],"domain_scores_gemma":[0.99884295,0.0001466669,0.000073032315,0.00021534416,0.0005881712,0.00013383952],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002574537,0.00015771156,0.00016458116,0.0002841074,0.0015435077,0.000478268,0.00023886711,0.00008225589,0.0005404876],"category_scores_gemma":[0.0017721032,0.00018579653,0.00006301531,0.0005103018,0.000028833841,0.00020609572,0.00017563807,0.00011778579,0.00012070642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001247667,0.000071881936,0.000036808986,0.00052780146,0.0002222989,0.0000071244604,0.007074661,0.8297033,0.01536499,0.00064374536,0.031000696,0.115221925],"study_design_scores_gemma":[0.00152402,0.00007970211,0.0001598261,0.0000756469,0.000048080685,0.000016941583,0.00030818363,0.7932421,0.0016618969,0.00026952013,0.2024116,0.00020247074],"about_ca_topic_score_codex":0.0000010530599,"about_ca_topic_score_gemma":1.6023752e-7,"teacher_disagreement_score":0.82172555,"about_ca_system_score_codex":0.00011512482,"about_ca_system_score_gemma":0.000004029642,"threshold_uncertainty_score":0.99975634},"labels":[],"label_agreement":null},{"id":"W6955578435","doi":"10.58079/uajf","title":"Open Track \"Turning Things into Assets\", 2016 4S/EASST Conference in Barcelona, 31 Aug. - 3 Sept. 2016","year":2015,"lang":"en","type":"article","venue":"OpenEdition (OpenEdition)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Track (disk drive); Window (computing); Product (mathematics); Presentation (obstetrics); Key (lock)","score_opus":0.03471752116318828,"score_gpt":0.28904427669509464,"score_spread":0.25432675553190637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6955578435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06652859,0.0011987117,0.47058794,0.037743982,0.00995252,0.0058738897,0.00053287315,0.0029424897,0.404639],"genre_scores_gemma":[0.79297304,0.00026545065,0.18683615,0.008550288,0.00092565175,0.00089138746,0.0020548052,0.00028810205,0.0072151027],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961194,0.00047611468,0.0010773868,0.0008124147,0.0007621189,0.0007525787],"domain_scores_gemma":[0.9975094,0.00034218398,0.00029372275,0.00072686444,0.000559386,0.0005684485],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002812611,0.0005684121,0.00070453266,0.00042786088,0.0003129299,0.001028162,0.0014563714,0.00039785617,0.0022227222],"category_scores_gemma":[0.0006891261,0.0006098632,0.000117307645,0.00084025104,0.00014414177,0.0211745,0.00053093536,0.00075449585,0.0019568321],"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.00044305727,0.00081549684,0.0023014448,0.0005333538,0.00036258227,0.0003131532,0.005139806,0.35451332,0.01217146,0.07393589,0.5015577,0.04791271],"study_design_scores_gemma":[0.017147403,0.00076094,0.035767373,0.0039258096,0.0002547031,0.00024748535,0.0027890147,0.47321215,0.024692187,0.022962097,0.41225374,0.0059871054],"about_ca_topic_score_codex":0.00038380653,"about_ca_topic_score_gemma":0.00045718165,"teacher_disagreement_score":0.7264445,"about_ca_system_score_codex":0.0006916796,"about_ca_system_score_gemma":0.0005713478,"threshold_uncertainty_score":0.9996353},"labels":[],"label_agreement":null},{"id":"W6958142136","doi":"10.6084/m9.figshare.21500611","title":"Additional file 1 of The association between chiropractic integration in an Ontario community health centre and continued prescription opioid use for chronic non-cancer spinal pain: a sequential explanatory mixed methods study","year":2022,"lang":"en","type":"article","venue":"Figshare","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":"St. Joseph’s Healthcare Hamilton; University of Waterloo; McMaster University","funders":"","keywords":"Chiropractic; Medical prescription; Computer file; Data file; Qualitative research; Health centre; Spinal manipulation","score_opus":0.0737429905163264,"score_gpt":0.34300813695705096,"score_spread":0.2692651464407245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958142136","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034507625,0.000024188306,0.00066010904,0.00001828543,0.00009467978,0.0010506661,0.96358633,0.00004707106,0.000011032849],"genre_scores_gemma":[0.24274252,8.399339e-7,0.01872242,0.00005686702,0.00011336536,0.003046967,0.73515403,0.000041607207,0.00012137828],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99703604,0.0021751805,0.00029859043,0.00013328256,0.0001952979,0.00016159004],"domain_scores_gemma":[0.99791616,0.0014759696,0.00029251297,0.00017504308,0.000101852194,0.00003847938],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097006984,0.0001110224,0.00019592488,0.000073797855,0.0002765793,0.00004584756,0.0001403828,0.000054689277,0.2430346],"category_scores_gemma":[0.0020459185,0.00011554974,0.000043508604,0.00017778557,0.000003917355,0.0002857706,0.00008768492,0.0005335575,0.0000010958538],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043772874,0.00021480575,0.0073945383,0.00029988628,0.00011099318,3.5308545e-7,0.0074222423,0.02488849,0.000117059935,9.574695e-7,0.9073809,0.05212605],"study_design_scores_gemma":[0.0007823839,0.0003419967,0.83927715,0.0007870152,0.000026985703,4.955129e-7,0.0015617767,0.10276593,0.00009201968,0.00001035233,0.054179315,0.00017456726],"about_ca_topic_score_codex":0.0016105764,"about_ca_topic_score_gemma":0.034878682,"teacher_disagreement_score":0.8532015,"about_ca_system_score_codex":0.0017817817,"about_ca_system_score_gemma":0.00028300242,"threshold_uncertainty_score":0.9827323},"labels":[],"label_agreement":null},{"id":"W6966428720","doi":"10.4230/artifacts.23555","title":"Travelling Salesperson Problem with Self Deleting Graphs","year":2024,"lang":"en","type":"other","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"University of Toronto","funders":"","keywords":"Code (set theory); Source code; Field (mathematics); Set (abstract data type)","score_opus":0.008824150382975711,"score_gpt":0.23078614731428884,"score_spread":0.22196199693131313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966428720","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076951704,0.0013282197,0.3767796,0.00005907001,0.0017215518,0.0033462467,0.0011255952,0.0076169074,0.6072533],"genre_scores_gemma":[0.0024866476,0.00063531793,0.930023,0.0002160116,0.00071590027,0.00036876078,0.001133427,0.003815688,0.060605235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99700147,0.00003971775,0.0010975532,0.0003829301,0.0005251012,0.0009532266],"domain_scores_gemma":[0.9985891,0.00008837867,0.0003678502,0.00062147423,0.00011271333,0.00022048931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062272954,0.00090329116,0.00081678777,0.0008325358,0.00011966759,0.00042771158,0.0005391362,0.00071730145,0.00018669134],"category_scores_gemma":[0.000023107585,0.00081593136,0.0002862542,0.0006317279,0.00007720953,0.0002935125,0.00009286936,0.0010150636,0.00041402836],"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.00016522812,0.0004122175,0.0011283439,0.07043119,0.0071829674,0.00009127732,0.058256052,0.10709024,0.00008092732,0.0065538497,0.7158216,0.032786053],"study_design_scores_gemma":[0.0016777588,0.00013551721,0.000004624706,0.0034191806,0.0003575187,0.00009732968,0.0010084485,0.30828038,0.00016876766,0.00012468651,0.6832409,0.0014849067],"about_ca_topic_score_codex":0.000012616981,"about_ca_topic_score_gemma":0.000023944398,"teacher_disagreement_score":0.55324346,"about_ca_system_score_codex":0.00019765369,"about_ca_system_score_gemma":0.000057953817,"threshold_uncertainty_score":0.99942917},"labels":[],"label_agreement":null},{"id":"W6976333268","doi":"10.60692/abx1r-ymz29","title":"An exact method for a last-mile delivery routing problem with multiple deliverymen","year":2024,"lang":"en","type":"article","venue":"Greater South Information System","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é Laval","funders":"","keywords":"Minification; Vehicle routing problem; Routing (electronic design automation); Traffic congestion; City logistics","score_opus":0.021972377054120144,"score_gpt":0.2391839431468658,"score_spread":0.21721156609274567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976333268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0753498,0.000008556554,0.9203012,0.0000070219016,0.00024499462,0.00074011023,0.00013486348,0.002095984,0.0011174661],"genre_scores_gemma":[0.6461846,1.2414714e-7,0.3534357,0.000020685184,0.00007480837,0.0001717439,0.000042408356,0.000042024873,0.00002789224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855316,0.000096376854,0.00057315954,0.00020279436,0.0002274946,0.0003469897],"domain_scores_gemma":[0.9992357,0.00007140569,0.00009279032,0.0002957221,0.00019263566,0.00011176006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009446211,0.0002519596,0.00025402452,0.00030143527,0.00014064016,0.00047706685,0.00016547686,0.00012642016,0.000009170231],"category_scores_gemma":[0.000017520108,0.00021194623,0.00007249548,0.00036354482,0.000011050812,0.001451791,0.000023221477,0.00013184312,0.00009741338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005677347,0.0000018897483,0.009016641,0.002113564,0.00016768642,0.0000037818852,0.057423595,0.92030936,0.00007750678,0.00020976686,0.00010199224,0.010517436],"study_design_scores_gemma":[0.0006161518,0.00006877698,0.00065822224,0.00036265052,0.00005120366,0.000044739278,0.004869433,0.9913286,0.0011761885,7.321578e-7,0.00053870655,0.00028458057],"about_ca_topic_score_codex":0.000008910202,"about_ca_topic_score_gemma":8.660483e-7,"teacher_disagreement_score":0.5708348,"about_ca_system_score_codex":0.00020511737,"about_ca_system_score_gemma":0.00004125987,"threshold_uncertainty_score":0.86429167},"labels":[],"label_agreement":null},{"id":"W6976601838","doi":"10.60692/3f9kk-5h791","title":"Development and characterization of chitosan and beeswax coated biodegradable corn husk and sugarcane bagasse-based cellulose paper.","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Chitosan; Ultimate tensile strength; Cellulose; Husk; Emulsion; Pulp (tooth); Coating; Fiber; Beeswax","score_opus":0.018298871842502437,"score_gpt":0.18727771719885097,"score_spread":0.16897884535634855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976601838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96312475,0.000008315265,0.035972424,0.000014126483,0.0001093743,0.0002732154,0.00008848225,0.000195243,0.00021405892],"genre_scores_gemma":[0.99211866,7.8779294e-7,0.007619932,0.000034297427,0.000008079414,0.0000463953,0.00014351873,0.000016198135,0.00001216314],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898267,0.00007343291,0.00049855746,0.000108983426,0.00018918305,0.00014720262],"domain_scores_gemma":[0.99958986,0.000010904318,0.00017134835,0.00012387389,0.000033137483,0.00007084658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029581782,0.00014591447,0.00020543693,0.000215679,0.00016307,0.00007560774,0.00005416399,0.000052712352,0.000013153346],"category_scores_gemma":[0.0000071638538,0.00014862033,0.000012245493,0.00022487064,0.000023753773,0.00029996134,0.00005650465,0.00008118129,0.0000015977114],"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.00034630764,0.000024685347,0.55855346,0.011019302,0.00034572015,0.000011083459,0.2804114,0.04785179,0.08251771,0.00047499858,0.00003059896,0.018412938],"study_design_scores_gemma":[0.002218163,0.000071618844,0.14737736,0.00015297088,0.000044779998,0.000052620424,0.00549215,0.697353,0.14615804,1.8656658e-7,0.00059602584,0.00048310315],"about_ca_topic_score_codex":0.000003530986,"about_ca_topic_score_gemma":9.8213256e-8,"teacher_disagreement_score":0.6495012,"about_ca_system_score_codex":0.00003915122,"about_ca_system_score_gemma":0.000026946982,"threshold_uncertainty_score":0.6060561},"labels":[],"label_agreement":null},{"id":"W6977306455","doi":"10.6084/m9.figshare.29663062","title":"Overnight technician routing and scheduling problem with time windows and balanced workloads: a bi-objective zebra optimization algorithm","year":2025,"lang":"en","type":"dataset","venue":"Figshare","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Job shop scheduling; Solver; Scheduling (production processes); Schedule; Key (lock); Nonlinear programming; Routing (electronic design automation); Linear programming; Quadratic programming","score_opus":0.007408907945701544,"score_gpt":0.22835646116872463,"score_spread":0.2209475532230231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977306455","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.623533e-7,0.0006669552,0.019158829,0.000011352621,0.000033232107,0.00081743265,0.9784009,0.0004962835,0.00041424407],"genre_scores_gemma":[0.0000052683217,0.00006845946,0.22423334,0.000043403605,0.00010154685,0.00018989344,0.77523947,0.000054073495,0.00006456252],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982847,0.00009148699,0.0003740136,0.00059618714,0.00025307626,0.00040055023],"domain_scores_gemma":[0.9988697,0.00024729525,0.00021361592,0.00039742587,0.00015938519,0.00011258284],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015196315,0.0005152651,0.00054809405,0.00029979937,0.00018595031,0.00026909713,0.00022786346,0.0005152274,0.0025276407],"category_scores_gemma":[0.0004388913,0.0005172489,0.000041325715,0.0006620315,0.000017079632,0.00024380822,0.00022723452,0.00071361137,0.000018187788],"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.0000073389533,0.000009527567,0.0000029221098,0.000649299,0.00010297546,0.000013180263,0.00003888862,0.47361556,0.0000035950227,3.048809e-7,0.52174234,0.0038140337],"study_design_scores_gemma":[0.0006594441,0.000050897866,0.000018018403,0.012107868,0.00009929201,0.000029538001,0.000024327315,0.9047669,0.00006843144,0.000003374116,0.08143376,0.00073815155],"about_ca_topic_score_codex":0.0000068616478,"about_ca_topic_score_gemma":0.000004175948,"teacher_disagreement_score":0.4403086,"about_ca_system_score_codex":0.00014796382,"about_ca_system_score_gemma":0.00010421073,"threshold_uncertainty_score":0.9997279},"labels":[],"label_agreement":null},{"id":"W6977340785","doi":"10.60692/pm804-h3043","title":"Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search","year":2020,"lang":"en","type":"article","venue":"Greater South Information System","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":"McMaster University; Université Laval","funders":"","keywords":"Replicate; Set (abstract data type); Range (aeronautics); Variety (cybernetics); Domain (mathematical analysis); Layer (electronics); Implementation; Metaheuristic","score_opus":0.2394440626324139,"score_gpt":0.29707504850752525,"score_spread":0.05763098587511134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977340785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008122437,0.000012634598,0.9860956,0.00008621585,0.000060833776,0.0006540465,0.004014672,0.00012420627,0.00082934776],"genre_scores_gemma":[0.9896356,7.127424e-8,0.010062633,0.00010728297,0.00001821911,0.0000858336,0.0000668203,0.000014523624,0.000009023723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985158,0.00016886974,0.00067498174,0.00015033726,0.0002828031,0.0002072366],"domain_scores_gemma":[0.99894047,0.000047084748,0.00016682898,0.0006167325,0.00017335833,0.00005551951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946408,0.00014940262,0.0005741416,0.00024213846,0.000048137772,0.000045214412,0.0004781788,0.00008087233,0.000033301476],"category_scores_gemma":[0.00007162884,0.00010488392,0.00026841217,0.0013516181,0.0000125215165,0.00052596297,0.00016715143,0.00011987402,0.000019238521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004348416,0.0000016644485,0.0055999462,0.00019733628,0.013452021,2.3289257e-7,0.061034214,0.9187836,0.0000015307417,0.0007780953,0.00006996439,0.000037916187],"study_design_scores_gemma":[0.00041990916,0.000014394969,0.0027204682,0.000007924317,0.006847165,4.1451042e-7,0.009361967,0.9802919,0.00017866815,3.8409777e-7,0.00005309829,0.0001037113],"about_ca_topic_score_codex":0.0000037929276,"about_ca_topic_score_gemma":0.0000014509208,"teacher_disagreement_score":0.98151314,"about_ca_system_score_codex":0.00005649317,"about_ca_system_score_gemma":0.00002704862,"threshold_uncertainty_score":0.42770422},"labels":[],"label_agreement":null},{"id":"W6979233929","doi":"","title":"PROPEL: Supervised and Reinforcement Learning for Large-Scale Supply Chain Planning","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Science Foundation","keywords":"Reinforcement learning; Supervised learning; Supply chain; Graph; Optimization problem; Feature (linguistics); Reduction (mathematics); Component (thermodynamics)","score_opus":0.023708634442979888,"score_gpt":0.2764857893147522,"score_spread":0.2527771548717723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979233929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5126848,0.0002180212,0.4848304,0.00012990313,0.00014246337,0.0002946858,0.0000014668641,0.00031742334,0.0013808109],"genre_scores_gemma":[0.97252905,0.000025309932,0.025029715,0.0001350669,0.00005803881,0.000071030576,0.00002711067,0.000039114846,0.0020855707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991356,0.00004064889,0.00023615728,0.0001963764,0.000076060045,0.00031512065],"domain_scores_gemma":[0.99960494,0.00011668296,0.000026754024,0.000151695,0.000045860892,0.000054058957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048117683,0.00014211827,0.00017623011,0.000104998944,0.00017083666,0.0000376099,0.000094259565,0.0000799887,0.000026363052],"category_scores_gemma":[0.0001497144,0.00014866944,0.000037881124,0.00019343024,0.00001421222,0.00010316027,0.000059041286,0.00017622081,0.000006308295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013888531,0.0000066156085,0.38005772,0.00016737428,0.00003321009,0.0000011040934,0.0009976242,0.61433506,0.0024968334,0.00018814749,0.00026197356,0.0014404582],"study_design_scores_gemma":[0.0009666956,0.00003797296,0.03710634,0.00012357881,0.000023352535,0.0000010145105,0.0004017138,0.9472365,0.005778798,0.000020379348,0.008120526,0.00018316993],"about_ca_topic_score_codex":0.0000036469512,"about_ca_topic_score_gemma":0.0000014879728,"teacher_disagreement_score":0.4598442,"about_ca_system_score_codex":0.000042903554,"about_ca_system_score_gemma":0.000017557131,"threshold_uncertainty_score":0.60625637},"labels":[],"label_agreement":null},{"id":"W6979937257","doi":"","title":"Annual Report of the Officers &amp; Committees of the Town of Shutesbury, Massachusetts for the Year Ended June 30, 2016","year":2016,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Annual report; Year-ending; Work (physics); Quarter (Canadian coin)","score_opus":0.007298657495674682,"score_gpt":0.22306870206492768,"score_spread":0.215770044569253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979937257","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014289782,0.032316122,0.024177585,0.01262905,0.013384912,0.0167155,0.02509705,0.004006491,0.8573835],"genre_scores_gemma":[0.015902258,0.0031450554,0.0098237535,0.00010508862,0.0004339676,0.00012817353,0.00020504471,0.0016528756,0.9686038],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943972,0.0007952037,0.0021894204,0.00069725775,0.0009308592,0.0009900326],"domain_scores_gemma":[0.9930719,0.0010577588,0.002752581,0.0028864038,0.00010246197,0.00012887952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006175088,0.0008464449,0.001374301,0.00035450666,0.00015491796,0.000052616073,0.0027231332,0.00046772452,0.0007562663],"category_scores_gemma":[0.00009678913,0.0005043058,0.00087119127,0.00074187294,0.00088400644,0.0007851427,0.00058008666,0.0008430071,0.0000048174097],"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.0002257132,0.00011338518,0.0028573764,0.0011754958,0.0016971779,0.0000074893464,0.0005979063,0.0075141764,0.003925872,0.00056166743,0.9803692,0.0009545535],"study_design_scores_gemma":[0.0014068153,0.00015324158,0.00096385775,0.0010725812,0.00037676858,0.000046807883,0.0000927427,0.0005908617,0.09769804,0.0012654298,0.8956068,0.0007260628],"about_ca_topic_score_codex":0.0000381372,"about_ca_topic_score_gemma":0.0000066630073,"teacher_disagreement_score":0.11122028,"about_ca_system_score_codex":0.000073558826,"about_ca_system_score_gemma":0.001214263,"threshold_uncertainty_score":0.99974084},"labels":[],"label_agreement":null},{"id":"W6981739641","doi":"","title":"Extraction au point trouble séquentielle de radionucléides d'origine naturelle à des fins de surveillance environnementale","year":2022,"lang":"fr","type":"other","venue":"Corpus Université Laval (Université Laval)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Context (archaeology); Homogeneous","score_opus":0.0072156075037013555,"score_gpt":0.20011579624917009,"score_spread":0.19290018874546874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981739641","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32343626,0.0142809795,0.16170488,0.002185966,0.0036714026,0.001625336,0.0006855305,0.0018623743,0.49054727],"genre_scores_gemma":[0.0700398,0.019826028,0.105548024,0.00012816324,0.0006948386,0.000010368876,0.00062179565,0.0009204145,0.80221057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959125,0.0007824668,0.0004162402,0.00097382243,0.0005554703,0.0013594837],"domain_scores_gemma":[0.9976416,0.00041218946,0.00045536342,0.0008231521,0.00010458297,0.00056306156],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008175997,0.0009003296,0.0008309048,0.000879365,0.0016943718,0.000094008676,0.0010625528,0.00078248157,0.014416359],"category_scores_gemma":[0.00008713221,0.0012886681,0.0005340912,0.0011226395,0.0003276449,0.00050238566,0.00057414337,0.0014467293,0.00011085432],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066026516,0.00079415826,0.09250219,0.0011357198,0.001927941,0.0024206627,0.037100215,0.6563013,0.09961898,0.017116008,0.02111801,0.0693045],"study_design_scores_gemma":[0.0035042467,0.00034410084,0.012899823,0.00029426548,0.0006929932,0.00052736356,0.008470486,0.050196864,0.015622749,0.0002718733,0.90522486,0.0019503604],"about_ca_topic_score_codex":0.02180645,"about_ca_topic_score_gemma":0.01187649,"teacher_disagreement_score":0.8841069,"about_ca_system_score_codex":0.0155033255,"about_ca_system_score_gemma":0.000685737,"threshold_uncertainty_score":0.9996053},"labels":[],"label_agreement":null},{"id":"W6983412287","doi":"","title":"Methods for solving combinatorial pricing problems","year":2023,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Institut de Valorisation des Données","keywords":"Utility maximization; Pillar; Agrégation","score_opus":0.01201693862041881,"score_gpt":0.2378600388478454,"score_spread":0.2258431002274266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6983412287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09147571,0.022967564,0.8353217,0.00039787294,0.029764384,0.0029538167,0.0001261102,0.0020135513,0.014979281],"genre_scores_gemma":[0.04783479,0.0010770038,0.8703691,0.000044825876,0.0014742438,0.00036495127,0.0014034321,0.000497239,0.07693445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964164,0.00036491326,0.00087282964,0.00088223245,0.00054448395,0.0009191224],"domain_scores_gemma":[0.99667084,0.0012755964,0.00054443075,0.00049574266,0.00061582,0.0003975863],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014666779,0.00074038294,0.0008087765,0.0005955704,0.007990226,0.0001575055,0.0005893599,0.0010035438,0.000028470125],"category_scores_gemma":[0.0007179692,0.0009955964,0.00056429516,0.00089742907,0.00015270323,0.00044103808,0.00019850186,0.00077001995,0.000059940434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030334943,0.00013106965,0.0020513344,0.002041604,0.00091908715,0.00019760054,0.05282354,0.79723495,0.07137061,0.04345206,0.00046741244,0.029007345],"study_design_scores_gemma":[0.0031933214,0.00020131719,0.0053141904,0.0015497609,0.0011756298,0.00023454461,0.023218209,0.87100005,0.04930908,0.003465218,0.039542332,0.001796321],"about_ca_topic_score_codex":0.014807635,"about_ca_topic_score_gemma":0.0011669755,"teacher_disagreement_score":0.0737651,"about_ca_system_score_codex":0.009854994,"about_ca_system_score_gemma":0.0014073824,"threshold_uncertainty_score":0.99924946},"labels":[],"label_agreement":null},{"id":"W6992928624","doi":"","title":"Multi-attribute deterministic and stochastic two echelon location routing problems","year":2023,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"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":"ESPACE; Distribution (mathematics); Context (archaeology); Identity (music)","score_opus":0.0136025115567061,"score_gpt":0.2182798944064998,"score_spread":0.2046773828497937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992928624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5406865,0.011657473,0.44024408,0.0001845222,0.0037753196,0.0013373857,0.00012676942,0.0011488688,0.0008390813],"genre_scores_gemma":[0.94087285,0.00033259278,0.03650039,0.000020603089,0.00024537294,0.000071511815,0.00080196734,0.0001691583,0.020985581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680793,0.0002720993,0.0007571932,0.0008642288,0.00057587685,0.00072267465],"domain_scores_gemma":[0.997722,0.00046359855,0.0004920019,0.00041846637,0.0004917609,0.0004121631],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00061221694,0.00069642585,0.00060024596,0.0004998762,0.0055361968,0.00015849055,0.00035331922,0.00062642794,0.000013741029],"category_scores_gemma":[0.00050469255,0.00093812315,0.00018317012,0.0008571943,0.0002195573,0.00039992272,0.00020041496,0.00075315183,0.00011733904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006284386,0.000074542106,0.0050168782,0.00076324854,0.00028147033,0.00038597643,0.034004625,0.94032943,0.012667001,0.0013138686,0.000022094267,0.0050780177],"study_design_scores_gemma":[0.0016806243,0.00007060539,0.04774261,0.001418164,0.0006263838,0.00052144297,0.015232313,0.92989665,0.0016213725,0.000064735534,0.00018896893,0.00093613827],"about_ca_topic_score_codex":0.017476862,"about_ca_topic_score_gemma":0.0058933124,"teacher_disagreement_score":0.40374368,"about_ca_system_score_codex":0.006108343,"about_ca_system_score_gemma":0.0010090106,"threshold_uncertainty_score":0.9993069},"labels":[],"label_agreement":null},{"id":"W6995510161","doi":"","title":"Optimization Model for Production-Distribution Planning in the Cosmetic Industry: The Case of Cosmetics Company Canada","year":2024,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Colorado School of Mines","keywords":"Supply chain; Production (economics); Product (mathematics); Sorting; Matching (statistics)","score_opus":0.03893438373508366,"score_gpt":0.30421185444763715,"score_spread":0.2652774707125535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995510161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93009645,0.00046903233,0.05866121,0.0005077352,0.002001291,0.0022800688,0.00018034226,0.00014429378,0.00565957],"genre_scores_gemma":[0.99580276,0.000039728322,0.00066168484,0.0000030821304,0.00015990535,0.000022055721,0.00038834594,0.000055709603,0.0028667105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978659,0.00052436895,0.0003681134,0.00036185898,0.00044595066,0.00043377295],"domain_scores_gemma":[0.99838126,0.0006005941,0.000121143,0.00046705245,0.000356273,0.00007370287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001288098,0.00023072388,0.00028454495,0.00044718923,0.00047216867,0.00010050645,0.0005160011,0.00035073902,0.000002901238],"category_scores_gemma":[0.00028598798,0.00020395743,0.00008578752,0.001791124,0.00013856748,0.000112476686,0.000041647705,0.0017444971,3.1901072e-7],"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.00006081923,0.000016946304,0.00020090066,0.0003717285,0.000073969546,0.00033490072,0.0019248701,0.99299115,0.00006221878,0.0011604012,0.0027194142,0.00008270568],"study_design_scores_gemma":[0.0001887313,0.00003822454,0.00028132924,0.00019406837,0.00010920876,0.00009277933,0.018372016,0.97879654,0.0010672498,0.00016608828,0.00049901806,0.00019475559],"about_ca_topic_score_codex":0.07376344,"about_ca_topic_score_gemma":0.28343284,"teacher_disagreement_score":0.2096694,"about_ca_system_score_codex":0.0012189485,"about_ca_system_score_gemma":0.0014092532,"threshold_uncertainty_score":0.93240446},"labels":[],"label_agreement":null},{"id":"W6995524898","doi":"","title":"Optimising feed-in tariff design through efficient risk allocation","year":2017,"lang":"en","type":"article","venue":"Research Portal (Queen's University Belfast)","topic":"Vehicle Routing Optimization Methods","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":"Queen's University","funders":"","keywords":"Tariff; Government (linguistics); Production (economics); Risk management; Resource allocation; Investment (military)","score_opus":0.0430581319641293,"score_gpt":0.3129282388942151,"score_spread":0.26987010693008584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995524898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20928298,0.000028320388,0.75819415,0.00073662645,0.00023424324,0.0007913718,0.000022486602,0.00042942757,0.030280413],"genre_scores_gemma":[0.8852707,0.0002556862,0.113268055,0.000004502257,0.000057014633,0.0000020476252,0.000012947384,0.000045119916,0.0010838971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997264,0.0005977353,0.00023294492,0.0004224752,0.0007354714,0.00074734975],"domain_scores_gemma":[0.998268,0.00031714645,0.00011216127,0.0008054067,0.0003024771,0.00019482385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026532598,0.00020220938,0.00024419202,0.0004556495,0.0011345716,0.00021958297,0.00080514245,0.00020414848,0.00011644671],"category_scores_gemma":[0.00071886333,0.00024826793,0.00007839598,0.0005538213,0.0002405061,0.00057759736,0.0002996798,0.00087786687,0.00006105664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042091702,0.00006785817,0.003779901,0.00003725924,0.000041997766,0.00019953874,0.000721384,0.9907056,0.00029371266,0.0016028226,0.0007153147,0.0017924876],"study_design_scores_gemma":[0.0017516982,0.00011533738,0.045258325,0.0002017664,0.00003768718,0.000006967721,0.0017487032,0.9419102,0.0052967365,0.00027463227,0.0027736854,0.000624269],"about_ca_topic_score_codex":0.0018185605,"about_ca_topic_score_gemma":0.000028759423,"teacher_disagreement_score":0.6759877,"about_ca_system_score_codex":0.0004393138,"about_ca_system_score_gemma":0.00015580033,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W6996630002","doi":"","title":"Solving Traveling Salesman Problem With a non-complete Graph","year":2010,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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 Waterloo","keywords":"Travelling salesman problem; Graph; Set (abstract data type); Complete graph; Obstacle; 2-opt; Christofides algorithm; Shortest path problem","score_opus":0.008591879861394194,"score_gpt":0.194236627860805,"score_spread":0.1856447479994108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996630002","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850427,0.000036745336,0.011330555,0.000054906362,0.00027138446,0.00036130645,0.000024392386,0.00035214005,0.0025258826],"genre_scores_gemma":[0.20307384,0.00013589024,0.69429356,0.000008136421,0.00010062123,0.0000021206893,0.0008474694,0.00025761512,0.10128073],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988604,0.0000360471,0.00016324781,0.00033181158,0.0002618572,0.00034659178],"domain_scores_gemma":[0.9991711,0.000038701815,0.00017537626,0.00033079766,0.00017478089,0.0001092947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020635083,0.00032681844,0.0004676329,0.00032417735,0.00020141594,0.00003393913,0.0003735603,0.0004024067,0.00009774569],"category_scores_gemma":[0.000006110942,0.00038469132,0.00013074635,0.00032793276,0.00006178521,0.00019849844,0.000025190857,0.00065154576,0.00001956197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032487238,0.00011024793,0.0014850113,0.0048510013,0.0010141463,0.00015060471,0.453103,0.2997685,0.22320811,0.00025267978,0.00079230213,0.014939501],"study_design_scores_gemma":[0.008244163,0.0007453162,0.02858487,0.006223345,0.0023436898,0.000076205324,0.31768134,0.58945286,0.037475966,0.0006720443,0.0020003184,0.006499842],"about_ca_topic_score_codex":0.0029168911,"about_ca_topic_score_gemma":0.025476776,"teacher_disagreement_score":0.78196883,"about_ca_system_score_codex":0.00005048742,"about_ca_system_score_gemma":0.00005188533,"threshold_uncertainty_score":0.9998605},"labels":[],"label_agreement":null},{"id":"W6999968585","doi":"","title":"Efficient Routing for Disaster Scenarios in Uncertain Networks: A Computational Study of Adaptive Algorithms for the Stochastic Canadian Traveler Problem with Multiple Agents and Destinations","year":2023,"lang":"en","type":"article","venue":"Journal of the Arkansas Academy of Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"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":"Node (physics); Context (archaeology); Ranging; Path (computing); Routing (electronic design automation); Range (aeronautics); Delaunay triangulation","score_opus":0.05104875995564393,"score_gpt":0.3079323181188424,"score_spread":0.25688355816319847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999968585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48663685,0.000013752473,0.5123253,0.00030383296,0.000040488725,0.0006661407,0.0000072666503,0.0000042892443,0.0000020896257],"genre_scores_gemma":[0.924804,8.359849e-7,0.07512203,0.000021146168,0.000018400384,0.000019487108,1.4853083e-7,0.0000096717,0.0000042945717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891955,0.000046270114,0.00037872867,0.00010447104,0.0003242106,0.0002267504],"domain_scores_gemma":[0.99863386,0.00084016623,0.00023278713,0.000048758524,0.00017691059,0.00006753993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002322643,0.000080824444,0.00015046432,0.00023414666,0.00024931564,0.000022144324,0.0003408987,0.00002729636,3.9955432e-7],"category_scores_gemma":[0.0003196633,0.000049234277,0.000030673396,0.0010253288,0.00023145045,0.00008322026,0.000031596184,0.00016954701,2.7943369e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018928331,0.000021989272,0.0022561054,0.000010261692,0.000017136104,1.4530751e-7,0.0055455696,0.9907864,0.000038248476,0.0000421918,0.000008625925,0.0012544179],"study_design_scores_gemma":[0.0008068256,0.000099806,0.0699312,0.0001429837,0.000027379514,0.0000071294403,0.0038908317,0.92494494,0.000012357665,0.000083929124,0.0000011649493,0.000051437193],"about_ca_topic_score_codex":0.00017830214,"about_ca_topic_score_gemma":0.00037751687,"teacher_disagreement_score":0.43816715,"about_ca_system_score_codex":0.00010564331,"about_ca_system_score_gemma":0.00013995504,"threshold_uncertainty_score":0.20077156},"labels":[],"label_agreement":null},{"id":"W7000750157","doi":"","title":"Heuristic solution methods for multi-attribute vehicle routing problems","year":2012,"lang":"en","type":"other","venue":"Open MIND","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Domain (mathematical analysis); Network routing; Statistical analysis; Orthogonality","score_opus":0.11660681988582546,"score_gpt":0.3955630886467599,"score_spread":0.27895626876093443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000750157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005922014,0.0010791009,0.93035907,0.000018122326,0.0008600937,0.001573435,0.0001257438,0.00008888693,0.065889634],"genre_scores_gemma":[0.00014233775,0.00002846575,0.8206126,0.000007154335,0.00030465476,0.0001360438,0.00015424904,0.00063629146,0.1779782],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830985,0.00022928572,0.00041132938,0.00038561638,0.000103143924,0.0005607501],"domain_scores_gemma":[0.9989943,0.0001890374,0.0002091966,0.00042318666,0.000052380765,0.00013192004],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018861463,0.00035495716,0.0005055896,0.00015215967,0.000097943885,0.00016738361,0.0005052028,0.00043941688,0.0022364047],"category_scores_gemma":[0.00028315713,0.00038622823,0.000096680524,0.00021263104,0.000030303867,0.00013087508,0.00017942145,0.00026813245,0.0002843653],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080532855,0.00011682513,0.0002777878,0.000505207,0.00038546041,0.0000014944975,0.0006854443,0.040118217,0.003553887,0.000043271535,0.048714053,0.9055903],"study_design_scores_gemma":[0.0006172566,0.000013712446,0.000024066801,0.00023136674,0.00010976651,0.0000030061708,0.000014692492,0.44815817,0.0012089757,0.000004870175,0.5491818,0.00043229814],"about_ca_topic_score_codex":0.00004304434,"about_ca_topic_score_gemma":0.00002462606,"teacher_disagreement_score":0.905158,"about_ca_system_score_codex":0.00012631743,"about_ca_system_score_gemma":0.000038867707,"threshold_uncertainty_score":0.999859},"labels":[],"label_agreement":null},{"id":"W7006072923","doi":"","title":"Solving Canadian Traveller Problem","year":2017,"lang":"cs","type":"dissertation","venue":"Brno University of Technology Digital Library (Brno University of Technology)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Term (time); Identity (music)","score_opus":0.005919188159447874,"score_gpt":0.17758284003066044,"score_spread":0.17166365187121257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006072923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5473704,0.0024596879,0.008708375,0.008500073,0.0011217011,0.0030396755,0.006793863,0.007295049,0.41471118],"genre_scores_gemma":[0.78448105,0.0022982277,0.14807822,0.000015867416,0.000041144925,4.205328e-7,0.0019889898,0.00028971146,0.06280635],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99644446,0.0000547373,0.00064091827,0.0012467629,0.00040269428,0.0012104424],"domain_scores_gemma":[0.99579686,0.00008711353,0.00137322,0.0019398212,0.00041012728,0.00039284455],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00016883932,0.0009514986,0.0016625361,0.00685192,0.001185417,0.00010391847,0.005163979,0.0049062157,0.0008161042],"category_scores_gemma":[0.00018494422,0.0015000955,0.0005885324,0.0023169017,0.0025073965,0.0024326814,0.000960788,0.001964372,0.000169042],"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.0014773824,0.0016023774,0.1717106,0.006064879,0.007981978,0.0049116137,0.005047897,0.012202151,0.0073760166,0.07768575,0.03203129,0.6719081],"study_design_scores_gemma":[0.01037532,0.0018778096,0.016649881,0.008854878,0.0027580808,0.00032998226,0.09168856,0.0146644795,0.02685469,0.014023925,0.8036627,0.008259661],"about_ca_topic_score_codex":0.00445492,"about_ca_topic_score_gemma":0.004756558,"teacher_disagreement_score":0.7716314,"about_ca_system_score_codex":0.00042315465,"about_ca_system_score_gemma":0.0014103309,"threshold_uncertainty_score":0.99874485},"labels":[],"label_agreement":null},{"id":"W7008668676","doi":"","title":"Cold Storage Panels Delivery Route Optimizations","year":2022,"lang":"en","type":"article","venue":"DigitalCommons - Kennesaw State University (Kennesaw State University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Truck; Integer programming; Routing (electronic design automation); Cold storage; Maximization; Automotive industry; Linear programming; Vehicle routing problem","score_opus":0.012975822780067528,"score_gpt":0.1830355766095125,"score_spread":0.17005975382944497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7008668676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6149424,0.00011959642,0.28385904,0.0002876703,0.00113947,0.0013034114,0.0077834986,0.003866275,0.08669868],"genre_scores_gemma":[0.96354717,0.0005980101,0.011326833,0.00011766133,0.000040351817,0.000002818337,0.0008879844,0.00021352198,0.023265656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964164,0.00052059325,0.00045524383,0.00085827947,0.0006081709,0.0011413079],"domain_scores_gemma":[0.99754804,0.0003918542,0.00025032702,0.00091727695,0.00031456802,0.00057795434],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00036592694,0.00068339275,0.0006613707,0.001684383,0.0017055654,0.00019752508,0.0014329228,0.00013575474,0.00039609484],"category_scores_gemma":[0.00003278699,0.0010194827,0.00037721868,0.0036060475,0.00028453668,0.00189397,0.0011978069,0.0008462462,0.000075976255],"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.00014867606,0.00022255261,0.0016108978,0.00004927528,0.00033619147,0.0014198503,0.0010317022,0.9843576,0.0003553596,0.005959405,0.0028433008,0.0016651697],"study_design_scores_gemma":[0.0036884479,0.00025097743,0.0011740383,0.000044187804,0.0002637444,0.00008157214,0.00836629,0.23682868,0.0004092918,0.00014376277,0.7466097,0.0021393008],"about_ca_topic_score_codex":0.00029278005,"about_ca_topic_score_gemma":0.00016333995,"teacher_disagreement_score":0.7475289,"about_ca_system_score_codex":0.001984389,"about_ca_system_score_gemma":0.00024356118,"threshold_uncertainty_score":0.9995941},"labels":[],"label_agreement":null},{"id":"W7014241079","doi":"","title":"Obtaining optimal and approximate solutions to the problem of scheduling inbound and outbound trucks in cross docking operations","year":2009,"lang":"en","type":"article","venue":"Borås Academic Digital Archive (University of Borås)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Wilfrid Laurier University","keywords":"Truck; Heuristic; Scheduling (production processes); Job shop scheduling; Mathematical model; Integer programming; Vehicle routing problem","score_opus":0.01645139821972165,"score_gpt":0.24448502694841617,"score_spread":0.22803362872869454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014241079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6495936,0.00011064309,0.34852216,0.00030592893,0.000010973714,0.00020803667,0.00006572497,0.000047727357,0.0011352294],"genre_scores_gemma":[0.8767039,0.00007447059,0.123139374,0.000020610723,0.000014023556,6.5231126e-7,0.000012359422,0.000011080658,0.000023498182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990918,0.000042189266,0.00024396606,0.00021713671,0.00013429546,0.00027058384],"domain_scores_gemma":[0.9995302,0.00014282113,0.0000613805,0.00012601739,0.000043579417,0.00009598634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040058795,0.00013528591,0.00022275558,0.00021533042,0.00024222014,0.00008164446,0.00022204375,0.00008396188,0.0000019457584],"category_scores_gemma":[0.00007622127,0.00014942513,0.000036570287,0.00031703853,0.00021879355,0.0006697779,0.00017868444,0.000365156,7.6736586e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022414539,0.000014248807,0.003763935,0.00003815088,0.000022086244,0.0000020272635,0.008316471,0.9626527,0.0016990509,0.0061178873,0.000010718732,0.017340345],"study_design_scores_gemma":[0.00063116953,0.00007057208,0.04227609,0.0002156977,0.000021557504,0.000015929258,0.0038054315,0.94964516,0.000073647905,0.0026642838,0.00034002692,0.00024041443],"about_ca_topic_score_codex":0.00003278851,"about_ca_topic_score_gemma":0.000031206368,"teacher_disagreement_score":0.22711036,"about_ca_system_score_codex":0.000036124304,"about_ca_system_score_gemma":0.00003742774,"threshold_uncertainty_score":0.609338},"labels":[],"label_agreement":null},{"id":"W7017117829","doi":"","title":"An Adaptive Large Neighborhood Search heuristic for last-mile deliveries under stochastic customer availability and multiple visits","year":2023,"lang":"en","type":"article","venue":"RePEc: Research Papers in Economics","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":"HEC Montréal","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Service provider; Heuristic; Customer service; Service (business); Attendance; Plan (archaeology)","score_opus":0.036223518905132875,"score_gpt":0.321279288444918,"score_spread":0.2850557695397851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017117829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95928365,0.00005474323,0.03680799,0.00004932405,0.00018695349,0.0011113103,0.00024393064,0.00041697276,0.0018451342],"genre_scores_gemma":[0.9931616,0.00025944103,0.006088594,0.000016566424,0.000075818985,0.00010822756,0.000046497098,0.00008810056,0.0001551434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789774,0.00025499714,0.00034192303,0.00050721696,0.00017229802,0.0008258174],"domain_scores_gemma":[0.997209,0.001972979,0.000026588596,0.00042232344,0.0001509134,0.00021821121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022892964,0.000190855,0.00028751304,0.00036227633,0.0002373731,0.00009158893,0.00022699864,0.00015159816,0.00004457533],"category_scores_gemma":[0.00077581964,0.00022134553,0.000048587448,0.00036619636,0.00014200929,0.00022893604,0.00015046987,0.0004265375,0.000027909056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095476295,0.000051977473,0.0057181814,0.00008884869,0.000033852764,0.0000029507803,0.00072542304,0.9701929,0.00042159704,0.00037408932,0.000022856559,0.022271816],"study_design_scores_gemma":[0.00082451076,0.00012921116,0.017380398,0.000021862306,0.0000050056574,0.0000028726106,0.0017237696,0.97910005,0.00017232912,0.00024824124,0.00016721232,0.00022451107],"about_ca_topic_score_codex":0.000010066885,"about_ca_topic_score_gemma":0.00013055814,"teacher_disagreement_score":0.03387797,"about_ca_system_score_codex":0.00033412277,"about_ca_system_score_gemma":0.000098932294,"threshold_uncertainty_score":0.9026209},"labels":[],"label_agreement":null},{"id":"W7021234365","doi":"","title":"To name another life, already lived: blackness and queerness, in love and study","year":2019,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","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":"McGill University","funders":"","keywords":"Narrative; Meaning (existential); Identity (music); Face (sociological concept); Perspective (graphical)","score_opus":0.01674008959135649,"score_gpt":0.2597700952550838,"score_spread":0.24303000566372734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021234365","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837101,0.0005122365,0.0000103530665,0.000011706833,0.000851666,0.0016230361,0.00017761742,0.00030128937,0.01280198],"genre_scores_gemma":[0.9918366,0.000216534,0.003361019,0.0001419198,0.000036634727,0.00008489687,0.00010654703,0.00040987495,0.0038059836],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99657285,0.00042265025,0.0008353104,0.0010408144,0.0005037306,0.00062463945],"domain_scores_gemma":[0.9983132,0.00031966515,0.0001972114,0.0006504889,0.00020392425,0.00031552132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012179627,0.0008022072,0.000980905,0.0006258406,0.00014852434,0.00016057648,0.0003808319,0.0006888144,0.0001330584],"category_scores_gemma":[0.00070475327,0.0009238527,0.00007950112,0.0006242649,0.000028960318,0.0004834867,0.00013853941,0.0011670905,0.00027948924],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002024986,0.0029238053,0.06550131,0.010589412,0.0033316405,0.0006415614,0.008634047,0.25183988,0.055357117,0.0111352075,0.00007953931,0.58794147],"study_design_scores_gemma":[0.03300413,0.0037334815,0.675069,0.010351912,0.002886138,0.00019084603,0.065500535,0.08078076,0.04746462,0.0068553225,0.047078498,0.0270848],"about_ca_topic_score_codex":0.00030345801,"about_ca_topic_score_gemma":0.0009449752,"teacher_disagreement_score":0.60956764,"about_ca_system_score_codex":0.0003401136,"about_ca_system_score_gemma":0.000032102755,"threshold_uncertainty_score":0.9993212},"labels":[],"label_agreement":null},{"id":"W7042525512","doi":"","title":"A proposal for a value sensitive design approach to modelling the refugee chain","year":2017,"lang":"en","type":"other","venue":"TU/e Research Portal","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Refugee; Flexibility (engineering); Process (computing); Value (mathematics); Developing country; Robustness (evolution)","score_opus":0.131159287010716,"score_gpt":0.3864106391421689,"score_spread":0.2552513521314529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042525512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000048925576,0.00015223183,0.7300766,0.00008442766,0.00012730912,0.0027971375,0.00006339619,0.0003522769,0.26634172],"genre_scores_gemma":[0.0010887149,0.00006831613,0.7729131,0.0000145158065,0.0010176157,0.0007630567,0.00006160219,0.0009779207,0.22309518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969754,0.00058780087,0.00024111014,0.0005197567,0.00079101115,0.00088487985],"domain_scores_gemma":[0.9981688,0.00039815783,0.00008511798,0.0009280859,0.00020721248,0.00021259485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005776311,0.00032910926,0.0004085198,0.00043616156,0.00033193198,0.00018420839,0.00065811805,0.00036299232,0.000035144018],"category_scores_gemma":[0.00057218253,0.0002614445,0.00011899678,0.00025514106,0.00015585701,0.000051694577,0.00014266619,0.00084975397,0.000048808943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026115722,0.000022715602,3.623764e-7,0.00020573208,0.00013837234,0.000016332939,0.00042411138,0.78557974,0.00007176174,0.0036897822,0.207991,0.0018339923],"study_design_scores_gemma":[0.00022208795,0.00005727041,4.1928294e-7,0.00022860468,0.000020594363,0.00001621374,0.000095965064,0.9446255,0.00028067423,0.00028552697,0.053865105,0.00030207043],"about_ca_topic_score_codex":0.00012387554,"about_ca_topic_score_gemma":0.000011600172,"teacher_disagreement_score":0.15904576,"about_ca_system_score_codex":0.00009805948,"about_ca_system_score_gemma":0.0003651334,"threshold_uncertainty_score":0.9999838},"labels":[],"label_agreement":null},{"id":"W7042648376","doi":"","title":"Planification coopérative en temps réel d'itinéraires d'une flotte de véhicules électriques partageant des bornes de recharge","year":2022,"lang":"fr","type":"other","venue":"Archipelago (University of Quebec in Montreal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Context (archaeology); Coronavirus disease 2019 (COVID-19)","score_opus":0.011345941692192479,"score_gpt":0.22003840442925965,"score_spread":0.20869246273706718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042648376","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58468527,0.0018895413,0.33781126,0.0013682497,0.00024669248,0.0012807389,0.000539003,0.00060547114,0.07157379],"genre_scores_gemma":[0.33178928,0.0072760987,0.5011231,0.00007751467,0.000285414,0.000023029932,0.00082203315,0.000522379,0.15808119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99600667,0.0020004136,0.00041877903,0.00056494307,0.0002942718,0.00071492285],"domain_scores_gemma":[0.9977758,0.001075733,0.0003974487,0.00048072406,0.00007773012,0.00019259802],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013231402,0.0004778433,0.0007325051,0.0006512329,0.00038876676,0.00003533179,0.00068281626,0.00044260168,0.0021410263],"category_scores_gemma":[0.0003185439,0.0006692598,0.00020445595,0.0007413213,0.00036624965,0.00023903318,0.00020108966,0.0008770657,0.000032291675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030824082,0.0004303264,0.01641158,0.00117323,0.0005879517,0.0004059369,0.30656767,0.36062825,0.003102531,0.031980984,0.002545661,0.27585763],"study_design_scores_gemma":[0.0028261372,0.00033182,0.55600786,0.0015384045,0.0004974572,0.00007693289,0.0831382,0.30648255,0.0014344646,0.025836086,0.019863565,0.0019665398],"about_ca_topic_score_codex":0.5563364,"about_ca_topic_score_gemma":0.91610634,"teacher_disagreement_score":0.53959626,"about_ca_system_score_codex":0.0012401652,"about_ca_system_score_gemma":0.0002668578,"threshold_uncertainty_score":0.99957585},"labels":[],"label_agreement":null},{"id":"W7070821011","doi":"","title":"Postman Problems on Mixed Graphs","year":2006,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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 Waterloo; Consejo Nacional de Ciencia y Tecnología","keywords":"Mixed graph; Conjecture; Undirected graph; Graph; Traverse; Enhanced Data Rates for GSM Evolution; Linear programming; Eulerian path","score_opus":0.008879276959484027,"score_gpt":0.19707778546265073,"score_spread":0.1881985085031667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070821011","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99183774,0.00007859143,0.00027527736,0.00007430914,0.0005760335,0.00027595475,0.000037108915,0.00042600188,0.006418989],"genre_scores_gemma":[0.15047601,0.00020885257,0.046318028,0.000014333213,0.000079712954,0.0000015380658,0.0029717854,0.0002415021,0.7996882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902105,0.000059391215,0.00014069925,0.00026869905,0.0002511756,0.00025900733],"domain_scores_gemma":[0.9993606,0.000034112585,0.00012567047,0.00030272335,0.00010888289,0.00006800349],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013567692,0.00026952953,0.0003536837,0.0004222054,0.00011154616,0.000018516697,0.00029508348,0.0003571973,0.00009459603],"category_scores_gemma":[0.000007763168,0.00034869544,0.00016052106,0.00029244635,0.000033669734,0.00010774251,0.000017606999,0.00030251764,0.000057285524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019791136,0.00023124994,0.0009850075,0.0028987592,0.0005688752,0.000078715006,0.090591826,0.83659285,0.022814995,0.0015675557,0.027324304,0.01614794],"study_design_scores_gemma":[0.013915308,0.002349166,0.15789397,0.0077576945,0.003001314,0.00003145613,0.24866211,0.40550584,0.12091307,0.0053235483,0.02224571,0.012400824],"about_ca_topic_score_codex":0.0047703395,"about_ca_topic_score_gemma":0.011870756,"teacher_disagreement_score":0.8413617,"about_ca_system_score_codex":0.00007762639,"about_ca_system_score_gemma":0.000020521666,"threshold_uncertainty_score":0.9998965},"labels":[],"label_agreement":null},{"id":"W7071672532","doi":"","title":"A Study on Routing and Scheduling of Hazardous&#13;\\nMaterials in Railway Transportation","year":2019,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Hazardous waste; Damages; Scheduling (production processes); Population; Integer programming; Plan (archaeology); Limiting; Heuristic; Routing (electronic design automation); Stochastic programming","score_opus":0.02897284966968524,"score_gpt":0.296109220183206,"score_spread":0.2671363705135208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7071672532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863238,0.000056339224,0.00022278447,0.000009772299,0.0006445648,0.00096477976,0.00001292363,0.00012370404,0.01164137],"genre_scores_gemma":[0.9978395,0.000064028885,0.00022056003,6.8318565e-7,0.0000711043,0.0000048683723,0.00006233398,0.00008132088,0.0016556034],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9972513,0.0006744931,0.00050762825,0.00053162785,0.0005687055,0.00046629497],"domain_scores_gemma":[0.998803,0.00035961808,0.00017644718,0.00039333443,0.00015746211,0.00011009315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012357825,0.0002930953,0.00060258555,0.0016192979,0.0001571342,0.00008203116,0.00032298206,0.00032612475,0.000012641431],"category_scores_gemma":[0.00010306216,0.0003660698,0.000086636195,0.0010052124,0.000058633457,0.00021342447,0.000023561053,0.00084436336,0.0000057047905],"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.0017773276,0.0005089704,0.67815,0.002288548,0.0006306241,0.0011693425,0.021692874,0.19455172,0.09560479,0.0017910955,0.000020788528,0.0018139449],"study_design_scores_gemma":[0.0027429399,0.00076802925,0.8590398,0.0010732161,0.00011715772,0.0000044739995,0.03423443,0.012142558,0.08900449,0.00005821307,0.00006447393,0.00075022696],"about_ca_topic_score_codex":0.0024949412,"about_ca_topic_score_gemma":0.004964663,"teacher_disagreement_score":0.18240917,"about_ca_system_score_codex":0.0003182639,"about_ca_system_score_gemma":0.00023443655,"threshold_uncertainty_score":0.9998791},"labels":[],"label_agreement":null},{"id":"W7084154972","doi":"10.1007/978-981-95-0673-6_63","title":"No Sedation Vs. Light Sedation in Mechanically Ventilated Patients: The NONSEDA Trial","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","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":"ASTER","funders":"","keywords":"Sedation; Mechanical ventilation; Randomized controlled trial; Critically ill; Clinical trial; Artificial ventilation","score_opus":0.01004320073919106,"score_gpt":0.23203073803922009,"score_spread":0.22198753730002901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084154972","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021695245,0.000040138188,0.06553995,0.00029057122,0.0031836007,0.0020955778,0.000033398188,0.0007077429,0.9278921],"genre_scores_gemma":[0.009364011,0.00041696077,0.047562096,0.0009644929,0.00080081465,0.00019353883,0.002048496,0.00038220573,0.9382674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983491,0.00008553527,0.000747787,0.00030862712,0.00030970713,0.00019924412],"domain_scores_gemma":[0.9989247,0.00021404211,0.00015275678,0.0004339754,0.00023528897,0.000039262897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006162678,0.00031511675,0.0003463861,0.00026506232,0.0000604534,0.000073104275,0.0002640574,0.00051292614,0.000886671],"category_scores_gemma":[0.00025384795,0.0002701003,0.00012163838,0.00014501193,0.000012842337,0.0001230826,0.00006926456,0.0005105256,0.00018872811],"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.015975915,0.0006177369,0.00015418943,0.0014914527,0.0017341515,0.000027703392,0.0010816095,0.3468789,0.0011090749,0.34954736,0.13655108,0.14483084],"study_design_scores_gemma":[0.023690796,0.00037380756,0.000092037175,0.00094518944,0.00028707588,9.930707e-7,0.0000102427875,0.6649228,0.0010547495,0.0034115622,0.3037896,0.0014211959],"about_ca_topic_score_codex":0.00000904706,"about_ca_topic_score_gemma":0.00003699395,"teacher_disagreement_score":0.3461358,"about_ca_system_score_codex":0.00024006785,"about_ca_system_score_gemma":0.00006803898,"threshold_uncertainty_score":0.99997514},"labels":[],"label_agreement":null},{"id":"W7095082914","doi":"","title":"A Heuristic to Solve the Weekly Log-Truck Scheduling Problem","year":2009,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Scheduling (production processes); Job shop scheduling; Tabu search; Integer programming; Schedule; Set (abstract data type); Vehicle routing problem","score_opus":0.01557900989011249,"score_gpt":0.2631635241132104,"score_spread":0.24758451422309793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095082914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010469648,0.00006148034,0.9588711,0.0024803346,0.0001238699,0.00024545923,8.28367e-7,0.000722761,0.027024506],"genre_scores_gemma":[0.3522998,0.000004789245,0.6465958,0.00062108,0.000080825484,0.000007682383,9.940111e-7,0.000020133293,0.00036893596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923,0.000024696079,0.00020563217,0.00014542125,0.00012766347,0.0002665544],"domain_scores_gemma":[0.9995078,0.00009264472,0.000016392387,0.00025618708,0.000043088727,0.00008389283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035405747,0.00012404987,0.00011909973,0.00005681253,0.00008428375,0.00007131237,0.00019631085,0.000051926643,0.000084739004],"category_scores_gemma":[0.000117625736,0.00009268208,0.000038040653,0.0003266337,0.000010383479,0.000060715072,0.000022850812,0.00015980171,0.00014881867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019810775,0.000006646867,0.00006550698,0.000008947467,0.000008824491,0.0000014305235,0.0002602364,0.98112506,0.0013796276,0.0043504653,0.0013156587,0.011475602],"study_design_scores_gemma":[0.00020698954,0.00005817294,0.0014954761,0.000034925688,0.000016317665,0.000012200419,0.00013007014,0.9904775,0.0025306037,0.002382719,0.0023878037,0.00026721964],"about_ca_topic_score_codex":0.000004308309,"about_ca_topic_score_gemma":0.0000023870896,"teacher_disagreement_score":0.34183016,"about_ca_system_score_codex":0.000040203202,"about_ca_system_score_gemma":0.0000123697955,"threshold_uncertainty_score":0.37794656},"labels":[],"label_agreement":null},{"id":"W7096097577","doi":"","title":"Set Covering Problem","year":2003,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Set (abstract data type); Set cover problem; Set theory; Subject (documents); Context (archaeology); Cover (algebra)","score_opus":0.01794915712803758,"score_gpt":0.2519660683179457,"score_spread":0.23401691118990814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096097577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012786678,0.000029710305,0.70398974,0.000009157934,0.000104466635,0.00005460825,5.7724895e-7,0.00059631374,0.28242874],"genre_scores_gemma":[0.47935364,0.000008340182,0.51952815,0.000036296835,0.000011915815,0.0000048113125,0.0000010028568,0.000022998142,0.0010328228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965465,0.000021550177,0.00008805439,0.000061829836,0.000051808125,0.0001221323],"domain_scores_gemma":[0.99982953,0.000024473635,0.000005832048,0.00009532688,0.000011717592,0.000033147488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017057266,0.000056086203,0.00005529233,0.000025665968,0.000020640104,0.000018642677,0.000037106533,0.000029052428,0.00034159952],"category_scores_gemma":[0.000030254076,0.00005680361,0.000014795783,0.000119029435,0.0000044671747,0.00005868362,0.000004940067,0.000052213116,0.00006746078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.128898e-7,0.0000017560735,0.0009117947,0.000019953566,0.00000833847,8.806183e-7,0.00013473385,0.9860138,0.0015978081,0.008795556,0.0012281832,0.0012869287],"study_design_scores_gemma":[0.0005170428,0.000016924656,0.0003702024,0.000021667769,0.00001061073,0.000028140637,0.00017505046,0.8150114,0.07347576,0.0014890248,0.108401395,0.00048276817],"about_ca_topic_score_codex":0.0000012158989,"about_ca_topic_score_gemma":6.594056e-7,"teacher_disagreement_score":0.46656695,"about_ca_system_score_codex":0.000021781001,"about_ca_system_score_gemma":0.0000049900927,"threshold_uncertainty_score":0.37402752},"labels":[],"label_agreement":null},{"id":"W7097911121","doi":"","title":"GERAD and HEC Montreal, Canada,","year":2004,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Metaheuristic; Variable neighborhood search; Local search (optimization); Local optimum; Variable (mathematics); Optimization problem","score_opus":0.006465422324205908,"score_gpt":0.20443845377095235,"score_spread":0.19797303144674644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097911121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48696655,0.00042818004,0.4483925,0.0007866436,0.0002791514,0.00011379747,0.0000053319613,0.0006435109,0.06238432],"genre_scores_gemma":[0.8909704,0.000025817379,0.10849001,0.0001312297,0.000022879958,0.0000016249032,0.0000011296366,0.000013676488,0.00034320637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997326,0.0000050285303,0.00006365174,0.000055116783,0.000050586616,0.00009299738],"domain_scores_gemma":[0.9998538,0.000015659434,0.000004223096,0.00006843068,0.000008880629,0.00004904002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040860563,0.000048420145,0.00005217542,0.000014439039,0.000021987309,0.000012020404,0.00002666083,0.000019504098,0.000030723764],"category_scores_gemma":[0.000012218066,0.000047539612,0.000005129857,0.000052898366,0.0000053672916,0.00003127853,0.000006831443,0.000038113434,0.0000020066602],"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":[5.920818e-7,0.000002720784,0.0005426267,0.000012889766,0.000011419169,0.000007508667,0.00012326198,0.9839751,0.00033597645,0.00080906093,0.002142092,0.012036716],"study_design_scores_gemma":[0.0020319829,0.000030501309,0.08766367,0.000035581765,0.000025532676,0.00007263066,0.00023799644,0.8794964,0.014424355,0.001625271,0.01353642,0.0008196458],"about_ca_topic_score_codex":0.3504361,"about_ca_topic_score_gemma":0.54013443,"teacher_disagreement_score":0.4040039,"about_ca_system_score_codex":0.00006107544,"about_ca_system_score_gemma":0.000032740794,"threshold_uncertainty_score":0.6538894},"labels":[],"label_agreement":null},{"id":"W7101418124","doi":"10.1108/jm2-03-2025-0129","title":"Two metaheuristic algorithms for the technician routing and scheduling problem with time windows and balanced workloads","year":2025,"lang":"en","type":"article","venue":"Journal of Modelling in Management","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":"University of Regina","funders":"","keywords":"Metaheuristic; Technician; Job shop scheduling; Scheduling (production processes); Scalability; Simulated annealing; Variable neighborhood search; Ant colony optimization algorithms; Vehicle routing problem","score_opus":0.015050631564196943,"score_gpt":0.26189936423238075,"score_spread":0.2468487326681838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101418124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006008394,0.0011806419,0.9916766,0.00022244419,0.00005882956,0.00038325833,4.475712e-7,0.0000341789,0.0004351904],"genre_scores_gemma":[0.2860106,0.00040172087,0.71342534,0.000027257525,0.000027402692,0.000013362794,2.3005535e-7,0.000017381608,0.000076706565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991409,0.000028675842,0.00040229398,0.000118676806,0.00013132975,0.00017810147],"domain_scores_gemma":[0.9994618,0.00022655081,0.00012039417,0.0001064016,0.000057590303,0.00002720833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016401758,0.0001220839,0.00022115766,0.00020556776,0.00008705296,0.00008743152,0.0001260277,0.000031167874,8.7860144e-7],"category_scores_gemma":[0.000018422286,0.00008913771,0.000028281987,0.00027039475,0.000024432646,0.00009088961,0.00004317862,0.00021651707,1.4178379e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002442567,0.000007742085,0.00022426681,0.00012673337,0.00013092502,0.0000044522717,0.000104067956,0.9780171,0.00003918056,0.00065307075,0.0000073361084,0.020660717],"study_design_scores_gemma":[0.00096041115,0.000025859428,0.0000934424,0.00065669033,0.00014476648,0.0000069368534,0.00015375245,0.9966525,0.00005772058,0.001052479,0.00010347875,0.00009195606],"about_ca_topic_score_codex":0.0000022326699,"about_ca_topic_score_gemma":8.2029624e-7,"teacher_disagreement_score":0.2800022,"about_ca_system_score_codex":0.000056105542,"about_ca_system_score_gemma":0.000009730045,"threshold_uncertainty_score":0.36349303},"labels":[],"label_agreement":null},{"id":"W7104438572","doi":"10.71781/10756","title":"Competitive EV charging station location with queues","year":2025,"lang":"en","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Context (archaeology); Operation planning; Scheduling (production processes); Queue","score_opus":0.004802782006997965,"score_gpt":0.18411429319438438,"score_spread":0.17931151118738642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104438572","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35498542,0.021410992,0.10150651,0.0002096046,0.003501399,0.0017348512,0.00020692806,0.00259217,0.5138521],"genre_scores_gemma":[0.92272365,0.0007386649,0.017807694,0.000054201122,0.00018841356,0.00007830259,0.0030854542,0.00010411792,0.055219505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984987,0.00010243945,0.0003045719,0.00038387257,0.00042831327,0.00028211984],"domain_scores_gemma":[0.99884725,0.00010825017,0.0001914908,0.0002628906,0.000471183,0.0001189309],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00015797357,0.0003603683,0.00031550537,0.00041702634,0.002066487,0.000064495565,0.00021401183,0.00029801187,0.000021789965],"category_scores_gemma":[0.00004597913,0.00042101237,0.000086726184,0.00053942925,0.000053773245,0.0003112129,0.00002127884,0.0003737837,0.00001685107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044565977,0.00006854294,0.0013881571,0.0009173245,0.0005497061,0.00027086807,0.023049535,0.9201684,0.0061154882,0.036994897,0.00042396737,0.00960746],"study_design_scores_gemma":[0.005126042,0.00030401658,0.068609506,0.0067313965,0.0018662707,0.00047859666,0.12315507,0.587896,0.1364351,0.0005695915,0.06468926,0.004139132],"about_ca_topic_score_codex":0.0028609622,"about_ca_topic_score_gemma":0.0044717155,"teacher_disagreement_score":0.56773823,"about_ca_system_score_codex":0.004092542,"about_ca_system_score_gemma":0.00091074343,"threshold_uncertainty_score":0.99982417},"labels":[],"label_agreement":null},{"id":"W7104453159","doi":"10.71781/9707","title":"Data-driven large neighbourhood search for combinatorial optimization problems","year":2025,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Institut de Valorisation des Données; Canada First Research Excellence Fund","keywords":"ESPACE","score_opus":0.06321108985735971,"score_gpt":0.3607349507421455,"score_spread":0.2975238608847858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104453159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024986744,0.0003851989,0.8553949,0.00006899113,0.007972488,0.006717399,0.005053303,0.000095879725,0.12181319],"genre_scores_gemma":[0.00741204,0.00015947095,0.88621294,0.0000120349305,0.0004964052,0.00031635654,0.092147015,0.00023496136,0.013008749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812865,0.000104121216,0.00051503646,0.0006008738,0.00025316456,0.0003981561],"domain_scores_gemma":[0.99852616,0.00018074267,0.00012175075,0.000816466,0.00027167733,0.00008321822],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009495204,0.00031625718,0.0004655535,0.00015919266,0.0001874157,0.00049496297,0.0014983981,0.00045820314,0.0010850221],"category_scores_gemma":[0.00017858275,0.00037125152,0.000062970954,0.0003918328,0.0000073239485,0.00042495705,0.00024210701,0.00036419425,0.000036616482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044125387,0.000062566956,0.00001563714,0.00032622676,0.00013917813,9.161936e-7,0.00044430105,0.96908724,0.000056484234,0.00020104815,0.0014258438,0.028196426],"study_design_scores_gemma":[0.0014804356,0.000034284025,0.000016106935,0.00028106125,0.0001408286,4.935111e-7,0.00020222296,0.9728332,0.0011386541,0.000036123518,0.023457088,0.00037948703],"about_ca_topic_score_codex":0.000011863453,"about_ca_topic_score_gemma":0.00007914919,"teacher_disagreement_score":0.10880444,"about_ca_system_score_codex":0.00011332029,"about_ca_system_score_gemma":0.00031385294,"threshold_uncertainty_score":0.99987394},"labels":[],"label_agreement":null},{"id":"W7104832298","doi":"10.2139/ssrn.5737083","title":"REINFORCEMENT LEARNING-ACCELERATED BRANCH AND PRICE TO SOLVE A BUS ROUTING MODEL","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"Dalhousie University","funders":"","keywords":"Greenhouse gas; Robustness (evolution); Column generation; Fuel efficiency; Linear programming; Scalability; Limiting; Sensitivity (control systems)","score_opus":0.017729937573803863,"score_gpt":0.2804378688871844,"score_spread":0.26270793131338055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104832298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03006453,0.003067088,0.9599398,0.0005796272,0.00074361445,0.00104646,0.0000054062525,0.00033677087,0.0042167543],"genre_scores_gemma":[0.89959246,0.023944817,0.06492655,0.00020840742,0.00054870493,0.000070269874,0.00002810862,0.00022283434,0.010457833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98934263,0.00037915198,0.0020591784,0.0011533598,0.0008186781,0.006247019],"domain_scores_gemma":[0.99698377,0.0002586807,0.0008210537,0.0006389298,0.0007408491,0.0005567448],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008259108,0.0011886307,0.0012715278,0.0008778149,0.0010787739,0.00079549185,0.00094916753,0.0008327713,0.00007077301],"category_scores_gemma":[0.001050156,0.0014079099,0.00035128635,0.0012727571,0.000056258763,0.0003533935,0.0010987157,0.015622312,0.000023526909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00013622922,0.000035059125,0.00020912307,0.00023490953,0.0009570152,0.0000033873312,0.0023648455,0.94333243,0.0009956685,0.016276894,0.000019616493,0.035434797],"study_design_scores_gemma":[0.0014942889,0.0003134629,0.000058270423,0.00093706796,0.0002995594,0.00023770217,0.00063735386,0.98313224,0.0004127111,0.01099746,0.00028565197,0.0011941998],"about_ca_topic_score_codex":0.000109038905,"about_ca_topic_score_gemma":0.00006256327,"teacher_disagreement_score":0.8950132,"about_ca_system_score_codex":0.0060296846,"about_ca_system_score_gemma":0.0073787645,"threshold_uncertainty_score":0.99883705},"labels":[],"label_agreement":null},{"id":"W7109966539","doi":"10.4230/lipics.socg.2025.53","title":"A PTAS for TSP with Neighbourhoods over Parallel Line Segments","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","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":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Neighbourhood (mathematics); Line segment; Approximation algorithm; Euclidean geometry; Line (geometry); Euclidean distance; Point (geometry)","score_opus":0.011387866767055601,"score_gpt":0.2773204266513546,"score_spread":0.265932559884299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109966539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034217175,0.00007094005,0.95509297,0.00016323663,0.0007833629,0.001845162,0.00051906897,0.0005842123,0.0067238584],"genre_scores_gemma":[0.29995537,0.00007164486,0.6943219,0.0015254704,0.00023057208,0.00075852446,0.0010243785,0.00019823379,0.0019139476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976239,0.000026489888,0.0010208056,0.00023594876,0.00030522235,0.0007876051],"domain_scores_gemma":[0.9985767,0.000217748,0.00020108865,0.00059122615,0.00024891636,0.00016430583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005335272,0.00047504652,0.0005363643,0.0003245349,0.00025307114,0.00024570778,0.00046797693,0.00026507012,0.000051309562],"category_scores_gemma":[0.000119515586,0.00042916503,0.0002092881,0.00045760875,0.00007128957,0.00067533186,0.0001175567,0.0003416591,0.000023040478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011733889,0.0006497598,0.022083586,0.006795799,0.002572442,0.000006409667,0.007424186,0.86365765,0.0003337212,0.015379218,0.033738002,0.046185806],"study_design_scores_gemma":[0.0073863543,0.00023944909,0.0010031202,0.00034509908,0.00014968711,0.000010899465,0.00040028818,0.93437773,0.001270302,0.00042740675,0.05374993,0.0006397567],"about_ca_topic_score_codex":0.0000054525935,"about_ca_topic_score_gemma":0.000009500254,"teacher_disagreement_score":0.2657382,"about_ca_system_score_codex":0.00019911848,"about_ca_system_score_gemma":0.000075368414,"threshold_uncertainty_score":0.999816},"labels":[],"label_agreement":null},{"id":"W7114775904","doi":"10.5267/j.jpm.2025.11.003","title":"Route optimization for open-close multiple travelling salesman problem with load-balancing constraint: A multi-chromosome based genetic algorithm","year":2025,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Crossover; 2-opt; Genetic algorithm; Benchmark (surveying); Bottleneck traveling salesman problem; Combinatorial optimization; Nearest neighbour algorithm; Lin–Kernighan heuristic","score_opus":0.01920267751821153,"score_gpt":0.28319407971233257,"score_spread":0.26399140219412104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114775904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008373346,0.00016439166,0.9958792,0.0000763502,0.00022337594,0.0019737969,0.000014279627,0.00009584166,0.00073543005],"genre_scores_gemma":[0.028432341,0.00007330708,0.9709472,0.00008584175,0.000055566543,0.00010430984,0.000010350989,0.000057830694,0.00023322721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983069,0.000094529474,0.0007423456,0.0002450447,0.00028859935,0.00032263278],"domain_scores_gemma":[0.99895024,0.00013037067,0.00030636,0.00022230257,0.0003274814,0.000063236475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010953138,0.0002502252,0.00038876076,0.00042369738,0.00012946822,0.00022820072,0.00041429835,0.00007431307,0.000011121861],"category_scores_gemma":[0.00005077288,0.00022711023,0.0000969843,0.00054078514,0.00003417534,0.00023630795,0.0000651213,0.00019735904,7.1125146e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006343827,0.00010710026,0.00027690383,0.00055436435,0.00031332066,0.000035399895,0.00021660596,0.96352684,0.00010727673,0.00006438744,0.0001551073,0.034579236],"study_design_scores_gemma":[0.0057050134,0.00015352393,0.00021253328,0.00073265913,0.00022088535,0.000019500534,0.00024230094,0.9904588,0.00095215224,0.00003059303,0.0010275426,0.00024448129],"about_ca_topic_score_codex":0.000010661316,"about_ca_topic_score_gemma":0.000009049117,"teacher_disagreement_score":0.034334753,"about_ca_system_score_codex":0.00042503444,"about_ca_system_score_gemma":0.00022344547,"threshold_uncertainty_score":0.9261286},"labels":[],"label_agreement":null},{"id":"W7114912747","doi":"10.1145/3748636.3764603","title":"Learning Heuristics to Solve Dynamic Vehicle Routing Problems Using Large Language Models","year":2025,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Toronto; University of Waterloo","funders":"National Research Council Canada","keywords":"Heuristics; Vehicle routing problem; Leverage (statistics); Scalability; Greedy algorithm; Executable; Reinforcement learning; Routing (electronic design automation)","score_opus":0.013812041959171724,"score_gpt":0.2859743451169398,"score_spread":0.27216230315776807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114912747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.149039,0.0001007541,0.84083676,0.000036426332,0.000168464,0.00019070428,0.00000365031,0.00091231056,0.008711906],"genre_scores_gemma":[0.71044457,0.0000056863387,0.28848752,0.00009744682,0.000020254312,0.0000063116822,0.0000062904946,0.000045911645,0.0008860076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879974,0.00005484183,0.00031668457,0.0002353222,0.0001394106,0.00045397665],"domain_scores_gemma":[0.9994947,0.000102555554,0.000031294734,0.00022509291,0.00006614776,0.00008026599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006121057,0.00017832342,0.0002078776,0.00018315755,0.00017295746,0.000090736525,0.0001591178,0.00009911049,0.000032815376],"category_scores_gemma":[0.00017812212,0.00019917348,0.0000498756,0.0005996743,0.000009162361,0.00013747012,0.00012400074,0.00030053355,0.000018182145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015504257,0.00001050956,0.00040088466,0.000065724285,0.000023452343,0.00000248851,0.0015378864,0.98235905,0.0113032255,0.0015747793,0.000030868472,0.0026895644],"study_design_scores_gemma":[0.00024132713,0.000010063108,0.0000816404,0.00010366662,0.000019446039,0.0000015238105,0.00077862403,0.9970084,0.0012470153,0.00018685758,0.00011322765,0.00020823187],"about_ca_topic_score_codex":0.000036433412,"about_ca_topic_score_gemma":0.000024061163,"teacher_disagreement_score":0.5614056,"about_ca_system_score_codex":0.0001781542,"about_ca_system_score_gemma":0.000027174467,"threshold_uncertainty_score":0.81220585},"labels":[],"label_agreement":null},{"id":"W7115715308","doi":"10.5267/j.dsl.2025.10.008","title":"An advanced optimization framework for cross-docking site selection in global supply chains using an enhanced k-means clustering algorithm integrated with geographic information systems","year":2025,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Khon Kaen University","keywords":"Transshipment (information security); Cluster analysis; Supply chain; Identification (biology); Selection (genetic algorithm); Geographic information system; Facility location problem; Logistics center","score_opus":0.009999305551592777,"score_gpt":0.31891627098775155,"score_spread":0.30891696543615876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115715308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4170453,0.000006625491,0.5819683,0.000014093991,0.0003374503,0.0004003437,0.000010757069,0.00020847077,0.00000868047],"genre_scores_gemma":[0.46322155,0.000003713737,0.53654534,0.00014277443,0.000020080191,0.0000313036,0.000022647451,0.000012296118,3.3799114e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789286,0.00007997152,0.0005995225,0.0004352789,0.0004911169,0.00050127774],"domain_scores_gemma":[0.9989106,0.00014979148,0.00015438462,0.0002939734,0.00038330667,0.000107966654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421674,0.00024210404,0.0002501215,0.0009986863,0.00042415288,0.000953453,0.00038609173,0.00013892815,0.000002162802],"category_scores_gemma":[0.000305097,0.00024145175,0.000036028614,0.005013059,0.00012951325,0.0042133606,0.000035871806,0.00022496459,6.612793e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004785952,0.00001241983,0.0053938664,0.00002282601,0.000004646517,4.8010963e-7,0.00033738188,0.9459476,0.006682066,0.00007152684,7.868001e-7,0.041478563],"study_design_scores_gemma":[0.0006617558,0.000058847916,0.005127876,0.0004261759,0.0000083787845,0.0000067483743,0.0003009091,0.99177164,0.0013316778,0.00003287425,0.000014487463,0.00025860142],"about_ca_topic_score_codex":0.00007958709,"about_ca_topic_score_gemma":0.00004551347,"teacher_disagreement_score":0.046176247,"about_ca_system_score_codex":0.00067364133,"about_ca_system_score_gemma":0.00008788812,"threshold_uncertainty_score":0.98461163},"labels":[],"label_agreement":null},{"id":"W7116650998","doi":"10.18280/mmep.121135","title":"An Accelerated Crow Search Algorithm for Multifactorial Optimization in Vehicle Routing Problem","year":2025,"lang":"","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vehicle routing problem; Routing (electronic design automation); Genetic algorithm; Search algorithm; Optimization algorithm; Optimization problem; Local search (optimization)","score_opus":0.03959600188158354,"score_gpt":0.2903268334158408,"score_spread":0.2507308315342573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116650998","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082192505,0.0002969388,0.9883773,0.00007657324,0.00047863615,0.0017663679,0.000028090179,0.0006002895,0.00015655645],"genre_scores_gemma":[0.2479148,0.00013099067,0.7513159,0.000008544053,0.00015885594,0.00019453514,0.000042143332,0.00015421507,0.00008002458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962036,0.00013350684,0.0014064295,0.00083756156,0.00031344028,0.0011054671],"domain_scores_gemma":[0.9982138,0.0007267653,0.00009620806,0.00043806384,0.00025660705,0.00026853377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022657127,0.0006501353,0.0008592885,0.0005727491,0.0002502077,0.0006130727,0.00033246164,0.0006142813,0.000022266515],"category_scores_gemma":[0.00016902765,0.0007457457,0.00011519995,0.0010327374,0.00005442632,0.0005141844,0.0000976106,0.0008017567,0.0000031072802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001919958,0.00019585705,0.000022504817,0.0026471901,0.00008788378,0.000002102535,0.0019548216,0.97369564,0.0013874649,0.0039242525,0.0000024744363,0.016060611],"study_design_scores_gemma":[0.0019590193,0.000098987926,0.0000037046325,0.0019176608,0.00008185782,0.0000036788338,0.000100625955,0.99240005,0.0010441011,0.0016883246,0.000025756011,0.00067621557],"about_ca_topic_score_codex":0.00004725672,"about_ca_topic_score_gemma":0.000001033265,"teacher_disagreement_score":0.23969556,"about_ca_system_score_codex":0.000277736,"about_ca_system_score_gemma":0.00008958551,"threshold_uncertainty_score":0.9994994},"labels":[],"label_agreement":null},{"id":"W7116980251","doi":"10.1016/j.omega.2025.103496","title":"The stochastic production routing problem with adaptive routing and service level constraints","year":2025,"lang":"en","type":"article","venue":"Omega","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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; Healthcare Excellence Canada","keywords":"Routing (electronic design automation); Production (economics); Service (business); Service level; Multipath routing","score_opus":0.021645396550457763,"score_gpt":0.24635704450719642,"score_spread":0.22471164795673865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116980251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049300876,0.00012287358,0.94208544,0.0011695063,0.00026517196,0.0004887675,0.000004461788,0.00040542876,0.006157474],"genre_scores_gemma":[0.9348655,0.0000047691706,0.06460427,0.00005750738,0.000047414425,0.000027872118,0.0000017218416,0.000023866622,0.00036712436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991966,0.000058817855,0.00018814336,0.00020369061,0.000109593515,0.00024314321],"domain_scores_gemma":[0.99941397,0.00020125997,0.000049289647,0.00016584451,0.00013553556,0.0000341125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055216503,0.00013659826,0.00012183763,0.000052767336,0.0003139089,0.00009502283,0.00009081997,0.00004885638,0.0000018159701],"category_scores_gemma":[0.00017059114,0.00010525327,0.000011988363,0.00046800156,0.00007871619,0.00012018196,0.000043922744,0.00020211388,0.0000026407452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027401935,0.000009107808,0.00076334935,0.00008309261,0.00010933912,0.000001219164,0.0015091782,0.9228111,0.0010477457,0.00780566,0.000076359174,0.065756425],"study_design_scores_gemma":[0.0005587761,0.000029107148,0.004034587,0.0004415598,0.000058277397,0.000032363805,0.0020267987,0.9908646,0.0010642308,0.0004770936,0.00013943529,0.00027320586],"about_ca_topic_score_codex":0.000013712357,"about_ca_topic_score_gemma":0.00004611135,"teacher_disagreement_score":0.88556457,"about_ca_system_score_codex":0.00006735642,"about_ca_system_score_gemma":0.000045100885,"threshold_uncertainty_score":0.42921036},"labels":[],"label_agreement":null},{"id":"W7117152070","doi":"10.2139/ssrn.5964219","title":"Carrier Collaborative Vehicle Routing Problem with Shared Customer Demands and Vehicle Capacities","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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é Laval","funders":"","keywords":"Vehicle routing problem; Heuristic; Homogeneous; Routing (electronic design automation); Quality (philosophy); Computation","score_opus":0.008061387881110445,"score_gpt":0.2444858075244021,"score_spread":0.23642441964329167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117152070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42209175,0.030071657,0.5211812,0.0018282206,0.001535245,0.0033645,0.0005437293,0.0008521161,0.018531553],"genre_scores_gemma":[0.9460747,0.012739845,0.032583356,0.00008899345,0.00059761887,0.00012419304,0.00003862507,0.000251434,0.007501188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903752,0.00096462533,0.0015381429,0.0011315587,0.00087139016,0.0051190485],"domain_scores_gemma":[0.99636596,0.00040841047,0.0009162767,0.0006444551,0.0012439593,0.00042093763],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005314375,0.0012621138,0.0014313472,0.00066615193,0.0013168935,0.0008898587,0.00076541316,0.0008571259,0.000090556154],"category_scores_gemma":[0.0002698212,0.0012460772,0.0002377156,0.0014763547,0.00042716583,0.0007374001,0.00049160403,0.010704235,0.000010446513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.0005604077,0.00011547558,0.013940092,0.00092080334,0.0048013744,0.000035677556,0.021959716,0.87811345,0.0009711624,0.051984023,0.000121653284,0.026476135],"study_design_scores_gemma":[0.0109855905,0.0015719528,0.0019328884,0.0059858277,0.0026965386,0.0013891072,0.07134478,0.85903907,0.0028496701,0.034106232,0.0028148403,0.0052835266],"about_ca_topic_score_codex":0.00019856471,"about_ca_topic_score_gemma":0.00069646235,"teacher_disagreement_score":0.523983,"about_ca_system_score_codex":0.0042069247,"about_ca_system_score_gemma":0.0094147725,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W7117325248","doi":"10.1016/j.tre.2025.104626","title":"A comparison of cost-sharing models in horizontal cooperative routing","year":2025,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stability (learning theory); Measure (data warehouse); Gini coefficient; Routing (electronic design automation); Yield (engineering); Vehicle routing problem; Dispersion (optics)","score_opus":0.16473147736188717,"score_gpt":0.4442473126133604,"score_spread":0.2795158352514733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117325248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0716263,0.028281992,0.8933441,0.00031654537,0.00019959081,0.0027071403,0.00029600278,0.00020332655,0.0030249855],"genre_scores_gemma":[0.9695051,0.024719995,0.005140537,0.000036297122,0.000009162009,0.00016729874,0.00036130557,0.000021782605,0.00003855301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978071,0.00012601494,0.0011066038,0.00030107648,0.00034951905,0.00030969843],"domain_scores_gemma":[0.9989658,0.00029450402,0.00009025504,0.00018426287,0.0003868948,0.00007827589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013571213,0.00017704008,0.000556718,0.0002648894,0.00009630486,0.000025311085,0.00014663556,0.00010109668,0.000037555328],"category_scores_gemma":[0.00008477292,0.00018761177,0.00005793034,0.0011207035,0.00012989937,0.00017090778,0.0000024473143,0.00042277208,0.000001363104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032040574,0.00011721859,0.067341045,0.0069546606,0.000058749774,0.000011566776,0.0014860034,0.8085275,0.0002022079,0.103128046,0.0002169725,0.011923972],"study_design_scores_gemma":[0.0016035361,0.00012384527,0.08099256,0.010226394,0.00018671359,3.3964506e-7,0.00090269087,0.8983223,0.0013568714,0.0028935366,0.00287644,0.0005147865],"about_ca_topic_score_codex":0.00011568602,"about_ca_topic_score_gemma":0.0010957795,"teacher_disagreement_score":0.89787877,"about_ca_system_score_codex":0.000049297356,"about_ca_system_score_gemma":0.00007072234,"threshold_uncertainty_score":0.76505864},"labels":[],"label_agreement":null},{"id":"W7117470175","doi":"10.23919/iccas66577.2025.11301391","title":"Multi-Agent Tsallis Actor–Critic for Autonomous Vehicle Fleet Coordination on Road Graph Networks","year":2025,"lang":"","type":"article","venue":"","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":"Artificial Intelligence in Medicine (Canada)","funders":"Korea Evaluation Institute of Industrial Technology; Ministry of Trade, Industry and Energy","keywords":"Job shop scheduling; Benchmark (surveying); Graph; Inference; Scheduling (production processes); Heuristic; Reinforcement learning","score_opus":0.02370621082766563,"score_gpt":0.30243376266814365,"score_spread":0.27872755184047804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117470175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009781758,0.00083263067,0.9784729,0.0012725127,0.0038720951,0.0017929015,0.000040381838,0.00092986674,0.0030049877],"genre_scores_gemma":[0.7822185,0.00016854696,0.21071476,0.0006816052,0.00023861128,0.00023208317,0.0000748613,0.00014616782,0.0055248216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963867,0.00030657003,0.0011196159,0.0008816067,0.0002859403,0.0010195377],"domain_scores_gemma":[0.9974837,0.00091907766,0.00015558608,0.00078730733,0.00041237354,0.00024199407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012853941,0.0006605045,0.0006717265,0.0005854322,0.00047205316,0.00034575135,0.0004760353,0.0006164959,0.00024540286],"category_scores_gemma":[0.0007322161,0.00077356247,0.00039355512,0.0012501122,0.000082519684,0.00030767807,0.00012331708,0.0005732863,0.000038098922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007368748,0.000274926,0.00041562266,0.0002755646,0.0002603346,0.000002432196,0.00020541549,0.92536867,0.0010228662,0.0043739663,0.002285532,0.06544097],"study_design_scores_gemma":[0.0027316252,0.00021984396,0.0050204434,0.0002851244,0.00021645971,0.0000010268558,0.00012605163,0.9850376,0.0026879031,0.00015755428,0.0028416032,0.0006747168],"about_ca_topic_score_codex":0.00009586109,"about_ca_topic_score_gemma":0.00003638945,"teacher_disagreement_score":0.7724368,"about_ca_system_score_codex":0.0007049274,"about_ca_system_score_gemma":0.00012781961,"threshold_uncertainty_score":0.99947155},"labels":[],"label_agreement":null},{"id":"W7117476672","doi":"10.3390/asi9010010","title":"An Artificial Intelligence Enhanced Transfer Graph Framework for Time-Dependent Intermodal Transport Optimization","year":2025,"lang":"en","type":"article","venue":"Applied System Innovation","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":"Francophone University Association","funders":"","keywords":"Modular design; Subnetwork; Scalability; Graph; Computation; Routing (electronic design automation); Bridging (networking); Schedule","score_opus":0.016496534255903514,"score_gpt":0.27893153333419624,"score_spread":0.2624349990782927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117476672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023605045,0.000007172881,0.97180235,0.000031901905,0.000571219,0.0010780381,0.000020212938,0.0009555475,0.0019285326],"genre_scores_gemma":[0.7700222,0.0000016215275,0.22927874,0.000043616295,0.00009020064,0.00031931204,0.0001820891,0.00004646925,0.000015716732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982614,0.000041448384,0.0009043447,0.00035075823,0.00019005689,0.00025197383],"domain_scores_gemma":[0.9992021,0.00010510631,0.00006630987,0.00033015478,0.00026509087,0.000031293286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000814243,0.00022944802,0.00028821788,0.00048497517,0.00012862669,0.0000651712,0.0002177793,0.00028223565,0.00002876832],"category_scores_gemma":[0.000029507659,0.00026569073,0.000048753507,0.0016879288,0.000026273809,0.00016470009,0.000005549387,0.0001890887,0.000010089123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045665358,0.000020369387,0.0000029622806,0.0001869438,0.000030273219,1.3250914e-7,0.0003179657,0.6387213,0.053752407,0.29477423,0.000003795929,0.012143963],"study_design_scores_gemma":[0.0001374385,0.000026175865,0.000012798446,0.00012837761,0.000034936937,6.2283976e-7,0.00041301738,0.78974247,0.20256773,0.00669278,0.000008335819,0.00023533491],"about_ca_topic_score_codex":0.0000015560913,"about_ca_topic_score_gemma":0.0000012042295,"teacher_disagreement_score":0.74641716,"about_ca_system_score_codex":0.00015842143,"about_ca_system_score_gemma":0.000035880857,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W7117662164","doi":"10.25077/josi.v24.n2.p324-344.2025","title":"Goal Programming and Monte Carlo Simulation for Optimizing Inbound Scheduling in Resource-Constrained Warehouses","year":2025,"lang":"id","type":"article","venue":"Jurnal Optimasi Sistem Industri","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":"University of British Columbia","funders":"Universitas Kristen Petra","keywords":"Scheduling (production processes); Robustness (evolution); Key (lock); Monte Carlo method; Truck; Prioritization; FIFO (computing and electronics); Material handling","score_opus":0.03250396975506274,"score_gpt":0.30685081471271985,"score_spread":0.2743468449576571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117662164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53396356,0.0052957605,0.4499554,0.0014521922,0.0011896205,0.0043834383,0.00005528956,0.000779954,0.002924791],"genre_scores_gemma":[0.688514,0.000053581654,0.31004712,0.00007763751,0.00023365153,0.00012110812,0.0000131392535,0.00012711277,0.0008126337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958239,0.00032663767,0.0016544075,0.00079890055,0.00037029467,0.0010258236],"domain_scores_gemma":[0.9969056,0.0017179396,0.00042016484,0.00041046334,0.0002923501,0.00025342876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020838538,0.0006739239,0.0009354451,0.0009340521,0.0004651262,0.00076119404,0.00033443555,0.0009488387,0.000007918947],"category_scores_gemma":[0.0014089475,0.0008079256,0.00023854335,0.0014300876,0.00017290792,0.00052999536,0.00017788763,0.0013965194,0.0000015795254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020587113,0.00007607313,0.0051585357,0.0005409949,0.00020808517,0.000019922985,0.0008625462,0.93538296,0.00018672083,0.00015173141,0.000023215718,0.057183318],"study_design_scores_gemma":[0.0045869397,0.00013370762,0.0010309604,0.0022025139,0.00024018223,0.000019422145,0.0021237733,0.9814007,0.00034120775,0.000007577784,0.0072502214,0.00066279055],"about_ca_topic_score_codex":0.000028460416,"about_ca_topic_score_gemma":0.000016104019,"teacher_disagreement_score":0.15455045,"about_ca_system_score_codex":0.0008618505,"about_ca_system_score_gemma":0.0003736212,"threshold_uncertainty_score":0.99943715},"labels":[],"label_agreement":null},{"id":"W7117754593","doi":"10.2139/ssrn.5991236","title":"A New Multi-Objective Optimization Model for Carinata-based Sustainable Aviation Fuel Supply Chain Network Design","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Vehicle Routing Optimization Methods","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":"Toronto Metropolitan University","funders":"","keywords":"Greenhouse gas; Sustainability; Minification; Supply chain; Maximization; Fuzzy logic; Aviation; Supply chain network; Production (economics); Process (computing)","score_opus":0.01790130678189506,"score_gpt":0.27372164109631203,"score_spread":0.255820334314417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117754593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011645486,0.006635214,0.9863257,0.0005394073,0.0011515879,0.0047565135,0.000053361073,0.00038688813,0.00013968095],"genre_scores_gemma":[0.028828334,0.005831822,0.94510907,0.0001076188,0.0011741043,0.00043249814,0.00026876383,0.00034384165,0.017903954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9868262,0.0013315554,0.00203434,0.0013828,0.0007487592,0.007676392],"domain_scores_gemma":[0.9942272,0.0009638886,0.0013859359,0.00091253524,0.0020603903,0.0004500901],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.013005698,0.0014210725,0.0014452155,0.0011044735,0.0011927825,0.00070569234,0.0012563365,0.0014741775,0.000048885755],"category_scores_gemma":[0.001516205,0.0017626444,0.0008348652,0.0014945852,0.000057409343,0.0006748299,0.00033890133,0.0074513434,0.000003785311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00066098414,0.0001226306,0.00007968261,0.00065327086,0.001046824,0.0000037120235,0.001078013,0.9437886,0.0000075244443,0.043013807,0.0002232195,0.009321736],"study_design_scores_gemma":[0.004982763,0.0003432106,0.000010953668,0.0004781442,0.0008206521,0.00003388446,0.0008600042,0.8666581,0.000060495116,0.124482684,0.000049035407,0.0012201045],"about_ca_topic_score_codex":0.0003395122,"about_ca_topic_score_gemma":0.00024103417,"teacher_disagreement_score":0.08146888,"about_ca_system_score_codex":0.016764684,"about_ca_system_score_gemma":0.0376044,"threshold_uncertainty_score":0.9998539},"labels":[],"label_agreement":null},{"id":"W7117764697","doi":"10.1002/net.70024","title":"Partial‐Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands","year":2025,"lang":"en","type":"article","venue":"Networks","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":"Polytechnique Montréal; HEC Montréal","funders":"China Scholarship Council","keywords":"Vehicle routing problem; Routing (electronic design automation); Markov decision process; Heuristic; Stochastic programming; Markov chain; Markov process; Static routing","score_opus":0.014630117411430988,"score_gpt":0.25702623743899644,"score_spread":0.24239612002756544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117764697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022664503,0.00047757666,0.994691,0.00013309167,0.0002005323,0.00047532926,0.0000011141492,0.0003800367,0.0013748775],"genre_scores_gemma":[0.9688191,0.000008143331,0.030520217,0.000086324435,0.00021480012,0.00013344629,0.000004325912,0.000043085343,0.00017060514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990912,0.000035026813,0.00023389944,0.00017545094,0.00008913928,0.00037526974],"domain_scores_gemma":[0.999022,0.0006089136,0.000043848602,0.00022746222,0.00005799571,0.000039743478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005535571,0.00015257731,0.00016172895,0.000036436028,0.00026862384,0.00010719871,0.00016646796,0.00009517082,0.000007929515],"category_scores_gemma":[0.000039326846,0.000112402835,0.0000439487,0.00037424883,0.000032472402,0.00006661554,0.00002819234,0.00024409035,0.0000011481699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015474368,0.000004507939,0.0003363053,0.00002612253,0.000062683386,3.540137e-7,0.000107280626,0.9716906,0.000024384597,0.001334821,0.00027845998,0.026118986],"study_design_scores_gemma":[0.00044397844,0.000026026903,0.00030672408,0.000114579176,0.00007199355,0.0000014101078,0.0001177398,0.9983473,0.00007811731,0.000100502344,0.000261369,0.00013028384],"about_ca_topic_score_codex":0.0000067057717,"about_ca_topic_score_gemma":0.0000136587,"teacher_disagreement_score":0.9665526,"about_ca_system_score_codex":0.000046352445,"about_ca_system_score_gemma":0.00002731194,"threshold_uncertainty_score":0.45836544},"labels":[],"label_agreement":null},{"id":"W7124158831","doi":"10.1109/codit66093.2025.11321472","title":"Transport optimization of an anaerobic digestion co-product in a closed-loop supply chain","year":2025,"lang":"","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digestate; Truck; Anaerobic digestion; Supply chain; Supply chain optimization; Biogas","score_opus":0.013207253161775805,"score_gpt":0.27951011236129225,"score_spread":0.26630285919951646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124158831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2485316,0.00035005918,0.7453124,0.00031753298,0.00068060536,0.0009190011,0.00003095605,0.00027702295,0.0035808412],"genre_scores_gemma":[0.6495279,0.0003733547,0.34859118,0.000042372285,0.000051233434,0.000025699383,0.00020763447,0.000065734195,0.0011149172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964081,0.0004592101,0.0014966304,0.00074529654,0.0003333321,0.0005573968],"domain_scores_gemma":[0.9985286,0.00014328201,0.00019064263,0.0007795983,0.00022802726,0.00012987056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019081039,0.0004601423,0.00072578,0.0010969526,0.0000912221,0.00004530525,0.00035921033,0.0003560264,0.0006035931],"category_scores_gemma":[0.00024590493,0.00056630146,0.0001280826,0.0026340513,0.00010697803,0.00060203375,0.000024963128,0.00044552723,0.000004534229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009039705,0.00028490936,0.016468652,0.0004304584,0.000059406964,0.000006548619,0.0007063865,0.95431596,0.0042882552,0.0014934263,0.000029472008,0.02182613],"study_design_scores_gemma":[0.0015666471,0.000112727255,0.032244053,0.0003915462,0.00008844122,0.0000027700432,0.0002088026,0.9335996,0.03122209,0.000053935983,0.00007530793,0.00043408523],"about_ca_topic_score_codex":0.0003501042,"about_ca_topic_score_gemma":0.00014094813,"teacher_disagreement_score":0.40099627,"about_ca_system_score_codex":0.00028423846,"about_ca_system_score_gemma":0.00023441268,"threshold_uncertainty_score":0.99967885},"labels":[],"label_agreement":null},{"id":"W7124217846","doi":"10.1109/codit66093.2025.11321233","title":"A lexicographic bi-objective approach to fleet sizing and routing for service vehicles in a real-world passenger transport system","year":2025,"lang":"","type":"article","venue":"","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":"École de Technologie Supérieure","funders":"","keywords":"Lexicographical order; Software deployment; Sizing; Service (business); Public transport; Vehicle routing problem; Sustainability; Linear programming","score_opus":0.024223979383669804,"score_gpt":0.2839181024757135,"score_spread":0.25969412309204365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124217846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1985968,0.00047146596,0.74710834,0.0005847395,0.0004727553,0.0037678939,0.00004783137,0.00093751913,0.048012625],"genre_scores_gemma":[0.74314284,0.00005272872,0.25558215,0.00023266631,0.000087777116,0.0004187473,0.000014357588,0.0001213624,0.00034737066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541533,0.0003742321,0.0015325168,0.0012616693,0.0003054894,0.0011107437],"domain_scores_gemma":[0.9975544,0.0010877588,0.00016715025,0.00057556934,0.0003424863,0.00027260647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003045734,0.00073213194,0.0011424877,0.0020141357,0.0003455953,0.0002162199,0.0003650645,0.00041144708,0.0000037121806],"category_scores_gemma":[0.00015769782,0.00084191974,0.0002065058,0.006785438,0.000047216236,0.00034267278,0.00012379467,0.0005910157,0.0000022373563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028041686,0.00022296845,0.06354664,0.010079957,0.0005630746,0.0000087346525,0.011021326,0.85359746,0.0031302674,0.046569113,0.000027456012,0.010952588],"study_design_scores_gemma":[0.0016117841,0.00005053745,0.045363672,0.002299622,0.00026472364,0.000005617028,0.008804808,0.9390419,0.0014699062,0.00012361063,0.00012975863,0.00083404157],"about_ca_topic_score_codex":0.0021267948,"about_ca_topic_score_gemma":0.0020583752,"teacher_disagreement_score":0.544546,"about_ca_system_score_codex":0.0005319342,"about_ca_system_score_gemma":0.00017070289,"threshold_uncertainty_score":0.9994032},"labels":[],"label_agreement":null},{"id":"W7124264926","doi":"10.65109/dhhr9122","title":"Hierarchical Learning-based Graph Partition for Large-scale Vehicle Routing Problems","year":2025,"lang":"","type":"article","venue":"","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":"University of Alberta","funders":"","keywords":"Partition (number theory); Graph partition; Partition problem; Frequency partition of a graph; Graph","score_opus":0.014952014769874294,"score_gpt":0.2761065169035638,"score_spread":0.2611545021336895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124264926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009297534,0.00027325153,0.9781049,0.0016635571,0.00085128756,0.0013956385,0.000029803607,0.001161422,0.0072226115],"genre_scores_gemma":[0.76749665,0.000036660073,0.22776811,0.00043467668,0.00017460837,0.00027838317,0.000099212186,0.00012317968,0.003588542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995978,0.0005170719,0.0011209716,0.00080510677,0.00033204825,0.0012467878],"domain_scores_gemma":[0.99770266,0.0011058497,0.00017329436,0.0004851314,0.0003071215,0.00022592224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027085345,0.000524632,0.0006166468,0.0004528815,0.0008226987,0.00029113004,0.00032308945,0.0005005202,0.00034625115],"category_scores_gemma":[0.0009095624,0.0005845108,0.00042038612,0.0014941,0.0000827501,0.00023762046,0.000111848516,0.00095342804,0.00003353127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006354816,0.00020897234,0.0059291697,0.0007976151,0.000108569795,0.0000013158651,0.00045954625,0.9745864,0.0017540158,0.008952991,0.0005694487,0.006568406],"study_design_scores_gemma":[0.002918568,0.00016526136,0.0008574169,0.0004836933,0.00015824549,9.584843e-7,0.0002256023,0.97647977,0.007365056,0.001990231,0.00879864,0.00055656425],"about_ca_topic_score_codex":0.000018172104,"about_ca_topic_score_gemma":0.00003486231,"teacher_disagreement_score":0.7581991,"about_ca_system_score_codex":0.00021736049,"about_ca_system_score_gemma":0.00019316307,"threshold_uncertainty_score":0.9996606},"labels":[],"label_agreement":null},{"id":"W7125775515","doi":"10.21428/594757db.efbe03e5","title":"SPADE: Solving the Multi-Depot Vehicle Routing Problem with Inter-Depot Routes Using Multi-Agent Deep Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"","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":"University of Calgary","funders":"","keywords":"Reinforcement learning; Pooling; Vehicle routing problem; Graph; ENCODE; Heuristic; Transformer; Routing (electronic design automation)","score_opus":0.026794366581056366,"score_gpt":0.2785219176892571,"score_spread":0.2517275511082007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125775515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034450535,0.00018546464,0.960596,0.0001270248,0.00022272393,0.0006186734,2.9801097e-7,0.0010417731,0.0027574822],"genre_scores_gemma":[0.610486,0.000015159085,0.38824335,0.00009836805,0.000035749537,0.000029479861,0.0000031993582,0.00006642416,0.0010222952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977276,0.00020022718,0.0006853414,0.00041714008,0.000281221,0.0006884778],"domain_scores_gemma":[0.9989043,0.0002752103,0.0001533314,0.00042376097,0.00014589497,0.0000975224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009860367,0.0003956048,0.00033601877,0.00018320137,0.00059052,0.00030399428,0.00037131345,0.0001298753,0.00005934886],"category_scores_gemma":[0.00025098957,0.00029871147,0.000100029385,0.0006657633,0.000068220426,0.00029307537,0.00026573177,0.00066140445,0.000014964896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093265735,0.000023913251,0.016489135,0.0001015485,0.00013992403,0.0000052621695,0.0014920129,0.96877974,0.0073097833,0.0002455804,0.000009829138,0.0053939293],"study_design_scores_gemma":[0.0010049739,0.000030656196,0.0009689051,0.00035082534,0.000072025505,0.000009903156,0.0016371668,0.98442835,0.010895509,0.000005472793,0.00023067973,0.00036556512],"about_ca_topic_score_codex":0.00023319502,"about_ca_topic_score_gemma":0.00013432052,"teacher_disagreement_score":0.57603544,"about_ca_system_score_codex":0.00035895238,"about_ca_system_score_gemma":0.000058969537,"threshold_uncertainty_score":0.9999465},"labels":[],"label_agreement":null},{"id":"W7126372933","doi":"10.21428/594757db.52f0016b","title":"Edge-DIRECT: A Deep Reinforcement Learning-based Method for Solving Heterogeneous Electric Vehicle Routing Problem with Time Window Constraints","year":2024,"lang":"en","type":"article","venue":"","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":"University of Calgary","funders":"","keywords":"Vehicle routing problem; Focus (optics); Electric vehicle; Routing (electronic design automation); Reinforcement learning; Key (lock)","score_opus":0.00910362427285603,"score_gpt":0.24958747370837053,"score_spread":0.2404838494355145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126372933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015132986,0.00024771117,0.98687357,0.00006334252,0.000093924464,0.0008244853,0.000001561265,0.0025832418,0.0077988454],"genre_scores_gemma":[0.56883526,0.0000036937556,0.43001932,0.00006387694,0.00007328483,0.00012381529,0.000017962006,0.00013201335,0.00073081296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980485,0.00011019952,0.00045497445,0.00045012336,0.00025663016,0.00067955867],"domain_scores_gemma":[0.9986725,0.0007926231,0.000062540246,0.00021457451,0.00012205262,0.00013575234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012242775,0.00033587063,0.0003488513,0.0002577534,0.00019417601,0.00024739906,0.0001613505,0.00013420876,0.00029514136],"category_scores_gemma":[0.00015361032,0.00030923926,0.00012736267,0.0006830681,0.00003212035,0.00014643218,0.000027496648,0.0003317925,0.00004930077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020601427,0.000009598059,0.000046774774,0.00022922456,0.00014687754,0.000011923523,0.000222752,0.9445105,0.0204219,0.000111140725,0.000060477905,0.034208223],"study_design_scores_gemma":[0.0005825919,0.00020419137,0.0000049673986,0.00016039198,0.000081133316,0.000034964796,0.000021473323,0.9308944,0.06716356,0.000021277583,0.00044217467,0.00038889574],"about_ca_topic_score_codex":0.00000888201,"about_ca_topic_score_gemma":0.0000040268537,"teacher_disagreement_score":0.56732196,"about_ca_system_score_codex":0.00023915274,"about_ca_system_score_gemma":0.00011890148,"threshold_uncertainty_score":0.999936},"labels":[],"label_agreement":null},{"id":"W7126417008","doi":"10.21428/594757db.0ea536db","title":"Genetic Algorithm and Loading Strategy for the DynamicVehicle Routing Problem with Simultaneous Pickup and Delivery","year":2024,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; Vehicle routing problem; Routing (electronic design automation); Scheduling (production processes); Genetic algorithm; Memetic algorithm; Job shop scheduling","score_opus":0.011596546851299691,"score_gpt":0.23999088580733033,"score_spread":0.22839433895603065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126417008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056064863,0.0019181141,0.9407928,0.000056902525,0.00005271655,0.00034720602,0.0000055787855,0.00042781897,0.0003339901],"genre_scores_gemma":[0.616051,0.000107916225,0.38357103,0.000015274496,0.000040172014,0.000016644066,0.0000011037928,0.000037643964,0.00015918049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932516,0.000019737228,0.00015204557,0.00020601042,0.00007630991,0.00022074947],"domain_scores_gemma":[0.9990095,0.0007968263,0.000012560029,0.000095941316,0.000035321653,0.000049853817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022249414,0.00013829317,0.00010658182,0.00004227502,0.00013015597,0.00024865638,0.00005765472,0.000051002287,0.000008086715],"category_scores_gemma":[0.00001779303,0.00009469003,0.000016114625,0.0001435572,0.000039888197,0.00009358403,0.000026502437,0.000120400735,0.0000012128735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017262566,0.0000015894981,0.00011376095,0.0000838847,0.00004510108,0.000007715462,0.00021351046,0.71789527,0.00032208988,0.00018979418,0.000010104511,0.28111547],"study_design_scores_gemma":[0.00017942066,0.000054377175,0.00018444551,0.00005888002,0.00004699759,0.000078046665,0.0002708284,0.9985062,0.00021084373,0.00011309039,0.00014792544,0.00014894741],"about_ca_topic_score_codex":0.000029521576,"about_ca_topic_score_gemma":0.000015179927,"teacher_disagreement_score":0.5599862,"about_ca_system_score_codex":0.00003187408,"about_ca_system_score_gemma":0.000017687074,"threshold_uncertainty_score":0.38613474},"labels":[],"label_agreement":null},{"id":"W7132997671","doi":"","title":"Calibration of the aggregate transit assignment model of EMME/2 using genetic algorithms","year":2003,"lang":"","type":"dissertation","venue":"TSpace","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":"Bibliographical Society of Canada","funders":"","keywords":"Calibration; Aggregate (composite); Set (abstract data type); Genetic algorithm; Goodness of fit","score_opus":0.03995598545810222,"score_gpt":0.3179381604429164,"score_spread":0.27798217498481415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132997671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18591098,0.0007873799,0.8113757,0.00005260577,0.00059256086,0.00065021525,0.000023488656,0.000027790873,0.0005792663],"genre_scores_gemma":[0.44396824,0.0003267098,0.5524137,0.000016005904,0.000051310235,0.000018173292,0.000042752054,0.00020263638,0.0029604945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695027,0.00044279426,0.0011261918,0.000421023,0.0006735905,0.00038615303],"domain_scores_gemma":[0.99793226,0.00010935779,0.00092307973,0.00068609096,0.00025325242,0.00009597589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047979318,0.0005122697,0.0007219558,0.0001897925,0.00013970662,0.00003442103,0.00036093136,0.00053147733,0.00013419658],"category_scores_gemma":[0.000110465684,0.00050232065,0.00031833616,0.0007001163,0.000080302714,0.00011388456,0.00002536589,0.00041897284,8.1699534e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017911707,0.000045232653,0.00006499818,0.0006834568,0.00011834497,3.6478073e-7,0.0076473868,0.83206934,0.15781464,0.00009827636,0.0000053996055,0.0014346235],"study_design_scores_gemma":[0.00038651642,0.000026158245,0.0000913189,0.0005555654,0.00034519122,0.0000023973082,0.0006830753,0.74272174,0.25477445,0.00010540908,0.00000210767,0.00030607072],"about_ca_topic_score_codex":0.000158225,"about_ca_topic_score_gemma":0.000011803745,"teacher_disagreement_score":0.258962,"about_ca_system_score_codex":0.00020957713,"about_ca_system_score_gemma":0.00033585785,"threshold_uncertainty_score":0.99974287},"labels":[],"label_agreement":null},{"id":"W7134867000","doi":"","title":"Group-Consistent Dial-a-Ride solved with Adaptive Large Neighborhood Search,","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Vehicle Routing Optimization Methods","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":"Toronto Metropolitan University","funders":"","keywords":"Noise (video); Constraint (computer-aided design); Stability (learning theory); Identification (biology); Intersection (aeronautics)","score_opus":0.021749589117367518,"score_gpt":0.2581056141781455,"score_spread":0.23635602506077796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7134867000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002200333,0.00025558475,0.9301268,0.00011760505,0.0006346867,0.0007439821,0.00015785557,0.0015105465,0.0642526],"genre_scores_gemma":[0.5132134,0.00016549873,0.48332214,0.00018413125,0.00021582648,0.00017834958,0.00016772318,0.00013999903,0.0024129427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976271,0.0002117772,0.00047896302,0.0006387761,0.00040606802,0.0006373242],"domain_scores_gemma":[0.9984203,0.00027239672,0.00007531008,0.00084981346,0.00019999425,0.00018219584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006611012,0.0005371062,0.00063513126,0.00026944804,0.0001039632,0.00012827378,0.000438832,0.00041470764,0.00022954211],"category_scores_gemma":[0.000074219206,0.0004917561,0.00018567921,0.0003379087,0.00004987294,0.00008585837,0.00068844453,0.0011809441,0.000029119603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053719836,0.00008248203,0.0012712833,0.0004500326,0.00064653216,0.000028296114,0.00055331585,0.9807994,0.00007654808,0.011093148,0.0006975006,0.0042477595],"study_design_scores_gemma":[0.00097536744,0.000057771264,0.0010436518,0.0004487327,0.00015951523,0.00000582438,0.00028780813,0.9939986,0.0012161467,0.0005099524,0.0005226024,0.00077403785],"about_ca_topic_score_codex":0.0000898791,"about_ca_topic_score_gemma":0.00011704182,"teacher_disagreement_score":0.51101303,"about_ca_system_score_codex":0.0002824551,"about_ca_system_score_gemma":0.00019530256,"threshold_uncertainty_score":0.9997534},"labels":[],"label_agreement":null},{"id":"W7151055761","doi":"10.70675/4d1089f4zbdfez444bzb573ze5f15d05bc38","title":"Towards the conception of a Supply Chain efficient and sustainable in the Aeronautic industry - Airbus case study","year":2021,"lang":"","type":"dissertation","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"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":"Supply chain; Sugar industry; Umwelt; Production system (computer science)","score_opus":0.02057533524170215,"score_gpt":0.3019620660113096,"score_spread":0.28138673076960746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7151055761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864774,0.0011092927,0.007639982,0.00029910196,0.00028691912,0.0028252162,0.0000069063262,0.00003726643,0.0013179323],"genre_scores_gemma":[0.9964139,0.00006141364,0.0014331503,0.000039943927,0.000074999865,0.00022992757,0.00006174328,0.00006808787,0.0016168305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9950772,0.001954631,0.0011237086,0.00057259854,0.0006128655,0.0006589866],"domain_scores_gemma":[0.9976103,0.00091099157,0.00030842982,0.00070560817,0.00038525896,0.000079428115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005000478,0.0005269826,0.0006577538,0.0003005223,0.00039459832,0.00022773899,0.00038141428,0.0007095954,0.00035423978],"category_scores_gemma":[0.0008046236,0.0003715699,0.00011055458,0.0017192209,0.00013241629,0.0000860893,0.00014492699,0.0017873232,0.0000010898457],"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.000039218066,0.0005181608,0.004809184,0.00070353766,0.0001323951,0.0012115245,0.12573773,0.85903484,0.000062692045,0.002352833,0.00001658623,0.005381307],"study_design_scores_gemma":[0.0010274216,0.00018318085,0.012801892,0.00015647186,0.00020275175,0.0003238251,0.6001955,0.38464376,0.00015598963,0.00001664742,0.000008776549,0.00028372934],"about_ca_topic_score_codex":0.004855373,"about_ca_topic_score_gemma":0.000980605,"teacher_disagreement_score":0.4744578,"about_ca_system_score_codex":0.0002499561,"about_ca_system_score_gemma":0.0003706278,"threshold_uncertainty_score":0.99987364},"labels":[],"label_agreement":null},{"id":"W7164345423","doi":"10.5281/zenodo.20637942","title":"Graph Theory in Daily Life: Using Small-Scale Graphs to Optimize School Bus Routing","year":2015,"lang":"en","type":"article","venue":"Open MIND","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":"Impact","funders":"","keywords":"Graph theory; Graph; Heuristic; Scalability; Vehicle routing problem; Routing (electronic design automation); Intersection (aeronautics); School bus","score_opus":0.07304150779660866,"score_gpt":0.3158904307719233,"score_spread":0.24284892297531463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7164345423","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7449195,0.00013360426,0.23824392,0.000054230753,0.00031108467,0.0005740236,0.000008046372,0.00003515984,0.01572043],"genre_scores_gemma":[0.30470964,0.000004449831,0.69483787,0.000079102094,0.000053291835,0.000016891934,0.0000063893253,0.00006299522,0.00022937081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982789,0.0002641919,0.00045769368,0.00036607904,0.00018327871,0.0004498146],"domain_scores_gemma":[0.9988313,0.000121545134,0.00006272441,0.00042403507,0.00008734084,0.0004730668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025420417,0.00023140738,0.00033365915,0.00029702685,0.00007433397,0.00029341955,0.0005995736,0.00013514076,0.0003244094],"category_scores_gemma":[0.0007074167,0.0002561954,0.00005308335,0.0011041041,0.000028369004,0.00033475916,0.00027633802,0.00028870444,0.00015617529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040372764,0.000022677383,0.0049331076,0.0000057969983,0.000023354924,0.000010073242,0.0015184315,0.97772765,0.0013166654,0.00003824422,0.00011217083,0.014251427],"study_design_scores_gemma":[0.0034490388,0.000086546075,0.0032225666,0.00031894376,0.00008373232,0.000032546286,0.0043908656,0.9757839,0.008576093,0.0010085909,0.0017314026,0.001315772],"about_ca_topic_score_codex":0.00009475691,"about_ca_topic_score_gemma":0.0000553257,"teacher_disagreement_score":0.45659396,"about_ca_system_score_codex":0.00014563634,"about_ca_system_score_gemma":0.00012935525,"threshold_uncertainty_score":0.99998903},"labels":[],"label_agreement":null},{"id":"W7164389602","doi":"10.5281/zenodo.20637943","title":"Graph Theory in Daily Life: Using Small-Scale Graphs to Optimize School Bus Routing","year":2015,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","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":"Impact","funders":"","keywords":"Graph theory; Graph; Heuristic; Scalability; Vehicle routing problem; Routing (electronic design automation); Intersection (aeronautics); School bus","score_opus":0.05789884959224535,"score_gpt":0.26472750839226294,"score_spread":0.2068286588000176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7164389602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.257441,0.00020721988,0.6835136,0.00022198731,0.00036216248,0.00084983057,0.00006162417,0.0030245418,0.054318007],"genre_scores_gemma":[0.85326856,0.00005214707,0.14243163,0.000312042,0.00020502068,2.180324e-7,0.00024156232,0.003195647,0.00029317755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758863,0.000682321,0.00042784092,0.00040805485,0.00033751116,0.00055563136],"domain_scores_gemma":[0.99836624,0.000052488795,0.00006760086,0.0004895226,0.00041951714,0.0006046441],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0025792008,0.00021797672,0.00023728462,0.0006237843,0.0006085053,0.0005742363,0.0008158148,0.0001068125,0.0012005013],"category_scores_gemma":[0.0023852782,0.00025807554,0.00005580577,0.0019019508,0.00007155685,0.00028703842,0.00064896734,0.00041951865,0.0012793607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095640135,0.00007209579,0.00013583252,0.00005617405,0.000048980484,0.000016201715,0.0030044739,0.9616325,0.0048220786,0.0017067184,0.009087453,0.019321863],"study_design_scores_gemma":[0.0055518174,0.0004834367,0.003649975,0.00045165373,0.00010180067,0.00028190063,0.0068599456,0.82433355,0.0032901797,0.0029085223,0.14986862,0.0022185866],"about_ca_topic_score_codex":0.000023136576,"about_ca_topic_score_gemma":7.5092606e-7,"teacher_disagreement_score":0.5958275,"about_ca_system_score_codex":0.00030759262,"about_ca_system_score_gemma":0.000011343957,"threshold_uncertainty_score":0.9999871},"labels":[],"label_agreement":null},{"id":"W767970607","doi":"10.1007/s00170-015-7420-8","title":"Meta-heuristic solution approaches for robust single allocation p-hub median problem with stochastic demands and travel times","year":2015,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"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":"Mathematical optimization; Heuristic; Meta heuristic; Computer science; Operations research; Mathematics","score_opus":0.06360452788071073,"score_gpt":0.25358489125543643,"score_spread":0.18998036337472568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W767970607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04660974,0.0004614102,0.9493263,0.0029762979,0.00022063116,0.00021088202,0.0000042865186,0.000107725034,0.00008276159],"genre_scores_gemma":[0.6556289,0.000020754505,0.34418836,0.000014613234,0.00006750685,0.00002469458,0.000004427181,0.000023433091,0.000027273152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.000023895285,0.00034114695,0.00012343586,0.00025081006,0.00016491789],"domain_scores_gemma":[0.99916756,0.00016752291,0.00024885705,0.0001230134,0.00023907683,0.00005399134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000527857,0.00015178722,0.00025079143,0.00029478341,0.000050862553,0.000037823444,0.00036599312,0.00008480462,0.0000027334286],"category_scores_gemma":[0.00016712,0.000104379294,0.0000471395,0.000080280646,0.000114203904,0.00020616311,0.000047308145,0.00022036511,6.7208737e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086863125,0.000021308111,0.000004557435,0.000014973893,0.00057706423,0.0000026218709,0.0001943437,0.9791395,0.001378302,0.00086748216,0.00004387961,0.017669084],"study_design_scores_gemma":[0.0032640703,0.0007086632,0.00012753901,0.00014747072,0.0010804855,0.0012424234,0.0011348556,0.7661548,0.16273738,0.062552825,0.00040144278,0.00044802355],"about_ca_topic_score_codex":0.0000012950973,"about_ca_topic_score_gemma":0.000007361998,"teacher_disagreement_score":0.6090192,"about_ca_system_score_codex":0.00014344497,"about_ca_system_score_gemma":0.000033961922,"threshold_uncertainty_score":0.4256464},"labels":[],"label_agreement":null},{"id":"W834673113","doi":"10.1016/j.asoc.2015.06.035","title":"Customer satisfaction in dynamic vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Customer satisfaction; Vehicle routing problem; Mathematical optimization; Genetic algorithm; Scheduling (production processes); Plan (archaeology); Routing (electronic design automation); Operations research; Machine learning; Engineering; Embedded system; Marketing; Mathematics","score_opus":0.009919678541106057,"score_gpt":0.2320866207892608,"score_spread":0.22216694224815473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W834673113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5917758,0.000028548326,0.39336768,0.000025887262,0.000091427115,0.0004071631,9.342107e-7,0.0010845567,0.01321803],"genre_scores_gemma":[0.8140664,6.502829e-7,0.18573676,0.000034459998,0.000041890227,0.000010670051,0.00000740231,0.00007278827,0.000028970064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856156,0.000059344176,0.0003789709,0.00029709737,0.00025478145,0.0004482639],"domain_scores_gemma":[0.99938565,0.00014693792,0.000090128175,0.00020896942,0.000053449752,0.00011485295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348523,0.00022719937,0.00027266852,0.00015778637,0.00008508949,0.00006814755,0.00012686866,0.00011047044,0.000009528872],"category_scores_gemma":[0.000029821105,0.00023868728,0.00002347002,0.0006189041,0.00002964724,0.0001260287,0.00006182967,0.00036008272,0.0001547876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012033275,0.000009692766,0.010879849,0.000023767172,0.000016121829,0.0000036215533,0.0010409411,0.9461444,0.0027971622,0.00013065392,0.00003514791,0.038906634],"study_design_scores_gemma":[0.0009814205,0.000015914276,0.0066381167,0.00006212035,0.000010314133,0.0000113088945,0.00021080098,0.9912272,0.00036269316,0.000098706194,0.00007334338,0.00030803698],"about_ca_topic_score_codex":0.000033641656,"about_ca_topic_score_gemma":0.000020314214,"teacher_disagreement_score":0.22229062,"about_ca_system_score_codex":0.00030277003,"about_ca_system_score_gemma":0.000043976164,"threshold_uncertainty_score":0.9733385},"labels":[],"label_agreement":null},{"id":"W913363275","doi":"10.1016/j.trc.2015.06.019","title":"An adaptive large neighborhood search heuristic for fleet deployment problems with voyage separation requirements","year":2015,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"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; Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Norges Forskningsråd","keywords":"Heuristic; Computer science; Scheduling (production processes); Schedule; Computation; Mathematical optimization; Software deployment; Separation (statistics); Vehicle routing problem; Operations research; Routing (electronic design automation); Real-time computing; Algorithm; Artificial intelligence; Engineering; Mathematics; Machine learning; Computer network","score_opus":0.14532489720753686,"score_gpt":0.41015516414556025,"score_spread":0.26483026693802336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W913363275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12772745,0.00023224756,0.8657166,0.00037740672,0.0001065666,0.001784113,0.000112727146,0.0035994311,0.00034350675],"genre_scores_gemma":[0.9220857,0.00009390407,0.07645886,0.000006980654,0.000034101475,0.00086587935,0.0002825822,0.00008680948,0.00008516198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723554,0.00015787312,0.00043837677,0.00046027257,0.00089778577,0.0008101544],"domain_scores_gemma":[0.99840766,0.0001391936,0.000058515318,0.0004950586,0.0007601957,0.00013937886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022831925,0.00024020596,0.00024825553,0.00048083675,0.00028219033,0.00009041497,0.00040234576,0.00017817295,0.000013220854],"category_scores_gemma":[0.00015240186,0.00022761122,0.000040194547,0.0010211385,0.00014108114,0.0005235844,0.000015298563,0.0004361288,0.000012014729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024479366,0.00020652868,0.0088298945,0.00025645003,0.00012493333,0.000014604342,0.0034577504,0.96680826,0.0020393457,0.010180542,0.0019757976,0.005861076],"study_design_scores_gemma":[0.0025015702,0.0017995585,0.0012469786,0.00021661821,0.000048346366,0.0000013477187,0.010900939,0.95319927,0.02132218,0.0038180118,0.004353329,0.0005918569],"about_ca_topic_score_codex":0.000029628172,"about_ca_topic_score_gemma":0.00022207391,"teacher_disagreement_score":0.79435825,"about_ca_system_score_codex":0.00021716778,"about_ca_system_score_gemma":0.00011301768,"threshold_uncertainty_score":0.92817163},"labels":[],"label_agreement":null}]}