{"meta":{"query_hash":"19c8beb56947","filters":{"venue":"Computers & Operations Research"},"cohort_total":270,"direct_labels_cover":1,"predictions_cover":270,"exported":270,"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/19c8beb56947","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computers+%26+Operations+Research"},"results":[{"id":"W1505364470","doi":"10.1016/j.cor.2004.08.004","title":"Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Variation (astronomy); Mathematical optimization; Product (mathematics); Minimax; Mathematics; Linear bottleneck assignment problem; Generalized assignment problem; Computer science; Assignment problem; Mathematical economics; Weapon target assignment problem","score_opus":0.023462664608697597,"score_gpt":0.29633936979406705,"score_spread":0.27287670518536944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505364470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06153194,0.0005627855,0.92518866,0.00059294933,0.00010458544,0.00009259458,0.00021506927,0.00038044128,0.011330994],"genre_scores_gemma":[0.73083353,0.0006487097,0.2498585,0.00022596473,0.00019099149,0.00024470038,0.00054496434,0.0004008983,0.017051818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991924,0.00036465863,0.00002226278,0.00018580303,0.0001012181,0.00013357186],"domain_scores_gemma":[0.9990682,0.00061283214,0.00009354368,0.000059321723,0.00009613332,0.00007012529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018643679,0.0010167152,0.0014122637,0.00066434155,0.0004867922,0.0017187487,0.0017181368,0.0016394414,0.0063546193],"category_scores_gemma":[0.0037797904,0.0007259114,0.0006828516,0.0010768131,0.0006024058,0.0016931277,0.0011044113,0.001327968,0.0005852308],"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.00019416973,0.00009672901,0.00040021606,0.00022389501,0.00004558626,0.000085822125,0.00005960631,0.92839235,0.0021370642,0.023903953,0.0038000299,0.04066053],"study_design_scores_gemma":[0.00001913728,0.000056230005,0.00015067733,0.000008273843,0.000010374341,0.00002848128,0.000020937807,0.98514485,0.00061011314,0.012753401,0.0011904676,0.0000069903163],"about_ca_topic_score_codex":0.0038713545,"about_ca_topic_score_gemma":0.002877769,"teacher_disagreement_score":0.0063546193,"about_ca_system_score_codex":0.00079492014,"about_ca_system_score_gemma":0.0015371068,"threshold_uncertainty_score":0.021258354},"labels":[],"label_agreement":null},{"id":"W167913457","doi":"10.1016/j.cor.2004.06.004","title":"Special issue on game theory: Numerical methods and applications","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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; Group for Research in Decision Analysis","funders":"","keywords":"Dilemma; Game theory; Computer science; Interval (graph theory); Mathematical economics; Prisoner's dilemma; Ethical egoism; Management science; Operations research; Mathematical optimization; Mathematics; Psychology; Economics; Social psychology","score_opus":0.05229754288424358,"score_gpt":0.4358078793459811,"score_spread":0.3835103364617375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167913457","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038820389,0.06391153,0.27877694,0.02595682,0.38976532,0.0003527526,0.0014363353,0.0011536694,0.23476467],"genre_scores_gemma":[0.0415986,0.05738476,0.07683841,0.0057346434,0.27098933,0.0007895188,0.0024854569,0.0019150611,0.5422642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899274,0.00028260486,0.00006733644,0.00019758842,0.00039301784,0.00006679376],"domain_scores_gemma":[0.997472,0.0010578794,0.000117140815,0.00034095495,0.0007102477,0.00030181196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013030469,0.0019373584,0.0034963076,0.0021980423,0.0009308135,0.0046075573,0.0018778604,0.0030283374,0.08121833],"category_scores_gemma":[0.0051174276,0.00054970104,0.0016086586,0.0027951263,0.0012422854,0.003129415,0.0014762159,0.0035114065,0.02277136],"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.000047485315,0.00011600815,0.0001597513,0.00046634884,0.000070509544,0.000102529644,0.000041595635,0.0068643275,0.0004979944,0.110891186,0.7919072,0.08883507],"study_design_scores_gemma":[0.000059932776,0.00007789464,0.00054840883,0.00024983377,0.00007648607,0.00039047102,0.000060551058,0.041516747,0.0004519787,0.24661498,0.70991224,0.00004044371],"about_ca_topic_score_codex":0.0008817989,"about_ca_topic_score_gemma":0.0012001347,"teacher_disagreement_score":0.08121833,"about_ca_system_score_codex":0.0010795945,"about_ca_system_score_gemma":0.0014534282,"threshold_uncertainty_score":0.2717024},"labels":[],"label_agreement":null},{"id":"W1897909895","doi":"10.1016/j.cor.2015.05.018","title":"Optimizing horizontal alignment of roads in a specified corridor","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Infrastructure Maintenance and Monitoring","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Horizontal and vertical; Earthworks; Mathematical optimization; Computer science; Optimization problem; Quadratic equation; Quadratic programming; Algorithm; Mathematics; Geometry; Engineering","score_opus":0.07240233199696892,"score_gpt":0.328413703094025,"score_spread":0.2560113710970561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897909895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62598413,0.0002101861,0.3607346,0.00023584961,0.00004828896,0.00023232833,0.00048202166,0.0010431873,0.011029467],"genre_scores_gemma":[0.9068396,0.00006596711,0.090156734,0.000023388075,0.000008451379,0.00006231243,0.00038232616,0.00010743832,0.0023539015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996761,0.00006861583,0.000014394776,0.00008710966,0.000047498754,0.00010625857],"domain_scores_gemma":[0.9994282,0.00020046528,0.000105834915,0.000055182183,0.00012761941,0.00008268034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004242144,0.00086649734,0.00080316694,0.00082172244,0.0005300736,0.0008720385,0.0007814953,0.0007265751,0.004663429],"category_scores_gemma":[0.0017699922,0.00045939698,0.00045038402,0.0010366989,0.0003355278,0.0007362005,0.0007881765,0.00055040774,0.00065324124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024982655,0.0001327244,0.0038218596,0.000058008492,0.00003232701,0.000057112586,0.000065997054,0.92783827,0.005993753,0.0018249354,0.001004473,0.05892069],"study_design_scores_gemma":[0.00002685216,0.00023183922,0.001345854,0.0000075414578,0.00001840239,0.000018328126,0.00010850915,0.99375534,0.0029814674,0.0010371612,0.00046140715,0.0000073150445],"about_ca_topic_score_codex":0.011757104,"about_ca_topic_score_gemma":0.016430743,"teacher_disagreement_score":0.011757104,"about_ca_system_score_codex":0.0008672321,"about_ca_system_score_gemma":0.0017043899,"threshold_uncertainty_score":0.023377359},"labels":[],"label_agreement":null},{"id":"W1964065477","doi":"10.1016/j.cor.2011.01.015","title":"Optimal search path for service in the presence of disruptions","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 Toronto","funders":"","keywords":"Computer science; Path (computing); Heuristic; Facility location problem; Node (physics); Mathematical optimization; Set (abstract data type); Service (business); Dynamic programming; Flow network; State (computer science); Operations research; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.1976220243980266,"score_gpt":0.3627047899932483,"score_spread":0.1650827655952217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964065477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5572154,0.0015747459,0.40890276,0.004645498,0.00016602805,0.00029353006,0.0012743485,0.0006654734,0.02526234],"genre_scores_gemma":[0.95051765,0.00029833821,0.04209674,0.000113513,0.00003745904,0.00006780537,0.00045885012,0.00008287572,0.006326687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963665,0.00010959777,0.000014016772,0.00006534946,0.00004625021,0.0001280525],"domain_scores_gemma":[0.9977754,0.0016402227,0.00013964341,0.00004326512,0.00020538589,0.0001960215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074338366,0.0005959683,0.0013195053,0.0017845597,0.00062610616,0.0015000341,0.0009041202,0.002008768,0.0093442695],"category_scores_gemma":[0.006067673,0.0006715127,0.0005951163,0.0011687519,0.0006664371,0.0017996724,0.0009228688,0.0010729914,0.00064763153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007889515,0.000097585464,0.0021949906,0.000118886324,0.0000560739,0.00020550493,0.00016153681,0.95209897,0.00096963637,0.013306957,0.0040481817,0.025952788],"study_design_scores_gemma":[0.000039231967,0.000061611165,0.00042685642,0.0000128611955,0.000014128938,0.000037686154,0.00011943944,0.99096256,0.00016500965,0.0077235424,0.00042940295,0.000007657516],"about_ca_topic_score_codex":0.016266897,"about_ca_topic_score_gemma":0.009034442,"teacher_disagreement_score":0.016266897,"about_ca_system_score_codex":0.0012889735,"about_ca_system_score_gemma":0.002851097,"threshold_uncertainty_score":0.0323444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028904596,0.00044054008,0.9669146,0.00030191953,0.000095398864,0.00009452349,0.00004747336,0.000092795104,0.0031081873],"genre_scores_gemma":[0.510777,0.0004685224,0.48043808,0.00016221887,0.00013820585,0.00048328703,0.0001938671,0.00009386108,0.0072449343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995436,0.00021691762,0.000018176877,0.00008347516,0.00010265535,0.000035031437],"domain_scores_gemma":[0.99850214,0.0011294053,0.00009536699,0.000049029895,0.00015762319,0.0000665369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015428587,0.00062027836,0.0013220898,0.0009204272,0.00057298166,0.00073565036,0.0018439244,0.0017680512,0.0024414768],"category_scores_gemma":[0.0044092447,0.0006789303,0.00076019234,0.0008738068,0.0007858142,0.0015403265,0.0014335649,0.0009025391,0.0002098757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008573439,0.000057792564,0.00028009052,0.000055702094,0.000025570955,0.00004172272,0.000032232336,0.969842,0.0005952917,0.009063426,0.0010249873,0.018895393],"study_design_scores_gemma":[0.0000082797005,0.000014199638,0.000020010268,0.0000020649409,0.0000026448552,0.0000043874843,0.000003215449,0.9987852,0.000028623883,0.0010030748,0.000126546,0.0000017179113],"about_ca_topic_score_codex":0.006644996,"about_ca_topic_score_gemma":0.005961586,"teacher_disagreement_score":0.006644996,"about_ca_system_score_codex":0.0007595519,"about_ca_system_score_gemma":0.0009325391,"threshold_uncertainty_score":0.013212621},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019426614,0.00033861474,0.99458015,0.0002130422,0.000051593997,0.000048470753,0.000047733258,0.000118166296,0.002659584],"genre_scores_gemma":[0.078083165,0.00096751854,0.9139772,0.00016665256,0.0002099996,0.0003598607,0.00035536545,0.000306414,0.0055737305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861705,0.0005530927,0.000055094242,0.00017783299,0.0004944396,0.00010245129],"domain_scores_gemma":[0.9971317,0.0021413811,0.00012841918,0.00020342431,0.00032393352,0.00007118217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030597565,0.0014586952,0.001784766,0.0017043751,0.00095332734,0.0017293387,0.0020141744,0.0021735788,0.0059828307],"category_scores_gemma":[0.010554064,0.0008642652,0.0013521673,0.0030570521,0.0012242019,0.00384171,0.002556513,0.0032931687,0.0013618247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017095315,0.00023666768,0.00033781602,0.0004034239,0.000057588702,0.00014576926,0.0001974843,0.54048795,0.00510691,0.2195599,0.016387943,0.21690759],"study_design_scores_gemma":[0.000017361865,0.000029957413,0.00008529045,0.000021030228,0.000014791406,0.00006815697,0.000014419471,0.95652056,0.0005201585,0.040085625,0.0026129847,0.000009653992],"about_ca_topic_score_codex":0.0028551817,"about_ca_topic_score_gemma":0.0031960132,"teacher_disagreement_score":0.0059828307,"about_ca_system_score_codex":0.0011313241,"about_ca_system_score_gemma":0.0016490717,"threshold_uncertainty_score":0.020014524},"labels":[],"label_agreement":null},{"id":"W1973420752","doi":"10.1016/j.cor.2013.11.005","title":"Models and strategies for efficiently determining an optimal vertical alignment of roads","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":57,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Earthworks; Computer science; Integer programming; Mathematical optimization; Piecewise; Quadratic programming; Terrain; Piecewise linear function; Quadratic equation; Linear programming; Horizontal and vertical; Flow (mathematics); Task (project management); Algorithm; Mathematics; Engineering","score_opus":0.0521115864985101,"score_gpt":0.33712290997614125,"score_spread":0.28501132347763114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973420752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01616083,0.0002717771,0.9781058,0.0004226077,0.00004284542,0.00008181041,0.00033707122,0.00040495925,0.0041722953],"genre_scores_gemma":[0.5214,0.00082392833,0.4695996,0.0001474374,0.00009802304,0.0005955147,0.0010946384,0.00026476342,0.0059761005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994242,0.00019164152,0.000037179576,0.00014128495,0.00011559253,0.00009018286],"domain_scores_gemma":[0.99754,0.0016990738,0.00022966521,0.00012916265,0.00030977864,0.00009236228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001277792,0.0015967345,0.0018762033,0.0017175457,0.0008572731,0.0029393241,0.0029260155,0.0028863528,0.0068814475],"category_scores_gemma":[0.0067826654,0.0016729085,0.0012306009,0.0016631434,0.0010491707,0.0035222084,0.0015754828,0.0019752835,0.0009686397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010644191,0.000009953073,0.00010458946,0.000015083859,0.000005235002,0.0000074445893,0.000010211672,0.9903032,0.00007843824,0.004757838,0.0002817731,0.0044155316],"study_design_scores_gemma":[0.0000044909984,0.0000041163366,0.000018971625,0.000004310232,0.0000033388878,0.0000024887515,0.0000068600734,0.99392563,0.00006447187,0.0058059758,0.00015633735,0.0000030883227],"about_ca_topic_score_codex":0.027658015,"about_ca_topic_score_gemma":0.025188088,"teacher_disagreement_score":0.027658015,"about_ca_system_score_codex":0.002050314,"about_ca_system_score_gemma":0.0031414097,"threshold_uncertainty_score":0.054994047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060918913,0.0000363114,0.99298334,0.00002447556,0.000013195958,0.000019647317,0.000021276865,0.00041143407,0.00039838935],"genre_scores_gemma":[0.49923822,0.00009270144,0.4973246,0.00007781189,0.000039480634,0.00027803273,0.00034872172,0.00039516023,0.0022052894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934644,0.0002228224,0.000032636173,0.00018336634,0.00015846531,0.000056312976],"domain_scores_gemma":[0.9985454,0.00065629464,0.00011924358,0.00025574554,0.0003673476,0.000056013094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009197964,0.0007133061,0.0016202435,0.00084427703,0.00071263814,0.0007619925,0.0018587019,0.0010425086,0.002123455],"category_scores_gemma":[0.003503297,0.00091925845,0.0012406192,0.0005666537,0.00071554567,0.0014660493,0.0014075408,0.0010573021,0.0007673476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109305365,0.000084928935,0.00065426243,0.000061031697,0.00006417519,0.000029797,0.000054777684,0.8725647,0.004395699,0.0075353244,0.0017738579,0.11267212],"study_design_scores_gemma":[0.0000034340808,0.000009259682,0.000027404127,0.0000011649004,0.000002885018,0.000005486609,0.0000020349514,0.998206,0.00035635734,0.0012763735,0.00010774881,0.0000018524893],"about_ca_topic_score_codex":0.004318436,"about_ca_topic_score_gemma":0.0073106224,"teacher_disagreement_score":0.004318436,"about_ca_system_score_codex":0.00067974115,"about_ca_system_score_gemma":0.0011969096,"threshold_uncertainty_score":0.008586645},"labels":[],"label_agreement":null},{"id":"W1975651401","doi":"10.1016/j.cor.2007.02.005","title":"Exact algorithms for the joint object placement and request routing problem in content distribution networks","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Caching and Content Delivery","field":"Computer Science","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":"University of Alberta; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Routing (electronic design automation); Algorithm; Mathematical optimization; Linear programming relaxation; Network topology; The Internet; Integer programming; Server; Linear programming; Computer network; Distributed computing; Mathematics","score_opus":0.13321440428502873,"score_gpt":0.35558244196043476,"score_spread":0.22236803767540603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975651401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03173213,0.0014605235,0.95667136,0.0011986329,0.00019098139,0.00020757105,0.00036442815,0.0015089937,0.0066652857],"genre_scores_gemma":[0.41935807,0.0010897215,0.56926763,0.00030880692,0.0003095668,0.00045261587,0.0009417666,0.0004565344,0.007815256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973711,0.0008639699,0.000141838,0.00041031232,0.0006685226,0.00054427265],"domain_scores_gemma":[0.9886312,0.00873932,0.00060285773,0.0010005266,0.0006897164,0.00033645314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041918173,0.001773514,0.003104547,0.0017073058,0.0017439058,0.004002078,0.004471073,0.0030495452,0.008728375],"category_scores_gemma":[0.016075315,0.0017496779,0.0011579049,0.0039918707,0.002258508,0.0065671103,0.0030596417,0.0027023454,0.0015090866],"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.00042373655,0.00021443666,0.00067268574,0.00023273041,0.00005650265,0.000048366164,0.00018957152,0.8580549,0.0007512558,0.036567144,0.007875493,0.094913244],"study_design_scores_gemma":[0.000104720064,0.000034825705,0.00012806867,0.000010013909,0.000018439874,0.000021064561,0.000048720307,0.9601109,0.00025855485,0.038551386,0.0007036348,0.000009661531],"about_ca_topic_score_codex":0.01765564,"about_ca_topic_score_gemma":0.01895993,"teacher_disagreement_score":0.01765564,"about_ca_system_score_codex":0.0048368042,"about_ca_system_score_gemma":0.005540451,"threshold_uncertainty_score":0.035105765},"labels":[],"label_agreement":null},{"id":"W1975774078","doi":"10.1016/j.cor.2014.08.014","title":"A two level metaheuristic for the operating room scheduling and assignment problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":170,"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; Ministero dell’Istruzione, dell’Università e della Ricerca; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Time horizon; Computer science; Scheduling (production processes); Mathematical optimization; Metaheuristic; Job shop scheduling; Operations research; Artificial intelligence; Mathematics; Routing (electronic design automation)","score_opus":0.3131475908905606,"score_gpt":0.5271075438563544,"score_spread":0.2139599529657938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975774078","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051756028,0.00062989927,0.9314025,0.00082797627,0.00030017385,0.0002790802,0.0002767405,0.00078566617,0.013741908],"genre_scores_gemma":[0.32695594,0.0002978263,0.6637032,0.0006276331,0.00016150833,0.00062305835,0.0004064767,0.00021248769,0.0070118336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990816,0.0004207634,0.00003496686,0.00009188656,0.00019463147,0.00017608778],"domain_scores_gemma":[0.9989691,0.0006386374,0.00008042672,0.000071455885,0.000134274,0.00010611559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015634497,0.0010994332,0.0015682933,0.0014737564,0.0007341012,0.0016983415,0.0024383108,0.0032605056,0.0058349655],"category_scores_gemma":[0.0030817797,0.00079487124,0.001793781,0.001563718,0.00070572126,0.0012837058,0.0019572228,0.0022345027,0.0006097119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012795694,0.00016472719,0.0002700041,0.00006553976,0.000065597356,0.0000382826,0.000031416974,0.9570958,0.00083606644,0.007812604,0.0016376553,0.03185428],"study_design_scores_gemma":[0.000056453326,0.00006768968,0.00007702183,0.000009033496,0.000016013913,0.000008300242,0.000009445001,0.9968299,0.00013721306,0.0022394098,0.0005437616,0.0000057317866],"about_ca_topic_score_codex":0.0069828513,"about_ca_topic_score_gemma":0.006287134,"teacher_disagreement_score":0.0069828513,"about_ca_system_score_codex":0.0016145617,"about_ca_system_score_gemma":0.0025644957,"threshold_uncertainty_score":0.019519925},"labels":[],"label_agreement":null},{"id":"W1976233513","doi":"10.1016/j.cor.2012.12.013","title":"How to make the replenishment and payment strategy under flexible two-part trade credit","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Toronto Metropolitan University","funders":"","keywords":"Payment; Trade credit; Cash; Plan (archaeology); Economic order quantity; Computer science; Business; Economics; Microeconomics; Operations research; Actuarial science; Finance; Mathematics; Supply chain; Marketing","score_opus":0.12945785477845048,"score_gpt":0.3438390581475082,"score_spread":0.21438120336905772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976233513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28561234,0.00026899233,0.6869652,0.00362978,0.00023998895,0.00044801435,0.00019640545,0.0008078906,0.021831341],"genre_scores_gemma":[0.90359694,0.00012436513,0.09160098,0.00012425249,0.00002593333,0.00009576067,0.00009519885,0.00004643685,0.004290196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990288,0.00024273653,0.0000823042,0.00022735172,0.0002177543,0.00020106895],"domain_scores_gemma":[0.9979388,0.0008196002,0.00016121902,0.00033142677,0.00051331526,0.00023563123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022381288,0.00052393245,0.0008080027,0.0005855288,0.001146705,0.0037373977,0.0012407925,0.0020331715,0.005366219],"category_scores_gemma":[0.0088450555,0.0004785474,0.0005659601,0.001099342,0.00094365876,0.0066014472,0.0016774334,0.0017511884,0.00054579426],"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.0005466858,0.00029649606,0.006054923,0.00013456744,0.00006529747,0.00085552625,0.00085578783,0.5816869,0.0068419618,0.112524845,0.0071377535,0.28299916],"study_design_scores_gemma":[0.00004239932,0.00004319378,0.0006666893,0.000012188792,0.000020350864,0.00008181775,0.00033814696,0.92191136,0.0017039872,0.07313393,0.002008477,0.000037519676],"about_ca_topic_score_codex":0.010129283,"about_ca_topic_score_gemma":0.004930395,"teacher_disagreement_score":0.010129283,"about_ca_system_score_codex":0.0012456143,"about_ca_system_score_gemma":0.003221723,"threshold_uncertainty_score":0.020140648},"labels":[],"label_agreement":null},{"id":"W1978632776","doi":"10.1016/j.cor.2013.05.012","title":"Master problem approximations in Dantzig–Wolfe decomposition of variational inequality problems with applications to two energy market models","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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","funders":"","keywords":"Decomposition; Mathematical economics; Variational inequality; Mathematics; Mathematical optimization; Inequality; Applied mathematics; Mathematical analysis","score_opus":0.062463347888046,"score_gpt":0.33801531280820835,"score_spread":0.2755519649201623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978632776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03539379,0.0011292889,0.9436784,0.002151984,0.00023588703,0.00007391843,0.00014743143,0.00006157555,0.017127614],"genre_scores_gemma":[0.6586858,0.0016928173,0.2996532,0.00073416345,0.0004771872,0.0004696659,0.0005898589,0.000311488,0.037385806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992618,0.00042146986,0.000025069532,0.000069552574,0.00014406227,0.0000781633],"domain_scores_gemma":[0.9964535,0.0025557613,0.00018932403,0.00017095571,0.00036750123,0.00026292686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039143646,0.0011352532,0.0016233247,0.0012040449,0.0006717706,0.0021979995,0.0017964296,0.0021750324,0.005526269],"category_scores_gemma":[0.0107676005,0.00077504263,0.0013829443,0.00089251687,0.0021045592,0.0030083705,0.0024045464,0.0038763664,0.00037842427],"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.00006738664,0.000111917114,0.00035197366,0.00009387722,0.000038885337,0.00006486087,0.00013827249,0.20933783,0.0005538067,0.77823853,0.002651636,0.008351099],"study_design_scores_gemma":[0.000008197377,0.000008447932,0.00005836499,0.000009970838,0.0000042766173,0.000006725202,0.000019581732,0.8873955,0.00006474639,0.11187771,0.0005419029,0.000004594726],"about_ca_topic_score_codex":0.0050980933,"about_ca_topic_score_gemma":0.0047778334,"teacher_disagreement_score":0.005526269,"about_ca_system_score_codex":0.0018915947,"about_ca_system_score_gemma":0.0018966122,"threshold_uncertainty_score":0.020701408},"labels":[],"label_agreement":null},{"id":"W1980430324","doi":"10.1016/j.cor.2014.05.003","title":"Location modeling for municipal solid waste facilities","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Municipal Solid Waste Management","field":"Environmental Science","cited_by":101,"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":"Fondo Nacional de Desarrollo Científico y Tecnológico; Comisión Nacional de Investigación Científica y Tecnológica","keywords":"Municipal solid waste; Work (physics); Minification; Computer science; Solid waste management; Operations research; Facility location problem; Waste management; Engineering","score_opus":0.1044891746843916,"score_gpt":0.3724616956954444,"score_spread":0.2679725210110528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980430324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53113085,0.0011331874,0.4243363,0.0016473423,0.00020968859,0.00023164062,0.003580527,0.0012774349,0.036453],"genre_scores_gemma":[0.9652763,0.00028557287,0.01721688,0.00007247519,0.00003703768,0.00013550508,0.0006886255,0.00015410232,0.016133646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958307,0.00014458297,0.000017579408,0.00007513165,0.000058901533,0.000120754645],"domain_scores_gemma":[0.9991658,0.0004552457,0.000090859314,0.000048282127,0.00016488261,0.000074965195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000531384,0.000799317,0.0013305056,0.00077682576,0.0009970207,0.0015473835,0.0022686052,0.002487953,0.008327993],"category_scores_gemma":[0.0019421412,0.001031846,0.001538892,0.0015123412,0.00056407036,0.0012320627,0.0011375676,0.0011264613,0.00084141997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014418579,0.000015942524,0.0003895046,0.000010263694,0.000007904415,0.000021131897,0.000013564495,0.9963159,0.00008676836,0.0017265992,0.00024265544,0.0011555117],"study_design_scores_gemma":[0.000006252611,0.0000076187907,0.000128788,0.0000030755496,0.0000049215623,0.0000044248354,0.000020352612,0.9987079,0.00006934393,0.0007549012,0.0002881633,0.0000043568084],"about_ca_topic_score_codex":0.1680389,"about_ca_topic_score_gemma":0.09932651,"teacher_disagreement_score":0.1680389,"about_ca_system_score_codex":0.0028532993,"about_ca_system_score_gemma":0.0027586624,"threshold_uncertainty_score":0.33412164},"labels":[],"label_agreement":null},{"id":"W1981704813","doi":"10.1016/j.cor.2011.11.017","title":"Lagrangian relaxation and constraint generation for allocation and advanced scheduling","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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 British Columbia","funders":"National Science Foundation","keywords":"Lagrangian relaxation; Computer science; Mathematical optimization; Scheduling (production processes); Markov decision process; Exploit; Column generation; Job shop scheduling; Dynamic priority scheduling; Lagrangian; Markov process; Schedule; Mathematics; Applied mathematics","score_opus":0.2900679938174112,"score_gpt":0.48499745404991107,"score_spread":0.19492946023249985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981704813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002673847,0.0003871055,0.9922012,0.00026851095,0.00010962834,0.00007372336,0.000091680144,0.000100512196,0.0040937155],"genre_scores_gemma":[0.13733713,0.0007669194,0.85264087,0.00023570066,0.00023796763,0.0005414824,0.00036082944,0.00025423322,0.007624923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986959,0.00077174656,0.000042470358,0.00012545673,0.0002553549,0.00010901763],"domain_scores_gemma":[0.9961733,0.0030027768,0.00020058203,0.00018506046,0.00034585752,0.00009249613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034043316,0.0014554316,0.002108625,0.0013442438,0.0008718104,0.0016478451,0.001898871,0.0018418465,0.0065973555],"category_scores_gemma":[0.009675405,0.0014876314,0.0016193589,0.0025485975,0.0016130314,0.0021026775,0.0018551712,0.0034063528,0.00084713986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005804313,0.00005433856,0.00006797361,0.00011990261,0.000023349694,0.0000346483,0.00004798426,0.9187513,0.00027408265,0.047873423,0.002856693,0.029838322],"study_design_scores_gemma":[0.000019493573,0.0000102400645,0.00002039302,0.000011512797,0.0000039392658,0.000004128696,0.0000064998258,0.97753114,0.000090833586,0.0215187,0.0007783458,0.0000048503443],"about_ca_topic_score_codex":0.011636958,"about_ca_topic_score_gemma":0.008575024,"teacher_disagreement_score":0.011636958,"about_ca_system_score_codex":0.0015865541,"about_ca_system_score_gemma":0.002737378,"threshold_uncertainty_score":0.023138463},"labels":[],"label_agreement":null},{"id":"W1982600687","doi":"10.1016/j.cor.2004.11.021","title":"Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Data Management and Algorithms","field":"Computer Science","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é de Montréal; Université du Québec à Montréal","funders":"","keywords":"Sequence (biology); Computer science; Computation; Travel time; Mathematical optimization; Route planning; Decomposition; Plan (archaeology); Shortest path problem; Mathematics; Algorithm; Theoretical computer science; Graph; Transport engineering","score_opus":0.08730844122553108,"score_gpt":0.3832802464060155,"score_spread":0.2959718051804844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982600687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53153497,0.0010146886,0.4575513,0.0014217593,0.00015853906,0.00024594853,0.0009795928,0.0004812945,0.0066118673],"genre_scores_gemma":[0.79054165,0.0006878172,0.2027275,0.000057763933,0.0000720338,0.00019563179,0.00071102614,0.00011976432,0.0048869136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995153,0.00021023519,0.000022960077,0.00010804728,0.00008520069,0.000058275684],"domain_scores_gemma":[0.9914698,0.0072921934,0.00031654703,0.00014362774,0.00038936432,0.00038850788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019884014,0.0010986635,0.0015077837,0.0017606198,0.0014510737,0.0012541852,0.002732388,0.0029384382,0.0034526621],"category_scores_gemma":[0.010623533,0.0011044182,0.0012515265,0.0038485809,0.0013299977,0.0020106398,0.0012957661,0.0018294096,0.00017422193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008195656,0.00008140497,0.00032381513,0.00006605339,0.000021862536,0.000084491236,0.00005788238,0.9888359,0.0002431428,0.0045948485,0.0004889863,0.005119631],"study_design_scores_gemma":[0.000024450443,0.000024176745,0.00009070305,0.0000022315853,0.000009497193,0.000008492956,0.000019413,0.9972857,0.00008084756,0.0023373268,0.00011200962,0.000005090671],"about_ca_topic_score_codex":0.052293647,"about_ca_topic_score_gemma":0.030202992,"teacher_disagreement_score":0.052293647,"about_ca_system_score_codex":0.0025722354,"about_ca_system_score_gemma":0.0025522995,"threshold_uncertainty_score":0.103978574},"labels":[],"label_agreement":null},{"id":"W1982739237","doi":"10.1016/s0305-0548(03)00143-6","title":"Resource allocation during tests for optimally reliable software","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Software Reliability and Analysis Research","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Reliability engineering; Test plan; Test Management Approach; System under test; Software reliability testing; Software; White-box testing; Reliability (semiconductor); Test strategy; Test case; Software system; Solver; Regression testing; Software construction; Statistics; Mathematics; Engineering; Operating system; Programming language","score_opus":0.06357624890948606,"score_gpt":0.36566602436698364,"score_spread":0.3020897754574976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982739237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8283488,0.0003463706,0.16480184,0.000423039,0.000071811795,0.00021968583,0.000084392464,0.0010010032,0.0047030384],"genre_scores_gemma":[0.98645,0.000028454004,0.013029735,0.000022254584,0.000010920353,0.00004408724,0.000036055437,0.000075305965,0.0003031018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823403,0.0007511914,0.000083374856,0.00013080954,0.00033516955,0.0004652565],"domain_scores_gemma":[0.97610635,0.019952789,0.0012891638,0.00079945225,0.0011834127,0.00066886103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023496244,0.0005785898,0.00077836297,0.000808109,0.0006429897,0.00096631405,0.00096313615,0.00061618706,0.0028662563],"category_scores_gemma":[0.022898411,0.00048409335,0.0002454853,0.0004182399,0.0008698044,0.0012042806,0.00086560694,0.00068674487,0.0002456614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014015956,0.00060705096,0.010622696,0.00035724277,0.00009157746,0.001105853,0.00085011346,0.6609768,0.06482192,0.017002475,0.003996496,0.2255519],"study_design_scores_gemma":[0.00017726698,0.000892275,0.005097629,0.000044900586,0.000053350213,0.00014541992,0.00039741036,0.9508919,0.027082864,0.014341464,0.00083442987,0.000041091804],"about_ca_topic_score_codex":0.003866468,"about_ca_topic_score_gemma":0.0031057084,"teacher_disagreement_score":0.003866468,"about_ca_system_score_codex":0.0008953989,"about_ca_system_score_gemma":0.0018301612,"threshold_uncertainty_score":0.0124261975},"labels":[],"label_agreement":null},{"id":"W1984745425","doi":"10.1016/j.cor.2012.02.007","title":"Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Face and Expression Recognition","field":"Computer Science","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":"Branch and bound; Computer science; Algorithm; Branch and cut; Integer programming; Operations research; Mathematical optimization; Mathematics","score_opus":0.06511072471575952,"score_gpt":0.38277607204500447,"score_spread":0.31766534732924495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984745425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016582472,0.00012009884,0.9965191,0.00008372888,0.00004412581,0.00002692499,0.00003106116,0.000557965,0.0009588822],"genre_scores_gemma":[0.054907907,0.0001576698,0.9390031,0.00014196204,0.000140819,0.00025289977,0.0003268521,0.0006834578,0.004385236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729985,0.0011533609,0.00012791714,0.00039193933,0.00079871406,0.00022823345],"domain_scores_gemma":[0.9948874,0.002384664,0.00021738624,0.0012900182,0.001045816,0.00017465543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003911909,0.0015684814,0.0023350215,0.0014240226,0.0008609277,0.0013968599,0.004095502,0.001997783,0.011122097],"category_scores_gemma":[0.0131038455,0.0011359146,0.0015708646,0.0022862104,0.0011315068,0.0023346315,0.0032149407,0.0043223603,0.0041131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038884275,0.00030622652,0.0007046968,0.00015971922,0.00021051615,0.00008953073,0.00012620632,0.5500743,0.0041980785,0.052123554,0.012428373,0.37918997],"study_design_scores_gemma":[0.000027830441,0.00002609135,0.000074135845,0.0000067311466,0.000011592373,0.000016625068,0.0000045191982,0.98624134,0.00052556524,0.011702671,0.0013548491,0.000008029496],"about_ca_topic_score_codex":0.007161514,"about_ca_topic_score_gemma":0.012598792,"teacher_disagreement_score":0.011122097,"about_ca_system_score_codex":0.0009816039,"about_ca_system_score_gemma":0.0030866899,"threshold_uncertainty_score":0.037207127},"labels":[],"label_agreement":null},{"id":"W1985043293","doi":"10.1016/j.cor.2009.04.011","title":"An efficient heuristic for reliability design optimization problems","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":40,"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; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Tabu search; Redundancy (engineering); Disjoint sets; Genetic algorithm; Heuristic; Mathematics","score_opus":0.04840033153782702,"score_gpt":0.32876582777591684,"score_spread":0.2803654962380898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985043293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012618885,0.000988793,0.9731371,0.0002546738,0.00024727228,0.00019134948,0.00014488182,0.0007283216,0.011688691],"genre_scores_gemma":[0.13762714,0.0005465241,0.85646677,0.0002658246,0.00012824083,0.00054423173,0.00025843698,0.00023800974,0.0039248546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910754,0.00038154022,0.000035139594,0.00007672734,0.0002806797,0.00011826938],"domain_scores_gemma":[0.99828714,0.001194609,0.00009905069,0.00014759663,0.00020527675,0.000066397704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018212118,0.0016318852,0.0018107487,0.0020832762,0.0008209656,0.0012347056,0.0017448333,0.0021993325,0.0058764233],"category_scores_gemma":[0.004218507,0.0010796773,0.001352559,0.0020989827,0.0008463866,0.0012359181,0.0012893694,0.0016551836,0.0010254146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016959285,0.00016224757,0.00019212696,0.0001688893,0.000050739178,0.000093387105,0.0000475641,0.8469134,0.0015917871,0.015383033,0.0043067164,0.13092045],"study_design_scores_gemma":[0.000079019956,0.000053219726,0.00006103336,0.000022972905,0.000025033616,0.000028109007,0.000010537671,0.9884008,0.00036055132,0.008972398,0.0019774092,0.000008997134],"about_ca_topic_score_codex":0.0031988064,"about_ca_topic_score_gemma":0.004511602,"teacher_disagreement_score":0.0058764233,"about_ca_system_score_codex":0.0011484037,"about_ca_system_score_gemma":0.0018748571,"threshold_uncertainty_score":0.019658566},"labels":[],"label_agreement":null},{"id":"W1987203135","doi":"10.1016/j.cor.2010.01.008","title":"Planar expropriation problem with non-rigid rectangular facilities","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"McMaster University","funders":"","keywords":"Expropriation; Planar; Computer science; Mathematical optimization; Mathematics; Business; Economics; Computer graphics (images)","score_opus":0.04078433979525797,"score_gpt":0.2912359657615207,"score_spread":0.25045162596626275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987203135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50417644,0.0014659774,0.42372453,0.003996439,0.00021936238,0.00033605666,0.0023071696,0.0006674976,0.063106485],"genre_scores_gemma":[0.9009278,0.0010676621,0.06542084,0.00027641386,0.0001491754,0.0002094889,0.0019507448,0.00015497295,0.029842936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993716,0.00016596136,0.00003051901,0.00013333157,0.00010084773,0.0001977399],"domain_scores_gemma":[0.99823606,0.0010661184,0.00024691355,0.00015831822,0.000109445675,0.00018302536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007213964,0.0009442186,0.0018486662,0.00079467584,0.0012122414,0.0023483292,0.0030283043,0.0031452077,0.010960363],"category_scores_gemma":[0.004273229,0.0010173711,0.0013668837,0.001805151,0.0015933804,0.0043732356,0.0032429346,0.002600614,0.00075839716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008557771,0.0002138066,0.0012639475,0.0007057613,0.00011945656,0.0015615842,0.00028802527,0.6535738,0.0037646128,0.2774715,0.016826082,0.043355614],"study_design_scores_gemma":[0.00033728327,0.00025019626,0.0011806962,0.00006504198,0.00009263427,0.0007547226,0.00047542297,0.74851596,0.0022723067,0.23626916,0.009703999,0.00008262259],"about_ca_topic_score_codex":0.0049900813,"about_ca_topic_score_gemma":0.0021750324,"teacher_disagreement_score":0.010960363,"about_ca_system_score_codex":0.001048299,"about_ca_system_score_gemma":0.00079254253,"threshold_uncertainty_score":0.036666095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03251944,0.0006690056,0.9638925,0.00021301047,0.000119726785,0.000049340506,0.00010075201,0.00018946662,0.0022467244],"genre_scores_gemma":[0.7222114,0.001420099,0.26733518,0.00009464018,0.00027011486,0.00024993074,0.00037805745,0.00023331925,0.0078071975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.00010388625,0.000016433993,0.00007883045,0.00011363326,0.00009279147],"domain_scores_gemma":[0.9994062,0.00040427974,0.00005002468,0.00004429976,0.00005273777,0.000042409305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198519,0.000758896,0.0011075969,0.00042172923,0.00036474442,0.00077801745,0.0011482434,0.00048296942,0.002076803],"category_scores_gemma":[0.0017684594,0.0004391531,0.00073525676,0.00065625773,0.00033565928,0.0014329897,0.00073946017,0.0013323468,0.00024787747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038965154,0.00017270222,0.000297207,0.00020826519,0.0000746376,0.00009881145,0.00007970814,0.84001243,0.009824369,0.037038602,0.0039853137,0.107818194],"study_design_scores_gemma":[0.00001628713,0.000033366094,0.00010581276,0.000003965033,0.000014054449,0.000012769476,0.000010682584,0.98964536,0.0010295983,0.008380503,0.00074241473,0.000005207328],"about_ca_topic_score_codex":0.0036478112,"about_ca_topic_score_gemma":0.0022863843,"teacher_disagreement_score":0.0036478112,"about_ca_system_score_codex":0.00048789545,"about_ca_system_score_gemma":0.00091214647,"threshold_uncertainty_score":0.00725317},"labels":[],"label_agreement":null},{"id":"W1988645991","doi":"10.1016/j.cor.2012.01.005","title":"A Tabu search algorithm for the network pricing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Université de Montréal; Wilfrid Laurier University; SNC-Lavalin (Canada)","funders":"","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Computer science; Combinatorial optimization; Flow network; Algorithm; Mathematics","score_opus":0.08855724499197673,"score_gpt":0.39515374008068405,"score_spread":0.30659649508870734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988645991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03229143,0.0012778038,0.94022155,0.0010529694,0.00042692566,0.0003825165,0.0007163556,0.003435091,0.020195337],"genre_scores_gemma":[0.15474415,0.00040275024,0.8337071,0.0003995636,0.00014063406,0.0005338109,0.0009841064,0.000623152,0.00846473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892116,0.00047705442,0.00004278013,0.0001571889,0.00023857362,0.00016332936],"domain_scores_gemma":[0.9973916,0.0017700526,0.00010891575,0.00023430552,0.00037459776,0.00012044015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016961537,0.0011617203,0.0018303065,0.0021360249,0.0014336216,0.0019985512,0.0028378994,0.0032140526,0.019683912],"category_scores_gemma":[0.00827069,0.00093179353,0.0010211067,0.0041372357,0.0010579813,0.0022512248,0.0015289511,0.0021724943,0.0035193842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052036287,0.00045852174,0.00079710904,0.00020973313,0.00010547443,0.0001222088,0.00014932551,0.5572815,0.0013226019,0.033652067,0.028733127,0.37664798],"study_design_scores_gemma":[0.00023634214,0.00008541968,0.00019164957,0.000028303437,0.000028057104,0.00005494886,0.00003803823,0.9650074,0.00034290642,0.030662404,0.0033048426,0.000019697065],"about_ca_topic_score_codex":0.008369809,"about_ca_topic_score_gemma":0.0071150693,"teacher_disagreement_score":0.019683912,"about_ca_system_score_codex":0.0016203591,"about_ca_system_score_gemma":0.0029315003,"threshold_uncertainty_score":0.065849304},"labels":[],"label_agreement":null},{"id":"W1991749916","doi":"10.1016/j.cor.2009.03.020","title":"A new version of the Improved Primal Simplex for degenerate linear programs","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Simplex; Linear programming; Degenerate energy levels; Simplex algorithm; Mathematical optimization; Computer science; Mathematics; Applied mathematics; Combinatorics; Physics","score_opus":0.14117109825347857,"score_gpt":0.4515330468494342,"score_spread":0.3103619485959556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991749916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004532277,0.0003683998,0.981357,0.00019002883,0.00040052662,0.000080258105,0.00024020174,0.00038634118,0.012444983],"genre_scores_gemma":[0.105935276,0.00065435644,0.8736336,0.0003144167,0.00047860848,0.00038650725,0.000661435,0.0010609501,0.016874822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980038,0.00071934354,0.00009850914,0.00024707467,0.0008197575,0.000111624846],"domain_scores_gemma":[0.9982584,0.00039480787,0.000096088115,0.00050029386,0.00061302364,0.0001374924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022989297,0.0013430185,0.0019629858,0.0015521315,0.0009376992,0.00308412,0.0024455506,0.0017065996,0.015607249],"category_scores_gemma":[0.006921436,0.0008547193,0.0015120266,0.0019639856,0.0012163434,0.0033570186,0.003603579,0.0042923717,0.003916224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032522553,0.00020081106,0.00056218216,0.00043816434,0.00012907347,0.0001425599,0.00021619759,0.23576005,0.005913206,0.4949731,0.021664107,0.23967536],"study_design_scores_gemma":[0.000045853718,0.000096941134,0.00019493676,0.000066583096,0.000033206583,0.00014808567,0.000029213381,0.8462974,0.0017823251,0.12928045,0.021982035,0.000043019583],"about_ca_topic_score_codex":0.00095191505,"about_ca_topic_score_gemma":0.0013386002,"teacher_disagreement_score":0.015607249,"about_ca_system_score_codex":0.0008945078,"about_ca_system_score_gemma":0.0012373067,"threshold_uncertainty_score":0.052211404},"labels":[],"label_agreement":null},{"id":"W1994859090","doi":"10.1016/s0305-0548(03)00032-7","title":"Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"McGill University; HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Jacobian matrix and determinant; Quadratic equation; Variational inequality; Mathematics; Variety (cybernetics); Dual (grammatical number); Mathematical optimization; Newton's method; Applied mathematics; Center (category theory); Nonlinear system; Geometry","score_opus":0.17788448041439678,"score_gpt":0.4432832803204287,"score_spread":0.2653987999060319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994859090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021584884,0.00011503953,0.99616563,0.00010953349,0.000037448663,0.000024490106,0.000021670356,0.00006079155,0.0013070187],"genre_scores_gemma":[0.13829528,0.00040809312,0.8544054,0.00015134696,0.00017515782,0.0002466635,0.00015752774,0.00025481716,0.005905649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931824,0.00022170162,0.000026940537,0.0000835535,0.00029682068,0.000052738058],"domain_scores_gemma":[0.9988305,0.000777155,0.000058117304,0.00006243073,0.00019790688,0.000073962496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312269,0.0011139648,0.0016191178,0.00096500263,0.0005513771,0.0015894595,0.0019271582,0.0020248187,0.0041317777],"category_scores_gemma":[0.003430189,0.0010679984,0.0010209165,0.0008439469,0.0010620974,0.0015629549,0.0020121683,0.0029502711,0.00054862536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016860316,0.00021802001,0.0003743285,0.000389136,0.000099110264,0.00012609526,0.00008932901,0.77014226,0.0056453235,0.08802256,0.0040916298,0.13063362],"study_design_scores_gemma":[0.00002084236,0.000020677286,0.000044915676,0.00000839692,0.000009600117,0.00002186522,0.000004670373,0.99010766,0.00038924735,0.008822982,0.0005434121,0.000005714915],"about_ca_topic_score_codex":0.0029498795,"about_ca_topic_score_gemma":0.0031445946,"teacher_disagreement_score":0.0041317777,"about_ca_system_score_codex":0.0006445475,"about_ca_system_score_gemma":0.001578053,"threshold_uncertainty_score":0.013822138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035919227,0.002129498,0.94060206,0.00163245,0.00021268857,0.000087039836,0.0009565192,0.00024204332,0.018218469],"genre_scores_gemma":[0.82202774,0.005012632,0.09438891,0.00038190102,0.0004857376,0.0005153321,0.0015944862,0.00032085337,0.07527239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.000322273,0.000048878534,0.00020046008,0.00017445846,0.00016618501],"domain_scores_gemma":[0.9968526,0.002262392,0.0003949488,0.00011491221,0.00020440044,0.0001707416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017974721,0.0017438642,0.0016624501,0.0011473513,0.0007020503,0.0031758496,0.0032967818,0.0024055247,0.008009383],"category_scores_gemma":[0.005580219,0.001362542,0.0020146077,0.0017237697,0.0018124465,0.004559125,0.0015269142,0.003748687,0.0008758858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006179406,0.00004817715,0.00023086581,0.000064187305,0.000033966044,0.000051273553,0.00007129668,0.7814498,0.00029501616,0.21261626,0.0013657421,0.003711615],"study_design_scores_gemma":[0.0000133156145,0.000011822411,0.00008615909,0.000011301322,0.000017445202,0.000009902631,0.000020630296,0.89532274,0.00008801894,0.103478804,0.000928668,0.000011165546],"about_ca_topic_score_codex":0.013923568,"about_ca_topic_score_gemma":0.012943767,"teacher_disagreement_score":0.013923568,"about_ca_system_score_codex":0.0025042398,"about_ca_system_score_gemma":0.0019965265,"threshold_uncertainty_score":0.027685046},"labels":[],"label_agreement":null},{"id":"W1997368401","doi":"10.1016/j.cor.2015.03.014","title":"Multi-period Vehicle Routing Problem with Due dates","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban and Freight Transport Logistics","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Flexibility (engineering); Operations research; Computer science; Routing (electronic design automation); Total cost; Service (business); Mathematical optimization; Transport engineering; Operations management; Business; Mathematics; Economics; Engineering; Statistics; Computer network","score_opus":0.1381227408269031,"score_gpt":0.30902765189059667,"score_spread":0.17090491106369357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997368401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22006051,0.0038280776,0.73912513,0.004583973,0.0009994045,0.00071308855,0.0055315,0.00073750166,0.02442079],"genre_scores_gemma":[0.8647455,0.0015740743,0.102498606,0.00032927011,0.0004888396,0.00055525376,0.0016090975,0.0003041144,0.027895262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803907,0.0007511156,0.00011761981,0.00043100005,0.00023194788,0.00042914719],"domain_scores_gemma":[0.9959484,0.0027132346,0.00045516822,0.0001949983,0.00019980063,0.0004884272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028323033,0.0017716654,0.0038090455,0.0013315084,0.00118584,0.0032842425,0.0034863737,0.0036151682,0.009502313],"category_scores_gemma":[0.00609614,0.0016480647,0.0018629486,0.0024803,0.0008618631,0.0034551583,0.0015636821,0.0021753334,0.000784374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010660206,0.00027333037,0.000888143,0.00071411405,0.0003197571,0.0010630399,0.000114544855,0.92399096,0.0025313606,0.036859553,0.00899066,0.0231885],"study_design_scores_gemma":[0.00022261805,0.0003338303,0.000762428,0.00003591517,0.00008672349,0.00030524953,0.000076702294,0.95912915,0.00077710534,0.035541702,0.0026834228,0.000045028213],"about_ca_topic_score_codex":0.0031830117,"about_ca_topic_score_gemma":0.0026699798,"teacher_disagreement_score":0.009502313,"about_ca_system_score_codex":0.0017763663,"about_ca_system_score_gemma":0.0020007943,"threshold_uncertainty_score":0.03178841},"labels":[],"label_agreement":null},{"id":"W1999514805","doi":"10.1016/j.cor.2013.03.017","title":"A reliable model for global planning of mobile networks","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"Computer science; Survivability; Reliability (semiconductor); Mathematical optimization; Network model; Network planning and design; Artificial intelligence; Computer network; Mathematics","score_opus":0.10456705542581086,"score_gpt":0.40860707224635273,"score_spread":0.3040400168205419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999514805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014887412,0.00060656725,0.9744187,0.001024072,0.0000820527,0.000044349377,0.0005186348,0.0002333615,0.008184775],"genre_scores_gemma":[0.8036818,0.0019359965,0.17517895,0.0002533187,0.00024241256,0.00045706166,0.000867953,0.00031863982,0.01706385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991068,0.00037924363,0.000044989607,0.00013881133,0.00019716786,0.00013293001],"domain_scores_gemma":[0.99617434,0.002599718,0.00033481725,0.0002678706,0.0004518604,0.00017148347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017052,0.0011514538,0.00185828,0.0013020055,0.0009192904,0.0022002491,0.0030771613,0.002074248,0.006110003],"category_scores_gemma":[0.010352893,0.0012809944,0.0012200152,0.0021247317,0.0019058028,0.002965361,0.0018163846,0.0022383356,0.00070472056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014008052,0.0000035882008,0.000065990855,0.00001744441,0.000008256093,0.000027155085,0.000022410286,0.9495247,0.000055362143,0.047833327,0.0005053922,0.0019223428],"study_design_scores_gemma":[0.000008219966,0.0000060352572,0.000021899914,0.0000048358875,0.000005326421,0.000005960884,0.0000060774782,0.9606611,0.00002722729,0.038799357,0.0004497418,0.000004259479],"about_ca_topic_score_codex":0.02177694,"about_ca_topic_score_gemma":0.014558226,"teacher_disagreement_score":0.02177694,"about_ca_system_score_codex":0.0024439588,"about_ca_system_score_gemma":0.0022807373,"threshold_uncertainty_score":0.04330039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008154862,0.00015459329,0.987703,0.00011561179,0.00009683569,0.000025620637,0.000010147669,0.000058479287,0.0036808583],"genre_scores_gemma":[0.44935137,0.0004739152,0.5372753,0.00020055869,0.00018116999,0.00024458053,0.00005340273,0.00010382624,0.012115954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976116,0.000081243255,0.000010871398,0.000031359818,0.00009312676,0.00002232358],"domain_scores_gemma":[0.99963,0.00020811117,0.00002845203,0.000021709084,0.00009562916,0.000016099622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066133024,0.000571028,0.0005781281,0.00064310886,0.0003465941,0.00060415285,0.0013425485,0.0010984291,0.0027261283],"category_scores_gemma":[0.0019963612,0.00040725328,0.0007010231,0.0007725643,0.0005569997,0.00069399754,0.0006581493,0.000836415,0.00025151437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019387759,0.00003602127,0.00015894814,0.000029328909,0.00003196333,0.000048150512,0.000031872136,0.94004804,0.0014680435,0.01425986,0.0004217227,0.043446664],"study_design_scores_gemma":[0.0000038315366,0.000009542038,0.00003724305,0.0000020030368,0.0000034813947,0.000008375711,0.0000023948578,0.9979552,0.00007683417,0.0016118202,0.00028729087,0.0000020680038],"about_ca_topic_score_codex":0.003113546,"about_ca_topic_score_gemma":0.0028776845,"teacher_disagreement_score":0.003113546,"about_ca_system_score_codex":0.000464646,"about_ca_system_score_gemma":0.0004609204,"threshold_uncertainty_score":0.009119868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20406887,0.0026373542,0.7736144,0.0019552964,0.0004106474,0.00023636973,0.0010005023,0.00026790512,0.01580865],"genre_scores_gemma":[0.825076,0.0021150534,0.13968995,0.00023147327,0.00046529266,0.00024704885,0.0006768051,0.00020447286,0.031293835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902046,0.00032606168,0.000043476546,0.00025944735,0.0001485416,0.00020210752],"domain_scores_gemma":[0.99801195,0.0013242537,0.00026081898,0.00012951677,0.000113383605,0.00016012051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014581312,0.0013039986,0.002543735,0.0009422276,0.00089886686,0.0018486662,0.0028771071,0.002154846,0.0059298743],"category_scores_gemma":[0.004511182,0.0014071388,0.001618458,0.0020915263,0.0011711183,0.0033777198,0.0012549631,0.0016204764,0.00060057984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040242096,0.00013901475,0.0005939016,0.00031681385,0.00011107516,0.00034184568,0.000057725032,0.90920144,0.0012484016,0.05189371,0.004073551,0.031620078],"study_design_scores_gemma":[0.00006949949,0.00014509453,0.00044426453,0.000020847961,0.00006342925,0.00021890135,0.000076194185,0.92716974,0.0009375241,0.06856068,0.0022667074,0.000027155182],"about_ca_topic_score_codex":0.0028387818,"about_ca_topic_score_gemma":0.0026900545,"teacher_disagreement_score":0.0059298743,"about_ca_system_score_codex":0.0011351672,"about_ca_system_score_gemma":0.0014083111,"threshold_uncertainty_score":0.019837439},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037704206,0.023143582,0.96589714,0.0003890954,0.00013001618,0.00003894984,0.00030400616,0.00041080208,0.0059160492],"genre_scores_gemma":[0.20313694,0.11069059,0.66615576,0.00036416418,0.00076423824,0.0004940876,0.0017096678,0.00047053368,0.016214103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.0000788898,0.000027015636,0.00007498241,0.00009966226,0.000028546337],"domain_scores_gemma":[0.99959916,0.00021979865,0.000038365622,0.000052533185,0.00007500428,0.000015181459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623241,0.0014263367,0.0014120269,0.0008432106,0.00041354037,0.0013544519,0.0019787145,0.0011842467,0.0038394984],"category_scores_gemma":[0.0014759459,0.0008761587,0.0010216993,0.0020722975,0.00045902203,0.001802358,0.0005092601,0.0011412966,0.0017420356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004551668,0.00009015975,0.0006751723,0.0007937157,0.00007379567,0.000032585944,0.00006397333,0.73386806,0.0014528086,0.04295915,0.01189778,0.20804732],"study_design_scores_gemma":[0.000018550825,0.00006138782,0.00032776894,0.00013596915,0.000045332235,0.00009572658,0.000028364402,0.904809,0.00085050537,0.056712065,0.036894813,0.000020585361],"about_ca_topic_score_codex":0.0040940186,"about_ca_topic_score_gemma":0.0048433063,"teacher_disagreement_score":0.0040940186,"about_ca_system_score_codex":0.0011582981,"about_ca_system_score_gemma":0.0011137644,"threshold_uncertainty_score":0.012844384},"labels":[],"label_agreement":null},{"id":"W2002100181","doi":"10.1016/j.cor.2011.12.017","title":"A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Tardiness; Crossover; Computer science; Mathematical optimization; Algorithm; Scheduling (production processes); Genetic algorithm; Ant colony optimization algorithms; Job shop scheduling; Sequence (biology); Mathematics; Artificial intelligence; Schedule","score_opus":0.07325806510702272,"score_gpt":0.29739031804436084,"score_spread":0.22413225293733813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002100181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031142727,0.00032095666,0.96367866,0.00020642538,0.000100088844,0.000081758095,0.000056595734,0.0005358211,0.0038769152],"genre_scores_gemma":[0.34967873,0.00023543299,0.64440584,0.00022295535,0.000082650266,0.00034840096,0.00019310124,0.00014183816,0.004690978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995889,0.00012649827,0.000015324043,0.00006497968,0.00015637769,0.000047872138],"domain_scores_gemma":[0.99924904,0.00048540503,0.000046784655,0.00004239172,0.00013277268,0.000043453536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884759,0.00068339653,0.0011331096,0.00093542464,0.0004629104,0.00093520177,0.0018348065,0.0019536882,0.0026593227],"category_scores_gemma":[0.0018940342,0.000561357,0.00071729353,0.001259089,0.00057553366,0.0008554865,0.0008737493,0.00093843247,0.00042280322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089144916,0.00007682457,0.00027415864,0.000032334956,0.000049286962,0.000038367853,0.000028710037,0.93658775,0.0014277048,0.004452044,0.0008460339,0.05609767],"study_design_scores_gemma":[0.000027931543,0.000025042522,0.000043672848,0.0000025384622,0.0000075070766,0.00000888476,0.0000027452845,0.9985869,0.00013333058,0.00092685,0.00023146383,0.000003168376],"about_ca_topic_score_codex":0.0058629923,"about_ca_topic_score_gemma":0.0055171195,"teacher_disagreement_score":0.0058629923,"about_ca_system_score_codex":0.00090903474,"about_ca_system_score_gemma":0.0014857725,"threshold_uncertainty_score":0.011657715},"labels":[],"label_agreement":null},{"id":"W2006750788","doi":"10.1016/j.cor.2005.03.008","title":"Assessing performance and uncertainty in developing carpet reverse logistics systems","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":174,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Reverse logistics; Incentive; Memorandum; Computer science; Supply chain; Government (linguistics); Variable (mathematics); Operations research; Business; Environmental economics; Economics; Marketing; Engineering; Microeconomics","score_opus":0.09024852783511896,"score_gpt":0.35006138472228704,"score_spread":0.2598128568871681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006750788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99180037,0.000023425007,0.00718358,0.000042012885,0.0000026144833,0.00003911191,0.000026739164,0.000026541835,0.0008555386],"genre_scores_gemma":[0.9961124,0.000014434689,0.0036560935,0.0000031390352,0.000001057269,0.000015328718,0.000049172126,0.0000026083742,0.00014585818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746215,0.0011156118,0.00021683284,0.00022263911,0.000607382,0.0003752951],"domain_scores_gemma":[0.98081183,0.014820001,0.0012253005,0.00041803427,0.0023307987,0.00039390937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008072405,0.00073459663,0.0004832759,0.0013796982,0.00084730977,0.002195091,0.0007677316,0.0011685971,0.0006655012],"category_scores_gemma":[0.02464555,0.0004661159,0.000507549,0.001029061,0.0006341007,0.0025373562,0.0009734032,0.0009957517,0.00011073169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007382445,0.00032782933,0.027427634,0.000052815005,0.00006613155,0.00008637667,0.00027821612,0.9421222,0.0035739641,0.0013770091,0.000086286025,0.023863267],"study_design_scores_gemma":[0.000025717505,0.0009839296,0.009805653,0.00001067574,0.00004211916,0.000015346068,0.00030243196,0.97770625,0.010173281,0.0008173065,0.00009048186,0.000026861417],"about_ca_topic_score_codex":0.021517674,"about_ca_topic_score_gemma":0.014049889,"teacher_disagreement_score":0.021517674,"about_ca_system_score_codex":0.0051002493,"about_ca_system_score_gemma":0.0027384756,"threshold_uncertainty_score":0.04278481},"labels":[],"label_agreement":null},{"id":"W2006860232","doi":"10.1016/j.cor.2009.03.009","title":"WBMOAIS: A novel artificial immune system for multiobjective optimization","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Artificial Immune Systems Applications","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":"McGill University","funders":"","keywords":"Sorting; Mathematical optimization; Artificial immune system; Multi-objective optimization; Genetic algorithm; Computer science; Population; Fitness function; sort; Metaheuristic; Mathematics; Algorithm; Artificial intelligence","score_opus":0.06434611964341566,"score_gpt":0.34647062401044626,"score_spread":0.2821245043670306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006860232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03739553,0.00077747623,0.95224524,0.0002692425,0.00041725484,0.00010491211,0.000051475596,0.00082994567,0.007909099],"genre_scores_gemma":[0.56401426,0.00053167355,0.42361793,0.00059565326,0.00018798462,0.00032157297,0.00013287258,0.00009808675,0.010499995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998258,0.00004506657,0.000008812367,0.000027167955,0.000073016236,0.000020167072],"domain_scores_gemma":[0.99984217,0.000051033487,0.000017079881,0.000015665102,0.00005734315,0.000016690912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041490683,0.00037654166,0.0004904832,0.00031316292,0.000274651,0.00062030496,0.0009940545,0.00077093096,0.0022288722],"category_scores_gemma":[0.0007450265,0.00014637168,0.0003464686,0.00029714117,0.00022620434,0.00049838267,0.00087582646,0.000653048,0.00048347423],"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.0002597706,0.0002883568,0.0017535813,0.0003169361,0.00022085017,0.00031111678,0.00012840165,0.39486104,0.09322046,0.03105182,0.008330876,0.4692568],"study_design_scores_gemma":[0.000032643075,0.00013337102,0.00022711855,0.000008198727,0.000020897087,0.00007362365,0.00000985328,0.987081,0.003981598,0.0033959053,0.0050267866,0.000008960032],"about_ca_topic_score_codex":0.00043181566,"about_ca_topic_score_gemma":0.00082601246,"teacher_disagreement_score":0.0022288722,"about_ca_system_score_codex":0.00016499983,"about_ca_system_score_gemma":0.00033522004,"threshold_uncertainty_score":0.0074563622},"labels":[],"label_agreement":null},{"id":"W2009458683","doi":"10.1016/s0305-0548(02)00154-5","title":"A new filled function applied to global optimization","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Measurement and Metrology Techniques","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":"University of Alberta","funders":"","keywords":"Computer science; Global optimization; Function (biology); Mathematical optimization; Algorithm; Mathematics","score_opus":0.04476078327987872,"score_gpt":0.3278296607681466,"score_spread":0.2830688774882679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009458683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020553367,0.00019459517,0.99491644,0.00012692159,0.00027307816,0.00002053347,0.000034508805,0.00016741398,0.002211085],"genre_scores_gemma":[0.08475043,0.00062229554,0.89773643,0.00037518644,0.0004640938,0.00031377163,0.00027858684,0.0012386215,0.014220633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913967,0.00034638128,0.00005792665,0.000096598436,0.0003039212,0.000055477314],"domain_scores_gemma":[0.9990361,0.00037726853,0.000048481725,0.00014769341,0.00030499647,0.000085572596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021171828,0.0014160238,0.0014020343,0.0017047315,0.0008690386,0.0016325332,0.0019741238,0.0021888514,0.0056562736],"category_scores_gemma":[0.0043563326,0.0007219019,0.0017189451,0.0016641238,0.0013640675,0.0031219742,0.0023837017,0.0022662382,0.002001897],"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.00022076647,0.00021452548,0.0005323787,0.00035904764,0.00013246002,0.00016367278,0.00018189647,0.3261882,0.013179694,0.34128678,0.0126317395,0.3049088],"study_design_scores_gemma":[0.000017353495,0.000075984266,0.000093396484,0.00002388763,0.000018247809,0.00006257243,0.000013375743,0.9452231,0.0018983127,0.04316445,0.009386393,0.00002293254],"about_ca_topic_score_codex":0.00096331094,"about_ca_topic_score_gemma":0.0007678223,"teacher_disagreement_score":0.0056562736,"about_ca_system_score_codex":0.00064041006,"about_ca_system_score_gemma":0.0010329285,"threshold_uncertainty_score":0.01892209},"labels":[],"label_agreement":null},{"id":"W2010038548","doi":"10.1016/j.cor.2003.09.013","title":"Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optical Network Technologies","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Division (mathematics); Routing and wavelength assignment; Routing (electronic design automation); Joint (building); Wavelength; Multiplexing; Computer network; Adaptive routing; Wavelength-division multiplexing; Static routing; Telecommunications; Routing protocol; Mathematics; Optics; Physics; Engineering; Arithmetic","score_opus":0.043936293278839716,"score_gpt":0.3024706903685003,"score_spread":0.25853439708966053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010038548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16314511,0.00085908355,0.83046967,0.0004612538,0.0002027678,0.00007157347,0.000057437668,0.0005292201,0.0042040017],"genre_scores_gemma":[0.86587334,0.00038726293,0.12829824,0.00004747671,0.00011925485,0.00010148118,0.00008363136,0.0000772305,0.0050120903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920195,0.00028757105,0.000042962674,0.00011782314,0.00020225433,0.00014744657],"domain_scores_gemma":[0.99716276,0.0015109279,0.00037276722,0.00050409,0.00030608565,0.00014331534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020381343,0.0005095318,0.00068050704,0.00074165466,0.0012888543,0.001347445,0.001295589,0.00074216403,0.00175363],"category_scores_gemma":[0.0058715027,0.0005845287,0.00043760487,0.00093716185,0.0009438706,0.0027617747,0.0012319149,0.0008272952,0.00033267023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014324497,0.00029620744,0.0014251026,0.00020416007,0.000076550205,0.00020374927,0.0003085328,0.5494798,0.029511886,0.122694165,0.00394857,0.29041895],"study_design_scores_gemma":[0.00005169273,0.00017550345,0.00043414903,0.000009033811,0.0000401522,0.00009503224,0.000057627272,0.92843324,0.0083181,0.060836926,0.0015238787,0.000024560564],"about_ca_topic_score_codex":0.0010133456,"about_ca_topic_score_gemma":0.002526792,"teacher_disagreement_score":0.0020381343,"about_ca_system_score_codex":0.00058313727,"about_ca_system_score_gemma":0.0010941348,"threshold_uncertainty_score":0.010778844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15087906,0.0023535392,0.7977404,0.0037450427,0.0009949871,0.0010707045,0.0023057836,0.0011916606,0.039718848],"genre_scores_gemma":[0.7258175,0.0022466243,0.19003654,0.0005017146,0.00069262367,0.00061620737,0.0015001461,0.00062034605,0.07796832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769455,0.00075890485,0.000095936346,0.00050018006,0.0003812912,0.000569116],"domain_scores_gemma":[0.9978405,0.0011813275,0.0002800611,0.00018160112,0.00017984265,0.00033660335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024918409,0.0025064263,0.00588031,0.0016350057,0.002466543,0.0052221813,0.004555837,0.0061616753,0.016757512],"category_scores_gemma":[0.0059073963,0.0028327897,0.0027616262,0.0035741515,0.0019700327,0.005028638,0.0025028905,0.003084186,0.0022132515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072378264,0.00045258534,0.0009965366,0.0005287433,0.0001508594,0.0008866039,0.00013404156,0.90483165,0.0016105011,0.03390605,0.011946117,0.04383261],"study_design_scores_gemma":[0.000092596994,0.00025559732,0.00036664636,0.00002256287,0.000070080496,0.00019893624,0.00013809971,0.97686166,0.00088843453,0.017855026,0.0031998637,0.00005041931],"about_ca_topic_score_codex":0.010714264,"about_ca_topic_score_gemma":0.0076085473,"teacher_disagreement_score":0.016757512,"about_ca_system_score_codex":0.0021623415,"about_ca_system_score_gemma":0.003524378,"threshold_uncertainty_score":0.05605948},"labels":[],"label_agreement":null},{"id":"W2011185809","doi":"10.1016/j.cor.2010.03.018","title":"Coordination in a two-stage production system: Complexity, conflict and cooperation","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Production (economics); Computer science; Stage (stratigraphy); Production system (computer science); Operations research; Process management; Mathematics; Business; Microeconomics; Economics","score_opus":0.06905820366878661,"score_gpt":0.3594188944290823,"score_spread":0.2903606907602957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011185809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26268503,0.00048313313,0.7234828,0.0011435691,0.00006599256,0.00019471072,0.00016291965,0.00014794953,0.011633896],"genre_scores_gemma":[0.9373539,0.00030247355,0.05854027,0.000054913333,0.00006582276,0.00020503347,0.00012690731,0.000036455247,0.0033142965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670225,0.0015244517,0.00018287943,0.0005386186,0.00060015975,0.00045164177],"domain_scores_gemma":[0.97479093,0.02126902,0.0016175951,0.00076785556,0.0008449803,0.00070956605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031479448,0.00076866354,0.0020636036,0.0009297981,0.001427205,0.003322147,0.0020623754,0.0018870608,0.0029834758],"category_scores_gemma":[0.01478449,0.0009881817,0.0012076722,0.00162223,0.0022353684,0.0033792888,0.0021107772,0.001377322,0.00022349137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001924636,0.00008703056,0.0014803373,0.00008375851,0.000057164278,0.00038307803,0.00017618269,0.93808055,0.00092543237,0.04931057,0.00044539777,0.008778035],"study_design_scores_gemma":[0.000042818134,0.00004484598,0.00047366702,0.000005708006,0.000019283914,0.00007052921,0.00005917914,0.9570593,0.00024869485,0.041661963,0.00029718556,0.000016803375],"about_ca_topic_score_codex":0.0063088317,"about_ca_topic_score_gemma":0.0038972783,"teacher_disagreement_score":0.0063088317,"about_ca_system_score_codex":0.0020211616,"about_ca_system_score_gemma":0.0022585627,"threshold_uncertainty_score":0.016648114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046279285,0.0069276635,0.9064922,0.0044283676,0.0007250401,0.0001916218,0.0006964677,0.00019646199,0.0340629],"genre_scores_gemma":[0.87753445,0.011177145,0.059428323,0.00071749726,0.0010536228,0.00048205827,0.0004890637,0.00034710366,0.048770674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989505,0.00042036004,0.000030868396,0.00016546687,0.00021882115,0.00021395613],"domain_scores_gemma":[0.9940147,0.004618644,0.0005278046,0.00010358416,0.0005563635,0.00017903953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003182196,0.0020344134,0.0022649555,0.00218332,0.0013015164,0.0030122933,0.0029216406,0.004118651,0.0057340786],"category_scores_gemma":[0.013341088,0.0018170851,0.0017671578,0.00297979,0.002631679,0.004494666,0.0022973751,0.003442765,0.0005033001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151960985,0.000024015635,0.00021218204,0.000086743734,0.000020604031,0.00006639264,0.00003298046,0.96653074,0.00013874596,0.028279802,0.0015940266,0.0029985472],"study_design_scores_gemma":[0.0000033516505,0.0000068142053,0.000107654065,0.00001895447,0.00001499156,0.000018023788,0.000038966413,0.98512065,0.000062171785,0.014180365,0.0004199312,0.000008099899],"about_ca_topic_score_codex":0.021824729,"about_ca_topic_score_gemma":0.016607018,"teacher_disagreement_score":0.021824729,"about_ca_system_score_codex":0.0035342602,"about_ca_system_score_gemma":0.0022708792,"threshold_uncertainty_score":0.04339534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023872353,0.00015974493,0.96858907,0.00014310692,0.00007391341,0.00007981997,0.00007409323,0.00015348388,0.006854494],"genre_scores_gemma":[0.8076747,0.0004625743,0.17564918,0.00008860441,0.000060520073,0.00025696278,0.000120470504,0.00013814236,0.015548832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996332,0.00012949815,0.000011289445,0.000089684145,0.00006692013,0.00006936641],"domain_scores_gemma":[0.9994536,0.0002396293,0.000061378596,0.000048969458,0.00014492866,0.000051575622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009188705,0.001139293,0.0011442046,0.0007631581,0.0007097397,0.0009169814,0.0013543308,0.0012396342,0.0037613753],"category_scores_gemma":[0.0024497805,0.0007872206,0.00060500397,0.00068900717,0.00065130147,0.0013832682,0.0012599773,0.0008130179,0.000369448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000558607,0.000020280297,0.000110478,0.000042567888,0.000016184615,0.000024829558,0.000018364617,0.9770082,0.00093073386,0.010988915,0.00054697675,0.010236755],"study_design_scores_gemma":[0.000010002386,0.00004601953,0.000032174918,0.0000049107025,0.000012129707,0.000010819274,0.000011510568,0.9923759,0.00048372833,0.0063493787,0.0006589194,0.0000045944917],"about_ca_topic_score_codex":0.0027023584,"about_ca_topic_score_gemma":0.0037127042,"teacher_disagreement_score":0.0037613753,"about_ca_system_score_codex":0.0011185243,"about_ca_system_score_gemma":0.001223429,"threshold_uncertainty_score":0.012583077},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016472556,0.0002735804,0.97329366,0.0003666913,0.00010772801,0.00024967664,0.00018235145,0.0007817296,0.008271976],"genre_scores_gemma":[0.13110417,0.00032578752,0.8577546,0.00014512181,0.00009129808,0.0003583135,0.0005576075,0.00028418648,0.009378986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948126,0.0001327082,0.000019074485,0.00008876032,0.00018303255,0.00009520758],"domain_scores_gemma":[0.999278,0.00039603078,0.000048598653,0.000062654624,0.00012338281,0.000091262234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009840061,0.0011907036,0.0020157325,0.0013692719,0.0010850509,0.0015083359,0.002283873,0.0025667863,0.013329417],"category_scores_gemma":[0.0024038865,0.0008402718,0.0009958403,0.0021367113,0.0006827439,0.001805194,0.0015070566,0.0019242805,0.0016081203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024960656,0.00044031587,0.0004871831,0.00014570756,0.000051935793,0.00010998384,0.0000668235,0.6355036,0.0022162928,0.018275559,0.010529941,0.33192307],"study_design_scores_gemma":[0.000060144004,0.00006290151,0.00009758389,0.000009631312,0.000013081756,0.000023094912,0.000014734495,0.99020106,0.0003263071,0.007735056,0.0014482319,0.000008135376],"about_ca_topic_score_codex":0.0086187655,"about_ca_topic_score_gemma":0.009623462,"teacher_disagreement_score":0.013329417,"about_ca_system_score_codex":0.0012192979,"about_ca_system_score_gemma":0.0023998467,"threshold_uncertainty_score":0.044591367},"labels":[],"label_agreement":null},{"id":"W2016986747","doi":"10.1016/j.cor.2010.04.009","title":"Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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 Windsor","funders":"","keywords":"Metaheuristic; Ant colony optimization algorithms; Parallel metaheuristic; Mathematical optimization; Flow shop scheduling; Computer science; Scheduling (production processes); Ant colony; Operator (biology); Job shop scheduling; Mathematics; Meta-optimization; Routing (electronic design automation)","score_opus":0.029658794550711406,"score_gpt":0.28614994640391,"score_spread":0.2564911518531986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016986747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06650945,0.00030772554,0.9274107,0.00028165273,0.0001401707,0.00013587545,0.00014641034,0.00028741197,0.004780639],"genre_scores_gemma":[0.77562875,0.00028583242,0.21510954,0.00011379548,0.00011518003,0.00018779818,0.0001748316,0.00017436538,0.008209915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994392,0.0002316859,0.00001711757,0.00008104424,0.000110221736,0.00012069282],"domain_scores_gemma":[0.9992011,0.0004664709,0.00010119168,0.00004541521,0.00010690051,0.00007892488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013639935,0.0008403238,0.0017146963,0.0006992529,0.00072073017,0.0012531201,0.0020916397,0.0015655622,0.0022305194],"category_scores_gemma":[0.002016005,0.00066585495,0.0010784639,0.0012207261,0.00092660554,0.0015383536,0.0006359097,0.0012905846,0.00024237744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010157384,0.00010250472,0.00012234817,0.000062887484,0.0000419802,0.00006413156,0.000039438895,0.97498906,0.001651849,0.011003887,0.0011218403,0.010698578],"study_design_scores_gemma":[0.00001181073,0.00003726684,0.000038030033,0.0000021693493,0.0000069984194,0.000010339267,0.0000041752346,0.99633056,0.00023724271,0.0031272809,0.00018963477,0.000004525126],"about_ca_topic_score_codex":0.006542413,"about_ca_topic_score_gemma":0.006960868,"teacher_disagreement_score":0.006542413,"about_ca_system_score_codex":0.0010618051,"about_ca_system_score_gemma":0.0023899602,"threshold_uncertainty_score":0.013008654},"labels":[],"label_agreement":null},{"id":"W2018396040","doi":"10.1016/j.cor.2004.05.010","title":"Point of presence design in Internet protocol networks with performance guarantees","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Network Traffic and Congestion Control","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Tabu search; Node (physics); The Internet; Routing protocol; Distributed computing; Heuristic; Set (abstract data type); Network planning and design; Internet topology; Routing (electronic design automation); Network topology; Algorithm","score_opus":0.04454849626407173,"score_gpt":0.3199370992120859,"score_spread":0.27538860294801415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018396040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01408493,0.0002130932,0.9830125,0.00015880825,0.000035368972,0.00006693136,0.000012702279,0.00026071203,0.00215491],"genre_scores_gemma":[0.7315619,0.0004274736,0.26393762,0.00014611971,0.00011793838,0.00022380173,0.00004676586,0.00012256308,0.003415902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971853,0.0012321691,0.00014838953,0.00036326709,0.00079565553,0.0002753245],"domain_scores_gemma":[0.9952083,0.0025172008,0.00045676174,0.00066793675,0.0008787092,0.00027097983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034305186,0.00071647303,0.00065305986,0.00071276247,0.00080560514,0.0016554216,0.0025485135,0.0012894984,0.0019693605],"category_scores_gemma":[0.0087279575,0.00075277616,0.00039904285,0.00049987034,0.0013544803,0.0029092818,0.0023398097,0.0016900942,0.00045074013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008581033,0.00028091224,0.0014406332,0.00046882132,0.000095143616,0.0002626849,0.0005105077,0.50424975,0.020247472,0.28540394,0.0027025363,0.18347941],"study_design_scores_gemma":[0.00009550952,0.00047676082,0.00017881328,0.00004578949,0.00007329257,0.0001676404,0.00008381313,0.89691937,0.008180987,0.088393115,0.005358925,0.00002593445],"about_ca_topic_score_codex":0.0004127096,"about_ca_topic_score_gemma":0.0007088313,"teacher_disagreement_score":0.0034305186,"about_ca_system_score_codex":0.000733762,"about_ca_system_score_gemma":0.0007343891,"threshold_uncertainty_score":0.018142521},"labels":[],"label_agreement":null},{"id":"W2019468200","doi":"10.1016/j.cor.2008.02.009","title":"Formulations and relaxations for a multi-echelon capacitated location–distribution problem","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":64,"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; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear programming relaxation; Relaxation (psychology); Mathematical optimization; Path (computing); Linear programming; Mathematics; Integer programming; Binary number; Upper and lower bounds; Simple (philosophy); Integer (computer science); Point (geometry); Distribution (mathematics); Computer science","score_opus":0.20160441375469523,"score_gpt":0.3583772366091318,"score_spread":0.15677282285443656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019468200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030700583,0.0024528245,0.9103721,0.00353554,0.00043030595,0.00024087042,0.0010411032,0.00014359085,0.051083192],"genre_scores_gemma":[0.5211337,0.0024880692,0.44311962,0.00090461265,0.00078731054,0.0007952893,0.0012949992,0.00031315733,0.029163215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986029,0.00058451365,0.000069462716,0.00026334304,0.00027098693,0.0002087441],"domain_scores_gemma":[0.99676895,0.0023943493,0.00026180464,0.00014760144,0.00029547315,0.00013180757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003341787,0.0014748661,0.0016834778,0.0011419076,0.00095313933,0.0037917797,0.0028255591,0.0035832347,0.010885711],"category_scores_gemma":[0.008015367,0.0015349099,0.0019846617,0.002455072,0.0015470373,0.00285664,0.0026520188,0.0034155517,0.00093448075],"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.00006684223,0.000103749066,0.0002699608,0.00020803558,0.00004114325,0.00013135037,0.00008662889,0.9444678,0.00030676633,0.036132812,0.0041174865,0.014067441],"study_design_scores_gemma":[0.000026595064,0.00002618709,0.00014856031,0.000030454425,0.000014549259,0.00004018198,0.000065198285,0.9746459,0.0001471754,0.022640191,0.0021994743,0.00001552176],"about_ca_topic_score_codex":0.012931862,"about_ca_topic_score_gemma":0.010280079,"teacher_disagreement_score":0.012931862,"about_ca_system_score_codex":0.0026547431,"about_ca_system_score_gemma":0.0022168367,"threshold_uncertainty_score":0.03641635},"labels":[],"label_agreement":null},{"id":"W2023174570","doi":"10.1016/s0305-0548(01)00079-x","title":"The generalized maximal covering location problem","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":267,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Mathematics; Computer science; Combinatorics","score_opus":0.1076327661472703,"score_gpt":0.3121708075387171,"score_spread":0.20453804139144682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023174570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25607064,0.005059572,0.6630531,0.0062386543,0.00040125134,0.00023676392,0.0023630229,0.0006089674,0.06596802],"genre_scores_gemma":[0.861852,0.0026953632,0.11797588,0.00051108317,0.0004269769,0.00019434544,0.002126522,0.00017097278,0.014046829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834824,0.0008894624,0.000047605154,0.00033210233,0.00016078129,0.00022186252],"domain_scores_gemma":[0.9977806,0.0014317975,0.00019125557,0.0002591397,0.00012508706,0.00021203703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011530613,0.00095697836,0.0017469343,0.0006599777,0.0010188319,0.0030323942,0.0019699438,0.0024857845,0.008264845],"category_scores_gemma":[0.005298388,0.00075712235,0.0009970189,0.0021839286,0.0015709536,0.0040699947,0.0020611344,0.0014688952,0.0006545606],"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.0004525825,0.00012124471,0.0012314769,0.00068596716,0.00023946808,0.00050562614,0.00036713324,0.38125733,0.0016453488,0.49870285,0.030347105,0.08444381],"study_design_scores_gemma":[0.00011497864,0.00007248044,0.00056585885,0.00007167695,0.00007060589,0.00036263937,0.00024163949,0.35896304,0.00055962335,0.62382865,0.015120196,0.000028632458],"about_ca_topic_score_codex":0.002814554,"about_ca_topic_score_gemma":0.0019600266,"teacher_disagreement_score":0.008264845,"about_ca_system_score_codex":0.0014775181,"about_ca_system_score_gemma":0.001033816,"threshold_uncertainty_score":0.027648628},"labels":[],"label_agreement":null},{"id":"W2023434277","doi":"10.1016/s0305-0548(00)00106-4","title":"Locating facilities by minimax relative to closest points of demand areas","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":29,"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; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimax; 1-center problem; Facility location problem; Point (geometry); Plane (geometry); Computer science; Mathematical optimization; Mathematics; Function (biology); Geometry","score_opus":0.09678954158683507,"score_gpt":0.3180681346253874,"score_spread":0.22127859303855235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023434277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21724659,0.0004966719,0.7715916,0.00036479236,0.00008104807,0.00017725823,0.00038124653,0.00087976933,0.008780964],"genre_scores_gemma":[0.77046204,0.00020913425,0.22521394,0.00005868065,0.00006221494,0.00021329446,0.0004222586,0.00012898551,0.0032294607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940836,0.00017887302,0.000045929453,0.00012769976,0.00013345122,0.00010560103],"domain_scores_gemma":[0.9980422,0.0012242036,0.00022302197,0.00011823254,0.00031633308,0.00007589909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017120464,0.000764563,0.0014118575,0.0035884262,0.00089124264,0.0018375237,0.0012326878,0.00095649937,0.0044804187],"category_scores_gemma":[0.008951481,0.00070711545,0.000661939,0.002127854,0.00070968055,0.0016244225,0.0016310775,0.0007309591,0.0006091209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000979582,0.00019795113,0.010614757,0.00015101148,0.00011297809,0.00009115226,0.00027662283,0.7733707,0.004282848,0.015631732,0.003021244,0.19126941],"study_design_scores_gemma":[0.000056348967,0.00020078674,0.00280956,0.000033164066,0.000022016355,0.00009057879,0.00014131962,0.98503876,0.0031614923,0.007155924,0.0012715723,0.000018541397],"about_ca_topic_score_codex":0.0054020197,"about_ca_topic_score_gemma":0.0052134814,"teacher_disagreement_score":0.0054020197,"about_ca_system_score_codex":0.0009775041,"about_ca_system_score_gemma":0.0015075288,"threshold_uncertainty_score":0.014988482},"labels":[],"label_agreement":null},{"id":"W2024143101","doi":"10.1016/j.cor.2006.05.014","title":"A graph coloring heuristic using partial solutions and a reactive tabu scheme","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"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":"Tabu search; Graph coloring; Heuristics; Greedy coloring; List coloring; Computer science; Benchmark (surveying); Mathematics; Heuristic; Fractional coloring; Graph; Algorithm; Combinatorics; Mathematical optimization; Graph power; Line graph","score_opus":0.43082897586275787,"score_gpt":0.49476757588424486,"score_spread":0.06393860002148699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024143101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0997325,0.0002727495,0.8824962,0.0003260198,0.00024448757,0.0006243643,0.00027441327,0.0020165283,0.014012739],"genre_scores_gemma":[0.33258316,0.000098751305,0.6624371,0.00014823605,0.00004059743,0.0003679309,0.00028824373,0.0002529497,0.0037829946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.00032808105,0.00002779425,0.00010659108,0.00013944348,0.00012219376],"domain_scores_gemma":[0.9987208,0.00060010736,0.00008757601,0.00027570172,0.00022119709,0.00009453371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133256,0.00077162695,0.0010103201,0.0018326263,0.0014059064,0.0011524392,0.0034723568,0.0013988647,0.0068412856],"category_scores_gemma":[0.0032363294,0.0007860666,0.0009214165,0.0021057334,0.0008725862,0.0013321285,0.0010975971,0.0010201975,0.0007204256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004781032,0.00036496288,0.00046223003,0.00016213303,0.00007279806,0.000067327586,0.00013981007,0.79086703,0.006919388,0.029211598,0.003883569,0.16737114],"study_design_scores_gemma":[0.00012749113,0.000138219,0.00013046285,0.000013236041,0.00003371912,0.00002158151,0.00002720494,0.99208343,0.0015256392,0.00471338,0.0011641682,0.00002157651],"about_ca_topic_score_codex":0.0088880155,"about_ca_topic_score_gemma":0.009264984,"teacher_disagreement_score":0.0088880155,"about_ca_system_score_codex":0.0014818917,"about_ca_system_score_gemma":0.0023632308,"threshold_uncertainty_score":0.022886336},"labels":[],"label_agreement":null},{"id":"W2024963330","doi":"10.1016/j.cor.2015.04.005","title":"On covering location problems on networks with edge demand","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Mathematical optimization; Discretization; Heuristic; Covering problems; Enhanced Data Rates for GSM Evolution; Computer science; Carry (investment); Set (abstract data type); Facility location problem; Tree (set theory); Greedy algorithm; Space (punctuation); Constant (computer programming); Mathematics; Artificial intelligence","score_opus":0.11227405736034853,"score_gpt":0.316595701611319,"score_spread":0.2043216442509705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024963330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3744298,0.014576576,0.48599228,0.017786438,0.0009120331,0.0005254668,0.0026087235,0.0004465782,0.10272205],"genre_scores_gemma":[0.8582275,0.014952307,0.07989466,0.0017546993,0.0021117567,0.00044897874,0.002882883,0.0005549099,0.039172318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975255,0.0013594163,0.000088660505,0.00028980972,0.00031334677,0.0004232201],"domain_scores_gemma":[0.95795655,0.037512682,0.0016385678,0.0007921696,0.0008978375,0.0012022118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036772108,0.0028982263,0.003955079,0.0029642547,0.0022448108,0.004316901,0.00410174,0.00547829,0.014858002],"category_scores_gemma":[0.032975286,0.0022220036,0.002422099,0.0071882564,0.0043013827,0.011015134,0.0050360486,0.0047833007,0.000768947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005672495,0.00025779652,0.0024270287,0.0006984998,0.00019218291,0.00046752478,0.0006311121,0.68621075,0.0007620557,0.2524558,0.024692845,0.0306372],"study_design_scores_gemma":[0.00013462751,0.00015020174,0.00071208377,0.00014892018,0.000083920495,0.00021162821,0.00037179593,0.62341475,0.00029124113,0.36927506,0.005162491,0.000043316883],"about_ca_topic_score_codex":0.010070293,"about_ca_topic_score_gemma":0.0047716065,"teacher_disagreement_score":0.014858002,"about_ca_system_score_codex":0.0033602556,"about_ca_system_score_gemma":0.0012616947,"threshold_uncertainty_score":0.04970497},"labels":[],"label_agreement":null},{"id":"W2025389484","doi":"10.1016/j.cor.2008.08.008","title":"Scheduling with uncertain durations: Modeling -robust scheduling with constraints","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"University of Toronto","funders":"Enterprise Ireland","keywords":"Mathematical optimization; Computer science; Scheduling (production processes); Dynamic priority scheduling; Job shop scheduling; Schedule; Robustness (evolution); Mathematics","score_opus":0.09082031233015848,"score_gpt":0.30642897843153327,"score_spread":0.2156086661013748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025389484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019488787,0.0009330043,0.9753668,0.00050761795,0.000097191245,0.000063293744,0.00033206245,0.00020673081,0.0030045183],"genre_scores_gemma":[0.8815418,0.0019955442,0.10956608,0.00017558537,0.00029138118,0.0003030171,0.0005243941,0.00020631675,0.005395829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984723,0.00049404835,0.00009355495,0.00040020322,0.00033224782,0.00020775599],"domain_scores_gemma":[0.9959304,0.002350485,0.0009838524,0.0002536797,0.00030428328,0.00017732344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027758228,0.0015963818,0.0023069277,0.00084142556,0.0005000441,0.0024529358,0.0028874096,0.0019035799,0.0021083592],"category_scores_gemma":[0.010109466,0.0015960209,0.0016357235,0.0016188695,0.0010553875,0.0025951404,0.0013207544,0.0017494306,0.00039427614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000186686,0.000007816288,0.000049517486,0.000021430676,0.0000124920725,0.000016164233,0.0000094027955,0.99208504,0.00015035036,0.0057995142,0.00015169063,0.0016778338],"study_design_scores_gemma":[0.0000051360857,0.0000057689426,0.00002927993,0.0000030700046,0.000006430027,0.000004948344,0.000002470823,0.99543756,0.000069577276,0.004288744,0.00014321152,0.000003830898],"about_ca_topic_score_codex":0.014208876,"about_ca_topic_score_gemma":0.0062815836,"teacher_disagreement_score":0.014208876,"about_ca_system_score_codex":0.0023882203,"about_ca_system_score_gemma":0.0019355051,"threshold_uncertainty_score":0.028252363},"labels":[],"label_agreement":null},{"id":"W2026627205","doi":"10.1016/j.cor.2013.03.001","title":"Achieving MILP feasibility quickly using general disjunctions","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Carleton University","funders":"","keywords":"Computer science; Mathematical optimization; Mathematics","score_opus":0.3344502833390069,"score_gpt":0.5042806537434319,"score_spread":0.169830370404425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026627205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035173602,0.00022401563,0.92231184,0.00078425807,0.00013667851,0.00027309527,0.0003262879,0.0022401535,0.038530033],"genre_scores_gemma":[0.23347645,0.00020877221,0.7563783,0.00038359774,0.0000714494,0.00026671245,0.00078599097,0.0007572424,0.0076714903],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859744,0.00045274486,0.00006667767,0.00020058326,0.00049544853,0.00018705173],"domain_scores_gemma":[0.99592125,0.003070735,0.0001362364,0.00032870553,0.000447405,0.00009559866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017096585,0.0015274502,0.0009799186,0.0010225859,0.001047705,0.0021238208,0.0010009573,0.0010300449,0.025077619],"category_scores_gemma":[0.009909968,0.0011019381,0.0010765191,0.0010413602,0.0010332213,0.0037421319,0.003157183,0.004220054,0.0035550857],"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.001122092,0.0005648543,0.0013250634,0.0010340298,0.00012274674,0.0008799887,0.00041170907,0.35785717,0.024057474,0.1495488,0.030813878,0.43226218],"study_design_scores_gemma":[0.00011403639,0.00014962237,0.00022289541,0.00009731815,0.000039037877,0.00016613558,0.00020913425,0.8416493,0.010708979,0.13561736,0.011002061,0.000024074658],"about_ca_topic_score_codex":0.0011266528,"about_ca_topic_score_gemma":0.003058398,"teacher_disagreement_score":0.025077619,"about_ca_system_score_codex":0.00054676924,"about_ca_system_score_gemma":0.001161899,"threshold_uncertainty_score":0.08389294},"labels":[],"label_agreement":null},{"id":"W2027427296","doi":"10.1016/j.cor.2015.04.015","title":"Hybrid methods for lot sizing on parallel machines","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sizing; Mathematical optimization; Computer science; Decomposition; Heuristic; Lagrangian relaxation; Upper and lower bounds; Relaxation (psychology); Quality (philosophy); Mathematics","score_opus":0.24897047788231724,"score_gpt":0.44760663362998615,"score_spread":0.1986361557476689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027427296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01044197,0.00027515567,0.9864269,0.000068869726,0.000065872686,0.000050884315,0.00006290701,0.00037551834,0.0022318962],"genre_scores_gemma":[0.303684,0.0003287615,0.68677264,0.00013593986,0.00017098014,0.00041450319,0.00022021303,0.00039693914,0.007875936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995128,0.00020214079,0.000025214773,0.000059288555,0.00015351524,0.000047085883],"domain_scores_gemma":[0.9979563,0.0015272297,0.00007570699,0.00013566286,0.00025112595,0.00005406413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013458829,0.0009748074,0.0012974581,0.0009873379,0.00052182924,0.0009217792,0.0016502277,0.0008836486,0.006312719],"category_scores_gemma":[0.0028279086,0.0009598104,0.00095365394,0.001407193,0.0007117012,0.0011360343,0.0010767571,0.0011151179,0.00056657323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000933497,0.000041286155,0.00014130189,0.00008118032,0.000046821595,0.00001887669,0.000030610245,0.934297,0.001294913,0.006730008,0.00079178304,0.056432903],"study_design_scores_gemma":[0.000009218895,0.000009366786,0.000029313152,0.0000020855844,0.000002970348,0.0000018642163,0.0000021857197,0.99687886,0.00012070483,0.0027657333,0.0001755843,0.0000020666978],"about_ca_topic_score_codex":0.00669339,"about_ca_topic_score_gemma":0.008856375,"teacher_disagreement_score":0.00669339,"about_ca_system_score_codex":0.0008825222,"about_ca_system_score_gemma":0.0010586915,"threshold_uncertainty_score":0.021118164},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063723505,0.00009321392,0.9301494,0.00006855599,0.000033922923,0.00014422653,0.00012734212,0.0003678555,0.00529207],"genre_scores_gemma":[0.48430952,0.0001314998,0.5108558,0.000045674264,0.00003090829,0.00041323592,0.00023760326,0.00017712334,0.0037986408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998344,0.000049869974,0.00000821511,0.000031038,0.00004618073,0.000030283027],"domain_scores_gemma":[0.9996075,0.00025780863,0.00004944358,0.000032095286,0.000034960183,0.000018219971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006118617,0.0008473009,0.0009332591,0.0008890917,0.0003882859,0.0005958723,0.0010741511,0.00065723824,0.0040111695],"category_scores_gemma":[0.0012154419,0.0005788741,0.0010556334,0.00089166866,0.00043042802,0.0008264061,0.00075105863,0.00059351075,0.0003722874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004168605,0.000042605152,0.0001757125,0.000043299617,0.000024249077,0.000028357017,0.00001915713,0.960287,0.0024445641,0.004705933,0.00042703535,0.03176044],"study_design_scores_gemma":[0.000012835184,0.000034832996,0.00007568467,0.00000219872,0.000007382318,0.000007334885,0.0000037877066,0.9977144,0.0003207138,0.0016830207,0.00013530366,0.0000025964466],"about_ca_topic_score_codex":0.00300496,"about_ca_topic_score_gemma":0.005362734,"teacher_disagreement_score":0.0040111695,"about_ca_system_score_codex":0.00070484116,"about_ca_system_score_gemma":0.0009183423,"threshold_uncertainty_score":0.013418734},"labels":[],"label_agreement":null},{"id":"W2028642351","doi":"10.1016/j.cor.2005.02.040","title":"Road network monitoring: algorithms and a case study","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":38,"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":"Ministère des Transports","keywords":"Computer science; Schedule; Global Positioning System; Algorithm; TRACE (psycholinguistics); Plan (archaeology); Interurban; Class (philosophy); Operations research; Flow network; Christian ministry; Real-time computing; Transport engineering; Telecommunications; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.11001924702025198,"score_gpt":0.40173843069173426,"score_spread":0.2917191836714823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028642351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57398427,0.00088938436,0.4040528,0.002208978,0.00006413487,0.00080233254,0.0005479552,0.0008429385,0.016607346],"genre_scores_gemma":[0.7608514,0.00061912625,0.23481335,0.000057421883,0.00002803883,0.00025292797,0.00026734165,0.000077169505,0.0030332042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750537,0.0014282777,0.00015476972,0.0002874082,0.00045517777,0.00016899999],"domain_scores_gemma":[0.98548526,0.01173194,0.0004610129,0.0008379187,0.0012815957,0.0002023828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004551568,0.0008527564,0.0006123197,0.001638896,0.0011465017,0.002163414,0.002204385,0.004125167,0.0024605913],"category_scores_gemma":[0.01669119,0.00050883583,0.00084300374,0.0024033836,0.001031225,0.0021746887,0.0009676859,0.0012486338,0.00035294227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010788704,0.0025361194,0.051872153,0.0005608915,0.000103951585,0.0043399604,0.0013606346,0.5741892,0.0039612907,0.04442956,0.0064058537,0.30916148],"study_design_scores_gemma":[0.00010367524,0.00032939125,0.0034392984,0.000043533848,0.0000565385,0.0015991736,0.00054958335,0.97601515,0.0032283915,0.011618553,0.0029782793,0.000038493523],"about_ca_topic_score_codex":0.009856048,"about_ca_topic_score_gemma":0.0101547735,"teacher_disagreement_score":0.009856048,"about_ca_system_score_codex":0.0017981115,"about_ca_system_score_gemma":0.0009600665,"threshold_uncertainty_score":0.024071336},"labels":[],"label_agreement":null},{"id":"W2030959293","doi":"10.1016/s0305-0548(03)00201-6","title":"Integrating reliability and quality of service in networks with switched virtual circuits","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Network Traffic and Congestion Control","field":"Computer Science","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":"Institut National de la Recherche Scientifique; Polytechnique Montréal","funders":"","keywords":"Dimensioning; Computer science; Quality of service; Multiprotocol Label Switching; Routing (electronic design automation); Network packet; Reliability (semiconductor); Computer network; Circuit switching; Traffic engineering; Packet switching; Minification; Service (business); Distributed computing; Engineering","score_opus":0.05618302684892752,"score_gpt":0.3333677354405418,"score_spread":0.2771847085916143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030959293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14573678,0.0017754933,0.846602,0.000725724,0.00013447582,0.000035293295,0.000036530495,0.0002958585,0.004657756],"genre_scores_gemma":[0.9678142,0.0006266861,0.030342791,0.000045129334,0.0001800806,0.000022834998,0.00002114641,0.000036681915,0.0009104469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814785,0.0007392703,0.00009763133,0.00015863415,0.00060453074,0.00025201036],"domain_scores_gemma":[0.99150324,0.005207838,0.0010008956,0.00069206615,0.0013374579,0.00025849626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033182714,0.0007396247,0.0007242717,0.0013268036,0.00037084345,0.0022834125,0.0013233911,0.001080076,0.0009070522],"category_scores_gemma":[0.015470677,0.00057078316,0.0004207673,0.00110217,0.0017104514,0.0056183203,0.0013086724,0.0012918476,0.00014972329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040135562,0.00015149711,0.0052972883,0.00012655993,0.00009761735,0.000110420486,0.00025769384,0.68935764,0.0075633423,0.22204237,0.0006068756,0.07398729],"study_design_scores_gemma":[0.000016716267,0.000091576934,0.000701445,0.000015449186,0.000046778583,0.00003908978,0.000044701745,0.88470066,0.0015694356,0.112108074,0.00064489624,0.000021122376],"about_ca_topic_score_codex":0.0028083336,"about_ca_topic_score_gemma":0.0022352778,"teacher_disagreement_score":0.0033182714,"about_ca_system_score_codex":0.0013557315,"about_ca_system_score_gemma":0.0010917042,"threshold_uncertainty_score":0.01754886},"labels":[],"label_agreement":null},{"id":"W2032635621","doi":"10.1016/j.cor.2011.05.028","title":"Computational enhancements to fluence map optimization for total marrow irradiation using IMRT","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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":"University of Toronto; University of New Brunswick","funders":"","keywords":"Fluence; Irradiation; Computer science; Nuclear medicine; Algorithm; Physics; Medicine","score_opus":0.08134244419705006,"score_gpt":0.40128004328949446,"score_spread":0.3199375990924444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032635621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13692771,0.0009609407,0.82778627,0.00094102276,0.00020313502,0.00019780478,0.00051893824,0.0018815367,0.030582558],"genre_scores_gemma":[0.7431849,0.00021801169,0.24888666,0.00024866345,0.00007509233,0.00019614195,0.000270249,0.0007014072,0.0062187095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979836,0.0000833906,0.000007618604,0.000017148204,0.00007301236,0.000020464493],"domain_scores_gemma":[0.999461,0.00034438755,0.00003714444,0.000038931943,0.000095455296,0.00002304915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004884297,0.0005249267,0.00059454795,0.00029463222,0.00037536735,0.00063310127,0.0010207347,0.00045342534,0.006074663],"category_scores_gemma":[0.0023880794,0.0003012826,0.0005531818,0.0006223963,0.00022572734,0.00044031488,0.0006145777,0.0005545095,0.00037454042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000122007834,0.00003468423,0.0004816593,0.000057711844,0.00002242494,0.000037113783,0.00003359532,0.96768606,0.001463383,0.0016780248,0.0009933964,0.027389854],"study_design_scores_gemma":[0.00001052684,0.00001619797,0.00014123318,0.0000029390528,0.0000065484055,0.000010015014,0.00000832235,0.9981077,0.0006003326,0.00046958946,0.0006235912,0.0000030291924],"about_ca_topic_score_codex":0.00948256,"about_ca_topic_score_gemma":0.014535927,"teacher_disagreement_score":0.00948256,"about_ca_system_score_codex":0.00063730666,"about_ca_system_score_gemma":0.0010184369,"threshold_uncertainty_score":0.020321786},"labels":[],"label_agreement":null},{"id":"W2032765916","doi":"10.1016/j.cor.2004.02.007","title":"Allocation of shared costs among decision making units: a DEA approach","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":166,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Cost allocation; Operations research; Activity-based costing; Resource allocation; Equity (law); Computer science; Set (abstract data type); Environmental economics; Management science; Economics; Mathematical optimization; Mathematics","score_opus":0.21235559188206515,"score_gpt":0.46878453565144,"score_spread":0.25642894376937486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032765916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066985823,0.00015287344,0.9905918,0.00012624256,0.000027610762,0.00012299318,0.000067301116,0.000038099693,0.0021743868],"genre_scores_gemma":[0.3203239,0.0006569007,0.6726157,0.00015173304,0.0001091892,0.0011808301,0.00030452933,0.00009566233,0.004561582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99011594,0.006163569,0.00046962613,0.00093988894,0.0018109017,0.0005000057],"domain_scores_gemma":[0.98536533,0.011283813,0.0008070613,0.0009743684,0.0013869265,0.00018256101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013374954,0.0023570098,0.0044664163,0.0027349761,0.0013357366,0.004786364,0.0034369621,0.0021127688,0.005729426],"category_scores_gemma":[0.02363297,0.001806698,0.0023842347,0.005771304,0.0014914554,0.0044962363,0.0021072929,0.003020273,0.0005344126],"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.0000716144,0.00012504589,0.00039361,0.000105283725,0.00026600165,0.000040588635,0.000078801844,0.88934207,0.0003641773,0.07263296,0.00047832736,0.03610146],"study_design_scores_gemma":[0.000015233831,0.00002460803,0.00013072262,0.000018408955,0.00005824462,0.000016246202,0.000025159829,0.962226,0.00029254198,0.036449935,0.0007322546,0.000010558608],"about_ca_topic_score_codex":0.0065466664,"about_ca_topic_score_gemma":0.006057212,"teacher_disagreement_score":0.013374954,"about_ca_system_score_codex":0.0037129566,"about_ca_system_score_gemma":0.0037004554,"threshold_uncertainty_score":0.07073438},"labels":[],"label_agreement":null},{"id":"W2033114918","doi":"10.1016/j.cor.2010.09.007","title":"Algorithmic estimation of risk factors in financial markets with stochastic drift","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 Toronto; University of Waterloo","funders":"","keywords":"Unobservable; Mean reversion; Estimation; Econometrics; Financial market; Ergodic theory; Stochastic process; Diffusion; Observable; Diffusion process; Moment (physics); Economics; Mathematics; Finance; Statistics","score_opus":0.028857749000499373,"score_gpt":0.2866194909134829,"score_spread":0.2577617419129835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033114918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054623224,0.00036400574,0.9433586,0.000464355,0.000031218624,0.00004214263,0.000049149163,0.00016894245,0.00089839177],"genre_scores_gemma":[0.6800423,0.0005497754,0.31652465,0.00016218645,0.0001666379,0.00021182657,0.0003403113,0.00009081539,0.0019113342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990055,0.0004914304,0.000078071374,0.00016204665,0.00017399997,0.00008893331],"domain_scores_gemma":[0.98713833,0.011110474,0.00062889495,0.00042295925,0.00048053652,0.0002188022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034088953,0.00093710923,0.0017120815,0.001668019,0.00070127466,0.0024721646,0.002118264,0.0019801096,0.0017008343],"category_scores_gemma":[0.020665029,0.001368961,0.0010495186,0.0009306392,0.0016738384,0.0034571276,0.0027559563,0.0016872068,0.00022684172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001133467,0.00007886432,0.0019558861,0.00009596079,0.0000700709,0.00006616393,0.00010160362,0.8839819,0.0005417012,0.07264487,0.00068641035,0.03966312],"study_design_scores_gemma":[0.000015983836,0.000008144537,0.0001165713,0.0000066088887,0.000004807546,0.000008529128,0.0000068817517,0.964405,0.000086927605,0.035257243,0.00007913181,0.0000042367574],"about_ca_topic_score_codex":0.0033850782,"about_ca_topic_score_gemma":0.0039032619,"teacher_disagreement_score":0.0034088953,"about_ca_system_score_codex":0.0010978449,"about_ca_system_score_gemma":0.0020223418,"threshold_uncertainty_score":0.01802814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052960295,0.0019415013,0.9245587,0.0018726848,0.00024202408,0.00048806265,0.00082155585,0.0006820196,0.01643318],"genre_scores_gemma":[0.44573838,0.002886813,0.5213846,0.00033122822,0.00039254173,0.0009111584,0.0016166525,0.00045757365,0.02628111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988212,0.00045342866,0.000047447276,0.0001501895,0.00026519393,0.0002625962],"domain_scores_gemma":[0.99642074,0.0028512068,0.00019869136,0.000108206645,0.00020981669,0.00021136733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037556386,0.0017089302,0.0030428374,0.0016600246,0.0014828482,0.002995643,0.0025556632,0.0028107974,0.011984749],"category_scores_gemma":[0.007475007,0.0016858196,0.0012754599,0.0027570939,0.0015041091,0.0036334395,0.0015149717,0.0029235485,0.0011198636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049711094,0.00030456253,0.00051613577,0.0002976666,0.00006614866,0.00009522818,0.00009726877,0.89198107,0.00050281966,0.039251544,0.006564532,0.059825886],"study_design_scores_gemma":[0.00006697714,0.00006521555,0.00013014427,0.00002122131,0.000022628908,0.000017360911,0.00002858187,0.9660137,0.00019357314,0.032543585,0.0008859424,0.000010966758],"about_ca_topic_score_codex":0.017761704,"about_ca_topic_score_gemma":0.010394984,"teacher_disagreement_score":0.017761704,"about_ca_system_score_codex":0.00313838,"about_ca_system_score_gemma":0.004009819,"threshold_uncertainty_score":0.040092945},"labels":[],"label_agreement":null},{"id":"W2033742714","doi":"10.1016/s0305-0548(01)00102-2","title":"Special issue on location analysis","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.10889168948330606,"score_gpt":0.336557681981367,"score_spread":0.2276659924980609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033742714","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011332416,0.037099704,0.020516977,0.02816793,0.5335034,0.00023733349,0.0029116627,0.0016356836,0.3747941],"genre_scores_gemma":[0.005631924,0.023708215,0.0043151,0.0046605235,0.23894167,0.00014153417,0.0040824246,0.001167195,0.71735144],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986424,0.00018894955,0.00009991146,0.00024527442,0.0007049841,0.00011850543],"domain_scores_gemma":[0.99535984,0.0010223498,0.00024499826,0.0009325132,0.0019480234,0.0004922524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013810707,0.0019732313,0.0023500368,0.0066494728,0.0016287102,0.005047547,0.0015095867,0.0025387132,0.19413419],"category_scores_gemma":[0.005407031,0.0005734149,0.0014386497,0.004895883,0.00090592203,0.004054671,0.0021148126,0.0021172937,0.119010955],"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.0000101323285,0.000019645964,0.00012611119,0.00008763453,0.000007322072,0.00002673319,0.000008301594,0.000118090466,0.000105500156,0.0033629537,0.9599289,0.036198728],"study_design_scores_gemma":[0.0000035883572,0.000015394004,0.00066205976,0.00009400941,0.000009412671,0.000092591916,0.00002274917,0.00033560343,0.00009051986,0.005653325,0.99301416,0.0000065195118],"about_ca_topic_score_codex":0.0023458716,"about_ca_topic_score_gemma":0.005212297,"teacher_disagreement_score":0.19413419,"about_ca_system_score_codex":0.0014266329,"about_ca_system_score_gemma":0.0018268514,"threshold_uncertainty_score":0.64944357},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1509118,0.0009443058,0.8386717,0.0008524053,0.000076796736,0.00009575627,0.00030447915,0.0003077542,0.007835101],"genre_scores_gemma":[0.56021607,0.00033064594,0.43369418,0.00016546383,0.000060145518,0.00023240666,0.0006025434,0.00014662529,0.004551888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949753,0.00026869864,0.000015646792,0.00006724222,0.00008705508,0.00006384459],"domain_scores_gemma":[0.99859685,0.0010526708,0.00011508123,0.00005500278,0.00009700974,0.00008332622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011880815,0.0005027158,0.0015688826,0.0009985688,0.0004996715,0.00096707954,0.0012801382,0.0012629908,0.0029741034],"category_scores_gemma":[0.0037129368,0.00051341474,0.0005979175,0.0011493799,0.0005897046,0.0014853835,0.0010378031,0.0011823587,0.00032402534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023107068,0.00015239375,0.0009863956,0.00012615153,0.0000606125,0.00006300394,0.000070966795,0.9125973,0.0008674994,0.026827857,0.003901821,0.05411498],"study_design_scores_gemma":[0.000022800674,0.00001885,0.00007061302,0.000006402652,0.0000054511966,0.000009925677,0.000014563166,0.99225324,0.000084009356,0.0072798748,0.00023176271,0.0000024899246],"about_ca_topic_score_codex":0.0034964487,"about_ca_topic_score_gemma":0.0044099665,"teacher_disagreement_score":0.0034964487,"about_ca_system_score_codex":0.00078239315,"about_ca_system_score_gemma":0.00088086684,"threshold_uncertainty_score":0.0099493265},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019153161,0.00031692174,0.97684115,0.00033266764,0.0001478236,0.000058791305,0.00013814658,0.00022812262,0.002783276],"genre_scores_gemma":[0.7059035,0.000780239,0.27470702,0.00017312876,0.0005025572,0.00035852045,0.0004677179,0.0003638761,0.016743539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982887,0.0007121031,0.000073659874,0.00038454577,0.00034060387,0.00020033431],"domain_scores_gemma":[0.9936539,0.004729457,0.0004931319,0.0004913427,0.0003825092,0.00024973162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028782096,0.0013911374,0.0024974986,0.0010877195,0.00074488384,0.0024499123,0.0029360196,0.0019726257,0.0057588457],"category_scores_gemma":[0.010419548,0.0019501621,0.0011483555,0.0022995633,0.0012981626,0.0051777475,0.0019272034,0.002521513,0.0007602546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020223521,0.00013099606,0.00026406595,0.000075168195,0.00003523009,0.000055948498,0.000037174672,0.94010735,0.00041063994,0.033190038,0.0014527978,0.024038425],"study_design_scores_gemma":[0.000009859484,0.000010537689,0.00003129387,0.0000020901657,0.000005339839,0.0000063944744,0.0000039955116,0.9900317,0.000087454086,0.009572873,0.00023555856,0.000002923268],"about_ca_topic_score_codex":0.006096152,"about_ca_topic_score_gemma":0.004219854,"teacher_disagreement_score":0.006096152,"about_ca_system_score_codex":0.002147079,"about_ca_system_score_gemma":0.0022809978,"threshold_uncertainty_score":0.019265294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052631866,0.0002174513,0.93942386,0.00028494082,0.00007413713,0.0000875352,0.000055884208,0.00017450089,0.007049812],"genre_scores_gemma":[0.92846185,0.00013198164,0.063796975,0.00012652163,0.00005163283,0.00014679423,0.00009396973,0.00006745091,0.0071227388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929714,0.00030120724,0.000019650808,0.00013037802,0.000115252464,0.00013643304],"domain_scores_gemma":[0.9992823,0.00036766514,0.00008949045,0.00006004611,0.0001208124,0.000079734775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012765779,0.0012700707,0.0013665596,0.00056385936,0.00046821605,0.0009672306,0.0017046161,0.0012839485,0.0040992536],"category_scores_gemma":[0.0017412199,0.0005843419,0.00077007664,0.0007355697,0.00061081705,0.0012156832,0.0013001511,0.0010265318,0.0004019287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001446182,0.00007761405,0.00014432639,0.000035533925,0.000044399327,0.00009460806,0.000033712575,0.97033405,0.00158032,0.008170256,0.0013921306,0.017948449],"study_design_scores_gemma":[0.00001033002,0.000051722458,0.00003583291,0.0000017677974,0.0000059427443,0.000011682406,0.000009584277,0.99731904,0.0002044641,0.0021810438,0.00016497214,0.0000037308955],"about_ca_topic_score_codex":0.0028943412,"about_ca_topic_score_gemma":0.0021262546,"teacher_disagreement_score":0.0040992536,"about_ca_system_score_codex":0.0007471431,"about_ca_system_score_gemma":0.00092814566,"threshold_uncertainty_score":0.01371336},"labels":[],"label_agreement":null},{"id":"W2038261056","doi":"10.1016/j.cor.2004.11.015","title":"Capacity improvement of an unreliable production line—an analytical approach","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Windsor","funders":"","keywords":"Downtime; Computer science; Production line; Production (economics); Product (mathematics); Sequence (biology); Mathematical optimization; Process (computing); Unavailability; Heuristic; Line (geometry); Reliability engineering; Workstation; Algorithm; Mathematics; Engineering","score_opus":0.09104954014719006,"score_gpt":0.3508131759369289,"score_spread":0.2597636357897388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038261056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044814445,0.0012001903,0.9344526,0.00089057337,0.00012567309,0.00008479586,0.00006914958,0.00022326442,0.018139346],"genre_scores_gemma":[0.9660294,0.0012871763,0.02634177,0.00007167618,0.0001778032,0.00008735815,0.000035049074,0.000072295,0.0058974093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991498,0.00035795,0.000021090511,0.00008712586,0.00023514718,0.00014887896],"domain_scores_gemma":[0.9981034,0.0011077541,0.00022461412,0.000081710394,0.00040578374,0.000076780016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014904062,0.0011131916,0.0011812425,0.0021484625,0.0012138394,0.0024149858,0.0022768397,0.0011525709,0.002524512],"category_scores_gemma":[0.0048626526,0.00080267614,0.0008847551,0.0023502638,0.0016665505,0.0019714085,0.0011625722,0.0012322606,0.00017713505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027463968,0.0000240664,0.00020578892,0.00007377189,0.000016469134,0.00014721147,0.00007869591,0.95956737,0.00122075,0.031135125,0.0006644497,0.0068388297],"study_design_scores_gemma":[0.0000013167516,0.00001315492,0.00005286953,0.000007452695,0.000009305729,0.000013991339,0.000026589083,0.9929957,0.00025480072,0.0063796123,0.00024005811,0.0000052171094],"about_ca_topic_score_codex":0.009014719,"about_ca_topic_score_gemma":0.0060146493,"teacher_disagreement_score":0.009014719,"about_ca_system_score_codex":0.0028502212,"about_ca_system_score_gemma":0.0018507413,"threshold_uncertainty_score":0.020679891},"labels":[],"label_agreement":null},{"id":"W2039145886","doi":"10.1016/s0305-0548(99)00088-x","title":"Fast heuristics for large scale covering-location problems","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Université de Montréal; HEC Montréal","funders":"","keywords":"Heuristics; Set (abstract data type); Scale (ratio); Computer science; Mathematical optimization; Algorithm; Mathematics; Cartography; Geography","score_opus":0.10459350773327578,"score_gpt":0.32221026002135955,"score_spread":0.21761675228808378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039145886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1400272,0.0064114253,0.819958,0.001968993,0.00059801183,0.00087111746,0.0018853843,0.0064238245,0.021856172],"genre_scores_gemma":[0.36805037,0.0011155619,0.6212542,0.0005124955,0.0002745764,0.0008955598,0.0022879697,0.0008198916,0.0047894097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978205,0.00094385503,0.00011219191,0.00028997115,0.0003467667,0.00048676206],"domain_scores_gemma":[0.983588,0.01380679,0.000619849,0.0008343371,0.00065312977,0.00049802917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042793746,0.0026282854,0.0034553949,0.0030790563,0.0018818097,0.0031269658,0.0039982665,0.0036201184,0.010079347],"category_scores_gemma":[0.014582756,0.0022779135,0.0019412457,0.005652482,0.001734095,0.0047045597,0.0025877985,0.0028930192,0.00133748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066878524,0.00033137598,0.0008435706,0.0006276862,0.00013426224,0.0001473393,0.00020611307,0.85690945,0.0010173426,0.013543355,0.013572169,0.11199862],"study_design_scores_gemma":[0.0003688248,0.000118725045,0.00025026576,0.00003840253,0.000056928457,0.00005970986,0.000102126345,0.9673207,0.0004001122,0.029398689,0.0018653781,0.000020205354],"about_ca_topic_score_codex":0.014047392,"about_ca_topic_score_gemma":0.020383874,"teacher_disagreement_score":0.014047392,"about_ca_system_score_codex":0.0030592373,"about_ca_system_score_gemma":0.003329343,"threshold_uncertainty_score":0.033718824},"labels":[],"label_agreement":null},{"id":"W2039293736","doi":"10.1016/s0305-0548(99)00105-7","title":"On the circle closest to a set of points","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"McMaster University; University of Waterloo","funders":"","keywords":"Minimax; Mathematics; Mathematical optimization; Circumference; Set (abstract data type); Heuristic; Range (aeronautics); Variance (accounting); Explained sum of squares; Algorithm; Combinatorics; Computer science; Statistics; Geometry","score_opus":0.16855253259855726,"score_gpt":0.34175836360942075,"score_spread":0.17320583101086348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039293736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31255907,0.0017603103,0.3753376,0.003824695,0.0017404659,0.0018359034,0.0045245755,0.0031923277,0.29522505],"genre_scores_gemma":[0.7664804,0.0013697394,0.15748414,0.00031110703,0.00038269206,0.00087592367,0.005594576,0.00041791808,0.06708353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981529,0.0003614072,0.000050255505,0.00046461905,0.0007518291,0.00021910503],"domain_scores_gemma":[0.9974711,0.00067149673,0.00037300872,0.00031945377,0.000944904,0.00021994865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040631308,0.0013229072,0.0012992944,0.0032449176,0.0018350466,0.002549874,0.0014140449,0.0017578155,0.019920208],"category_scores_gemma":[0.007841934,0.0003828377,0.0004944081,0.0021483798,0.0016539627,0.0017185598,0.003403861,0.0010831996,0.008199132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005819704,0.00047934783,0.01466975,0.0012113639,0.00030615318,0.003191979,0.004090986,0.060575154,0.0683651,0.38761917,0.07320866,0.38046268],"study_design_scores_gemma":[0.00088912935,0.0011356672,0.025536314,0.00067322963,0.00018799985,0.0030376979,0.004273001,0.19463648,0.06907286,0.32787052,0.37230387,0.00038323045],"about_ca_topic_score_codex":0.0037525531,"about_ca_topic_score_gemma":0.0023575278,"teacher_disagreement_score":0.019920208,"about_ca_system_score_codex":0.00081759854,"about_ca_system_score_gemma":0.0008202642,"threshold_uncertainty_score":0.06663972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008397214,0.0010061163,0.983008,0.00025376765,0.00018041095,0.0001252222,0.00018374324,0.00037755165,0.006467932],"genre_scores_gemma":[0.26594356,0.0014002216,0.7224358,0.00022505701,0.00024232152,0.0004077449,0.00045635828,0.00028140203,0.008607606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861753,0.00067848363,0.00006300538,0.00017324141,0.0002837096,0.00018413701],"domain_scores_gemma":[0.9960729,0.0031008462,0.00019577553,0.00025271386,0.0002524821,0.00012528367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002271295,0.0013155399,0.0018348125,0.0016324073,0.00093550346,0.0020671573,0.0023661645,0.0018332317,0.005872319],"category_scores_gemma":[0.008097594,0.0013842955,0.0013105209,0.002452055,0.0014859593,0.0022796146,0.001483782,0.0022001644,0.0006554855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005640848,0.000053978587,0.0001242631,0.000089458554,0.00003588747,0.000028525561,0.000036998135,0.91461146,0.00024564614,0.056389555,0.0024310495,0.025896693],"study_design_scores_gemma":[0.000029403229,0.000015381049,0.000049343107,0.000015941423,0.000011282309,0.00001160301,0.000013588287,0.9572093,0.00011299577,0.04102985,0.0014929252,0.000008339087],"about_ca_topic_score_codex":0.011868618,"about_ca_topic_score_gemma":0.014861861,"teacher_disagreement_score":0.011868618,"about_ca_system_score_codex":0.0031230205,"about_ca_system_score_gemma":0.0030013896,"threshold_uncertainty_score":0.023599088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021370046,0.0005252888,0.9716331,0.00023614115,0.00016095457,0.0001186567,0.00013622479,0.00035972436,0.005459846],"genre_scores_gemma":[0.21856906,0.0004338551,0.7771335,0.00018951429,0.00007022074,0.00026716446,0.0004292587,0.00018454391,0.0027227758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994962,0.00020405144,0.000019818359,0.000062229024,0.00010629256,0.00011145059],"domain_scores_gemma":[0.9990938,0.00053619465,0.00006265466,0.000065365624,0.00015238427,0.00008971374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105106,0.001104293,0.0014958291,0.0013043322,0.0006570028,0.00095764245,0.0012377051,0.0014289382,0.0046268404],"category_scores_gemma":[0.0023864736,0.0007326514,0.0013541649,0.001492288,0.0004843442,0.0011966896,0.0011871312,0.0012729429,0.00068120845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015620382,0.00015008257,0.0002966643,0.00013673869,0.000049181537,0.00007125697,0.00004572731,0.88802695,0.0024877351,0.008800671,0.004139221,0.095639534],"study_design_scores_gemma":[0.000030815223,0.00003512523,0.00007229099,0.000014685462,0.000014442984,0.000020765967,0.00001381495,0.9955487,0.0003167838,0.0032349655,0.0006908223,0.0000067631536],"about_ca_topic_score_codex":0.00538217,"about_ca_topic_score_gemma":0.0052216537,"teacher_disagreement_score":0.00538217,"about_ca_system_score_codex":0.0011818386,"about_ca_system_score_gemma":0.0018240727,"threshold_uncertainty_score":0.015478313},"labels":[],"label_agreement":null},{"id":"W2046018684","doi":"10.1016/s0305-0548(01)00033-8","title":"Heuristic concentration for the p-median: an example demonstrating how and why it works","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"University of Alberta","funders":"","keywords":"Heuristic; Operations research; Computer science; Set (abstract data type); Space (punctuation); Quality (philosophy); Mathematical optimization; Node (physics); Mathematics; Engineering","score_opus":0.23502442838561316,"score_gpt":0.33217150630182934,"score_spread":0.09714707791621618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046018684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04531378,0.0007991076,0.89860964,0.0019203922,0.00016711529,0.00015626464,0.00014648671,0.0008053174,0.052082043],"genre_scores_gemma":[0.3420223,0.0004832499,0.64582574,0.00030402624,0.000074651914,0.00017089787,0.0001223945,0.0003367283,0.010660018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890614,0.0005486019,0.000045625817,0.00013569646,0.00021620076,0.00014768574],"domain_scores_gemma":[0.9957288,0.0033167524,0.00011634388,0.00032996098,0.0003769786,0.00013111092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021058195,0.0007064487,0.0011976565,0.0010530314,0.0023547402,0.0025477125,0.0019895013,0.0031829525,0.012407251],"category_scores_gemma":[0.012610186,0.00042540312,0.0009484319,0.0022516588,0.0016841657,0.0028172415,0.00224236,0.0016255017,0.0012697744],"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.00052028993,0.00024517623,0.0013993275,0.0004506966,0.00008282897,0.0007781304,0.0007006617,0.30883542,0.0026173063,0.5241675,0.017428711,0.14277394],"study_design_scores_gemma":[0.00014710828,0.00016564199,0.00023718514,0.000059640734,0.000043166598,0.00037342674,0.0002765645,0.6613324,0.002551642,0.32158306,0.013186551,0.000043549535],"about_ca_topic_score_codex":0.0061989003,"about_ca_topic_score_gemma":0.0068188286,"teacher_disagreement_score":0.012407251,"about_ca_system_score_codex":0.0014004316,"about_ca_system_score_gemma":0.0016724588,"threshold_uncertainty_score":0.04150635},"labels":[],"label_agreement":null},{"id":"W2046059743","doi":"10.1016/j.cor.2005.02.047","title":"Multi-item dynamic production-distribution planning in process industries with divergent finishing stages","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":72,"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":"Bottleneck; Mathematical optimization; Computer science; Production (economics); Process (computing); Linear programming; Production planning; Piecewise linear function; Integer programming; Piecewise; Mathematics","score_opus":0.05081746576595451,"score_gpt":0.3466062186514448,"score_spread":0.2957887528854903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046059743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29050142,0.0005174541,0.7020307,0.0002671466,0.00005379648,0.00019240032,0.0002459003,0.00017420221,0.0060169334],"genre_scores_gemma":[0.9196496,0.00026487684,0.07546587,0.000028222988,0.000019023304,0.00018116063,0.0001884935,0.00004171071,0.004161065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993432,0.00023360601,0.000029506848,0.00013475938,0.00011766853,0.00014112807],"domain_scores_gemma":[0.998395,0.0011188121,0.0001642216,0.00006139691,0.00014598385,0.00011450551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016407906,0.0011038723,0.002276176,0.0010419223,0.0011780368,0.0015380329,0.0019309802,0.0014143499,0.0024346947],"category_scores_gemma":[0.0026179175,0.0017829608,0.0011498174,0.0022038112,0.0010439209,0.0017594678,0.00111408,0.0010451274,0.00024332054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007454632,0.00003079884,0.00022784778,0.000032906108,0.00001343007,0.000063089254,0.000016499713,0.9945688,0.00039420428,0.0014629721,0.00007554065,0.0030394366],"study_design_scores_gemma":[0.000011948023,0.000045473505,0.00014202892,0.0000030691208,0.000008892838,0.000008269826,0.000012069602,0.99750745,0.00028555345,0.0018915402,0.00007785044,0.0000058983646],"about_ca_topic_score_codex":0.0108674895,"about_ca_topic_score_gemma":0.00995371,"teacher_disagreement_score":0.0108674895,"about_ca_system_score_codex":0.0016201887,"about_ca_system_score_gemma":0.0011659181,"threshold_uncertainty_score":0.021608412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080971666,0.0009272585,0.8910635,0.0003757457,0.0004047716,0.0004009917,0.0002423455,0.0027351298,0.0228786],"genre_scores_gemma":[0.33729932,0.00031427588,0.65433645,0.00020848974,0.00011372379,0.0006300909,0.000291134,0.00044084003,0.00636579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944705,0.00021051253,0.000022723432,0.000061349165,0.00017503607,0.00008335128],"domain_scores_gemma":[0.9992322,0.0003985355,0.000051608567,0.000102851955,0.00017661386,0.000038265243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010610704,0.0007375948,0.0013087796,0.0010411643,0.00093049166,0.001027521,0.0022092273,0.0014600494,0.006515986],"category_scores_gemma":[0.002407031,0.00075942127,0.0010520016,0.001536332,0.0006667115,0.00097248005,0.00094222714,0.0010298501,0.0011617906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021979416,0.00014449481,0.00029027858,0.000092378395,0.000060851387,0.00007263397,0.000054777294,0.87064666,0.0020356246,0.005246831,0.0031445462,0.117991135],"study_design_scores_gemma":[0.00006109828,0.00005080334,0.00006398272,0.000005574361,0.0000146237735,0.000014088942,0.000008145987,0.99699295,0.0003492407,0.0017384455,0.00069522933,0.0000058639666],"about_ca_topic_score_codex":0.009492086,"about_ca_topic_score_gemma":0.008440282,"teacher_disagreement_score":0.009492086,"about_ca_system_score_codex":0.00095230335,"about_ca_system_score_gemma":0.0017106117,"threshold_uncertainty_score":0.021798134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012398612,0.00018709307,0.9802131,0.00011304152,0.00015383589,0.000119239514,0.0000504772,0.0004478936,0.006316668],"genre_scores_gemma":[0.08239509,0.00013709451,0.9138991,0.00009226897,0.0000606772,0.00026329592,0.0001492819,0.00019532334,0.0028077986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928015,0.0002375716,0.000026254269,0.000080008525,0.0002793552,0.000096724856],"domain_scores_gemma":[0.99920815,0.00045025334,0.000058273166,0.00006883514,0.0001652925,0.00004917624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011463456,0.00096322235,0.0015758248,0.0013609573,0.0007479503,0.0013294518,0.0019485265,0.0016761387,0.0057913885],"category_scores_gemma":[0.002577033,0.0011504994,0.001480346,0.0015135421,0.0007735474,0.001099175,0.0014383319,0.002024837,0.0010661031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027316963,0.000299015,0.00034599288,0.00017312082,0.0000596007,0.00013014404,0.0001147513,0.74160707,0.00466167,0.02226255,0.0043177553,0.22575514],"study_design_scores_gemma":[0.000043681757,0.000063648295,0.00006219677,0.000017180491,0.00001518652,0.00002321946,0.00001159315,0.9932035,0.00068185414,0.004665039,0.001203877,0.000009003612],"about_ca_topic_score_codex":0.0027562317,"about_ca_topic_score_gemma":0.002347306,"teacher_disagreement_score":0.0057913885,"about_ca_system_score_codex":0.0006656408,"about_ca_system_score_gemma":0.0011438472,"threshold_uncertainty_score":0.019374132},"labels":[],"label_agreement":null},{"id":"W2047206123","doi":"10.1016/j.cor.2013.11.010","title":"Using robust optimization for distribution and inventory planning for a large pulp producer","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Université Laval","funders":"Linköpings Universitet","keywords":"Truck; Train; Operations research; Computer science; Robust optimization; Stock (firearms); Inventory management; Stock management; Safety stock; Plan (archaeology); Operations management; Business; Supply chain; Mathematical optimization; Economics; Marketing; Mathematics","score_opus":0.38007242243603634,"score_gpt":0.4906539403902115,"score_spread":0.11058151795417515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047206123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947275,0.0004396651,0.29160848,0.001250619,0.000068886744,0.000108821885,0.0003277614,0.0009045149,0.010563723],"genre_scores_gemma":[0.9541986,0.00006954936,0.043102264,0.00002541467,0.000014249161,0.00003641449,0.000063494364,0.000053152005,0.002436961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979585,0.000076862474,0.000009660119,0.00004164129,0.00005073627,0.000025270838],"domain_scores_gemma":[0.99932265,0.0005055622,0.00004492086,0.000030627234,0.000062798004,0.000033440912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069438654,0.0005236564,0.00093711953,0.0004045021,0.00092632003,0.0012887623,0.0005644057,0.001203784,0.0023590366],"category_scores_gemma":[0.0016125552,0.00074942823,0.0005625764,0.00061639264,0.000433678,0.00078703754,0.00054317625,0.0007994564,0.00017644846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110066154,0.000046450834,0.00030248932,0.000021792588,0.000012924186,0.00014190363,0.000014832611,0.9898991,0.0027383973,0.0006877445,0.00018913238,0.0058352123],"study_design_scores_gemma":[0.000009132369,0.00003466344,0.00015358173,5.535157e-7,0.0000059330946,0.0000075284916,0.0000075321177,0.9986563,0.0006686812,0.00038817714,0.000063022,0.000004894315],"about_ca_topic_score_codex":0.014119459,"about_ca_topic_score_gemma":0.013543555,"teacher_disagreement_score":0.014119459,"about_ca_system_score_codex":0.0014513666,"about_ca_system_score_gemma":0.0014195862,"threshold_uncertainty_score":0.028074503},"labels":[],"label_agreement":null},{"id":"W2047599849","doi":"10.1016/j.cor.2014.06.016","title":"An innovative multi-agent search-and-rescue path planning approach","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mathematical optimization; Motion planning; Time horizon; Constraint (computer-aided design); Path (computing); Integer programming; Variety (cybernetics); Representation (politics); Relaxation (psychology); Computational complexity theory; Computation; Bellman equation; Algorithm; Mathematics; Artificial intelligence; Robot","score_opus":0.14433389054318788,"score_gpt":0.4048317940207116,"score_spread":0.2604979034775238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047599849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029390166,0.00012591474,0.9938286,0.00013261582,0.000081364844,0.000034367546,0.000017667966,0.00015974964,0.002680715],"genre_scores_gemma":[0.20971979,0.00031338047,0.78255826,0.00021688048,0.000114450726,0.0002982417,0.00008964828,0.00006743827,0.0066219326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999696,0.00006517128,0.00001324798,0.000065874396,0.0001281129,0.000031582564],"domain_scores_gemma":[0.9998054,0.0000686651,0.00002251561,0.000019931065,0.00005886633,0.0000246597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045076633,0.00072611345,0.0008448368,0.0006973792,0.00060669094,0.0008023068,0.0017236393,0.0012726681,0.0021713793],"category_scores_gemma":[0.0006725111,0.00040187046,0.0008129393,0.00067392905,0.000454716,0.00074185757,0.0015593813,0.00087849604,0.00045177466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072915325,0.00012452668,0.00042805987,0.00013740247,0.000105662046,0.00017122614,0.00009573249,0.7889625,0.0070044664,0.03949566,0.0035723818,0.15982954],"study_design_scores_gemma":[0.000012073017,0.00003206207,0.000047987916,0.000003928595,0.000011982389,0.00003578205,0.000008002969,0.99388736,0.00037351664,0.003988637,0.0015925233,0.00000612192],"about_ca_topic_score_codex":0.0024999494,"about_ca_topic_score_gemma":0.0029461347,"teacher_disagreement_score":0.0024999494,"about_ca_system_score_codex":0.0005062912,"about_ca_system_score_gemma":0.0011779885,"threshold_uncertainty_score":0.0072639585},"labels":[],"label_agreement":null},{"id":"W2049188596","doi":"10.1016/j.cor.2012.11.017","title":"Efficient symmetry breaking formulations for the job grouping problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"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":"Lexicographical order; Solver; Set (abstract data type); Reduction (mathematics); Computer science; Symmetry breaking; Mathematical optimization; Relaxation (psychology); Variable (mathematics); Order (exchange); Upper and lower bounds; Symmetry (geometry); Mathematics; Algorithm; Combinatorics","score_opus":0.059079703233797375,"score_gpt":0.34241495667157845,"score_spread":0.2833352534377811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049188596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025944525,0.00038692236,0.9537086,0.0006097674,0.0001774135,0.00022493485,0.0002898286,0.00015777166,0.018500233],"genre_scores_gemma":[0.42017847,0.00095090433,0.5579055,0.0004392704,0.00033913963,0.0007650593,0.0010169591,0.00046278717,0.017941883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904317,0.00035507316,0.000043791544,0.00009567662,0.00028231688,0.00017983974],"domain_scores_gemma":[0.99824893,0.00087775337,0.00018348683,0.0003239231,0.00024238956,0.00012348422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020873812,0.00097175484,0.0010506115,0.0007252904,0.00088385906,0.0016021332,0.0022364745,0.0011912816,0.009172192],"category_scores_gemma":[0.0048007704,0.0005621741,0.0013909208,0.0012848416,0.0008789038,0.0026469473,0.0019601944,0.0026806083,0.0013159956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002974124,0.00033806133,0.00031316187,0.00021099324,0.000045787703,0.00013027106,0.00017022152,0.4689254,0.0028020523,0.43504927,0.014850769,0.076866604],"study_design_scores_gemma":[0.00006392585,0.000059319023,0.00008988378,0.000017764694,0.000012100139,0.000034307326,0.00005286379,0.6959261,0.00044797646,0.30080092,0.0024814869,0.000013426706],"about_ca_topic_score_codex":0.0015062683,"about_ca_topic_score_gemma":0.0021180916,"teacher_disagreement_score":0.009172192,"about_ca_system_score_codex":0.0011227962,"about_ca_system_score_gemma":0.0018930339,"threshold_uncertainty_score":0.030684054},"labels":[],"label_agreement":null},{"id":"W2049314332","doi":"10.1016/j.cor.2004.06.014","title":"Dynamic R&amp;D with strategic behavior","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; HEC Montréal","keywords":"Microeconomics; Production (economics); Context (archaeology); Order (exchange); Economics; Nash equilibrium; Pareto principle; Time horizon; Function (biology); Investment (military); Welfare; Mathematical economics; Operations management; Finance; Market economy","score_opus":0.15625817280286725,"score_gpt":0.3423673826249392,"score_spread":0.18610920982207196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049314332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14950293,0.0010793705,0.74813217,0.0042975172,0.00020877969,0.00016356031,0.0005230158,0.00033746415,0.09575521],"genre_scores_gemma":[0.92640054,0.0006778171,0.036590245,0.0004129228,0.00008567599,0.000111948946,0.00020039677,0.00005877865,0.03546158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808025,0.00075920194,0.0000646936,0.0004079143,0.00041157045,0.0002763493],"domain_scores_gemma":[0.996786,0.001726289,0.00046530124,0.00042275354,0.00031765638,0.0002819932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016506261,0.0008106677,0.00097419095,0.0010869757,0.0007116853,0.003119439,0.0012133897,0.0018980425,0.010720153],"category_scores_gemma":[0.007881455,0.00073689537,0.00071713736,0.0013929623,0.0015081392,0.0035764466,0.00198157,0.00141,0.0016361775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000124362,0.00014225197,0.0029309224,0.00009122533,0.00009086664,0.00042876072,0.0001367326,0.15049724,0.0020229076,0.80515534,0.003886289,0.034493137],"study_design_scores_gemma":[0.000056279187,0.000068405956,0.00082310796,0.000021397685,0.00003985817,0.00022345042,0.00007902017,0.40119734,0.00085007487,0.59174806,0.004863109,0.000029896662],"about_ca_topic_score_codex":0.00240926,"about_ca_topic_score_gemma":0.0025557934,"teacher_disagreement_score":0.010720153,"about_ca_system_score_codex":0.001366384,"about_ca_system_score_gemma":0.0014243874,"threshold_uncertainty_score":0.035862505},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03812503,0.00035116225,0.9568992,0.00022492609,0.00011987697,0.000075236116,0.000116161485,0.00029044237,0.0037979712],"genre_scores_gemma":[0.77072495,0.00029021568,0.224137,0.00017937396,0.00010517112,0.00021865136,0.00031163642,0.00014866568,0.0038843153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972945,0.000113582406,0.000008484119,0.00003608356,0.000066888984,0.000045489734],"domain_scores_gemma":[0.99909437,0.0005191769,0.00008899494,0.00006427382,0.00016379244,0.00006942596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007266783,0.0006868951,0.0009334939,0.00061687425,0.00049169915,0.00074659724,0.00083915837,0.0007597284,0.0029208616],"category_scores_gemma":[0.002199056,0.00054435956,0.0005110031,0.0007294161,0.0006658559,0.00058055134,0.00088792207,0.0008545968,0.0003369334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010486973,0.00004820119,0.00016897771,0.000074098585,0.0000242951,0.000058067097,0.000030887593,0.9622371,0.002540995,0.009379074,0.0017970208,0.02353649],"study_design_scores_gemma":[0.000008953415,0.000015811609,0.000026859567,0.0000024635822,0.0000026658693,0.0000038591907,0.0000042188485,0.9962901,0.00033051433,0.0031766174,0.0001353132,0.0000026163443],"about_ca_topic_score_codex":0.0030849543,"about_ca_topic_score_gemma":0.0033284288,"teacher_disagreement_score":0.0030849543,"about_ca_system_score_codex":0.00059304846,"about_ca_system_score_gemma":0.00082256505,"threshold_uncertainty_score":0.009771287},"labels":[],"label_agreement":null},{"id":"W2050675408","doi":"10.1016/j.cor.2012.02.008","title":"Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":99,"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; Pairwise comparison; Simulated annealing; Heuristics; Algorithm; Population; Combinatorial optimization; Mathematical optimization; Graph; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.10095449481360119,"score_gpt":0.43985149621535835,"score_spread":0.33889700140175716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050675408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006855175,0.00013772747,0.99127454,0.0002276293,0.000028096445,0.000057684585,0.00004426764,0.00016295524,0.0012118869],"genre_scores_gemma":[0.27994052,0.00034283506,0.7134056,0.00026170327,0.00019614058,0.00046629898,0.00056296086,0.00020752168,0.0046163583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989146,0.0005037885,0.000048715712,0.00024732822,0.00019126375,0.000094362156],"domain_scores_gemma":[0.9942432,0.004593893,0.00029472413,0.0002939261,0.00040651573,0.00016766886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019622012,0.0015052954,0.0022185103,0.0017674883,0.00081911293,0.0016513679,0.0020977277,0.001968181,0.0035354812],"category_scores_gemma":[0.009104242,0.00068646384,0.00092403294,0.0021020512,0.001120918,0.0031419487,0.0018916875,0.0023034918,0.0005048234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009685555,0.00018203454,0.00053525175,0.00013685734,0.00005395308,0.000051431743,0.00008585297,0.8631552,0.0008198224,0.049121633,0.00407958,0.081681564],"study_design_scores_gemma":[0.000024606661,0.000026862888,0.000032988737,0.0000045688225,0.000007010905,0.00000827475,0.00000880437,0.9769843,0.000113463204,0.022550678,0.00023428742,0.000004127225],"about_ca_topic_score_codex":0.0040394855,"about_ca_topic_score_gemma":0.005865119,"teacher_disagreement_score":0.0040394855,"about_ca_system_score_codex":0.0009837174,"about_ca_system_score_gemma":0.0018408587,"threshold_uncertainty_score":0.01182735},"labels":[],"label_agreement":null},{"id":"W2052916058","doi":"10.1016/j.cor.2009.02.022","title":"Scheduling identical parallel machines and operators within a period based changing mode","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"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 à Chicoutimi; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Job shop scheduling; Computer science; Scheduling (production processes); Operator (biology); Mathematical optimization; Heuristic; Mathematics; Artificial intelligence; Schedule","score_opus":0.03143613342911021,"score_gpt":0.33225399679858925,"score_spread":0.300817863369479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052916058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38141572,0.00014641794,0.6111181,0.00018882733,0.00017478135,0.00026230043,0.00010455141,0.0007459197,0.0058434783],"genre_scores_gemma":[0.89477867,0.00005766753,0.10277532,0.000043857344,0.000044844368,0.00009411368,0.0000601556,0.000054650096,0.0020909044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999534,0.0001382909,0.000023610752,0.00013201976,0.00007200518,0.000100084246],"domain_scores_gemma":[0.99852043,0.00056009187,0.00016975263,0.0003783226,0.0001946049,0.0001768191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008803462,0.00033564903,0.0006770487,0.00036382047,0.0006590921,0.00080553885,0.0017342577,0.0004121592,0.003099794],"category_scores_gemma":[0.0022306535,0.0003448966,0.0005143498,0.00070254994,0.00054480415,0.0009340036,0.00071646384,0.0006522898,0.0002606619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061855633,0.0007799672,0.006378096,0.00026922955,0.00029891453,0.0004533094,0.0005130306,0.64766073,0.06017802,0.033920497,0.0050417474,0.23832093],"study_design_scores_gemma":[0.00010249811,0.0004678319,0.0010196234,0.0000038554876,0.000047187747,0.00009843235,0.00007978862,0.9828538,0.0050208806,0.009020432,0.0012644364,0.000021237645],"about_ca_topic_score_codex":0.0015280261,"about_ca_topic_score_gemma":0.0019737845,"teacher_disagreement_score":0.003099794,"about_ca_system_score_codex":0.00045713858,"about_ca_system_score_gemma":0.0010530018,"threshold_uncertainty_score":0.010369837},"labels":[],"label_agreement":null},{"id":"W2054278883","doi":"10.1016/j.cor.2004.09.039","title":"Game-theoretic analysis of an ancient Chinese horse race problem","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"McMaster University","funders":"National University of Singapore","keywords":"Stochastic game; Mathematics; Mathematical economics; Regular polygon; Combinatorics; Probabilistic logic; Group (periodic table); Statistics","score_opus":0.04616021123994494,"score_gpt":0.3286350011548247,"score_spread":0.28247478991487973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054278883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6373904,0.0017786003,0.1844159,0.00618165,0.00019977543,0.00018042614,0.00045392357,0.00007715262,0.16932215],"genre_scores_gemma":[0.976108,0.0004855493,0.0072845905,0.00015653369,0.000082393504,0.000059580365,0.0001169162,0.000018092722,0.01568823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996897,0.00012965398,0.0000106012685,0.000038252983,0.00005113638,0.00008073589],"domain_scores_gemma":[0.9991091,0.0005998994,0.000065732136,0.000038619717,0.00008385385,0.000102826336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487479,0.0004357122,0.0006253449,0.0006156619,0.0011009843,0.0014179351,0.0014498872,0.001258571,0.007822862],"category_scores_gemma":[0.0026791503,0.0002657254,0.000533193,0.0006034571,0.0018826616,0.0019875388,0.0009385304,0.00118187,0.00017588606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007847638,0.000086942855,0.00082619075,0.000090997404,0.000035686076,0.00020518435,0.00032913152,0.20605323,0.00043433887,0.7820998,0.0035923838,0.0061676186],"study_design_scores_gemma":[0.000043417167,0.000035970555,0.0009677485,0.000019892239,0.000027228338,0.0000496754,0.00027593432,0.6129113,0.00012650242,0.3830754,0.0024479358,0.0000189994],"about_ca_topic_score_codex":0.016435228,"about_ca_topic_score_gemma":0.010377403,"teacher_disagreement_score":0.016435228,"about_ca_system_score_codex":0.0021863896,"about_ca_system_score_gemma":0.0019033889,"threshold_uncertainty_score":0.03267914},"labels":[],"label_agreement":null},{"id":"W2054920135","doi":"10.1016/j.cor.2014.05.010","title":"New heuristic algorithms for solving the planar p-median problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":63,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Heuristics; Heuristic; Genetic algorithm; Algorithm; Planar; Mathematical optimization; Variable (mathematics); Variable neighborhood search; Computer science; Mathematics; Metaheuristic","score_opus":0.094424063670145,"score_gpt":0.33648797718862883,"score_spread":0.24206391351848383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054920135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012640094,0.00094669254,0.97569704,0.00054534146,0.00026471147,0.00017644704,0.00022893492,0.00074883114,0.008751956],"genre_scores_gemma":[0.08175625,0.0006718332,0.91118234,0.0002452017,0.00016804112,0.0003920095,0.00058043865,0.0001811912,0.004822572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914,0.00026707046,0.000053414955,0.00018275033,0.0002200313,0.00013679329],"domain_scores_gemma":[0.9980318,0.0012935913,0.00015249633,0.00016068312,0.00025996592,0.00010146014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014107581,0.0014533278,0.0015439352,0.0022149305,0.0012150783,0.0019939372,0.0031917032,0.0025879068,0.008408611],"category_scores_gemma":[0.0062093404,0.0009661484,0.0015211869,0.0036527417,0.0010094729,0.0029665274,0.0018581154,0.0024211106,0.0012040908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029152483,0.0002807065,0.0005688862,0.00037845876,0.00010990449,0.000121424375,0.00011455887,0.65732086,0.0016489212,0.04376828,0.015279376,0.28011706],"study_design_scores_gemma":[0.00016830913,0.00007698217,0.00015090455,0.000032909345,0.000037321195,0.00007228848,0.00007157546,0.9511899,0.00066902477,0.04253153,0.0049782177,0.000021116623],"about_ca_topic_score_codex":0.006195597,"about_ca_topic_score_gemma":0.009902705,"teacher_disagreement_score":0.008408611,"about_ca_system_score_codex":0.0017542704,"about_ca_system_score_gemma":0.0024085713,"threshold_uncertainty_score":0.028129578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028068786,0.0011704089,0.9631614,0.0004155499,0.00017556894,0.00016087147,0.00016461685,0.00030153967,0.0063812756],"genre_scores_gemma":[0.4649036,0.0012737465,0.5256185,0.00025486606,0.00023202786,0.00040495332,0.0003722065,0.000239082,0.006701107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987992,0.00059730123,0.000057188794,0.00015348817,0.0002070213,0.00018574037],"domain_scores_gemma":[0.9955315,0.003686316,0.00023222591,0.00016054769,0.00024425003,0.00014519872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028399322,0.00096239086,0.0015552235,0.0017004295,0.0009911007,0.001680653,0.0022594107,0.0016388358,0.0039631566],"category_scores_gemma":[0.0074721985,0.0013366764,0.0012398816,0.0022228782,0.0016294399,0.001996897,0.0014061173,0.0016538815,0.00036397483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040616364,0.00003529087,0.00011933203,0.00004571684,0.000022387061,0.000017060942,0.000030065443,0.96194756,0.00013311942,0.0230902,0.0011140049,0.013404661],"study_design_scores_gemma":[0.000027224733,0.000016931632,0.00006217189,0.000010563088,0.000008994912,0.000006621877,0.000014389875,0.9828316,0.000081556,0.016223557,0.00070948334,0.000006966424],"about_ca_topic_score_codex":0.017214164,"about_ca_topic_score_gemma":0.020499645,"teacher_disagreement_score":0.017214164,"about_ca_system_score_codex":0.0030029668,"about_ca_system_score_gemma":0.002851966,"threshold_uncertainty_score":0.034227967},"labels":[],"label_agreement":null},{"id":"W2061532314","doi":"10.1016/j.cor.2007.02.008","title":"A global approach for designing reliable WDM networks and grooming the traffic","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optical Network Technologies","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":"Traffic grooming; Computer science; Wavelength-division multiplexing; Computer network; Distributed computing","score_opus":0.0428369242676859,"score_gpt":0.3223171592712371,"score_spread":0.27948023500355124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061532314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003397711,0.00022438692,0.99282384,0.00015270573,0.000033887696,0.000029014363,0.000015080544,0.00011293012,0.0032105334],"genre_scores_gemma":[0.25526384,0.001295288,0.73440903,0.00029846394,0.00016635483,0.00028449905,0.00010904523,0.00025331948,0.007920153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995498,0.00013572331,0.000021124564,0.00010015219,0.0001407651,0.00005251372],"domain_scores_gemma":[0.9993981,0.00016798617,0.000055362267,0.0001393926,0.00020204668,0.000037037866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012340747,0.0015250187,0.0009839184,0.0008378054,0.001014354,0.0016213377,0.0011888909,0.0009376612,0.0019725056],"category_scores_gemma":[0.0012154359,0.0006242623,0.0008921649,0.0007378957,0.0013891053,0.0024512657,0.0014040873,0.0015119676,0.00046918553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009910621,0.00009783172,0.0009908456,0.00045581642,0.00015886055,0.00018829746,0.00036732072,0.4525249,0.04545008,0.33971682,0.004087753,0.15586238],"study_design_scores_gemma":[0.000025128798,0.00032429205,0.00040969517,0.000088286666,0.00020835652,0.00024180133,0.00016916697,0.76283586,0.020429423,0.18967554,0.025528526,0.00006385181],"about_ca_topic_score_codex":0.0006056781,"about_ca_topic_score_gemma":0.0021333445,"teacher_disagreement_score":0.0019725056,"about_ca_system_score_codex":0.00078512443,"about_ca_system_score_gemma":0.0011688303,"threshold_uncertainty_score":0.0065986514},"labels":[],"label_agreement":null},{"id":"W2063042933","doi":"10.1016/j.cor.2006.02.002","title":"Parking buses in a depot using block patterns: A Benders decomposition approach for minimizing type mismatches","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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","funders":"","keywords":"Depot; Benders' decomposition; Block (permutation group theory); Computer science; Decomposition; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.14713577790120155,"score_gpt":0.42671062050840447,"score_spread":0.2795748426072029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063042933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025687661,0.0000639134,0.97184,0.00006286163,0.000018913965,0.00006804156,0.00011620678,0.00015616886,0.0019862389],"genre_scores_gemma":[0.29512712,0.00015879702,0.69854015,0.000059946775,0.000024814224,0.00023172465,0.00037849767,0.00026755006,0.0052113966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947435,0.00019937173,0.00002512497,0.00010032481,0.00011219924,0.000088601046],"domain_scores_gemma":[0.99947995,0.00021298131,0.00006643287,0.00006462192,0.00012321452,0.00005274488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010261975,0.0012116128,0.0017408669,0.0011408145,0.0006044069,0.001095642,0.0014884893,0.0013463368,0.004599401],"category_scores_gemma":[0.0021561761,0.0013571525,0.0014020978,0.0016485811,0.0004213722,0.0018516673,0.00085809076,0.00092277786,0.00058690354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012370684,0.000075897326,0.0004569414,0.000056547902,0.00004311824,0.000027758024,0.00004015778,0.94516057,0.0024825498,0.008002129,0.0008462055,0.04268453],"study_design_scores_gemma":[0.000007434647,0.000027116288,0.00008913256,0.0000037515217,0.000010379743,0.000006913357,0.0000140379525,0.9948285,0.0004906521,0.0042654565,0.00025259872,0.000004085172],"about_ca_topic_score_codex":0.006185282,"about_ca_topic_score_gemma":0.0073121274,"teacher_disagreement_score":0.006185282,"about_ca_system_score_codex":0.0007599066,"about_ca_system_score_gemma":0.001415599,"threshold_uncertainty_score":0.015386522},"labels":[],"label_agreement":null},{"id":"W2064815755","doi":"10.1016/j.cor.2006.12.024","title":"Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"York University","funders":"Bilkent Üniversitesi; National Science Council","keywords":"Polling system; Polling; Markov chain; Queue; Computer science; Decomposition; Flexible manufacturing system; Set (abstract data type); Product type; Product (mathematics); Type (biology); Mathematical optimization; Mathematics","score_opus":0.07767430333063105,"score_gpt":0.33852048345445374,"score_spread":0.26084618012382266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064815755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99563736,0.00004253792,0.0034430227,0.000029910618,0.000012866299,0.0000173061,0.00002511114,0.00014842804,0.00064349844],"genre_scores_gemma":[0.99948525,0.000007768286,0.0002947143,0.0000028944676,0.0000016545979,0.0000027537803,0.0000132024725,0.0000029019966,0.0001888747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935466,0.00016810547,0.00003877744,0.0001046907,0.00012706318,0.00020671214],"domain_scores_gemma":[0.99709237,0.001618347,0.0002221488,0.0001318037,0.00064829295,0.00028708982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008971299,0.00077604485,0.0009343192,0.0005717384,0.0010130903,0.00087372435,0.000674223,0.00076832366,0.0022240067],"category_scores_gemma":[0.002326381,0.0002727612,0.00038656406,0.00045751868,0.00062826916,0.0006556801,0.0004440031,0.00042055978,0.00022677422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01174253,0.0011417567,0.014289807,0.000365459,0.00016054232,0.0007670251,0.00040120003,0.8489503,0.08292808,0.0009137634,0.00058792834,0.03775151],"study_design_scores_gemma":[0.00010056104,0.0027164365,0.006464378,0.0000043910145,0.000064879605,0.000051892002,0.00013096708,0.97319806,0.01704109,0.000114491086,0.000081241786,0.000031528318],"about_ca_topic_score_codex":0.011962394,"about_ca_topic_score_gemma":0.0046734065,"teacher_disagreement_score":0.011962394,"about_ca_system_score_codex":0.0009533783,"about_ca_system_score_gemma":0.000832783,"threshold_uncertainty_score":0.023785532},"labels":[],"label_agreement":null},{"id":"W2066242836","doi":"10.1016/j.cor.2010.10.030","title":"A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Extension (predicate logic); Limit (mathematics); Computer science; Mathematics","score_opus":0.1042146238617913,"score_gpt":0.32899515471905433,"score_spread":0.22478053085726302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066242836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5964676,0.0034341542,0.32867268,0.0029517147,0.000494717,0.00049883826,0.001974958,0.0015342179,0.063971095],"genre_scores_gemma":[0.85927397,0.0008796857,0.13462394,0.00030551272,0.00010737963,0.00041340047,0.0008469082,0.0002355348,0.0033136157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908304,0.0004715916,0.000048213533,0.000109662295,0.00017915088,0.00010832992],"domain_scores_gemma":[0.98571706,0.012480175,0.00035665286,0.0005862302,0.00065387663,0.00020600096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023452656,0.0010954211,0.0014178642,0.0015214448,0.0010334803,0.0020086935,0.0023553339,0.0027936604,0.0077548036],"category_scores_gemma":[0.0114003,0.00071250985,0.0010967959,0.0021249359,0.00090682367,0.0024426337,0.0011709015,0.0016831853,0.0004711634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002244576,0.0002232046,0.00059984275,0.00009246893,0.00002028905,0.000025429588,0.000041540326,0.97925305,0.00012261738,0.0069763185,0.00084660196,0.011574159],"study_design_scores_gemma":[0.000032215063,0.000043870976,0.000094921576,0.0000068427016,0.000006984399,0.0000051197194,0.00002147251,0.99824905,0.0000566861,0.0013231682,0.00015505213,0.0000045450865],"about_ca_topic_score_codex":0.031010767,"about_ca_topic_score_gemma":0.033492643,"teacher_disagreement_score":0.031010767,"about_ca_system_score_codex":0.0030775664,"about_ca_system_score_gemma":0.0027970592,"threshold_uncertainty_score":0.06166053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13076678,0.0026651751,0.8211335,0.0028951357,0.0005914528,0.00029358978,0.0015754037,0.00025815383,0.039820783],"genre_scores_gemma":[0.7686834,0.0027963223,0.16327861,0.00032334405,0.00034990982,0.00032352528,0.0012975169,0.00029145513,0.062655866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989869,0.00052739755,0.00004415496,0.00021586799,0.00010012939,0.00012546638],"domain_scores_gemma":[0.99892765,0.0005890832,0.00012494766,0.00007927876,0.00008666541,0.00019234588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018287706,0.001695072,0.0020058365,0.0008963596,0.0009995297,0.0030672944,0.0027408756,0.0027163117,0.013606186],"category_scores_gemma":[0.0042005144,0.0011782201,0.0015641042,0.0024503397,0.0012448024,0.005146767,0.002029534,0.0021354742,0.00104975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036036354,0.00018592307,0.00092309824,0.00031689362,0.00013669916,0.0006787326,0.00011714788,0.8489521,0.0007373941,0.11192912,0.0065267696,0.02913568],"study_design_scores_gemma":[0.000057466925,0.00012823491,0.00035439833,0.000043945805,0.000061179984,0.0002688451,0.000153271,0.90055454,0.0005186431,0.0925529,0.00527605,0.000030522693],"about_ca_topic_score_codex":0.0073203454,"about_ca_topic_score_gemma":0.0054707974,"teacher_disagreement_score":0.013606186,"about_ca_system_score_codex":0.0015740852,"about_ca_system_score_gemma":0.0016989408,"threshold_uncertainty_score":0.045517266},"labels":[],"label_agreement":null},{"id":"W2067522992","doi":"10.1016/j.cor.2014.10.018","title":"Tactical network planning for food aid distribution in Kenya","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":79,"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é du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; UNICEF","keywords":"Distribution (mathematics); Food distribution; Welfare; Population; Geography; Food security; Developing country; Business; Economic growth; Environmental resource management; Socioeconomics; Agricultural economics; Economics; Environmental health; Agriculture; Mathematics; Political science","score_opus":0.10676224457995204,"score_gpt":0.356106275574136,"score_spread":0.24934403099418395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067522992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9258723,0.0006745342,0.0086980555,0.00123951,0.000034639805,0.00041117743,0.00068784377,0.000051218973,0.062330723],"genre_scores_gemma":[0.98774403,0.0004813436,0.0054412843,0.000018780076,0.0000035156086,0.00008238785,0.00020065368,0.000006309084,0.0060216864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982077,0.00006655263,0.0000063973953,0.000019890302,0.00001935961,0.00006706527],"domain_scores_gemma":[0.9996823,0.00012101646,0.000053632866,0.000007073306,0.00007158509,0.00006435072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003084345,0.00023290589,0.00013479803,0.0008418542,0.0016922365,0.0012470827,0.00045081935,0.00048754725,0.007827212],"category_scores_gemma":[0.0009879228,0.00028839987,0.00014986555,0.00092787546,0.000344668,0.0010610406,0.00050461554,0.00043101725,0.00038736846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011820163,0.0008187189,0.11185841,0.000823692,0.00008644838,0.0034505024,0.0037885366,0.55464756,0.004508194,0.09418807,0.01607337,0.2085744],"study_design_scores_gemma":[0.00029792832,0.0009898739,0.12575044,0.00065482856,0.00018552606,0.0009685162,0.034988195,0.76261264,0.0031329463,0.016724383,0.053544454,0.00015024717],"about_ca_topic_score_codex":0.16453028,"about_ca_topic_score_gemma":0.39154926,"teacher_disagreement_score":0.16453028,"about_ca_system_score_codex":0.003912459,"about_ca_system_score_gemma":0.005444847,"threshold_uncertainty_score":0.32714522},"labels":[],"label_agreement":null},{"id":"W2067884717","doi":"10.1016/j.cor.2005.07.004","title":"Scheduling and routing of automated guided vehicles: A hybrid approach","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":161,"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; Scheduling (production processes); Mathematical optimization; Integer programming; Job shop scheduling; Routing (electronic design automation); Constraint programming; Distributed computing; Algorithm; Computer network; Mathematics","score_opus":0.05043721699695757,"score_gpt":0.3291782384169027,"score_spread":0.2787410214199451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067884717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036047805,0.0006682083,0.95635176,0.0002745629,0.00016943518,0.00008000285,0.000069168455,0.00029567414,0.0060433596],"genre_scores_gemma":[0.6584333,0.0007560126,0.3304318,0.00022080627,0.0003589218,0.0003265394,0.00020812238,0.00022530238,0.0090391785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992055,0.0002562387,0.000033977187,0.00012214718,0.0002541763,0.00012800389],"domain_scores_gemma":[0.9990977,0.00050008,0.00008309678,0.00007639146,0.00016181113,0.0000808069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700204,0.0011909311,0.001814404,0.0017482792,0.0009427525,0.0024407126,0.0027121517,0.0017569127,0.0029703435],"category_scores_gemma":[0.0015635131,0.0011012129,0.0017843838,0.0019847918,0.00090297393,0.0017387633,0.0016634823,0.000888173,0.00040923632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010263989,0.00006600923,0.0002990199,0.00008597404,0.00013347744,0.00005635106,0.000058452057,0.95443547,0.0016120026,0.010912017,0.0005509947,0.03168751],"study_design_scores_gemma":[0.000010490177,0.000021667605,0.000043731838,0.0000025213237,0.000016512246,0.0000075531257,0.000012935667,0.99673766,0.00013499263,0.0027353198,0.00027194835,0.000004604926],"about_ca_topic_score_codex":0.007386585,"about_ca_topic_score_gemma":0.0073917857,"teacher_disagreement_score":0.007386585,"about_ca_system_score_codex":0.001152902,"about_ca_system_score_gemma":0.0014144488,"threshold_uncertainty_score":0.0146871805},"labels":[],"label_agreement":null},{"id":"W2068851438","doi":"10.1016/j.cor.2015.03.015","title":"A non-parametric approach to demand forecasting in revenue management","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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; Polytechnique Montréal","funders":"","keywords":"Revenue management; Computer science; Demand forecasting; Profitability index; Product (mathematics); Revenue; Operations research; Integer (computer science); Interval (graph theory); Order (exchange); Software; Dynamic pricing; Econometrics; Mathematical optimization; Economics; Microeconomics; Mathematics; Finance","score_opus":0.19993822836268837,"score_gpt":0.338931503422082,"score_spread":0.13899327505939363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068851438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019414265,0.00036645096,0.97821665,0.00040045488,0.00006178259,0.000024497498,0.00006121091,0.00013438603,0.0013202447],"genre_scores_gemma":[0.827826,0.0009074183,0.16146876,0.00016054865,0.00041827076,0.00017833388,0.00027374158,0.000113615555,0.0086533055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816054,0.0011294051,0.00009468822,0.00023008438,0.00025868637,0.00012657943],"domain_scores_gemma":[0.98311377,0.01503945,0.00046238917,0.0005651448,0.00068486814,0.00013434507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004522784,0.0006241739,0.0014426454,0.0009926155,0.00076959544,0.0017817171,0.0022882265,0.0016973675,0.002651913],"category_scores_gemma":[0.02209274,0.0012870954,0.0012121253,0.0015775289,0.0010355115,0.0032097723,0.0012688454,0.0025059485,0.00041226114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036436984,0.000065049426,0.0005737694,0.00004192475,0.00004612616,0.000050227198,0.000059499132,0.95208204,0.00020842513,0.021770027,0.00046960436,0.02459686],"study_design_scores_gemma":[0.0000014243893,0.0000043640507,0.00005923469,0.000001406968,0.0000026837158,0.000003922583,0.0000035720736,0.99549353,0.000025861684,0.0043196776,0.00008108097,0.0000032763376],"about_ca_topic_score_codex":0.0077689863,"about_ca_topic_score_gemma":0.0065683457,"teacher_disagreement_score":0.0077689863,"about_ca_system_score_codex":0.0009191845,"about_ca_system_score_gemma":0.00096746476,"threshold_uncertainty_score":0.023919046},"labels":[],"label_agreement":null},{"id":"W2070583489","doi":"10.1016/j.cor.2013.06.013","title":"Rapid transit network design for optimal cost and origin–destination demand capture","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Computer science; Mathematical optimization; Graph; Vertex (graph theory); Transit (satellite); Network planning and design; Transit time; Integer (computer science); Travel time; Integer programming; Transit system; Graph theory; Operations research; Algorithm; Public transport; Theoretical computer science; Mathematics; Transport engineering; Combinatorics","score_opus":0.10275649401453127,"score_gpt":0.3781683368488936,"score_spread":0.2754118428343624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070583489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03586677,0.00016537543,0.94538456,0.00025012274,0.00005413386,0.00021004534,0.00023688686,0.00019420868,0.017637838],"genre_scores_gemma":[0.83317494,0.00037265278,0.14641605,0.000113190465,0.000059131446,0.00049799227,0.00029697907,0.00020871674,0.018860264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953043,0.00018502389,0.000011515702,0.000087942135,0.00010076618,0.000084280044],"domain_scores_gemma":[0.999257,0.00038688476,0.00008398303,0.000028028417,0.00021342763,0.00003058322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078132,0.001183304,0.000991272,0.000954547,0.000513228,0.0010785871,0.0011587517,0.0013764441,0.0090626525],"category_scores_gemma":[0.0026923849,0.0009478241,0.00084255607,0.00097433105,0.00049431855,0.001170437,0.000866125,0.000673556,0.0006754227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033514876,0.000018210727,0.00008127469,0.000040733317,0.000009433825,0.000026827633,0.000022647517,0.9853241,0.0011108944,0.007828652,0.0006090184,0.0048947413],"study_design_scores_gemma":[0.0000085184165,0.000030353674,0.00004519567,0.000004542553,0.0000074129653,0.000010730541,0.00001209864,0.996792,0.00035619986,0.0021564804,0.00057178165,0.000004582558],"about_ca_topic_score_codex":0.007023069,"about_ca_topic_score_gemma":0.0064342264,"teacher_disagreement_score":0.0090626525,"about_ca_system_score_codex":0.0019063951,"about_ca_system_score_gemma":0.001910896,"threshold_uncertainty_score":0.030317605},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09721532,0.00048887753,0.8932307,0.00046232683,0.00012856854,0.00016206106,0.00046287695,0.000548491,0.007300757],"genre_scores_gemma":[0.53278077,0.00034739342,0.45917413,0.00025751343,0.0001326557,0.00019693167,0.0005634124,0.0001376531,0.006409574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997558,0.000102068705,0.000008439666,0.000039543946,0.00005277303,0.000041276708],"domain_scores_gemma":[0.9990528,0.0006834888,0.000059307007,0.00007729997,0.000083173436,0.000043959255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055886176,0.0006382463,0.0008233532,0.0006086459,0.0005282734,0.00091667345,0.00084814744,0.0009956468,0.0043525286],"category_scores_gemma":[0.0012571232,0.0006676437,0.0007586277,0.0013101739,0.0005555763,0.0009236293,0.00072499126,0.0009250393,0.00036427757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009656356,0.00015439467,0.00046680236,0.00012381659,0.000047450514,0.00010765151,0.000037377555,0.9501447,0.0025280372,0.007499,0.0028327352,0.035961464],"study_design_scores_gemma":[0.000019408228,0.00003197655,0.00007979601,0.0000030797844,0.0000095678115,0.000013783563,0.000010591632,0.9952943,0.0006196026,0.0035331985,0.00038045953,0.0000042765996],"about_ca_topic_score_codex":0.00713124,"about_ca_topic_score_gemma":0.009387011,"teacher_disagreement_score":0.00713124,"about_ca_system_score_codex":0.00056096417,"about_ca_system_score_gemma":0.00085855165,"threshold_uncertainty_score":0.014560699},"labels":[],"label_agreement":null},{"id":"W2071159824","doi":"10.1016/j.cor.2014.02.003","title":"A randomized algorithm with local search for containment of pandemic disease spread","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"University of Toronto; University of New Brunswick","funders":"","keywords":"Rounding; Cardinality (data modeling); Containment (computer programming); Mathematics; Node (physics); Algorithm; Graph; Mathematical optimization; Computer science; Combinatorics; Data mining","score_opus":0.03607817111238463,"score_gpt":0.36136741005549106,"score_spread":0.3252892389431064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071159824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040086254,0.00046411992,0.9531024,0.0008290182,0.000184549,0.0002782621,0.00015411708,0.0009969265,0.0039043257],"genre_scores_gemma":[0.56278425,0.000215927,0.4306414,0.00055860425,0.00019744807,0.00077243766,0.0003762079,0.00018553388,0.0042681745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735945,0.001386326,0.0001078347,0.00050172827,0.0003041961,0.0003403665],"domain_scores_gemma":[0.9825554,0.014194029,0.00082592136,0.0008561744,0.00083968655,0.0007288668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057174326,0.0010480238,0.0031226773,0.0018913283,0.0012969607,0.0012972505,0.00500264,0.0031211935,0.0053140144],"category_scores_gemma":[0.019375734,0.0010119901,0.001224424,0.0012172955,0.0024163462,0.0032989993,0.0026713554,0.0017891744,0.000723419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007711222,0.00029819336,0.00056414516,0.0001316894,0.00008042591,0.00004950613,0.00008060536,0.93331397,0.00083559525,0.02023489,0.0037321746,0.03990763],"study_design_scores_gemma":[0.00016379361,0.00009724646,0.00004404999,0.0000071812246,0.00001446387,0.00001314847,0.000009174098,0.99388415,0.0001489338,0.0054056942,0.00020494225,0.00000720962],"about_ca_topic_score_codex":0.0054396414,"about_ca_topic_score_gemma":0.0048103184,"teacher_disagreement_score":0.0057174326,"about_ca_system_score_codex":0.0019126539,"about_ca_system_score_gemma":0.004316153,"threshold_uncertainty_score":0.030237019},"labels":[],"label_agreement":null},{"id":"W2073827670","doi":"10.1016/j.cor.2013.05.010","title":"Logit network pricing","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Université de Montréal","funders":"","keywords":"Mathematical optimization; Connection (principal bundle); Flow network; Computer science; Class (philosophy); Logit; Product (mathematics); Order (exchange); Flow (mathematics); Line (geometry); Mathematical economics; Mathematics; Economics; Artificial intelligence; Machine learning","score_opus":0.08979264177209387,"score_gpt":0.4007145944085903,"score_spread":0.31092195263649647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073827670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05070499,0.0012711653,0.5225906,0.011486736,0.0011193485,0.00035675438,0.0023090327,0.0013174692,0.40884396],"genre_scores_gemma":[0.7437394,0.001312251,0.029444354,0.0006366634,0.00040194622,0.000306941,0.00081855693,0.00019603797,0.22314376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.000492287,0.000027059366,0.00015113906,0.0002741388,0.00015940602],"domain_scores_gemma":[0.99857354,0.0007084339,0.000101850346,0.00023070791,0.00026884733,0.00011656972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012158279,0.00055834313,0.0007112026,0.0011074904,0.000657435,0.0026505487,0.0013712863,0.0013478403,0.07556986],"category_scores_gemma":[0.009636873,0.00033866856,0.00063774135,0.0018496264,0.00080703397,0.0032782417,0.0011329348,0.0017837324,0.005848921],"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.0001242505,0.00013798522,0.0010049354,0.000059933616,0.000030719944,0.00009328226,0.00004597913,0.05543726,0.0002488215,0.8216712,0.036653798,0.08449189],"study_design_scores_gemma":[0.00005672891,0.00005211013,0.0010182397,0.000029740851,0.000033649994,0.00015730645,0.000081339815,0.31781536,0.00033127665,0.64451104,0.035882574,0.00003068493],"about_ca_topic_score_codex":0.0052552056,"about_ca_topic_score_gemma":0.0051894616,"teacher_disagreement_score":0.07556986,"about_ca_system_score_codex":0.0021700955,"about_ca_system_score_gemma":0.001294511,"threshold_uncertainty_score":0.25280637},"labels":[],"label_agreement":null},{"id":"W2078289810","doi":"10.1016/s0305-0548(03)00244-2","title":"An analysis of lower bound procedures for the bin packing problem","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Bin packing problem; Bin; Algorithm","score_opus":0.050963526312924515,"score_gpt":0.35254170867511886,"score_spread":0.30157818236219436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078289810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014474487,0.0018082586,0.9683044,0.0008409821,0.00013246867,0.00023429688,0.00013438778,0.00053631555,0.013534354],"genre_scores_gemma":[0.2525546,0.004480949,0.7195741,0.0012066512,0.0010192638,0.0010292603,0.0011047756,0.0020164647,0.017013896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991525,0.003129173,0.00026204443,0.0005089035,0.003546374,0.0010285781],"domain_scores_gemma":[0.95940536,0.034037586,0.0012313245,0.0019232127,0.0028776063,0.0005249472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008504847,0.0023300725,0.0026118213,0.004291544,0.0023537166,0.0060929144,0.0041211317,0.0035801919,0.011498779],"category_scores_gemma":[0.046931792,0.0019559006,0.0036846623,0.005585326,0.0025489137,0.007024443,0.0032234062,0.0065492475,0.002331504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007090587,0.0007488949,0.0010936233,0.0007048456,0.00019501634,0.00010668963,0.0004759877,0.44902107,0.005930928,0.31149694,0.0163462,0.21317075],"study_design_scores_gemma":[0.000039086008,0.000096146214,0.0003703733,0.00008083947,0.00006584298,0.000063990585,0.000036485188,0.9104331,0.0013434356,0.08453558,0.0029086187,0.000026450298],"about_ca_topic_score_codex":0.0054386044,"about_ca_topic_score_gemma":0.0038641947,"teacher_disagreement_score":0.011498779,"about_ca_system_score_codex":0.0042253393,"about_ca_system_score_gemma":0.005079885,"threshold_uncertainty_score":0.0449785},"labels":[],"label_agreement":null},{"id":"W2078385421","doi":"10.1016/j.cor.2010.10.013","title":"Combined planning and scheduling in a divergent production system with co-production: A case study in the lumber industry","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Transport Canada; Université Laval","funders":"","keywords":"Production planning; Scheduling (production processes); Computer science; Production (economics); Integer programming; Mathematical optimization; Production manager; Operations research; Mathematics; Algorithm","score_opus":0.060086847871840626,"score_gpt":0.3486038398374031,"score_spread":0.28851699196556246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078385421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9194296,0.0001457977,0.07565439,0.00023292276,0.000027578279,0.00013117283,0.000066089255,0.00012747812,0.004184934],"genre_scores_gemma":[0.97892946,0.000036678844,0.01988911,0.000012481466,0.000005530331,0.000038542283,0.000038718124,0.000016566162,0.0010330235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9991842,0.00038851833,0.00003171207,0.00011953524,0.00013091421,0.00014521151],"domain_scores_gemma":[0.996687,0.002422702,0.00018434963,0.00015410746,0.00025947628,0.0002923386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031368,0.00094927906,0.0009631105,0.0005912472,0.0017956011,0.0013917212,0.0014493231,0.0020304304,0.0018470531],"category_scores_gemma":[0.0028909168,0.0007164658,0.0007517715,0.0010277462,0.0011156603,0.0011911512,0.0010652788,0.0011418097,0.00019655412],"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.00033840528,0.0002768843,0.0018461938,0.000054972803,0.000029676341,0.0014314825,0.00018238889,0.98106146,0.0029162527,0.0015675782,0.00020033107,0.010094384],"study_design_scores_gemma":[0.0000662041,0.00023648037,0.00064216467,0.0000039632514,0.00002128384,0.00011158894,0.0001777588,0.9952851,0.0015279923,0.0016817177,0.00022921251,0.000016567607],"about_ca_topic_score_codex":0.013234331,"about_ca_topic_score_gemma":0.01520457,"teacher_disagreement_score":0.013234331,"about_ca_system_score_codex":0.0013309695,"about_ca_system_score_gemma":0.001800519,"threshold_uncertainty_score":0.026314557},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039133206,0.0027271172,0.9047101,0.0028266497,0.00036940494,0.00014824221,0.00077915896,0.00022105388,0.049085017],"genre_scores_gemma":[0.5658685,0.0057188356,0.3630388,0.00067512743,0.0006056699,0.00055621756,0.001940722,0.00037254184,0.06122356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937904,0.0002464367,0.000018714734,0.00013667734,0.00011864193,0.00010041058],"domain_scores_gemma":[0.9994475,0.00031293326,0.000055161887,0.000040288385,0.00007763702,0.000066424196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000992035,0.000978241,0.00110241,0.0007587333,0.00083029264,0.0021328288,0.0012123777,0.0018736637,0.014007334],"category_scores_gemma":[0.0034129266,0.00069430785,0.00050307583,0.0013443142,0.00081626466,0.0030597171,0.0013600761,0.0014034209,0.0016734694],"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.00023276597,0.00013162885,0.0004673721,0.00036580747,0.000070212496,0.00015077772,0.00009819194,0.25248313,0.0018356962,0.5810284,0.026211774,0.13692422],"study_design_scores_gemma":[0.00008650024,0.000046206856,0.00021896909,0.000047409434,0.000030242772,0.00007397919,0.00006610935,0.54124904,0.0006135863,0.4362417,0.021311583,0.00001462841],"about_ca_topic_score_codex":0.0031909128,"about_ca_topic_score_gemma":0.0025064144,"teacher_disagreement_score":0.014007334,"about_ca_system_score_codex":0.0011432094,"about_ca_system_score_gemma":0.0014145378,"threshold_uncertainty_score":0.046859205},"labels":[],"label_agreement":null},{"id":"W2080615800","doi":"10.1016/j.cor.2005.03.026","title":"Multiple criteria classification with an application in water resources planning","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":44,"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; University of Waterloo","funders":"","keywords":"Multiple-criteria decision analysis; Decision maker; Sorting; Flexibility (engineering); Computer science; Preference; Mathematical optimization; Focus (optics); Operations research; Mathematics; Artificial intelligence; Machine learning; Data mining; Management science; Algorithm; Statistics","score_opus":0.3784046552194981,"score_gpt":0.529481337178887,"score_spread":0.1510766819593889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080615800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014777164,0.0012839412,0.9771228,0.00066572643,0.0003509847,0.00016382775,0.00012665277,0.00033088212,0.0051780567],"genre_scores_gemma":[0.16202082,0.00083803985,0.83217674,0.00018107721,0.00021876267,0.00039434215,0.000116562536,0.00010254961,0.003951124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596405,0.0021427243,0.0003005211,0.0003269828,0.0011046875,0.00016108899],"domain_scores_gemma":[0.98535734,0.011386037,0.00049634575,0.0004372252,0.0020852522,0.00023781249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060209185,0.001287563,0.0023645768,0.003842082,0.0020707499,0.0021847915,0.0015422954,0.0020037757,0.0057223816],"category_scores_gemma":[0.020474674,0.0006568231,0.0023545339,0.0090048155,0.0012800113,0.002290939,0.0017021487,0.0031574727,0.0008413294],"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.00027389,0.00039628427,0.0025270353,0.00081232074,0.00025457004,0.00047551215,0.00060127396,0.19723244,0.0026376988,0.09692182,0.009615122,0.688252],"study_design_scores_gemma":[0.000041271196,0.00013139959,0.0010814363,0.000104867446,0.000096444375,0.00015917132,0.0001258192,0.8869525,0.0012158916,0.10447827,0.0055611725,0.000051881572],"about_ca_topic_score_codex":0.006369981,"about_ca_topic_score_gemma":0.004291697,"teacher_disagreement_score":0.006369981,"about_ca_system_score_codex":0.0013816922,"about_ca_system_score_gemma":0.0012875152,"threshold_uncertainty_score":0.031842053},"labels":[],"label_agreement":null},{"id":"W2082287477","doi":"10.1016/j.cor.2008.05.008","title":"Online banking performance evaluation using data envelopment analysis and principal component analysis","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":131,"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":"Data envelopment analysis; Principal component analysis; Ranking (information retrieval); Revenue; Computer science; The Internet; Strengths and weaknesses; Identification (biology); Business; Statistics; Mathematics; Finance; Artificial intelligence","score_opus":0.5396370484147243,"score_gpt":0.530300814290691,"score_spread":0.009336234124033282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082287477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.900455,0.00021975042,0.087915875,0.000120507044,0.000023355116,0.00022875285,0.0004636663,0.0005886033,0.009984522],"genre_scores_gemma":[0.97533154,0.00008146821,0.023098256,0.000010609271,0.000009087901,0.00007156176,0.00030014198,0.000040449173,0.0010570369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99506783,0.002073275,0.00033782757,0.00026014904,0.0019717754,0.00028922252],"domain_scores_gemma":[0.9899345,0.005387562,0.0007300199,0.0008245555,0.0029371302,0.0001862576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046655852,0.0006794669,0.0009533918,0.0043712384,0.00049919187,0.0022015027,0.00039174812,0.0005011012,0.0032745758],"category_scores_gemma":[0.013967316,0.00022098677,0.0007453198,0.005031201,0.00029172725,0.003499331,0.0009503876,0.00048110393,0.00091904745],"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.0020930304,0.0024154733,0.117494024,0.00036089,0.00040885503,0.00017811154,0.000726581,0.15727752,0.010564475,0.008761185,0.0029309543,0.69678885],"study_design_scores_gemma":[0.00010171532,0.0016432452,0.12556861,0.000078637895,0.00024211644,0.0001497463,0.0009763582,0.8397252,0.023296515,0.005837038,0.002273434,0.00010738178],"about_ca_topic_score_codex":0.0028774696,"about_ca_topic_score_gemma":0.0026605963,"teacher_disagreement_score":0.0046655852,"about_ca_system_score_codex":0.0013443565,"about_ca_system_score_gemma":0.001069381,"threshold_uncertainty_score":0.024674237},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002320099,0.00007764243,0.99601644,0.00005464015,0.000032074207,0.000023718634,0.00002126376,0.000081223196,0.0013728609],"genre_scores_gemma":[0.17236592,0.00023335783,0.8195805,0.00014088876,0.00013483067,0.0003176811,0.00016126009,0.00019441907,0.0068710535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992592,0.00027466926,0.000026507034,0.00010140043,0.00027475494,0.00006337361],"domain_scores_gemma":[0.9989692,0.0006591039,0.000059367398,0.00008924248,0.00017080642,0.000052276955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001391309,0.0006465338,0.00092924014,0.000872422,0.00046619834,0.0008922959,0.0018640956,0.0012625146,0.0050436864],"category_scores_gemma":[0.0024741678,0.00058313145,0.0011396826,0.000995643,0.0006244566,0.0011577902,0.0017035858,0.00105061,0.00068884826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010994907,0.00008497267,0.00047088452,0.00017350054,0.00010413482,0.00006993782,0.000071613904,0.78324646,0.0042619607,0.06123041,0.002724977,0.14745124],"study_design_scores_gemma":[0.000010061282,0.000018277171,0.000045265173,0.0000052037203,0.000006971746,0.000022296848,0.000004486281,0.9922795,0.00024051676,0.006199567,0.0011624998,0.0000052835503],"about_ca_topic_score_codex":0.0028302183,"about_ca_topic_score_gemma":0.0028407357,"teacher_disagreement_score":0.0050436864,"about_ca_system_score_codex":0.00073184783,"about_ca_system_score_gemma":0.0010904627,"threshold_uncertainty_score":0.016872823},"labels":[],"label_agreement":null},{"id":"W2084449473","doi":"10.1016/j.cor.2004.06.001","title":"A simple computational model for analyzing the properties of stop-loss, take-profit, and price breakout trading strategies","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Simon Fraser University","funders":"","keywords":"Breakout; Probabilistic logic; Profit (economics); Simple (philosophy); Computer science; Mathematical optimization; Operations research; Econometrics; Microeconomics; Economics; Mathematics; Finance; Artificial intelligence","score_opus":0.13922570519395813,"score_gpt":0.31661695981557963,"score_spread":0.1773912546216215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084449473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18842274,0.00014195801,0.79859704,0.0013424302,0.000068929876,0.0001482874,0.0007311272,0.00068900496,0.00985845],"genre_scores_gemma":[0.90528196,0.00014786136,0.08761955,0.00017914342,0.00006147365,0.00025663877,0.00040827369,0.00007872901,0.005966293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996147,0.00010795821,0.000020374397,0.000090871785,0.0000794511,0.00008662377],"domain_scores_gemma":[0.99573505,0.0031822883,0.00028020432,0.00043455634,0.00019099911,0.0001768152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009475639,0.0005691976,0.0010985652,0.0006638036,0.0006177436,0.0020076174,0.002045251,0.0018346886,0.007877836],"category_scores_gemma":[0.008610206,0.0004747425,0.00088315527,0.00086322933,0.0009146542,0.0031478922,0.0008609647,0.0015537789,0.00054905016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025054402,0.0002331804,0.002206344,0.0000528987,0.00006433686,0.00022601978,0.00010570023,0.740306,0.0024256373,0.23663247,0.0024505032,0.015046401],"study_design_scores_gemma":[0.000021234246,0.000011581172,0.00011496281,0.0000012016477,0.000006680428,0.000017809447,0.0000050926187,0.96715397,0.0001162277,0.03238705,0.00015915938,0.000005003691],"about_ca_topic_score_codex":0.005327281,"about_ca_topic_score_gemma":0.004499315,"teacher_disagreement_score":0.007877836,"about_ca_system_score_codex":0.0010212015,"about_ca_system_score_gemma":0.001671966,"threshold_uncertainty_score":0.026353955},"labels":[],"label_agreement":null},{"id":"W2085504249","doi":"10.1016/j.cor.2014.09.002","title":"An integrated approach for sustainable supply chain planning","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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é Laval; Centre de Géomatique du Québec","funders":"","keywords":"Supply chain; Sustainability; Computer science; Compromise; Goal programming; Decision maker; Set (abstract data type); Operations research; Sustainable development; Management science; Industrial engineering; Mathematical optimization; Business; Economics; Engineering; Mathematics; Marketing","score_opus":0.0421291872258303,"score_gpt":0.32496451837680623,"score_spread":0.2828353311509759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085504249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032898416,0.00013817345,0.98614305,0.00018733113,0.000029726089,0.00009143513,0.00010038604,0.00021323936,0.009806794],"genre_scores_gemma":[0.11111418,0.00050204276,0.88195544,0.00006980407,0.00003572261,0.0002638215,0.00033826602,0.000102234466,0.005618469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986713,0.00031810155,0.00009152747,0.00016034386,0.00063963275,0.00011906724],"domain_scores_gemma":[0.9992835,0.00021191577,0.000051510662,0.00010988511,0.000281304,0.00006200444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012715474,0.0007779804,0.0009097418,0.0028290758,0.00091703254,0.0036703092,0.0015329169,0.0011820608,0.009268215],"category_scores_gemma":[0.00241055,0.0009078468,0.0015910767,0.004199168,0.0007041211,0.0035356698,0.0028387331,0.0013511608,0.0009308565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003291297,0.00018411978,0.0014772826,0.00017265402,0.0001913349,0.00019330047,0.00027870582,0.5747602,0.0022427824,0.17268679,0.0029911567,0.24478877],"study_design_scores_gemma":[0.000014767687,0.00005833068,0.00060104975,0.00009862599,0.00009115856,0.00008045121,0.00023633592,0.8354697,0.001006748,0.14218856,0.020126361,0.000027919146],"about_ca_topic_score_codex":0.011988302,"about_ca_topic_score_gemma":0.02425888,"teacher_disagreement_score":0.011988302,"about_ca_system_score_codex":0.0019626878,"about_ca_system_score_gemma":0.0041184123,"threshold_uncertainty_score":0.031005323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06863608,0.0016641294,0.8746058,0.0028881812,0.00023584643,0.00012413047,0.00093796634,0.00024381501,0.050664116],"genre_scores_gemma":[0.77207416,0.0024480787,0.1893062,0.00040802947,0.00030155576,0.00023066739,0.0010068121,0.00027449356,0.033950157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990821,0.0003751761,0.000034509503,0.00021022506,0.00018477465,0.00011323996],"domain_scores_gemma":[0.99873716,0.0008873954,0.0000928031,0.000078427656,0.00012004049,0.00008425236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009914463,0.00096023205,0.0008331366,0.0007837229,0.0005713467,0.0024674078,0.0017781359,0.0014879728,0.0045278664],"category_scores_gemma":[0.0043451437,0.00055452564,0.0006266527,0.0020533164,0.0010536269,0.0028947596,0.0011179046,0.0015038435,0.00059572974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010284951,0.00010109384,0.00056416844,0.00022218376,0.00006674667,0.0002533414,0.00007821438,0.59932244,0.0009084297,0.32599545,0.009494534,0.06289059],"study_design_scores_gemma":[0.000025138426,0.000029055984,0.0002665985,0.000029716022,0.00003365934,0.00012344548,0.000056561355,0.6160629,0.0005435773,0.37662634,0.0061855363,0.000017421964],"about_ca_topic_score_codex":0.0024872487,"about_ca_topic_score_gemma":0.0021790795,"teacher_disagreement_score":0.0045278664,"about_ca_system_score_codex":0.001555182,"about_ca_system_score_gemma":0.0013569852,"threshold_uncertainty_score":0.015147209},"labels":[],"label_agreement":null},{"id":"W2085697310","doi":"10.1016/j.cor.2015.04.007","title":"Path based algorithms for metro network design","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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","keywords":"Computer science; Path (computing); A priori and a posteriori; Network planning and design; Set (abstract data type); Integer (computer science); Mathematical optimization; Algorithm; Integer programming; Linear programming; Population; Mathematics","score_opus":0.29989119814690535,"score_gpt":0.4523902647933835,"score_spread":0.15249906664647817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085697310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030881427,0.0003924677,0.993399,0.00011603026,0.00004469101,0.000058899772,0.000078764235,0.00022298376,0.0025990352],"genre_scores_gemma":[0.18005876,0.0011050237,0.8093673,0.00011779007,0.00009335947,0.00051252585,0.00034046848,0.0002180601,0.008186649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995517,0.00020771004,0.000015283049,0.00006727703,0.000110228895,0.000047827645],"domain_scores_gemma":[0.99833834,0.001248034,0.000090304915,0.0000761753,0.00019339212,0.000053670694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011153542,0.0014699153,0.0013850228,0.0016157113,0.00080636557,0.00095069833,0.0014515034,0.0014191362,0.00749005],"category_scores_gemma":[0.004051189,0.00096402987,0.0008444513,0.0021263417,0.0007420354,0.0014893656,0.0010984328,0.0015667754,0.000845859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002376888,0.000027998254,0.00012116264,0.000050228395,0.00002012243,0.0000092542305,0.000019419327,0.9507437,0.0001748885,0.010293114,0.0015437846,0.036972594],"study_design_scores_gemma":[0.000010838953,0.000015044839,0.000028491011,0.000008928899,0.0000053332046,0.0000050654376,0.0000063467237,0.98650163,0.000087858985,0.012333444,0.0009938893,0.0000031881088],"about_ca_topic_score_codex":0.00939614,"about_ca_topic_score_gemma":0.009557503,"teacher_disagreement_score":0.00939614,"about_ca_system_score_codex":0.0011831862,"about_ca_system_score_gemma":0.001773546,"threshold_uncertainty_score":0.02505666},"labels":[],"label_agreement":null},{"id":"W2086037832","doi":"10.1016/j.cor.2007.01.013","title":"Detecting buffer overflow via automatic test input data generation","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Software Testing and Debugging Techniques","field":"Computer Science","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":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Buffer overflow; Computer science; Genetic programming; Process (computing); Fitness function; Software; Genetic algorithm; Buffer (optical fiber); Function (biology); Data mining; Real-time computing; Distributed computing; Machine learning; Operating system","score_opus":0.17966519198828013,"score_gpt":0.4136846375907641,"score_spread":0.234019445602484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086037832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3302644,0.00074959814,0.62134194,0.00049640785,0.00019389317,0.00021674047,0.0005966244,0.043721896,0.002418497],"genre_scores_gemma":[0.88014203,0.00006358393,0.11826635,0.000206311,0.000033265133,0.00009320109,0.0002581902,0.00030264605,0.00063445984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966961,0.0011987877,0.00024239364,0.0005420427,0.0010673217,0.00025334532],"domain_scores_gemma":[0.97709274,0.0156078795,0.0023626864,0.0024045852,0.0020665657,0.00046551993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015144179,0.0015811109,0.0011157102,0.0030844088,0.00037791883,0.0013346468,0.0017847363,0.0014615768,0.0026846319],"category_scores_gemma":[0.015283416,0.0005360753,0.00043407796,0.0011512456,0.000647406,0.0016817902,0.0013253626,0.00093737536,0.0005879287],"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.004392502,0.0006680907,0.04039326,0.00058615353,0.0002311239,0.0017512484,0.00047047535,0.03671739,0.19070815,0.0067419326,0.010342831,0.7069968],"study_design_scores_gemma":[0.00034528173,0.00084506586,0.008494874,0.00008977498,0.00017074813,0.0016869496,0.00007897764,0.69520164,0.2804653,0.00930668,0.0032164957,0.00009817508],"about_ca_topic_score_codex":0.0009974047,"about_ca_topic_score_gemma":0.0012046128,"teacher_disagreement_score":0.0030844088,"about_ca_system_score_codex":0.0007214992,"about_ca_system_score_gemma":0.0009531358,"threshold_uncertainty_score":0.00898093},"labels":[],"label_agreement":null},{"id":"W2086111473","doi":"10.1016/j.cor.2004.01.001","title":"Parallel machine selection and job scheduling to minimize machine cost and job tardiness","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":82,"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":"Tardiness; Computer science; Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Selection (genetic algorithm); Due date; Heuristic; Algorithm; Schedule; Artificial intelligence; Mathematics","score_opus":0.03315502815199124,"score_gpt":0.3158891169154314,"score_spread":0.2827340887634402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086111473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16792014,0.00077350385,0.8214143,0.00066701096,0.00028902118,0.00024339506,0.00017427155,0.0006529975,0.007865444],"genre_scores_gemma":[0.72848195,0.00042355034,0.26056305,0.00017606805,0.00027463422,0.00023417434,0.00022648674,0.00024374954,0.009376381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.00030973568,0.000020609568,0.000114498216,0.00017726864,0.00010248217],"domain_scores_gemma":[0.99919075,0.0004619816,0.00011002433,0.000058258815,0.00012351142,0.0000554444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014356922,0.00071122457,0.0015223976,0.0010744173,0.00095300586,0.0007279779,0.0010571469,0.0008184115,0.0024491246],"category_scores_gemma":[0.0023079738,0.00053391315,0.00070545904,0.00207872,0.0006241573,0.00070702896,0.00044257627,0.0006651718,0.00033517784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053840945,0.00023565844,0.0006625654,0.00012322792,0.00008015941,0.00010804655,0.00004464633,0.9294631,0.006268101,0.0076103155,0.0028171977,0.052048612],"study_design_scores_gemma":[0.000052326854,0.00009091505,0.00034626352,0.000002718242,0.000019676034,0.000030455052,0.000010714735,0.9896456,0.001602029,0.007679636,0.0005141668,0.0000055602],"about_ca_topic_score_codex":0.002760291,"about_ca_topic_score_gemma":0.004109574,"teacher_disagreement_score":0.002760291,"about_ca_system_score_codex":0.00093624933,"about_ca_system_score_gemma":0.0015986816,"threshold_uncertainty_score":0.008193135},"labels":[],"label_agreement":null},{"id":"W2087441867","doi":"10.1016/j.cor.2006.02.019","title":"Portfolio performance sensitivity for various asset-pricing kernels","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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":"Concordia University; Brock University","funders":"Brock University","keywords":"Portfolio; Capital asset pricing model; Benchmark (surveying); Stochastic discount factor; Econometrics; Computer science; Market liquidity; Sorting; Portfolio optimization; Kernel (algebra); Economics; Financial economics; Mathematics; Finance; Algorithm","score_opus":0.0755154034396455,"score_gpt":0.29869294004651836,"score_spread":0.22317753660687287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087441867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92473596,0.0010812221,0.06895809,0.00038446145,0.00006510885,0.000040007184,0.00034379357,0.0005493581,0.003841977],"genre_scores_gemma":[0.9972983,0.000117130025,0.0021208345,0.000025674728,0.000013756513,0.0000041748044,0.00014830533,0.00003175535,0.00024020253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986682,0.00047335814,0.000096648844,0.0002075312,0.0003307842,0.00022345658],"domain_scores_gemma":[0.96251553,0.031652078,0.0017780233,0.0021309226,0.001390247,0.0005332437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061307717,0.00050526654,0.0006314531,0.0016648156,0.00023886329,0.0014417211,0.00053012004,0.0011356442,0.0021328158],"category_scores_gemma":[0.042930212,0.0002980863,0.00079837913,0.0010158418,0.00051508524,0.0020800063,0.0011336182,0.0009679828,0.0002489238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020873004,0.00027760348,0.014905263,0.00032181016,0.00035503588,0.0004135968,0.00017656223,0.8944865,0.020532176,0.019163726,0.0015192642,0.045761168],"study_design_scores_gemma":[0.000032786833,0.00014345004,0.012270419,0.000023447072,0.000106988926,0.0002734704,0.00003292621,0.9705207,0.009409214,0.0069997497,0.00013374074,0.000053162486],"about_ca_topic_score_codex":0.0010600636,"about_ca_topic_score_gemma":0.00048528603,"teacher_disagreement_score":0.0061307717,"about_ca_system_score_codex":0.0007356896,"about_ca_system_score_gemma":0.000345442,"threshold_uncertainty_score":0.03242302},"labels":[],"label_agreement":null},{"id":"W2089143757","doi":"10.1016/s0305-0548(01)00094-6","title":"Optimization of an internationally distributed air–ground airline telecommunication system","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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; Group for Research in Decision Analysis; Sonaca (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scope (computer science); Dimensioning; Computer science; Operations research; Service (business); Distributed computing; Integer programming; Mathematical optimization; Algorithm; Engineering","score_opus":0.05124364738246541,"score_gpt":0.32228540743446127,"score_spread":0.2710417600519959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089143757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7193561,0.0006085694,0.25153878,0.0016821628,0.0001748311,0.00019368269,0.00038247395,0.00036214254,0.025701284],"genre_scores_gemma":[0.9909354,0.000073044335,0.004471571,0.00003894728,0.00002057887,0.000028794655,0.0000624103,0.000031076925,0.004338149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.00036912953,0.000025617266,0.00014687635,0.000092101436,0.00024642525],"domain_scores_gemma":[0.9987103,0.0006627226,0.00017486334,0.000043449374,0.00022091753,0.0001876663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015555071,0.001381301,0.0017410293,0.0007485635,0.0010865777,0.0023135527,0.0011259881,0.0019980757,0.005345831],"category_scores_gemma":[0.0024474172,0.0007213259,0.0006749684,0.0010624516,0.0010508292,0.0011625832,0.0014216811,0.0011771909,0.00026824616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092908915,0.000022631144,0.0002259635,0.000011997483,0.000015962774,0.000052798594,0.0000137277275,0.9956273,0.0005168377,0.0014486343,0.0003159332,0.0016553227],"study_design_scores_gemma":[0.000016638369,0.000056328496,0.00023063889,0.0000014882107,0.000011877863,0.0000069090815,0.000019461912,0.9988186,0.0001349616,0.00058252754,0.000115302675,0.000005273409],"about_ca_topic_score_codex":0.03241405,"about_ca_topic_score_gemma":0.013315252,"teacher_disagreement_score":0.03241405,"about_ca_system_score_codex":0.003479421,"about_ca_system_score_gemma":0.0018558652,"threshold_uncertainty_score":0.06445074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047991257,0.0007630822,0.941772,0.000459132,0.00020861467,0.0001908184,0.00009432728,0.00046357713,0.0080572525],"genre_scores_gemma":[0.4708063,0.0005424435,0.5199107,0.00034757378,0.00013018948,0.0006917685,0.00021681668,0.00014714744,0.007207046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995509,0.00017555882,0.000017536178,0.000054677337,0.00012304794,0.00007822686],"domain_scores_gemma":[0.9993305,0.00040662277,0.00007135274,0.00003252138,0.0001039377,0.00005513418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102743,0.00077473995,0.0011549043,0.001098997,0.0006409559,0.0010546251,0.0019773552,0.0019340421,0.0027550403],"category_scores_gemma":[0.0024540375,0.000616479,0.0009804402,0.0010965588,0.00061272073,0.0010062774,0.0010570865,0.0013740531,0.00034115044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007212178,0.00011719075,0.00043221225,0.00004559634,0.00004961582,0.000051043233,0.000049180155,0.9343834,0.0010396908,0.007755548,0.0013295102,0.054674864],"study_design_scores_gemma":[0.000032872133,0.000048498863,0.00008366532,0.000008238812,0.000013682251,0.000013502267,0.000010165585,0.9975248,0.00019701192,0.0012931421,0.0007688707,0.0000055294313],"about_ca_topic_score_codex":0.006028537,"about_ca_topic_score_gemma":0.005076303,"teacher_disagreement_score":0.006028537,"about_ca_system_score_codex":0.001239106,"about_ca_system_score_gemma":0.0015919821,"threshold_uncertainty_score":0.011986911},"labels":[],"label_agreement":null},{"id":"W2091444911","doi":"10.1016/j.cor.2006.02.017","title":"Evaluating financial time series models for irregularly spaced data: A spectral density approach","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Université de Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Context (archaeology); Series (stratigraphy); Mathematics; Computer science; Econometrics; Statistics; Statistical hypothesis testing; Heteroscedasticity","score_opus":0.2735683065183359,"score_gpt":0.37420395724702776,"score_spread":0.10063565072869185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091444911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15346268,0.0003512091,0.8448149,0.00028531835,0.000035075936,0.000040321367,0.000042056618,0.000192544,0.000775828],"genre_scores_gemma":[0.92479813,0.0003218815,0.07386244,0.000055587952,0.0000705826,0.00007442677,0.00012715014,0.00007124414,0.0006185959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818146,0.0011767233,0.00009184047,0.00015473054,0.00030468559,0.00009050003],"domain_scores_gemma":[0.98019606,0.017178407,0.00087850075,0.00059835997,0.0008535518,0.000295084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006562574,0.0009470504,0.0017086482,0.0014979301,0.0004339189,0.0020565738,0.0013652679,0.002370784,0.000856435],"category_scores_gemma":[0.029217595,0.0009305763,0.0012010386,0.00076723716,0.001080238,0.0031820918,0.0013869625,0.0012397647,0.00016362032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022263785,0.000027707012,0.00060869835,0.000014647276,0.000035578036,0.000026151914,0.000015778778,0.989555,0.00023302058,0.0053659966,0.00007370007,0.0040214784],"study_design_scores_gemma":[0.000001045237,0.000003849253,0.000022450024,7.5690104e-7,0.0000017883712,0.0000018910233,0.000002139445,0.9985801,0.000030613202,0.0013460763,0.000008109548,0.000001095893],"about_ca_topic_score_codex":0.0053639472,"about_ca_topic_score_gemma":0.0028727958,"teacher_disagreement_score":0.006562574,"about_ca_system_score_codex":0.0010994456,"about_ca_system_score_gemma":0.00095758535,"threshold_uncertainty_score":0.034706652},"labels":[],"label_agreement":null},{"id":"W2091845204","doi":"10.1016/j.cor.2011.08.015","title":"Transmitter location for maximum coverage and constructive–destructive interference management","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 New Brunswick","funders":"","keywords":"Transmitter; Computer science; Interference (communication); Relation (database); Constructive; SIGNAL (programming language); Telecommunications; Software; Real-time computing; Data mining; Process (computing)","score_opus":0.1071701000252286,"score_gpt":0.3101900050733014,"score_spread":0.20301990504807282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091845204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012565732,0.00016672278,0.97937566,0.0001024454,0.000047145764,0.00002702522,0.00004831118,0.0003515444,0.007315361],"genre_scores_gemma":[0.80946326,0.00029077585,0.18193363,0.00011143097,0.00015187569,0.00008799401,0.00016850946,0.00009838335,0.0076940325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989201,0.00029893397,0.000034177592,0.00018803234,0.00031705035,0.00024179085],"domain_scores_gemma":[0.9983038,0.0006192552,0.00018773021,0.0003187198,0.0005116632,0.000058964037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085529935,0.0008434714,0.0007526202,0.0007924998,0.0011078186,0.0011210339,0.0013818403,0.0009381633,0.0064162486],"category_scores_gemma":[0.0035534375,0.0004638492,0.00066613354,0.0010926161,0.000637666,0.0012839467,0.0013031474,0.0007091384,0.0016374803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005711497,0.00011985635,0.003447359,0.00023162656,0.00010581411,0.00044854172,0.00036558634,0.6007871,0.05370964,0.06814584,0.005562681,0.2665048],"study_design_scores_gemma":[0.00006200386,0.0002946948,0.0018697808,0.000051144438,0.00011130954,0.00078048976,0.000162806,0.94884074,0.025913594,0.015661754,0.0061954632,0.00005616223],"about_ca_topic_score_codex":0.0020629957,"about_ca_topic_score_gemma":0.0034031607,"teacher_disagreement_score":0.0064162486,"about_ca_system_score_codex":0.00075148465,"about_ca_system_score_gemma":0.0013195424,"threshold_uncertainty_score":0.021464527},"labels":[],"label_agreement":null},{"id":"W2093938881","doi":"10.1016/j.cor.2005.07.028","title":"A survey of local search methods for graph coloring","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":228,"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":"Tabu search; Guided Local Search; Graph coloring; Local search (optimization); Subroutine; Hill climbing; Computer science; Graph; Best-first search; Search algorithm; Population; Algorithm; Theoretical computer science; Mathematics; Beam search","score_opus":0.6028806549559134,"score_gpt":0.6204365109072726,"score_spread":0.017555855951359223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093938881","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00286952,0.02430576,0.9658599,0.00043504123,0.00016308717,0.00009992507,0.00017522817,0.0006542733,0.0054372866],"genre_scores_gemma":[0.07474811,0.03225576,0.8804623,0.0006318335,0.00067548366,0.0005750795,0.00082427927,0.0008925338,0.008934741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986072,0.0006444845,0.000078016135,0.00022981227,0.000361431,0.00007911378],"domain_scores_gemma":[0.99733657,0.0017787144,0.00010029342,0.0003349404,0.00038135494,0.000067956535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020709145,0.0012398715,0.0029288782,0.0024216175,0.00091290293,0.0016302125,0.0031709084,0.0015015675,0.0066771805],"category_scores_gemma":[0.005745099,0.0009305226,0.0018464397,0.006155722,0.0009280545,0.0025327022,0.0015163154,0.0021235652,0.002380769],"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.00014390584,0.00027433565,0.000848111,0.0021174354,0.00020830863,0.000041626976,0.00018307066,0.19596675,0.0017112637,0.08294138,0.019997636,0.6955662],"study_design_scores_gemma":[0.00010917737,0.00015444976,0.00041028656,0.00034966288,0.00011413562,0.00015220178,0.000097493335,0.8670048,0.0012570062,0.092968,0.037339967,0.00004292443],"about_ca_topic_score_codex":0.006291577,"about_ca_topic_score_gemma":0.009137589,"teacher_disagreement_score":0.0066771805,"about_ca_system_score_codex":0.0013469864,"about_ca_system_score_gemma":0.0015962837,"threshold_uncertainty_score":0.022337377},"labels":[],"label_agreement":null},{"id":"W2094868816","doi":"10.1016/s0305-0548(03)00105-9","title":"A maximal covering location model in the presence of partial coverage","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":204,"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":"Ministère de la Défense Nationale","keywords":"Range (aeronautics); Critical distance; Location model; Mathematics; Mathematical optimization; Computer science; Relaxation (psychology); Point (geometry); Critical point (mathematics); Facility location problem; Operations research; Geometry","score_opus":0.0979631742138741,"score_gpt":0.33027781743411144,"score_spread":0.23231464322023734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094868816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14584532,0.00092667533,0.8028305,0.0021090056,0.0000805245,0.00009584561,0.001340058,0.00048528524,0.0462868],"genre_scores_gemma":[0.930173,0.0005149412,0.05558688,0.00017048088,0.00008103956,0.00010182489,0.0007585314,0.00010561087,0.012507608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835926,0.0006576764,0.0000717049,0.00031920566,0.00025083404,0.0003413647],"domain_scores_gemma":[0.9964994,0.0021598027,0.00030482668,0.0003780328,0.00030347906,0.00035442927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015107903,0.0009148564,0.0014678058,0.00075517636,0.0010432369,0.004018558,0.0028731523,0.0028582746,0.008529289],"category_scores_gemma":[0.0053768535,0.0011124399,0.0010014185,0.0019254778,0.001819563,0.0052188355,0.0024741795,0.0016676275,0.00092966395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020468063,0.00005538499,0.000540369,0.000091237285,0.000041341835,0.00026579128,0.00019232827,0.6404554,0.00067089475,0.3461082,0.0027396362,0.008634788],"study_design_scores_gemma":[0.0000409919,0.000041844545,0.00010593743,0.000017697694,0.000022332122,0.000094251474,0.00007493208,0.86605835,0.00018929984,0.13091463,0.0024229744,0.000016735974],"about_ca_topic_score_codex":0.009330362,"about_ca_topic_score_gemma":0.005859433,"teacher_disagreement_score":0.009330362,"about_ca_system_score_codex":0.0024203851,"about_ca_system_score_gemma":0.0014441623,"threshold_uncertainty_score":0.02853328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008600321,0.000090619294,0.9846198,0.00009677195,0.00004200198,0.000059932267,0.000039019917,0.0002486183,0.0062029846],"genre_scores_gemma":[0.2122452,0.000121832505,0.7814418,0.00012198469,0.000038871734,0.00038145002,0.00011305272,0.00013105494,0.005404733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.000092017035,0.00001056603,0.000049105947,0.00015406207,0.000057067915],"domain_scores_gemma":[0.99944824,0.00021383462,0.000042408134,0.000089806366,0.00015345571,0.000052296436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062956923,0.00064979296,0.00085124717,0.0007821133,0.00080014986,0.0007510104,0.0015714578,0.0010980703,0.0075514745],"category_scores_gemma":[0.0021258562,0.00047566247,0.00075645774,0.0009504366,0.00045174515,0.0010403869,0.0019721903,0.0011543037,0.0008935363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017606394,0.00017436921,0.00056302483,0.00016938314,0.00005272391,0.000058668422,0.0002064644,0.6166968,0.006334885,0.08231261,0.006642747,0.28661227],"study_design_scores_gemma":[0.000019835894,0.00005924536,0.000067866415,0.000008468223,0.000007408485,0.00001189808,0.000009699046,0.9909175,0.00070306915,0.006323776,0.0018658887,0.000005330587],"about_ca_topic_score_codex":0.0034601598,"about_ca_topic_score_gemma":0.0063237273,"teacher_disagreement_score":0.0075514745,"about_ca_system_score_codex":0.0009384647,"about_ca_system_score_gemma":0.0012104714,"threshold_uncertainty_score":0.025262177},"labels":[],"label_agreement":null},{"id":"W2109358143","doi":"10.1016/j.cor.2005.06.007","title":"Designing a road network for hazardous materials shipments","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":142,"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":"Integer programming; Heuristic; Network planning and design; Computer science; Hazardous waste; Routing (electronic design automation); Mathematical optimization; Flow network; Tree (set theory); Steiner tree problem; Path (computing); Population; Integer (computer science); Operations research; Mathematics; Algorithm; Engineering; Computer network","score_opus":0.2847460286634574,"score_gpt":0.49494866713168584,"score_spread":0.21020263846822845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109358143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27685836,0.00013118115,0.688505,0.00047259562,0.00008938835,0.0011126804,0.000553473,0.0025742888,0.029703012],"genre_scores_gemma":[0.69079375,0.0001983589,0.2961764,0.0000413612,0.00001649346,0.00046892944,0.00061589555,0.00016636231,0.011522471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928856,0.0002715161,0.00003449834,0.0001374492,0.0001274188,0.00014048575],"domain_scores_gemma":[0.9988078,0.00032245315,0.00014147749,0.00014770345,0.00037980865,0.00020077577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084513106,0.00066605455,0.00047908825,0.0022674848,0.002324509,0.0014615504,0.0014312201,0.0011136964,0.011559632],"category_scores_gemma":[0.002787799,0.0005846552,0.00058935734,0.0012334648,0.00052808184,0.0021544634,0.0014636591,0.0004914894,0.0022051267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039063217,0.00056134444,0.00940793,0.00021800461,0.000062509665,0.00053584686,0.000590431,0.7721227,0.024734626,0.022176376,0.005218524,0.1639811],"study_design_scores_gemma":[0.00006507396,0.00093132927,0.003366139,0.00006272214,0.00011158496,0.000201766,0.0017288486,0.9416501,0.017706254,0.011210163,0.02289542,0.000070604714],"about_ca_topic_score_codex":0.011498665,"about_ca_topic_score_gemma":0.021125117,"teacher_disagreement_score":0.011559632,"about_ca_system_score_codex":0.0013576767,"about_ca_system_score_gemma":0.0023875125,"threshold_uncertainty_score":0.038670838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07079524,0.0005279798,0.907614,0.00045247332,0.00014549344,0.00042084226,0.001318853,0.0020321533,0.016692946],"genre_scores_gemma":[0.37565815,0.00026157626,0.6121584,0.00013373788,0.000032179018,0.00027243866,0.0015244527,0.00029647033,0.009662654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982065,0.000029989893,0.0000064749293,0.000032976677,0.00006077035,0.00004916647],"domain_scores_gemma":[0.99973327,0.00010404923,0.000013118247,0.000013563557,0.00011264027,0.00002335821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043143696,0.0008350437,0.00070369645,0.0012267827,0.001153347,0.0010409025,0.0012831423,0.0008680194,0.0073048384],"category_scores_gemma":[0.0010036778,0.00062112435,0.000599031,0.0015799053,0.00044847885,0.0005142458,0.0005362181,0.00069484295,0.00043135794],"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.00005612115,0.000032455842,0.00037821545,0.000036270598,0.000011297632,0.00004150473,0.000029941784,0.9248475,0.0006750082,0.0033164101,0.0040991586,0.066476084],"study_design_scores_gemma":[0.000007825172,0.0000073008573,0.000085111285,0.0000027796737,0.0000041511526,0.0000040393943,0.000006810432,0.9984817,0.00022375835,0.00063384685,0.0005396054,0.0000031377517],"about_ca_topic_score_codex":0.40095755,"about_ca_topic_score_gemma":0.45364204,"teacher_disagreement_score":0.5990424,"about_ca_system_score_codex":0.0033567061,"about_ca_system_score_gemma":0.006325603,"threshold_uncertainty_score":0.7972474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09124337,0.0030272198,0.87984496,0.0009961105,0.00015235766,0.000039529215,0.000056724057,0.000145164,0.02449453],"genre_scores_gemma":[0.8181966,0.0017448858,0.15438722,0.00019616097,0.00021084312,0.00014980634,0.00014341866,0.00014930258,0.024821784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993894,0.00033714095,0.000011612232,0.00008867094,0.00011519377,0.00005801478],"domain_scores_gemma":[0.996416,0.0029554786,0.00019211326,0.00016951478,0.00015749906,0.000109435496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014830317,0.00040015896,0.0010930108,0.00088364055,0.0009523691,0.0013107742,0.0013123475,0.001187501,0.0041319034],"category_scores_gemma":[0.0099598635,0.0005100038,0.0005494716,0.0015279629,0.0020890168,0.0022868207,0.0012502159,0.0019294398,0.00031642153],"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.0000901185,0.00006126348,0.00066082017,0.00005254155,0.00002711019,0.00006075555,0.00012851208,0.32072204,0.0003525144,0.6450715,0.0023788132,0.03039399],"study_design_scores_gemma":[0.000020800637,0.000015809705,0.00013676216,0.000011945918,0.000009466686,0.000025974205,0.000020859756,0.6273617,0.00014329232,0.37083274,0.0014134011,0.000007182341],"about_ca_topic_score_codex":0.0029605085,"about_ca_topic_score_gemma":0.003348397,"teacher_disagreement_score":0.0041319034,"about_ca_system_score_codex":0.00103223,"about_ca_system_score_gemma":0.00061355927,"threshold_uncertainty_score":0.013822615},"labels":[],"label_agreement":null},{"id":"W2117667427","doi":"10.1016/j.cor.2005.06.019","title":"Markov chain models of a telephone call center with call blending","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":98,"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; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Markov chain; Benchmark (surveying); Call management; Center (category theory); Markov model; Telecommunications; Call control; Machine learning","score_opus":0.039330459393212266,"score_gpt":0.3084871387843281,"score_spread":0.2691566793911158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117667427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40011364,0.0012833717,0.5409993,0.0049779,0.0003948084,0.00034017282,0.0031254129,0.0011737266,0.047591727],"genre_scores_gemma":[0.9479225,0.0006019454,0.009580449,0.00019341304,0.00016952971,0.0001998238,0.000716239,0.00012676438,0.040489357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858654,0.00042124913,0.000045398618,0.0002960664,0.00017201235,0.00047875725],"domain_scores_gemma":[0.9934977,0.0040532225,0.0006953742,0.0003223002,0.0006196984,0.0008117825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024880772,0.0011167321,0.0021008493,0.0014531999,0.0016182769,0.0046588434,0.003929257,0.0041101673,0.021985441],"category_scores_gemma":[0.007849937,0.001850544,0.0013462623,0.002343459,0.0026178814,0.0042940266,0.0017318644,0.00330192,0.0022486954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026385539,0.00013676722,0.0012532007,0.000034986286,0.000042636355,0.00024123024,0.00017446313,0.84320474,0.0006138809,0.1485328,0.0028604816,0.0026409882],"study_design_scores_gemma":[0.000042358184,0.000021803457,0.00024303008,0.000007454058,0.000019801524,0.000019487168,0.00003191636,0.97976685,0.00007862802,0.019382464,0.0003599678,0.000026278605],"about_ca_topic_score_codex":0.043927033,"about_ca_topic_score_gemma":0.023714827,"teacher_disagreement_score":0.043927033,"about_ca_system_score_codex":0.00400668,"about_ca_system_score_gemma":0.0030284738,"threshold_uncertainty_score":0.08734274},"labels":[],"label_agreement":null},{"id":"W2118885592","doi":"10.1016/j.cor.2010.08.008","title":"Optimal production planning for a multi-product closed loop system with uncertain demand and return","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":260,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remanufacturing; Computer science; Production planning; Mathematical optimization; Profit (economics); Lagrangian relaxation; Production (economics); Product (mathematics); New product development; Sensitivity (control systems); Manufacturing engineering; Economics; Mathematics; Business; Microeconomics; Marketing","score_opus":0.06755306623288285,"score_gpt":0.33691128198906173,"score_spread":0.2693582157561789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118885592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25135696,0.0011275586,0.7308986,0.001141078,0.00012492512,0.00037456726,0.00054207945,0.0005870504,0.01384714],"genre_scores_gemma":[0.9797963,0.00020889203,0.014551437,0.000051937815,0.000027749162,0.00014045481,0.00012963364,0.00005012959,0.0050435057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866605,0.00039342156,0.0000621835,0.00033341255,0.00021972923,0.0003252024],"domain_scores_gemma":[0.99638784,0.0025720822,0.0004128262,0.00007041667,0.0003754655,0.00018129869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022216472,0.0019382484,0.0028572665,0.0014048825,0.0014128342,0.0035017212,0.0016057503,0.0035718186,0.0047044833],"category_scores_gemma":[0.0042376597,0.0025873012,0.0013361203,0.0015371082,0.0022913716,0.0020526806,0.0017551073,0.0019486526,0.00047406284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006677139,0.000015751744,0.00012182428,0.000028755016,0.000016112745,0.0000653418,0.00002962663,0.99717075,0.00028706805,0.0007782483,0.00008197339,0.0013377388],"study_design_scores_gemma":[0.000013864841,0.000036257235,0.000107817694,0.0000034235384,0.000009158117,0.0000062820295,0.00001220091,0.9988593,0.00011077787,0.00078581116,0.00004793145,0.0000072147773],"about_ca_topic_score_codex":0.035016213,"about_ca_topic_score_gemma":0.019400548,"teacher_disagreement_score":0.035016213,"about_ca_system_score_codex":0.003236557,"about_ca_system_score_gemma":0.0023061903,"threshold_uncertainty_score":0.06962478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24323972,0.0011873975,0.7424142,0.00107348,0.00028079643,0.00030265035,0.00047577004,0.00055596797,0.010470136],"genre_scores_gemma":[0.8633485,0.0004928595,0.1297835,0.00022374293,0.000118672484,0.0002198305,0.00033913204,0.00018451712,0.0052892347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995034,0.00022369272,0.000013112629,0.000057183013,0.00007497465,0.00012768598],"domain_scores_gemma":[0.997359,0.0020421017,0.00018237933,0.00010552649,0.0001766296,0.00013426051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013954391,0.0010394908,0.0012994522,0.0007477333,0.0007237032,0.00157926,0.0014445886,0.0015009143,0.0041354485],"category_scores_gemma":[0.003722575,0.001012683,0.0006073256,0.0016565054,0.0008643492,0.0016478105,0.0008325886,0.0013507593,0.00028712934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000967738,0.00007646544,0.00027257012,0.000060842165,0.000023427952,0.00004293611,0.000020860873,0.9804248,0.0005345471,0.004114615,0.001736884,0.012595111],"study_design_scores_gemma":[0.000014320529,0.000027095493,0.00006721021,0.0000028752386,0.000008057864,0.000005936942,0.000010129057,0.9973578,0.00020394426,0.0021336079,0.00016589377,0.0000032381759],"about_ca_topic_score_codex":0.017062591,"about_ca_topic_score_gemma":0.015151832,"teacher_disagreement_score":0.017062591,"about_ca_system_score_codex":0.0014008319,"about_ca_system_score_gemma":0.0013914164,"threshold_uncertainty_score":0.033926606},"labels":[],"label_agreement":null},{"id":"W2122997413","doi":"10.1016/j.cor.2006.08.002","title":"Improving solver success in reaching feasibility for sets of nonlinear constraints","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":29,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Northwestern University","keywords":"Solver; Nonlinear system; Heuristic; Mathematical optimization; Computer science; Point (geometry); Constraint (computer-aided design); Set (abstract data type); Nonlinear programming; Range (aeronautics); Algorithm; Mathematics","score_opus":0.1459447074724677,"score_gpt":0.46232237544746196,"score_spread":0.3163776679749942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122997413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2879336,0.0015938652,0.66188306,0.0027245346,0.00042702374,0.0003850292,0.0005245784,0.009794757,0.034733593],"genre_scores_gemma":[0.6007466,0.0004466238,0.39102975,0.0004987393,0.00015266807,0.00017920375,0.00085530593,0.0016976066,0.0043934346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99179333,0.0037817229,0.0004854983,0.00090406893,0.0020035787,0.0010318501],"domain_scores_gemma":[0.91387874,0.06746987,0.0024266683,0.0077823494,0.0072924187,0.0011498847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009820592,0.0022956128,0.001963264,0.002438291,0.0014295038,0.0035609081,0.0029925685,0.0037452888,0.011863855],"category_scores_gemma":[0.099026926,0.0013244541,0.0018301131,0.0023376567,0.0014240063,0.0053620394,0.0041180192,0.0048186462,0.0029895864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026392683,0.0010661463,0.011183133,0.00090122165,0.00043504365,0.0003948434,0.00075169775,0.47994784,0.012536557,0.023431012,0.016320845,0.45039243],"study_design_scores_gemma":[0.0001998396,0.00025737405,0.00074107933,0.00004405898,0.00014059023,0.000098881465,0.00014079109,0.9776145,0.008861961,0.010145242,0.0017343425,0.00002135032],"about_ca_topic_score_codex":0.003885853,"about_ca_topic_score_gemma":0.0047727935,"teacher_disagreement_score":0.011863855,"about_ca_system_score_codex":0.0010738652,"about_ca_system_score_gemma":0.0036585564,"threshold_uncertainty_score":0.051936865},"labels":[],"label_agreement":null},{"id":"W2126718551","doi":"10.1016/j.cor.2006.03.003","title":"The minimum weighted covering location problem with distance constraints","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Heuristics; Mathematical optimization; Facility location problem; Computer science; Set (abstract data type); Consistency (knowledge bases); Dominating set; Mathematics; Algorithm; Artificial intelligence; Theoretical computer science","score_opus":0.030017672245618358,"score_gpt":0.2776057595348011,"score_spread":0.24758808728918275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126718551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14490344,0.0025235582,0.81623995,0.0024969352,0.0002991441,0.00022647482,0.0022015022,0.000503358,0.03060564],"genre_scores_gemma":[0.698586,0.0021498934,0.2767184,0.00038058014,0.00035218493,0.0003791508,0.0024081843,0.00037222676,0.018653413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982804,0.0008648913,0.00006644223,0.000294155,0.0002308052,0.0002634682],"domain_scores_gemma":[0.997618,0.0015420221,0.00025394483,0.00020958994,0.00015730949,0.00021909105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013582277,0.001262888,0.0022012575,0.0009899569,0.00076819304,0.002591868,0.0023775469,0.0028419395,0.007169567],"category_scores_gemma":[0.0063929292,0.0012670181,0.001223373,0.003080507,0.0009260482,0.0034544657,0.0017803074,0.001365844,0.00085118593],"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.00035420276,0.00013049242,0.00076408044,0.0005363482,0.00016841074,0.00035819842,0.00013556804,0.85729593,0.0017567866,0.061964583,0.011964534,0.06457091],"study_design_scores_gemma":[0.000098111064,0.00014362129,0.00044358932,0.00005963946,0.00006632718,0.00030764873,0.00011992547,0.9111522,0.0009147473,0.07808428,0.008577671,0.00003226193],"about_ca_topic_score_codex":0.0042081606,"about_ca_topic_score_gemma":0.0025789998,"teacher_disagreement_score":0.007169567,"about_ca_system_score_codex":0.0013583603,"about_ca_system_score_gemma":0.0011326639,"threshold_uncertainty_score":0.023984611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072064966,0.0022254854,0.8769458,0.004083901,0.00028380376,0.00015658402,0.0029395467,0.00027302463,0.041026905],"genre_scores_gemma":[0.8014657,0.0024019904,0.149136,0.00047485152,0.00041933122,0.00036049463,0.0018045835,0.00032956558,0.043607585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988563,0.00045849878,0.000036127487,0.00032072526,0.00018222946,0.00014624896],"domain_scores_gemma":[0.9968664,0.002363093,0.0002256672,0.00013729741,0.00023720758,0.00017037278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301775,0.0013143021,0.001994371,0.001268574,0.00076816883,0.0023355058,0.0032332481,0.003636144,0.011690089],"category_scores_gemma":[0.0072675752,0.0013584049,0.00084130134,0.0031734174,0.0017006132,0.003955672,0.0020757786,0.0017979463,0.00087154174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108867265,0.00005651968,0.0004119774,0.00020984955,0.00004669961,0.0001978562,0.000063479914,0.9052966,0.00048548818,0.07167587,0.0049874354,0.016459292],"study_design_scores_gemma":[0.000041168485,0.000028922972,0.00025327047,0.000027118791,0.000022684024,0.00009251821,0.000056224355,0.9242228,0.00035542884,0.07136847,0.0035058667,0.00002557092],"about_ca_topic_score_codex":0.013889775,"about_ca_topic_score_gemma":0.008307736,"teacher_disagreement_score":0.013889775,"about_ca_system_score_codex":0.0021888472,"about_ca_system_score_gemma":0.0017440402,"threshold_uncertainty_score":0.039107203},"labels":[],"label_agreement":null},{"id":"W2135657744","doi":"10.1016/j.cor.2008.11.014","title":"A conditional p-hub location problem with attraction functions","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":94,"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":"Probabilistic logic; Heuristic; Mathematical optimization; Computer science; Facility location problem; Operations research; Mathematics; Artificial intelligence","score_opus":0.11398356379629802,"score_gpt":0.31403302577885595,"score_spread":0.2000494619825579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135657744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123867154,0.0011936672,0.83969176,0.0073278085,0.00020631438,0.00019210653,0.002134114,0.00054892537,0.02483822],"genre_scores_gemma":[0.8743983,0.0010964471,0.0863128,0.0005477642,0.00038135907,0.0003233859,0.0016409286,0.00021913754,0.03507986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890435,0.0005042241,0.000038461414,0.00027568478,0.00009298308,0.00018422944],"domain_scores_gemma":[0.9904951,0.0077090217,0.00050598505,0.00032012252,0.00039334685,0.0005764877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026593767,0.0010331214,0.0031049913,0.0012422926,0.0011594384,0.0025302337,0.0036006575,0.0051771826,0.019861365],"category_scores_gemma":[0.014663021,0.0015624602,0.0013662142,0.002514239,0.0022100715,0.0054665543,0.0029104867,0.0032255044,0.00096159807],"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.00054124405,0.00018854738,0.0013985523,0.00045736507,0.00011576546,0.00057192444,0.00013292563,0.5354486,0.0006181001,0.4223665,0.018917628,0.01924282],"study_design_scores_gemma":[0.00016123046,0.00007110224,0.00040161292,0.000037953392,0.000044878056,0.00012278899,0.000087182605,0.7526464,0.0002574548,0.24426588,0.0018663551,0.000037181733],"about_ca_topic_score_codex":0.0067245495,"about_ca_topic_score_gemma":0.0044799065,"teacher_disagreement_score":0.019861365,"about_ca_system_score_codex":0.0021151167,"about_ca_system_score_gemma":0.0015304434,"threshold_uncertainty_score":0.06644291},"labels":[],"label_agreement":null},{"id":"W2136599217","doi":"10.1016/j.cor.2013.04.008","title":"A simulation-and-regression approach for stochastic dynamic programs with endogenous state variables","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Water resources management and optimization","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; Group for Research in Decision Analysis","funders":"","keywords":"State variable; Control variable; Variable (mathematics); Discretization; Flexibility (engineering); Endogeneity; Stochastic control; Computer science; Variables; Mathematical optimization; State (computer science); Regression analysis; Econometrics; Mathematics; Optimal control; Statistics; Algorithm","score_opus":0.051686294569428075,"score_gpt":0.2865833113158973,"score_spread":0.23489701674646923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136599217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004649507,0.00017836034,0.9927931,0.00021630352,0.000032381682,0.000031377407,0.000037510355,0.00022258013,0.0018389096],"genre_scores_gemma":[0.58356553,0.0010261921,0.40413523,0.0002014698,0.0002670085,0.00045282574,0.00032974387,0.00043608458,0.00958597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984516,0.0010233779,0.000051559105,0.000176082,0.00018809388,0.00010935682],"domain_scores_gemma":[0.99453944,0.004450534,0.00026094663,0.00023839652,0.00039516148,0.00011555599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031944746,0.0011249218,0.0019549197,0.0011061771,0.00063672924,0.0010813881,0.0018872926,0.0016686987,0.0043286565],"category_scores_gemma":[0.00984483,0.0010421838,0.0015787594,0.0014093495,0.0010388884,0.001359845,0.0014867703,0.002173702,0.0005923508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000144281175,0.00003310345,0.00016826269,0.00001935847,0.00003436317,0.00002357057,0.000013630103,0.97163785,0.00014514102,0.020816633,0.00020264596,0.006891053],"study_design_scores_gemma":[0.000002878605,0.000004007524,0.000016626844,0.0000015781985,0.0000031644552,0.0000024504254,0.0000012188838,0.9968804,0.000032445456,0.0029311494,0.00012196211,0.000002098588],"about_ca_topic_score_codex":0.015806675,"about_ca_topic_score_gemma":0.009034267,"teacher_disagreement_score":0.015806675,"about_ca_system_score_codex":0.0011130372,"about_ca_system_score_gemma":0.0023463059,"threshold_uncertainty_score":0.03142935},"labels":[],"label_agreement":null},{"id":"W2139110007","doi":"10.1016/j.cor.2009.03.032","title":"Heuristics for the mixed swapping problem","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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; Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Mathematics","score_opus":0.07886540970125167,"score_gpt":0.34786934665482566,"score_spread":0.269003936953574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139110007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079611406,0.0030654538,0.8921291,0.0007880414,0.0003963526,0.0003426278,0.00035301718,0.0011267778,0.022187186],"genre_scores_gemma":[0.32039732,0.0010482125,0.66807437,0.00034065952,0.00019005418,0.0003330037,0.0005238444,0.00034121424,0.008751297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990213,0.00047305788,0.00004148588,0.00011923193,0.00016614322,0.00017884075],"domain_scores_gemma":[0.9979152,0.0014849186,0.000110733985,0.0002112159,0.00013934528,0.00013858655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014901019,0.0012738184,0.0016597465,0.0014841309,0.00104204,0.0018465522,0.0021048628,0.0016254452,0.007876311],"category_scores_gemma":[0.004174633,0.0011484923,0.0012938189,0.0022535697,0.00092864403,0.0026204188,0.0015565397,0.0020977736,0.0009424309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076234323,0.0004829433,0.0007441695,0.0004896303,0.000162874,0.00022751377,0.0001925075,0.62609905,0.0033387518,0.10510566,0.018263733,0.24413079],"study_design_scores_gemma":[0.0001630261,0.00014479057,0.0002066978,0.00004339196,0.000055840377,0.00010305477,0.00006259906,0.9231739,0.0011329282,0.0691894,0.005698878,0.000025492109],"about_ca_topic_score_codex":0.0028498527,"about_ca_topic_score_gemma":0.0047547575,"teacher_disagreement_score":0.007876311,"about_ca_system_score_codex":0.0012062633,"about_ca_system_score_gemma":0.0015618115,"threshold_uncertainty_score":0.026348889},"labels":[],"label_agreement":null},{"id":"W2142328922","doi":"10.1016/j.cor.2013.03.005","title":"A vendor managed inventory model under contractual storage agreement","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":56,"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":"Vendor; Supply chain; Computer science; Operations research; Vendor-managed inventory; Synchronizing; Supply chain management; Heuristic; Inventory management; Integer programming; Total cost; Operations management; Holding cost; Mathematical optimization; Business; Economics; Mathematics; Algorithm; Marketing","score_opus":0.09526535721068566,"score_gpt":0.31305888751997957,"score_spread":0.2177935303092939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142328922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32604602,0.0006395917,0.5557872,0.002847314,0.00019979887,0.00044241053,0.0011906251,0.0010781552,0.111768894],"genre_scores_gemma":[0.9445669,0.00021181931,0.027805286,0.00008973143,0.000035800254,0.0001153001,0.00016815886,0.00007131419,0.026935792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986916,0.00059203105,0.000055649198,0.00019209091,0.0002602542,0.0002084461],"domain_scores_gemma":[0.9982603,0.0008169889,0.00012721634,0.00028773714,0.0003522418,0.00015547054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002289554,0.00060026743,0.0008843935,0.0009303174,0.0012311154,0.004194903,0.0032445504,0.0025658146,0.0121078035],"category_scores_gemma":[0.0031223837,0.00078486896,0.00095746224,0.0016787979,0.0014365653,0.005411161,0.0014349766,0.0012227666,0.0011051075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032268738,0.00019016853,0.000844731,0.000060477323,0.000036087804,0.0002891368,0.00021406994,0.5896932,0.00087168283,0.38967174,0.002389885,0.015416163],"study_design_scores_gemma":[0.000069208196,0.00010332358,0.0001899656,0.000014739801,0.000025007814,0.00006224263,0.000082504346,0.9390072,0.00021397285,0.05858852,0.0016134422,0.000029791236],"about_ca_topic_score_codex":0.008081286,"about_ca_topic_score_gemma":0.0057298252,"teacher_disagreement_score":0.0121078035,"about_ca_system_score_codex":0.0027242117,"about_ca_system_score_gemma":0.0030319877,"threshold_uncertainty_score":0.040504575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037021082,0.000681737,0.95802927,0.00019009523,0.000066360226,0.00013332945,0.000049061146,0.00019402707,0.0036349632],"genre_scores_gemma":[0.5061894,0.00042508784,0.4899481,0.00015676983,0.000057478297,0.0003276016,0.0002152426,0.00007913992,0.002601133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995246,0.00023810996,0.000018817584,0.00006771265,0.00009680011,0.000054057407],"domain_scores_gemma":[0.9992448,0.00053889246,0.0000657227,0.00003591539,0.000071244365,0.000043465498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957475,0.00047447512,0.0010372407,0.0006161207,0.00048159028,0.0005373624,0.0012915923,0.00093523617,0.0016524736],"category_scores_gemma":[0.00185552,0.00032519113,0.0006078384,0.0006649304,0.00045425943,0.0011104293,0.00077494193,0.00070736854,0.00020746964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006852511,0.00009249676,0.00042938863,0.00006178925,0.00003186747,0.00006101338,0.0000414385,0.94408596,0.0006772919,0.010005068,0.0012148387,0.04323033],"study_design_scores_gemma":[0.000014290343,0.000027916816,0.000047931266,0.0000037932718,0.0000044314233,0.000013260581,0.000011335034,0.99717367,0.00013777972,0.0020706803,0.000491287,0.0000035533265],"about_ca_topic_score_codex":0.00412501,"about_ca_topic_score_gemma":0.0055326303,"teacher_disagreement_score":0.00412501,"about_ca_system_score_codex":0.0006975832,"about_ca_system_score_gemma":0.0010233066,"threshold_uncertainty_score":0.008201957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07308357,0.00055205513,0.9113413,0.0006070461,0.00032608272,0.00031717797,0.00013722337,0.00056068104,0.01307483],"genre_scores_gemma":[0.7056282,0.00037751615,0.28527823,0.00013968865,0.00011826076,0.0002843909,0.00014821868,0.000057126937,0.007968235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945945,0.0001698943,0.000029428833,0.00010015173,0.0001883414,0.000052667045],"domain_scores_gemma":[0.99938333,0.00020799198,0.00006252668,0.00005188649,0.00023663577,0.000057609635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907164,0.00056578807,0.0007650225,0.00046741022,0.000575642,0.00090736384,0.0011536288,0.0011352726,0.0019056784],"category_scores_gemma":[0.0015795061,0.00030306412,0.00042138746,0.00082366465,0.00048938993,0.0006956096,0.00088794495,0.0009030268,0.00031212892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002070511,0.00014361842,0.0005636365,0.00016879255,0.000040770195,0.00015139891,0.00006925634,0.8919242,0.0068267854,0.011850408,0.0038091405,0.08424484],"study_design_scores_gemma":[0.000017697253,0.0000719116,0.00005154364,0.0000024907754,0.000009688051,0.0000260011,0.000008473455,0.9969886,0.0004531586,0.0012104743,0.0011557594,0.000004219846],"about_ca_topic_score_codex":0.0057266075,"about_ca_topic_score_gemma":0.0048410543,"teacher_disagreement_score":0.0057266075,"about_ca_system_score_codex":0.00046817967,"about_ca_system_score_gemma":0.0015181343,"threshold_uncertainty_score":0.011386573},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29946136,0.005378003,0.24642883,0.018973462,0.001339346,0.0007260076,0.014037333,0.00071585906,0.41293973],"genre_scores_gemma":[0.8492143,0.002398432,0.0647278,0.000566368,0.00021662498,0.00019410659,0.0037532332,0.00022661891,0.078702554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921024,0.00012777507,0.000016888449,0.00014782726,0.00022043975,0.0002767031],"domain_scores_gemma":[0.9993079,0.00020980244,0.00003857152,0.00003290813,0.00022698815,0.00018384938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243786,0.000960719,0.00084011286,0.0012389447,0.0032676992,0.0027182035,0.0027453993,0.0016001764,0.012801939],"category_scores_gemma":[0.0030186193,0.00059071573,0.0006614005,0.0024418775,0.001123152,0.0012169674,0.00088593405,0.001485407,0.00052341283],"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.00072357355,0.00021351609,0.0031312304,0.00032246683,0.000069635,0.00032788608,0.00038015636,0.59005326,0.0014547277,0.22496106,0.099566616,0.07879595],"study_design_scores_gemma":[0.00026041712,0.00009445734,0.005631427,0.00008339211,0.00007757862,0.00014995999,0.0010242208,0.8030855,0.001099596,0.0849858,0.103381924,0.00012570427],"about_ca_topic_score_codex":0.9203824,"about_ca_topic_score_gemma":0.93208826,"teacher_disagreement_score":0.07961762,"about_ca_system_score_codex":0.027600342,"about_ca_system_score_gemma":0.039490152,"threshold_uncertainty_score":0.20025545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096585386,0.0012168003,0.8902723,0.00025530683,0.00026267514,0.00018195355,0.00018872098,0.0008581491,0.010178744],"genre_scores_gemma":[0.49693283,0.00036386173,0.4957435,0.00019017523,0.00007664526,0.00036732157,0.00026285712,0.00021857055,0.005844247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996321,0.0001475496,0.000014294908,0.00004223901,0.0001084609,0.000055289165],"domain_scores_gemma":[0.99943,0.00033194924,0.00004643226,0.000044047294,0.00011251346,0.000035051613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000812923,0.0004896174,0.0010797225,0.00085264555,0.0005628625,0.00082189986,0.001936116,0.0013801476,0.00413086],"category_scores_gemma":[0.0016285131,0.00054718606,0.00065874826,0.0012036883,0.00036303245,0.000874974,0.0006756384,0.0006269248,0.0005163584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020858645,0.0001316221,0.00036468718,0.0000750516,0.00006130734,0.000057120214,0.00004240092,0.9025411,0.0019033554,0.0050650025,0.0019835085,0.087566264],"study_design_scores_gemma":[0.000033200286,0.00005507213,0.00008442706,0.000005344225,0.000011146121,0.000013462687,0.000008408591,0.99824107,0.0002571799,0.0007564721,0.00052901957,0.0000051783677],"about_ca_topic_score_codex":0.0065446324,"about_ca_topic_score_gemma":0.006489536,"teacher_disagreement_score":0.0065446324,"about_ca_system_score_codex":0.0008169961,"about_ca_system_score_gemma":0.0010717466,"threshold_uncertainty_score":0.013819158},"labels":[],"label_agreement":null},{"id":"W2155714059","doi":"10.1016/j.cor.2006.03.026","title":"Roll assortment optimization in a paper mill: An integer programming approach","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":40,"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":"Trim; Computer science; Mill; Mathematical optimization; Pooling; Integer programming; Operations research; Mathematics; Engineering; Algorithm","score_opus":0.03790654818600927,"score_gpt":0.30589590689821033,"score_spread":0.2679893587122011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155714059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04996324,0.00096442323,0.9289176,0.0008790893,0.00021384332,0.00020308663,0.0003769636,0.0002322173,0.018249499],"genre_scores_gemma":[0.6000309,0.0019054478,0.36424997,0.00036482737,0.00031382238,0.00063540525,0.0005162873,0.0004431537,0.03154028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990381,0.00038967334,0.000047885474,0.00018087789,0.00015823312,0.00018525278],"domain_scores_gemma":[0.9982085,0.0013207273,0.00017521976,0.00005870733,0.00013078499,0.00010607607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024669617,0.002079658,0.0041825976,0.001985592,0.0015023234,0.0055882554,0.0025889259,0.0043499055,0.009954373],"category_scores_gemma":[0.004190641,0.0032308055,0.0026303164,0.0037536283,0.0016401323,0.004115556,0.0015448212,0.0027419913,0.0007011246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047215734,0.000052708885,0.00013925214,0.000055900713,0.000020625315,0.000071385206,0.000017861916,0.9882108,0.0003905613,0.0068291635,0.00046504984,0.0036994428],"study_design_scores_gemma":[0.0000075528505,0.00002340408,0.0000478929,0.000006091094,0.0000126469085,0.000008433885,0.00002032988,0.9967109,0.00017202346,0.0027515485,0.00023245245,0.000006690593],"about_ca_topic_score_codex":0.008449122,"about_ca_topic_score_gemma":0.00676306,"teacher_disagreement_score":0.009954373,"about_ca_system_score_codex":0.0024041873,"about_ca_system_score_gemma":0.0021947704,"threshold_uncertainty_score":0.03330064},"labels":[],"label_agreement":null},{"id":"W2165843305","doi":"10.1016/j.cor.2013.09.020","title":"Optimizing the strategic patient mix combining queueing theory and dynamic programming","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Dalhousie University","funders":"","keywords":"Queueing theory; Case mix index; Solver; Computer science; Mathematical optimization; Integer programming; Linear programming; Operations research; Dynamic programming; Service (business); Operations management; Medicine; Mathematics; Economics; Business; Marketing","score_opus":0.17683955197974974,"score_gpt":0.4410135482310937,"score_spread":0.26417399625134397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165843305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04742382,0.00062341447,0.9459729,0.0010512853,0.000092186056,0.0002276189,0.0001644101,0.00028579883,0.0041584754],"genre_scores_gemma":[0.8214025,0.0006494566,0.1723893,0.00032410532,0.00019117528,0.00034653046,0.00020553546,0.00015629633,0.004335181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770373,0.0011418624,0.000077104785,0.00028382492,0.0003536102,0.00043988053],"domain_scores_gemma":[0.9968893,0.0022689446,0.00026079628,0.00007692218,0.00020967824,0.00029434185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033482697,0.0015395568,0.0024959003,0.0018433934,0.0007181831,0.0026223762,0.0018855743,0.0019535006,0.004324257],"category_scores_gemma":[0.0072360993,0.0015741558,0.0011312158,0.0022219329,0.0007983423,0.0024206247,0.0019264073,0.0020203595,0.0005778719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008028989,0.00008933815,0.00033640597,0.000041823656,0.00003431136,0.000015909085,0.0000151941695,0.9798749,0.0004278705,0.0065759583,0.00060782616,0.01190012],"study_design_scores_gemma":[0.000018172037,0.000039050316,0.00010517103,0.000005168816,0.000013039949,0.000009738431,0.000010390616,0.99259466,0.00015315188,0.0068691894,0.00017582676,0.0000064269198],"about_ca_topic_score_codex":0.009643534,"about_ca_topic_score_gemma":0.007769633,"teacher_disagreement_score":0.009643534,"about_ca_system_score_codex":0.0034135673,"about_ca_system_score_gemma":0.006574815,"threshold_uncertainty_score":0.02476734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012951242,0.007423044,0.90884763,0.0030573925,0.0005470305,0.00019752664,0.0011459205,0.00058055256,0.06524971],"genre_scores_gemma":[0.39882022,0.010676271,0.55970913,0.0013048272,0.0016575203,0.0013093053,0.0035313067,0.0011471885,0.021844082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948626,0.0013041258,0.00023058825,0.0007176233,0.0020371564,0.00084791594],"domain_scores_gemma":[0.98425436,0.01191739,0.0009355734,0.0009056041,0.001426975,0.000560069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004913009,0.0027913034,0.0021672815,0.0038745978,0.0013921454,0.0064307344,0.004573725,0.003204289,0.019104766],"category_scores_gemma":[0.022289198,0.0009176754,0.0019745436,0.0046694507,0.0018846052,0.00782499,0.003681014,0.006105624,0.0034255872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002305811,0.00028511265,0.00084105594,0.0008588482,0.00010586075,0.00019954247,0.00018332258,0.59859157,0.0018820037,0.2898446,0.018419141,0.08855828],"study_design_scores_gemma":[0.00003888922,0.00008149373,0.0004080408,0.00020447154,0.000043354525,0.00019665336,0.000089689274,0.81988907,0.0012982793,0.16548921,0.012218435,0.00004237551],"about_ca_topic_score_codex":0.0023950601,"about_ca_topic_score_gemma":0.0030599006,"teacher_disagreement_score":0.019104766,"about_ca_system_score_codex":0.0039031748,"about_ca_system_score_gemma":0.0024225402,"threshold_uncertainty_score":0.063911855},"labels":[],"label_agreement":null},{"id":"W2172842020","doi":"10.1016/j.cor.2015.10.016","title":"A comparison of integer and constraint programming models for the deficiency problem","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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; Polytechnique Montréal","funders":"","keywords":"Integer programming; Combinatorics; Mathematics; Vertex (graph theory); Edge coloring; Graph coloring; Fractional coloring; Graph; Integer (computer science); Discrete mathematics; Computer science; Mathematical optimization; Graph power; Line graph","score_opus":0.6222087096741095,"score_gpt":0.5613072832736856,"score_spread":0.06090142640042384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172842020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13184953,0.0021666677,0.8309641,0.0020266895,0.00023242102,0.00032779493,0.0010828654,0.0005191269,0.030830815],"genre_scores_gemma":[0.6336303,0.0030317598,0.3550558,0.00042566395,0.000113826,0.00043823043,0.001116695,0.00030708703,0.005880569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978211,0.001323245,0.00007673194,0.00015809872,0.000469396,0.00015144135],"domain_scores_gemma":[0.9793241,0.018309219,0.0005637012,0.0006387297,0.0008821795,0.00028206318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053334194,0.00078303163,0.000933662,0.0015763298,0.00038927532,0.0024275237,0.002046838,0.0010511025,0.0062003606],"category_scores_gemma":[0.015648188,0.00046308382,0.0012263878,0.0023508777,0.0006142331,0.0031925226,0.0006908637,0.0013341912,0.00036402483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005427509,0.00034044808,0.0012643096,0.0003335364,0.000060424467,0.000031519183,0.00011843405,0.8425622,0.0004959664,0.09414729,0.0029657504,0.057137437],"study_design_scores_gemma":[0.000038104983,0.00011064934,0.00029527035,0.000037324124,0.000022899332,0.000017242384,0.000049557417,0.98056823,0.00011836755,0.017574474,0.0011564735,0.0000113762135],"about_ca_topic_score_codex":0.01487746,"about_ca_topic_score_gemma":0.012991288,"teacher_disagreement_score":0.01487746,"about_ca_system_score_codex":0.0029150764,"about_ca_system_score_gemma":0.004113237,"threshold_uncertainty_score":0.029581726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24123809,0.00097120175,0.7247474,0.0011179023,0.0001781244,0.0001478583,0.0008677866,0.00033070857,0.030400898],"genre_scores_gemma":[0.79721117,0.0011010176,0.17589799,0.00014111126,0.00019165415,0.00013966266,0.00089518074,0.00017594757,0.024246281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.00031338123,0.000031560772,0.00015068351,0.00013547613,0.00015217936],"domain_scores_gemma":[0.9983619,0.0009811411,0.00022519486,0.00016284623,0.00011376775,0.00015521466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092188455,0.0007962913,0.0014181924,0.00053421146,0.0006258931,0.0018248317,0.0016453047,0.0019564256,0.008203189],"category_scores_gemma":[0.0037728194,0.0007756164,0.0009419731,0.0013507921,0.00074613385,0.00438877,0.0014445694,0.0016416915,0.00079296704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005118571,0.0002039264,0.0008584878,0.0002512609,0.00007872523,0.0003913045,0.00009176689,0.78161186,0.00287605,0.16265613,0.007010981,0.043457635],"study_design_scores_gemma":[0.000038210645,0.00009972373,0.00025757123,0.000015237341,0.00002042703,0.00009637556,0.000047567977,0.92511284,0.00055415096,0.071686365,0.0020603673,0.000011099144],"about_ca_topic_score_codex":0.0024533768,"about_ca_topic_score_gemma":0.0022849676,"teacher_disagreement_score":0.008203189,"about_ca_system_score_codex":0.0008910915,"about_ca_system_score_gemma":0.0011705607,"threshold_uncertainty_score":0.027442396},"labels":[],"label_agreement":null},{"id":"W2208368999","doi":"10.1016/j.cor.2015.11.013","title":"Efficient heuristic algorithms for maximum utility product pricing problems","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Computer science; Heuristics; Implementation; Heuristic; Mathematical optimization; Algorithm; Product (mathematics); Integer programming; Mathematics; Artificial intelligence","score_opus":0.45743334949508146,"score_gpt":0.5073068058717325,"score_spread":0.049873456376651026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208368999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03289142,0.0016188457,0.9478287,0.00060393417,0.0002156214,0.0003099877,0.00021359483,0.0007119658,0.015606037],"genre_scores_gemma":[0.3105907,0.00087143434,0.6818856,0.00025716607,0.00019110969,0.0006459497,0.0004266707,0.0002146312,0.004916735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983046,0.00089123717,0.000067904024,0.0001665915,0.00033036026,0.00023927189],"domain_scores_gemma":[0.99536717,0.0037752856,0.00021098905,0.0002521002,0.0002552354,0.00013922376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026078743,0.0017768296,0.002131591,0.0027661803,0.0009899564,0.002643728,0.0028237405,0.0030261686,0.0073083173],"category_scores_gemma":[0.0107781235,0.0013151354,0.0014886176,0.003576591,0.0011607463,0.002442155,0.0015151881,0.0024995927,0.001079611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032738142,0.00041862795,0.00042152862,0.00026459942,0.0000866907,0.00008338005,0.000114367474,0.7924453,0.00074507575,0.046798296,0.00579762,0.15249716],"study_design_scores_gemma":[0.00013954834,0.000041559557,0.00007736319,0.000025915648,0.000021201517,0.000026189668,0.000026688747,0.95692843,0.00024514354,0.041541934,0.00091597287,0.000010050002],"about_ca_topic_score_codex":0.0035768596,"about_ca_topic_score_gemma":0.005090068,"teacher_disagreement_score":0.0073083173,"about_ca_system_score_codex":0.0020821008,"about_ca_system_score_gemma":0.002624059,"threshold_uncertainty_score":0.024448693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020808588,0.9966454,0.001757949,0.00016153808,0.00022936078,0.00000893683,0.00004057201,0.000014272192,0.0009338382],"genre_scores_gemma":[0.0010456331,0.99660337,0.0015079218,0.00009380416,0.0002326729,0.000008369528,0.00005949338,0.0000043119385,0.00044440548],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996295,0.000050338294,0.000060489543,0.000086984575,0.00014248032,0.000030096062],"domain_scores_gemma":[0.9990308,0.0005655774,0.000107367865,0.00003195762,0.00021768601,0.00004656339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000969794,0.0016033357,0.002386082,0.0030508717,0.00034611335,0.0018758274,0.0016928246,0.0014604623,0.004582291],"category_scores_gemma":[0.0017567005,0.0007447791,0.0010388973,0.005805187,0.00057104457,0.0027762689,0.001047698,0.0014254508,0.0018234659],"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.00006852335,0.000159393,0.00032760855,0.03108327,0.00021145564,0.000100987694,0.00004657067,0.0048676953,0.0009088966,0.008222591,0.030764064,0.92323893],"study_design_scores_gemma":[0.000051911724,0.00020862884,0.0011792096,0.010495972,0.00064539636,0.00089332566,0.00014848619,0.004063651,0.00093535834,0.01234947,0.9689311,0.000097514734],"about_ca_topic_score_codex":0.0017700318,"about_ca_topic_score_gemma":0.0025981574,"teacher_disagreement_score":0.004582291,"about_ca_system_score_codex":0.0005932989,"about_ca_system_score_gemma":0.0019328098,"threshold_uncertainty_score":0.015329301},"labels":[],"label_agreement":null},{"id":"W2236369595","doi":"10.1016/j.cor.2015.12.018","title":"A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demand","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"McGill University; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Facility location problem; Dynamic programming; Uniqueness; 1-center problem; Point (geometry); Line (geometry); Algorithm; Mathematics","score_opus":0.08231206385209212,"score_gpt":0.32053338422259864,"score_spread":0.23822132037050653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236369595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027586414,0.00016098203,0.96804607,0.00020728103,0.00004820051,0.00010779329,0.00017172913,0.00083707867,0.0028344835],"genre_scores_gemma":[0.25325206,0.00016523333,0.7403943,0.00013210942,0.0000692778,0.00019739775,0.000692603,0.0002819283,0.0048150625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996704,0.000074374526,0.00001808446,0.00008909432,0.00007575079,0.00007222989],"domain_scores_gemma":[0.9983754,0.0010727365,0.000107558364,0.00009777371,0.00019533298,0.00015117745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010340397,0.0014163548,0.002233256,0.0012305955,0.00082916085,0.0012730991,0.0022204923,0.0021195777,0.007287076],"category_scores_gemma":[0.0024187486,0.0011495184,0.0011099365,0.0014198229,0.0009545503,0.0018756436,0.0023166973,0.002136833,0.0007128715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011136894,0.00007000639,0.00042341085,0.000063738255,0.000030396759,0.00005565551,0.000056783967,0.9430503,0.00094670284,0.0039678477,0.0019663991,0.049257327],"study_design_scores_gemma":[0.000021193626,0.000025378273,0.000033901633,0.0000027984138,0.0000033805668,0.000007182286,0.000010280675,0.99795866,0.00009877608,0.0016752401,0.00016048942,0.0000028449883],"about_ca_topic_score_codex":0.013579998,"about_ca_topic_score_gemma":0.012589826,"teacher_disagreement_score":0.013579998,"about_ca_system_score_codex":0.00091270206,"about_ca_system_score_gemma":0.0017741269,"threshold_uncertainty_score":0.027001917},"labels":[],"label_agreement":null},{"id":"W2294775281","doi":"10.1016/j.cor.2015.04.013","title":"Recent advances in location analysis","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.14164465503603993,"score_gpt":0.4727064858917152,"score_spread":0.3310618308556753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294775281","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016260162,0.2292071,0.686118,0.010274626,0.002529798,0.00013110628,0.0013507191,0.0016492862,0.052479196],"genre_scores_gemma":[0.256768,0.25988293,0.44183218,0.0028753388,0.00974798,0.00027966918,0.0030602699,0.00060361833,0.024950087],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752253,0.0008442372,0.00015940907,0.0007045012,0.0006363642,0.00013292492],"domain_scores_gemma":[0.9908099,0.005114708,0.0005564194,0.0011591591,0.002141859,0.00021785605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025594523,0.0011960856,0.0015422028,0.0059457007,0.0007883576,0.003762412,0.0021642891,0.0014544597,0.008682705],"category_scores_gemma":[0.011339289,0.00058208004,0.0014407968,0.009796565,0.0012556375,0.0043,0.002101283,0.0017646236,0.005756831],"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.00008335243,0.0001058201,0.007992189,0.0013439835,0.00021069882,0.00009082965,0.00026066956,0.007914023,0.0012501118,0.0642778,0.017698724,0.89877176],"study_design_scores_gemma":[0.000038077556,0.000182624,0.017566418,0.0015779104,0.00053387735,0.0013398437,0.0016153965,0.10773766,0.004356634,0.22283997,0.6419945,0.00021714484],"about_ca_topic_score_codex":0.0063434523,"about_ca_topic_score_gemma":0.005073325,"teacher_disagreement_score":0.008682705,"about_ca_system_score_codex":0.001433967,"about_ca_system_score_gemma":0.0019701312,"threshold_uncertainty_score":0.029046535},"labels":[],"label_agreement":null},{"id":"W2325482186","doi":"10.1016/j.cor.2016.04.012","title":"A joint replenishment problem considering multiple trucks with shipment and resource constraints","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Truck; Constraint (computer-aided design); Computer science; Genetic algorithm; Mathematical optimization; Joint (building); Budget constraint; Mathematics; Automotive engineering; Engineering","score_opus":0.07686294499006517,"score_gpt":0.2760990296910471,"score_spread":0.19923608470098192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325482186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36883426,0.0031447795,0.5999328,0.0019420559,0.0005369954,0.00077558204,0.001372421,0.00059491576,0.022866236],"genre_scores_gemma":[0.9095762,0.0007527555,0.07614051,0.00014521848,0.0001777475,0.00029242426,0.00064928905,0.00015509933,0.012110835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772316,0.00075369416,0.00017415422,0.0005125949,0.00035440558,0.00048196994],"domain_scores_gemma":[0.99527705,0.003008467,0.00045342525,0.00019820266,0.00044089206,0.00062190986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042664795,0.0024352262,0.005354652,0.002329883,0.0019141464,0.006041643,0.004481323,0.0058448855,0.009771443],"category_scores_gemma":[0.0076453853,0.0043618437,0.0034281132,0.004564261,0.0015031849,0.0048599117,0.00302401,0.002399012,0.0006673936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003568674,0.00015408805,0.0008109091,0.00032148446,0.00017336471,0.000954864,0.000098159595,0.9782785,0.0012095427,0.0059720054,0.001057992,0.010612171],"study_design_scores_gemma":[0.00008298264,0.0001869875,0.00047039211,0.000028060149,0.00011532177,0.00017371553,0.00010283414,0.99250096,0.00037082323,0.005213141,0.00071280636,0.000041950367],"about_ca_topic_score_codex":0.015268869,"about_ca_topic_score_gemma":0.009039117,"teacher_disagreement_score":0.015268869,"about_ca_system_score_codex":0.0023603656,"about_ca_system_score_gemma":0.0029802688,"threshold_uncertainty_score":0.032688737},"labels":[],"label_agreement":null},{"id":"W2470076424","doi":"10.1016/j.cor.2016.07.005","title":"The boolean quadratic programming problem with generalized upper bound constraints","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Simon Fraser University","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Upper and lower bounds; Quadratic programming; Quadratic assignment problem; Quadratic equation; Mathematics; Mathematical optimization; Computer science; Metaheuristic; Computational complexity theory; Sequential quadratic programming; Theoretical computer science; Combinatorial optimization; Algorithm","score_opus":0.030918578958173733,"score_gpt":0.30292081171189117,"score_spread":0.27200223275371743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470076424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026858468,0.0018171504,0.9425595,0.0035347643,0.00037881566,0.00012266764,0.0010456619,0.00030865037,0.023374302],"genre_scores_gemma":[0.61178476,0.0034999778,0.35362238,0.0012450964,0.00090161123,0.00043021791,0.0022515918,0.00043669043,0.025827592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997719,0.0009684264,0.000069106274,0.00039043388,0.00052586966,0.00032715345],"domain_scores_gemma":[0.9966054,0.002427645,0.0002326929,0.00019444185,0.00036947278,0.0001703111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021338908,0.0009988825,0.0016733413,0.00073308963,0.0005792199,0.0025089716,0.0019688527,0.0016762113,0.008768264],"category_scores_gemma":[0.009625962,0.00058161,0.00075398845,0.0023266387,0.0011977284,0.0034717643,0.0015491955,0.0027077931,0.00096555846],"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.0004167292,0.0002298618,0.00065018784,0.000814549,0.000094022944,0.00036707913,0.00011149987,0.47576502,0.0033661276,0.3629176,0.027620494,0.12764686],"study_design_scores_gemma":[0.000098680735,0.000077535435,0.0002818124,0.00004728355,0.000030763884,0.00011890575,0.000048286725,0.8029884,0.0008223509,0.18888403,0.0065762857,0.000025679246],"about_ca_topic_score_codex":0.0055519044,"about_ca_topic_score_gemma":0.0044457596,"teacher_disagreement_score":0.008768264,"about_ca_system_score_codex":0.0016839129,"about_ca_system_score_gemma":0.0020281447,"threshold_uncertainty_score":0.029332757},"labels":[],"label_agreement":null},{"id":"W2518264398","doi":"10.1016/j.cor.2016.04.006","title":"Mixed Integer Programming models for job shop scheduling: A computational analysis","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":227,"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; University of New Brunswick","funders":"","keywords":"Computer science; Integer programming; Mathematical optimization; Job shop scheduling; Constraint programming; Scheduling (production processes); Thread (computing); Algorithm; Mathematics; Stochastic programming; Programming language","score_opus":0.09631262454021754,"score_gpt":0.34752136372957054,"score_spread":0.251208739189353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518264398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033701997,0.0016279978,0.9509274,0.001387135,0.00017275517,0.00011463449,0.0003431339,0.00016013028,0.011564801],"genre_scores_gemma":[0.6160601,0.0020783609,0.36267912,0.00052708446,0.00041241792,0.0006923104,0.0005231525,0.00020190584,0.016825533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986702,0.0008773428,0.0000351904,0.00009978608,0.00022202107,0.000095449475],"domain_scores_gemma":[0.9935527,0.0055210497,0.00036051858,0.0001639557,0.00027230932,0.0001294804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002699001,0.0014389196,0.0011663068,0.00081947516,0.0007597618,0.0025516127,0.0020522333,0.0016486775,0.006234124],"category_scores_gemma":[0.009566697,0.0012081842,0.0015334418,0.0012006201,0.0008403238,0.0027584957,0.0010639385,0.0027751813,0.00066266744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006420682,0.00011086899,0.0003209334,0.00010020966,0.000041947656,0.000043065495,0.00004426987,0.8904958,0.00030430983,0.09883339,0.0017141931,0.007926886],"study_design_scores_gemma":[0.000005115587,0.000009726231,0.000027900542,0.000004031159,0.0000052050086,0.0000047407743,0.0000070502856,0.98721516,0.00003224369,0.012445314,0.00024123085,0.0000022730023],"about_ca_topic_score_codex":0.0035988546,"about_ca_topic_score_gemma":0.005498435,"teacher_disagreement_score":0.006234124,"about_ca_system_score_codex":0.0012834838,"about_ca_system_score_gemma":0.0016911696,"threshold_uncertainty_score":0.020855188},"labels":[],"label_agreement":null},{"id":"W2518271336","doi":"10.1016/j.cor.2016.08.009","title":"Multi-objective rapid transit network design with modal competition: The case of Concepción, Chile","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":57,"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":"Fondo Nacional de Desarrollo Científico y Tecnológico; Natural Sciences and Engineering Research Council of Canada; Comisión Nacional de Investigación Científica y Tecnológica; Instituto de Sistemas Complejos de Ingeniería; Consiglio Nazionale delle Ricerche","keywords":"Modal; Competition (biology); Computer science; Integer (computer science); Mathematical optimization; Network planning and design; Integer programming; Transit (satellite); Mathematics; Transport engineering; Engineering; Public transport; Telecommunications","score_opus":0.07772687742908109,"score_gpt":0.36079891512287005,"score_spread":0.28307203769378897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518271336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.850176,0.0007124717,0.10112214,0.0011557721,0.00008407719,0.00034307977,0.0004931405,0.00015069949,0.04576259],"genre_scores_gemma":[0.9847254,0.00013931327,0.007385954,0.00003378556,0.000013007282,0.00010428919,0.000074729556,0.000025578624,0.007497849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.0002314043,0.000009146947,0.00005529646,0.000042315143,0.00012764767],"domain_scores_gemma":[0.99888223,0.00071615307,0.00009647376,0.000024240653,0.00015782265,0.00012315644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014847945,0.001181234,0.0012635358,0.0011077842,0.0011000035,0.0019129025,0.0015416229,0.0021700263,0.0043580746],"category_scores_gemma":[0.0022342475,0.00074789074,0.0011292939,0.0009704479,0.0009281469,0.0011194684,0.0010457634,0.00091322564,0.00018599295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052475047,0.00004189816,0.00037709536,0.00004537808,0.000017267459,0.00022094631,0.000026931559,0.99556136,0.00025464402,0.002038468,0.0002609842,0.0011024982],"study_design_scores_gemma":[0.000033040647,0.000071283794,0.00042190592,0.0000091990805,0.000018858842,0.000026578597,0.00013189932,0.99761105,0.00013198827,0.0012200978,0.00031385125,0.000010250686],"about_ca_topic_score_codex":0.06395126,"about_ca_topic_score_gemma":0.04955742,"teacher_disagreement_score":0.06395126,"about_ca_system_score_codex":0.0032370493,"about_ca_system_score_gemma":0.0027279984,"threshold_uncertainty_score":0.12715805},"labels":[],"label_agreement":null},{"id":"W2550142813","doi":"10.1016/j.cor.2016.11.010","title":"A branch-and-cut algorithm for the minimum branch vertices spanning tree problem","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Optical Network Technologies","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":"HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum spanning tree; Spanning tree; k-minimum spanning tree; Combinatorics; Undirected graph; Mathematics; Kruskal's algorithm; Branch and cut; Connected dominating set; Context (archaeology); Steiner tree problem; Graph; Discrete mathematics; Integer programming; Algorithm; K-ary tree; Tree structure; Binary tree","score_opus":0.041018243614365436,"score_gpt":0.3218208047011121,"score_spread":0.2808025610867466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550142813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022584045,0.00060213346,0.9658373,0.00070133083,0.00016147294,0.00029791557,0.00038884056,0.0010539345,0.008373069],"genre_scores_gemma":[0.08073921,0.00032301576,0.9135734,0.00014622908,0.0000753497,0.00025420755,0.0008082086,0.00018063236,0.0038998493],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940777,0.00013280568,0.000029643212,0.00011400495,0.00022037044,0.000095336756],"domain_scores_gemma":[0.9991373,0.0004571982,0.00004925193,0.00007567848,0.0001800271,0.00010053344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006876548,0.00088682165,0.001524575,0.0012638128,0.0010855359,0.0013645601,0.0017153706,0.0021857354,0.0086067105],"category_scores_gemma":[0.0031260177,0.00068172766,0.0007842899,0.0022523378,0.00043704564,0.0017099548,0.0015368873,0.002122859,0.0014810673],"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.0005056826,0.0005316644,0.00074001396,0.0003819733,0.0000892348,0.00017693396,0.0001578719,0.29570997,0.007962533,0.030694388,0.022893893,0.64015585],"study_design_scores_gemma":[0.00017058743,0.00012684564,0.00026621443,0.000031011932,0.00003174115,0.00010498808,0.00004377022,0.97098124,0.0014946498,0.021605166,0.0051294793,0.0000142925255],"about_ca_topic_score_codex":0.0041597285,"about_ca_topic_score_gemma":0.0051603303,"teacher_disagreement_score":0.0086067105,"about_ca_system_score_codex":0.0009671159,"about_ca_system_score_gemma":0.0019836503,"threshold_uncertainty_score":0.028792262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044825388,0.00007217849,0.9948909,0.00011045136,0.000032995147,0.00004050067,0.000018862025,0.00007061098,0.004315128],"genre_scores_gemma":[0.07743166,0.00032010998,0.9124141,0.00043476763,0.00012180255,0.00057634636,0.00014510046,0.00019760214,0.008358511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987815,0.0004868305,0.000052019044,0.00017135903,0.00042261672,0.00008572343],"domain_scores_gemma":[0.9990663,0.00056780275,0.00009136228,0.00006850887,0.00017379096,0.000032299355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001772999,0.0013820273,0.0011330276,0.0010315783,0.00064807857,0.0012901059,0.0016605242,0.0013988501,0.012217256],"category_scores_gemma":[0.0039070793,0.00066852843,0.0015209892,0.001324135,0.0013154766,0.0014416861,0.0019627335,0.0027185436,0.0018675845],"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.000035086727,0.00007503371,0.00015716803,0.00032566284,0.000054627242,0.0001621888,0.000095030504,0.75189173,0.002773111,0.17650226,0.004317063,0.0636111],"study_design_scores_gemma":[0.000014445639,0.000025399473,0.00002295877,0.000018764564,0.0000077105815,0.00003724242,0.000012056668,0.96869993,0.00047361475,0.02700117,0.0036779218,0.000008868538],"about_ca_topic_score_codex":0.004017984,"about_ca_topic_score_gemma":0.0037061137,"teacher_disagreement_score":0.012217256,"about_ca_system_score_codex":0.0008568648,"about_ca_system_score_gemma":0.0016028625,"threshold_uncertainty_score":0.040870786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10769746,0.001566692,0.88104975,0.0005743165,0.00011019497,0.00019622452,0.00016410284,0.0002553236,0.00838601],"genre_scores_gemma":[0.595595,0.00091181824,0.39693555,0.00014344785,0.00011175128,0.0004910356,0.0003911074,0.00014834701,0.005271973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948955,0.00028944915,0.000018537918,0.00006215945,0.00007272195,0.000067525005],"domain_scores_gemma":[0.9981641,0.0014934042,0.0001286164,0.00004332534,0.00008019103,0.00009030069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014172635,0.00088100485,0.0014042893,0.0009036801,0.00056053844,0.0008124614,0.0012917245,0.0011429802,0.003035479],"category_scores_gemma":[0.0038864918,0.00054181507,0.00065257517,0.0014313379,0.00071595225,0.001373565,0.0008056071,0.0012428045,0.0002837862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008928894,0.00008264967,0.00030011206,0.00004467204,0.000023448109,0.000039206825,0.000021318254,0.97621506,0.00021444565,0.00828194,0.0006731073,0.014014659],"study_design_scores_gemma":[0.000012882924,0.000022576987,0.00003887643,0.000002885968,0.0000037398986,0.0000043530545,0.000005281587,0.9968592,0.000054798733,0.002842327,0.00015125393,0.0000018627027],"about_ca_topic_score_codex":0.007520092,"about_ca_topic_score_gemma":0.006748965,"teacher_disagreement_score":0.007520092,"about_ca_system_score_codex":0.0010906003,"about_ca_system_score_gemma":0.0012806297,"threshold_uncertainty_score":0.0149526},"labels":[],"label_agreement":null},{"id":"W2592554260","doi":"10.1016/j.cor.2017.10.003","title":"Online algorithms for the maximum k-colorable subgraph problem","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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; Polytechnique Montréal","funders":"","keywords":"Colored; Online algorithm; Combinatorics; Benchmark (surveying); Algorithm; Mathematics; Computer science; Competitive analysis; Greedy coloring; Graph; Upper and lower bounds","score_opus":0.4906069269434795,"score_gpt":0.5419991593872532,"score_spread":0.05139223244377367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592554260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08093157,0.0019177273,0.8783356,0.0033682226,0.00040623406,0.00064383255,0.0017867635,0.0037388501,0.028871132],"genre_scores_gemma":[0.4639516,0.0011384033,0.5191993,0.0005524505,0.00040942396,0.0006520638,0.0024689198,0.00070173666,0.010926105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983015,0.0005280419,0.000075332886,0.0004553517,0.0002738774,0.00036591644],"domain_scores_gemma":[0.99119085,0.006340088,0.0006231626,0.0009906894,0.00035573417,0.0004993511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020299843,0.0015316614,0.0019794719,0.001527952,0.0011805929,0.0029891261,0.0044874516,0.0025186278,0.01566834],"category_scores_gemma":[0.00894256,0.0009001048,0.0015013904,0.0031971922,0.0011863264,0.005712745,0.0023023218,0.0030655612,0.0016803577],"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.0015954484,0.002121363,0.0020531092,0.0011672076,0.00021797544,0.00018034015,0.00029528086,0.46528694,0.004416862,0.083632655,0.035503592,0.40352926],"study_design_scores_gemma":[0.00041921213,0.00014119179,0.0005559933,0.00005321294,0.00007941713,0.000094523304,0.000091665206,0.86490107,0.0012907403,0.12867813,0.0036712429,0.000023634071],"about_ca_topic_score_codex":0.008176839,"about_ca_topic_score_gemma":0.013650858,"teacher_disagreement_score":0.01566834,"about_ca_system_score_codex":0.0033422175,"about_ca_system_score_gemma":0.0046538217,"threshold_uncertainty_score":0.05241579},"labels":[],"label_agreement":null},{"id":"W2594925297","doi":"10.1016/j.cor.2017.02.019","title":"A strongly polynomial Contraction-Expansion algorithm for network flow problems","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Contraction (grammar); Algorithm; Flow network; Computer science; Maximum flow problem; Flow (mathematics); Polynomial; Mathematics; Mathematical optimization; Geometry; Mathematical analysis","score_opus":0.09211569102058015,"score_gpt":0.3732049175096355,"score_spread":0.2810892264890554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594925297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028095309,0.0003200529,0.9503937,0.0013250208,0.00020920514,0.0003075838,0.00029453656,0.0016034145,0.017451163],"genre_scores_gemma":[0.17540345,0.00030626712,0.80751044,0.0005840376,0.00020158928,0.000585661,0.0010495012,0.0006940164,0.013665154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987697,0.00037665965,0.00005277148,0.0003166174,0.00028924123,0.00019500838],"domain_scores_gemma":[0.99643636,0.0022104194,0.000112271904,0.00054972176,0.0004584603,0.0002327533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019494384,0.0014072272,0.0013885993,0.0010475577,0.0011543559,0.0016901604,0.0034167496,0.0018780142,0.011788715],"category_scores_gemma":[0.0081395935,0.0007066999,0.0012178933,0.0018580722,0.0014083901,0.0038541697,0.0036502888,0.004946331,0.002349585],"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.0012864925,0.0010008437,0.0010872072,0.0004959412,0.000073465126,0.00016427334,0.0005067533,0.1747478,0.01157521,0.18372035,0.040840693,0.58450097],"study_design_scores_gemma":[0.00034978922,0.00016386976,0.0003404513,0.000049833576,0.000046384175,0.00011635918,0.00010281165,0.804039,0.00359392,0.1825275,0.0086408,0.000029258817],"about_ca_topic_score_codex":0.0039536646,"about_ca_topic_score_gemma":0.0047493023,"teacher_disagreement_score":0.011788715,"about_ca_system_score_codex":0.0017337269,"about_ca_system_score_gemma":0.0036913322,"threshold_uncertainty_score":0.039437234},"labels":[],"label_agreement":null},{"id":"W2599020100","doi":"10.1016/j.cor.2017.02.020","title":"Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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é de Montréal","funders":"","keywords":"Facility location problem; 1-center problem; Integer programming; Mathematical optimization; Linear programming relaxation; Extension (predicate logic); Relaxation (psychology); Computer science; Single level; Integer (computer science); Mathematics","score_opus":0.3071354051985351,"score_gpt":0.41185936973045933,"score_spread":0.10472396453192423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599020100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13836974,0.0055747265,0.7544743,0.0023471785,0.0005709077,0.0005430489,0.0014325181,0.00082904706,0.09585863],"genre_scores_gemma":[0.6752765,0.0035276427,0.30569243,0.0005006309,0.0001753939,0.0005412228,0.0011781584,0.00048635015,0.012621624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826545,0.0008902975,0.00007290236,0.00013006307,0.00036627048,0.00027493495],"domain_scores_gemma":[0.9921693,0.0059501403,0.00037353317,0.00037569855,0.00087142515,0.00025982648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033299858,0.0012963642,0.0016639702,0.0014228298,0.0007013187,0.0031766226,0.0027044062,0.002246964,0.010834023],"category_scores_gemma":[0.008512161,0.0007682461,0.0015340676,0.0026295835,0.00075869716,0.0029128431,0.0013666176,0.0017590014,0.0008350795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024257456,0.0002018361,0.00029910915,0.00029795128,0.00006129754,0.000054186956,0.000058554986,0.9458174,0.00028790347,0.017964631,0.0034311123,0.0312834],"study_design_scores_gemma":[0.000071515795,0.00013548322,0.00026135903,0.00005761986,0.00003555016,0.000036857935,0.00009924403,0.989963,0.00027191584,0.0074997544,0.001552142,0.000015602376],"about_ca_topic_score_codex":0.00811485,"about_ca_topic_score_gemma":0.012185009,"teacher_disagreement_score":0.010834023,"about_ca_system_score_codex":0.003871564,"about_ca_system_score_gemma":0.0038826338,"threshold_uncertainty_score":0.03624338},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005819479,0.990119,0.006971889,0.0003740893,0.0002483529,0.00001096877,0.000020505966,0.000015730884,0.0016575076],"genre_scores_gemma":[0.0073671816,0.98660034,0.0046239323,0.0001743451,0.0004960093,0.000015075186,0.00004767357,0.000009074829,0.0006663693],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999428,0.00013346199,0.000056708846,0.00015442814,0.00018089171,0.00004654131],"domain_scores_gemma":[0.9987072,0.00079880824,0.00014052671,0.000047193935,0.00026909445,0.000037255937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015320143,0.0011568784,0.0021488185,0.0018260785,0.0002533068,0.0022545755,0.0019585786,0.0014653871,0.0021878632],"category_scores_gemma":[0.002021377,0.00058065425,0.0008216109,0.004307019,0.00074092986,0.0025336456,0.00071910315,0.0013839646,0.0009008328],"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.00009838048,0.00012255108,0.0004499902,0.01853598,0.00024886953,0.000105730716,0.00006478369,0.012553361,0.0010872217,0.020700848,0.009050819,0.9369815],"study_design_scores_gemma":[0.0000903288,0.0005492182,0.0014579227,0.009427314,0.00088595925,0.0014802907,0.00038070595,0.02344354,0.0027289023,0.038028125,0.9213842,0.0001436396],"about_ca_topic_score_codex":0.0017348041,"about_ca_topic_score_gemma":0.0016739061,"teacher_disagreement_score":0.0022545755,"about_ca_system_score_codex":0.0007411537,"about_ca_system_score_gemma":0.0016803794,"threshold_uncertainty_score":0.008102179},"labels":[],"label_agreement":null},{"id":"W2796934628","doi":"10.1016/j.cor.2018.04.004","title":"Tabu search and iterated local search for the cyclic bottleneck assignment problem","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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 Windsor","funders":"National Natural Science Foundation of China","keywords":"Tabu search; Guided Local Search; Iterated local search; Mathematical optimization; Bottleneck; Solver; Local search (optimization); Block (permutation group theory); Benchmark (surveying); Metaheuristic; Hill climbing; Computer science; Algorithm; Mathematics; Job shop scheduling; Scheduling (production processes); Iterated function; Schedule; Combinatorics","score_opus":0.3270447379013257,"score_gpt":0.5011930913327103,"score_spread":0.17414835343138457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796934628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113102555,0.003378511,0.8618511,0.0007709199,0.00019433264,0.0001919018,0.0002720071,0.00081637944,0.019422222],"genre_scores_gemma":[0.5933515,0.00096824276,0.3967723,0.00020766085,0.00015209233,0.00045186715,0.0004079225,0.00030723462,0.0073812506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915147,0.0005048825,0.000025056059,0.000077704,0.00014161324,0.000099300145],"domain_scores_gemma":[0.9971324,0.0022490264,0.00018679582,0.00012290626,0.0002264208,0.000082423176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020780496,0.0006402932,0.0013491465,0.0015412817,0.00080720126,0.0010889792,0.0019001674,0.0016787186,0.0049656504],"category_scores_gemma":[0.0084618395,0.00065484137,0.0008722042,0.0023351882,0.0011114368,0.0015108135,0.001061317,0.0013922163,0.0004364727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013653442,0.000101272555,0.0002820573,0.00013143028,0.000049785267,0.000026983422,0.000071767325,0.9215979,0.00035242876,0.021548523,0.0023618394,0.053339552],"study_design_scores_gemma":[0.000021705757,0.000026787904,0.000067631576,0.000008697771,0.000009063437,0.0000058986807,0.00000994107,0.98893726,0.00007352184,0.010526503,0.00030797854,0.0000049976925],"about_ca_topic_score_codex":0.01493352,"about_ca_topic_score_gemma":0.012643371,"teacher_disagreement_score":0.01493352,"about_ca_system_score_codex":0.001387368,"about_ca_system_score_gemma":0.0023673354,"threshold_uncertainty_score":0.029693186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040729128,0.0004162109,0.9491515,0.00026149064,0.00008439142,0.00011128284,0.00017307639,0.0002588329,0.0088140005],"genre_scores_gemma":[0.26436964,0.00037921933,0.72998965,0.00012648609,0.000049972747,0.00021035902,0.00035231814,0.00018845081,0.0043338933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997049,0.00011829056,0.0000117167865,0.000048881444,0.000057071837,0.000059103808],"domain_scores_gemma":[0.9993892,0.0003945047,0.00004106944,0.000053662458,0.00006421906,0.000057363653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007724782,0.0009127029,0.0009154746,0.0010875153,0.000564756,0.0009650067,0.0008789887,0.0013305234,0.0048116497],"category_scores_gemma":[0.0018055919,0.00071624503,0.001076352,0.0012446222,0.0005280909,0.001005941,0.001242202,0.0011545318,0.00051007216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010576352,0.00010581558,0.00023360793,0.0001281148,0.000039470542,0.00011194541,0.00006248152,0.91784215,0.003135495,0.015795283,0.00262206,0.059817817],"study_design_scores_gemma":[0.000028440667,0.00003271232,0.00007381592,0.000017480063,0.00001653794,0.000026678477,0.000021388545,0.9895739,0.00035287702,0.008861713,0.0009891449,0.0000052327728],"about_ca_topic_score_codex":0.0034685854,"about_ca_topic_score_gemma":0.004153616,"teacher_disagreement_score":0.0048116497,"about_ca_system_score_codex":0.00081439264,"about_ca_system_score_gemma":0.0009794487,"threshold_uncertainty_score":0.016096532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20509991,0.0015421212,0.77847314,0.0021268774,0.00028365155,0.00020661176,0.0011417898,0.00027639905,0.01084946],"genre_scores_gemma":[0.89045423,0.00079611863,0.08606885,0.0003036024,0.00015668933,0.00021037635,0.0005719391,0.00017068557,0.021267481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991579,0.00036857353,0.000027543607,0.00016250025,0.00010831201,0.00017523058],"domain_scores_gemma":[0.99880385,0.00073836726,0.00016634626,0.000059118494,0.00008270839,0.00014955203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018111669,0.001839876,0.0022388774,0.0009835651,0.0006531407,0.0020820738,0.0023487278,0.0028165355,0.004021712],"category_scores_gemma":[0.003354228,0.001453831,0.0013937372,0.0014146913,0.0011879688,0.003719637,0.0014357154,0.0014517537,0.00026780614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028459626,0.00006233806,0.0003791363,0.000102429345,0.00010155753,0.0002102219,0.000033392305,0.96996677,0.0008679733,0.018216783,0.0014193165,0.0083554685],"study_design_scores_gemma":[0.00003096636,0.000056654266,0.00020921549,0.000009577345,0.000030307381,0.000059455433,0.000033179058,0.9840443,0.00024086157,0.014593204,0.0006801732,0.00001213596],"about_ca_topic_score_codex":0.0072441124,"about_ca_topic_score_gemma":0.006545035,"teacher_disagreement_score":0.0072441124,"about_ca_system_score_codex":0.0016673998,"about_ca_system_score_gemma":0.0015273322,"threshold_uncertainty_score":0.01440388},"labels":[],"label_agreement":null},{"id":"W2884381115","doi":"10.1016/j.cor.2018.07.015","title":"Route and speed optimization for autonomous trucks","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":57,"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":"Truck; Computer science; Fuel efficiency; Set (abstract data type); Process (computing); Mathematical optimization; Operations research; Stochastic programming; Automotive engineering; Engineering; Mathematics","score_opus":0.05719349064869754,"score_gpt":0.34939420081477907,"score_spread":0.2922007101660815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884381115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23923822,0.00083762413,0.743738,0.00075056497,0.00015272811,0.00022447824,0.00074156956,0.0005292142,0.013787685],"genre_scores_gemma":[0.87436545,0.00031538372,0.11036323,0.000086237065,0.00007218899,0.00017638896,0.000625811,0.00024291838,0.013752333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999668,0.00009458691,0.000012859716,0.00008174659,0.000059920807,0.0000828956],"domain_scores_gemma":[0.9992336,0.00047029724,0.00008180245,0.000036253914,0.00011524075,0.00006283662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073197094,0.001091293,0.0015425875,0.0012199257,0.0007742624,0.0013373118,0.0012550175,0.0017627815,0.0038876405],"category_scores_gemma":[0.002597768,0.00112972,0.0010419893,0.0010394225,0.0008122671,0.0010733033,0.0012564588,0.001044281,0.00045808536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044978424,0.000021670574,0.00020295948,0.000018638531,0.000012937772,0.0000149819225,0.000017291648,0.99239326,0.00024903307,0.0018581188,0.0003521454,0.0048139617],"study_design_scores_gemma":[0.0000065294603,0.000016485785,0.000088130735,0.0000017094986,0.000003085396,0.0000035525934,0.000008476311,0.99822575,0.000070549446,0.0014041538,0.00016900532,0.0000025994204],"about_ca_topic_score_codex":0.031431515,"about_ca_topic_score_gemma":0.015847392,"teacher_disagreement_score":0.031431515,"about_ca_system_score_codex":0.0013024893,"about_ca_system_score_gemma":0.0017976244,"threshold_uncertainty_score":0.06249714},"labels":[],"label_agreement":null},{"id":"W2894549539","doi":"10.1016/j.cor.2018.10.004","title":"The p-arborescence star problem: Formulations and exact solution approaches","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","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":"Université de Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Star (game theory); Mathematical optimization; Mathematics; Computer science; Combinatorics; Mathematical analysis","score_opus":0.09915875037197912,"score_gpt":0.3257095817026694,"score_spread":0.22655083133069026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894549539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122847445,0.002472664,0.95592034,0.0013565785,0.0001715307,0.00011011464,0.00030645358,0.000098413904,0.027279217],"genre_scores_gemma":[0.39270136,0.0076595265,0.5702855,0.00076229806,0.0007585206,0.0005867318,0.00093782996,0.00028372012,0.026024574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994276,0.00024089635,0.000022241153,0.000110590656,0.00012644951,0.00007214929],"domain_scores_gemma":[0.99736255,0.0020353848,0.00016672343,0.00011836315,0.00022553268,0.00009149327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016672156,0.0012538185,0.00130632,0.0012297957,0.0006942608,0.0022517454,0.0023882724,0.0025537468,0.007740763],"category_scores_gemma":[0.0069902875,0.00088772416,0.0012562129,0.0023551525,0.0013160614,0.003459805,0.0018602526,0.002741733,0.0008309765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051953848,0.00016082208,0.00050250214,0.00033481905,0.000047259513,0.00010817872,0.00009641767,0.5876878,0.0003455856,0.34693742,0.013254186,0.050473012],"study_design_scores_gemma":[0.0000125117385,0.000016996566,0.00009085646,0.00003749119,0.000008815055,0.000036463276,0.000057189598,0.8230892,0.00010415284,0.1739559,0.0025822103,0.000008194826],"about_ca_topic_score_codex":0.0048204027,"about_ca_topic_score_gemma":0.006279601,"teacher_disagreement_score":0.007740763,"about_ca_system_score_codex":0.0014875032,"about_ca_system_score_gemma":0.0016589914,"threshold_uncertainty_score":0.025895417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18898892,0.001142401,0.78809375,0.0029700266,0.0005112521,0.00030069755,0.0021391695,0.00042945784,0.015424284],"genre_scores_gemma":[0.90643734,0.00076035527,0.05111463,0.00029990592,0.0002708174,0.000252926,0.0012040278,0.0002254469,0.03943466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.00035110896,0.00005632555,0.00040548423,0.00016666157,0.00031689455],"domain_scores_gemma":[0.99667054,0.0022676736,0.00038611103,0.0001080296,0.00030619785,0.00026151154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002310872,0.002095162,0.0025109225,0.0012392286,0.0009371753,0.0027413643,0.0037274414,0.003714876,0.0072738566],"category_scores_gemma":[0.0063861175,0.0018926502,0.0014533035,0.0023148828,0.001416226,0.0029650133,0.0015397685,0.0020433054,0.0005645499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015700374,0.00006949666,0.00046504638,0.00009703366,0.00006295125,0.0002695665,0.00004071278,0.9830313,0.0007572822,0.00930429,0.0012835002,0.0044617103],"study_design_scores_gemma":[0.000042866355,0.00006002225,0.00030743072,0.0000072134853,0.000040175735,0.0000669488,0.00004508459,0.99299556,0.00033856474,0.0055887536,0.00048880576,0.000018649931],"about_ca_topic_score_codex":0.016051032,"about_ca_topic_score_gemma":0.009134407,"teacher_disagreement_score":0.016051032,"about_ca_system_score_codex":0.0024741183,"about_ca_system_score_gemma":0.002243838,"threshold_uncertainty_score":0.031915188},"labels":[],"label_agreement":null},{"id":"W2905262274","doi":"10.1016/j.cor.2018.12.008","title":"Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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 Toronto; University of Windsor","funders":"","keywords":"Iterated local search; Mathematical optimization; Sizing; Linearization; Local search (optimization); Iterated function; Algorithm; Computer science; Local optimum; Integer programming; Time horizon; Mathematics; Nonlinear system","score_opus":0.0403622500725725,"score_gpt":0.30495988380866484,"score_spread":0.26459763373609235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905262274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019513106,0.00015250756,0.97569126,0.00016503122,0.000032630014,0.000064921995,0.000025086847,0.00017570949,0.004179676],"genre_scores_gemma":[0.64897114,0.00020898755,0.34432212,0.00013864916,0.00008377797,0.00038420552,0.00011829922,0.00018205703,0.0055907737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949265,0.0002827762,0.00001721012,0.00004928077,0.00011334809,0.000044769007],"domain_scores_gemma":[0.99905235,0.00063427293,0.00006442497,0.000060160553,0.00015405625,0.00003467461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015263364,0.0007589828,0.0010897259,0.0005759553,0.0005039229,0.00085267995,0.0014218526,0.0010252954,0.0031391229],"category_scores_gemma":[0.0027531818,0.00051347684,0.00076264987,0.00055108545,0.0011848322,0.0013290991,0.0012313084,0.0012949932,0.00047155112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007049457,0.00008681307,0.00016369515,0.0000877946,0.00002197701,0.000043602588,0.00008942184,0.93393004,0.0015016821,0.03794903,0.0009943257,0.025061151],"study_design_scores_gemma":[0.000011725729,0.000028008908,0.0000202401,0.0000032378725,0.0000041537737,0.000003772259,0.0000073970314,0.99602014,0.0002133165,0.0034971193,0.00018715153,0.0000037231378],"about_ca_topic_score_codex":0.004408449,"about_ca_topic_score_gemma":0.004191634,"teacher_disagreement_score":0.004408449,"about_ca_system_score_codex":0.0008464302,"about_ca_system_score_gemma":0.0011972904,"threshold_uncertainty_score":0.010501385},"labels":[],"label_agreement":null},{"id":"W2921935709","doi":"10.1016/j.cor.2019.03.005","title":"A two-step approach to incorporate cut-off grade and stockpiling in oil sands mine planning optimization framework","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Mining Techniques and Economics","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":"University of Alberta; Laurentian University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stockpile; Overburden; Tailings; Production schedule; Oil sands; Schedule; Integer programming; Open-pit mining; Net present value; Scheduling (production processes); Environmental science; Mining engineering; Production (economics); Engineering; Computer science; Operations management; Algorithm","score_opus":0.058065002670012994,"score_gpt":0.32972282665384095,"score_spread":0.271657823983828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921935709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071093948,0.00012880574,0.98509246,0.00026456785,0.000058034097,0.00010718334,0.00013381049,0.00013715247,0.006968689],"genre_scores_gemma":[0.42185563,0.00030891816,0.55467945,0.0002967909,0.00008842271,0.0005130914,0.00037458516,0.00017582139,0.021707246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992824,0.00026956084,0.000026187887,0.00009938422,0.00023081004,0.00009159895],"domain_scores_gemma":[0.9993747,0.00025815275,0.000039704366,0.00007110822,0.00018837104,0.000068044974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016168355,0.0010181487,0.0013245739,0.0008931163,0.0006680443,0.0017441665,0.0036399155,0.0022733773,0.008134221],"category_scores_gemma":[0.0021686596,0.0012131245,0.0017787971,0.0007428277,0.00062916975,0.0022136,0.0024005498,0.002445381,0.0008336969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029068637,0.00008643296,0.00027384402,0.00004367691,0.000043950597,0.00008648977,0.00003307563,0.9605922,0.0005938584,0.025413414,0.0007564412,0.012047461],"study_design_scores_gemma":[0.000004385495,0.000015634614,0.000037345133,0.0000045576758,0.000006687196,0.0000070613555,0.0000043538907,0.9949163,0.00016700909,0.0044356543,0.00039545243,0.000005633042],"about_ca_topic_score_codex":0.011563796,"about_ca_topic_score_gemma":0.013056111,"teacher_disagreement_score":0.011563796,"about_ca_system_score_codex":0.001072836,"about_ca_system_score_gemma":0.0030380618,"threshold_uncertainty_score":0.027211666},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026325462,0.00084847835,0.9927844,0.00019786206,0.000121570505,0.000034030174,0.000049604358,0.000055359247,0.0032762224],"genre_scores_gemma":[0.2905096,0.003710604,0.6845987,0.0003062948,0.00041245055,0.0005632294,0.00027536,0.00032378416,0.01930005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914956,0.000345813,0.00004041393,0.00010314234,0.0002671645,0.00009392443],"domain_scores_gemma":[0.99750644,0.0018054291,0.00017939793,0.00013273997,0.00031191832,0.00006403857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022177799,0.0010119568,0.0011645139,0.0010754444,0.0005459722,0.0013380941,0.0016674902,0.0016057969,0.006367539],"category_scores_gemma":[0.0073541203,0.00085613923,0.0011572741,0.00154167,0.0008090598,0.0022187626,0.0013141856,0.002156412,0.0005932333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050020793,0.00004701247,0.00017290855,0.00016998712,0.00003820454,0.00004061414,0.00005103944,0.8784796,0.00039073496,0.069647506,0.0022037306,0.048708558],"study_design_scores_gemma":[0.000012681929,0.000012339666,0.000048237023,0.00001875766,0.00000700746,0.000010995188,0.00001116345,0.9717942,0.000091277405,0.026768899,0.001219569,0.0000048630864],"about_ca_topic_score_codex":0.0077894204,"about_ca_topic_score_gemma":0.006476369,"teacher_disagreement_score":0.0077894204,"about_ca_system_score_codex":0.0014369744,"about_ca_system_score_gemma":0.0023535306,"threshold_uncertainty_score":0.021301508},"labels":[],"label_agreement":null},{"id":"W2962031742","doi":"10.1016/j.cor.2019.07.007","title":"Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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":"HEC Montréal; Concordia University; Polytechnique 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":"Benders' decomposition; Solver; Mathematical optimization; Algorithm; Mathematics; Decomposition; Branch and cut; Integer programming; Fixed charge; Linear programming; Integer (computer science); Flow network; Steiner tree problem; Computer science","score_opus":0.08187649673331249,"score_gpt":0.34436906544038215,"score_spread":0.26249256870706966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962031742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009812233,0.00036340853,0.98193294,0.0002120281,0.00008009609,0.00010119574,0.00012550155,0.0005692589,0.0068032783],"genre_scores_gemma":[0.25861043,0.0006035953,0.73335963,0.00017692354,0.000097996206,0.0003924756,0.00045393608,0.0003096975,0.005995378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937016,0.00023132924,0.000024013763,0.000091943955,0.00017390287,0.00010858036],"domain_scores_gemma":[0.9987281,0.0007816191,0.00010181308,0.0001403435,0.00018987895,0.00005827562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011513563,0.0017924443,0.0015038212,0.0012957118,0.0007497,0.0015125514,0.0015226796,0.0013308486,0.010226604],"category_scores_gemma":[0.0036625823,0.0013010913,0.0011345666,0.0016759663,0.0006487191,0.0018414679,0.00096179283,0.0018701588,0.0011193692],"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.000079853686,0.000079859696,0.00014890758,0.00008373695,0.000026809052,0.000017220018,0.000031167365,0.9268679,0.000470198,0.014568589,0.0024354474,0.055190332],"study_design_scores_gemma":[0.000017783294,0.000018920762,0.00003414316,0.000009614681,0.0000057155344,0.0000054729067,0.000008650767,0.9892881,0.000183399,0.009973247,0.00045119828,0.0000038319804],"about_ca_topic_score_codex":0.0078736255,"about_ca_topic_score_gemma":0.009721307,"teacher_disagreement_score":0.010226604,"about_ca_system_score_codex":0.001677669,"about_ca_system_score_gemma":0.0026612545,"threshold_uncertainty_score":0.034211397},"labels":[],"label_agreement":null},{"id":"W2973520255","doi":"10.1016/j.cor.2019.104806","title":"Crowd-shipping with time windows and transshipment nodes","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":141,"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; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Transshipment (information security); Computer science; Operations research; Mathematics; Computer security","score_opus":0.039804112296677754,"score_gpt":0.2556619331662713,"score_spread":0.21585782086959354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973520255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4288566,0.00081677316,0.555671,0.00036321234,0.00021011196,0.000104239865,0.0007324095,0.0004912895,0.012754325],"genre_scores_gemma":[0.95187145,0.00032622382,0.03265429,0.000033047476,0.00006368628,0.000042444848,0.00035745112,0.00012277081,0.014528722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925643,0.00020937271,0.00003396907,0.0002265122,0.00008025743,0.00019339872],"domain_scores_gemma":[0.99599177,0.0023306706,0.000537786,0.00045801105,0.00025199246,0.00042988383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016067069,0.00085004227,0.0009700379,0.0008337966,0.0007180756,0.0014206322,0.0017100014,0.0008202169,0.0078673735],"category_scores_gemma":[0.0070678634,0.000651988,0.0009959495,0.0013341499,0.0009160187,0.003709108,0.001858487,0.0011515417,0.0005407187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007208171,0.00008950759,0.0034493727,0.00008644049,0.00007878366,0.00030609185,0.00017177568,0.8915517,0.0012534198,0.07660985,0.002078905,0.023603352],"study_design_scores_gemma":[0.000015259084,0.000071708,0.0007188431,0.000011712094,0.000036736485,0.00008712738,0.00012107438,0.9567585,0.00065741834,0.040400535,0.0011033571,0.00001774503],"about_ca_topic_score_codex":0.007369386,"about_ca_topic_score_gemma":0.0059312633,"teacher_disagreement_score":0.0078673735,"about_ca_system_score_codex":0.0008335781,"about_ca_system_score_gemma":0.000743089,"threshold_uncertainty_score":0.026318967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016522625,0.00010199268,0.9960211,0.00017790943,0.000043632608,0.000030867766,0.000042409923,0.000033412067,0.0018964187],"genre_scores_gemma":[0.22649677,0.0007655672,0.75708735,0.00042221035,0.00026538852,0.000862345,0.00043417665,0.00026775416,0.013398425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00035838594,0.000032422133,0.00015504673,0.0002639361,0.00005207291],"domain_scores_gemma":[0.99898404,0.0006248423,0.000092823386,0.00006184827,0.00018474858,0.00005172843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013184281,0.00095124287,0.0012698247,0.00070514844,0.00052884244,0.0015434339,0.002864973,0.00211184,0.005314151],"category_scores_gemma":[0.0038642243,0.0007968901,0.0011491396,0.0015650257,0.0009275908,0.0023628552,0.0018016822,0.0028093997,0.00065881544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026659274,0.00004461166,0.00010156051,0.000057368507,0.000024127223,0.000057069963,0.000026258353,0.927412,0.0008593676,0.059136078,0.0018862234,0.010368776],"study_design_scores_gemma":[0.0000035032804,0.000005937344,0.000008225579,0.0000019711572,0.0000015729215,0.0000037424047,0.0000017487084,0.9970107,0.000044022963,0.0026215499,0.0002946288,0.0000023335388],"about_ca_topic_score_codex":0.009232475,"about_ca_topic_score_gemma":0.0083416095,"teacher_disagreement_score":0.009232475,"about_ca_system_score_codex":0.0011097398,"about_ca_system_score_gemma":0.0017839082,"threshold_uncertainty_score":0.018357456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15645848,0.0025688699,0.7942313,0.0045881327,0.00057405856,0.0003544663,0.0026596526,0.00032204762,0.03824305],"genre_scores_gemma":[0.8275528,0.0014355845,0.13333195,0.00040458108,0.00045849025,0.00029476613,0.001015136,0.00017093393,0.03533566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987859,0.00055309234,0.000046235447,0.00029471345,0.00014033046,0.00017977577],"domain_scores_gemma":[0.99863786,0.00088327995,0.00013460712,0.0000921074,0.00006913127,0.00018299218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020286534,0.0013936874,0.0022174972,0.0010045398,0.0008750211,0.0031828557,0.0027811474,0.003696892,0.008921253],"category_scores_gemma":[0.004853199,0.0010463333,0.0012016698,0.0024389045,0.0012177762,0.0046171574,0.0020418037,0.0017614554,0.0006449611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022070952,0.00017642943,0.0005795713,0.00019935015,0.00009034056,0.00034466304,0.000048986236,0.9384675,0.00061697897,0.036197197,0.0038312403,0.019226993],"study_design_scores_gemma":[0.000050336777,0.00006205403,0.0003397755,0.000015429436,0.000019906405,0.000086819506,0.000046671263,0.9641128,0.00022171385,0.033653382,0.0013707262,0.000020358077],"about_ca_topic_score_codex":0.0072951457,"about_ca_topic_score_gemma":0.0062809405,"teacher_disagreement_score":0.008921253,"about_ca_system_score_codex":0.0021573706,"about_ca_system_score_gemma":0.0016109125,"threshold_uncertainty_score":0.029844582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018323609,0.99080276,0.004877643,0.00025242634,0.00043760287,0.000020077687,0.000073324045,0.000032452004,0.0033204018],"genre_scores_gemma":[0.001291589,0.9928363,0.0039256685,0.00016186017,0.00031085228,0.000020293577,0.0001116084,0.000011690856,0.0013302527],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994893,0.0000903592,0.00007290206,0.00011931692,0.00018915038,0.00003885737],"domain_scores_gemma":[0.9992391,0.0004178378,0.000084450796,0.000034297052,0.00019304323,0.00003121222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029063,0.0016945363,0.0022148422,0.0031207157,0.00038732414,0.0015048548,0.0019192266,0.0013483501,0.007483081],"category_scores_gemma":[0.0017613497,0.0009790447,0.0010624652,0.005873605,0.00049638574,0.0026102297,0.0009566999,0.001403117,0.0034954506],"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.000045586567,0.00009341846,0.000110907655,0.02217848,0.00010675043,0.000049460064,0.000018930268,0.0045502395,0.0007297678,0.011131153,0.027041076,0.9339443],"study_design_scores_gemma":[0.00001953771,0.00017392429,0.0004574326,0.0051254216,0.00026099788,0.00039468255,0.000043961652,0.0024913135,0.0007643405,0.005642622,0.98457664,0.00004910136],"about_ca_topic_score_codex":0.002799517,"about_ca_topic_score_gemma":0.0033307772,"teacher_disagreement_score":0.007483081,"about_ca_system_score_codex":0.00090129895,"about_ca_system_score_gemma":0.0020756135,"threshold_uncertainty_score":0.025033474},"labels":[],"label_agreement":null},{"id":"W3030136246","doi":"10.1016/j.cor.2020.104974","title":"Multi-period stochastic programming models for two-tiered emergency medical service system","year":2020,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Université Laval","funders":"","keywords":"Heuristics; Computer science; Relocation; Heuristic; Operations research; Mathematical optimization; Time horizon; Service (business); Lagrangian relaxation; Stochastic programming; Total cost; Order (exchange); Stochastic modelling; Engineering; Artificial intelligence; Mathematics","score_opus":0.17417013048223023,"score_gpt":0.3671249725119953,"score_spread":0.19295484202976504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030136246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33206877,0.0043841135,0.6307684,0.005612128,0.0006212714,0.00038316837,0.0033954252,0.0005872187,0.022179557],"genre_scores_gemma":[0.96780807,0.0010633892,0.009143969,0.00018414909,0.0001414358,0.00021249449,0.0006325503,0.00007030116,0.020743726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736965,0.0010449362,0.00010738588,0.00044591766,0.00022626549,0.0008058943],"domain_scores_gemma":[0.99442405,0.003648654,0.00080046407,0.00009624022,0.00052664924,0.00050398125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039119185,0.0021239615,0.0034846277,0.0013419361,0.0011464664,0.0041693714,0.0039134794,0.0042395676,0.008094553],"category_scores_gemma":[0.006387522,0.002103394,0.0020769453,0.0018536847,0.0016787251,0.0027841826,0.002074147,0.0035812722,0.00057685276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007678591,0.000057531546,0.00063379464,0.000050188235,0.000051898693,0.00014852424,0.000041848067,0.9800775,0.00020779305,0.016732467,0.0007778567,0.0011437641],"study_design_scores_gemma":[0.000013340685,0.00002516421,0.0002568314,0.0000055621954,0.0000169182,0.000012620579,0.00002521567,0.9968485,0.000031435084,0.0026108662,0.000141083,0.000012366742],"about_ca_topic_score_codex":0.044676416,"about_ca_topic_score_gemma":0.028402295,"teacher_disagreement_score":0.044676416,"about_ca_system_score_codex":0.004881756,"about_ca_system_score_gemma":0.0031201567,"threshold_uncertainty_score":0.088832736},"labels":[],"label_agreement":null},{"id":"W3092630511","doi":"10.1016/j.cor.2021.105255","title":"Integrated lot sizing and blending problems","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Sizing; Time horizon; Safety stock; Mathematical optimization; Flexibility (engineering); Lagrangian relaxation; Product (mathematics); Holding cost; Computer science; Procurement; Variance (accounting); Total cost; Mathematics; Economics; Supply chain; Statistics","score_opus":0.11240989918412804,"score_gpt":0.3213134753319875,"score_spread":0.20890357614785948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092630511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08570217,0.00090095197,0.8995428,0.00041007544,0.00015075685,0.00020318654,0.00032903778,0.00035702542,0.012404103],"genre_scores_gemma":[0.6840507,0.00066435995,0.2904247,0.00013733804,0.0001596894,0.0003044822,0.00080740376,0.0002554491,0.02319583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988771,0.00024503254,0.000071102775,0.0002692337,0.0003868293,0.0001506389],"domain_scores_gemma":[0.9976119,0.001641889,0.00016513345,0.0001844044,0.00024896578,0.00014776514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019807194,0.0014233326,0.0022117663,0.0015295139,0.0007343993,0.0029389272,0.0027272708,0.0021068768,0.011378603],"category_scores_gemma":[0.0062694126,0.0015874291,0.0017161024,0.0031172421,0.0013478673,0.004760976,0.0017634664,0.0023105775,0.000550498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047720253,0.0003806065,0.0016490403,0.00035321186,0.00015955162,0.00031689985,0.00013841107,0.83037275,0.003505862,0.06855978,0.0030349444,0.09105179],"study_design_scores_gemma":[0.000090513626,0.000114084345,0.00053278386,0.000019570687,0.000048257174,0.00010454192,0.000031974254,0.9458783,0.0016675842,0.05027481,0.0012149978,0.000022443724],"about_ca_topic_score_codex":0.002719781,"about_ca_topic_score_gemma":0.0029103386,"teacher_disagreement_score":0.011378603,"about_ca_system_score_codex":0.0015648953,"about_ca_system_score_gemma":0.0013227711,"threshold_uncertainty_score":0.038065255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057873824,0.00027988155,0.98943955,0.00013431373,0.00005953722,0.00013636734,0.00015545623,0.00022959762,0.0037779182],"genre_scores_gemma":[0.2642554,0.0006598782,0.7233946,0.00025164054,0.00017770409,0.0012420538,0.00093482464,0.00052256027,0.008561364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982822,0.00071024284,0.00006544271,0.00019389296,0.00044714686,0.0003011433],"domain_scores_gemma":[0.9972,0.002008444,0.00014561458,0.00011335858,0.00038429297,0.00014826767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004202725,0.0027296958,0.0039382717,0.0018573597,0.0010670811,0.0031466864,0.0027437077,0.0031594168,0.00947805],"category_scores_gemma":[0.0062757013,0.0020444102,0.002906731,0.0020228175,0.0011665362,0.0020754691,0.002349252,0.0034995337,0.0010852519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011094307,0.00013873294,0.00022196496,0.00016165506,0.000062385894,0.000053123098,0.00004372492,0.9415851,0.00060770253,0.027499083,0.0017362096,0.027779426],"study_design_scores_gemma":[0.000016336327,0.000023825181,0.00003265806,0.000009611749,0.000010590404,0.0000036560418,0.000003836391,0.99335444,0.00012861127,0.00611846,0.00029379167,0.0000040862246],"about_ca_topic_score_codex":0.008991485,"about_ca_topic_score_gemma":0.010531978,"teacher_disagreement_score":0.00947805,"about_ca_system_score_codex":0.0022689418,"about_ca_system_score_gemma":0.0041488176,"threshold_uncertainty_score":0.031707287},"labels":[],"label_agreement":null},{"id":"W3119520108","doi":"10.1016/j.cor.2021.105222","title":"Equitable routing of rail hazardous materials shipments using CVaR methodology","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","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":"McMaster University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"CVAR; Expected shortfall; Subgradient method; Computer science; Integer programming; Routing (electronic design automation); Hazardous waste; Stochastic programming; Operations research; Lagrangian relaxation; Risk analysis (engineering); Risk management; Transport engineering; Mathematical optimization; Business; Engineering; Computer network; Mathematics","score_opus":0.69039896253047,"score_gpt":0.5809818750050171,"score_spread":0.10941708752545287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119520108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016820086,0.00011056875,0.97713304,0.00009157952,0.000041399828,0.00007859933,0.00009981464,0.00020032359,0.005424588],"genre_scores_gemma":[0.40408614,0.00026465286,0.5861374,0.000100753496,0.000080906,0.0002525521,0.00047313276,0.0003447648,0.008259679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998159,0.00094406266,0.00007861463,0.00027356166,0.00036502042,0.00017970115],"domain_scores_gemma":[0.99707496,0.0015051769,0.00024096866,0.0003715345,0.000739707,0.00006778391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036043187,0.000760067,0.0012008722,0.0030306417,0.00090158207,0.0017781063,0.0018164649,0.0011361701,0.008664814],"category_scores_gemma":[0.00928403,0.00070549705,0.0012561992,0.0029762988,0.0005845794,0.0019925474,0.0016591019,0.001041824,0.0006713815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003659842,0.00004435514,0.0004852456,0.00003763923,0.000028311668,0.00003233772,0.00003748348,0.93519413,0.00045383035,0.019913338,0.0007557346,0.042980906],"study_design_scores_gemma":[0.0000058639976,0.000025335043,0.0001320139,0.000007870954,0.00000995953,0.000010993885,0.000022055952,0.98730266,0.00025332303,0.011511701,0.0007136362,0.0000045629026],"about_ca_topic_score_codex":0.010416745,"about_ca_topic_score_gemma":0.010436154,"teacher_disagreement_score":0.010416745,"about_ca_system_score_codex":0.0015596062,"about_ca_system_score_gemma":0.002588867,"threshold_uncertainty_score":0.028986692},"labels":[],"label_agreement":null},{"id":"W3153691144","doi":"10.1016/j.cor.2021.105295","title":"Appointment scheduling with a quantile objective","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Simon Fraser University; Western University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Operations research; Overtime; Job shop scheduling; Operations management; Schedule; Engineering; Economics","score_opus":0.1855499173152807,"score_gpt":0.5142373692982883,"score_spread":0.32868745198300764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153691144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035623837,0.00077991025,0.9557462,0.0012110642,0.00021336957,0.00017732909,0.00082133134,0.0007266007,0.004700306],"genre_scores_gemma":[0.82726216,0.0008246818,0.15420797,0.00048029897,0.000530939,0.00030815907,0.00110596,0.00044626612,0.014833541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980393,0.0009250996,0.000066632645,0.0003128839,0.00019903271,0.00045701253],"domain_scores_gemma":[0.9972646,0.0017232399,0.0002520714,0.00024006114,0.00027571144,0.00024436606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048388382,0.00096390035,0.0027060967,0.0010099771,0.0005253374,0.0017522626,0.0023480644,0.0016027922,0.01067665],"category_scores_gemma":[0.008414601,0.00083129364,0.0011698706,0.0023386278,0.00073498074,0.0016327688,0.0017390886,0.0021802047,0.0009548677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020736629,0.00012211717,0.0005741027,0.00007297424,0.000040658564,0.000027489219,0.000024609448,0.9599762,0.0004025294,0.01378829,0.0030479867,0.021715673],"study_design_scores_gemma":[0.000020263256,0.000046307476,0.00018378632,0.0000053213766,0.000007902528,0.0000052522932,0.000008478223,0.9946883,0.00009304259,0.004631472,0.00030565442,0.0000042982833],"about_ca_topic_score_codex":0.010716705,"about_ca_topic_score_gemma":0.0055805156,"teacher_disagreement_score":0.010716705,"about_ca_system_score_codex":0.0020288378,"about_ca_system_score_gemma":0.0024230625,"threshold_uncertainty_score":0.03571695},"labels":[],"label_agreement":null},{"id":"W3170912669","doi":"10.1016/j.cor.2021.105366","title":"Revenue optimization in energy networks involving self-scheduled demand and a smart grid","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Smart Grid Energy Management","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":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Bilevel optimization; Heuristics; Computer science; Mathematical optimization; Smart grid; Computation; Load balancing (electrical power); Heuristic; Grid; Integer (computer science); Revenue; Optimization problem; Algorithm; Mathematics","score_opus":0.018142100342238402,"score_gpt":0.25707757239183904,"score_spread":0.23893547204960064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170912669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36797714,0.0028508862,0.57337815,0.0054237186,0.00056812406,0.0002545001,0.0006218492,0.0004082444,0.04851741],"genre_scores_gemma":[0.9815812,0.0005123564,0.010013702,0.00009018306,0.00009106755,0.00003478147,0.00006615986,0.000060214832,0.0075502694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916184,0.00048284588,0.00001953507,0.000087931,0.00008841645,0.00015951018],"domain_scores_gemma":[0.9965004,0.0027865344,0.00022411313,0.00008383917,0.00022542306,0.00017960624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002154069,0.000734583,0.0014837232,0.0006772113,0.000558071,0.0021741746,0.0014916124,0.0011619244,0.0041092327],"category_scores_gemma":[0.006802559,0.0008202489,0.0005498064,0.0011092747,0.0012679452,0.0025252698,0.00105469,0.0014085672,0.0002791465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001676664,0.000069405476,0.00032952763,0.000063150605,0.00002505739,0.00013897792,0.000029478177,0.94030726,0.00041106052,0.05096402,0.0022225091,0.005271906],"study_design_scores_gemma":[0.000014451985,0.000022508644,0.00008539176,0.0000053439007,0.0000067234323,0.00002560673,0.000025659996,0.9844518,0.000104661885,0.014967038,0.00028494882,0.0000058203996],"about_ca_topic_score_codex":0.0053585665,"about_ca_topic_score_gemma":0.0051087025,"teacher_disagreement_score":0.0053585665,"about_ca_system_score_codex":0.0021115688,"about_ca_system_score_gemma":0.0012357567,"threshold_uncertainty_score":0.015320599},"labels":[],"label_agreement":null},{"id":"W3171241085","doi":"10.1016/j.cor.2021.105398","title":"Chance constrained unit commitment approximation under stochastic wind energy","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Electric Power System Optimization","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":"Laurentian University","funders":"National Science Foundation","keywords":"Mathematical optimization; Wind power; Computer science; Intermittency; Power system simulation; Time horizon; Renewable energy; Scheduling (production processes); Electric power system; Power (physics); Mathematics; Engineering; Electrical engineering","score_opus":0.04731758283479383,"score_gpt":0.30431309412673535,"score_spread":0.25699551129194154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171241085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07166197,0.0010591664,0.9093919,0.0013219935,0.0003300313,0.000082022896,0.0003329165,0.00029278273,0.01552725],"genre_scores_gemma":[0.9458905,0.00048507995,0.043957733,0.00022634298,0.00015895523,0.0001590077,0.00025994366,0.00013631774,0.008726233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992418,0.00039566518,0.000028633422,0.00009245961,0.0001384773,0.00010295765],"domain_scores_gemma":[0.9955481,0.0036170078,0.00029712645,0.00014677801,0.00024367246,0.00014725149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021811414,0.0008258589,0.0022605406,0.00053514104,0.00044153293,0.0018029219,0.0017571445,0.002045326,0.004671683],"category_scores_gemma":[0.008081195,0.0013390363,0.00079681765,0.0013433844,0.0009680815,0.0016086441,0.001078339,0.0018751721,0.00037154852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001660202,0.000004817045,0.00007521822,0.00001426167,0.000011425941,0.00002275234,0.000004846277,0.99235535,0.000033690816,0.0061053536,0.00026700814,0.0010886475],"study_design_scores_gemma":[0.0000021952792,0.0000021047206,0.000016174885,0.0000021604183,0.0000011538658,0.0000018108905,0.0000011516178,0.998408,0.00001160592,0.0015221571,0.000030387204,0.0000010974298],"about_ca_topic_score_codex":0.010040712,"about_ca_topic_score_gemma":0.0076950826,"teacher_disagreement_score":0.010040712,"about_ca_system_score_codex":0.0012329216,"about_ca_system_score_gemma":0.0013497993,"threshold_uncertainty_score":0.019964516},"labels":[],"label_agreement":null},{"id":"W3187917979","doi":"10.1016/j.cor.2021.105511","title":"The transit time constrained fixed charge multi-commodity network design problem","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban and Freight Transport Logistics","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":"HEC Montréal; Group for Research in Decision Analysis; Concordia University","funders":"","keywords":"Solver; Fixed charge; Mathematical optimization; Network planning and design; Flow network; Computer science; Path (computing); Set (abstract data type); Integer programming; Integer (computer science); Commodity; Mathematics","score_opus":0.10851320877495209,"score_gpt":0.2885765261306434,"score_spread":0.1800633173556913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187917979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0960223,0.001085513,0.86789393,0.001953347,0.00031544216,0.00049908366,0.0009700868,0.000267889,0.030992415],"genre_scores_gemma":[0.8403561,0.0010820377,0.13231272,0.00034275747,0.00018253796,0.00037950976,0.0005726007,0.00018065891,0.024591101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919385,0.00033346756,0.00002261668,0.00018506762,0.00013131423,0.00013371912],"domain_scores_gemma":[0.9987877,0.000780921,0.00009810023,0.000056518908,0.00014686673,0.00012984326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014871272,0.0014473137,0.0014534725,0.0008693169,0.0007141202,0.0022057793,0.0020410721,0.0027247132,0.009673295],"category_scores_gemma":[0.00389788,0.0010094028,0.0009674693,0.0014878722,0.0009095381,0.002149653,0.0010924288,0.0012525485,0.00047936893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015572822,0.00009230096,0.00036276958,0.0002201104,0.00005217317,0.00018405316,0.000051285693,0.9468485,0.0007746217,0.023344273,0.0036500914,0.024264075],"study_design_scores_gemma":[0.00008286771,0.00015613435,0.00019129964,0.000025703604,0.00004219877,0.000094100964,0.00005566282,0.9679233,0.00051385444,0.027845731,0.0030533015,0.000015830623],"about_ca_topic_score_codex":0.005591341,"about_ca_topic_score_gemma":0.005642141,"teacher_disagreement_score":0.009673295,"about_ca_system_score_codex":0.0021130433,"about_ca_system_score_gemma":0.0022646917,"threshold_uncertainty_score":0.032360375},"labels":[],"label_agreement":null},{"id":"W3203248446","doi":"10.1016/j.cor.2021.105564","title":"A simple and efficient computing procedure of the stationary system-length distributions for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e4202\" altimg=\"si7.svg\"><mml:mrow><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:mi>D</mml:mi><mml:mo>/</mml:mo><mml:mi>c</mml:mi></mml:mrow></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e4223\" altimg=\"si625.svg\"><mml:mrow><mml:mi>B</mml:mi><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo>/</mml:mo><mml:mi>D</mml:mi><mml:mo>/</mml:mo><mml:mi>c</mml:mi></mml:mrow></mml:math> queues","year":2021,"lang":"lv","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalable Vector Graphics; Simple (philosophy); Computer science; Algorithm; Mathematics; World Wide Web","score_opus":0.02077994021901275,"score_gpt":0.2674691868193529,"score_spread":0.24668924660034014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203248446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028432943,0.00010287737,0.9855182,0.00010398112,0.00007438229,0.00010433533,0.0006967145,0.006324171,0.004232131],"genre_scores_gemma":[0.08764057,0.00042143642,0.88157374,0.00020894654,0.00014731174,0.00077007315,0.005520823,0.004863041,0.018854115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.00008793704,0.000050459766,0.00014545427,0.00021255705,0.00008832585],"domain_scores_gemma":[0.9981154,0.0008182105,0.0001127074,0.0003030363,0.00055922836,0.00009144505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011679222,0.0020856655,0.0010669114,0.002242902,0.0013353219,0.0014734918,0.0015833994,0.0009870778,0.06348666],"category_scores_gemma":[0.008032233,0.00067555986,0.001323642,0.0013410456,0.00059396145,0.0022095658,0.001921664,0.0021785123,0.03141543],"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.00027924764,0.00024153621,0.004144968,0.00080589304,0.00017233146,0.0005891507,0.0006885945,0.20306177,0.019906756,0.09315819,0.06666335,0.61028826],"study_design_scores_gemma":[0.00007223604,0.000063359395,0.0015718255,0.000055929893,0.000045710938,0.000254855,0.00019266988,0.89690626,0.013062327,0.0589488,0.02873275,0.000093354596],"about_ca_topic_score_codex":0.011053046,"about_ca_topic_score_gemma":0.014417473,"teacher_disagreement_score":0.06348666,"about_ca_system_score_codex":0.0011074477,"about_ca_system_score_gemma":0.0037514465,"threshold_uncertainty_score":0.21238405},"labels":[],"label_agreement":null},{"id":"W3212339558","doi":"10.1016/j.cor.2021.105611","title":"Skyport location problem for urban air mobility system","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":40,"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; University of New Brunswick","funders":"Ministry of Land, Infrastructure and Transport","keywords":"Taxis; Computer science; Traffic congestion; Flow network; Scheduling (production processes); Genetic algorithm; Service (business); Heuristic; Mathematical optimization; Operations research; Routing (electronic design automation); Air traffic control; Transport engineering; Computer network; Engineering; Artificial intelligence; Mathematics","score_opus":0.0330537921794643,"score_gpt":0.29657525247077515,"score_spread":0.26352146029131085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212339558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54388046,0.0029349914,0.40013507,0.0065894625,0.00034709525,0.00046281572,0.0061279335,0.0006851124,0.038837086],"genre_scores_gemma":[0.95651436,0.00072301767,0.024514632,0.00019408103,0.000105263636,0.00015220801,0.0017944009,0.00013649215,0.01586547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992336,0.00033683787,0.000030046409,0.00014376135,0.000076751945,0.00017907794],"domain_scores_gemma":[0.9979249,0.0013467444,0.00023665668,0.00008463141,0.00022111378,0.00018590956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001102105,0.0010879609,0.0023126658,0.0010994263,0.0009508228,0.0025031988,0.002036867,0.0028367185,0.014206263],"category_scores_gemma":[0.004739355,0.00088364264,0.0009645251,0.0015313275,0.0010815221,0.0028686696,0.0018749543,0.00127831,0.0006512931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025577427,0.00006282783,0.0012652994,0.00019115,0.00006411241,0.00030416096,0.00006365967,0.9682884,0.00045338913,0.01527395,0.0075217336,0.0062554935],"study_design_scores_gemma":[0.000034082466,0.00004540082,0.00033448494,0.000013363699,0.000017156088,0.00005601576,0.00009286052,0.99170953,0.00014390546,0.006900598,0.0006427358,0.000009929126],"about_ca_topic_score_codex":0.024972422,"about_ca_topic_score_gemma":0.012283384,"teacher_disagreement_score":0.024972422,"about_ca_system_score_codex":0.0016590087,"about_ca_system_score_gemma":0.0017639282,"threshold_uncertainty_score":0.049654126},"labels":[],"label_agreement":null},{"id":"W3214935581","doi":"10.1016/j.cor.2021.105629","title":"A time–space formulation for the locomotive routing problem at the Canadian National Railways","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Railway Systems and Energy Efficiency","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":true,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Computer science; Vehicle routing problem; Operations research; Routing (electronic design automation); Space (punctuation); Transport engineering; Mathematical optimization; Engineering; Mathematics; Computer network","score_opus":0.043692456857560076,"score_gpt":0.30290484525562456,"score_spread":0.2592123883980645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214935581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037008908,0.0020941207,0.84174055,0.0054322905,0.00057801313,0.00029855524,0.0019914154,0.00015602568,0.11070005],"genre_scores_gemma":[0.62758094,0.0026138106,0.26178977,0.0008707769,0.0005726985,0.0004777437,0.0021337054,0.00026441296,0.10369622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995091,0.00009825098,0.000015451262,0.00007601332,0.00017879962,0.00012234985],"domain_scores_gemma":[0.99957865,0.00014765882,0.000028653783,0.00001640946,0.00016644086,0.000062179104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009245216,0.001002458,0.00083464204,0.00078422675,0.0011606805,0.0023777096,0.0022366405,0.0018423785,0.013123605],"category_scores_gemma":[0.001837012,0.00055074337,0.00086542877,0.0015747764,0.000978289,0.0012884836,0.0011809235,0.0017406888,0.0007699467],"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.000025120533,0.00003064184,0.00020422664,0.000060143564,0.000013977203,0.000089201385,0.000054768745,0.8805487,0.0004063523,0.102008946,0.007148071,0.009409835],"study_design_scores_gemma":[0.000015017608,0.000015881918,0.0001861812,0.000018338487,0.000008968073,0.000016831455,0.00006306961,0.96855587,0.00009559834,0.023979044,0.0070321676,0.000013040321],"about_ca_topic_score_codex":0.58626926,"about_ca_topic_score_gemma":0.5640361,"teacher_disagreement_score":0.41373074,"about_ca_system_score_codex":0.0067766765,"about_ca_system_score_gemma":0.011315563,"threshold_uncertainty_score":0.8323346},"labels":[],"label_agreement":null},{"id":"W3216088355","doi":"10.1016/j.cor.2021.105651","title":"Coordinating visit interval and safety stock decisions in a two-level supply chain with shelf-life considerations","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Victoria","funders":"","keywords":"Shelf life; Safety stock; Supply chain; Interval (graph theory); Stock (firearms); Operations management; Computer science; Operations research; Business; Mathematics; Marketing; Economics; Engineering; Combinatorics","score_opus":0.0999513952256198,"score_gpt":0.3459328366949036,"score_spread":0.2459814414692838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216088355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6581352,0.00046218294,0.32950604,0.00092581584,0.00009473024,0.00044962415,0.00041525322,0.00062731537,0.009383958],"genre_scores_gemma":[0.9662266,0.00010551896,0.030698506,0.000038507573,0.00002786516,0.000061448896,0.00017064824,0.000038495968,0.002632386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981688,0.00039062515,0.00013055299,0.00045038102,0.0002662608,0.00059335877],"domain_scores_gemma":[0.99367887,0.0034691743,0.0007890752,0.00026634504,0.00077662326,0.001020018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035879165,0.0008477653,0.0022879578,0.0019440749,0.0015180346,0.0069630635,0.0023176959,0.0023758204,0.006902276],"category_scores_gemma":[0.008830102,0.002039448,0.00082728296,0.0030603718,0.0011757028,0.0042122025,0.0027069373,0.0013334525,0.0007034819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009013225,0.00024291326,0.0069305026,0.00009637942,0.00007396258,0.0002871683,0.00025562063,0.9476078,0.0029150413,0.004934523,0.00078501354,0.034969755],"study_design_scores_gemma":[0.00003555657,0.00015935532,0.0015719454,0.0000093916715,0.00003928898,0.000024402576,0.00013540933,0.9933704,0.0009992673,0.0033240053,0.0003030965,0.000027781261],"about_ca_topic_score_codex":0.015598459,"about_ca_topic_score_gemma":0.019256953,"teacher_disagreement_score":0.015598459,"about_ca_system_score_codex":0.0026400879,"about_ca_system_score_gemma":0.003656487,"threshold_uncertainty_score":0.031015277},"labels":[],"label_agreement":null},{"id":"W4210308051","doi":"10.1016/j.cor.2022.105724","title":"Environmental and social implications of incorporating carpooling service on a customized bus system","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":40,"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":"Computer science; Incentive; Greenhouse gas; Heuristic; Service (business); Sustainable transport; Operations research; Pareto principle; Multi-objective optimization; Public transport; Sustainability; Mathematical optimization; Environmental economics; Transport engineering; Engineering; Business; Mathematics","score_opus":0.04012678617542295,"score_gpt":0.29438921384570893,"score_spread":0.25426242767028595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210308051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839497,0.000011109377,0.00013128582,0.00038094528,0.0000108258755,0.000021291458,0.00003255036,0.000008689168,0.015453679],"genre_scores_gemma":[0.9985002,0.000011752259,0.00010339489,0.00003207805,0.0000035925248,0.0000057831776,0.000012088495,0.0000029747423,0.0013280902],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990614,0.00041226664,0.000018106739,0.00004791738,0.00010545167,0.00035486164],"domain_scores_gemma":[0.9987251,0.00029632385,0.00015298477,0.000085389634,0.00039643326,0.00034367907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000620527,0.00022572174,0.000119256474,0.000590128,0.0030349423,0.0023811313,0.0007085233,0.0011155009,0.010340959],"category_scores_gemma":[0.0020875013,0.00017086529,0.00048091498,0.0006759984,0.0016006648,0.0011971758,0.0015991948,0.00084919063,0.00040058146],"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.008030534,0.018638868,0.4679084,0.00044663606,0.0004976767,0.010131564,0.04300395,0.09768991,0.0464719,0.10353416,0.013420842,0.19022545],"study_design_scores_gemma":[0.00026129934,0.005088297,0.6161769,0.00015302763,0.00048858946,0.00039180796,0.26915345,0.042968053,0.009234182,0.021267002,0.034569792,0.0002476071],"about_ca_topic_score_codex":0.061222706,"about_ca_topic_score_gemma":0.15968119,"teacher_disagreement_score":0.061222706,"about_ca_system_score_codex":0.004021059,"about_ca_system_score_gemma":0.0027038236,"threshold_uncertainty_score":0.12173271},"labels":[],"label_agreement":null},{"id":"W4212934617","doi":"10.1016/j.cor.2022.105738","title":"A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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; Transport Canada","funders":"Shanghai Jiao Tong University; National Natural Science Foundation of China","keywords":"Computer science; Preventive maintenance; Variable neighborhood search; Algorithm; Scheduling (production processes); Variable (mathematics); Mathematical optimization; Mathematics; Reliability engineering; Metaheuristic; Engineering","score_opus":0.031321115882438216,"score_gpt":0.3209983998812939,"score_spread":0.28967728399885573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212934617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013566076,0.00032222114,0.9830032,0.0001643439,0.00008471034,0.00009452194,0.00004621579,0.00018024274,0.002538556],"genre_scores_gemma":[0.2818434,0.00033230704,0.71159565,0.00017374712,0.000109257024,0.000505145,0.00026307692,0.00013966566,0.005037693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999585,0.00016140813,0.000017790395,0.00008437657,0.00010714155,0.00004441904],"domain_scores_gemma":[0.9991886,0.00053384376,0.00005487887,0.00003284501,0.00014800843,0.00004173957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014936073,0.0006492228,0.001642592,0.00074817333,0.0005707755,0.00073999097,0.0017177828,0.0017259725,0.0028725814],"category_scores_gemma":[0.0025930752,0.000600654,0.00072090083,0.0009727014,0.0005497466,0.0010055586,0.0010502973,0.0009620247,0.00033395115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009226812,0.00007256526,0.00022999651,0.00005514244,0.000031268497,0.00003061743,0.000031526666,0.94153225,0.0006692351,0.0066655576,0.0014501195,0.049139533],"study_design_scores_gemma":[0.000016701342,0.000020293737,0.00003182873,0.0000028412826,0.0000034679776,0.0000054618918,0.0000031394513,0.9987006,0.0000525112,0.00093529915,0.00022582493,0.0000019828124],"about_ca_topic_score_codex":0.0077449903,"about_ca_topic_score_gemma":0.007345266,"teacher_disagreement_score":0.0077449903,"about_ca_system_score_codex":0.0007118508,"about_ca_system_score_gemma":0.001478525,"threshold_uncertainty_score":0.015399814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120460466,0.0009838078,0.8376192,0.0022774024,0.0003063395,0.00012369953,0.00072458124,0.00012838696,0.03737605],"genre_scores_gemma":[0.87370664,0.0009801219,0.093997985,0.00030728607,0.00027311625,0.00014048391,0.0006750222,0.00009456466,0.02982479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994685,0.00021807526,0.000019008177,0.00012968045,0.00008100875,0.00008372569],"domain_scores_gemma":[0.9987716,0.0007951206,0.00013425,0.00007570448,0.00009503787,0.00012828186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007667007,0.0005892461,0.00096297055,0.0004421664,0.0005730128,0.0016936476,0.0010762059,0.0019376792,0.007563298],"category_scores_gemma":[0.0036632875,0.00044855243,0.0005283507,0.000593649,0.0011094365,0.0025027965,0.0017092956,0.0011732264,0.00047853848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040203548,0.00026070763,0.0013007453,0.0003003047,0.000066827226,0.0004687947,0.00015907931,0.5668921,0.001924459,0.3464566,0.010361203,0.071407124],"study_design_scores_gemma":[0.00007811784,0.00011286255,0.00025416218,0.000021248048,0.000023082295,0.00015732243,0.00011712725,0.808763,0.0005905327,0.18398935,0.005872325,0.000020894124],"about_ca_topic_score_codex":0.0014006364,"about_ca_topic_score_gemma":0.0014675166,"teacher_disagreement_score":0.007563298,"about_ca_system_score_codex":0.000516821,"about_ca_system_score_gemma":0.0008309805,"threshold_uncertainty_score":0.025301754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056111455,0.0026828735,0.91974664,0.0019717722,0.00022223474,0.0004305147,0.000793746,0.00047269667,0.017568115],"genre_scores_gemma":[0.58111304,0.0045600985,0.37619635,0.0003566019,0.0004423936,0.0008601264,0.0015760617,0.0005309095,0.034364425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999116,0.00042714903,0.000033635934,0.00013295366,0.0001383437,0.00015186291],"domain_scores_gemma":[0.99609,0.003321701,0.00016698045,0.00008219501,0.00015165715,0.00018752286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003022406,0.0021601326,0.0029362652,0.0014774096,0.0008883338,0.002653968,0.0026070015,0.003020783,0.012022514],"category_scores_gemma":[0.007209696,0.0015485524,0.0015136062,0.00275834,0.0016154613,0.0038666388,0.0013930697,0.0032285384,0.0007758773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027672117,0.00017367095,0.00038202893,0.00027035398,0.00006265238,0.00009910347,0.000054143038,0.93528587,0.00040217815,0.033663545,0.0041387384,0.025190959],"study_design_scores_gemma":[0.00003896323,0.000050434042,0.0001185264,0.000015224454,0.000023865014,0.00001868749,0.000018571174,0.97822964,0.0001079716,0.02078193,0.00058814714,0.000007988413],"about_ca_topic_score_codex":0.016440094,"about_ca_topic_score_gemma":0.012339552,"teacher_disagreement_score":0.016440094,"about_ca_system_score_codex":0.0030872636,"about_ca_system_score_gemma":0.0031911738,"threshold_uncertainty_score":0.040219367},"labels":[],"label_agreement":null},{"id":"W4283214100","doi":"10.1016/j.cor.2022.105913","title":"Covid-19 PPE distribution planning with demand priorities and supply uncertainties","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Government (linguistics); Computer science; Supply and demand; Operations research; Business; Distribution (mathematics); Revenue; Environmental economics; Risk analysis (engineering); Economics; Engineering; Finance; Microeconomics","score_opus":0.0837601693863819,"score_gpt":0.34104707251257904,"score_spread":0.2572869031261972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283214100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038056485,0.00073292205,0.6466551,0.002378897,0.0004822456,0.0003412115,0.0025965332,0.0015857151,0.30717093],"genre_scores_gemma":[0.6117862,0.00060807844,0.22150888,0.00028570095,0.00016940916,0.00021995175,0.00259728,0.0007291255,0.16209534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993259,0.000283828,0.000022349575,0.000111473266,0.00015074394,0.000105811065],"domain_scores_gemma":[0.9991697,0.0003659906,0.000035256115,0.000076115815,0.00027464257,0.00007826552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131551,0.00068563246,0.0008511782,0.0011453894,0.0009079748,0.0034568354,0.00066430296,0.0012908021,0.037151102],"category_scores_gemma":[0.0030559376,0.0007975363,0.00075620407,0.001512998,0.0004857632,0.0016055147,0.0010837642,0.001002598,0.0031655997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015537505,0.00007351901,0.0013399896,0.00010850972,0.000041802756,0.0002324222,0.00007160456,0.8175659,0.0010030871,0.055623878,0.02883903,0.0949449],"study_design_scores_gemma":[0.00001801584,0.00003502869,0.0003612682,0.0000354631,0.000011460983,0.00005095133,0.000088235036,0.9548604,0.000766061,0.023640111,0.020120567,0.000012409543],"about_ca_topic_score_codex":0.021820348,"about_ca_topic_score_gemma":0.04464963,"teacher_disagreement_score":0.037151102,"about_ca_system_score_codex":0.002020419,"about_ca_system_score_gemma":0.0024854513,"threshold_uncertainty_score":0.12428278},"labels":[],"label_agreement":null},{"id":"W4285081856","doi":"10.1016/j.cor.2022.105933","title":"The dial-a-ride problem with private fleet and common carrier","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; Compute Canada","keywords":"Computer science; Key (lock); Mathematical optimization; Metaheuristic; Taxis; Vehicle routing problem; Service provider; Service (business); Genetic algorithm; Outsourcing; Operations research; Routing (electronic design automation); Algorithm; Computer network; Transport engineering; Mathematics","score_opus":0.025853680611030033,"score_gpt":0.2956066425456766,"score_spread":0.26975296193464654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285081856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43455985,0.00486111,0.24344586,0.064665124,0.00080651126,0.00045272103,0.003651952,0.00054906367,0.24700777],"genre_scores_gemma":[0.9058603,0.0020194217,0.021045364,0.0012351113,0.00046459518,0.00014410727,0.0006337024,0.00019047866,0.068406925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975331,0.00091833126,0.00011302752,0.0005226666,0.0002461972,0.0006667356],"domain_scores_gemma":[0.98463213,0.011204019,0.0009218459,0.001117512,0.0006867709,0.0014376972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036277266,0.00097392825,0.0043925927,0.0016076441,0.0045982352,0.006445039,0.0045081167,0.013117377,0.03776745],"category_scores_gemma":[0.026215449,0.0016273778,0.0019765734,0.0037766781,0.004917986,0.017166803,0.0048265024,0.0060027307,0.0016145725],"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.0003752011,0.00025017606,0.0017266922,0.00024775995,0.00010797747,0.0012232539,0.0006359213,0.07260137,0.00019820927,0.8583237,0.046958826,0.017350893],"study_design_scores_gemma":[0.00022027982,0.000062545965,0.0004957693,0.00006636018,0.00005958078,0.0005812779,0.0010375921,0.11280882,0.00018857497,0.87400454,0.0104082,0.000066481494],"about_ca_topic_score_codex":0.0243433,"about_ca_topic_score_gemma":0.014493168,"teacher_disagreement_score":0.03776745,"about_ca_system_score_codex":0.0024301382,"about_ca_system_score_gemma":0.002350446,"threshold_uncertainty_score":0.12634468},"labels":[],"label_agreement":null},{"id":"W4287448280","doi":"10.1016/j.cor.2022.105965","title":"Robust design of service systems with immobile servers under demand uncertainty","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"","keywords":"Server; Computer science; Service (business); Distributed computing; On demand; Mathematical optimization; Database; Computer network; Mathematics; Business","score_opus":0.3101979093184881,"score_gpt":0.4141470132605036,"score_spread":0.10394910394201551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287448280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0800893,0.0006386569,0.9132906,0.00086777064,0.000081923994,0.00008550344,0.00017840922,0.00024192691,0.0045259087],"genre_scores_gemma":[0.9848082,0.00026416502,0.012151858,0.000060549486,0.00004457471,0.00008411917,0.00008391598,0.000043532622,0.0024591633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986002,0.00048556356,0.00006087431,0.0002566478,0.00027710572,0.00031968852],"domain_scores_gemma":[0.9968239,0.0019691207,0.00053241994,0.0001389979,0.00036416634,0.0001714533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002828605,0.0015838697,0.002344933,0.0008169903,0.0005375246,0.002288047,0.0015297265,0.001972407,0.0019454474],"category_scores_gemma":[0.0071719303,0.0013553675,0.0010301999,0.00078820053,0.0022519105,0.0014188483,0.0022826197,0.0015785551,0.0003219349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004376251,0.0000067257556,0.00006374443,0.000023457334,0.000021623722,0.000017768725,0.0000131408415,0.9938532,0.00045002426,0.0039510657,0.00009044001,0.0014649655],"study_design_scores_gemma":[0.000008584592,0.000021397727,0.00004431628,0.000002878562,0.000006169802,0.0000033906044,0.000006304151,0.99724305,0.00012220281,0.0024854583,0.00005214364,0.0000041802864],"about_ca_topic_score_codex":0.007413084,"about_ca_topic_score_gemma":0.0027706034,"teacher_disagreement_score":0.007413084,"about_ca_system_score_codex":0.001903694,"about_ca_system_score_gemma":0.0020679168,"threshold_uncertainty_score":0.014959216},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50895077,0.00051944016,0.46612892,0.0010442447,0.00018024526,0.00058944145,0.0017338087,0.00069732463,0.020155799],"genre_scores_gemma":[0.95147383,0.0001923392,0.03633999,0.000056086166,0.00004365804,0.00019010037,0.0005453632,0.00015209785,0.01100659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993876,0.00016790241,0.000015517828,0.00009056377,0.000043517666,0.000294909],"domain_scores_gemma":[0.9990933,0.00035655338,0.00006805326,0.000040642117,0.00011050265,0.00033099417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006712276,0.00080504804,0.0013204846,0.0011772576,0.0015746573,0.0021194627,0.0019173586,0.0016410173,0.008691864],"category_scores_gemma":[0.0015947887,0.000988523,0.001532598,0.0019457513,0.0010076007,0.0012109511,0.0014097616,0.001226573,0.0007467242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002428575,0.000071797505,0.0012866338,0.00008086033,0.00005952938,0.00025028028,0.000100418234,0.97765476,0.00096784584,0.005911836,0.0023062474,0.011066905],"study_design_scores_gemma":[0.000014477171,0.000074305965,0.00038188673,0.000008760121,0.000024295714,0.000041383893,0.00017023282,0.9949974,0.00024874823,0.0034224517,0.00060260063,0.000013513087],"about_ca_topic_score_codex":0.05249898,"about_ca_topic_score_gemma":0.043704234,"teacher_disagreement_score":0.05249898,"about_ca_system_score_codex":0.0019929924,"about_ca_system_score_gemma":0.0028623356,"threshold_uncertainty_score":0.10438681},"labels":[],"label_agreement":null},{"id":"W4288760343","doi":"10.1016/j.cor.2022.105982","title":"An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","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; Université Laval","funders":"","keywords":"Clearing; Combinatorial auction; Procurement; Profit (economics); Computer science; Reverse auction; Market clearing; Yield (engineering); Mathematical optimization; Microeconomics; Operations research; Common value auction; Mathematical economics; Economics; Mathematics; Finance","score_opus":0.1746771124065405,"score_gpt":0.4778461632857827,"score_spread":0.30316905087924223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288760343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020436193,0.0001427771,0.9952614,0.000118328906,0.00005571941,0.00006794111,0.00004669511,0.00016050856,0.0021030924],"genre_scores_gemma":[0.13016987,0.00037817744,0.86237377,0.00022214398,0.00024109546,0.00035842942,0.00026969242,0.00028297587,0.0057038674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978993,0.00066747377,0.00010236779,0.00027201563,0.00081046845,0.00024825853],"domain_scores_gemma":[0.99416757,0.0041107787,0.00025674378,0.0004893076,0.0007757029,0.0002000024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035245605,0.0011361067,0.002103446,0.001674503,0.0008446352,0.0019446199,0.0031349356,0.0018177951,0.011216688],"category_scores_gemma":[0.012663429,0.0010760818,0.0015494506,0.0023665775,0.0013380534,0.0034761967,0.0023068388,0.0028126957,0.0013083534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021375135,0.00022712498,0.00063752924,0.00029135987,0.00008932314,0.000116200186,0.00012994246,0.6702512,0.0017043654,0.10073478,0.0060212216,0.2195832],"study_design_scores_gemma":[0.00003337255,0.000019139055,0.000062296305,0.000013057366,0.000010385044,0.000027321625,0.0000109670245,0.965375,0.00016763744,0.03346606,0.00080630474,0.000008409712],"about_ca_topic_score_codex":0.006938323,"about_ca_topic_score_gemma":0.008655475,"teacher_disagreement_score":0.011216688,"about_ca_system_score_codex":0.0017095064,"about_ca_system_score_gemma":0.004184459,"threshold_uncertainty_score":0.037523627},"labels":[],"label_agreement":null},{"id":"W4289732084","doi":"10.1016/j.cor.2022.105970","title":"A column generation-based heuristic for a rehabilitation patient scheduling and routing problem","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Column generation; Computer science; Scheduling (production processes); Mathematical optimization; Travelling salesman problem; Greedy algorithm; Heuristic; Job shop scheduling; Vehicle routing problem; Schedule; Integer programming; Routing (electronic design automation); Artificial intelligence; Algorithm; Mathematics","score_opus":0.16375481121529206,"score_gpt":0.4807051385057603,"score_spread":0.31695032729046824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289732084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12379293,0.0014030974,0.856029,0.0013789608,0.00055639545,0.0008474483,0.0010135183,0.0016731316,0.013305528],"genre_scores_gemma":[0.56398463,0.00039581655,0.42817688,0.0005908678,0.00014181934,0.0004088671,0.0010093043,0.000236742,0.005055052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993549,0.00026164783,0.000024592988,0.00009681996,0.00009423456,0.00016791196],"domain_scores_gemma":[0.99826187,0.0011516388,0.00012230748,0.000071406525,0.00023313124,0.00015965477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011481155,0.0012120098,0.0018780921,0.0015838072,0.0010193392,0.0013315756,0.0017613508,0.0018412828,0.007869034],"category_scores_gemma":[0.002334876,0.0009190789,0.0010706822,0.0018435366,0.0007164218,0.0009660931,0.0010190672,0.0012354313,0.0005886133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019079135,0.00018208861,0.00029925405,0.00008688979,0.00003628228,0.000090468864,0.00003169299,0.961104,0.0009854748,0.0016693359,0.0032208161,0.03210297],"study_design_scores_gemma":[0.000044178993,0.00006281502,0.000083420906,0.000006680521,0.000015656218,0.0000151620425,0.000013447181,0.99830544,0.00020427437,0.000915211,0.00032603779,0.000007590212],"about_ca_topic_score_codex":0.018267678,"about_ca_topic_score_gemma":0.01834086,"teacher_disagreement_score":0.018267678,"about_ca_system_score_codex":0.0015941286,"about_ca_system_score_gemma":0.0030260994,"threshold_uncertainty_score":0.036322713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3438534,0.0023059202,0.6262406,0.0024855747,0.00068400684,0.0010143548,0.002981322,0.00072204403,0.019712877],"genre_scores_gemma":[0.8908247,0.0008197665,0.08213355,0.00022739085,0.0002154023,0.00039630977,0.0013073415,0.00020973875,0.02386586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852544,0.00044136101,0.00006845207,0.0004273487,0.00016418933,0.00037325028],"domain_scores_gemma":[0.99728787,0.0015784508,0.00028617398,0.0001616496,0.00017515902,0.0005108146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021046014,0.002515167,0.0057202983,0.0015951685,0.0020571318,0.0038060432,0.0058209337,0.0068308585,0.010281176],"category_scores_gemma":[0.003934895,0.0024564725,0.0032255044,0.0025581112,0.0017283126,0.0038459457,0.0033183533,0.0032003454,0.0011402648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047716734,0.0002396343,0.00069407176,0.00028534484,0.00012790311,0.0006385953,0.00010098092,0.9769876,0.0008131242,0.0071190507,0.0027203243,0.009796138],"study_design_scores_gemma":[0.00008635322,0.00020209854,0.0002590269,0.000018091918,0.000049042876,0.000121208075,0.00013225157,0.99407697,0.00031869576,0.0039039883,0.0008032763,0.000029069775],"about_ca_topic_score_codex":0.014601674,"about_ca_topic_score_gemma":0.010449073,"teacher_disagreement_score":0.014601674,"about_ca_system_score_codex":0.0020677862,"about_ca_system_score_gemma":0.0022257334,"threshold_uncertainty_score":0.034393966},"labels":[],"label_agreement":null},{"id":"W4294877966","doi":"10.1016/j.cor.2022.106014","title":"Two dimensional guillotine cutting stock and scheduling problem in printing industry","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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":"Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Cutting stock problem; Scheduling (production processes); Computer science; Stock (firearms); Operations management; Operations research; Industrial engineering; Manufacturing engineering; Engineering drawing; Business; Mathematics; Engineering; Algorithm; Mechanical engineering; Optimization problem","score_opus":0.05376228923211648,"score_gpt":0.33716514598768865,"score_spread":0.2834028567555722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294877966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63706577,0.0040193023,0.3232821,0.0022086937,0.00033171911,0.000120230405,0.00081818755,0.00023736239,0.03191662],"genre_scores_gemma":[0.93041617,0.001234013,0.048469514,0.000109323366,0.000118896176,0.00006977092,0.00055374333,0.000054985503,0.018973662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997385,0.00009282424,0.000010358873,0.000052055428,0.000057568806,0.00004869158],"domain_scores_gemma":[0.9993094,0.00047646492,0.00006601655,0.00001855626,0.00005490268,0.00007461567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000381315,0.0005163495,0.00097373716,0.000735495,0.0007146138,0.0015739669,0.00097409723,0.0018158186,0.0035013766],"category_scores_gemma":[0.0010896273,0.00037803449,0.00061464915,0.0013810805,0.00046806454,0.0011651409,0.00044421732,0.0008382589,0.00020818778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052108703,0.00019841542,0.0014619962,0.00036489897,0.000045257824,0.0006802495,0.00012778376,0.9212316,0.0042837625,0.030564573,0.0058595804,0.03466081],"study_design_scores_gemma":[0.0000230071,0.00007181787,0.0010477654,0.000011272109,0.000011432423,0.000093747345,0.000066716,0.98376805,0.0011870897,0.012185204,0.0015180785,0.000015812699],"about_ca_topic_score_codex":0.007769655,"about_ca_topic_score_gemma":0.0064302953,"teacher_disagreement_score":0.007769655,"about_ca_system_score_codex":0.001101684,"about_ca_system_score_gemma":0.0007907719,"threshold_uncertainty_score":0.015448868},"labels":[],"label_agreement":null},{"id":"W4306740563","doi":"10.1016/j.cor.2022.106046","title":"Optimal budget allocation policy for tabu search in stochastic simulation optimization","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Computer science; Operations research; Stochastic optimization; Mathematics","score_opus":0.24734625042891284,"score_gpt":0.5342289773031084,"score_spread":0.2868827268741955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306740563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079689644,0.0007248614,0.9028764,0.0012487903,0.00015431203,0.0002957443,0.00024342834,0.00047031304,0.014296447],"genre_scores_gemma":[0.77351886,0.00037078687,0.2201439,0.0003051764,0.00005546191,0.0006449811,0.0002535056,0.0002556065,0.0044517387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985598,0.0010572369,0.000030556053,0.00008106054,0.00012753441,0.0001439126],"domain_scores_gemma":[0.99704915,0.0023316857,0.00014217026,0.00009721725,0.00024569553,0.00013411413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030849706,0.0006307031,0.0015731981,0.0012966829,0.0007507781,0.0014992944,0.0010868758,0.0016642555,0.006056647],"category_scores_gemma":[0.013956761,0.000949242,0.0006505527,0.0012210725,0.00094729086,0.0014557969,0.0010634045,0.00140231,0.0005395419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007777619,0.00003884819,0.00015127487,0.00003562375,0.000018003067,0.000011681742,0.000024185842,0.9793092,0.00017164001,0.011004831,0.00082379236,0.008333249],"study_design_scores_gemma":[0.000014414188,0.00001019897,0.00003619285,0.000008680387,0.0000034542227,0.000002166724,0.000006295675,0.9955823,0.00006229338,0.0041112243,0.00016042913,0.0000023015527],"about_ca_topic_score_codex":0.008380667,"about_ca_topic_score_gemma":0.0056387824,"teacher_disagreement_score":0.008380667,"about_ca_system_score_codex":0.0020611235,"about_ca_system_score_gemma":0.0033361,"threshold_uncertainty_score":0.020261467},"labels":[],"label_agreement":null},{"id":"W4313420447","doi":"10.1016/j.cor.2022.106134","title":"Dynamic shop-floor scheduling using real-time information: A case study from the thermoplastic industry","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Tardiness; Computer science; Scheduling (production processes); Batch production; Mathematical optimization; Production planning; Dynamic priority scheduling; Job shop scheduling; Real-time computing; Distributed computing; Production (economics); Schedule; Operations management; Engineering; Mathematics","score_opus":0.04411955783424278,"score_gpt":0.3278602881560679,"score_spread":0.2837407303218251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313420447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9730046,0.0002613702,0.021333208,0.00023548493,0.000024979454,0.00011100874,0.00022266622,0.00016989755,0.0046368344],"genre_scores_gemma":[0.9827335,0.00014092695,0.015218701,0.000018862234,0.000010968761,0.000026416834,0.00014457993,0.000032898803,0.0016730963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9994204,0.00024594492,0.000021217362,0.00007575662,0.00012543681,0.00011119754],"domain_scores_gemma":[0.9959835,0.0031917456,0.00017214891,0.00020813341,0.00021804914,0.00022643355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011517949,0.00062777294,0.00060412526,0.0007458051,0.0010636942,0.00086735724,0.0013172614,0.0016460043,0.0031539176],"category_scores_gemma":[0.0028529586,0.00040187006,0.0006177394,0.0014683568,0.00068174035,0.00086134864,0.0004379095,0.0006913804,0.00028308821],"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.0014913322,0.0023395722,0.010079797,0.0005208242,0.00013428315,0.008494272,0.0010194016,0.8853595,0.014934259,0.0071898494,0.002611077,0.06582574],"study_design_scores_gemma":[0.00032507587,0.0009802872,0.0076564928,0.000025840984,0.00010146731,0.0010233284,0.0016509636,0.9695571,0.010532212,0.0038084534,0.0042708362,0.00006785855],"about_ca_topic_score_codex":0.008353772,"about_ca_topic_score_gemma":0.0129382545,"teacher_disagreement_score":0.008353772,"about_ca_system_score_codex":0.00093932974,"about_ca_system_score_gemma":0.0009823653,"threshold_uncertainty_score":0.016610265},"labels":[],"label_agreement":null},{"id":"W4318757153","doi":"10.1016/j.cor.2023.106163","title":"Refined bounds for the non-Archimedean <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si646.svg\" display=\"inline\" id=\"d1e649\"><mml:mi>ϵ</mml:mi></mml:math> in DEA","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Context (archaeology); Data envelopment analysis; Efficiency; Computer science; Pareto principle; Mathematics; Scalability; Mathematical optimization; Applied mathematics; Discrete mathematics; Statistics; Database","score_opus":0.08800498795296491,"score_gpt":0.38347647502431076,"score_spread":0.29547148707134585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318757153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021870514,0.007073624,0.8750264,0.003825387,0.0006790967,0.00025568515,0.0026377947,0.00058884773,0.08804253],"genre_scores_gemma":[0.4406776,0.008287256,0.487661,0.0022680438,0.0016983639,0.0015685272,0.004445001,0.0016844097,0.051709726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898707,0.0031971748,0.00048929366,0.0013656005,0.003715009,0.0013621569],"domain_scores_gemma":[0.9450145,0.036138408,0.0018036878,0.008707885,0.006855771,0.0014796952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015226748,0.0030986716,0.002229271,0.0065678013,0.0018494696,0.0076621864,0.006874841,0.0021693283,0.027703783],"category_scores_gemma":[0.052438673,0.0011691661,0.0037540477,0.0057155243,0.0043896204,0.015912708,0.0053968956,0.010359696,0.0064686206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024786068,0.00012377153,0.000603891,0.0003909051,0.00008934421,0.000059710503,0.00020544944,0.035130966,0.0011607683,0.9163164,0.01356795,0.032103043],"study_design_scores_gemma":[0.000033708566,0.00009337337,0.0007971805,0.0002486269,0.000085890555,0.000082654195,0.000058457874,0.13967282,0.0016448624,0.8428458,0.0143879,0.00004879938],"about_ca_topic_score_codex":0.0047749504,"about_ca_topic_score_gemma":0.0056488705,"teacher_disagreement_score":0.027703783,"about_ca_system_score_codex":0.007216047,"about_ca_system_score_gemma":0.004078146,"threshold_uncertainty_score":0.09267843},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037174597,0.00064858154,0.9282886,0.0013838932,0.00018603793,0.00014112223,0.00050024065,0.00021162438,0.031465385],"genre_scores_gemma":[0.6850583,0.0012469604,0.24398993,0.00034763393,0.00043772635,0.0003737465,0.000754736,0.00037873856,0.06741223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993124,0.00034117562,0.000015761281,0.00013399235,0.00010392164,0.00009283682],"domain_scores_gemma":[0.9994875,0.0003394289,0.000047620408,0.00003061946,0.000048247864,0.000046484463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088402367,0.0009009328,0.0011949104,0.0008351321,0.0005038511,0.0015427447,0.0016182561,0.0018809545,0.010097033],"category_scores_gemma":[0.0028499828,0.0006265834,0.00087387505,0.0015947501,0.00079211214,0.0020904914,0.0012230352,0.0012354561,0.00082263525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006877409,0.000074976066,0.0002126084,0.00009232791,0.000034428635,0.00005864489,0.0000271265,0.9453545,0.00035105855,0.027078195,0.0039606267,0.022686731],"study_design_scores_gemma":[0.000016726362,0.000021790049,0.00011546575,0.000006055294,0.000009533904,0.00001734104,0.000018162234,0.98121053,0.00014427726,0.016412823,0.0020215455,0.000005805758],"about_ca_topic_score_codex":0.008757152,"about_ca_topic_score_gemma":0.0068689543,"teacher_disagreement_score":0.010097033,"about_ca_system_score_codex":0.0012229215,"about_ca_system_score_gemma":0.0014932952,"threshold_uncertainty_score":0.033777893},"labels":[],"label_agreement":null},{"id":"W4320180606","doi":"10.1016/j.cor.2023.106191","title":"Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Reliability and Maintenance Optimization","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":"Dalhousie University","funders":"","keywords":"Column generation; Mathematical optimization; Computer science; Branch and bound; Algorithm; Convergence (economics); Integer (computer science); Embedding; Piecewise linear function; Computation; Mathematics","score_opus":0.05046480676281146,"score_gpt":0.34094365545552496,"score_spread":0.2904788486927135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320180606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027454607,0.0019006298,0.9618858,0.00087507255,0.00014274938,0.00013722459,0.00019219678,0.000601276,0.00681056],"genre_scores_gemma":[0.5220611,0.0018938477,0.46595016,0.00026907824,0.00032357732,0.0005459422,0.0007179695,0.00037780774,0.007860545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919456,0.00038913343,0.000036507674,0.000097643904,0.00014965034,0.00013263927],"domain_scores_gemma":[0.9938519,0.0053482377,0.00020934641,0.00014857999,0.00023811724,0.00020384815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003304168,0.001491761,0.002590872,0.0017090337,0.0010966095,0.0016769216,0.0021570134,0.0025076903,0.007027098],"category_scores_gemma":[0.007686935,0.0012416518,0.00087986153,0.0030743186,0.0011241812,0.0026586093,0.0014968914,0.0027293882,0.00074001076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013922525,0.00014501427,0.00031522743,0.000100442136,0.000042826505,0.00002765986,0.000032921318,0.92109567,0.00021018177,0.014599744,0.0036763866,0.05961485],"study_design_scores_gemma":[0.00003823508,0.000020229529,0.000041093823,0.0000060977095,0.0000061983314,0.0000041888006,0.000004705079,0.98850864,0.000060727114,0.0110978,0.00020942056,0.0000025810243],"about_ca_topic_score_codex":0.009029218,"about_ca_topic_score_gemma":0.009665683,"teacher_disagreement_score":0.009029218,"about_ca_system_score_codex":0.001621915,"about_ca_system_score_gemma":0.002502668,"threshold_uncertainty_score":0.023507953},"labels":[],"label_agreement":null},{"id":"W4324344186","doi":"10.1016/j.cor.2023.106219","title":"Risk-allocation-based index tracking","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Replicate; Portfolio; Mathematical optimization; Heuristic; Cardinality (data modeling); Matching (statistics); Mathematics; Artificial intelligence; Statistics; Data mining; Finance","score_opus":0.2675152343798474,"score_gpt":0.49898783072142117,"score_spread":0.23147259634157374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324344186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015859596,0.00033806547,0.9796362,0.00012596925,0.00007239713,0.0000894404,0.00012902604,0.0008416219,0.0029077313],"genre_scores_gemma":[0.5647344,0.00037302545,0.42793268,0.00018808703,0.00011929093,0.00016544036,0.00060655334,0.00022440797,0.0056560664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975909,0.0006138729,0.00019134214,0.0005273292,0.0008309756,0.0002455638],"domain_scores_gemma":[0.99214387,0.0033189228,0.0009501005,0.0012902047,0.0019820207,0.00031494198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051464885,0.0009511608,0.001990922,0.0025657876,0.00088298024,0.0030165983,0.002133259,0.0016450548,0.0042957924],"category_scores_gemma":[0.020369148,0.00073393196,0.00075644616,0.0027672772,0.0006906672,0.0028171048,0.0024439842,0.0016120203,0.0018780456],"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.00065975357,0.0003289621,0.0071063,0.00015577735,0.00014258255,0.00012256128,0.00013361793,0.37511286,0.010326627,0.020496884,0.006240217,0.57917386],"study_design_scores_gemma":[0.000019487214,0.000045475535,0.0006537199,0.000014254009,0.000018194489,0.000050011407,0.0000066147804,0.9884466,0.00297898,0.00689395,0.0008592162,0.000013565402],"about_ca_topic_score_codex":0.0029953513,"about_ca_topic_score_gemma":0.0028513381,"teacher_disagreement_score":0.0051464885,"about_ca_system_score_codex":0.0011505493,"about_ca_system_score_gemma":0.002110273,"threshold_uncertainty_score":0.027217567},"labels":[],"label_agreement":null},{"id":"W4362635539","doi":"10.1016/j.cor.2023.106243","title":"A double-oracle, logic-based Benders decomposition approach to solve the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si421.svg\" display=\"inline\" id=\"d1e4126\"><mml:mi>K</mml:mi></mml:math>-adaptability problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Group for Research in Decision Analysis; HEC Montréal; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Mathematical optimization; Computer science; Benchmark (surveying); Knapsack problem; Adaptability; Mathematics; Algorithm","score_opus":0.10967688610944475,"score_gpt":0.37500656782604136,"score_spread":0.2653296817165966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362635539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012961178,0.0000817168,0.99461067,0.00015270711,0.00002650351,0.000044305183,0.00008017677,0.00013089814,0.0035769031],"genre_scores_gemma":[0.06923334,0.0003086801,0.92102903,0.00024947687,0.000113016125,0.00025263077,0.0005201228,0.0002833821,0.008010249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985752,0.0005633736,0.00008049083,0.00023269789,0.0003848361,0.00016337686],"domain_scores_gemma":[0.9984059,0.0010303732,0.00008390654,0.00012964554,0.00024237357,0.00010793857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027416367,0.0017884448,0.001504559,0.0012461032,0.0006295756,0.0021035732,0.0017272055,0.0014974482,0.017399061],"category_scores_gemma":[0.005856015,0.0009392067,0.0015686555,0.0013065017,0.0010235562,0.002250515,0.0020782878,0.0040016407,0.0033509906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023774715,0.000352883,0.0006128803,0.0003319908,0.00010581223,0.00018883604,0.0001542598,0.52655226,0.0030454136,0.26037157,0.01681571,0.19123064],"study_design_scores_gemma":[0.000040220508,0.00008338588,0.0000845994,0.00004067075,0.0000211081,0.000048461738,0.00003738563,0.8741902,0.0008771552,0.1212818,0.0032789616,0.000015940144],"about_ca_topic_score_codex":0.0025950589,"about_ca_topic_score_gemma":0.004309674,"teacher_disagreement_score":0.017399061,"about_ca_system_score_codex":0.0010656894,"about_ca_system_score_gemma":0.0024124885,"threshold_uncertainty_score":0.058205724},"labels":[],"label_agreement":null},{"id":"W4376863206","doi":"10.1016/j.cor.2023.106267","title":"Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Bin packing problem; Mathematical optimization; Algorithm; Packing problems; Branch and bound; Branch and cut; Integer programming; Heuristic; Clique; Mathematics; Computer science; Hybrid algorithm (constraint satisfaction); Bin; Constraint programming; Combinatorics","score_opus":0.03246779402847673,"score_gpt":0.29794606897378645,"score_spread":0.26547827494530973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376863206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046313222,0.0009917696,0.9453214,0.00034676358,0.00015086091,0.00014338552,0.00017296635,0.0012372487,0.005322475],"genre_scores_gemma":[0.31997085,0.0005478262,0.6718926,0.00021695095,0.00012953018,0.00036355987,0.00052681717,0.00029167338,0.0060602324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993074,0.00016519765,0.000035020887,0.00009663843,0.00023414675,0.00016158044],"domain_scores_gemma":[0.9991966,0.00045287568,0.0000625892,0.00005967305,0.0001368497,0.00009153494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000905865,0.00096975884,0.0022319506,0.0013531226,0.0008030598,0.0016069082,0.0021006793,0.0018437463,0.0057767676],"category_scores_gemma":[0.0013489954,0.0009004145,0.0009558139,0.0028886786,0.00047426598,0.00202481,0.001277236,0.0013670811,0.0007168808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008282197,0.00045843702,0.00060335634,0.00020384115,0.00013790793,0.00012616895,0.00006026636,0.7060557,0.0047240946,0.012147675,0.0065795546,0.26807478],"study_design_scores_gemma":[0.00005403438,0.000052555835,0.00007764643,0.0000041231865,0.000011144746,0.000017939265,0.0000057479238,0.9966635,0.0004602707,0.0021558716,0.00049136055,0.0000057551533],"about_ca_topic_score_codex":0.009674701,"about_ca_topic_score_gemma":0.007873275,"teacher_disagreement_score":0.009674701,"about_ca_system_score_codex":0.0010972354,"about_ca_system_score_gemma":0.0025468087,"threshold_uncertainty_score":0.019325197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16202566,0.0005619956,0.82204425,0.0007535329,0.00016573566,0.00031464754,0.0012576123,0.00032224559,0.012554338],"genre_scores_gemma":[0.88342434,0.0006571882,0.10101005,0.00013249266,0.00010612267,0.00032187902,0.0010416604,0.00018321302,0.013123023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990932,0.00038765426,0.00004082485,0.0002462497,0.00009195828,0.00014014958],"domain_scores_gemma":[0.9983626,0.0009330986,0.00026809372,0.000119817196,0.00012974368,0.0001866003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015945475,0.001296202,0.0019469663,0.00079845253,0.00072950055,0.0015666493,0.0023591365,0.0018397814,0.0072901053],"category_scores_gemma":[0.0037569623,0.0011477984,0.0010717446,0.0025652545,0.001015746,0.0025435924,0.001706957,0.00097652944,0.0005824865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003187868,0.000062405445,0.00039301335,0.00015327711,0.00006517403,0.00023741924,0.000054578108,0.96230644,0.0010202243,0.023331255,0.0021700936,0.0098873],"study_design_scores_gemma":[0.000063040265,0.00010979015,0.00022058177,0.00001082429,0.00002823118,0.00005129949,0.000059677925,0.9809996,0.0005045555,0.016936496,0.0010018569,0.000014073699],"about_ca_topic_score_codex":0.007522797,"about_ca_topic_score_gemma":0.005965029,"teacher_disagreement_score":0.007522797,"about_ca_system_score_codex":0.0015423446,"about_ca_system_score_gemma":0.0019923304,"threshold_uncertainty_score":0.024387777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17049995,0.00094635686,0.80510795,0.0013011234,0.0003640717,0.00020034001,0.0009141368,0.00029067934,0.02037543],"genre_scores_gemma":[0.9147976,0.00071556837,0.0641691,0.0001878982,0.00036109274,0.00013492188,0.00063479424,0.00011397178,0.018884981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988807,0.0003460096,0.000036322734,0.0002909594,0.00021820051,0.0002278678],"domain_scores_gemma":[0.998516,0.00089481584,0.00017146172,0.00011409391,0.00010980113,0.00019397037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016916848,0.00090960704,0.0016953448,0.0008533168,0.0007866589,0.0022433056,0.0020409303,0.0014354392,0.0063058017],"category_scores_gemma":[0.0032553973,0.0008373561,0.00091827015,0.0018020056,0.00074119325,0.002311811,0.0011349461,0.0014225933,0.0003802434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045293698,0.0001992977,0.0006245641,0.00013044845,0.00007933914,0.00034375166,0.00006617385,0.9219737,0.0022788672,0.05223585,0.0032336165,0.018381396],"study_design_scores_gemma":[0.00005280996,0.00008399888,0.0004822539,0.000006797738,0.000035142297,0.000060211325,0.000036852492,0.9803052,0.00070778554,0.017162716,0.0010541301,0.000012009132],"about_ca_topic_score_codex":0.004678313,"about_ca_topic_score_gemma":0.0030856952,"teacher_disagreement_score":0.0063058017,"about_ca_system_score_codex":0.0020709038,"about_ca_system_score_gemma":0.0013560789,"threshold_uncertainty_score":0.021095037},"labels":[],"label_agreement":null},{"id":"W4380149198","doi":"10.1016/j.cor.2023.106296","title":"A trajectory based heuristic for the planar <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si270.svg\" display=\"inline\" id=\"d1e2918\"><mml:mi>p</mml:mi></mml:math>-median problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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; Royal Ottawa Mental Health Centre","funders":"","keywords":"Trajectory; Planar; Heuristic; Class (philosophy); Mathematics; Fraction (chemistry); Algorithm; Local optimum; Computer science; Applied mathematics; Combinatorics; Mathematical optimization; Artificial intelligence; Computer graphics (images); Physics","score_opus":0.054254834461213645,"score_gpt":0.29587817825774465,"score_spread":0.241623343796531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380149198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035627846,0.00052590325,0.943801,0.0009532369,0.00017628317,0.00037935263,0.00087713095,0.0013876526,0.016271655],"genre_scores_gemma":[0.2538001,0.00041146282,0.72752404,0.00033252581,0.00009939437,0.00047547117,0.0025234355,0.0006060598,0.014227542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933136,0.00018888689,0.00003247467,0.00016657179,0.00011900354,0.00016173601],"domain_scores_gemma":[0.99823666,0.0010973943,0.00013470327,0.000117186566,0.00021722938,0.00019684271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011401854,0.001289036,0.0018003887,0.0021372675,0.0014819779,0.0016182684,0.0026833084,0.0025998396,0.021178663],"category_scores_gemma":[0.003814559,0.0008115291,0.0013078463,0.0022028196,0.001012248,0.0026456094,0.0019880836,0.0017846836,0.0019368209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046229718,0.00035616214,0.0008655512,0.00022710772,0.00007504274,0.00016284674,0.000112671936,0.8293147,0.0009855895,0.039182063,0.02033808,0.107917815],"study_design_scores_gemma":[0.0000937505,0.00009184528,0.00015185402,0.00003211987,0.000015787045,0.000035277884,0.00007044978,0.97636503,0.00045273174,0.020342221,0.0023342501,0.000014626915],"about_ca_topic_score_codex":0.015426457,"about_ca_topic_score_gemma":0.017877273,"teacher_disagreement_score":0.021178663,"about_ca_system_score_codex":0.0023680676,"about_ca_system_score_gemma":0.003787416,"threshold_uncertainty_score":0.07084966},"labels":[],"label_agreement":null},{"id":"W4380716478","doi":"10.1016/j.cor.2023.106304","title":"Efficient multi-objective metaheuristic algorithm for sustainable harvest planning problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Greenhouse Technology and Climate Control","field":"Agricultural and Biological Sciences","cited_by":85,"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":"Beijing University of Civil Engineering and Architecture","keywords":"Sustainability; Computer science; Sorting; Multi-objective optimization; Genetic algorithm; Metaheuristic; Mathematical optimization; Greenhouse gas; Profit (economics); Time horizon; Operations research; Economics; Algorithm; Mathematics; Machine learning","score_opus":0.0750722212165218,"score_gpt":0.3472629148405397,"score_spread":0.27219069362401793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380716478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09102426,0.0011372239,0.89151615,0.00053623604,0.0001460055,0.00019698689,0.00028269136,0.00044749837,0.014712956],"genre_scores_gemma":[0.51537037,0.0004805628,0.47682333,0.00018486893,0.0000793168,0.00050460914,0.00038905433,0.00010164645,0.0060662427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997304,0.0000968544,0.000010999282,0.0000414529,0.00006412187,0.000056193174],"domain_scores_gemma":[0.9996784,0.00019055454,0.000035254892,0.0000165254,0.000057381178,0.000021801634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069947814,0.00082415855,0.0009240492,0.0010653574,0.0005532897,0.0007963883,0.0011691805,0.0014828453,0.0029721346],"category_scores_gemma":[0.0010865404,0.00046414314,0.0007921042,0.0011499275,0.00036622855,0.0006279004,0.0007191015,0.001005756,0.00028044565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071781935,0.00008891902,0.0002657618,0.00006393057,0.00003817185,0.000049386876,0.000022762388,0.9607255,0.0010710473,0.003995846,0.0012617342,0.03234524],"study_design_scores_gemma":[0.000027938295,0.00003114834,0.000076093726,0.0000061468704,0.000009436888,0.000010263996,0.000007298218,0.9981103,0.00020550165,0.0011901972,0.00032326003,0.0000024653025],"about_ca_topic_score_codex":0.005082698,"about_ca_topic_score_gemma":0.0051114857,"teacher_disagreement_score":0.005082698,"about_ca_system_score_codex":0.0008727936,"about_ca_system_score_gemma":0.0014739619,"threshold_uncertainty_score":0.010106206},"labels":[],"label_agreement":null},{"id":"W4380894174","doi":"10.1016/j.cor.2023.106313","title":"A three-phase matheuristic algorithm for the multi-day task assignment problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Tabu search; Mathematical optimization; Algorithm; Heuristic; Computer science; Local optimum; Task (project management); Function (biology); Local search (optimization); Mathematics","score_opus":0.08590262884396564,"score_gpt":0.37478291984366346,"score_spread":0.2888802909996978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380894174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010760504,0.00006586571,0.9833376,0.0002180683,0.00006151567,0.00010768552,0.000044557535,0.00041625154,0.004987907],"genre_scores_gemma":[0.20319058,0.00009345114,0.79027236,0.00023651584,0.00005058986,0.00039753417,0.00015569228,0.00013710895,0.0054661813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996381,0.000105682535,0.000015723443,0.000054617685,0.0001263586,0.000059552363],"domain_scores_gemma":[0.9994722,0.00028535753,0.00003672202,0.00004161745,0.000112168185,0.00005203243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009463595,0.0005963893,0.00076559174,0.00058002037,0.00082812645,0.00088862336,0.0018535967,0.0014538241,0.006999138],"category_scores_gemma":[0.0022064992,0.00042158374,0.0006056718,0.0006659501,0.00060607167,0.0009898032,0.0014654512,0.0010402318,0.00093377044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030893783,0.00017704131,0.0003691716,0.00008673929,0.000033496446,0.0000538783,0.00008847791,0.8105157,0.0031577449,0.020894995,0.0034851243,0.16082881],"study_design_scores_gemma":[0.00006481359,0.00004338074,0.000052756484,0.000003918733,0.0000045946463,0.00001483102,0.000007648537,0.99488443,0.00029038909,0.0037859231,0.0008418114,0.0000053918047],"about_ca_topic_score_codex":0.0069250125,"about_ca_topic_score_gemma":0.008153105,"teacher_disagreement_score":0.006999138,"about_ca_system_score_codex":0.0010934242,"about_ca_system_score_gemma":0.002630335,"threshold_uncertainty_score":0.023414433},"labels":[],"label_agreement":null},{"id":"W4381487490","doi":"10.1016/j.cor.2023.106288","title":"Multi-period location routing: An application to the planning of mobile clinic operations in Iraq","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"HEC Montréal; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Council Canada; Institut de Valorisation des Données; Université du Québec à Montréal","keywords":"Software deployment; Economic shortage; Health care; Time horizon; Routing (electronic design automation); Operations research; Operations management; Computer science; Business; Humanitarian Logistics; Process management; Economics; Engineering; Economic growth; Finance; Computer network","score_opus":0.15106098838707668,"score_gpt":0.41819537731452455,"score_spread":0.2671343889274479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381487490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88175035,0.0004962494,0.100663275,0.0020360753,0.00013674043,0.00047462992,0.0021367222,0.0019131227,0.010392669],"genre_scores_gemma":[0.9107786,0.00035285807,0.08447828,0.000071372415,0.000043370965,0.00012637708,0.00049400126,0.0001235294,0.003531665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996145,0.00020531361,0.00001703114,0.000068746725,0.000034815097,0.000059628816],"domain_scores_gemma":[0.99744934,0.0019675754,0.00013260724,0.000075170305,0.00021260172,0.00016276381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015278944,0.00082743436,0.00080223876,0.0013284391,0.0016011868,0.0016272136,0.0013404582,0.0020158256,0.0060996665],"category_scores_gemma":[0.0035842413,0.0006899754,0.0008864648,0.0025036668,0.0006227027,0.0010717196,0.0009722225,0.0007927249,0.0003473875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026333783,0.00023298291,0.008264401,0.00010804302,0.00007317351,0.00060926774,0.00046151938,0.9510736,0.0010427011,0.0037673858,0.002739994,0.03136352],"study_design_scores_gemma":[0.000044048484,0.00006628953,0.001785127,0.0000073934843,0.000025413736,0.000036340225,0.0004480688,0.99525297,0.00027084444,0.001194313,0.00085308985,0.000016270933],"about_ca_topic_score_codex":0.13472061,"about_ca_topic_score_gemma":0.13005167,"teacher_disagreement_score":0.13472061,"about_ca_system_score_codex":0.0031790654,"about_ca_system_score_gemma":0.0025029487,"threshold_uncertainty_score":0.26787293},"labels":[],"label_agreement":null},{"id":"W4383070024","doi":"10.1016/j.cor.2023.106338","title":"Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","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":"École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Computer science; Context (archaeology); Markov decision process; Mathematical optimization; Set (abstract data type); Variable (mathematics); Dynamic programming; State variable; Routing (electronic design automation); Markov process; Mathematics","score_opus":0.03419786777119948,"score_gpt":0.3140108607773663,"score_spread":0.2798129930061668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383070024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05419,0.00031848758,0.9400373,0.0005867527,0.000059107977,0.00008486156,0.00023243608,0.00017109465,0.0043199994],"genre_scores_gemma":[0.85586035,0.0004530094,0.13331789,0.00019160059,0.00011330285,0.00027861033,0.00054366153,0.00017118453,0.009070394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988267,0.0005852466,0.000033678854,0.00014072472,0.00023041146,0.0001833012],"domain_scores_gemma":[0.99605787,0.0031481527,0.00025124394,0.00013253206,0.00028163032,0.00012851867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020572657,0.0011475475,0.0020386833,0.0007190004,0.00049585087,0.0016772219,0.0017091825,0.0018170523,0.0033580558],"category_scores_gemma":[0.0076405206,0.0011886009,0.0008832685,0.0013096737,0.0010733692,0.0018515931,0.0011426895,0.001936586,0.00032918187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043903237,0.000027098116,0.000112201335,0.000021116375,0.000009328303,0.000016054275,0.000009788246,0.9921633,0.00010224352,0.0037924675,0.00030420852,0.003398188],"study_design_scores_gemma":[0.0000028785207,0.0000069826783,0.000016024565,0.0000012027517,0.0000012477439,0.000002384735,0.0000024788358,0.9984629,0.00001995642,0.0014383439,0.00004442596,0.0000011567963],"about_ca_topic_score_codex":0.012160595,"about_ca_topic_score_gemma":0.009951784,"teacher_disagreement_score":0.012160595,"about_ca_system_score_codex":0.0017996596,"about_ca_system_score_gemma":0.0019152107,"threshold_uncertainty_score":0.024179637},"labels":[],"label_agreement":null},{"id":"W4383895067","doi":"10.1016/j.cor.2023.106347","title":"Rankability and linear ordering problem: Probabilistic insight and algorithms","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","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":"Institut National de la Recherche Scientifique","funders":"Mitacs","keywords":"Pairwise comparison; Algorithm; Probabilistic logic; Computer science; Perspective (graphical); Interpretation (philosophy); Probabilistic analysis of algorithms; Mathematics; Artificial intelligence","score_opus":0.09541336472098304,"score_gpt":0.3875000214888778,"score_spread":0.29208665676789475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383895067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011565659,0.0010628352,0.97781,0.0022705756,0.00008676061,0.000066215325,0.00029076482,0.00017775604,0.006669461],"genre_scores_gemma":[0.3531807,0.004272224,0.6134094,0.0010660442,0.0016628657,0.0005103271,0.0014981506,0.00048439755,0.023915833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99299616,0.003456573,0.00027116688,0.0012532622,0.0015043521,0.00051854947],"domain_scores_gemma":[0.9603855,0.03216849,0.0020256431,0.0026580908,0.0018311192,0.0009312756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008422709,0.001612533,0.004072636,0.0040261536,0.0025156504,0.0076861857,0.0048680967,0.003772061,0.013713068],"category_scores_gemma":[0.046796534,0.0020873712,0.002241542,0.007974151,0.006058739,0.01925614,0.0042224852,0.007358375,0.0017516346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008295187,0.000116723015,0.00068921346,0.00019749838,0.000045701196,0.00006844786,0.00017647675,0.039106745,0.00031252074,0.91956425,0.0058183204,0.033821147],"study_design_scores_gemma":[0.00001682227,0.000016420896,0.00016992191,0.000020971262,0.0000129320015,0.000057448575,0.000034591467,0.1067274,0.00016926251,0.89158446,0.0011652524,0.000024491084],"about_ca_topic_score_codex":0.0050253207,"about_ca_topic_score_gemma":0.0055590617,"teacher_disagreement_score":0.013713068,"about_ca_system_score_codex":0.003506908,"about_ca_system_score_gemma":0.0034250438,"threshold_uncertainty_score":0.045874774},"labels":[],"label_agreement":null},{"id":"W4384562776","doi":"10.1016/j.cor.2023.106344","title":"MPILS: An Automatic Tuner for MILP Solvers","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Reliability and Maintenance Optimization","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; Group for Research in Decision Analysis","funders":"Fonds de recherche du Québec – Nature et technologies; Institut de Valorisation des Données","keywords":"Tuner; Solver; Computer science; Iterated local search; Set (abstract data type); Mathematical optimization; Heuristic; Local search (optimization); Parameter space; Cluster analysis; Iterated function; Metaheuristic; Algorithm; Artificial intelligence; Mathematics","score_opus":0.09402563793458564,"score_gpt":0.3790488157703011,"score_spread":0.28502317783571546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384562776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008792873,0.0003098354,0.60025465,0.00023919654,0.00029730189,0.00016081793,0.0024884462,0.37602398,0.011432866],"genre_scores_gemma":[0.17823869,0.0003339039,0.711105,0.0008734515,0.00023033294,0.0010120819,0.008830937,0.080272056,0.019103598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894553,0.00027265836,0.00007974311,0.00020107442,0.0003914324,0.00010959211],"domain_scores_gemma":[0.9983132,0.0009311736,0.0000963223,0.00029386798,0.00026700879,0.00009849965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013044067,0.0028532492,0.0011682254,0.0018079738,0.0008181027,0.0016847926,0.0031273777,0.0014186051,0.048579473],"category_scores_gemma":[0.0066475957,0.0015442638,0.0011252172,0.0011836033,0.00060611183,0.0018309368,0.002432132,0.002825027,0.015988247],"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.0021190986,0.0005403663,0.0022388315,0.0012289003,0.00048251328,0.0006631696,0.00031817218,0.1573779,0.028956512,0.0132587375,0.26887468,0.52394116],"study_design_scores_gemma":[0.00061013363,0.00010806238,0.00058539124,0.00007083492,0.000048836788,0.00012120962,0.000055000077,0.92383516,0.020447211,0.010825227,0.043205455,0.00008752768],"about_ca_topic_score_codex":0.002927553,"about_ca_topic_score_gemma":0.004839745,"teacher_disagreement_score":0.048579473,"about_ca_system_score_codex":0.00064732024,"about_ca_system_score_gemma":0.0012392139,"threshold_uncertainty_score":0.16251457},"labels":[],"label_agreement":null},{"id":"W4385407769","doi":"10.1016/j.cor.2023.106362","title":"Making opportunity sales in attended home delivery","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Computer science; Profit (economics); Vehicle routing problem; Operations research; Routing (electronic design automation); Order (exchange); Selection (genetic algorithm); Integer programming; Business; Economics; Microeconomics","score_opus":0.22373258892236814,"score_gpt":0.4004004801899891,"score_spread":0.17666789126762095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385407769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5370773,0.00028518992,0.0043854034,0.0043270593,0.0003168236,0.00019586913,0.00019075892,0.00030335618,0.4529182],"genre_scores_gemma":[0.9528112,0.00010494514,0.0020825253,0.00016921133,0.000052063748,0.000026815795,0.00006502541,0.000056818542,0.04463149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899703,0.00032407188,0.000018893656,0.00011055293,0.00018206511,0.00036729194],"domain_scores_gemma":[0.9977316,0.0008805474,0.0001519184,0.00019879342,0.00024476578,0.0007924318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010513393,0.00022536198,0.00021415834,0.0005478408,0.0028755658,0.0054048593,0.00092966564,0.0012001604,0.059601683],"category_scores_gemma":[0.0053584883,0.00035578152,0.00031267962,0.0005276839,0.0010914656,0.0037543362,0.0021330887,0.0013916687,0.0054808985],"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.001601007,0.004526234,0.068093665,0.00028332687,0.00007298732,0.002527884,0.027878128,0.0032296535,0.005248526,0.20478305,0.086488694,0.5952668],"study_design_scores_gemma":[0.00039249563,0.0017836321,0.15625107,0.0005640269,0.00024117412,0.0006691045,0.19424476,0.012546963,0.009500265,0.14426495,0.4793694,0.00017215272],"about_ca_topic_score_codex":0.006933925,"about_ca_topic_score_gemma":0.015929958,"teacher_disagreement_score":0.059601683,"about_ca_system_score_codex":0.0020316811,"about_ca_system_score_gemma":0.0023095917,"threshold_uncertainty_score":0.19938749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044729378,0.0003142135,0.94745624,0.00023669137,0.000044586293,0.000047810667,0.000045883404,0.00019833421,0.00692687],"genre_scores_gemma":[0.7561206,0.00024429898,0.23351802,0.00014334203,0.0000693916,0.00027616924,0.0001369246,0.00017035734,0.009320873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938464,0.00034251466,0.000016692506,0.000054778724,0.00013758912,0.000063789914],"domain_scores_gemma":[0.9981623,0.0013468328,0.00014859585,0.00007883352,0.00019219832,0.00007125492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017147844,0.00055627467,0.0011597483,0.00063027284,0.0003341129,0.0006891247,0.0014131509,0.0013768951,0.0030395915],"category_scores_gemma":[0.004236724,0.00044755152,0.0006878295,0.00060493045,0.00073822273,0.00095422013,0.0011158978,0.0010309033,0.0003182534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006534787,0.000057748868,0.00020064335,0.000042587075,0.000029132736,0.000039271155,0.000029958546,0.9760224,0.00062895904,0.010568439,0.00065975846,0.011655768],"study_design_scores_gemma":[0.000011932286,0.00001569135,0.000027031852,0.0000020339733,0.000003100265,0.000004328975,0.0000028395607,0.9979736,0.00006023847,0.0018009363,0.00009644678,0.0000018427943],"about_ca_topic_score_codex":0.00481527,"about_ca_topic_score_gemma":0.0039774273,"teacher_disagreement_score":0.00481527,"about_ca_system_score_codex":0.00095789385,"about_ca_system_score_gemma":0.0011356523,"threshold_uncertainty_score":0.010168493},"labels":[],"label_agreement":null},{"id":"W4385895443","doi":"10.1016/j.cor.2023.106371","title":"Multistage stochastic fractionated intensity modulated radiation therapy planning","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","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":"Sunnybrook Health Science Centre; Health Sciences Centre; Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Radiation treatment planning; Radiation therapy; Dynamic programming; Stochastic programming; Mathematical optimization; Algorithm; Mathematics; Medicine; Radiology","score_opus":0.07672247703908411,"score_gpt":0.41982957638047075,"score_spread":0.3431070993413866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385895443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04325832,0.00036344395,0.9483636,0.00014620785,0.000036640507,0.00021837157,0.00039203855,0.0007408648,0.006480483],"genre_scores_gemma":[0.71526426,0.00032140064,0.2734143,0.00013774092,0.000029847313,0.00038012268,0.0005967821,0.00026366487,0.009591833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969494,0.000056931454,0.000019824116,0.000051483537,0.00014499905,0.000031897813],"domain_scores_gemma":[0.9997961,0.000070558075,0.00004699975,0.000035579564,0.0000353145,0.000015585525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000379838,0.00043266136,0.00045765436,0.00035941752,0.00027239943,0.0006150043,0.00074999226,0.00031406616,0.003589323],"category_scores_gemma":[0.0006981622,0.0005009087,0.0008729272,0.0005332934,0.00024791955,0.00027972652,0.00065305864,0.00035950541,0.00047613835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037745282,0.00011366104,0.0020793052,0.00014942499,0.00009614491,0.00007661562,0.000072248244,0.87791854,0.021575896,0.0049209553,0.0018857464,0.090734065],"study_design_scores_gemma":[0.000041635918,0.00019427913,0.001792713,0.000014625243,0.000046446272,0.00020309024,0.0000075094918,0.9821507,0.00950733,0.0028990894,0.0031242205,0.000018385097],"about_ca_topic_score_codex":0.002316489,"about_ca_topic_score_gemma":0.0047446233,"teacher_disagreement_score":0.003589323,"about_ca_system_score_codex":0.00071883015,"about_ca_system_score_gemma":0.0012631099,"threshold_uncertainty_score":0.0120075345},"labels":[],"label_agreement":null},{"id":"W4386024722","doi":"10.1016/j.cor.2023.106387","title":"Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: An application to an automated kitchen","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"HEC Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Mitacs; Canada Foundation for Innovation; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Compute Canada","keywords":"Computer science; Metaheuristic; Job shop scheduling; Heuristics; Scheduling (production processes); Mathematical optimization; Minification; Idle; Sequence (biology); Upper and lower bounds; Computation; Algorithm; Mathematics","score_opus":0.06852410505165776,"score_gpt":0.38000464989123867,"score_spread":0.3114805448395809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386024722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7640434,0.0003137082,0.22991954,0.00027727525,0.00017571778,0.0003381188,0.00014599142,0.0007812283,0.0040051336],"genre_scores_gemma":[0.94492805,0.00008470133,0.05199646,0.000028870993,0.000036469213,0.00012451583,0.00007375533,0.00006406103,0.0026631076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.00021099261,0.000035978836,0.00016120121,0.000107973734,0.00017538824],"domain_scores_gemma":[0.9974745,0.001705672,0.00016003872,0.0001668538,0.00022953717,0.00026345192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014600349,0.001042668,0.0025630873,0.00066966313,0.0017333069,0.0012754513,0.0022220777,0.0021431462,0.0024929624],"category_scores_gemma":[0.0024525065,0.0014313994,0.001232006,0.001747642,0.0011300289,0.00088760786,0.00106543,0.0011903589,0.00030361707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079348154,0.00030732044,0.0005935567,0.00010314179,0.00006160046,0.0002878088,0.000086150256,0.9772528,0.008297641,0.0014698013,0.00042678777,0.010319896],"study_design_scores_gemma":[0.0000676421,0.00014286127,0.00037326885,0.0000016426648,0.000011666832,0.000018262119,0.000022225815,0.99727076,0.0012880206,0.00068359467,0.00010596712,0.000014109827],"about_ca_topic_score_codex":0.021436457,"about_ca_topic_score_gemma":0.01717873,"teacher_disagreement_score":0.021436457,"about_ca_system_score_codex":0.0020032914,"about_ca_system_score_gemma":0.0030869658,"threshold_uncertainty_score":0.04262334},"labels":[],"label_agreement":null},{"id":"W4386034450","doi":"10.1016/j.cor.2023.106388","title":"Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Satellite Communication Systems","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":"Simon Fraser University","funders":"Fundamental Research Funds for the Central Universities; Science and Technology Program of Hunan Province; Natural Science Foundation of Hunan Province; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Algorithm; Benchmark (surveying); Sorting; Memetic algorithm; Scheduling (production processes); Mathematical optimization; Local search (optimization); Mathematics","score_opus":0.0980973351242884,"score_gpt":0.3726784187238417,"score_spread":0.2745810835995533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386034450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025046252,0.00023202908,0.9694253,0.0001959862,0.00009492885,0.000074072945,0.000059179853,0.00027621276,0.004595975],"genre_scores_gemma":[0.56058383,0.00030971118,0.43316454,0.00019231615,0.00012034263,0.00034511177,0.0002132588,0.0001223062,0.004948519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995528,0.00013405526,0.00002119469,0.00009293728,0.00011982146,0.00007911426],"domain_scores_gemma":[0.9993932,0.00032312406,0.00006776208,0.000031507097,0.00013672972,0.00004762609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084065786,0.0008757084,0.0011853798,0.00068899535,0.00047255523,0.0010267792,0.0011955171,0.0011190585,0.0028116368],"category_scores_gemma":[0.0016550504,0.00058985135,0.0006150239,0.0010864725,0.00040942477,0.00077473326,0.00093887467,0.0011031806,0.00034402357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007057947,0.00007235133,0.00026263148,0.000044418077,0.000028827304,0.000025037669,0.000018196608,0.9723087,0.0010977524,0.0023631302,0.00084209663,0.022866283],"study_design_scores_gemma":[0.000008594193,0.00001086839,0.0000316978,0.0000012046598,0.0000030481483,0.0000026270293,0.0000024765725,0.99951494,0.00007785743,0.0002626884,0.0000826146,0.0000013680636],"about_ca_topic_score_codex":0.008855739,"about_ca_topic_score_gemma":0.005348756,"teacher_disagreement_score":0.008855739,"about_ca_system_score_codex":0.00060604827,"about_ca_system_score_gemma":0.0016282194,"threshold_uncertainty_score":0.017608345},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4758375,0.00051170663,0.51330227,0.00062269677,0.00007367615,0.00022381268,0.00047628256,0.0001908721,0.008761212],"genre_scores_gemma":[0.94662344,0.00018988637,0.047498517,0.00005253078,0.00003422252,0.000113747636,0.00024802465,0.00005599557,0.005183759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991026,0.00028041718,0.000043380303,0.00016466161,0.00016851262,0.00024048316],"domain_scores_gemma":[0.99804914,0.0012924856,0.0001995014,0.00006807213,0.00015205459,0.00023877283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020379694,0.0011077669,0.002056383,0.00077346415,0.00060773845,0.0028817013,0.00213271,0.0019650466,0.0043120235],"category_scores_gemma":[0.003632725,0.0013848935,0.0012538794,0.0015754806,0.0011717906,0.0022104618,0.0014848956,0.0013657822,0.00027845858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002702626,0.00012066863,0.00068921037,0.00006037895,0.00004278064,0.00012309742,0.000049477978,0.98424536,0.0009885399,0.0075653926,0.00026664537,0.0055780434],"study_design_scores_gemma":[0.000026261834,0.00007611183,0.00037761833,0.0000044914227,0.000018064698,0.000021844306,0.000030491174,0.9944992,0.00032629145,0.004486786,0.00012461863,0.000008181349],"about_ca_topic_score_codex":0.007727077,"about_ca_topic_score_gemma":0.00615749,"teacher_disagreement_score":0.007727077,"about_ca_system_score_codex":0.002162079,"about_ca_system_score_gemma":0.001963395,"threshold_uncertainty_score":0.015687108},"labels":[],"label_agreement":null},{"id":"W4388282681","doi":"10.1016/j.cor.2023.106459","title":"An asynchronous parallel benders decomposition method for stochastic network design problems","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Asynchronous communication; Computer science; Benchmark (surveying); Benders' decomposition; Mathematical optimization; Synchronization (alternating current); Decomposition; Parallel computing; Disjoint sets; Integer (computer science); Parallel algorithm; Acceleration; Algorithm; Mathematics","score_opus":0.30545842645085114,"score_gpt":0.5291444966876263,"score_spread":0.22368607023677517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388282681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020389864,0.00004509133,0.99600273,0.000058642607,0.000045548164,0.000026779651,0.000031445456,0.000095036594,0.0016556248],"genre_scores_gemma":[0.1241374,0.00024941418,0.8670468,0.00016195519,0.00014304959,0.0003312101,0.00021026548,0.00027476146,0.007445177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952304,0.00021379902,0.000020365535,0.00006844508,0.0001310563,0.00004329298],"domain_scores_gemma":[0.9992055,0.0004224034,0.00005550415,0.000085638225,0.00016880858,0.00006215275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014449891,0.0012110751,0.0010215002,0.0006610397,0.0005211731,0.0008904155,0.0010871823,0.0009672458,0.007533103],"category_scores_gemma":[0.0024208296,0.0007085226,0.0010516434,0.0006852859,0.00049372687,0.0009408582,0.0011091988,0.0019005528,0.0014097724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001288579,0.00008909303,0.00021354214,0.00008929046,0.000053862717,0.000052760202,0.00004181026,0.87345505,0.0032762573,0.038553305,0.0027782267,0.08126798],"study_design_scores_gemma":[0.000012924465,0.000013832077,0.000019202234,0.0000042003558,0.000005407269,0.0000057957222,0.000003050446,0.99174047,0.00022072054,0.0072127804,0.00075910287,0.0000024824324],"about_ca_topic_score_codex":0.0029207044,"about_ca_topic_score_gemma":0.0045579,"teacher_disagreement_score":0.007533103,"about_ca_system_score_codex":0.00059153157,"about_ca_system_score_gemma":0.0012822896,"threshold_uncertainty_score":0.025200725},"labels":[],"label_agreement":null},{"id":"W4388838998","doi":"10.1016/j.cor.2023.106483","title":"Evolutionary multi-objective design of autoencoders for compact representation of histopathology whole slide images","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"AI in cancer detection","field":"Computer Science","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":"Wilfrid Laurier University; Brock University; Ontario Tech University","funders":"Government of Ontario; Ontario Research Foundation","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Dimensionality reduction; Evolutionary algorithm; Deep learning; Minification; Representation (politics); Contextual image classification; Digital pathology; Feature vector; Reduction (mathematics); Code (set theory); Set (abstract data type); Image (mathematics); Mathematics","score_opus":0.1664929482050457,"score_gpt":0.42645899678712795,"score_spread":0.2599660485820823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388838998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024304109,0.00013609536,0.9743678,0.00008376599,0.000018982739,0.000026091386,0.00002178425,0.0001610925,0.00088028336],"genre_scores_gemma":[0.6508526,0.00021774741,0.34406993,0.00015363489,0.000037082616,0.00021288269,0.00015452977,0.00010487865,0.004196709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982846,0.000041380572,0.000010672302,0.000043791875,0.000047222416,0.000028410983],"domain_scores_gemma":[0.99943,0.00029187973,0.00005470645,0.000032132702,0.000171357,0.000019930843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079034484,0.0005738187,0.00059133454,0.00034750463,0.00022244733,0.0005301198,0.00073615176,0.0010722501,0.0013656938],"category_scores_gemma":[0.0017828412,0.00047941608,0.000494744,0.00028236848,0.00035899578,0.00051014754,0.0005692244,0.0007755099,0.00029711795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005893656,0.00004655552,0.00028908372,0.000044785244,0.000032851378,0.00004563268,0.0000489066,0.8896831,0.010405625,0.0019805909,0.000499828,0.09686404],"study_design_scores_gemma":[0.0000020808284,0.00001229977,0.00005885686,0.0000023231014,0.0000030136766,0.000008260273,0.0000028201223,0.9988555,0.00076976157,0.00020693446,0.00007673022,0.0000013286981],"about_ca_topic_score_codex":0.0032509598,"about_ca_topic_score_gemma":0.0043287287,"teacher_disagreement_score":0.0032509598,"about_ca_system_score_codex":0.0005011372,"about_ca_system_score_gemma":0.00068271725,"threshold_uncertainty_score":0.006464064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011820072,0.00026490842,0.9800167,0.00020948632,0.00006733422,0.0001249139,0.00006441636,0.00011018527,0.0073220166],"genre_scores_gemma":[0.3197178,0.000429794,0.67406046,0.00016294776,0.000110661436,0.0005115801,0.00018172436,0.000097616285,0.0047273734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992865,0.00031885132,0.000023368933,0.0000971537,0.00016697113,0.00010724396],"domain_scores_gemma":[0.9993179,0.00045791798,0.00006175965,0.000043515545,0.00007607412,0.000042812677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013651308,0.0011040568,0.0012253748,0.0015646174,0.0007119702,0.0014658167,0.0020239903,0.0021954014,0.0051715616],"category_scores_gemma":[0.0021536928,0.0009008599,0.0016076441,0.001917825,0.00092638884,0.001206973,0.0012267343,0.001451247,0.000404553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029019173,0.000051630435,0.000090738075,0.00004417963,0.000026233593,0.000058734495,0.000020094934,0.9703966,0.00051827525,0.015295246,0.00047560086,0.012993726],"study_design_scores_gemma":[0.000016453985,0.000028255434,0.00003225432,0.0000087742455,0.000010198571,0.000015345844,0.000010042047,0.9936283,0.000120820725,0.005542988,0.0005803589,0.000006115645],"about_ca_topic_score_codex":0.005949715,"about_ca_topic_score_gemma":0.005992463,"teacher_disagreement_score":0.005949715,"about_ca_system_score_codex":0.0014980321,"about_ca_system_score_gemma":0.0023363794,"threshold_uncertainty_score":0.017300606},"labels":[],"label_agreement":null},{"id":"W4389328512","doi":"10.1016/j.cor.2023.106508","title":"A simulation optimization framework to solve Stochastic Flexible Job-Shop Scheduling Problems—Case: Semiconductor manufacturing","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"University of Waterloo","funders":"","keywords":"Photolithography; Bottleneck; Computer science; Semiconductor device fabrication; Job shop scheduling; Workstation; Scheduling (production processes); Wafer fabrication; Schedule; Context (archaeology); Industrial engineering; Manufacturing engineering; Mathematical optimization; Engineering; Embedded system","score_opus":0.08283912030368493,"score_gpt":0.36332348444336626,"score_spread":0.28048436413968136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389328512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012946907,0.00034461793,0.9801508,0.00022667261,0.000046731635,0.00008260759,0.000088965346,0.00013951809,0.0059732925],"genre_scores_gemma":[0.7343491,0.0009748065,0.25869867,0.0001168296,0.00008248668,0.0005963884,0.00026491896,0.00008118523,0.004835722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942964,0.00029324062,0.00002115787,0.000063149106,0.00011102415,0.00008170247],"domain_scores_gemma":[0.9994103,0.00037488242,0.00006865983,0.000023018085,0.00008637114,0.000036844725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009683971,0.001027332,0.00097440253,0.0006758486,0.0004987669,0.00082782237,0.001113992,0.0012029336,0.002249785],"category_scores_gemma":[0.0013937518,0.00045725447,0.0013716782,0.00065913453,0.00067280664,0.00043664832,0.00087488233,0.0010000127,0.00021607608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006445284,0.000009149847,0.00007018647,0.000017828817,0.000007410768,0.000018857025,0.0000071492286,0.99212897,0.00017825869,0.006133733,0.000080312326,0.0013417826],"study_design_scores_gemma":[0.000003189155,0.00000789956,0.0000181995,0.00000231637,0.000002124571,0.0000033027638,0.000003225265,0.99846727,0.000049094342,0.0011833909,0.0002585784,0.0000013822672],"about_ca_topic_score_codex":0.01209398,"about_ca_topic_score_gemma":0.0058468003,"teacher_disagreement_score":0.01209398,"about_ca_system_score_codex":0.0009981637,"about_ca_system_score_gemma":0.002015936,"threshold_uncertainty_score":0.024047196},"labels":[],"label_agreement":null},{"id":"W4390562500","doi":"10.1016/j.cor.2024.106529","title":"Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","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":"Simon Fraser University","funders":"","keywords":"Public transport; Transit (satellite); Computer science; Hypergraph; Set (abstract data type); Matching (statistics); Transport engineering; Rounding; Operations research; Algorithm; Engineering; Mathematics","score_opus":0.06851897095731482,"score_gpt":0.3377080033727808,"score_spread":0.269189032415466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390562500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56349444,0.0010354511,0.4169524,0.0026052298,0.00021072627,0.00015838654,0.00038393697,0.00027405407,0.014885348],"genre_scores_gemma":[0.8610799,0.00047173584,0.13152738,0.00011182673,0.00014274105,0.00011378095,0.00032232754,0.000057893903,0.0061724647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956316,0.00017735283,0.000021323938,0.00009487854,0.00006495967,0.00007835356],"domain_scores_gemma":[0.9963648,0.0029880193,0.00013204243,0.00012380637,0.00029494095,0.00009648204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010485087,0.00063888234,0.0009254483,0.0008334821,0.0015254572,0.0015052231,0.0013029873,0.0016908168,0.0030620801],"category_scores_gemma":[0.004519018,0.00037005785,0.0010782363,0.0011574334,0.0009694554,0.0014428997,0.0008709224,0.0009847578,0.00015946016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000717691,0.0001220986,0.001545663,0.000058707657,0.00002578189,0.00007442174,0.00005784507,0.9686951,0.00052552356,0.015154174,0.0010095198,0.012659366],"study_design_scores_gemma":[0.0000041000403,0.000007763913,0.00012059823,0.0000011019041,0.0000034194777,0.0000054886477,0.00001646333,0.99795616,0.0000657121,0.0017156705,0.0001017016,0.0000017874805],"about_ca_topic_score_codex":0.046967257,"about_ca_topic_score_gemma":0.025650548,"teacher_disagreement_score":0.046967257,"about_ca_system_score_codex":0.0014861907,"about_ca_system_score_gemma":0.0021282204,"threshold_uncertainty_score":0.09338778},"labels":[],"label_agreement":null},{"id":"W4391719686","doi":"10.1016/j.cor.2024.106579","title":"An improved column-generation-based matheuristic for learning classification trees","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Machine Learning and Data Classification","field":"Computer Science","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":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Column generation; Scalability; Computer science; Heuristic; Decision tree; Machine learning; Column (typography); Artificial intelligence; Integer programming; Mathematical optimization; Relaxation (psychology); Multiclass classification; Mathematics; Algorithm; Support vector machine; Database","score_opus":0.12618182425428445,"score_gpt":0.42385054819990986,"score_spread":0.2976687239456254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391719686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018523479,0.00042365564,0.967458,0.00026917562,0.00028088345,0.00022571492,0.000841147,0.009109829,0.0028680442],"genre_scores_gemma":[0.13483037,0.00016501933,0.8553763,0.0005210901,0.00015840042,0.00035140122,0.0024888369,0.00048291756,0.0056256456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992231,0.00017339806,0.000059676397,0.00016251688,0.00029319403,0.00008816917],"domain_scores_gemma":[0.99858165,0.000564074,0.000056757523,0.00022769402,0.0004831047,0.00008672583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072964205,0.00085710647,0.0011082366,0.0015496623,0.0007361423,0.0010571183,0.0024630984,0.0009936312,0.0105733415],"category_scores_gemma":[0.0031951396,0.00043372347,0.00096320413,0.0014349575,0.0003988911,0.00115367,0.0014383415,0.0014521228,0.0034227122],"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.0004285022,0.0003161738,0.0010381137,0.00020166539,0.00010144648,0.0001387752,0.00007751587,0.06209061,0.013367988,0.008114333,0.023525836,0.8905991],"study_design_scores_gemma":[0.00007335097,0.0001094234,0.0003829457,0.000015346177,0.000030978026,0.0000980361,0.000021057032,0.98449486,0.0045613484,0.0065227323,0.0036689183,0.00002104603],"about_ca_topic_score_codex":0.007596604,"about_ca_topic_score_gemma":0.013654915,"teacher_disagreement_score":0.0105733415,"about_ca_system_score_codex":0.0007237259,"about_ca_system_score_gemma":0.0019333527,"threshold_uncertainty_score":0.035371304},"labels":[],"label_agreement":null},{"id":"W4392103996","doi":"10.1016/j.cor.2024.106588","title":"A ride time-oriented scheduling algorithm for dial-a-ride problems","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation and Mobility Innovations","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":"Polytechnique Montréal","funders":"Alliance de recherche numérique du Canada","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Benchmark (surveying); Algorithm; Linear programming; Job shop scheduling; Schedule; Mathematics","score_opus":0.04061754838773477,"score_gpt":0.33895546316266717,"score_spread":0.2983379147749324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392103996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03448796,0.0003109545,0.9541438,0.0003077579,0.00022901772,0.00038057216,0.00025196947,0.0015003552,0.008387713],"genre_scores_gemma":[0.1968298,0.00023325474,0.7963312,0.000194386,0.00008470572,0.00032613814,0.00060032395,0.00033369116,0.0050665434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995425,0.0001162869,0.000028649603,0.00011247387,0.000103603044,0.000096619966],"domain_scores_gemma":[0.99934715,0.0002564687,0.000045279943,0.000082443024,0.00017054968,0.000098111756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551687,0.0009797493,0.0015935329,0.0010918009,0.0011972819,0.0012995017,0.0023303197,0.0011863704,0.005844129],"category_scores_gemma":[0.002121408,0.0007382073,0.0008573941,0.0014103652,0.0005491606,0.0013576355,0.0013569477,0.0013097428,0.00086478615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005695193,0.0006128149,0.00061112444,0.00022192388,0.00007048379,0.00007266677,0.00012867189,0.699377,0.005695853,0.021985358,0.011123519,0.2595311],"study_design_scores_gemma":[0.0001225286,0.00008618612,0.00011727641,0.000007551918,0.000015320713,0.00001760931,0.000018449542,0.9918469,0.0006393025,0.0054011387,0.0017170284,0.000010600615],"about_ca_topic_score_codex":0.008491247,"about_ca_topic_score_gemma":0.007909533,"teacher_disagreement_score":0.008491247,"about_ca_system_score_codex":0.0012535457,"about_ca_system_score_gemma":0.002662638,"threshold_uncertainty_score":0.019550502},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5285387,0.00082140416,0.4483061,0.0017913573,0.00007826364,0.00019748528,0.0007228715,0.00019289297,0.019350937],"genre_scores_gemma":[0.9598981,0.00054372224,0.033664085,0.00012267848,0.000063593056,0.00013436614,0.00031159475,0.00009457915,0.0051672603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926144,0.00023335312,0.000031401793,0.00012831441,0.0001443575,0.00020108162],"domain_scores_gemma":[0.99636096,0.002691416,0.0004956706,0.00009738343,0.00016217785,0.00019242756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001746935,0.00072674855,0.000911633,0.0006173683,0.00063097547,0.0012810566,0.0019978685,0.0012295212,0.004680765],"category_scores_gemma":[0.0059654275,0.000775996,0.0011235243,0.0011620086,0.00096916594,0.002183399,0.00079529476,0.0015041785,0.00031843278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108218155,0.000074843236,0.0014829345,0.000076452256,0.000031432875,0.0002837243,0.00008423298,0.9453948,0.00082301383,0.044713672,0.0010067518,0.005919803],"study_design_scores_gemma":[0.000011855073,0.000033219276,0.00069312187,0.000008218617,0.000015384474,0.00006543045,0.000048115544,0.98451126,0.0003501225,0.013714531,0.00053882715,0.000009949896],"about_ca_topic_score_codex":0.011048679,"about_ca_topic_score_gemma":0.008700763,"teacher_disagreement_score":0.011048679,"about_ca_system_score_codex":0.0023397328,"about_ca_system_score_gemma":0.0020242212,"threshold_uncertainty_score":0.021968722},"labels":[],"label_agreement":null},{"id":"W4394806664","doi":"10.1016/j.cor.2024.106649","title":"A logistics provider’s profit maximization facility location problem with random utility maximizing followers","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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é de Montréal","funders":"","keywords":"Profit (economics); Mathematical optimization; Profitability index; Computer science; Profit maximization; Revenue; Operations research; Linear programming; Microeconomics; Mathematics; Economics; Finance","score_opus":0.0894180973815955,"score_gpt":0.3212778583963882,"score_spread":0.23185976101479272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394806664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32246137,0.0010451808,0.6201523,0.008491971,0.00025780735,0.0008871333,0.0033878866,0.0005594474,0.042756878],"genre_scores_gemma":[0.90345895,0.0005327002,0.05919087,0.000289535,0.00021742594,0.00038278557,0.0006744817,0.00014045519,0.035112776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973469,0.0012953959,0.00008220287,0.0006361115,0.00021186443,0.0004275952],"domain_scores_gemma":[0.99184716,0.005796562,0.000939542,0.00029347822,0.0004154901,0.0007078288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037584316,0.0014888239,0.0038123564,0.0017598758,0.0014123034,0.003846984,0.004988043,0.0068038767,0.013819448],"category_scores_gemma":[0.012381072,0.0026112066,0.0017852469,0.0036322796,0.0024864918,0.0046878527,0.002219318,0.002659468,0.0014434432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005586247,0.00029403923,0.001796479,0.00022411966,0.00014607924,0.00085521064,0.00018302586,0.91212565,0.0009582952,0.065542094,0.006593416,0.010723032],"study_design_scores_gemma":[0.00013010913,0.00010930613,0.00037130693,0.000021892625,0.000041287814,0.000112441354,0.00010345611,0.98311436,0.00021075195,0.014909549,0.0008435507,0.00003190816],"about_ca_topic_score_codex":0.011172578,"about_ca_topic_score_gemma":0.00679514,"teacher_disagreement_score":0.013819448,"about_ca_system_score_codex":0.0032879985,"about_ca_system_score_gemma":0.0021235025,"threshold_uncertainty_score":0.046230674},"labels":[],"label_agreement":null},{"id":"W4396243303","doi":"10.1016/j.cor.2024.106673","title":"Accelerated Benders decomposition and local branching for dynamic maximum covering location problems","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Hydro-Québec; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Institut de Valorisation des Données; Hydro-Québec","keywords":"Benders' decomposition; Branching (polymer chemistry); Decomposition; Mathematics; Mathematical optimization; Computer science; Materials science; Chemistry","score_opus":0.07731678784091674,"score_gpt":0.3635301074488101,"score_spread":0.28621331960789337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396243303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017701987,0.00054508663,0.97563475,0.00023115447,0.000058728387,0.00007972403,0.00010285982,0.00045730887,0.005188427],"genre_scores_gemma":[0.30791983,0.00076201453,0.6844607,0.00016295291,0.00013119484,0.00032145466,0.0005641998,0.00032943714,0.0053481953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912125,0.00035940428,0.000029930326,0.0001278161,0.00022496136,0.00013668013],"domain_scores_gemma":[0.9988403,0.0006634298,0.00014804363,0.000119259916,0.0001140685,0.00011495614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013072486,0.0012518299,0.0012094796,0.00093753525,0.0005299498,0.0011420056,0.0011522137,0.0010751663,0.0055222157],"category_scores_gemma":[0.0034395666,0.0005324467,0.0013289308,0.0014405361,0.00059099455,0.001585571,0.0014025952,0.002568055,0.00085731316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013966126,0.00009444819,0.0004952177,0.00017274999,0.000041452015,0.000074734904,0.00009842604,0.8694357,0.0028400063,0.032966647,0.002897899,0.09074299],"study_design_scores_gemma":[0.000025764995,0.000054363045,0.00012708151,0.00001939935,0.0000105187855,0.00003984571,0.000020344016,0.9792931,0.00063890143,0.017560575,0.0022030615,0.0000070040483],"about_ca_topic_score_codex":0.0022932421,"about_ca_topic_score_gemma":0.0029076666,"teacher_disagreement_score":0.0055222157,"about_ca_system_score_codex":0.0010834148,"about_ca_system_score_gemma":0.0011569269,"threshold_uncertainty_score":0.018473685},"labels":[],"label_agreement":null},{"id":"W4396743035","doi":"10.1016/j.cor.2024.106687","title":"Simultaneous scheduling of jobs and transporters in a hybrid flow shop with collision-free transporter routing: A novel parallel heuristic","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Scheduling (production processes); Computer science; Collision; Routing (electronic design automation); Vehicle routing problem; Heuristic; Mathematical optimization; Transporter; Parallel computing; Computer network; Chemistry; Mathematics; Gene; Artificial intelligence; Biochemistry","score_opus":0.024675487494487683,"score_gpt":0.28219094958867036,"score_spread":0.2575154620941827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396743035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27139238,0.00033200564,0.71838707,0.00035350496,0.00016678483,0.00024675895,0.00010038131,0.0005000359,0.008521071],"genre_scores_gemma":[0.793991,0.00013092569,0.20222348,0.00008580046,0.000050304017,0.0001777025,0.000089932946,0.00006794299,0.0031829558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996164,0.0000913758,0.000017511506,0.000090470545,0.00007911771,0.000105066734],"domain_scores_gemma":[0.999519,0.00023602911,0.00006065372,0.00004327927,0.00005804682,0.00008306065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068593345,0.0006136031,0.001352392,0.00074352394,0.0012954695,0.00132066,0.0017466946,0.0011389826,0.002161577],"category_scores_gemma":[0.00089822256,0.0008364836,0.0009294722,0.0012644503,0.000731731,0.0011464237,0.0010336398,0.00053927733,0.00022897756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046942168,0.0001779998,0.00059241784,0.000116738905,0.00007545659,0.00024900452,0.00007433366,0.95000446,0.0076603573,0.009035236,0.00091659004,0.030627921],"study_design_scores_gemma":[0.00004383186,0.000073872056,0.00008779228,0.000002003471,0.00001813786,0.000025292447,0.000013151979,0.9973695,0.00063832273,0.0014869593,0.0002342351,0.0000068900304],"about_ca_topic_score_codex":0.005707276,"about_ca_topic_score_gemma":0.0077563142,"teacher_disagreement_score":0.005707276,"about_ca_system_score_codex":0.0008798208,"about_ca_system_score_gemma":0.0023105983,"threshold_uncertainty_score":0.011348069},"labels":[],"label_agreement":null},{"id":"W4396954778","doi":"10.1016/j.cor.2024.106704","title":"Experimental analysis of algorithms for the independent quadratic assignment problem","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Computer science; Quadratic equation; Mathematics; Mathematical optimization","score_opus":0.07535290652513509,"score_gpt":0.3834323452065221,"score_spread":0.308079438681387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396954778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7879432,0.0015968893,0.18436612,0.0010216594,0.00041223003,0.0005058475,0.0014495449,0.0015065257,0.021197973],"genre_scores_gemma":[0.90351427,0.00029548196,0.089162104,0.00011868995,0.00008628959,0.00036094667,0.0025701867,0.0003465856,0.0035454624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948201,0.0027725527,0.00031914332,0.00066391606,0.0009828592,0.00044137353],"domain_scores_gemma":[0.9239831,0.059359815,0.0027277558,0.0070585604,0.006257359,0.00061336305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064113922,0.0009734422,0.0006204149,0.0010900457,0.0009586845,0.0013585357,0.0015814992,0.0011071075,0.008942243],"category_scores_gemma":[0.04014244,0.00042204192,0.00056448183,0.0013710421,0.0012638705,0.00247827,0.00076049526,0.0014061333,0.001069084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015980944,0.013225218,0.0066059465,0.0014209246,0.00041290277,0.00008564128,0.00029276317,0.57770896,0.04225173,0.05414975,0.013573217,0.27429202],"study_design_scores_gemma":[0.00092171435,0.002378864,0.0036264749,0.000043361393,0.0000784309,0.000089413596,0.00013549473,0.95636976,0.021967765,0.012280673,0.0020651922,0.00004288005],"about_ca_topic_score_codex":0.002769115,"about_ca_topic_score_gemma":0.0023602187,"teacher_disagreement_score":0.008942243,"about_ca_system_score_codex":0.00212982,"about_ca_system_score_gemma":0.0020860028,"threshold_uncertainty_score":0.033907056},"labels":[],"label_agreement":null},{"id":"W4399007214","doi":"10.1016/j.cor.2024.106708","title":"Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Engineering and Physical Sciences Research Council; Loughborough University; University of Nottingham; University of Bath","keywords":"Job shop scheduling; Metaheuristic; Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Variable neighborhood search; Time complexity; Computational complexity theory; Flow shop scheduling; Batch processing; Mathematics; Routing (electronic design automation)","score_opus":0.048829012299315654,"score_gpt":0.34283733235463654,"score_spread":0.2940083200553209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399007214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025992692,0.0013080633,0.9593239,0.00080733246,0.00021525456,0.00029804703,0.00043201793,0.0002651343,0.011357592],"genre_scores_gemma":[0.6540189,0.0025893564,0.3159866,0.00039923814,0.0003593478,0.0014612378,0.00087297184,0.0002868345,0.024025477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998478,0.0006294268,0.00005154567,0.00033512665,0.0002560712,0.00024982844],"domain_scores_gemma":[0.9985247,0.00095207937,0.00023433383,0.000056893936,0.00013456134,0.000097401986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025748792,0.0023385899,0.0032862395,0.0010145743,0.0009218411,0.00225767,0.0035098505,0.0028434964,0.0040315203],"category_scores_gemma":[0.003481786,0.0013775693,0.0016047637,0.0022771095,0.0012802704,0.0025968207,0.0014323436,0.0023444414,0.0005807486],"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.000029537712,0.000048155827,0.00008012591,0.00007527334,0.000032349413,0.000045261473,0.000017785691,0.9839749,0.00016622199,0.010439787,0.0008088739,0.0042817453],"study_design_scores_gemma":[0.00001223899,0.000024434075,0.000053987,0.000007067534,0.000007967421,0.000011018732,0.000008216101,0.9921591,0.000057248853,0.0071711955,0.00048267326,0.0000048907405],"about_ca_topic_score_codex":0.011257016,"about_ca_topic_score_gemma":0.008130632,"teacher_disagreement_score":0.011257016,"about_ca_system_score_codex":0.0022874104,"about_ca_system_score_gemma":0.002735166,"threshold_uncertainty_score":0.022382975},"labels":[],"label_agreement":null},{"id":"W4399258900","doi":"10.1016/j.cor.2024.106711","title":"Approximate linear programming for a queueing control problem","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Alberta","funders":"","keywords":"Queueing theory; Computer science; Mathematical optimization; Linear programming; Control (management); Mathematics; Computer network; Artificial intelligence","score_opus":0.07480078927415756,"score_gpt":0.34961031700999656,"score_spread":0.274809527735839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399258900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02709832,0.0007816632,0.9632396,0.0016531816,0.00014395597,0.000100665515,0.00015979793,0.00017287736,0.0066498234],"genre_scores_gemma":[0.7948644,0.0011012658,0.18213297,0.0005287013,0.0004538168,0.0005334703,0.000519398,0.00023452344,0.019631488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828714,0.0007775211,0.00006165783,0.00026102056,0.00035898422,0.00025357315],"domain_scores_gemma":[0.98983663,0.008900108,0.00027406108,0.00018964148,0.000546435,0.00025307038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032264013,0.0013546183,0.0021912272,0.0010735906,0.00092979363,0.0031322096,0.0022950124,0.0034517797,0.006167235],"category_scores_gemma":[0.018984526,0.0011490061,0.0010430887,0.0013649812,0.0018202325,0.0027654858,0.002147969,0.0028470668,0.00036656004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013449519,0.000089207744,0.00022130039,0.00010252788,0.000027775784,0.000044213455,0.000056610148,0.9460647,0.00038595952,0.042543806,0.0013496096,0.008979803],"study_design_scores_gemma":[0.00001046978,0.00001078897,0.000022788705,0.0000033385652,0.0000037405746,0.000003354315,0.000007094681,0.9896152,0.00004003198,0.010165886,0.00011468343,0.000002667159],"about_ca_topic_score_codex":0.020533772,"about_ca_topic_score_gemma":0.008480154,"teacher_disagreement_score":0.020533772,"about_ca_system_score_codex":0.0035995631,"about_ca_system_score_gemma":0.0032279154,"threshold_uncertainty_score":0.040828526},"labels":[],"label_agreement":null},{"id":"W4399999954","doi":"10.1016/j.cor.2024.106751","title":"Learning tabu search algorithms: A scheduling application","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"Institut de Valorisation des Données; Canada First Research Excellence Fund","keywords":"Tabu search; Metaheuristic; Guided Local Search; Computer science; Mathematical optimization; Algorithm; Search algorithm; Scheduling (production processes); Hill climbing; Parallel metaheuristic; Combinatorial optimization; Machine learning; Artificial intelligence; Mathematics","score_opus":0.2661410071844727,"score_gpt":0.5149645061832497,"score_spread":0.24882349899877704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399999954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053160805,0.0013812543,0.9321579,0.0012182565,0.0002511845,0.00019513175,0.0004729835,0.0045844293,0.006578174],"genre_scores_gemma":[0.27401087,0.0007943234,0.71667486,0.00037997207,0.0002344156,0.0003878697,0.0007102114,0.00055879046,0.0062487284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994454,0.00024429112,0.000023398832,0.00012464586,0.00011483255,0.000047480007],"domain_scores_gemma":[0.9937384,0.005178468,0.00016031858,0.0002411347,0.00057679723,0.00010487062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021077893,0.00094161415,0.0011875022,0.0011388661,0.0008569787,0.0010552288,0.0017067159,0.0021137714,0.00885843],"category_scores_gemma":[0.012348702,0.00067228265,0.0007014441,0.0029504152,0.00056635396,0.0014591564,0.00086787064,0.0017325265,0.0011121877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019685087,0.00034672345,0.0009362275,0.00019852066,0.00007600033,0.000049527036,0.000100487996,0.66123885,0.0007875758,0.0065915254,0.009077413,0.3204003],"study_design_scores_gemma":[0.000045769357,0.000035639092,0.00009617765,0.0000071457594,0.0000082823035,0.0000091397915,0.000014615614,0.99314755,0.00030232992,0.005581204,0.00074792275,0.000004184625],"about_ca_topic_score_codex":0.015104388,"about_ca_topic_score_gemma":0.01237029,"teacher_disagreement_score":0.015104388,"about_ca_system_score_codex":0.0013650372,"about_ca_system_score_gemma":0.0020484037,"threshold_uncertainty_score":0.030032933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015274098,0.000313394,0.9785059,0.0001797617,0.00013225312,0.00013501008,0.000112815585,0.00074614247,0.0046005985],"genre_scores_gemma":[0.19917893,0.00030118885,0.79413986,0.00014826666,0.00010004336,0.0003561162,0.0003011479,0.00018521707,0.005289236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991014,0.00013731238,0.00004342421,0.00021090505,0.00029201846,0.0002149102],"domain_scores_gemma":[0.99891233,0.00063406676,0.00007142118,0.00012439846,0.00017788082,0.000079857884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116493,0.0011962007,0.0020584976,0.0008810632,0.00089870155,0.001538341,0.0025377797,0.0018281597,0.008139267],"category_scores_gemma":[0.002677958,0.0011626048,0.001181085,0.0015741782,0.00071967836,0.0023782118,0.001904382,0.0017135114,0.0009493071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034914652,0.00022657146,0.00035054915,0.00018333239,0.00005847541,0.000089631896,0.00008521878,0.81542486,0.002903967,0.01863766,0.004792965,0.15689763],"study_design_scores_gemma":[0.000063084895,0.00004104535,0.000067212466,0.0000055557844,0.000011048017,0.000022914608,0.000012471936,0.9933001,0.00033018488,0.0054670167,0.00067250716,0.0000069149055],"about_ca_topic_score_codex":0.011103478,"about_ca_topic_score_gemma":0.010915571,"teacher_disagreement_score":0.011103478,"about_ca_system_score_codex":0.0017313979,"about_ca_system_score_gemma":0.0041690622,"threshold_uncertainty_score":0.027228534},"labels":[],"label_agreement":null},{"id":"W4400881185","doi":"10.1016/j.cor.2024.106782","title":"The Cooperative Maximal Covering Location Problem with ordered partial attractions","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":2,"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":"Agencia Estatal de Investigación; H2020 European Research Council; Ministerio de Ciencia, Innovación y Universidades; Universidad de Málaga","keywords":"Mathematical optimization; Node (physics); Computer science; Function (biology); Facility location problem; Mathematics","score_opus":0.07096726206472381,"score_gpt":0.3315174065721486,"score_spread":0.2605501445074248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400881185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085926555,0.0003361811,0.9063575,0.00030394178,0.00003257955,0.00013070628,0.0005414482,0.00019641893,0.0061746547],"genre_scores_gemma":[0.8206414,0.0004237689,0.17227283,0.00009452173,0.000057464873,0.0003382904,0.0009727389,0.00008468753,0.005114311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832207,0.00071399636,0.00007692746,0.0003127288,0.00029017974,0.0002841227],"domain_scores_gemma":[0.99841225,0.00092573,0.0002263284,0.00014053869,0.0001579483,0.00013709629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014831518,0.0011937647,0.0013746991,0.0009099252,0.00060455006,0.0015838259,0.0016437225,0.0014861659,0.002641757],"category_scores_gemma":[0.0032578937,0.0006543735,0.0013526253,0.001962372,0.0008543798,0.0018160708,0.0014886842,0.0008640918,0.00031312232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008722199,0.00004824032,0.0007053173,0.00009463659,0.000055912482,0.00024541645,0.000091572154,0.95367944,0.0010474437,0.027537348,0.0011138163,0.015293607],"study_design_scores_gemma":[0.000022152202,0.00005774431,0.00026534457,0.000011732688,0.000019184758,0.00010416273,0.0000742043,0.9727897,0.00045255222,0.02458601,0.0016053952,0.000011765899],"about_ca_topic_score_codex":0.004646907,"about_ca_topic_score_gemma":0.0038507406,"teacher_disagreement_score":0.004646907,"about_ca_system_score_codex":0.0012348185,"about_ca_system_score_gemma":0.0010125508,"threshold_uncertainty_score":0.009239674},"labels":[],"label_agreement":null},{"id":"W4401659522","doi":"10.1016/j.cor.2024.106806","title":"A genetic algorithm to solve the production lot-sizing problem with capacity adjustment","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Wilfrid Laurier University; Saint Mary's University","funders":"","keywords":"Sizing; Production (economics); Genetic algorithm; Computer science; Mathematical optimization; Algorithm; Production planning; Mathematics; Economics","score_opus":0.06885273220155749,"score_gpt":0.29940290969461897,"score_spread":0.23055017749306148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401659522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037101958,0.00045378544,0.95313394,0.0003503243,0.00015754644,0.00014674666,0.00009004214,0.000626553,0.0079392],"genre_scores_gemma":[0.35292554,0.0002485079,0.6408957,0.00020705811,0.000072318886,0.00038492848,0.00018605583,0.00012489471,0.004954945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997397,0.00009095711,0.00001105395,0.00004457318,0.00007547466,0.000038290083],"domain_scores_gemma":[0.99939656,0.00043087648,0.000034729255,0.000022084818,0.000091704685,0.000023995579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078841165,0.0007846782,0.0010183273,0.00093222596,0.00055491686,0.0007738486,0.0014368814,0.0019171989,0.0029562495],"category_scores_gemma":[0.0017877902,0.00067528366,0.00068709673,0.0012285168,0.00062658434,0.0006506432,0.0006438129,0.0010026672,0.00035127948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029941744,0.000043760312,0.00016382137,0.00002435338,0.00002639111,0.000030588744,0.000022918828,0.9621962,0.00063837535,0.0026657677,0.0007895738,0.03336836],"study_design_scores_gemma":[0.000024350637,0.000017728511,0.000043717595,0.0000032268445,0.0000061241753,0.0000065915,0.0000034692723,0.9986467,0.0000966853,0.0009229459,0.00022561212,0.0000028129662],"about_ca_topic_score_codex":0.01255214,"about_ca_topic_score_gemma":0.008840901,"teacher_disagreement_score":0.01255214,"about_ca_system_score_codex":0.00088313007,"about_ca_system_score_gemma":0.0018715032,"threshold_uncertainty_score":0.024958134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010123187,0.0004208383,0.983373,0.00033178515,0.00011100012,0.00016116818,0.00011224281,0.0004463414,0.0049205185],"genre_scores_gemma":[0.100506805,0.00043895218,0.8925191,0.00016638264,0.000104624545,0.00030532735,0.00036026823,0.00023807111,0.005360446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914896,0.00028622174,0.000039989147,0.00014725511,0.00023198359,0.00014554203],"domain_scores_gemma":[0.99826884,0.0012501383,0.00007795371,0.00008724959,0.00018596389,0.00012983844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016268898,0.0013019764,0.0023457343,0.0013091417,0.0009917435,0.0020519032,0.0024913433,0.002543988,0.008270007],"category_scores_gemma":[0.0039216946,0.0012565833,0.001323579,0.002306401,0.0007409157,0.0025300605,0.0015978501,0.0027959144,0.0011307029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003911928,0.00047821505,0.00041398616,0.0001791768,0.00010398122,0.0001181011,0.000078126046,0.7274806,0.0018437713,0.03699422,0.009205908,0.2227127],"study_design_scores_gemma":[0.00006670131,0.000045455945,0.00006437903,0.000009763733,0.000017736747,0.000025306486,0.000012351758,0.9854527,0.000250486,0.013107154,0.00094054197,0.000007464762],"about_ca_topic_score_codex":0.007149213,"about_ca_topic_score_gemma":0.0064731855,"teacher_disagreement_score":0.008270007,"about_ca_system_score_codex":0.0014642494,"about_ca_system_score_gemma":0.0030994257,"threshold_uncertainty_score":0.027665913},"labels":[],"label_agreement":null},{"id":"W4401675546","doi":"10.1016/j.cor.2024.106815","title":"Deep Reinforcement Learning based real-time open-pit mining truck dispatching system","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Mining Techniques and Economics","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":"University of Alberta","funders":"","keywords":"Truck; Reinforcement learning; Computer science; Artificial intelligence; Operations research; Automotive engineering; Engineering","score_opus":0.03985748271284113,"score_gpt":0.32056714770183947,"score_spread":0.28070966498899835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401675546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45611936,0.00048368354,0.5288501,0.0008185643,0.00036479722,0.00012613127,0.00034747637,0.003065743,0.009824105],"genre_scores_gemma":[0.9898086,0.000024461888,0.008239453,0.000041083127,0.000013018624,0.00002105907,0.000079602694,0.00001394166,0.0017587685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998109,0.000025700288,0.000008154541,0.000051982697,0.00004921623,0.000054126238],"domain_scores_gemma":[0.99963903,0.00012334736,0.000042625186,0.000020915953,0.00012678228,0.000047262576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044192327,0.0005129466,0.00082804804,0.0002698607,0.00036787876,0.00047382247,0.00095176947,0.0006693878,0.0027275444],"category_scores_gemma":[0.0008085172,0.000344904,0.00027134962,0.0002231481,0.00025952494,0.00044139195,0.00053886295,0.00091360946,0.00036153645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025692082,0.00019335136,0.0015866192,0.000039162616,0.000024748972,0.000092734466,0.000023025214,0.94242734,0.0029580952,0.0005925343,0.0017187189,0.050086778],"study_design_scores_gemma":[0.0000036393078,0.000012903994,0.00011031062,4.671322e-7,0.0000014165271,0.0000020052007,0.0000011903784,0.99960333,0.00013638234,0.00008524469,0.000042000323,0.0000012045044],"about_ca_topic_score_codex":0.01244149,"about_ca_topic_score_gemma":0.012198079,"teacher_disagreement_score":0.01244149,"about_ca_system_score_codex":0.0007267344,"about_ca_system_score_gemma":0.001111889,"threshold_uncertainty_score":0.024738133},"labels":[],"label_agreement":null},{"id":"W4401742309","doi":"10.1016/j.cor.2024.106818","title":"A GRASP algorithm for the concrete delivery problem","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","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":"GLS Industries (Canada); Université Laval","funders":"","keywords":"GRASP; Computer science; Algorithm; Mathematical optimization; Mathematics; Programming language","score_opus":0.04565483201931367,"score_gpt":0.32960075332053895,"score_spread":0.2839459213012253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401742309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097194305,0.00019561803,0.9857452,0.00014648824,0.000053623524,0.00004850908,0.00006221084,0.000798538,0.0032303878],"genre_scores_gemma":[0.15231192,0.0003504011,0.8407262,0.000107095126,0.00006625248,0.00019304242,0.00028696354,0.00030758156,0.0056505883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997205,0.000045458455,0.000014515018,0.00005544428,0.0001114434,0.000052613977],"domain_scores_gemma":[0.9996215,0.00017552871,0.000033751683,0.000046587986,0.00008207893,0.000040477655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005780295,0.0008496977,0.0012690182,0.0009027821,0.00063800154,0.0008910907,0.0011344363,0.0017663353,0.007908125],"category_scores_gemma":[0.0019369379,0.0006910428,0.0010322069,0.0013751384,0.00057233736,0.0015422923,0.0016623418,0.0016505952,0.0011851127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015297673,0.000101632446,0.00030421925,0.0001384964,0.00004514882,0.00008664867,0.000067119036,0.6615249,0.0049136933,0.022500852,0.005768692,0.30439565],"study_design_scores_gemma":[0.000051634448,0.00004973869,0.00009366347,0.000013889606,0.000010586141,0.000031041458,0.000012199841,0.98552066,0.00057402835,0.011719797,0.0019139088,0.000008731339],"about_ca_topic_score_codex":0.004946101,"about_ca_topic_score_gemma":0.003956343,"teacher_disagreement_score":0.007908125,"about_ca_system_score_codex":0.00073997374,"about_ca_system_score_gemma":0.001783017,"threshold_uncertainty_score":0.026455343},"labels":[],"label_agreement":null},{"id":"W4402567958","doi":"10.1016/j.cor.2024.106835","title":"A slope scaling heuristic for the multi-period strategic planning of carbon capture and storage","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Global Energy and Sustainability Research","field":"Energy","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é de Montréal; Natural Resources Canada","funders":"","keywords":"Heuristic; Scaling; Period (music); Computer science; Mathematical optimization; Operations research; Carbon fibers; Algorithm; Mathematics; Artificial intelligence","score_opus":0.08529383089796502,"score_gpt":0.3861147016343523,"score_spread":0.3008208707363873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402567958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.126611,0.0022293418,0.84482193,0.0007474727,0.00017808628,0.00059053476,0.0006379181,0.0008366587,0.023347048],"genre_scores_gemma":[0.64502865,0.00096227054,0.34800765,0.00024813673,0.000050648858,0.00052607077,0.00062188995,0.00020428277,0.0043504294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953485,0.00020367262,0.000019826122,0.00007057086,0.00008346424,0.00008772532],"domain_scores_gemma":[0.9991843,0.0005230582,0.00009410612,0.00003966978,0.00007530566,0.00008352414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010929868,0.0011266785,0.0008374087,0.0010378022,0.00045506662,0.0010044336,0.0011375671,0.0010360739,0.005614499],"category_scores_gemma":[0.002251678,0.0006789148,0.00078714144,0.0011657214,0.0005836597,0.0011006691,0.00078170275,0.0009846963,0.0004849355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009676426,0.000083934545,0.00040151473,0.00010072481,0.000023373937,0.00011553334,0.00005995683,0.9537245,0.0010460753,0.006975893,0.0020916495,0.035280004],"study_design_scores_gemma":[0.000027337781,0.000074777075,0.00017311177,0.000025127309,0.000010304342,0.00002718071,0.00004341684,0.9934994,0.0003027308,0.0043232027,0.0014839259,0.000009404982],"about_ca_topic_score_codex":0.006481413,"about_ca_topic_score_gemma":0.0074464977,"teacher_disagreement_score":0.006481413,"about_ca_system_score_codex":0.0015002084,"about_ca_system_score_gemma":0.002067441,"threshold_uncertainty_score":0.018782318},"labels":[],"label_agreement":null},{"id":"W4402638181","doi":"10.1016/j.cor.2024.106851","title":"Exact methods and a variable neighborhood search for the robust capacitated <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.svg\" display=\"inline\" id=\"d1e3028\"> <mml:mi>p</mml:mi> </mml:math> -median problem","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Fonds de recherche du Québec – Nature et technologies; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Alliance de recherche numérique du Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Variable (mathematics); Scalable Vector Graphics; Algorithm; Variable neighborhood search; Mathematics; Combinatorics; Discrete mathematics; Operating system; Metaheuristic","score_opus":0.059530718591166945,"score_gpt":0.32256085795759115,"score_spread":0.2630301393664242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402638181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075478135,0.00046543565,0.98767996,0.0001594073,0.000040676798,0.000046389374,0.000055091794,0.0001216193,0.003883555],"genre_scores_gemma":[0.27940127,0.0006681036,0.7137144,0.00015056426,0.00009486229,0.0004983263,0.00025988466,0.00019628482,0.005016266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945015,0.0002090613,0.000019394114,0.00010556517,0.00016370662,0.000052101197],"domain_scores_gemma":[0.99861145,0.0010462801,0.000105785344,0.00007006289,0.00013391573,0.00003244524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015019922,0.00089332013,0.0011209404,0.0009851631,0.0004589031,0.0009290728,0.001327361,0.001195893,0.004551903],"category_scores_gemma":[0.004143366,0.00061682635,0.0008916678,0.0012061421,0.0007090535,0.0011655976,0.00088516163,0.0013026524,0.00046178192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025607304,0.000020561001,0.00016514842,0.000055314096,0.000016505182,0.00001805006,0.000021662408,0.96324635,0.00024167878,0.016587103,0.0005120044,0.019090064],"study_design_scores_gemma":[0.000004690702,0.000008767507,0.000025455534,0.000006180376,0.000002283366,0.0000034076963,0.000004819345,0.9962513,0.00006975166,0.003309946,0.000311552,0.0000019339113],"about_ca_topic_score_codex":0.009614341,"about_ca_topic_score_gemma":0.008808723,"teacher_disagreement_score":0.009614341,"about_ca_system_score_codex":0.0012382676,"about_ca_system_score_gemma":0.0019387347,"threshold_uncertainty_score":0.01911676},"labels":[],"label_agreement":null},{"id":"W4402830080","doi":"10.1016/j.cor.2024.106848","title":"A machine-learning-based column generation heuristic for electric bus scheduling","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Computer science; Scheduling (production processes); Heuristic; Mathematical optimization; Operations research; Artificial intelligence; Mathematics","score_opus":0.05122663785335645,"score_gpt":0.33064974440206985,"score_spread":0.2794231065487134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402830080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11127446,0.00064160465,0.8797822,0.00034346583,0.00009433239,0.00024032035,0.00044240098,0.0011508615,0.006030437],"genre_scores_gemma":[0.80456656,0.00019448619,0.19116691,0.00014377321,0.000038571096,0.00022940213,0.00070661335,0.00012728469,0.0028264238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999731,0.00010023542,0.000010317938,0.00005258774,0.000045587436,0.000060182305],"domain_scores_gemma":[0.9994387,0.00034977318,0.00006560149,0.000029724612,0.00008353043,0.000032658056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045874715,0.00091167947,0.00082364,0.00061919447,0.00034650075,0.0004612465,0.0007995291,0.0006100993,0.0026719081],"category_scores_gemma":[0.0010219563,0.00039484596,0.00053365953,0.0008418122,0.00047666172,0.0005988114,0.00035695653,0.0006679737,0.0002885679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040733838,0.000042691423,0.00019911918,0.000032758726,0.000014552546,0.000037188776,0.000015023375,0.9786743,0.000660492,0.0012615428,0.000907197,0.018114315],"study_design_scores_gemma":[0.000009996935,0.000018824132,0.00005732964,0.0000022296183,0.0000037520053,0.000006104719,0.000004158569,0.99879277,0.00028939437,0.00058919744,0.00022372734,0.0000025559482],"about_ca_topic_score_codex":0.009586969,"about_ca_topic_score_gemma":0.01000876,"teacher_disagreement_score":0.009586969,"about_ca_system_score_codex":0.0010725295,"about_ca_system_score_gemma":0.0013301831,"threshold_uncertainty_score":0.01906234},"labels":[],"label_agreement":null},{"id":"W4403045105","doi":"10.1016/j.cor.2024.106857","title":"Influence optimization in networks: New formulations and valid inequalities","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematical optimization; Computer science; Inequality; Mathematics; Mathematical analysis","score_opus":0.05765346506212987,"score_gpt":0.3920126234720113,"score_spread":0.33435915840988145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403045105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035711017,0.0023870661,0.97631353,0.0011579229,0.00026653186,0.000051989562,0.00020447248,0.000036385918,0.016010957],"genre_scores_gemma":[0.3906043,0.016168712,0.5448188,0.0017474006,0.003574503,0.0009857164,0.0010173352,0.00052031653,0.040562943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.0011361898,0.00010922437,0.0003120737,0.0005190884,0.00015421447],"domain_scores_gemma":[0.99362695,0.004799738,0.000383938,0.0002534309,0.0007547948,0.00018127164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036208834,0.002198553,0.001314038,0.0018182625,0.00094973994,0.003011391,0.0021584046,0.002112004,0.0048613283],"category_scores_gemma":[0.013386072,0.0008963503,0.0018400617,0.0025961415,0.002818746,0.0050779115,0.0027330988,0.0046334793,0.0007351096],"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.000031496274,0.00005482784,0.00033750405,0.0002252873,0.00005057851,0.00007900572,0.00015741904,0.13745561,0.0005868421,0.82931006,0.005649669,0.026061663],"study_design_scores_gemma":[0.000010060297,0.000017359294,0.0001277719,0.000045110613,0.000025122086,0.00003759802,0.000036825128,0.5982305,0.00023605477,0.39645568,0.0047627226,0.000015225449],"about_ca_topic_score_codex":0.005638082,"about_ca_topic_score_gemma":0.00722554,"teacher_disagreement_score":0.005638082,"about_ca_system_score_codex":0.0025672037,"about_ca_system_score_gemma":0.0013921055,"threshold_uncertainty_score":0.019149244},"labels":[],"label_agreement":null},{"id":"W4403457225","doi":"10.1016/j.cor.2024.106870","title":"Distributionally robust optimization of a newsvendor model under capital constraint and risk aversion","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"University of Windsor","funders":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; National University's Basic Research Foundation of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Newsvendor model; Risk aversion (psychology); Robust optimization; Constraint (computer-aided design); Mathematical optimization; Computer science; Economics; Econometrics; Operations research; Mathematical economics; Expected utility hypothesis; Mathematics; Business; Supply chain","score_opus":0.05930053855521885,"score_gpt":0.29343214652216504,"score_spread":0.23413160796694618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403457225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26985607,0.003298754,0.6739305,0.009930502,0.0005169582,0.000156724,0.0013352573,0.0005566091,0.040418692],"genre_scores_gemma":[0.96237093,0.0008758379,0.0120756235,0.0002752437,0.00016161111,0.00007326093,0.00032267938,0.0001493265,0.023695512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988361,0.000564439,0.00005593757,0.00024417692,0.00013645102,0.00016293695],"domain_scores_gemma":[0.9938704,0.0041532046,0.0009629251,0.00020577312,0.00045238022,0.0003553751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031701443,0.0014747594,0.0034501725,0.001073453,0.0006542993,0.003933531,0.002007991,0.0042622234,0.0040686266],"category_scores_gemma":[0.0109739555,0.001805805,0.001254061,0.0010067074,0.0028718836,0.0036377993,0.0022329416,0.003077777,0.00042641393],"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.000104870865,0.000048570175,0.00031016936,0.00006554051,0.00007518923,0.00018039161,0.00004483926,0.93102574,0.0004925493,0.06477312,0.0012233643,0.0016556862],"study_design_scores_gemma":[0.000028789378,0.000033600783,0.00017935218,0.000007773499,0.000017528078,0.000017729757,0.00002404131,0.96996886,0.00007468551,0.029391399,0.00023498316,0.00002123057],"about_ca_topic_score_codex":0.010112792,"about_ca_topic_score_gemma":0.0044709663,"teacher_disagreement_score":0.010112792,"about_ca_system_score_codex":0.0022041595,"about_ca_system_score_gemma":0.0019904142,"threshold_uncertainty_score":0.020107865},"labels":[],"label_agreement":null},{"id":"W4403561128","doi":"10.1016/j.cor.2024.106875","title":"Satellite Scheduling Problems: A survey of applications in Earth and outer space observation","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Satellite Communication Systems","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":"HEC Montréal","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Satellite; Computer science; Earth observation satellite; Remote sensing; Scheduling (production processes); Space (punctuation); Outer space; Earth observation; Aerospace engineering; Operations research; Geodesy; Geology; Mathematical optimization; Mathematics; Engineering; Operating system","score_opus":0.1519679168174526,"score_gpt":0.36547657786275833,"score_spread":0.21350866104530575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403561128","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016604671,0.64997834,0.28728968,0.0058116163,0.0016316843,0.0002217271,0.0008204018,0.00029569722,0.03734612],"genre_scores_gemma":[0.11439319,0.723249,0.1446129,0.001601043,0.004701193,0.0002937349,0.0018578235,0.0002603886,0.009030728],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876463,0.00035506883,0.0001284478,0.00031419442,0.00032306497,0.00011467228],"domain_scores_gemma":[0.9972367,0.0021620935,0.00015694958,0.00008110367,0.00027156083,0.00009165586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669363,0.001879275,0.0015656651,0.0019998946,0.0009141224,0.0024403562,0.0013478101,0.0020012818,0.004259416],"category_scores_gemma":[0.0034511907,0.000753472,0.0015573284,0.0062919976,0.0007409581,0.002302565,0.0011243434,0.0022592796,0.0011944392],"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.0001829028,0.00044916128,0.003704257,0.010735928,0.00024415815,0.00040049932,0.0005461354,0.16148412,0.0019343321,0.118513964,0.052968867,0.64883566],"study_design_scores_gemma":[0.000079601035,0.00055031694,0.005478245,0.0038158484,0.00020811155,0.0014328235,0.0013150146,0.30850667,0.0013175553,0.2268028,0.45035627,0.00013666043],"about_ca_topic_score_codex":0.0040263026,"about_ca_topic_score_gemma":0.003426058,"teacher_disagreement_score":0.004259416,"about_ca_system_score_codex":0.0011613707,"about_ca_system_score_gemma":0.002001533,"threshold_uncertainty_score":0.014249146},"labels":[],"label_agreement":null},{"id":"W4403898174","doi":"10.1016/j.cor.2024.106867","title":"Re-direction in queueing networks with two customer types: The inter-departure analysis","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"University of Toronto","funders":"RES’EAU-WaterNET; Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Layered queueing network; Network analysis; Mean value analysis; G-network; Queueing system; Operations research; Computer network; Mathematics","score_opus":0.03002399265608352,"score_gpt":0.3429309350908098,"score_spread":0.3129069424347263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403898174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13137603,0.0022137407,0.8411273,0.0033019464,0.0005129448,0.00013820535,0.000103367885,0.00025533343,0.020971162],"genre_scores_gemma":[0.9319491,0.002093033,0.038926497,0.00067050685,0.0004206241,0.00009456017,0.00014349252,0.00022761036,0.025474532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982845,0.0007900262,0.00004801826,0.00022075554,0.0003055117,0.0003512664],"domain_scores_gemma":[0.9914289,0.0048430623,0.00077632704,0.000693862,0.0014655141,0.0007922468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128795,0.0013125639,0.0013401143,0.0019750954,0.0015670573,0.002983158,0.0032944258,0.0021906046,0.0039231307],"category_scores_gemma":[0.015974458,0.0010372372,0.0015611055,0.0014376623,0.0028490967,0.007406855,0.002104244,0.0049272054,0.0008069993],"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.00025252427,0.0002061785,0.0027108623,0.000089822664,0.000070712515,0.0003178801,0.00039702552,0.40927824,0.002247198,0.5575468,0.0047614127,0.02212136],"study_design_scores_gemma":[0.000012159947,0.000027533659,0.00031348492,0.000012563571,0.000018182867,0.000049351693,0.000108168744,0.92603576,0.00030181024,0.07223751,0.00085933914,0.000024044595],"about_ca_topic_score_codex":0.008981871,"about_ca_topic_score_gemma":0.0055405637,"teacher_disagreement_score":0.008981871,"about_ca_system_score_codex":0.002904464,"about_ca_system_score_gemma":0.0024797525,"threshold_uncertainty_score":0.027123988},"labels":[],"label_agreement":null},{"id":"W4404056710","doi":"10.1016/j.cor.2024.106887","title":"Distributionally robust hospital capacity expansion planning under stochastic and correlated patient demand","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Toronto Metropolitan University","keywords":"Capacity planning; Mathematical optimization; Computer science; Capacity management; Operations research; Robust optimization; Operations management; Mathematics; Economics","score_opus":0.16271010739468894,"score_gpt":0.45514545544062385,"score_spread":0.2924353480459349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404056710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21858557,0.0008101053,0.76689696,0.003030099,0.00018088946,0.0001961173,0.0012164983,0.0006702946,0.008413365],"genre_scores_gemma":[0.98255825,0.0002110025,0.013009365,0.00015428853,0.000059237613,0.00008429276,0.00035069505,0.00009404272,0.0034787417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971987,0.0012637831,0.00010243552,0.00050120516,0.00034478694,0.00058905117],"domain_scores_gemma":[0.9878977,0.008621002,0.0015460333,0.00036106145,0.0010179516,0.0005561653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055189854,0.001529768,0.0032663718,0.0010737767,0.0005372129,0.002305882,0.0026272647,0.0023967526,0.0029957143],"category_scores_gemma":[0.014994889,0.0025234637,0.0011969678,0.0016758435,0.0018933563,0.002639872,0.002494189,0.0025270334,0.0003466516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026484511,0.000007659978,0.00007785529,0.000007888479,0.000011687382,0.000016465683,0.0000040305467,0.9979018,0.00006602637,0.0013400154,0.00011851324,0.0004215273],"study_design_scores_gemma":[0.000005092007,0.00001268671,0.00007727555,0.0000016457301,0.000003357318,0.0000037880302,0.0000055579053,0.9982041,0.000034878554,0.0016238423,0.000023933326,0.0000038107453],"about_ca_topic_score_codex":0.013227265,"about_ca_topic_score_gemma":0.008055005,"teacher_disagreement_score":0.013227265,"about_ca_system_score_codex":0.0032041413,"about_ca_system_score_gemma":0.0027441215,"threshold_uncertainty_score":0.02918756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24976136,0.0011940805,0.7396655,0.00081159803,0.00014748462,0.00023982624,0.0002936998,0.00032317484,0.0075632194],"genre_scores_gemma":[0.92052895,0.00030642503,0.07605556,0.000117968506,0.000027744021,0.00013204716,0.00021016847,0.00003788934,0.0025832853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996024,0.00015452507,0.00001538279,0.00008474538,0.000046550587,0.000096396114],"domain_scores_gemma":[0.9992028,0.0004893983,0.00011034837,0.00003633812,0.0000762993,0.00008479613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009171902,0.0010687725,0.00083421386,0.00045627588,0.0004633576,0.0007712561,0.0007827646,0.0009159222,0.0023132667],"category_scores_gemma":[0.0021014793,0.0003845431,0.0006009578,0.0005700616,0.0005127051,0.0010280311,0.00068183587,0.00073307945,0.00022070293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003418535,0.000029681238,0.0003140591,0.000025444355,0.0000142090075,0.000033696462,0.0000095393125,0.9912656,0.00033607407,0.00080675277,0.00026516384,0.0068656174],"study_design_scores_gemma":[0.000010406368,0.00004064765,0.00012448517,0.000003415589,0.0000053122653,0.000009530297,0.000019475596,0.99835676,0.00015130705,0.0010262028,0.00025063613,0.0000018684227],"about_ca_topic_score_codex":0.009672495,"about_ca_topic_score_gemma":0.006748799,"teacher_disagreement_score":0.009672495,"about_ca_system_score_codex":0.0009290016,"about_ca_system_score_gemma":0.001468003,"threshold_uncertainty_score":0.019232392},"labels":[],"label_agreement":null},{"id":"W4404876905","doi":"10.1016/j.cor.2024.106920","title":"Equity-driven facility location: A two-stage robust optimization approach","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equity (law); Computer science; Stage (stratigraphy); Business; Finance; Operations research; Mathematical optimization; Mathematics","score_opus":0.17834535963307463,"score_gpt":0.3757811905412532,"score_spread":0.19743583090817857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404876905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040297005,0.000065880486,0.9939399,0.0001586337,0.000014174267,0.00004038119,0.000057938953,0.0000958389,0.0015975467],"genre_scores_gemma":[0.59099245,0.0003118964,0.4012173,0.00022814919,0.00009921622,0.00034467297,0.00026171847,0.00019997399,0.0063445717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874276,0.0005962601,0.000044351025,0.00021447561,0.0002507034,0.00015135876],"domain_scores_gemma":[0.9977568,0.0014820877,0.00025385592,0.00015876403,0.00025848558,0.00009007689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030154253,0.001104333,0.0016198562,0.00083360035,0.00044366063,0.0017862312,0.0023934175,0.0021496355,0.005207883],"category_scores_gemma":[0.005218115,0.0011057709,0.0015061127,0.0009692079,0.0010439876,0.0019571874,0.0023825273,0.0018046406,0.0003942705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016519083,0.000010402769,0.0001045475,0.000021411804,0.000011184174,0.000025083718,0.000009994794,0.988818,0.00018030229,0.006470145,0.00021460102,0.004117869],"study_design_scores_gemma":[0.0000042481884,0.000014936732,0.00002751843,0.0000032227993,0.0000030143935,0.000006323115,0.000003893493,0.9968727,0.0001174343,0.002753334,0.00018934734,0.0000040265827],"about_ca_topic_score_codex":0.0061931806,"about_ca_topic_score_gemma":0.0036881804,"teacher_disagreement_score":0.0061931806,"about_ca_system_score_codex":0.0015394086,"about_ca_system_score_gemma":0.0019686176,"threshold_uncertainty_score":0.01742214},"labels":[],"label_agreement":null},{"id":"W4405801416","doi":"10.1016/j.cor.2024.106961","title":"Minimum cost consensus model considering dual behavior preference","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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 Alberta","funders":"Humanities and Social Science Fund of Ministry of Education of China; Natural Science Foundation of Hubei Province; Department of Education of Hebei Province; National Natural Science Foundation of China","keywords":"Dual (grammatical number); Preference; Mathematical optimization; Computer science; Mathematics; Mathematical economics; Statistics","score_opus":0.704949151322681,"score_gpt":0.569455537508496,"score_spread":0.135493613814185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405801416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12298005,0.00026987877,0.86012506,0.0016047778,0.0001259016,0.00009251549,0.00017380253,0.0001109444,0.014517163],"genre_scores_gemma":[0.93850064,0.00017743694,0.047079224,0.000116248855,0.000060605937,0.0002110241,0.00015307695,0.00003850059,0.013663158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848086,0.0006896314,0.000053796586,0.0002926029,0.0002660932,0.00021695888],"domain_scores_gemma":[0.9967924,0.0019366648,0.00025439638,0.00016950736,0.00060085085,0.0002461289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020187832,0.00092247507,0.0024722703,0.0010257795,0.0007694554,0.0019881309,0.0025204145,0.0027110607,0.005887972],"category_scores_gemma":[0.0050774203,0.0006085241,0.0010594068,0.0013571235,0.0009920894,0.0023071,0.0013485786,0.0019355355,0.0005520365],"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.0002812394,0.00014531032,0.0005900787,0.00014566524,0.00011426604,0.00027022755,0.00012670747,0.8655282,0.0014859299,0.11482312,0.0014128374,0.015076381],"study_design_scores_gemma":[0.000025945716,0.00003098016,0.00009188911,0.000004861972,0.0000152543425,0.000018420511,0.00001736135,0.97416556,0.0001057625,0.025362326,0.00015161473,0.000010036724],"about_ca_topic_score_codex":0.0040380238,"about_ca_topic_score_gemma":0.0022608095,"teacher_disagreement_score":0.005887972,"about_ca_system_score_codex":0.0015627539,"about_ca_system_score_gemma":0.0013748916,"threshold_uncertainty_score":0.019697249},"labels":[],"label_agreement":null},{"id":"W4406778339","doi":"10.1016/j.cor.2026.107528","title":"Navigating Network Availability: A Shortest Path Approach to Uav Traffic Routing","year":2025,"lang":"en","type":"preprint","venue":"Computers & Operations Research","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Equal-cost multi-path routing; Computer science; Routing (electronic design automation); Private Network-to-Network Interface; Path (computing); Constrained Shortest Path First; Computer network; Static routing; K shortest path routing; Real-time computing; Routing protocol; Theoretical computer science","score_opus":0.07721717280929229,"score_gpt":0.3675326028935209,"score_spread":0.2903154300842286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406778339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019003147,0.00036339537,0.9775499,0.00023899852,0.00004802854,0.000036790923,0.00007555518,0.00013096376,0.0025532448],"genre_scores_gemma":[0.7089903,0.00087433704,0.28622052,0.00007256455,0.00015012456,0.00009988994,0.00019562035,0.00013246159,0.0032642111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946266,0.00018467482,0.000022884022,0.0001070646,0.0001571131,0.00006560901],"domain_scores_gemma":[0.9987066,0.0008443064,0.00013176326,0.000076855285,0.00017975258,0.000060641418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794311,0.00083884544,0.0012230654,0.0017623738,0.00085814233,0.0015778254,0.001671031,0.0010243503,0.0021477074],"category_scores_gemma":[0.0050224266,0.0005832815,0.00082230725,0.0018933826,0.0007987646,0.0022964429,0.0011924885,0.0009983439,0.00022002133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052296546,0.000031061245,0.0006048799,0.00007060387,0.00004700842,0.00006542394,0.00010978937,0.92210585,0.0010765663,0.03888661,0.0011045926,0.035845377],"study_design_scores_gemma":[0.0000029934831,0.000010230435,0.00008169287,0.0000047119706,0.000008077242,0.000013437513,0.000018996705,0.985518,0.00012546414,0.01388028,0.00033215233,0.0000039354786],"about_ca_topic_score_codex":0.00875447,"about_ca_topic_score_gemma":0.006642475,"teacher_disagreement_score":0.00875447,"about_ca_system_score_codex":0.0009908048,"about_ca_system_score_gemma":0.0009775851,"threshold_uncertainty_score":0.017407},"labels":[],"label_agreement":null},{"id":"W4407852406","doi":"10.1016/j.cor.2025.107024","title":"Bidding in day-ahead electricity markets: A dynamic programming framework","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Electric Power System Optimization","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; Université de Montréal; Minnow Environmental (Canada)","funders":"","keywords":"Bidding; Electricity; Computer science; Dynamic programming; Electricity market; Operations research; Environmental economics; Mathematical optimization; Business; Microeconomics; Economics; Algorithm; Mathematics; Electrical engineering; Engineering","score_opus":0.015994443215017758,"score_gpt":0.3331045051665095,"score_spread":0.3171100619514918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407852406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018912999,0.00082599034,0.96225303,0.0015398666,0.00010960542,0.000080791535,0.00018172862,0.00012838599,0.015967721],"genre_scores_gemma":[0.80885404,0.0017108085,0.15805613,0.0005183331,0.00034126063,0.00037698785,0.00033499533,0.00030994503,0.029497536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982146,0.0011722507,0.00004361371,0.00017619824,0.00018423535,0.00020914484],"domain_scores_gemma":[0.99639505,0.0029175754,0.00018494019,0.00008262688,0.00020310855,0.00021666926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003930317,0.0013595406,0.002707478,0.00080977095,0.00084919465,0.0037432506,0.00329989,0.0028168196,0.0063657262],"category_scores_gemma":[0.0077286894,0.0022462714,0.0015750193,0.0013875524,0.001933684,0.0035771907,0.0018821573,0.002973562,0.00060779287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041958538,0.00008996547,0.00018372427,0.000057967263,0.00004553119,0.000075946235,0.000047815487,0.89182323,0.00016076806,0.10116752,0.0015083201,0.004797243],"study_design_scores_gemma":[0.000009533068,0.000010771993,0.000032836262,0.000005128198,0.000007915502,0.000009184665,0.000010749374,0.9715056,0.0000261434,0.02805037,0.00032593097,0.0000059133263],"about_ca_topic_score_codex":0.0074309288,"about_ca_topic_score_gemma":0.008484717,"teacher_disagreement_score":0.0074309288,"about_ca_system_score_codex":0.0017533731,"about_ca_system_score_gemma":0.0024236352,"threshold_uncertainty_score":0.021295428},"labels":[],"label_agreement":null},{"id":"W4407903078","doi":"10.1016/j.cor.2025.107015","title":"A comprehensive stochastic programming model for transfer synchronization in transit networks","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Network Time Synchronization Technologies","field":"Computer Science","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":"Transfer (computing); Computer science; Synchronization (alternating current); Transit (satellite); Stochastic modelling; Stochastic programming; Programming paradigm; Mathematical optimization; Operations research; Mathematics; Public transport; Computer network; Transport engineering; Parallel computing; Statistics; Programming language; Engineering","score_opus":0.049692789499745656,"score_gpt":0.34923774612831404,"score_spread":0.2995449566285684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407903078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025551468,0.0002858256,0.96535784,0.0006989261,0.000052910804,0.000050180388,0.00025579543,0.000115780844,0.0076313117],"genre_scores_gemma":[0.9142331,0.0010829567,0.053597752,0.00022886587,0.00016695776,0.00027375808,0.00038733231,0.00012539954,0.02990387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993998,0.00019932551,0.000022873723,0.00014264225,0.00012504653,0.000110267014],"domain_scores_gemma":[0.9988689,0.00070860767,0.00013006078,0.00004235539,0.00015376072,0.00009632033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014081092,0.00082414836,0.001403749,0.0006660063,0.0005834197,0.0016943574,0.0018011446,0.0017464585,0.0051319315],"category_scores_gemma":[0.0036053858,0.00067284703,0.00092139276,0.0012903546,0.0011007756,0.0018831134,0.0013902613,0.0018412899,0.00040226828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022474942,0.00002027056,0.00011408047,0.000030102316,0.000015390293,0.000054388194,0.000031372463,0.883838,0.00036448005,0.11164294,0.00091503735,0.002951454],"study_design_scores_gemma":[0.0000067929845,0.000011458119,0.0000406479,0.00000407291,0.000006878665,0.0000072830703,0.000007244631,0.97924244,0.00004834272,0.020285675,0.00033438508,0.000004816318],"about_ca_topic_score_codex":0.011765252,"about_ca_topic_score_gemma":0.0072410647,"teacher_disagreement_score":0.011765252,"about_ca_system_score_codex":0.0020725026,"about_ca_system_score_gemma":0.0024198154,"threshold_uncertainty_score":0.023393512},"labels":[],"label_agreement":null},{"id":"W4408020775","doi":"10.1016/j.cor.2025.107030","title":"Feasible and infeasible region search for the maximally diverse grouping problem","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Tabu search; Mathematics","score_opus":0.4141977771985357,"score_gpt":0.5103312919633891,"score_spread":0.09613351476485343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408020775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09585577,0.0010103389,0.88539016,0.0006515889,0.00005504851,0.0002396184,0.00047022104,0.00027290327,0.01605432],"genre_scores_gemma":[0.42855746,0.00058041257,0.5625067,0.00016744218,0.000065555105,0.00036974277,0.00079054304,0.0001732026,0.006789057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877816,0.0006954189,0.000035502046,0.00013874992,0.00021296962,0.00013920375],"domain_scores_gemma":[0.9972523,0.002130225,0.00023028975,0.00010079168,0.00016648813,0.00011993634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023902217,0.00083620386,0.0014017452,0.001457546,0.0007372195,0.0013134574,0.0013079267,0.0016649503,0.0047207098],"category_scores_gemma":[0.007772316,0.0007731203,0.0011932406,0.0015017871,0.0009767928,0.0018006542,0.0014365894,0.0014481306,0.0004200201],"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.0002897398,0.00015892656,0.00046160133,0.00017818937,0.00005623637,0.00009676787,0.00010672898,0.9145406,0.001047809,0.04057141,0.0027581935,0.039733756],"study_design_scores_gemma":[0.00006325476,0.00009910069,0.00020818376,0.000032764445,0.000017910561,0.000039038387,0.00004898986,0.96197826,0.00040290484,0.03607677,0.0010197135,0.000013069313],"about_ca_topic_score_codex":0.0048230523,"about_ca_topic_score_gemma":0.003960069,"teacher_disagreement_score":0.0048230523,"about_ca_system_score_codex":0.0009565536,"about_ca_system_score_gemma":0.0017308911,"threshold_uncertainty_score":0.01579237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014400559,0.00041929918,0.9824057,0.00023471133,0.00007003696,0.00009104206,0.00016746204,0.0006807979,0.0015304496],"genre_scores_gemma":[0.47135285,0.00048189962,0.51953924,0.0005050106,0.00023509588,0.00042170557,0.0011862635,0.00031851546,0.0059594093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995029,0.00017428378,0.00002680046,0.00010448499,0.00010017424,0.00009131839],"domain_scores_gemma":[0.9979728,0.0013819366,0.00012860278,0.00009278064,0.00034405192,0.00007985783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010107601,0.0010685414,0.00184083,0.0010189858,0.0005427426,0.00094698183,0.0018136227,0.0013140129,0.005927944],"category_scores_gemma":[0.0024631605,0.00087353744,0.0011073733,0.0012374269,0.00061877124,0.0011061007,0.00095233234,0.0016796069,0.0007542414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009894343,0.00010979113,0.00026528805,0.00010546283,0.00004511211,0.000059935977,0.00003824743,0.91450936,0.00092187204,0.002996329,0.0026137612,0.0782359],"study_design_scores_gemma":[0.000008625139,0.00001453788,0.000026097006,0.000002588766,0.0000052997198,0.0000048406414,0.0000035818816,0.99854493,0.00010535787,0.0011700782,0.00011124942,0.0000028635163],"about_ca_topic_score_codex":0.013377208,"about_ca_topic_score_gemma":0.014394954,"teacher_disagreement_score":0.013377208,"about_ca_system_score_codex":0.000844898,"about_ca_system_score_gemma":0.0018280108,"threshold_uncertainty_score":0.026598692},"labels":[],"label_agreement":null},{"id":"W4411163025","doi":"10.1016/j.cor.2025.107159","title":"Random-Key Optimizer with reinforcement learning for the Capacitated Multi-period Cutting Stock Problem with setup cost","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"Mitacs; Conselho Nacional de Desenvolvimento Científico e Tecnológico; HEC Montréal; Fundação de Amparo à Pesquisa do Estado de São Paulo; Healthcare Excellence Canada","keywords":"Reinforcement learning; Computer science; Key (lock); Mathematical optimization; Stock (firearms); Period (music); Reinforcement; Artificial intelligence; Operations research; Mathematics; Mechanical engineering; Engineering; Structural engineering","score_opus":0.04743423773720279,"score_gpt":0.3228343211424024,"score_spread":0.2754000834051996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411163025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059030812,0.00058924186,0.9342958,0.0005574054,0.0000991607,0.0001472422,0.00009535864,0.0008268993,0.0043581375],"genre_scores_gemma":[0.9138641,0.000198583,0.080597274,0.00021665273,0.00006064184,0.00021825598,0.000118081676,0.00013574782,0.0045906585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920255,0.0003540582,0.000036057976,0.00012866598,0.00011821477,0.0001604873],"domain_scores_gemma":[0.9967982,0.0022956962,0.00028224234,0.00012696169,0.00028605177,0.00021096076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030851848,0.0013067406,0.0023236831,0.00060972036,0.00039838013,0.00097604905,0.0017453366,0.0019167061,0.004190633],"category_scores_gemma":[0.0062799077,0.0007981836,0.00054785406,0.00058452925,0.0011762449,0.0017602963,0.0015357169,0.0021299315,0.000556768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016402906,0.000079291895,0.00017940711,0.0000479978,0.00002463581,0.000026225409,0.000018211864,0.98251235,0.0003243111,0.004636841,0.0008804507,0.011106189],"study_design_scores_gemma":[0.00001764686,0.000026244594,0.000018728353,0.0000020778562,0.00000244956,0.000002291244,0.000001441693,0.99868995,0.00004076531,0.0011584534,0.000037670805,0.0000023001921],"about_ca_topic_score_codex":0.0052817995,"about_ca_topic_score_gemma":0.004355222,"teacher_disagreement_score":0.0052817995,"about_ca_system_score_codex":0.0011693487,"about_ca_system_score_gemma":0.0019475631,"threshold_uncertainty_score":0.016316175},"labels":[],"label_agreement":null},{"id":"W4411193925","doi":"10.1016/j.cor.2025.107162","title":"Optimal interventions in robust optimization with time-dependent uncertainties","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital","funders":"","keywords":"Computer science; Mathematical optimization; Robust optimization; Psychological intervention; Mathematics; Medicine","score_opus":0.15559557217603054,"score_gpt":0.4470110162983257,"score_spread":0.29141544412229514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411193925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01731193,0.001002502,0.974178,0.00082093047,0.00008998132,0.000044626893,0.00003985729,0.00009351259,0.0064186445],"genre_scores_gemma":[0.9206033,0.0010657568,0.07153921,0.00026824736,0.00015818885,0.00023679067,0.000063910345,0.000119176366,0.005945499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775404,0.0013486888,0.00007096921,0.00029137777,0.0003366883,0.00019813281],"domain_scores_gemma":[0.99191695,0.006701162,0.0006105567,0.00019206063,0.0003641587,0.00021507412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003384158,0.0014103613,0.001827328,0.0008514017,0.00039077445,0.0019036697,0.0012740581,0.0023867255,0.0027514137],"category_scores_gemma":[0.015314701,0.0008059811,0.0006283913,0.0007224077,0.0027195353,0.0023320941,0.002340128,0.0020668358,0.00023661653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010997953,0.00005478335,0.0001230394,0.00011195752,0.000046861274,0.000045632292,0.000046088233,0.89281106,0.0007146095,0.0935166,0.00054021605,0.011879151],"study_design_scores_gemma":[0.00001997786,0.000046529545,0.0000440896,0.000014709917,0.000010301124,0.000007526358,0.000011062238,0.9548428,0.00025515482,0.044393826,0.00034659202,0.0000074352542],"about_ca_topic_score_codex":0.0021127276,"about_ca_topic_score_gemma":0.00096190313,"teacher_disagreement_score":0.003384158,"about_ca_system_score_codex":0.0014301513,"about_ca_system_score_gemma":0.0014002803,"threshold_uncertainty_score":0.017897367},"labels":[],"label_agreement":null},{"id":"W4411859452","doi":"10.1016/j.cor.2025.107165","title":"Stochastic casualty response planning with multiple classes of patients","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Disaster Response and Management","field":"Health Professions","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; Université du Québec à Montréal; Université de Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Operations research; Mathematical optimization; Mathematics","score_opus":0.1376064670355106,"score_gpt":0.5138328959489618,"score_spread":0.37622642891345115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411859452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5241879,0.00015899059,0.46618178,0.0013448849,0.00016906761,0.00061801064,0.00069949985,0.0005216246,0.006118201],"genre_scores_gemma":[0.9773027,0.000049907158,0.018063236,0.000074211675,0.000060614766,0.00015950778,0.00023997785,0.00002527426,0.0040247426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997601,0.00058180245,0.00008514584,0.00059416925,0.0003024039,0.00083546725],"domain_scores_gemma":[0.993487,0.003772685,0.00072433136,0.00037614512,0.0005678411,0.0010719093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002855213,0.0009538034,0.002175732,0.0007710805,0.001484962,0.0016503101,0.0031800263,0.0018746894,0.0091896765],"category_scores_gemma":[0.0065538283,0.0015098203,0.0015891735,0.0011155615,0.0014186848,0.001788759,0.0022834495,0.0018355778,0.00046535477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004798279,0.00014448634,0.0029881792,0.000035135774,0.000043595974,0.00015930252,0.000097636235,0.9843413,0.00041236827,0.0031975857,0.00060533016,0.0074951923],"study_design_scores_gemma":[0.000032870903,0.00015990241,0.0009816568,0.0000037771317,0.000018953719,0.000028862463,0.00007880921,0.9959798,0.00017756931,0.002383864,0.00014120722,0.000012736131],"about_ca_topic_score_codex":0.015300965,"about_ca_topic_score_gemma":0.016063357,"teacher_disagreement_score":0.015300965,"about_ca_system_score_codex":0.0017454231,"about_ca_system_score_gemma":0.0023241055,"threshold_uncertainty_score":0.030742466},"labels":[],"label_agreement":null},{"id":"W4412447457","doi":"10.1016/j.cor.2025.107200","title":"Solving multi-stage stochastic facility location problems with modular capacity adjustments","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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","funders":"Norges Forskningsråd","keywords":"Modular design; Stage (stratigraphy); Facility location problem; Computer science; Mathematical optimization; Operations research; Operations management; Mathematics; Programming language","score_opus":0.14729674780298802,"score_gpt":0.3423628606192774,"score_spread":0.19506611281628938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412447457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121836804,0.00026048644,0.8730199,0.00047005466,0.0000644126,0.00020199078,0.0002941921,0.0002320204,0.003620157],"genre_scores_gemma":[0.8457922,0.0002640902,0.14978118,0.000104886145,0.000054893473,0.00040132823,0.00028678475,0.000080443846,0.0032342551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875355,0.0005831922,0.00004251167,0.00023364836,0.00012773543,0.00025934685],"domain_scores_gemma":[0.9967945,0.002271655,0.00041640777,0.00013540444,0.00018548498,0.00019651992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026055821,0.001377852,0.001881311,0.0006655777,0.0006619939,0.0014073229,0.0018825603,0.0021679848,0.004129275],"category_scores_gemma":[0.0046317773,0.0015457099,0.0019527468,0.0011547959,0.00093047693,0.0014573463,0.0013722688,0.0017703132,0.00024741303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021931686,0.000014197305,0.00012842788,0.000018853825,0.000012788626,0.000029544213,0.000007728228,0.99672866,0.00020057004,0.0013667354,0.00008605055,0.0013844825],"study_design_scores_gemma":[0.000016502792,0.000040678697,0.000097126875,0.0000033396361,0.000007269512,0.000008155712,0.000010522516,0.9976102,0.00019744542,0.0018761939,0.00012749845,0.0000050838844],"about_ca_topic_score_codex":0.010386177,"about_ca_topic_score_gemma":0.008981299,"teacher_disagreement_score":0.010386177,"about_ca_system_score_codex":0.0016066373,"about_ca_system_score_gemma":0.0023158875,"threshold_uncertainty_score":0.0206514},"labels":[],"label_agreement":null},{"id":"W4412453266","doi":"10.1016/j.cor.2025.107197","title":"Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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é du Québec à Montréal; Université Laval; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Knapsack problem; Mathematics; Binary number; Continuous knapsack problem; Quadratic equation; Mathematical optimization; Upper and lower bounds; Combinatorics; Binary decision diagram; Cutting stock problem; Change-making problem; Combinatorial optimization; Computer science; Optimization problem; Algorithm; Arithmetic","score_opus":0.03809884161290548,"score_gpt":0.35120122906223544,"score_spread":0.31310238744932994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412453266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012748669,0.0018213422,0.9728919,0.0004939819,0.00016048811,0.00010690558,0.00031381976,0.00060675055,0.010856017],"genre_scores_gemma":[0.3455738,0.0028177225,0.6436001,0.00047988954,0.00022008545,0.00044610022,0.001210798,0.0005990947,0.0050524166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995336,0.0014714936,0.00023513638,0.0006160412,0.0018552552,0.00048604122],"domain_scores_gemma":[0.9891261,0.0084295925,0.0006059807,0.0006714187,0.0008837811,0.00028326406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036654999,0.001892378,0.001470182,0.0026015292,0.0010595617,0.004028234,0.0014724882,0.0015450558,0.009269099],"category_scores_gemma":[0.02067276,0.0011225957,0.0017541694,0.002728568,0.0014986665,0.003971117,0.0026584917,0.0041331635,0.0016110912],"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.00019524219,0.00020124167,0.0009384879,0.00064588676,0.00006358935,0.00009218427,0.00013767705,0.6984978,0.002787979,0.16266578,0.006263652,0.12751059],"study_design_scores_gemma":[0.00002884379,0.000054002947,0.00015622635,0.00011822784,0.000021452533,0.00004209317,0.000032349046,0.8973825,0.0015431712,0.09564391,0.00495744,0.000019773386],"about_ca_topic_score_codex":0.004106933,"about_ca_topic_score_gemma":0.0057785427,"teacher_disagreement_score":0.009269099,"about_ca_system_score_codex":0.0024784612,"about_ca_system_score_gemma":0.003700779,"threshold_uncertainty_score":0.031008184},"labels":[],"label_agreement":null},{"id":"W4412548904","doi":"10.1016/j.cor.2025.107204","title":"Augmentation search for integer programming over a polyhedron","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"HEC Montréal","keywords":"Polyhedron; Integer programming; Computer science; Integer (computer science); Mathematical optimization; Combinatorics; Mathematics; Algorithm; Programming language","score_opus":0.04432721795173738,"score_gpt":0.38515818390302503,"score_spread":0.34083096595128765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412548904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009223139,0.0002371762,0.9793631,0.00019083342,0.000052725252,0.000062375104,0.0000589928,0.00027527855,0.010536451],"genre_scores_gemma":[0.2730023,0.00038394122,0.7194792,0.00017317607,0.00008174019,0.00042172402,0.00023876494,0.00024095821,0.005978142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934286,0.00034782742,0.000021546384,0.00008227851,0.0001458155,0.000059630922],"domain_scores_gemma":[0.99897397,0.0008109065,0.00005941305,0.000057827856,0.000059424045,0.00003841457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013397391,0.0008890649,0.0011671269,0.0005737126,0.00047552443,0.0014933172,0.0008736157,0.0010109701,0.004903644],"category_scores_gemma":[0.0037030303,0.0006575866,0.0008730968,0.00076802354,0.0015184538,0.0014897698,0.001777443,0.002105001,0.0008262423],"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.00009438389,0.000064849795,0.00016381475,0.00014636025,0.000021160291,0.00006252802,0.000056995155,0.8217729,0.0009835693,0.14266814,0.0014781876,0.03248714],"study_design_scores_gemma":[0.000013202027,0.000027611306,0.000013878661,0.0000123723985,0.000002323694,0.00000895866,0.000007671223,0.97158086,0.00018411601,0.027149256,0.0009961542,0.000003537781],"about_ca_topic_score_codex":0.0013318318,"about_ca_topic_score_gemma":0.0014594614,"teacher_disagreement_score":0.004903644,"about_ca_system_score_codex":0.0007497643,"about_ca_system_score_gemma":0.0012014626,"threshold_uncertainty_score":0.01640433},"labels":[],"label_agreement":null},{"id":"W4412628055","doi":"10.1016/j.cor.2025.107206","title":"Optimization of drone base station locations and mobile charging drone routing for post-disaster communication","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"UAV Applications and Optimization","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":"Drone; Base station; Computer science; Routing (electronic design automation); Base (topology); Computer network; Real-time computing; Mathematics","score_opus":0.021772094867537083,"score_gpt":0.3224385818401905,"score_spread":0.3006664869726534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412628055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32929868,0.00090468465,0.65343744,0.0006931174,0.00015136224,0.0003016989,0.0004789779,0.00043721538,0.014296827],"genre_scores_gemma":[0.9501199,0.00021684502,0.04668352,0.000046485482,0.000013506712,0.00008562147,0.00021210643,0.000036929505,0.0025850637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.000138002,0.000012209735,0.00007295576,0.00005430419,0.000103463055],"domain_scores_gemma":[0.99933475,0.00036911207,0.00009285996,0.000034385394,0.00009379718,0.00007512166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006155531,0.0012062042,0.00093721465,0.00091258634,0.00064427574,0.0011096172,0.001136537,0.0011727627,0.0028801074],"category_scores_gemma":[0.0021369015,0.0006169045,0.00062405056,0.000989411,0.00061358034,0.0010923637,0.0007285418,0.00074686337,0.0003044658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023366687,0.000015443331,0.00034849832,0.000017659428,0.000009730556,0.000038045036,0.000013966358,0.994406,0.00040737478,0.00092055515,0.00027977134,0.0035195856],"study_design_scores_gemma":[0.000009074514,0.000034064644,0.0002254734,0.0000037338461,0.000006709255,0.000019428175,0.00006657358,0.9983516,0.00024170442,0.00072311854,0.000313524,0.0000050227623],"about_ca_topic_score_codex":0.0123242885,"about_ca_topic_score_gemma":0.012559246,"teacher_disagreement_score":0.0123242885,"about_ca_system_score_codex":0.0013522485,"about_ca_system_score_gemma":0.0013358333,"threshold_uncertainty_score":0.024505079},"labels":[],"label_agreement":null},{"id":"W4412629945","doi":"10.1016/j.cor.2025.107201","title":"The integrated planning of berth allocation, quay crane assignment, and pilotage scheduling","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Maritime Ports and Logistics","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":"HEC Montréal","funders":"Shanghai Education Development Foundation; Shanghai Municipal Education Commission; National Natural Science Foundation of China","keywords":"Scheduling (production processes); Pilotage; Operations research; Computer science; Integrated business planning; Mathematical optimization; Mathematics; Business","score_opus":0.04434000772648457,"score_gpt":0.3473381982134032,"score_spread":0.3029981904869187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412629945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062435783,0.00055968994,0.92509073,0.00039623518,0.00008868266,0.00018564422,0.00025322175,0.00044923573,0.010540793],"genre_scores_gemma":[0.81236213,0.0005272099,0.17777786,0.000059643473,0.00009045249,0.00019912602,0.00029655333,0.000092409246,0.008594686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912065,0.0002846892,0.00002414984,0.00014955553,0.00023615858,0.00018472012],"domain_scores_gemma":[0.9992949,0.00037180725,0.00006676414,0.000051001123,0.00013369643,0.0000818991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010724769,0.0007208102,0.0013485401,0.0008499086,0.0007381461,0.0019393113,0.0011289578,0.00085239,0.0033121333],"category_scores_gemma":[0.0024596632,0.0011376761,0.00076070864,0.0016575253,0.0008322591,0.0018504946,0.0010753147,0.0013489261,0.0003204366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011805716,0.00007284981,0.0006399468,0.000038396327,0.00002909953,0.000037828602,0.00004411836,0.9564958,0.000903229,0.0070230267,0.0007083852,0.033889256],"study_design_scores_gemma":[0.000008410402,0.00004735661,0.00030242704,0.0000027970568,0.000010252217,0.000006458061,0.0000121871,0.9968214,0.00032079793,0.0020096314,0.00045382424,0.000004489425],"about_ca_topic_score_codex":0.06708032,"about_ca_topic_score_gemma":0.072702944,"teacher_disagreement_score":0.06708032,"about_ca_system_score_codex":0.0017449231,"about_ca_system_score_gemma":0.006263981,"threshold_uncertainty_score":0.13337976},"labels":[],"label_agreement":null},{"id":"W4412867021","doi":"10.1016/j.cor.2025.107212","title":"The integrated agile Earth observation satellite scheduling problem","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Satellite Communication Systems","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":"Natural Sciences and Engineering Research Council of Canada; Fundação de Apoio à Pesquisa do Estado da Paraíba; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Earth observation satellite; Agile software development; Computer science; Satellite; Scheduling (production processes); Earth observation; Remote sensing; Operations research; Mathematical optimization; Geology; Aerospace engineering; Software engineering; Mathematics; Engineering","score_opus":0.07915320845051363,"score_gpt":0.352433178306015,"score_spread":0.2732799698555014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412867021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118120775,0.0009685795,0.8571117,0.0015452768,0.00023030913,0.00040750785,0.0021977017,0.0004798247,0.01893827],"genre_scores_gemma":[0.71449333,0.0014121362,0.27094314,0.000280581,0.00025434417,0.00052488816,0.0020892143,0.00014937842,0.009853004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929786,0.00024220499,0.00002815462,0.00018729595,0.00009784492,0.00014673393],"domain_scores_gemma":[0.9992112,0.00049208314,0.00010637783,0.0000414857,0.00006076865,0.00008807265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007390643,0.0010825146,0.00092283543,0.0004459953,0.00048240737,0.0010287797,0.0010223726,0.0009256878,0.0042997124],"category_scores_gemma":[0.0014889189,0.00039057428,0.0006499782,0.0011781881,0.00041430272,0.0011815194,0.00085997954,0.0010245177,0.0003681033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002124091,0.00017399828,0.0012404106,0.00024403085,0.00008856166,0.0003008816,0.00008545384,0.9028326,0.0018687224,0.029906003,0.007159628,0.055887252],"study_design_scores_gemma":[0.00008571728,0.00014885895,0.000574779,0.000018078093,0.000033752465,0.00018291044,0.00011101551,0.9675784,0.0009103007,0.023581343,0.0067619323,0.000012980829],"about_ca_topic_score_codex":0.004250823,"about_ca_topic_score_gemma":0.0026778842,"teacher_disagreement_score":0.0042997124,"about_ca_system_score_codex":0.0007248275,"about_ca_system_score_gemma":0.0018217561,"threshold_uncertainty_score":0.014383912},"labels":[],"label_agreement":null},{"id":"W4413001286","doi":"10.1016/j.cor.2025.107228","title":"Sustainable risk mitigation in hazardous material transportation","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Hazardous waste; Computer science; Risk analysis (engineering); Business; Environmental science; Waste management; Engineering","score_opus":0.06153004030884092,"score_gpt":0.4426146721567795,"score_spread":0.3810846318479386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413001286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16918622,0.006389392,0.7839737,0.0025126478,0.00016404378,0.0002685569,0.00017177925,0.0002015471,0.03713212],"genre_scores_gemma":[0.9429795,0.0025013944,0.05036333,0.000096284886,0.00004717611,0.00013225341,0.00008337794,0.000029380917,0.0037672818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990652,0.0004515229,0.000026040703,0.00008985812,0.00024261484,0.0001246945],"domain_scores_gemma":[0.9992093,0.0004446555,0.0001399563,0.000051153693,0.00010479333,0.00005012097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127348,0.0007026597,0.00047248654,0.0008895353,0.0004895495,0.0014440282,0.00090966246,0.0009639068,0.0014151657],"category_scores_gemma":[0.0017686364,0.00025427784,0.00068972626,0.0008400181,0.0010891774,0.0010302656,0.0014835283,0.00065006455,0.00015498341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030742114,0.00006819785,0.000985154,0.00016449598,0.000066060675,0.00025069012,0.00010371496,0.89722407,0.0020030362,0.06801259,0.0010399943,0.030051345],"study_design_scores_gemma":[0.00002274443,0.00020928915,0.0012283059,0.00013940268,0.000050243,0.00022115228,0.00059825066,0.76909095,0.0029768096,0.21400772,0.011416807,0.000038374328],"about_ca_topic_score_codex":0.0025733795,"about_ca_topic_score_gemma":0.002479618,"teacher_disagreement_score":0.0025733795,"about_ca_system_score_codex":0.0012837718,"about_ca_system_score_gemma":0.0021022614,"threshold_uncertainty_score":0.009314418},"labels":[],"label_agreement":null},{"id":"W4413640807","doi":"10.1016/j.cor.2025.107226","title":"Green horizons: Sustainable global logistics in dynamic supply chain management","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","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":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Supply chain management; Business; Computer science; Operations research; Mathematics; Marketing","score_opus":0.021546759198398945,"score_gpt":0.3326148025001318,"score_spread":0.3110680433017329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413640807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008093681,0.003979703,0.95913464,0.0032044912,0.0004464441,0.00011602661,0.00029863775,0.00065664755,0.02406972],"genre_scores_gemma":[0.48849288,0.014844552,0.47130987,0.0012650756,0.00064047537,0.0004139953,0.0012903467,0.0004269103,0.021315938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993137,0.00027142325,0.000023762323,0.00011700273,0.00020281356,0.000071357805],"domain_scores_gemma":[0.9994816,0.00021547516,0.00007571843,0.00007223809,0.000081047845,0.000073905045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927362,0.0010452853,0.0006153751,0.0008549274,0.00060806173,0.0025690943,0.0012880027,0.0013792365,0.0055906833],"category_scores_gemma":[0.0017844731,0.00047279583,0.0008609536,0.0022575282,0.0013819094,0.0034582138,0.00291993,0.001989099,0.000853192],"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.00005370156,0.000043290227,0.00055485417,0.00029507928,0.0000539159,0.00018374226,0.00010330359,0.62503606,0.001592948,0.26655883,0.009202564,0.096321784],"study_design_scores_gemma":[0.000016340051,0.000053909756,0.00020164986,0.00009993613,0.000020526408,0.000071455266,0.000110979,0.70463157,0.00093175017,0.25142002,0.042413246,0.000028601151],"about_ca_topic_score_codex":0.0040809917,"about_ca_topic_score_gemma":0.0042237886,"teacher_disagreement_score":0.0055906833,"about_ca_system_score_codex":0.0017610966,"about_ca_system_score_gemma":0.002353534,"threshold_uncertainty_score":0.018702686},"labels":[],"label_agreement":null},{"id":"W4413786636","doi":"10.1016/j.cor.2025.107253","title":"Drone-aided mobile blood collection problem: A rolling-horizon-based matheuristic","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Drone; Computer science; Horizon; Mathematical optimization; Operations research; Mathematics","score_opus":0.01589191721062148,"score_gpt":0.30295481783809924,"score_spread":0.28706290062747775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413786636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12399762,0.0013049438,0.85094017,0.0021026428,0.00025278656,0.00032370214,0.00081754656,0.0004982659,0.019762395],"genre_scores_gemma":[0.92226803,0.000373946,0.06874051,0.00027512884,0.00011162837,0.00020386903,0.00044384305,0.000081134574,0.007501997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.0001789701,0.00002081737,0.00017665594,0.000112104986,0.00013359537],"domain_scores_gemma":[0.9985812,0.00096412824,0.00013454224,0.000049386552,0.00014431372,0.0001264954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011323673,0.0012469717,0.0022759095,0.0006998762,0.0006846299,0.0018519829,0.0015723783,0.0028285552,0.006255311],"category_scores_gemma":[0.0027389978,0.0007391467,0.000908381,0.00055323535,0.0010722899,0.0012900259,0.0016441357,0.0014430713,0.0004245992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014456098,0.000045823395,0.0003198258,0.00007825503,0.000020602543,0.000090632864,0.000030630057,0.9898545,0.0004589683,0.0017889485,0.0008712276,0.0062959786],"study_design_scores_gemma":[0.00001992002,0.000046960435,0.00012002178,0.0000069875114,0.000006455487,0.0000129206865,0.00002144959,0.99856347,0.00012288091,0.0008830929,0.00019143337,0.000004482473],"about_ca_topic_score_codex":0.017598353,"about_ca_topic_score_gemma":0.008851684,"teacher_disagreement_score":0.017598353,"about_ca_system_score_codex":0.0011272636,"about_ca_system_score_gemma":0.002043452,"threshold_uncertainty_score":0.03499186},"labels":[],"label_agreement":null},{"id":"W4414107824","doi":"10.1016/j.cor.2025.107279","title":"Q-learning-based hyper-heuristic algorithm for open dimension irregular packing problems","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","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 Manitoba","funders":"Hebei Provincial Department of Bureau of Science and Technology; National Natural Science Foundation of China","keywords":"Heuristic; Dimension (graph theory); Packing problems; Selection (genetic algorithm); Adaptability; Population; Computational complexity theory; Encoding (memory)","score_opus":0.047784255853116964,"score_gpt":0.34817794217181824,"score_spread":0.3003936863187013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414107824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020470265,0.00064319716,0.97410834,0.0003426873,0.00013780137,0.0001216014,0.00007715065,0.00048372807,0.003615301],"genre_scores_gemma":[0.43505007,0.00045237708,0.55741096,0.00061436737,0.00016546928,0.000483865,0.0003915621,0.000207667,0.005223587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991499,0.000352437,0.00004704608,0.00012258088,0.00018973826,0.00013828759],"domain_scores_gemma":[0.99653804,0.0022596323,0.00019459566,0.00018405648,0.0006448586,0.00017885599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022116832,0.00081194984,0.0021960272,0.0014835402,0.00086639205,0.0012047568,0.0025789777,0.0021234239,0.005789552],"category_scores_gemma":[0.00574157,0.0007548612,0.000933654,0.001787605,0.0012419849,0.0013591322,0.0017600777,0.001855557,0.00074591767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017492053,0.00015653076,0.00061577314,0.00011517774,0.000051100844,0.000050379174,0.000051425115,0.89367014,0.0006183916,0.0096561145,0.0028874292,0.09195272],"study_design_scores_gemma":[0.000018991435,0.000022272628,0.00003950752,0.0000054275483,0.000004086611,0.000005794657,0.0000048491956,0.997136,0.00007860006,0.002508252,0.00017350119,0.0000028152838],"about_ca_topic_score_codex":0.010537928,"about_ca_topic_score_gemma":0.007200292,"teacher_disagreement_score":0.010537928,"about_ca_system_score_codex":0.0013456041,"about_ca_system_score_gemma":0.0029436483,"threshold_uncertainty_score":0.020953178},"labels":[],"label_agreement":null},{"id":"W4414413940","doi":"10.1016/j.cor.2025.107284","title":"A novel mathematical model for the scheduling of a zero inventory production: an application of process scheduling in fog computing","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","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":"Toronto Metropolitan University; Systems, Applications & Products in Data Processing (Canada)","funders":"Ryerson University; Canada Research Chairs; Toronto Metropolitan University","keywords":"Scheduling (production processes); Outsourcing; Linear programming; Job shop scheduling; Integer programming; Process (computing); Production (economics)","score_opus":0.06993947810367439,"score_gpt":0.37732169583345293,"score_spread":0.30738221772977853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414413940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076542646,0.0003380495,0.9853597,0.00041965113,0.00016772994,0.000049402894,0.00009202385,0.00008337139,0.0058357744],"genre_scores_gemma":[0.7634487,0.0018779578,0.21813297,0.00049771304,0.000385273,0.00034273945,0.00023305116,0.00016654382,0.014915085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958867,0.00009843691,0.000016043261,0.00009790859,0.000110838046,0.00008812171],"domain_scores_gemma":[0.9995684,0.00022045127,0.00005638933,0.000022864995,0.000089906374,0.000042006945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008930086,0.0010896423,0.001442543,0.0006771678,0.00089531875,0.0020340327,0.0025951676,0.002051256,0.0024043394],"category_scores_gemma":[0.001901919,0.00060050975,0.0012761573,0.0014467178,0.001115748,0.0017424595,0.0010283926,0.0017843796,0.0003695463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021297088,0.00003219029,0.00012578141,0.000060782746,0.000018924924,0.00009890922,0.000046219426,0.9164917,0.0012484526,0.07613831,0.0015091021,0.0042082947],"study_design_scores_gemma":[0.0000023386362,0.0000050322355,0.000021096743,0.0000024832839,0.0000034993873,0.000008983593,0.0000032084756,0.99457777,0.000053691827,0.004996755,0.0003221743,0.000002959309],"about_ca_topic_score_codex":0.01475008,"about_ca_topic_score_gemma":0.009725411,"teacher_disagreement_score":0.01475008,"about_ca_system_score_codex":0.001850965,"about_ca_system_score_gemma":0.0024044756,"threshold_uncertainty_score":0.029328465},"labels":[],"label_agreement":null},{"id":"W4414807889","doi":"10.1016/j.cor.2025.107264","title":"Mitigating choice model ambiguity: A consensus framework and its application to assortment optimization","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Ambiguity; Context (archaeology); Set (abstract data type); Boosting (machine learning); Choice set; Quality (philosophy); Variety (cybernetics); Fraction (chemistry)","score_opus":0.060081903283872015,"score_gpt":0.3544947405894256,"score_spread":0.29441283730555357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414807889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006931031,0.0001768165,0.9908552,0.00037831484,0.000025954509,0.000044385128,0.00003472554,0.00006522051,0.0014883166],"genre_scores_gemma":[0.6371926,0.00080314995,0.3569644,0.00033238516,0.0002444181,0.00044065726,0.0002177779,0.00013684762,0.00366776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99198747,0.0049246037,0.0002792613,0.0010241271,0.0013714468,0.00041304828],"domain_scores_gemma":[0.9752578,0.018191073,0.0020441634,0.001329728,0.0023758663,0.0008013117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015537251,0.0018019163,0.0028515405,0.0024771271,0.001234053,0.0022182474,0.0024341203,0.0024959785,0.0036490664],"category_scores_gemma":[0.03981558,0.00078565616,0.0023316527,0.0018972893,0.0030314282,0.0034204342,0.0036656011,0.0033690182,0.00046207098],"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.000060011083,0.000059073427,0.0005641696,0.00007567151,0.00009809558,0.00006666242,0.000098846765,0.8810063,0.00046340039,0.09751708,0.0006276836,0.019363035],"study_design_scores_gemma":[0.000008615926,0.000038913266,0.00007403769,0.000010721711,0.000010011983,0.000008651198,0.000013764876,0.95323485,0.00012853244,0.046199325,0.00026099046,0.000011602645],"about_ca_topic_score_codex":0.004871734,"about_ca_topic_score_gemma":0.0023970022,"teacher_disagreement_score":0.015537251,"about_ca_system_score_codex":0.0022182148,"about_ca_system_score_gemma":0.0029579042,"threshold_uncertainty_score":0.08216977},"labels":[],"label_agreement":null},{"id":"W4414807895","doi":"10.1016/j.cor.2025.107295","title":"On-demand meal delivery: Drone scheduling with battery replacement optimization","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"UAV Applications and Optimization","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":"Memorial University of Newfoundland","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; Shenzhen Polytechnic","keywords":"Drone; Battery (electricity); Scheduling (production processes); Context (archaeology); Downtime; Integer programming; Variable (mathematics); Variable neighborhood search","score_opus":0.018023098467767527,"score_gpt":0.29100483508361025,"score_spread":0.27298173661584274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414807895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16698584,0.0014191113,0.8069338,0.0009792359,0.0004968104,0.0003524906,0.0005926185,0.00083126914,0.021408793],"genre_scores_gemma":[0.95799124,0.00020862758,0.036750037,0.00010439366,0.00009142696,0.00008661746,0.00017454775,0.00012544896,0.0044676727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956053,0.00017143332,0.000013254499,0.00007036811,0.000060164297,0.0001242844],"domain_scores_gemma":[0.99930835,0.0003958644,0.00006538615,0.0000483138,0.00008503971,0.000097058764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010534428,0.0012551593,0.0021719579,0.00055068533,0.0005792497,0.001285027,0.0015711781,0.0012732265,0.0062220325],"category_scores_gemma":[0.0024223893,0.00079210155,0.00066520704,0.0007692783,0.00052233384,0.0012910559,0.0010110443,0.001363804,0.00053681515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024117618,0.000062052684,0.00020079048,0.00006156051,0.000026478008,0.00004636473,0.000024318355,0.98594713,0.00048263598,0.0014602902,0.0012919878,0.01015518],"study_design_scores_gemma":[0.000021380936,0.000048643502,0.00009598431,0.0000035186329,0.000006453341,0.000009120584,0.000015018468,0.99865615,0.00014500388,0.00078826945,0.00020679414,0.000003658876],"about_ca_topic_score_codex":0.008306496,"about_ca_topic_score_gemma":0.007022644,"teacher_disagreement_score":0.008306496,"about_ca_system_score_codex":0.0008380645,"about_ca_system_score_gemma":0.0012513513,"threshold_uncertainty_score":0.020814776},"labels":[],"label_agreement":null},{"id":"W4415746821","doi":"10.1016/j.cor.2025.107303","title":"Workload balancing for flight dispatchers","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Air Traffic Management and Optimization","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workload; Lagrangian relaxation; Genetic algorithm; Heuristic; Workstation; Upper and lower bounds; Work (physics)","score_opus":0.025002603721596958,"score_gpt":0.3292186793837672,"score_spread":0.30421607566217024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415746821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77276164,0.000975561,0.19761534,0.002141301,0.0002494274,0.0004235846,0.00066751346,0.0005869608,0.02457862],"genre_scores_gemma":[0.96734023,0.00014473422,0.030373985,0.000087895736,0.00005461584,0.00008226386,0.00024976442,0.00006659085,0.0015998792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989868,0.0003720618,0.00003891414,0.00015982833,0.00016659283,0.00027577748],"domain_scores_gemma":[0.998914,0.00050650403,0.00018132741,0.00008702384,0.0001532627,0.00015792056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014443508,0.00085653627,0.0005740665,0.0005226399,0.00075405487,0.0016290614,0.0011823379,0.0009518521,0.0037305027],"category_scores_gemma":[0.0035413594,0.00032673,0.00051311386,0.0005561114,0.0004814289,0.0013683047,0.0007217399,0.00073718856,0.0003632256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002849518,0.00024704164,0.0047080517,0.00018082693,0.000058705344,0.0002472455,0.00015279639,0.92760426,0.007077045,0.0070201,0.005223985,0.04719495],"study_design_scores_gemma":[0.00007031024,0.00016297356,0.0021508245,0.000027150063,0.000017990575,0.00009721847,0.00029420754,0.98712176,0.001978116,0.0049678707,0.0030962187,0.000015406978],"about_ca_topic_score_codex":0.0059804404,"about_ca_topic_score_gemma":0.0053833243,"teacher_disagreement_score":0.0059804404,"about_ca_system_score_codex":0.0011736131,"about_ca_system_score_gemma":0.0015608468,"threshold_uncertainty_score":0.012479782},"labels":[],"label_agreement":null},{"id":"W4416396695","doi":"10.1016/j.cor.2025.107330","title":"International travel time prediction for China–Europe Express trains via interpretable deep learning models","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Railway Systems and Energy Efficiency","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":"University of Alberta","funders":"National Natural Science Foundation of China; China Railway","keywords":"Interpretability; Train; Deep learning; Mechanism (biology); Dual (grammatical number); Process (computing); Transfer of learning","score_opus":0.02463949121770068,"score_gpt":0.28290721556018783,"score_spread":0.2582677243424871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416396695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96049345,0.00035531545,0.031366378,0.00044425,0.00015169299,0.000014991564,0.0023121622,0.0006358206,0.004225927],"genre_scores_gemma":[0.9922989,0.000059317594,0.0021268365,0.000019751604,0.000017842674,0.0000077985815,0.002394555,0.000032829,0.0030420672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988914,0.000012291662,0.000004508372,0.00003815247,0.000014295693,0.000041538915],"domain_scores_gemma":[0.99973387,0.000065712244,0.00003329134,0.000023572382,0.0000994661,0.00004407161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003772396,0.0006553852,0.00030205335,0.0009900989,0.00028279042,0.0006192579,0.00054790184,0.0005158082,0.0023223183],"category_scores_gemma":[0.00089256413,0.0002552426,0.0005853681,0.00096851325,0.00019022841,0.0007312322,0.00046742227,0.0009103635,0.0007386263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037548383,0.00021199243,0.045874443,0.00003614743,0.00011893683,0.000111641115,0.00005687776,0.8836142,0.001256979,0.0016996401,0.0074506784,0.059192948],"study_design_scores_gemma":[0.0000034959894,0.00000725964,0.003596438,0.0000025433571,0.000010828484,0.0000026816929,0.000014105199,0.995565,0.00025605367,0.00028133075,0.0002561299,0.0000040758946],"about_ca_topic_score_codex":0.10088914,"about_ca_topic_score_gemma":0.08325119,"teacher_disagreement_score":0.10088914,"about_ca_system_score_codex":0.0010966104,"about_ca_system_score_gemma":0.0010167083,"threshold_uncertainty_score":0.20060378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037970208,0.0003958292,0.9561217,0.00029246073,0.0002093402,0.00020726214,0.00019844332,0.00051206135,0.004092677],"genre_scores_gemma":[0.60208833,0.00023383062,0.39344937,0.00020221132,0.00009830831,0.0003878292,0.00036386066,0.00016128104,0.0030149936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994759,0.00012999507,0.00002757256,0.000090354886,0.00014668494,0.00012960873],"domain_scores_gemma":[0.9985654,0.0009035048,0.000103498896,0.00008733645,0.00021349112,0.00012686926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012850428,0.0007825054,0.0014270508,0.0009591906,0.00056241604,0.0012195581,0.0019661991,0.0013730655,0.0034591933],"category_scores_gemma":[0.0027397743,0.0008163579,0.0008597465,0.0011439812,0.00061496877,0.0012882395,0.0011684196,0.0011548344,0.0004369523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015737976,0.000110532135,0.00020841042,0.00006138022,0.000031354313,0.000045954654,0.000024504334,0.94935834,0.0010397303,0.0050989296,0.0010466032,0.042816922],"study_design_scores_gemma":[0.00002889044,0.00002830224,0.00003209756,0.0000043631103,0.0000065789336,0.0000062468876,0.0000060123016,0.9978108,0.00019453578,0.0015999064,0.00027780898,0.0000044387307],"about_ca_topic_score_codex":0.006315615,"about_ca_topic_score_gemma":0.006792801,"teacher_disagreement_score":0.006315615,"about_ca_system_score_codex":0.0014389266,"about_ca_system_score_gemma":0.0027392947,"threshold_uncertainty_score":0.012557745},"labels":[],"label_agreement":null},{"id":"W4417046376","doi":"10.1016/j.cor.2025.107349","title":"A capacitated collection-and-delivery-point location problem with random utility maximizing customers","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Université du Québec à Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Secretaría de Educación Superior, Ciencia, Tecnología e Innovación; Escuela Superior Politécnica del Litoral","keywords":"Solver; Entropy (arrow of time); Benders' decomposition; Integer programming; Measure (data warehouse); Service provider; Linear programming; Decomposition","score_opus":0.047267024284560165,"score_gpt":0.2953305237480599,"score_spread":0.24806349946349973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417046376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20128596,0.0018745494,0.76366544,0.005354703,0.00035112625,0.0007738032,0.0027455282,0.00069155236,0.02325741],"genre_scores_gemma":[0.8803911,0.0009843168,0.08869411,0.0003878363,0.00028053953,0.0005983205,0.0010180008,0.00022028243,0.027425405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968972,0.0014014054,0.00012986077,0.0007787174,0.00030163804,0.00049111916],"domain_scores_gemma":[0.99289167,0.005193563,0.0006003987,0.00022624034,0.0005018548,0.00058625225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003846925,0.0018945092,0.004960082,0.0020110626,0.001307599,0.0048027937,0.0063330196,0.0068762936,0.009814329],"category_scores_gemma":[0.01065983,0.002970034,0.0018374475,0.005202088,0.0026180956,0.004647635,0.0030491045,0.0024226648,0.0011029725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031687168,0.00015413386,0.00051944185,0.00018377189,0.000069857844,0.00031324662,0.000073108815,0.968797,0.00045118033,0.01990487,0.0030591676,0.0061572813],"study_design_scores_gemma":[0.000102068116,0.00008744639,0.00016377914,0.000016267679,0.000029820367,0.00006283924,0.000057492816,0.9877181,0.00018258029,0.010994721,0.0005566831,0.000028081182],"about_ca_topic_score_codex":0.009682581,"about_ca_topic_score_gemma":0.006382672,"teacher_disagreement_score":0.009814329,"about_ca_system_score_codex":0.003987645,"about_ca_system_score_gemma":0.0023668907,"threshold_uncertainty_score":0.032832205},"labels":[],"label_agreement":null},{"id":"W4417136649","doi":"10.1016/j.cor.2025.107351","title":"An exact penalty method with nonmonotone line search and rapid infeasibility detection for constrained multiobjective optimization: Application in supervised machine learning","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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":"Artificial Intelligence in Medicine (Canada)","funders":"Iran National Science Foundation","keywords":"Line search; Penalty method; Convergence (economics); Constraint (computer-aided design); Quadratic programming; Sequential quadratic programming; Line (geometry); Quadratic equation","score_opus":0.03756761558015091,"score_gpt":0.3951614774180427,"score_spread":0.35759386183789177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417136649","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028408258,0.000060811624,0.996011,0.000040256367,0.000051372193,0.000042286072,0.000017752689,0.00022810875,0.00070741266],"genre_scores_gemma":[0.076394565,0.00007639261,0.9200265,0.000093373776,0.000041615578,0.00023468614,0.000080071215,0.00021214585,0.002840748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911886,0.0003362033,0.000053335538,0.00010153578,0.00034495557,0.000045106575],"domain_scores_gemma":[0.997678,0.001183972,0.00023838761,0.00023427047,0.00054510566,0.000120437864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016412642,0.0010769053,0.0011083896,0.0009228455,0.000416849,0.0008705341,0.0015198389,0.0014986235,0.005133938],"category_scores_gemma":[0.0047752378,0.0005958927,0.00055573386,0.0008652951,0.0007313323,0.0014178292,0.0013383873,0.0016079573,0.0011633133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049716455,0.00042315168,0.00079925446,0.00053825695,0.000106186824,0.00026094777,0.0001240323,0.50977,0.023682171,0.0371199,0.0066405134,0.42003846],"study_design_scores_gemma":[0.000013396849,0.000039923234,0.000058990114,0.0000059690788,0.0000027882513,0.000028560107,0.0000027438248,0.9971283,0.00089066854,0.0012629367,0.000557657,0.000008073722],"about_ca_topic_score_codex":0.0014091623,"about_ca_topic_score_gemma":0.002692965,"teacher_disagreement_score":0.005133938,"about_ca_system_score_codex":0.00036031377,"about_ca_system_score_gemma":0.0011735595,"threshold_uncertainty_score":0.01717472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012147662,0.00019121298,0.9846859,0.00012944944,0.000025485704,0.000087017455,0.00005726447,0.0003295814,0.002346359],"genre_scores_gemma":[0.33193058,0.0002595478,0.6641818,0.00011900748,0.00005593109,0.00036311088,0.00037997303,0.0001593131,0.0025507326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881184,0.0003533882,0.00005803436,0.00032364554,0.00027475037,0.00017830603],"domain_scores_gemma":[0.99782,0.0014387136,0.00024998997,0.00015826493,0.00022801496,0.000104943465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018940559,0.0014258723,0.0015931862,0.00085017836,0.00063430105,0.0013252269,0.0019136873,0.0015516469,0.0044169105],"category_scores_gemma":[0.004178151,0.00085915806,0.001131973,0.0012907443,0.00071984436,0.0016471698,0.0017943317,0.0017217319,0.00052686164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004753342,0.00005624496,0.0002162121,0.000044305598,0.00002526239,0.00003474964,0.000030184734,0.969362,0.00041829114,0.005596812,0.0004610763,0.023707284],"study_design_scores_gemma":[0.000018705041,0.000022570335,0.00004044379,0.0000030851327,0.0000058337255,0.000012159629,0.00000921554,0.99639916,0.00015313773,0.0030910864,0.00024159226,0.0000029599569],"about_ca_topic_score_codex":0.0068837088,"about_ca_topic_score_gemma":0.00778195,"teacher_disagreement_score":0.0068837088,"about_ca_system_score_codex":0.0012931431,"about_ca_system_score_gemma":0.0021427853,"threshold_uncertainty_score":0.014776051},"labels":[],"label_agreement":null},{"id":"W7081922727","doi":"10.1016/j.cor.2025.107282","title":"Optimizing high-tech product take-back schemes in a closed-loop supply chain","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","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":"Toronto Metropolitan University","funders":"Toronto Metropolitan University","keywords":"Profitability index; Production (economics); Product (mathematics); Sustainability; Supply chain; Competition (biology); Reverse logistics; Scalability","score_opus":0.044008188962321816,"score_gpt":0.3304627113716259,"score_spread":0.2864545224093041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081922727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5433288,0.00044686501,0.4410807,0.0006908187,0.000093541144,0.00083772495,0.00034940493,0.0009370575,0.012235138],"genre_scores_gemma":[0.9811195,0.00006497493,0.015820073,0.0000332242,0.000011917104,0.00008818868,0.00007404168,0.00002853331,0.0027595023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972445,0.0009162865,0.0001357374,0.0006164676,0.0003472717,0.0007397188],"domain_scores_gemma":[0.9922449,0.004939837,0.0008424433,0.0003643453,0.00095543393,0.00065313576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004128885,0.0014761504,0.0025335504,0.0013434433,0.0018067601,0.004599119,0.0028282607,0.0036165474,0.010336428],"category_scores_gemma":[0.008256462,0.0016920697,0.0008271017,0.0016801778,0.0016808066,0.003907352,0.002536637,0.0017315997,0.00109307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084306375,0.0003518531,0.0010260417,0.00010122574,0.000033548065,0.000107013824,0.00007143671,0.9742012,0.0017623191,0.0019915916,0.00041655113,0.019094137],"study_design_scores_gemma":[0.00008007086,0.00040518248,0.00036405044,0.000010384083,0.000025368601,0.000017082475,0.0000574528,0.99567646,0.00075452286,0.0024321526,0.0001633067,0.000013932459],"about_ca_topic_score_codex":0.010176817,"about_ca_topic_score_gemma":0.0061775106,"teacher_disagreement_score":0.010336428,"about_ca_system_score_codex":0.0026447754,"about_ca_system_score_gemma":0.0034200752,"threshold_uncertainty_score":0.0345788},"labels":[],"label_agreement":null},{"id":"W7083697720","doi":"10.1016/j.cor.2025.107292","title":"Dynamic crowdsourcing problem in urban–rural distribution using the learning-based approach","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban, Neighborhood, and Segregation Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Crowdsourcing; Heuristic; Markov decision process; Matching (statistics); Process (computing); Total revenue; Task (project management); Partially observable Markov decision process; Revenue","score_opus":0.06765207153934012,"score_gpt":0.40682485712426014,"score_spread":0.33917278558492003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083697720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14230044,0.0011135965,0.8422841,0.0029176632,0.00029826406,0.00046685568,0.00046038986,0.00023802556,0.009920697],"genre_scores_gemma":[0.9266088,0.00042122067,0.059864078,0.00028326924,0.00024910344,0.00030917604,0.00042375823,0.00008355642,0.011757117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820995,0.0006670925,0.000061090024,0.0004502119,0.00022331996,0.0003883324],"domain_scores_gemma":[0.9933468,0.0051761507,0.00035698412,0.00018899926,0.00043804958,0.00049296656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038038257,0.0013554095,0.0037721435,0.0018056133,0.002329054,0.0027657526,0.005191114,0.0038199357,0.0053359065],"category_scores_gemma":[0.008617234,0.0010456906,0.0018671206,0.0022346887,0.0021461586,0.003433198,0.0031711431,0.0018867905,0.0003110903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017710167,0.0001521366,0.0013888712,0.0001849883,0.000098214325,0.00021771976,0.00018587144,0.9566238,0.00035146484,0.021193957,0.0028021915,0.016623681],"study_design_scores_gemma":[0.000017153248,0.000018584036,0.00012276042,0.000006987214,0.000010649231,0.000011744625,0.0000594248,0.9908392,0.000051244333,0.008551126,0.00030334797,0.000007747332],"about_ca_topic_score_codex":0.028881023,"about_ca_topic_score_gemma":0.01655896,"teacher_disagreement_score":0.028881023,"about_ca_system_score_codex":0.0030541208,"about_ca_system_score_gemma":0.0025985036,"threshold_uncertainty_score":0.057425797},"labels":[],"label_agreement":null}]}