{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039615113,0.00059586635,0.9303202,0.018657615,0.0004803088,0.0035429138,0.00000815805,0.0007065983,0.006073211],"genre_scores_gemma":[0.85310197,0.00010656047,0.14383537,0.00011475418,0.00076703855,0.00048708398,0.00006547564,0.000069959824,0.0014518005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768376,0.00043429426,0.0003691354,0.00039482038,0.0005668673,0.00055113883],"domain_scores_gemma":[0.99866176,0.0002215831,0.000023394732,0.0005464949,0.00044457012,0.00010220553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021574164,0.00020046627,0.00016695532,0.00024924753,0.00086877716,0.00056691567,0.00044462417,0.00007332106,0.000056749628],"category_scores_gemma":[0.00014450627,0.00016613801,0.00004548418,0.00076070626,0.00006143968,0.0005618571,0.00015785499,0.00058197527,0.0003377693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004624568,0.000055214052,0.000026009551,0.000035575085,0.000039373626,0.000001474833,0.0020742912,0.9637348,0.008989297,0.0016980078,0.0126382485,0.010703065],"study_design_scores_gemma":[0.00029426962,0.00006606745,0.00059833704,0.00006985468,0.000009545399,0.000010033016,0.000082536666,0.9801699,0.0035282648,0.000095079646,0.014877047,0.0001990963],"about_ca_topic_score_codex":0.00006634624,"about_ca_topic_score_gemma":0.00012641595,"teacher_disagreement_score":0.8134869,"about_ca_system_score_codex":0.00049240544,"about_ca_system_score_gemma":0.0002225298,"threshold_uncertainty_score":0.6774911},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021126549,0.000041653395,0.97250265,0.015644096,0.00010104272,0.00028303175,0.000002813808,0.00007130225,0.011332262],"genre_scores_gemma":[0.013062037,0.0000677713,0.9745147,0.0015145503,0.006739919,0.0001624406,0.000024113324,0.000012632564,0.0039017866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785745,0.0007642581,0.00022475836,0.000465327,0.00043139327,0.00025679482],"domain_scores_gemma":[0.99836147,0.00058839604,0.000016855312,0.00049748213,0.0003672465,0.00016854107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013839514,0.000107186264,0.00014134648,0.00040631296,0.00060241146,0.0006382842,0.0006510543,0.00005389021,0.00032667213],"category_scores_gemma":[0.000110725145,0.00009664688,0.000047822086,0.0012669963,0.00009859371,0.00040155288,0.00031171556,0.0002622117,0.00054118026],"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.0000030793738,0.00009653808,0.0000055003693,0.000001349504,0.000017494362,4.627435e-7,0.0003594287,0.104999766,0.000016802174,0.5440397,0.007212404,0.34324744],"study_design_scores_gemma":[0.00012415562,0.000038498467,0.00016929659,0.0000027343283,0.0000027838457,0.0000032317027,0.000017492473,0.6523681,0.00008728198,0.0014379919,0.34566787,0.00008057028],"about_ca_topic_score_codex":0.0000116218,"about_ca_topic_score_gemma":0.0000074910226,"teacher_disagreement_score":0.54736835,"about_ca_system_score_codex":0.00008379001,"about_ca_system_score_gemma":0.00011045627,"threshold_uncertainty_score":0.6955958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8875475,0.00030786774,0.10389223,0.000098165496,0.0014883582,0.00041828176,0.0000050100607,0.00007763011,0.0061649545],"genre_scores_gemma":[0.9772507,0.000026464457,0.022366513,0.0000053145604,0.0002359677,0.000028049046,0.000008061163,0.00001588723,0.0000630621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998974,0.000052246625,0.00021617168,0.00013369902,0.00031735882,0.0003065159],"domain_scores_gemma":[0.99950117,0.000033232438,0.0000050987,0.00020252759,0.00016524064,0.00009271026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044658277,0.0000848017,0.0001382526,0.0002753735,0.000053454627,0.00006110957,0.00020256464,0.00004593172,0.000010620007],"category_scores_gemma":[0.000030077483,0.000083079176,0.000024843363,0.00035115832,0.00004992772,0.00013856974,0.00009166797,0.00025152625,0.000016190012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015668516,0.00002366087,0.00026060513,0.000015775178,0.000014364581,0.000021309075,0.0034060501,0.97536546,0.009085652,0.0011195808,0.003969184,0.0067027127],"study_design_scores_gemma":[0.0011885113,0.00022909792,0.0016226937,0.0001686465,0.0000029436392,0.000013743482,0.002662858,0.94689274,0.04261806,0.00012203477,0.0042353435,0.00024330126],"about_ca_topic_score_codex":0.00012925241,"about_ca_topic_score_gemma":0.00008909205,"teacher_disagreement_score":0.08970318,"about_ca_system_score_codex":0.00029158898,"about_ca_system_score_gemma":0.00007606348,"threshold_uncertainty_score":0.33878705},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88319606,0.000055285152,0.09626397,0.009197515,0.00032859392,0.0025402596,0.000014107056,0.0000479646,0.008356244],"genre_scores_gemma":[0.9942078,0.00001224177,0.004654402,0.0004528369,0.00013143815,0.0002779149,0.000048096794,0.000007948559,0.00020732403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998729,0.000074880125,0.0002623975,0.00022785738,0.00041281237,0.00029306422],"domain_scores_gemma":[0.998761,0.00008046177,0.000008417535,0.000401002,0.0007379676,0.000011139608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019609735,0.000078031946,0.00009204375,0.00036532088,0.00036988786,0.00016499427,0.00072014204,0.00002877254,0.00015083932],"category_scores_gemma":[0.00012350014,0.000061290695,0.000041374242,0.0013176834,0.00009658789,0.00056884304,0.0002751395,0.00016032938,0.0001308199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012582056,0.0014851555,0.0035720475,0.00084156566,0.000051265553,0.000005410646,0.014406997,0.37216976,0.00050411816,0.57827777,0.019926852,0.008633238],"study_design_scores_gemma":[0.00036771077,0.000036251753,0.026855065,0.000039304126,0.0000073419037,4.6593718e-7,0.004762755,0.9600968,0.000039291917,0.00037299597,0.0073094363,0.00011262989],"about_ca_topic_score_codex":0.007296684,"about_ca_topic_score_gemma":0.0038230745,"teacher_disagreement_score":0.587927,"about_ca_system_score_codex":0.000021555794,"about_ca_system_score_gemma":0.00004644189,"threshold_uncertainty_score":0.99931383},"labels":[],"label_agreement":null},{"id":"W1965882376","doi":"10.1016/j.cor.2013.08.016","title":"An adaptive large neighborhood search for a vehicle routing problem with multiple routes","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":183,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Operations research; Computer network; Mathematics","score_opus":0.04793811169959512,"score_gpt":0.336181081294404,"score_spread":0.2882429695948089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965882376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118853204,0.00004093297,0.8780819,0.00027585955,0.000058308065,0.0018230686,0.000025212736,0.00039022308,0.00045128362],"genre_scores_gemma":[0.62039495,0.0000039554848,0.3788465,0.000026819158,0.00011353369,0.00043459955,0.000047267196,0.000060672774,0.000071727605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750674,0.000417494,0.00030561493,0.000431734,0.00046276642,0.00087565795],"domain_scores_gemma":[0.9975402,0.00060075044,0.000011986489,0.00048000022,0.0011192346,0.000247825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014686998,0.00020074322,0.00021695375,0.00030397673,0.00082405633,0.00068991404,0.0004556966,0.00010366245,0.000054658685],"category_scores_gemma":[0.00008252114,0.00018511181,0.00004464507,0.0008439549,0.00008453708,0.0008378802,0.00011488696,0.0004897107,0.000070136506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017772181,0.00010821918,0.0024665317,0.000035212914,0.000050295104,0.0000014520947,0.0018882275,0.9772924,0.0043412186,0.003312479,0.00039544486,0.010090713],"study_design_scores_gemma":[0.0010172294,0.00040937675,0.0016382858,0.00005469389,0.0000050564568,0.0000037085047,0.000904181,0.9921572,0.0034341186,0.000046169054,0.00009431607,0.00023564977],"about_ca_topic_score_codex":0.00019639308,"about_ca_topic_score_gemma":0.00011962113,"teacher_disagreement_score":0.50154173,"about_ca_system_score_codex":0.0001795378,"about_ca_system_score_gemma":0.00013945595,"threshold_uncertainty_score":0.7548641},"labels":[],"label_agreement":null},{"id":"W1967987311","doi":"10.1016/j.cor.2010.01.004","title":"The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Galatasaray Üniversitesi","keywords":"Bounding overwatch; Minimum spanning tree; Tabu search; Spanning tree; Mathematics; Quadratic equation; k-minimum spanning tree; Heuristic; Mathematical optimization; Euclidean minimum spanning tree; Relaxation (psychology); Distributed minimum spanning tree; Local search (optimization); Algorithm; Kruskal's algorithm; Combinatorics; Computer science; Tree structure; Binary tree; Artificial intelligence","score_opus":0.0356672783289809,"score_gpt":0.36152426615279576,"score_spread":0.32585698782381484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967987311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46145228,0.0001403681,0.53544754,0.0008331046,0.0004904706,0.00082382077,0.000003325977,0.00024876508,0.00056035543],"genre_scores_gemma":[0.5878951,0.000022295071,0.41139385,0.000016509899,0.00027151318,0.000097151664,0.000010326209,0.00005140859,0.00024182709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977743,0.000370332,0.00030579267,0.00035944473,0.00056114985,0.00062898523],"domain_scores_gemma":[0.9984013,0.00048580187,0.000010242639,0.0004699593,0.00040517093,0.00022751288],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003257831,0.00016620728,0.0001478937,0.00027523967,0.0017373157,0.0013712826,0.00043175978,0.00010763323,0.00001434065],"category_scores_gemma":[0.00020994058,0.00013564108,0.00002985284,0.00078655157,0.00028712294,0.00022590603,0.00018170722,0.0010449376,0.000019637164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054798747,0.0000629436,0.000111749025,0.000050128227,0.0000263504,0.000009282191,0.003574192,0.9156355,0.009653236,0.0015941713,0.00044335664,0.068833575],"study_design_scores_gemma":[0.00023643885,0.000085435364,0.00033465412,0.000039663668,0.0000040887044,0.00003080897,0.00041538372,0.99746895,0.0006518,0.000035349658,0.00053932547,0.00015810056],"about_ca_topic_score_codex":0.000027983422,"about_ca_topic_score_gemma":0.0001553344,"teacher_disagreement_score":0.12644282,"about_ca_system_score_codex":0.00007954199,"about_ca_system_score_gemma":0.00017431969,"threshold_uncertainty_score":0.9996654},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5870599,0.000035422625,0.41239876,0.00001733136,0.00009463429,0.00022111634,0.0000016485521,0.000022983542,0.00014822152],"genre_scores_gemma":[0.9534179,0.000009738818,0.04635164,0.000006254432,0.00008997391,0.000096477204,0.000005428184,0.000013251118,0.000009329201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992497,0.000025575326,0.00015185667,0.00013478418,0.00016121568,0.00027686407],"domain_scores_gemma":[0.9995252,0.00005797979,0.0000025011532,0.00014631859,0.00019033144,0.000077703444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017625555,0.00007565678,0.00010146904,0.000108758475,0.000145009,0.00021346445,0.00012655894,0.00004051592,0.0000070780025],"category_scores_gemma":[0.000008958174,0.00006866256,0.000018272487,0.00008374583,0.00007798137,0.0004118012,0.00005503036,0.000108019995,0.0000018016151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003721413,0.000010836202,0.000013619214,0.000027075726,0.000011107964,5.648681e-7,0.001367528,0.9684028,0.016124496,0.0036214918,0.00020561871,0.010211108],"study_design_scores_gemma":[0.00018891488,0.00014850432,0.00027149986,0.000027815218,0.0000023472437,0.0000025429802,0.0009909865,0.9890093,0.008974381,0.00026907,0.000042985626,0.000071642615],"about_ca_topic_score_codex":0.000028267612,"about_ca_topic_score_gemma":0.000005391107,"teacher_disagreement_score":0.366358,"about_ca_system_score_codex":0.000038039725,"about_ca_system_score_gemma":0.000040219653,"threshold_uncertainty_score":0.2799978},"labels":[],"label_agreement":null},{"id":"W1975388745","doi":"10.1016/j.cor.2014.09.006","title":"Model-based automatic neighborhood design by unsupervised learning","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristic; Computer science; Integer programming; Space (punctuation); Key (lock); Domain (mathematical analysis); Unsupervised learning; Combinatorial optimization; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Algorithm","score_opus":0.06769736086838636,"score_gpt":0.33860306439854077,"score_spread":0.2709057035301544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975388745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007951181,0.00007529865,0.989566,0.00029269204,0.000104304236,0.00037358515,0.0000021367246,0.0007475937,0.00088719506],"genre_scores_gemma":[0.57007176,0.0000070703545,0.4295498,0.000055681616,0.000043054144,0.00005796883,0.000029577017,0.000049121296,0.00013593848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729776,0.0011568533,0.00030111775,0.0002887476,0.00046421346,0.0004912787],"domain_scores_gemma":[0.99841565,0.0007137524,0.000009296402,0.00040280577,0.00028450417,0.0001740108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002215759,0.00017104662,0.00019671224,0.0003228281,0.00055249286,0.00036431957,0.00040628263,0.00010648224,0.00006958276],"category_scores_gemma":[0.00040759964,0.00018443436,0.000045608096,0.0007479528,0.00007398864,0.00019867999,0.00006668191,0.0005836606,0.00010765478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016151866,0.000026606813,0.000040469113,0.000031094743,0.000013396794,5.077971e-7,0.00025207817,0.9701933,0.004239032,0.00034630852,0.00295178,0.02190379],"study_design_scores_gemma":[0.00045438163,0.00007273245,0.000025140533,0.000038380946,0.000004818538,0.0000010693119,0.000020809548,0.99661845,0.0022294938,0.00006078301,0.00028163037,0.00019228249],"about_ca_topic_score_codex":0.0000084994535,"about_ca_topic_score_gemma":0.0000017476186,"teacher_disagreement_score":0.5621206,"about_ca_system_score_codex":0.00014878732,"about_ca_system_score_gemma":0.00011571719,"threshold_uncertainty_score":0.7521015},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018536238,0.00045973272,0.9774187,0.0021181873,0.00031333556,0.0010466928,0.0000050428916,0.000050487226,0.000051583156],"genre_scores_gemma":[0.9841849,0.00009419125,0.015094112,0.00013554534,0.00018290977,0.00012383425,0.000035869936,0.000007786318,0.00014083889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814385,0.00020300811,0.00034772724,0.00040478804,0.00036341225,0.0005371993],"domain_scores_gemma":[0.9984353,0.0007374824,0.000025028019,0.0003725858,0.00033675623,0.00009284818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005131329,0.000114731214,0.00013564929,0.00013828554,0.0008620023,0.00071680377,0.0004580191,0.000052867497,8.962624e-7],"category_scores_gemma":[0.00011237325,0.00008634686,0.00004821689,0.00046602558,0.0000977272,0.00030207785,0.0003996489,0.00040040715,0.0000025222166],"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.00011436389,0.00040696724,0.0014449519,0.000046760655,0.00010848073,0.000056206805,0.004355731,0.4263882,0.0024358374,0.10829538,0.005107612,0.4512395],"study_design_scores_gemma":[0.00052908616,0.00017435908,0.0033282766,0.00007723519,0.0000024858418,0.000011414055,0.00035665842,0.9947027,0.00014027672,0.00005398556,0.0005161803,0.00010734816],"about_ca_topic_score_codex":0.00073556224,"about_ca_topic_score_gemma":0.00041325585,"teacher_disagreement_score":0.96564865,"about_ca_system_score_codex":0.00025994887,"about_ca_system_score_gemma":0.00009641521,"threshold_uncertainty_score":0.6912156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019844318,0.00024815134,0.95862603,0.016873328,0.00039076354,0.0033031646,0.000021788295,0.00006384514,0.0006286007],"genre_scores_gemma":[0.58256066,0.00007298048,0.41311687,0.0008292793,0.00059473247,0.001562658,0.000060616723,0.0000336594,0.0011685332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958645,0.0018593472,0.0006545602,0.00047640468,0.0004473233,0.0006978341],"domain_scores_gemma":[0.9941316,0.0037489575,0.000045020355,0.00047477407,0.0013925381,0.00020708713],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.007409239,0.0001687673,0.00024798122,0.00019931077,0.008773169,0.00036978564,0.0003171774,0.00012028803,0.000057149464],"category_scores_gemma":[0.0015815274,0.00011964187,0.000045067703,0.00044890854,0.00011533107,0.00023839355,0.00025372364,0.00090391503,0.00005206509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022314904,0.00008800481,0.00130994,0.00020760267,0.00006896357,7.181932e-7,0.005974906,0.8232064,0.0009861339,0.13123648,0.0021946374,0.034703888],"study_design_scores_gemma":[0.0009023704,0.00015161162,0.0006218219,0.00016105638,0.000015787988,0.0000021756339,0.0016644574,0.9901227,0.000036745078,0.00028059297,0.0059012976,0.0001393948],"about_ca_topic_score_codex":0.0007631888,"about_ca_topic_score_gemma":0.00089438027,"teacher_disagreement_score":0.56271636,"about_ca_system_score_codex":0.00018501628,"about_ca_system_score_gemma":0.0007208048,"threshold_uncertainty_score":0.9925173},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36938867,0.0021575713,0.058917984,0.4914729,0.005595461,0.008115333,0.000022315164,0.00062152534,0.06370825],"genre_scores_gemma":[0.98482484,0.000029839259,0.0005672536,0.005657126,0.003226708,0.00025586368,0.000044071898,0.000026343678,0.0053679524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806017,0.00008531565,0.0002079569,0.00034565703,0.00065602927,0.00064488605],"domain_scores_gemma":[0.99921685,0.000069948146,0.000021781267,0.0004996103,0.00011971139,0.00007210439],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015791486,0.0001653221,0.0001353548,0.00031004642,0.0009321752,0.0022908014,0.00041115473,0.00003410006,0.00020578213],"category_scores_gemma":[0.000040502026,0.00012195607,0.00004544578,0.000611785,0.00012591764,0.0008531706,0.0006342719,0.00023309236,0.0001688423],"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.00003176542,0.00039071438,0.0013185493,0.00009355161,0.00011308164,0.000006070265,0.0006977067,0.016299719,0.0005490186,0.32863113,0.6096735,0.042195152],"study_design_scores_gemma":[0.00051577075,0.000054126438,0.004931684,0.000036787587,0.000019824287,0.0000026559474,0.0032336123,0.02727852,0.00019801738,0.0004328748,0.9630605,0.00023562183],"about_ca_topic_score_codex":0.00025276368,"about_ca_topic_score_gemma":0.00016890606,"teacher_disagreement_score":0.6154362,"about_ca_system_score_codex":0.000102426966,"about_ca_system_score_gemma":0.00002958005,"threshold_uncertainty_score":0.9987449},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008455947,0.000014475332,0.9884014,0.0063801147,0.000022476626,0.0012939386,0.000018828974,0.00005720487,0.0029659735],"genre_scores_gemma":[0.43210608,0.000007786104,0.56538624,0.00023481315,0.00003782533,0.0017494434,0.00013551537,0.00001150121,0.00033077714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969694,0.0005221639,0.0006768444,0.0005942581,0.00086885603,0.00036846963],"domain_scores_gemma":[0.9969567,0.00027663627,0.000073980955,0.00065728737,0.0018459028,0.00018945712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221554,0.00017046265,0.000245483,0.0010754223,0.00038080575,0.00053800264,0.0008696472,0.000061407496,0.00015114337],"category_scores_gemma":[0.000022424498,0.00015347438,0.000052739626,0.003325225,0.00007391247,0.0015962303,0.00036408586,0.00019648089,0.000044453467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043316586,0.0002623642,0.0001839866,0.000014293206,0.000024513,2.3643832e-7,0.0004928972,0.6362111,0.00022686324,0.36021715,0.0004904151,0.0018718102],"study_design_scores_gemma":[0.00047635913,0.000079671074,0.0020632034,0.000043039712,0.0000047826256,0.0000037998718,0.00003898495,0.98138624,0.00008547082,0.01536983,0.00027315837,0.00017544933],"about_ca_topic_score_codex":0.0013981331,"about_ca_topic_score_gemma":0.0006661895,"teacher_disagreement_score":0.43126047,"about_ca_system_score_codex":0.00017601349,"about_ca_system_score_gemma":0.00034980543,"threshold_uncertainty_score":0.6258504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27589303,0.00002370763,0.71641684,0.0008925782,0.00012550187,0.0008612827,0.0000033146414,0.000041617066,0.005742113],"genre_scores_gemma":[0.9866469,0.000008958362,0.008733537,0.00012051073,0.00013055881,0.00024814293,0.000029180193,0.00001678813,0.0040654214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998108,0.0002497958,0.00025211202,0.0003758155,0.0005259718,0.0004882713],"domain_scores_gemma":[0.9990591,0.0001428625,0.0000111648205,0.00057677214,0.000093212715,0.000116893214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014894841,0.00011518267,0.00012688224,0.00012107021,0.00078511046,0.00022899226,0.0005967918,0.000046974368,0.00017870415],"category_scores_gemma":[0.0001456629,0.00011329723,0.000043357923,0.00036086704,0.00018344294,0.0002766025,0.00071899476,0.00018247923,0.00040390802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007845877,0.000039118215,0.000015606081,0.000021973348,0.000007468605,1.7417884e-7,0.0016039765,0.9883698,0.00012072476,0.0042055985,0.0019988872,0.0036088065],"study_design_scores_gemma":[0.00025266918,0.00011080088,0.000012049712,0.000020075222,0.0000030844026,5.375064e-7,0.0011070863,0.98652273,0.00016350564,0.0006459402,0.011040401,0.000121120975],"about_ca_topic_score_codex":0.0016782532,"about_ca_topic_score_gemma":0.0012704466,"teacher_disagreement_score":0.71075386,"about_ca_system_score_codex":0.00023421455,"about_ca_system_score_gemma":0.00001759503,"threshold_uncertainty_score":0.60385144},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46288624,0.00019711262,0.53104407,0.0028558392,0.00026929245,0.0021739702,0.000015245717,0.00006558158,0.0004926324],"genre_scores_gemma":[0.7166165,0.00021504723,0.2816832,0.00025897636,0.00021615304,0.0005322271,0.00020393472,0.000020476435,0.0002534778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780184,0.0006505168,0.0004933461,0.00043407464,0.00021540881,0.0004048321],"domain_scores_gemma":[0.9977858,0.00034904678,0.0000491566,0.00024657397,0.0013824377,0.00018695835],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022303632,0.00012756877,0.00016570714,0.00030380784,0.00308793,0.00009554673,0.000093457704,0.0001949573,0.00004941048],"category_scores_gemma":[0.0006238519,0.00012471998,0.000021613447,0.00032504852,0.00015558557,0.00045601468,0.000074359945,0.0004333889,0.000017853154],"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.00025564435,0.0003457184,0.0071265437,0.00073614554,0.00011599678,0.000004143103,0.07752692,0.051757827,0.044150956,0.5343879,0.0019176045,0.28167465],"study_design_scores_gemma":[0.0010817623,0.0002538755,0.0035508561,0.0001646364,0.000009938725,0.0000040213945,0.003570717,0.9895467,0.00034340838,0.0003468057,0.0009444974,0.00018278013],"about_ca_topic_score_codex":0.00036201067,"about_ca_topic_score_gemma":0.00083951646,"teacher_disagreement_score":0.93778884,"about_ca_system_score_codex":0.00012757977,"about_ca_system_score_gemma":0.00044240963,"threshold_uncertainty_score":0.9982099},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003981165,0.00004696593,0.9900962,0.0030105675,0.000049879687,0.000968785,0.00002405986,0.00009659671,0.0017257567],"genre_scores_gemma":[0.41032425,0.000014287904,0.58787555,0.00030523597,0.00014581926,0.00026581067,0.00008809169,0.000015369107,0.00096557953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767786,0.00014648316,0.00036405976,0.00060997414,0.00076901587,0.00043260655],"domain_scores_gemma":[0.9984886,0.00012061296,0.000029351802,0.00088258064,0.00035911868,0.00011975506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098256,0.00014090001,0.0001793672,0.0003084083,0.00035999878,0.00048591802,0.0018223111,0.000045499222,0.00001673623],"category_scores_gemma":[0.00003429111,0.00013725905,0.000039750877,0.0011468948,0.00009584495,0.0012760506,0.0009008271,0.00022632675,0.00037632097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014474036,0.0005887186,0.00011013153,0.00005642243,0.000064814085,0.00002438343,0.011347118,0.5383688,0.04314558,0.048786607,0.013704444,0.34378847],"study_design_scores_gemma":[0.00022968475,0.00013081498,0.00018315988,0.000067419074,0.0000029519463,0.0000060368666,0.00012390297,0.99107105,0.002813478,0.00019791872,0.0050041666,0.00016944572],"about_ca_topic_score_codex":0.0001364045,"about_ca_topic_score_gemma":0.00002908583,"teacher_disagreement_score":0.45270216,"about_ca_system_score_codex":0.00011744964,"about_ca_system_score_gemma":0.00014083195,"threshold_uncertainty_score":0.5597262},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03170052,0.00028673976,0.9637487,0.002489133,0.0001180683,0.0009159273,0.000004314669,0.00026867515,0.0004679385],"genre_scores_gemma":[0.35219437,0.00006812324,0.6437321,0.00013965489,0.0001315272,0.0004911553,0.000040430892,0.000034293964,0.0031683906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961318,0.0005660145,0.000426877,0.0009191122,0.0010570061,0.000899238],"domain_scores_gemma":[0.99558496,0.0011624387,0.000025707473,0.0013965687,0.0015429029,0.0002874436],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032440417,0.0001876659,0.00024552163,0.00065253297,0.0017796396,0.0011970564,0.0016276252,0.00012690731,0.000031680884],"category_scores_gemma":[0.0026398012,0.00018554786,0.00014648263,0.002166821,0.00018192863,0.00080316357,0.00045153213,0.0004971089,0.00014012349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006269268,0.0011065059,0.002735779,0.00037321346,0.00020492461,0.0000409032,0.002213771,0.7236557,0.008326646,0.19367693,0.02862751,0.038975433],"study_design_scores_gemma":[0.0015946161,0.0004895913,0.002117658,0.00015103933,0.000012188483,0.000051511965,0.00019980804,0.8981147,0.014346047,0.0035441893,0.07869383,0.00068481883],"about_ca_topic_score_codex":0.00006297958,"about_ca_topic_score_gemma":0.000041440748,"teacher_disagreement_score":0.32049385,"about_ca_system_score_codex":0.00029520007,"about_ca_system_score_gemma":0.0006366451,"threshold_uncertainty_score":0.9998398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026097696,0.00038916818,0.95956236,0.012019665,0.00060869346,0.0010358917,0.00001779203,0.00006259308,0.0002061657],"genre_scores_gemma":[0.33863282,0.00013557653,0.6564188,0.0021952558,0.0007372755,0.0005412196,0.00004130161,0.00002296805,0.0012747977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979016,0.00032241349,0.00021521546,0.00044225977,0.00052790716,0.0005905983],"domain_scores_gemma":[0.99797344,0.0004306463,0.000017818253,0.00059147674,0.00067032187,0.00031631585],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014897428,0.0001383665,0.00013935826,0.00020029006,0.0016761505,0.0008344035,0.00072614424,0.00007456997,0.000010916704],"category_scores_gemma":[0.0001733824,0.00009307782,0.00005311227,0.00057956274,0.000117009346,0.0008593678,0.0009931817,0.00025082802,0.00011311416],"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.000031830048,0.00027299084,0.00005733265,0.00001742715,0.00003192701,0.000005518492,0.0058425716,0.004083548,0.0033433575,0.0076209297,0.10652692,0.8721656],"study_design_scores_gemma":[0.0006216014,0.00033567665,0.0019395744,0.00020118577,0.000007186719,0.00006909659,0.0004891838,0.9363596,0.0023984443,0.00030794588,0.057001688,0.0002688193],"about_ca_topic_score_codex":0.000050387123,"about_ca_topic_score_gemma":0.000026576141,"teacher_disagreement_score":0.93227607,"about_ca_system_score_codex":0.00006425832,"about_ca_system_score_gemma":0.000117234486,"threshold_uncertainty_score":0.99962354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005578626,0.000057298104,0.9914975,0.00045895402,0.00020067654,0.0017501267,0.0000073291694,0.0002729526,0.00017654774],"genre_scores_gemma":[0.5938507,0.000052281077,0.4056691,0.000031626478,0.00007774418,0.00017203347,0.0000898699,0.000018417986,0.000038250404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985422,0.00019769969,0.00028398764,0.00032891647,0.00026290462,0.00038427312],"domain_scores_gemma":[0.9985415,0.00018024241,0.000007837132,0.00045841554,0.0006896682,0.00012233737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014007242,0.00012392197,0.00013812004,0.0001848452,0.00041229028,0.00026489576,0.00026064555,0.000087922046,0.00001680653],"category_scores_gemma":[0.0002522464,0.000121068,0.000040009556,0.0004916681,0.00007523397,0.0002464618,0.000016235192,0.00019743908,0.000011359109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001453137,0.0001397837,0.0000019677213,0.000031861568,0.0000038624717,3.3789092e-7,0.00038648953,0.99334884,0.00040810436,0.0010197648,0.0012064468,0.0034380176],"study_design_scores_gemma":[0.0002885379,0.00036160683,0.00007643317,0.00002922937,0.0000038649487,0.0000014455965,0.000034004282,0.9980723,0.0004068463,0.0003698715,0.00022167893,0.00013416399],"about_ca_topic_score_codex":0.000009358551,"about_ca_topic_score_gemma":0.0000035694893,"teacher_disagreement_score":0.58827204,"about_ca_system_score_codex":0.0002135292,"about_ca_system_score_gemma":0.00007684786,"threshold_uncertainty_score":0.49370098},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8827605,0.000021601672,0.07056867,0.00803019,0.0007728734,0.001954575,0.000007695303,0.00031242621,0.035571445],"genre_scores_gemma":[0.9852327,0.0000069239154,0.008363159,0.0003547026,0.00062904396,0.00023647869,0.00017341107,0.000021320171,0.0049822773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826086,0.00003038013,0.00026217182,0.00039918924,0.0006602034,0.00038717693],"domain_scores_gemma":[0.9986989,0.000021791604,0.000013613405,0.0004815187,0.00075548125,0.000028702296],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009813425,0.00015190177,0.00013239922,0.0005187302,0.00080440455,0.00079842994,0.0004108616,0.000063013285,0.000593694],"category_scores_gemma":[0.000072136994,0.00012881872,0.000036990677,0.000848593,0.00014676715,0.0011359067,0.00014882047,0.0004010542,0.0011377459],"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.00027367487,0.0011615705,0.0064689047,0.0013682086,0.00027704923,0.00004318261,0.0049772235,0.14812766,0.024451002,0.534736,0.22173561,0.056379933],"study_design_scores_gemma":[0.0011649624,0.00010285763,0.007536803,0.00007551954,0.00002104709,0.0000044456524,0.0021437083,0.563548,0.0004438869,0.0015665496,0.42277145,0.0006207305],"about_ca_topic_score_codex":0.0045272685,"about_ca_topic_score_gemma":0.009840903,"teacher_disagreement_score":0.53316945,"about_ca_system_score_codex":0.00004277209,"about_ca_system_score_gemma":0.00007769622,"threshold_uncertainty_score":0.99964},"labels":[],"label_agreement":null},{"id":"W1988416901","doi":"10.1016/j.cor.2008.08.010","title":"Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Kronos (Canada)","funders":"","keywords":"Computer science; Depot; Scheduling (production processes); Reduction (mathematics); Mathematical optimization; Window (computing); Dynamic programming; Real-time computing; Algorithm; Mathematics; Operating system","score_opus":0.04590354069195404,"score_gpt":0.32038094198709677,"score_spread":0.27447740129514275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988416901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18512201,0.00015861413,0.8123127,0.0006008228,0.000122112,0.0012716962,0.0000060749157,0.0002796061,0.00012631484],"genre_scores_gemma":[0.53684217,0.00004800648,0.4623868,0.000011764799,0.00009602004,0.00023645093,0.000026451005,0.000047625534,0.00030470503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984609,0.00019372888,0.00025118698,0.00028761174,0.0003674965,0.00043910366],"domain_scores_gemma":[0.9985127,0.0005343774,0.000013848748,0.00039872565,0.00045110408,0.00008923945],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00090532156,0.00014815835,0.00015056475,0.00020145846,0.0013804013,0.00018193659,0.00032800113,0.000076454984,0.000015028711],"category_scores_gemma":[0.0001209953,0.0001173072,0.000047100668,0.0007569652,0.00017913437,0.00028528832,0.00006688035,0.00041774017,0.000047868245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019592768,0.00002698302,0.00011422217,0.000020795305,0.000046279678,0.0000019882918,0.00068295054,0.9786927,0.01384945,0.00004786148,0.00029314344,0.0062039993],"study_design_scores_gemma":[0.0006776015,0.00008401829,0.00060009694,0.000037503447,0.000007923545,0.00006220561,0.00010360364,0.9950774,0.0028083795,0.00000977344,0.00038328895,0.00014821957],"about_ca_topic_score_codex":0.000032424083,"about_ca_topic_score_gemma":0.000029524344,"teacher_disagreement_score":0.35172015,"about_ca_system_score_codex":0.00017702596,"about_ca_system_score_gemma":0.00013097339,"threshold_uncertainty_score":0.99991965},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063016743,0.0014566192,0.99113125,0.0033398517,0.000494517,0.002308632,0.0000057374045,0.00015019577,0.00048300857],"genre_scores_gemma":[0.095666796,0.00011763236,0.89991933,0.00027829045,0.0014114002,0.001057424,0.0000135780165,0.00004413163,0.0014914136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949493,0.0009013254,0.00034211928,0.0005765275,0.0012212271,0.00200949],"domain_scores_gemma":[0.9942721,0.0029418273,0.000020768508,0.0013367066,0.0010678676,0.00036069163],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008297322,0.00020060867,0.00020951948,0.0002901779,0.0031607503,0.0009910872,0.0029418815,0.00008629362,0.000020986741],"category_scores_gemma":[0.00015885403,0.00014629822,0.00011928537,0.0028069105,0.00039823356,0.0013409449,0.0017061086,0.0008972108,0.00015187262],"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.000010985397,0.00016114464,0.0002050451,0.000022008024,0.00007107967,0.0000033030817,0.0024636146,0.0862132,0.00027508446,0.35155293,0.010129109,0.5488925],"study_design_scores_gemma":[0.00036475234,0.00016454126,0.00041152767,0.000033253797,0.0000034291124,0.000024581524,0.00016727336,0.9714524,0.00044954335,0.0038331577,0.02289858,0.00019693079],"about_ca_topic_score_codex":0.00006813715,"about_ca_topic_score_gemma":0.000022424458,"teacher_disagreement_score":0.88523924,"about_ca_system_score_codex":0.0001953387,"about_ca_system_score_gemma":0.00036215832,"threshold_uncertainty_score":0.998137},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122636305,0.0000448273,0.9811024,0.0033961255,0.00011808554,0.0027920986,0.00001723736,0.00006474709,0.00020086046],"genre_scores_gemma":[0.061005563,0.000018150151,0.93487066,0.00007505726,0.0002537875,0.000089918045,0.00004978568,0.00003158502,0.0036054698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979111,0.00023538154,0.0003687126,0.00032649192,0.0006657227,0.0004926119],"domain_scores_gemma":[0.99744713,0.00037565324,0.000040590006,0.0006192654,0.001358423,0.00015893867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008588449,0.00013546126,0.00020316237,0.00019928663,0.00061028206,0.00013389232,0.00069018843,0.00008949436,0.000053618263],"category_scores_gemma":[0.0007610497,0.00010102297,0.00011513536,0.0010005104,0.00013105162,0.00020351475,0.00024143982,0.000342951,0.000010095023],"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.0004567616,0.0013812435,0.000047245496,0.00022053432,0.00014217969,0.0000040625223,0.0025977716,0.16466758,0.042594887,0.097607456,0.0566983,0.633582],"study_design_scores_gemma":[0.0012746707,0.0005477681,0.00004436438,0.000050331433,0.000007974941,0.0000032807463,0.00009249895,0.9655623,0.020862998,0.004862932,0.0065540485,0.0001368338],"about_ca_topic_score_codex":0.000030196325,"about_ca_topic_score_gemma":0.000042365813,"teacher_disagreement_score":0.80089474,"about_ca_system_score_codex":0.00014172705,"about_ca_system_score_gemma":0.00061324635,"threshold_uncertainty_score":0.4693858},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009471615,0.00007503653,0.9884418,0.0007997149,0.0000738005,0.0014185712,0.000028082994,0.0001606441,0.008055176],"genre_scores_gemma":[0.010596771,0.000024629548,0.9834397,0.000101970356,0.00014094557,0.00056085334,0.000077696626,0.000088413726,0.004969047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99295944,0.0027004778,0.0006502071,0.00073937635,0.0020334553,0.00091703923],"domain_scores_gemma":[0.9932402,0.0031723327,0.00006475159,0.0012013161,0.0020284776,0.00029293683],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0052979016,0.0003102796,0.00042756743,0.0008065537,0.001312632,0.0007494011,0.00073552795,0.00014557627,0.00040609986],"category_scores_gemma":[0.0051351385,0.00026895117,0.00007814295,0.0018921026,0.00032478909,0.0007902414,0.0003796714,0.0009392307,0.00005427484],"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.000041070085,0.00060346036,0.000041139647,0.00017884806,0.00015071178,0.000020792524,0.004798468,0.26110107,0.00023112517,0.72531825,0.006474401,0.0010406435],"study_design_scores_gemma":[0.0016370785,0.00024861374,0.000028184631,0.00008577692,0.000018474057,0.00012534099,0.0024326383,0.9668851,0.00062140723,0.025745131,0.0017328551,0.00043940882],"about_ca_topic_score_codex":0.00008212577,"about_ca_topic_score_gemma":0.00012394614,"teacher_disagreement_score":0.705784,"about_ca_system_score_codex":0.0004087257,"about_ca_system_score_gemma":0.0012414041,"threshold_uncertainty_score":0.99998754},"labels":[],"label_agreement":null},{"id":"W1997194016","doi":"10.1016/j.cor.2005.05.024","title":"Arcs-states models for the vehicle routing problem with time windows and related problems","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Benchmark (surveying); Vehicle routing problem; Upper and lower bounds; Branch and bound; Relaxation (psychology); Routing (electronic design automation); Arc routing; Linear programming relaxation; Computer science; Arc (geometry); Mathematical optimization; Time complexity; Mathematics; Algorithm; Linear programming","score_opus":0.039670149775145915,"score_gpt":0.30868088785053627,"score_spread":0.26901073807539033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997194016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023666967,0.00040405995,0.9703326,0.002712411,0.000036038935,0.0016707925,0.000009088916,0.00031326344,0.0008547727],"genre_scores_gemma":[0.60290384,0.000091469534,0.3956331,0.000044233,0.000095380165,0.00029348585,0.000032090666,0.00006937498,0.0008370027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858236,0.00017388296,0.00027502584,0.00026371246,0.00027157564,0.0004334128],"domain_scores_gemma":[0.99866,0.0006351694,0.000013049211,0.00028160232,0.000321271,0.00008889178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015995123,0.000139055,0.00014332752,0.00014302769,0.00074162916,0.00038579834,0.00025026855,0.00006580903,0.00001641481],"category_scores_gemma":[0.00004139206,0.000102837854,0.000026156891,0.00051568693,0.00012921331,0.00038513087,0.000093214774,0.00036456352,0.00001979336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004938232,0.00001609147,0.000028725572,0.000025484005,0.00004851596,4.0408742e-7,0.002030422,0.9795497,0.000682008,0.0011299672,0.00053595606,0.015947802],"study_design_scores_gemma":[0.00056029495,0.00007090446,0.000057640504,0.0000632834,0.000009217322,0.000012394699,0.00008857863,0.9976456,0.00036216946,0.00023560273,0.0007565203,0.0001378052],"about_ca_topic_score_codex":0.000022767023,"about_ca_topic_score_gemma":0.000026454327,"teacher_disagreement_score":0.5792369,"about_ca_system_score_codex":0.0000926802,"about_ca_system_score_gemma":0.000057403784,"threshold_uncertainty_score":0.5704087},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13964447,0.00048678092,0.8527956,0.00056927797,0.0002778878,0.00070696656,0.00003534396,0.00059533125,0.004888363],"genre_scores_gemma":[0.8947593,0.000009931259,0.10464127,0.000021160427,0.000104070525,0.000036774683,0.00007038138,0.000031608593,0.00032547407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988765,0.000053672695,0.0001728685,0.00019973042,0.00031488907,0.0003823421],"domain_scores_gemma":[0.99918735,0.000036116362,0.000003871714,0.0002741167,0.00030708127,0.00019147672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805227,0.00011739793,0.00012927,0.00013254627,0.0002272539,0.00023490314,0.0002584297,0.000053669315,0.00001588549],"category_scores_gemma":[0.000019323012,0.00009952138,0.000018140972,0.0004156195,0.00013431322,0.00019612811,0.00004442093,0.0003544707,0.00012118486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012899601,0.0001117828,0.002132126,0.000043815384,0.00006181427,0.00012706027,0.002876078,0.97947115,0.0026326047,0.0030003288,0.007168378,0.0023619803],"study_design_scores_gemma":[0.0005930002,0.00009959538,0.0011348352,0.000036600206,0.0000046540777,0.000016420967,0.00026776182,0.9925674,0.00066352927,0.000014183882,0.004442013,0.00015997562],"about_ca_topic_score_codex":0.000110504436,"about_ca_topic_score_gemma":0.00029695238,"teacher_disagreement_score":0.75511485,"about_ca_system_score_codex":0.00009823547,"about_ca_system_score_gemma":0.00010815658,"threshold_uncertainty_score":0.4058364},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008281103,0.00061450957,0.9873713,0.0010347181,0.00011666872,0.0016344289,0.000004204017,0.00010248539,0.00084055687],"genre_scores_gemma":[0.7277389,0.00006740801,0.27017412,0.00007565265,0.00006826175,0.0012752491,0.000020788206,0.000013460462,0.00056612643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973073,0.000288543,0.0004628017,0.00048166432,0.00070607284,0.0007536349],"domain_scores_gemma":[0.99571985,0.00058296765,0.000037021786,0.0016033637,0.0018412377,0.00021557442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014562416,0.00014359143,0.00024725441,0.00024111249,0.0007052078,0.00070412544,0.0031523334,0.00011761641,0.0000151913855],"category_scores_gemma":[0.000098058634,0.00013991489,0.00008812431,0.001518204,0.00022226587,0.0008961548,0.0015951135,0.000431134,0.00003801841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004745725,0.000093685056,0.00015744363,0.000014392516,0.00001664918,5.119488e-7,0.00032590746,0.9197985,0.00010376087,0.04325252,0.019968273,0.016263612],"study_design_scores_gemma":[0.00032673872,0.00014275206,0.00021722128,0.000057796977,0.0000011770139,0.0000032186765,0.00005119135,0.9964134,0.00007935741,0.0018467683,0.0007310441,0.00012934799],"about_ca_topic_score_codex":0.00019965046,"about_ca_topic_score_gemma":0.000027059728,"teacher_disagreement_score":0.7194578,"about_ca_system_score_codex":0.00018462875,"about_ca_system_score_gemma":0.00044226905,"threshold_uncertainty_score":0.6789898},"labels":[],"label_agreement":null},{"id":"W1999715008","doi":"10.1016/j.cor.2013.01.022","title":"An adaptive evolutionary approach for real-time vehicle routing and dispatching","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Robustness (evolution); Computer science; Mathematical optimization; Vehicle routing problem; Evolutionary algorithm; Genetic algorithm; Convergence (economics); Adaptation (eye); Routing (electronic design automation); Artificial intelligence; Mathematics; Machine learning","score_opus":0.046476274989404244,"score_gpt":0.3361941171643727,"score_spread":0.28971784217496843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999715008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15345405,0.000055510012,0.8443838,0.00011275921,0.000053227643,0.00082642806,0.000009936339,0.00027848303,0.00082583993],"genre_scores_gemma":[0.4681247,0.000014787764,0.5313926,0.000010216266,0.00011071091,0.00017529284,0.00005352033,0.000032062857,0.000086106265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.0003407397,0.00023571645,0.0003295767,0.00024960635,0.0004298528],"domain_scores_gemma":[0.99877375,0.00036885167,0.000009570703,0.00029661943,0.00037962454,0.00017157501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010011933,0.00013473628,0.00015670511,0.00020689965,0.0007131371,0.00035924822,0.00023777307,0.00008512891,0.000024573594],"category_scores_gemma":[0.00009149194,0.0001418877,0.00003066311,0.00036977112,0.00009376496,0.0006578788,0.00010171492,0.00027241115,0.000023567081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004640755,0.000036628488,0.00019703315,0.000021231866,0.000020199224,3.2492548e-7,0.00077372266,0.9739021,0.011355708,0.0014210865,0.00088347035,0.01138385],"study_design_scores_gemma":[0.00025042307,0.00009426936,0.0028764105,0.000018303153,0.00000366094,0.000004001348,0.000313588,0.99592865,0.00022934447,0.00009983928,0.000024153822,0.00015735967],"about_ca_topic_score_codex":0.00021804591,"about_ca_topic_score_gemma":0.0000031784152,"teacher_disagreement_score":0.31467065,"about_ca_system_score_codex":0.00013506039,"about_ca_system_score_gemma":0.00004970426,"threshold_uncertainty_score":0.57860124},"labels":[],"label_agreement":null},{"id":"W2000702178","doi":"10.1016/j.cor.2007.01.007","title":"The single vehicle routing problem with deliveries and selective pickups","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Heuristics; Pickup; Mathematical optimization; Computer science; Vehicle routing problem; Tabu search; Vertex (graph theory); Routing (electronic design automation); Integer programming; Mathematics; Graph; Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.03535149278004031,"score_gpt":0.3189383663021784,"score_spread":0.2835868735221381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000702178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2520946,0.00021727856,0.7447394,0.0003394475,0.00006118256,0.00036883343,0.0000014221987,0.00019650925,0.001981328],"genre_scores_gemma":[0.82788235,0.000030355744,0.17181785,0.000017233282,0.00006878545,0.000017898807,0.0000029246291,0.000026205063,0.00013635936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987288,0.00017574022,0.00018676829,0.00018863041,0.0002871339,0.0004329127],"domain_scores_gemma":[0.9986473,0.0006514496,0.000008431774,0.00019107053,0.00041356558,0.00008819912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018787952,0.000100882266,0.000090097914,0.00012129694,0.0011656497,0.00043618685,0.00017146273,0.00004630113,0.0000027076412],"category_scores_gemma":[0.00010022625,0.000076687626,0.000012655453,0.00069478777,0.0002030628,0.00020337562,0.00009469709,0.00035586118,0.000005313149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023882643,0.000027288052,0.0014977215,0.000019202202,0.0000536134,0.00000682663,0.003585364,0.9111179,0.006021969,0.003467273,0.0004497743,0.073729195],"study_design_scores_gemma":[0.00028860552,0.00015664361,0.003947477,0.00004015699,0.000004334072,0.00001984553,0.00068944244,0.9850713,0.008334643,0.000051447863,0.0012458222,0.0001502936],"about_ca_topic_score_codex":0.000053327534,"about_ca_topic_score_gemma":0.00043100864,"teacher_disagreement_score":0.5757878,"about_ca_system_score_codex":0.00014381178,"about_ca_system_score_gemma":0.00005065815,"threshold_uncertainty_score":0.89653534},"labels":[],"label_agreement":null},{"id":"W2001465411","doi":"10.1016/j.cor.2004.07.006","title":"A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Snow removal; Truck; Snow; Plough; Sizing; Computer science; Routing (electronic design automation); Transport engineering; Operations research; Algorithm; Meteorology; Engineering","score_opus":0.19652052242196252,"score_gpt":0.38302933976129844,"score_spread":0.18650881733933591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001465411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01878899,0.00022590773,0.9796063,0.00006664694,0.00013610875,0.0010357951,0.000039169146,0.00007621044,0.000024903811],"genre_scores_gemma":[0.4853481,0.000026391062,0.5143869,0.0000045234106,0.00003605425,0.00013361259,0.000012926048,0.000026300642,0.00002518494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883753,0.00020571488,0.00027920914,0.00023134501,0.00014542909,0.00030074656],"domain_scores_gemma":[0.9985706,0.00068669947,0.000011674381,0.00016750213,0.00048173018,0.000081750746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002999371,0.00010499442,0.00021760531,0.00018827553,0.00024077583,0.0001534084,0.00012254636,0.00006262261,5.593766e-7],"category_scores_gemma":[0.0002396773,0.00010557728,0.000027292557,0.00023401195,0.00006678712,0.0002263337,0.000059372156,0.00011027142,3.656847e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013322548,0.000008816846,0.000027019392,0.00017252266,0.000034578337,4.7573573e-7,0.00063365354,0.99061316,0.00042119008,0.0009252623,0.0001774764,0.0069725276],"study_design_scores_gemma":[0.00077267503,0.00008807142,0.00019547604,0.00026634312,0.0000060343677,0.000005577885,0.00013311897,0.99699974,0.0013294083,0.00008173277,0.000019533012,0.00010231518],"about_ca_topic_score_codex":0.00009690196,"about_ca_topic_score_gemma":0.000026783804,"teacher_disagreement_score":0.4665591,"about_ca_system_score_codex":0.00011962732,"about_ca_system_score_gemma":0.000061455205,"threshold_uncertainty_score":0.43053165},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003036894,0.00065572216,0.9943653,0.00019987067,0.00019732921,0.0008675657,0.0000349996,0.00023966086,0.00040268607],"genre_scores_gemma":[0.09830044,0.00007597317,0.90068525,0.000041035237,0.00015892052,0.0003043504,0.000045092063,0.000055462555,0.0003334915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998617,0.000076275304,0.00023238239,0.00028263486,0.0003649431,0.00042677321],"domain_scores_gemma":[0.9989353,0.00016842282,0.00001145182,0.0003674031,0.00040383512,0.00011361411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047648812,0.00016298798,0.00013699215,0.0001871334,0.0006106515,0.00030004763,0.0004190728,0.000045266235,0.00008773957],"category_scores_gemma":[0.0000235244,0.000117801785,0.000042239575,0.00033723397,0.0001293076,0.00015964982,0.00007667184,0.00032788946,0.000047340283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006124125,0.00005207462,0.000010097192,0.000016924678,0.0000736221,0.000009021013,0.00068064977,0.9078786,0.00014034986,0.00015699127,0.00020492783,0.09077061],"study_design_scores_gemma":[0.00041195212,0.00017115138,0.000021285814,0.00003940044,0.000014382192,0.000048289217,0.00014719761,0.9955146,0.003104009,0.00007586474,0.0002859361,0.00016594109],"about_ca_topic_score_codex":0.000092177215,"about_ca_topic_score_gemma":0.00003253483,"teacher_disagreement_score":0.09526355,"about_ca_system_score_codex":0.00010019536,"about_ca_system_score_gemma":0.00010198629,"threshold_uncertainty_score":0.48038173},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89327884,0.00030652978,0.08402744,0.011501107,0.0005838609,0.0015801346,0.0000013268535,0.00015790964,0.008562878],"genre_scores_gemma":[0.9926924,0.000064164284,0.0051473537,0.0007043192,0.00070388644,0.000075849704,0.000030120951,0.000020051255,0.00056187203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828136,0.00007759402,0.00031146608,0.00036385885,0.00043822546,0.00052751286],"domain_scores_gemma":[0.99904674,0.00012271016,0.000028675579,0.00027481833,0.00050737266,0.000019662462],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019976483,0.00014203957,0.00017018057,0.0008917896,0.00064439507,0.002201996,0.0003162224,0.000054562446,0.000017535416],"category_scores_gemma":[0.00020590627,0.00014250513,0.000016604768,0.0011436295,0.00013145425,0.0019799857,0.000599875,0.000299686,0.0000773248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072120883,0.000038420156,0.004962202,0.00041839218,0.000012031651,0.00003236471,0.00020945555,0.9284627,0.000016902977,0.04262921,0.0074006408,0.015810462],"study_design_scores_gemma":[0.00033309494,0.000006153676,0.0046619014,0.00015828737,0.000004202514,0.0000023641678,0.0026394725,0.88793755,0.0000023807438,0.000047080077,0.1040394,0.00016808858],"about_ca_topic_score_codex":0.002199248,"about_ca_topic_score_gemma":0.00060891506,"teacher_disagreement_score":0.09941357,"about_ca_system_score_codex":0.00048887875,"about_ca_system_score_gemma":0.00012867777,"threshold_uncertainty_score":0.99883384},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049564885,0.0002004329,0.99056906,0.00044910618,0.0004136861,0.002013535,0.000036675116,0.0005266755,0.0008343627],"genre_scores_gemma":[0.9320916,0.0000058769433,0.0666429,0.000010627545,0.00033298202,0.00067096076,0.00011248725,0.000036831592,0.00009576281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984309,0.00007323207,0.00048372895,0.00029951448,0.00028849812,0.0004241342],"domain_scores_gemma":[0.998574,0.00014678849,0.000016917014,0.0004678658,0.00070756394,0.000086834654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006460439,0.00015537327,0.00021142141,0.0003595188,0.00084297865,0.00031177243,0.00031659834,0.0001058701,0.0000067335036],"category_scores_gemma":[0.00007616607,0.00017053718,0.00007894685,0.00075149414,0.00006352386,0.0002855998,0.000039917813,0.00024059376,0.00008587002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009647416,0.00007423827,5.681993e-7,0.000026457235,0.00002559962,4.333145e-7,0.00061521586,0.9187741,0.05515649,0.019810433,0.0004979432,0.0050088465],"study_design_scores_gemma":[0.00025617273,0.00007824323,0.00008577512,0.000055684155,0.000006954048,0.000005941377,0.00059093797,0.97902596,0.018870061,0.000032618165,0.00082648266,0.00016515426],"about_ca_topic_score_codex":0.00010231182,"about_ca_topic_score_gemma":0.000046060864,"teacher_disagreement_score":0.9271351,"about_ca_system_score_codex":0.000397652,"about_ca_system_score_gemma":0.00008644786,"threshold_uncertainty_score":0.6954304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001586093,0.00008771771,0.9817657,0.00011078272,0.00024889977,0.0004696642,0.0000013455141,0.0003453329,0.015384451],"genre_scores_gemma":[0.44147405,0.000028373895,0.5577601,0.0001105128,0.00010056026,0.00012818222,0.000022825112,0.000018598434,0.0003567744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991397,0.00005595675,0.0001304924,0.00017653967,0.00022958238,0.00026770553],"domain_scores_gemma":[0.99949574,0.000021959695,0.0000029991706,0.00020061104,0.00014463582,0.00013407314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003256465,0.00008946281,0.000095013624,0.00017740615,0.00017833647,0.00007097457,0.00011815011,0.000063442945,0.00011892194],"category_scores_gemma":[0.00005328888,0.00009423054,0.00002023153,0.0007125482,0.000016553447,0.000107212894,0.000025405043,0.00014852977,0.000075419375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009844589,0.000010674959,0.000026756237,0.0000033646368,0.000013659053,4.700303e-7,0.000041930376,0.95765364,0.0028265235,0.0108117005,0.017786967,0.01081447],"study_design_scores_gemma":[0.0021172143,0.00057941664,0.0007532233,0.000052652387,0.000028205388,0.000011941386,0.00017763895,0.81330496,0.024482168,0.002552394,0.15518358,0.0007566319],"about_ca_topic_score_codex":0.000007932713,"about_ca_topic_score_gemma":0.000031028143,"teacher_disagreement_score":0.43988797,"about_ca_system_score_codex":0.00019485239,"about_ca_system_score_gemma":0.00006530372,"threshold_uncertainty_score":0.38426098},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20918931,0.000785315,0.78849953,0.00017875349,0.00013688795,0.0008468061,0.0000029667308,0.00017635606,0.00018409215],"genre_scores_gemma":[0.850534,0.0007120223,0.14852905,0.000012853664,0.00003130011,0.000118964694,0.0000093131,0.000027323882,0.000025166291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985509,0.00006873744,0.00028544076,0.00033133285,0.00019183368,0.0005717341],"domain_scores_gemma":[0.99921143,0.0003800508,0.000008264985,0.00022394827,0.00008391359,0.000092405426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008236629,0.00015221519,0.00019578548,0.00019374579,0.00035747077,0.00016187936,0.000108807355,0.000112316324,0.000002625051],"category_scores_gemma":[0.00025157013,0.00014644754,0.000020777665,0.0002885109,0.000109808614,0.00018119103,0.00017886462,0.0004055371,0.0000015166611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029528348,0.000024135084,0.0002835695,0.00003087233,0.000008904183,0.0000047001076,0.00024481828,0.91863245,0.00044854608,0.008577327,0.00015343328,0.0715883],"study_design_scores_gemma":[0.00047743722,0.000084726475,0.0008012836,0.00012473782,0.0000015282051,0.0000043683053,0.00030692318,0.9966293,0.0003144967,0.0004889852,0.0006044466,0.00016176423],"about_ca_topic_score_codex":0.000009669016,"about_ca_topic_score_gemma":0.000027585573,"teacher_disagreement_score":0.6413447,"about_ca_system_score_codex":0.00018190668,"about_ca_system_score_gemma":0.000016831256,"threshold_uncertainty_score":0.59719574},"labels":[],"label_agreement":null},{"id":"W2010102206","doi":"10.1016/j.cor.2008.05.005","title":"The pickup and delivery traveling salesman problem with first-in-first-out loading","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Tabu search; Heuristics; Iterated local search; Mathematical optimization; Computer science; 2-opt; Bottleneck traveling salesman problem; Integer programming; Iterated function; Probabilistic logic; Metaheuristic; Traveling purchaser problem; Mathematics; Artificial intelligence","score_opus":0.05876710399495647,"score_gpt":0.30697327359526316,"score_spread":0.2482061696003067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010102206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4981586,0.00067091803,0.49804133,0.0009772453,0.00013439306,0.00068188476,0.0000019630697,0.00020509161,0.0011285845],"genre_scores_gemma":[0.8303414,0.00093881885,0.1683559,0.000015453095,0.00007458851,0.00006592408,0.000004787771,0.000037226964,0.00016589907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985873,0.00016842705,0.00024917637,0.0002482191,0.00031185916,0.00043499458],"domain_scores_gemma":[0.9987172,0.0007231882,0.000008364184,0.00026967545,0.00018350233,0.00009807005],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00096049695,0.00013094406,0.00013561828,0.00019225162,0.0014387795,0.00024868193,0.00025529342,0.000059548318,0.0000053220824],"category_scores_gemma":[0.000070626294,0.00010499289,0.000018868379,0.0005373207,0.0001991061,0.00021239319,0.00009512419,0.00044232706,0.000015876698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072958846,0.000013033759,0.0023780724,0.00003357306,0.000018293804,0.000018038032,0.0037077845,0.99075645,0.00014577845,0.00034590287,0.00043410985,0.002141685],"study_design_scores_gemma":[0.00041491186,0.00005050003,0.003071232,0.00011815803,0.0000025000984,0.000041849707,0.00019630183,0.99439484,0.00030222104,0.000014121483,0.0012497881,0.00014359488],"about_ca_topic_score_codex":0.00007594018,"about_ca_topic_score_gemma":0.0018002092,"teacher_disagreement_score":0.3321828,"about_ca_system_score_codex":0.0001398863,"about_ca_system_score_gemma":0.000094813324,"threshold_uncertainty_score":0.99986124},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85267526,0.00010981669,0.14286396,0.0009851801,0.001195145,0.0008069023,0.00000855373,0.00036039032,0.0009947841],"genre_scores_gemma":[0.95552176,0.000020279127,0.043746468,0.000012784716,0.00021155499,0.0000823669,0.00007622219,0.0000218358,0.00030673438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888474,0.00013058959,0.0002454812,0.00025790505,0.00024807005,0.0002332295],"domain_scores_gemma":[0.9992226,0.00006145555,0.000008017801,0.00023232645,0.0003905779,0.00008505066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092525827,0.00010842093,0.00012797966,0.00045490864,0.000329471,0.00034998616,0.0001277328,0.000062311,0.000024552293],"category_scores_gemma":[0.0001119652,0.000115915784,0.000013794055,0.00066659966,0.00013542741,0.00032679207,0.000050705807,0.00051906565,0.000033811175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789789,0.000036384034,0.00030355022,0.000063722364,0.000009438872,0.000003541133,0.00085700746,0.96163625,0.01191357,0.02184679,0.00044719133,0.0028777854],"study_design_scores_gemma":[0.00044332046,0.000019944975,0.00058389705,0.00003390176,0.0000018334056,0.000017615574,0.00027028975,0.9959105,0.0018898548,0.0000069544813,0.00070412055,0.00011775885],"about_ca_topic_score_codex":0.00029575883,"about_ca_topic_score_gemma":0.0019914918,"teacher_disagreement_score":0.10284649,"about_ca_system_score_codex":0.000097458906,"about_ca_system_score_gemma":0.000056738325,"threshold_uncertainty_score":0.47269085},"labels":[],"label_agreement":null},{"id":"W2013782474","doi":"10.1016/j.cor.2014.05.012","title":"The impact of hub failure in hub-and-spoke networks: Mathematical formulations and solution techniques","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Backup; Operations research; Spoke-hub distribution paradigm; Computer science; Linearization; Heuristic; Facility location problem; Function (biology); Mathematical optimization; Natural disaster; Flow network; Mathematical model; Transport engineering; Mathematics; Engineering","score_opus":0.03528771779630964,"score_gpt":0.3742071828086215,"score_spread":0.33891946501231185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013782474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08636761,0.00008225468,0.91261375,0.00027531217,0.000017684042,0.00030858393,0.000001411032,0.0000730997,0.0002603001],"genre_scores_gemma":[0.829331,0.000090272646,0.17045969,0.0000029583002,0.0000401267,0.000034645902,0.0000054846387,0.000014227743,0.000021630998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989511,0.000281442,0.00025405208,0.00012072735,0.00015360396,0.00023910333],"domain_scores_gemma":[0.9988718,0.00069384224,0.000010184196,0.00021652496,0.00014910105,0.000058514746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017914274,0.00008334665,0.00012979087,0.00019669996,0.0003036628,0.00015682782,0.00013112219,0.000075255935,0.0000053261265],"category_scores_gemma":[0.00024028243,0.00006346903,0.00002699921,0.00041514667,0.00013528512,0.00015812954,0.00009749586,0.000271684,0.0000013905789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025449824,0.00001420347,0.0006253689,0.00001807579,0.000012738337,1.5475429e-7,0.00034521063,0.9623902,0.00065567653,0.010743924,0.0003003782,0.024891557],"study_design_scores_gemma":[0.00011710428,0.000048419453,0.0039904085,0.00004747556,0.0000019258753,0.000004687724,0.000026661955,0.99460614,0.00017426925,0.0008495665,0.00007226413,0.000061066065],"about_ca_topic_score_codex":0.000041861018,"about_ca_topic_score_gemma":0.00007725141,"teacher_disagreement_score":0.7429634,"about_ca_system_score_codex":0.0000711545,"about_ca_system_score_gemma":0.000025130286,"threshold_uncertainty_score":0.2588192},"labels":[],"label_agreement":null},{"id":"W2016268962","doi":"10.1016/j.cor.2003.11.016","title":"Hub-and-spoke network design with congestion","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":168,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spoke-hub distribution paradigm; Network planning and design; Computer science; Mathematical optimization; Heuristic; Term (time); Function (biology); Network model; Operations research; Mathematics; Computer network; Artificial intelligence; Transport engineering","score_opus":0.07669300078247837,"score_gpt":0.3428464463994623,"score_spread":0.26615344561698395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016268962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01946427,0.00019038196,0.9788409,0.00046081803,0.00011812282,0.00036822923,9.450674e-7,0.0002518526,0.00030448817],"genre_scores_gemma":[0.3697007,0.00006878149,0.62994355,0.00003165852,0.00012113344,0.000039567814,0.0000081354865,0.00002699501,0.000059460344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.00024264336,0.00014858611,0.00019826148,0.00025962424,0.00033701674],"domain_scores_gemma":[0.9992342,0.00020617162,0.0000049756604,0.0002219849,0.00022137401,0.000111278045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010590163,0.00010462123,0.00011212276,0.00014885134,0.00039442,0.00023684057,0.00014509233,0.00006375989,0.000013990449],"category_scores_gemma":[0.000056786514,0.000098470846,0.000012275265,0.00062760257,0.0001079039,0.00018403216,0.00005127295,0.00031664292,0.000031113443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062379663,0.000010177949,0.00006216154,0.0000123287655,0.000013927264,0.000005553439,0.00027650627,0.99091595,0.00022739962,0.003215274,0.00039725873,0.0048572314],"study_design_scores_gemma":[0.00048665504,0.00010916184,0.0008844936,0.00007396161,0.000004691274,0.000023495086,0.000032032014,0.99716306,0.00061586674,0.00019206532,0.00027862669,0.00013586509],"about_ca_topic_score_codex":0.000025511621,"about_ca_topic_score_gemma":0.000024915924,"teacher_disagreement_score":0.35023645,"about_ca_system_score_codex":0.00012286277,"about_ca_system_score_gemma":0.000087677145,"threshold_uncertainty_score":0.40155244},"labels":[],"label_agreement":null},{"id":"W2016827346","doi":"10.1016/j.cor.2012.04.010","title":"A branch-price-and-cut algorithm for the workover rig routing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; National Science Council","keywords":"Workover; Vehicle routing problem; Computer science; Routing (electronic design automation); Mathematical optimization; Set (abstract data type); Algorithm; Mathematics; Engineering; Petroleum engineering; Computer network","score_opus":0.06427568574875933,"score_gpt":0.3626531758041617,"score_spread":0.2983774900554024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016827346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002450752,0.00072793465,0.9942617,0.00057360565,0.000350001,0.00079564325,0.0000068455797,0.00017287531,0.00066067546],"genre_scores_gemma":[0.22487922,0.00008937501,0.77363014,0.00007375951,0.0006068334,0.00022508927,0.000011356238,0.000048955768,0.00043529083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985428,0.00019915882,0.00022400859,0.00017598589,0.00027395668,0.0005841036],"domain_scores_gemma":[0.99834085,0.0010123817,0.000009373944,0.00028884434,0.0002220709,0.00012645805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023890382,0.00012155331,0.00012683382,0.00013843332,0.00078595465,0.0003329752,0.00026338076,0.00007350978,0.000026447393],"category_scores_gemma":[0.00013620163,0.00009795827,0.000042673044,0.0005457737,0.00008468507,0.0003053192,0.00014686654,0.00036782905,0.000026005979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019730812,0.00002657531,0.0001914217,0.000028135886,0.000059013713,2.5050372e-7,0.0019150665,0.6224983,0.0002997473,0.0027771534,0.0034186996,0.36878368],"study_design_scores_gemma":[0.00025338025,0.000016268279,0.0005273468,0.000028390923,0.0000072912967,0.000007234094,0.00008171728,0.99141175,0.0003896854,0.00005104619,0.0071068304,0.00011906644],"about_ca_topic_score_codex":0.00002339992,"about_ca_topic_score_gemma":0.0000070371884,"teacher_disagreement_score":0.36891347,"about_ca_system_score_codex":0.00010156031,"about_ca_system_score_gemma":0.000039041974,"threshold_uncertainty_score":0.6045007},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10739425,0.000111099296,0.88978314,0.0012712431,0.00024761714,0.0007555518,0.000019733292,0.00016609539,0.00025125567],"genre_scores_gemma":[0.34847835,0.000033373915,0.65066147,0.000062217274,0.00024340967,0.00016204188,0.00009590615,0.00004531796,0.00021793638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836177,0.0001491858,0.00026102617,0.0003471478,0.0005069571,0.0003739345],"domain_scores_gemma":[0.99863,0.00021592829,0.000010267544,0.0003951816,0.0005250744,0.00022356788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392611,0.00019016945,0.00020016979,0.00025347632,0.0007242417,0.0007162823,0.00028068514,0.00008451082,0.00010216106],"category_scores_gemma":[0.000078931545,0.00014499832,0.000029694751,0.0005911573,0.00014507321,0.00029555915,0.00014111421,0.0005434028,0.00004700786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017982728,0.0000359078,0.000008157789,0.000010624497,0.000040301264,0.0000038133664,0.00090080476,0.9964297,0.0011713032,0.00024557565,0.0003823459,0.00075351447],"study_design_scores_gemma":[0.0004216595,0.00006746955,0.00008514383,0.000029908746,0.000015765252,0.000042688705,0.00014629118,0.99869096,0.00020787404,0.000005942526,0.00009629452,0.00018999695],"about_ca_topic_score_codex":0.000030341522,"about_ca_topic_score_gemma":0.000016948,"teacher_disagreement_score":0.2410841,"about_ca_system_score_codex":0.000060310613,"about_ca_system_score_gemma":0.00009362279,"threshold_uncertainty_score":0.69071263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012180416,0.000029844912,0.9698939,0.0007783608,0.00007579456,0.016828049,2.2097385e-7,0.00006257392,0.00015086708],"genre_scores_gemma":[0.879373,0.000008093884,0.106048696,0.000059864848,0.00005093789,0.014327177,0.0000011768768,0.000009193706,0.00012182606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979039,0.0003555524,0.00034795946,0.00042576357,0.00051446754,0.00045237222],"domain_scores_gemma":[0.9986381,0.00027083434,0.000031044205,0.0005524016,0.00041824623,0.0000893937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123256,0.00013925214,0.00019642246,0.00030731215,0.00015373295,0.0002534859,0.0012390096,0.00005928548,0.0000096053545],"category_scores_gemma":[0.000037551996,0.0001114039,0.000028932684,0.0011845437,0.00021888004,0.00067457143,0.0002746539,0.0004310149,0.000016710932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079212485,0.00014304263,0.00022071782,0.000015193271,0.000010293303,0.000017356982,0.0006455065,0.92416406,0.00003252823,0.014650367,0.00033517572,0.059686534],"study_design_scores_gemma":[0.0014198814,0.00072582933,0.00087054004,0.00032941977,9.711732e-7,0.000020925223,0.000022580207,0.99562657,0.000582406,0.00009585957,0.00017850292,0.00012651352],"about_ca_topic_score_codex":0.00011669231,"about_ca_topic_score_gemma":0.00012524567,"teacher_disagreement_score":0.8671926,"about_ca_system_score_codex":0.000099673205,"about_ca_system_score_gemma":0.00041992843,"threshold_uncertainty_score":0.45429188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10285768,0.00008366968,0.8889821,0.0049815984,0.00020834662,0.0020553458,0.000030401892,0.00018660627,0.0006142571],"genre_scores_gemma":[0.9685128,0.000055384324,0.027090985,0.0003003353,0.00021435527,0.0006621594,0.0014767727,0.000018755272,0.0016684609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986029,0.000035385063,0.00034982478,0.0003634707,0.0003170925,0.00033128678],"domain_scores_gemma":[0.99782884,0.000051774812,0.00002080439,0.00028069515,0.0017862592,0.000031615356],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006582195,0.00013025118,0.000120660115,0.00040541694,0.0021995872,0.00028543055,0.00019333376,0.00006424189,0.000046581183],"category_scores_gemma":[0.00038283228,0.00013444536,0.000042623604,0.0012854749,0.00017447214,0.0011210056,0.00013814731,0.00016248431,0.00019173985],"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.00005283268,0.0008319638,0.002365382,0.0005196633,0.00010808744,0.0000028161257,0.0017711397,0.3019786,0.00052630797,0.5867929,0.093881585,0.011168717],"study_design_scores_gemma":[0.0006654381,0.000021133003,0.009936993,0.000025862098,0.000012549195,0.0000026082423,0.00023351479,0.9451437,0.00002422976,0.00054291,0.04322662,0.00016441641],"about_ca_topic_score_codex":0.0017443453,"about_ca_topic_score_gemma":0.0022278258,"teacher_disagreement_score":0.8656551,"about_ca_system_score_codex":0.000111661866,"about_ca_system_score_gemma":0.000091794325,"threshold_uncertainty_score":0.99909943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37501398,0.002669606,0.32847655,0.1461392,0.004563447,0.006603507,0.0000065022273,0.0011610289,0.13536619],"genre_scores_gemma":[0.9885798,0.00016538655,0.0017428567,0.0008820195,0.00067894085,0.0002138064,0.00003741152,0.000018647972,0.00768115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847406,0.000057338868,0.000276895,0.00027851324,0.00053169107,0.00038149316],"domain_scores_gemma":[0.99886376,0.000033567485,0.000011074251,0.00041105977,0.00066197885,0.000018536857],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010430788,0.00010741168,0.00008330039,0.00023794764,0.0017784266,0.0012828624,0.00048248933,0.000032146116,0.0004915124],"category_scores_gemma":[0.00011174286,0.00008527086,0.000040200444,0.0010989202,0.00011828217,0.0007714204,0.00032177885,0.00018738853,0.002476043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016824482,0.00019315617,0.00026100953,0.00011904783,0.000047738296,0.0000032072198,0.00030316535,0.4434383,0.00024749435,0.292831,0.19528405,0.06725499],"study_design_scores_gemma":[0.0002015294,0.000007007908,0.00060687575,0.000011584661,0.0000035952269,4.925378e-7,0.00011353083,0.7532041,0.000011514703,0.0002519984,0.24549663,0.000091115326],"about_ca_topic_score_codex":0.0016316159,"about_ca_topic_score_gemma":0.001625547,"teacher_disagreement_score":0.6135658,"about_ca_system_score_codex":0.00007869191,"about_ca_system_score_gemma":0.000017803573,"threshold_uncertainty_score":0.9997539},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8178257,0.0005434984,0.10607037,0.020597298,0.0007150651,0.0024710237,0.000051572617,0.00020281428,0.05152271],"genre_scores_gemma":[0.98928285,0.000021759595,0.0018074451,0.0005639572,0.00014932943,0.0001240641,0.000059540875,0.000013848178,0.0079772165],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822456,0.00007006881,0.00041028127,0.00036038103,0.00057861785,0.00035612122],"domain_scores_gemma":[0.99875116,0.00006856951,0.000018087097,0.000379551,0.0007453513,0.000037286045],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006841118,0.00014003116,0.00017306556,0.00050734344,0.00050460635,0.0002859753,0.00040071734,0.000043934557,0.001137457],"category_scores_gemma":[0.00042393993,0.00014100871,0.000052208183,0.001081655,0.00014165053,0.0008760331,0.00036417434,0.00018052108,0.001636701],"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.000050755203,0.0012971589,0.0043716775,0.00090157863,0.00018797947,0.000010298163,0.0062857177,0.095750906,0.0020177062,0.11226726,0.7312763,0.04558272],"study_design_scores_gemma":[0.0006725973,0.0000904948,0.0038489387,0.00011617483,0.000022215338,0.0000011702368,0.0033357486,0.80075145,0.00033055467,0.00038347655,0.1900061,0.00044108284],"about_ca_topic_score_codex":0.0022989218,"about_ca_topic_score_gemma":0.0007879302,"teacher_disagreement_score":0.7050005,"about_ca_system_score_codex":0.00006605683,"about_ca_system_score_gemma":0.000016378355,"threshold_uncertainty_score":0.99977565},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66454816,0.00039827896,0.33252838,0.0012011778,0.00032462683,0.0003008701,0.000018947703,0.00006713056,0.0006124316],"genre_scores_gemma":[0.94157755,0.000010286851,0.057462655,0.000029548719,0.00033011212,0.00004424182,0.000010190065,0.000013504294,0.0005218933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619484,0.000653937,0.0005176909,0.00065425434,0.0012756548,0.00070360175],"domain_scores_gemma":[0.99630135,0.001677396,0.000040708845,0.00056338,0.0012233083,0.00019385693],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004676559,0.00014151454,0.00023765999,0.0009962049,0.0029164455,0.001280026,0.00046794783,0.00008747549,0.00005267847],"category_scores_gemma":[0.0022925485,0.0001265008,0.00008536682,0.002568219,0.00056538003,0.00048861624,0.0003949373,0.00047848697,0.000144434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099121404,0.0008671938,0.012630163,0.000014941647,0.00015683609,0.00007665722,0.0019496258,0.6473322,0.045540318,0.26707894,0.016616715,0.007637321],"study_design_scores_gemma":[0.0004068034,0.00006776687,0.005601181,0.000032636257,0.000013824145,0.000040913998,0.00037678567,0.98166484,0.0004448028,0.0080351485,0.0031304352,0.00018486133],"about_ca_topic_score_codex":0.001893067,"about_ca_topic_score_gemma":0.00040893664,"teacher_disagreement_score":0.33433267,"about_ca_system_score_codex":0.00012186947,"about_ca_system_score_gemma":0.00039655087,"threshold_uncertainty_score":0.99975675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2286417,0.00013602387,0.72110945,0.008573066,0.0012543527,0.0022896833,0.0000015208772,0.00032973452,0.03766448],"genre_scores_gemma":[0.99654293,0.0000093130275,0.00037802878,0.0011124264,0.00046648324,0.00012259732,0.00007941917,0.00001903487,0.001269786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843454,0.00005060162,0.00020157517,0.0003542899,0.0006324978,0.00032651192],"domain_scores_gemma":[0.998733,0.000033383818,0.000012192943,0.00038994645,0.00079142733,0.000040092313],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011011868,0.00013519771,0.00010981791,0.00041732998,0.00047593637,0.0006370234,0.0002916928,0.000041422813,0.00007032187],"category_scores_gemma":[0.000112581365,0.00011345867,0.000020899402,0.0010950464,0.000074369505,0.00059836457,0.00015931236,0.00024255845,0.0010028987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004456586,0.00013586335,0.0001563906,0.000041617863,0.000014775379,0.0000019423007,0.00009000782,0.9227166,0.000004048158,0.040760763,0.033304412,0.002729017],"study_design_scores_gemma":[0.0005469477,0.000117078955,0.0010620428,0.00010092677,0.0000053799045,4.5299922e-7,0.00014724731,0.9740451,0.00000723576,0.00019672823,0.023618162,0.00015270327],"about_ca_topic_score_codex":0.0009832251,"about_ca_topic_score_gemma":0.0013513706,"teacher_disagreement_score":0.7679012,"about_ca_system_score_codex":0.00012347683,"about_ca_system_score_gemma":0.0000584634,"threshold_uncertainty_score":0.99977493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18936849,0.00023143223,0.80844223,0.00030115203,0.0001197182,0.00038895066,0.000006078314,0.00040723573,0.0007346843],"genre_scores_gemma":[0.512243,0.000076241835,0.4872966,0.000032719527,0.00012806596,0.000066230874,0.00004975748,0.000045475255,0.00006189734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997743,0.00012341395,0.0003685239,0.00044532656,0.00070561375,0.0006141279],"domain_scores_gemma":[0.99822176,0.0001522036,0.00001468436,0.00044042818,0.00092930865,0.0002416131],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005001747,0.00026248282,0.0002493559,0.000512403,0.0013589164,0.00035455177,0.0003380023,0.00011581089,0.000069768015],"category_scores_gemma":[0.000084840685,0.00022777314,0.00004046305,0.0013072891,0.0003979858,0.0005127613,0.000045535515,0.00076805655,0.00007516915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015548187,0.000041531206,0.00012062382,0.000022890628,0.0000689199,0.000053685348,0.0010525071,0.99684954,0.00013048726,0.00063684105,0.000037691047,0.00096976355],"study_design_scores_gemma":[0.0007902471,0.000095540236,0.000020250724,0.0001865716,0.000009137135,0.00020607896,0.0012935053,0.9967491,0.00030316453,0.000008115998,0.000021119618,0.00031719008],"about_ca_topic_score_codex":0.000054470598,"about_ca_topic_score_gemma":0.00007199762,"teacher_disagreement_score":0.32287452,"about_ca_system_score_codex":0.00018045022,"about_ca_system_score_gemma":0.00043360546,"threshold_uncertainty_score":0.9999412},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.287523,0.000051343704,0.70846146,0.0012848407,0.00022409378,0.0015353658,0.0000108058075,0.0001482208,0.000760862],"genre_scores_gemma":[0.13383174,0.000036287667,0.8589531,0.00009443316,0.00044185508,0.000275409,0.00004363572,0.000076770346,0.006246775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604625,0.0008455764,0.000533154,0.0006288073,0.001087583,0.0008586154],"domain_scores_gemma":[0.99598145,0.00074894464,0.000032082848,0.0009880969,0.0018937701,0.0003556737],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013208622,0.0002188883,0.00028094,0.0005812303,0.0017392628,0.0007082179,0.00062672526,0.00012207379,0.0009863683],"category_scores_gemma":[0.0013756709,0.00020665229,0.0001066322,0.0014916719,0.00039048036,0.0009726912,0.0005942255,0.00082463416,0.00035832118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043906395,0.0018999848,0.0040485743,0.00023958819,0.0002297528,0.000028473147,0.0027310092,0.81272537,0.027046908,0.07763359,0.047334425,0.02603841],"study_design_scores_gemma":[0.00048004757,0.00008194793,0.0013246811,0.000041269286,0.000006884609,0.000019352186,0.00030176624,0.9920107,0.0003024006,0.0044344855,0.0007477868,0.00024863987],"about_ca_topic_score_codex":0.0006124607,"about_ca_topic_score_gemma":0.0001423209,"teacher_disagreement_score":0.17928536,"about_ca_system_score_codex":0.00062754593,"about_ca_system_score_gemma":0.0003996828,"threshold_uncertainty_score":0.99992687},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0134689,0.00026227863,0.9427016,0.011459113,0.0017883662,0.0018116285,0.000003998858,0.00022738622,0.028276762],"genre_scores_gemma":[0.6014569,0.000032237487,0.36570978,0.012220488,0.007689506,0.0012186524,0.0004590852,0.00015443619,0.011058925],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984266,0.00011397617,0.00023876967,0.00038306715,0.0004013194,0.00043624573],"domain_scores_gemma":[0.9987696,0.00020951347,0.000023448616,0.0003847691,0.00056829787,0.000044384393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028075771,0.00015184918,0.00016895944,0.0005883792,0.00058177306,0.00097489305,0.000504684,0.00003091731,0.00008442821],"category_scores_gemma":[0.00045381888,0.00013560426,0.00007682752,0.00041094908,0.00008192751,0.0006324302,0.00040039388,0.00019461472,0.00042992094],"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.00013138863,0.00033703033,0.00022960517,0.00014081047,0.00007827657,0.00001160343,0.00025501402,0.10751313,0.00018743558,0.27230582,0.43413356,0.1846763],"study_design_scores_gemma":[0.00057051645,0.00004938609,0.000060955692,0.000021893926,0.000006288883,5.7219575e-7,0.00015466819,0.59990084,0.000041037416,0.0033264598,0.39574227,0.00012510642],"about_ca_topic_score_codex":0.00034164955,"about_ca_topic_score_gemma":0.00004334783,"teacher_disagreement_score":0.58798796,"about_ca_system_score_codex":0.0001012368,"about_ca_system_score_gemma":0.0000522054,"threshold_uncertainty_score":0.9400916},"labels":[],"label_agreement":null},{"id":"W2028470441","doi":"10.1016/j.cor.2014.07.004","title":"Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Vehicle routing problem; Modular design; Heuristic; Computer science; Sizing; Mathematical optimization; Depot; Algorithm; Routing (electronic design automation); Mathematics","score_opus":0.11255804548950706,"score_gpt":0.3764900752146841,"score_spread":0.26393202972517704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028470441","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10513518,0.00026067736,0.89341515,0.00007562448,0.0001860111,0.00065486383,0.0000074323716,0.00023452146,0.00003053114],"genre_scores_gemma":[0.40581602,0.000016030684,0.5938614,0.000017453249,0.00013939994,0.00005708926,0.000012080815,0.00005057884,0.000029930785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804604,0.00035789082,0.00036218535,0.00038331907,0.0002900643,0.0005605139],"domain_scores_gemma":[0.99879867,0.0003525308,0.000016952736,0.00030870654,0.0003638844,0.00015922943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002089779,0.00017748715,0.00023061722,0.00028933352,0.000997117,0.00055362895,0.00022712794,0.000099334655,0.000004759103],"category_scores_gemma":[0.0004263828,0.00019687862,0.000045722758,0.00047370553,0.00011264521,0.0002434249,0.0001536641,0.0003540707,0.00000654528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013199026,0.000020926163,0.00013234778,0.000085751926,0.00002124822,0.0000010523788,0.0008647662,0.9413551,0.010819878,0.00023672069,0.000021435117,0.046439447],"study_design_scores_gemma":[0.00065178657,0.00005390907,0.0002458147,0.00010227016,0.000009423578,0.000012467917,0.00010046629,0.99740326,0.00088705815,0.000028751927,0.00029436251,0.00021043059],"about_ca_topic_score_codex":0.00007143829,"about_ca_topic_score_gemma":0.000016922386,"teacher_disagreement_score":0.30068082,"about_ca_system_score_codex":0.00014743187,"about_ca_system_score_gemma":0.000056933506,"threshold_uncertainty_score":0.8028477},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31931308,0.00055188447,0.6744173,0.0028220592,0.00080452417,0.0012667413,0.000003064735,0.0002607848,0.00056056824],"genre_scores_gemma":[0.740689,0.000052942007,0.25696462,0.000066196524,0.0011746486,0.000097337834,0.0000046456234,0.000012520958,0.0009380631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977059,0.0003164338,0.00024979663,0.0006163995,0.00056758034,0.0005439206],"domain_scores_gemma":[0.9986157,0.000111914305,0.000013218897,0.00084231276,0.00022602774,0.00019083657],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001550799,0.00014565681,0.00014985714,0.00028348624,0.0011513307,0.00196086,0.0010142605,0.000035120425,0.000008198318],"category_scores_gemma":[0.00002573538,0.00013721766,0.00002695188,0.0010476853,0.00008560957,0.0014433499,0.0017675534,0.00033244182,0.00009215118],"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.0000016814,0.00032616532,0.0010317942,0.000004552735,0.00004590218,0.0012289936,0.002372777,0.010596289,0.0000072515063,0.0020969734,0.0057580317,0.9765296],"study_design_scores_gemma":[0.0005649529,0.00028128954,0.001970291,0.000016115042,0.000005124829,0.0003287094,0.0009255919,0.98670137,0.000023650351,0.000054920063,0.008925915,0.0002020577],"about_ca_topic_score_codex":0.00051411375,"about_ca_topic_score_gemma":0.00015912313,"teacher_disagreement_score":0.97632754,"about_ca_system_score_codex":0.000064533146,"about_ca_system_score_gemma":0.00006237002,"threshold_uncertainty_score":0.9990752},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31923223,0.000105303756,0.67901146,0.00092009275,0.0000728319,0.00029871118,5.686868e-7,0.00003349693,0.00032528155],"genre_scores_gemma":[0.9765135,0.000015011995,0.02315162,0.00019460334,0.00002807978,0.00004395289,0.0000024902731,0.0000066351517,0.00004409523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719936,0.0011270045,0.000412457,0.00048198472,0.00042466095,0.00035453276],"domain_scores_gemma":[0.9976955,0.0008797933,0.000033907912,0.00056384294,0.00070774695,0.000119176824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032256548,0.00012321543,0.00024752482,0.000175055,0.00023650393,0.00021636687,0.0005173736,0.000074508316,0.0000059089166],"category_scores_gemma":[0.0002462686,0.0001038126,0.000022779543,0.0014964754,0.00014064052,0.00038383494,0.00015457658,0.00048850506,0.0000030210826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020332951,0.00017543201,0.005126304,0.000024315339,0.000017630688,0.0000048534794,0.0019124637,0.57201165,0.00028329223,0.2980765,0.000065386215,0.12228183],"study_design_scores_gemma":[0.00078827265,0.00016518502,0.006809783,0.000069400325,0.000001389346,0.0000052952014,0.0002776993,0.9914428,0.00006725466,0.00016080588,0.00008322175,0.00012890087],"about_ca_topic_score_codex":0.00037253764,"about_ca_topic_score_gemma":0.0020468128,"teacher_disagreement_score":0.6572813,"about_ca_system_score_codex":0.00006575895,"about_ca_system_score_gemma":0.00030337324,"threshold_uncertainty_score":0.4233355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025512673,0.000016856135,0.9728817,0.00014236962,0.00015290803,0.0010651284,0.000037155634,0.000047717065,0.00014349501],"genre_scores_gemma":[0.3102699,9.5239506e-7,0.68900174,0.000051592917,0.00017748162,0.0002016584,0.00012623733,0.000019533147,0.00015094657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987921,0.00008818896,0.00022861527,0.00031671263,0.0002699089,0.00030446224],"domain_scores_gemma":[0.9990679,0.00007022645,0.000024511843,0.00020342025,0.0005340961,0.000099833735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919562,0.00011568499,0.00011558296,0.0002430023,0.00051556126,0.00012201489,0.00021418808,0.00003143043,0.00034402133],"category_scores_gemma":[0.000009649936,0.00012715327,0.00004391803,0.00033543163,0.000057329606,0.0004986981,0.00007087062,0.000117566095,0.000011768549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019937826,0.00010154739,0.00038657195,0.0000068748045,0.00003106328,2.5498798e-7,0.0007477492,0.9777217,0.0030390979,0.009382465,0.00060962123,0.007953111],"study_design_scores_gemma":[0.00028949798,0.00014001719,0.00026249638,0.000027195116,0.0000036140555,6.7767553e-7,0.000055232234,0.9940745,0.0036662195,0.0010047986,0.00032762196,0.00014812179],"about_ca_topic_score_codex":0.00014419205,"about_ca_topic_score_gemma":0.000002233217,"teacher_disagreement_score":0.2847572,"about_ca_system_score_codex":0.00015101688,"about_ca_system_score_gemma":0.00013164089,"threshold_uncertainty_score":0.518516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40857893,0.00010739843,0.58933085,0.00036285812,0.000099464254,0.00033289206,0.0000075849794,0.000027151504,0.0011528712],"genre_scores_gemma":[0.89674616,0.000009763483,0.10289309,0.000054735236,0.000056704648,0.000029753342,0.000030500825,0.000014374606,0.00016492959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935168,0.0007793144,0.00096516125,0.00077182543,0.0035234287,0.00044346138],"domain_scores_gemma":[0.9922414,0.0019101511,0.000098697674,0.0012546314,0.0043544774,0.00014068025],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008076263,0.00015456737,0.0003274726,0.0018960212,0.0008691058,0.0010381528,0.0018501078,0.00011787441,0.000073871335],"category_scores_gemma":[0.006795158,0.00012694931,0.00010312707,0.008952458,0.0004199045,0.00076906336,0.0005364872,0.00040072412,0.00017796713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025621399,0.00028105947,0.0014478997,0.0000054802113,0.000024988756,0.000006041267,0.0021400983,0.9228534,0.0008718872,0.009722274,0.0019244738,0.06069679],"study_design_scores_gemma":[0.00060864934,0.00013571864,0.015801702,0.00023884657,0.00001190424,0.000009819385,0.0014187348,0.97719806,0.00064786046,0.0032008,0.00051630347,0.00021157369],"about_ca_topic_score_codex":0.00052525505,"about_ca_topic_score_gemma":0.00070235995,"teacher_disagreement_score":0.48816723,"about_ca_system_score_codex":0.00048222975,"about_ca_system_score_gemma":0.00066262827,"threshold_uncertainty_score":0.99999887},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4005796,0.00004217586,0.5985833,0.00010160599,0.00011263212,0.00030325382,0.00009613629,0.000011414259,0.0001698839],"genre_scores_gemma":[0.9680064,0.000009237368,0.031694703,0.000008675457,0.00007328568,0.00012540595,0.00004292301,0.000015403712,0.00002400513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998764,0.000015311156,0.00045503426,0.0003641085,0.000104012164,0.00029753978],"domain_scores_gemma":[0.9990514,0.00026610674,0.00007853372,0.00034711818,0.00018034845,0.00007648586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071022514,0.000116652554,0.00025529656,0.0005827983,0.0002791921,0.00008194236,0.00033018616,0.00010269871,0.000047157282],"category_scores_gemma":[0.00070821523,0.00011870924,0.00003787781,0.0010174075,0.00019626744,0.00020307062,0.00007993327,0.000559333,0.00006282667],"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.000040047278,0.00035220047,0.003926143,0.000027439082,0.000015554016,0.0000019684899,0.0018182758,0.10816575,0.00009078436,0.8734075,0.00011859701,0.012035739],"study_design_scores_gemma":[0.0006724011,0.00012521009,0.16424812,0.00003410881,0.0000033997162,0.0000033832428,0.000075306234,0.7897201,0.0001104065,0.044575546,0.00020677433,0.00022522076],"about_ca_topic_score_codex":0.0013734967,"about_ca_topic_score_gemma":0.0010199031,"teacher_disagreement_score":0.828832,"about_ca_system_score_codex":0.00005081968,"about_ca_system_score_gemma":0.00016016705,"threshold_uncertainty_score":0.48408222},"labels":[],"label_agreement":null},{"id":"W2033271291","doi":"10.1016/j.cor.2009.08.003","title":"Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Travelling salesman problem; Pickup; Branch and cut; FIFO (computing and electronics); Mathematical optimization; Computer science; 2-opt; Traveling purchaser problem; Branch and bound; Bottleneck traveling salesman problem; Algorithm; Combinatorial optimization; Mathematics; Integer programming; Artificial intelligence","score_opus":0.05253349140854373,"score_gpt":0.33150602625391756,"score_spread":0.2789725348453738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033271291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13110419,0.00043461836,0.8664597,0.0010773888,0.000039980885,0.0005922666,0.0000028707138,0.00010426942,0.0001846777],"genre_scores_gemma":[0.7338694,0.0001663022,0.2656736,0.000064248256,0.000085132015,0.000038485552,0.000005855192,0.000018656983,0.0000783225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991117,0.00009172402,0.00015273222,0.00019604675,0.00017119406,0.0002765809],"domain_scores_gemma":[0.9990796,0.0004888178,0.0000062002287,0.0001735702,0.00017974994,0.00007209975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008424767,0.000100987956,0.00010969138,0.00011134149,0.0006511332,0.00033729326,0.00014568008,0.000045233377,0.000003328749],"category_scores_gemma":[0.000041975793,0.00007725584,0.000016647293,0.00028589368,0.00008146104,0.0001666548,0.000035761026,0.00024667376,0.0000018666315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009273736,0.000008633178,0.000097987766,0.00003235048,0.00002587793,9.67104e-7,0.0012552235,0.91877586,0.0020180228,0.0013332523,0.00030788739,0.07613466],"study_design_scores_gemma":[0.00037448024,0.00011640843,0.0011536939,0.00006195624,0.00000830968,0.000015654416,0.000099024764,0.9967667,0.00080695335,0.00008480732,0.00040721055,0.0001048382],"about_ca_topic_score_codex":0.000014251136,"about_ca_topic_score_gemma":0.00003597131,"teacher_disagreement_score":0.6027652,"about_ca_system_score_codex":0.00004203065,"about_ca_system_score_gemma":0.000038626702,"threshold_uncertainty_score":0.5008056},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088980675,0.00015809044,0.08649308,0.069826655,0.0062101223,0.0026765545,0.0000098764895,0.0006250734,0.74501985],"genre_scores_gemma":[0.9635487,0.000037580387,0.0005001213,0.0021639417,0.01585691,0.00007973082,0.00014059649,0.000016135109,0.017656269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838203,0.00004972554,0.00025689788,0.00036970296,0.00063840876,0.00030324148],"domain_scores_gemma":[0.9988501,0.000025230303,0.0000094174875,0.000470255,0.0006226438,0.000022320466],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00064651825,0.00011433476,0.00013420644,0.0013458539,0.00068385556,0.0006472699,0.00037271393,0.000040708244,0.010787224],"category_scores_gemma":[0.0001294112,0.00011316539,0.00007672752,0.0040146117,0.00007493039,0.0006033096,0.00016712937,0.00018600035,0.015509882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005957256,0.00022824224,0.00023755767,0.000027335805,0.000092385664,0.0000022381294,0.00015681442,0.4978644,0.000005004221,0.024929669,0.4421043,0.034346096],"study_design_scores_gemma":[0.00011628662,0.000010527433,0.0026240537,0.000005717302,0.000025058884,6.750654e-8,0.00010413523,0.6138155,0.000004053116,0.00002768871,0.3831778,0.00008915532],"about_ca_topic_score_codex":0.0012778465,"about_ca_topic_score_gemma":0.0023038276,"teacher_disagreement_score":0.87456805,"about_ca_system_score_codex":0.00008424161,"about_ca_system_score_gemma":0.000010015046,"threshold_uncertainty_score":0.9901171},"labels":[],"label_agreement":null},{"id":"W2034256646","doi":"10.1016/s0305-0548(03)00073-x","title":"Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem","year":2003,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); Mathematics; Decomposition; Heuristic; Combinatorics; Variable (mathematics); Decomposition method (queueing theory); Variable neighborhood search; Mathematical optimization; Tree (set theory); Graph; Enhanced Data Rates for GSM Evolution; Tree decomposition; Algorithm; Discrete mathematics; Computer science; Metaheuristic; Line graph; Pathwidth","score_opus":0.06097546952554979,"score_gpt":0.36983999250299276,"score_spread":0.308864522977443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034256646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024208638,0.0002657537,0.98735034,0.00059446803,0.00031908375,0.00133513,0.00001599993,0.00021965263,0.007478725],"genre_scores_gemma":[0.3331564,0.000045794735,0.66577905,0.00004509763,0.0001804817,0.00037776268,0.00005532909,0.0000535769,0.0003065162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974909,0.0008443543,0.0003254122,0.00031994117,0.00043854257,0.00058086036],"domain_scores_gemma":[0.9973944,0.0011877784,0.000009150716,0.0005392174,0.0007412632,0.00012820358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038169047,0.00015963403,0.0001827545,0.00022114052,0.0011281352,0.00046684983,0.00041748505,0.00010579025,0.0000798234],"category_scores_gemma":[0.00012348949,0.00013499276,0.000075928016,0.0011702866,0.00010072305,0.00024331253,0.00007588569,0.00048232422,0.000037254056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008070286,0.000053178046,0.00014849071,0.00005383137,0.00008033384,7.6653805e-7,0.00033409087,0.9033836,0.0021079765,0.07962171,0.0032588737,0.010949068],"study_design_scores_gemma":[0.0005101582,0.00006133725,0.00024874572,0.0000265914,0.000014070615,0.000009462725,0.00008566417,0.98759353,0.004963242,0.0008226388,0.005508711,0.00015586773],"about_ca_topic_score_codex":0.000031242493,"about_ca_topic_score_gemma":0.000012618087,"teacher_disagreement_score":0.33073556,"about_ca_system_score_codex":0.00023369846,"about_ca_system_score_gemma":0.00018663447,"threshold_uncertainty_score":0.8676818},"labels":[],"label_agreement":null},{"id":"W2035903817","doi":"10.1016/j.cor.2010.10.019","title":"Online vehicle routing and scheduling with dynamic travel times","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Vehicle routing problem; Scheduling (production processes); Operations research; Adaptive routing; Routing (electronic design automation); Dynamic priority scheduling; Distributed computing; Mathematical optimization; Static routing; Computer network; Routing protocol; Engineering; Mathematics","score_opus":0.02958572442583442,"score_gpt":0.343052482940414,"score_spread":0.3134667585145796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035903817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5848092,0.000045359142,0.41414285,0.00032439802,0.00009632542,0.00016310181,0.0000048563506,0.00014783471,0.00026609164],"genre_scores_gemma":[0.60758525,0.000014973643,0.3921708,0.000015501799,0.000060202612,0.000008792333,0.000017276529,0.000028699249,0.00009853388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988363,0.00011580633,0.00018960302,0.0002452661,0.00026339956,0.0003496578],"domain_scores_gemma":[0.99914026,0.00021911877,0.000007195791,0.00027554357,0.00023028032,0.00012760214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007995171,0.0001230016,0.0001363885,0.00022822309,0.00042682403,0.00028278612,0.00019902125,0.00008110973,0.000032409458],"category_scores_gemma":[0.00011442463,0.00011617974,0.000016696831,0.00050996116,0.00015048326,0.00021260968,0.00009017524,0.00079947995,0.000014070037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032541234,0.00003501278,0.0004111649,0.000020698035,0.000022294913,0.0000045898187,0.00058452634,0.9448624,0.035053078,0.0010535573,0.00002990808,0.01791949],"study_design_scores_gemma":[0.0003115252,0.000037227113,0.003919073,0.0000348451,0.00000391682,0.000019977402,0.00020272087,0.99387264,0.0013889251,0.000017620987,0.00005318017,0.00013832824],"about_ca_topic_score_codex":0.000029915233,"about_ca_topic_score_gemma":0.00018188075,"teacher_disagreement_score":0.049010236,"about_ca_system_score_codex":0.000041428,"about_ca_system_score_gemma":0.000066620814,"threshold_uncertainty_score":0.47376725},"labels":[],"label_agreement":null},{"id":"W2037219660","doi":"10.1016/j.cor.2014.03.027","title":"Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; China Scholarship Council","keywords":"Computer science; Heuristic; Vehicle routing problem; Routing (electronic design automation); Mathematical optimization; Markov chain; Markov decision process; Embedding; Process (computing); Operations research; Sequence (biology); Markov process; Computer network; Mathematics; Artificial intelligence; Machine learning","score_opus":0.0653815366770034,"score_gpt":0.3409312984287469,"score_spread":0.2755497617517435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037219660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058608847,0.000059866103,0.99139124,0.0005903327,0.00009941725,0.001279395,0.0000060907983,0.0002735772,0.00043917872],"genre_scores_gemma":[0.7936772,0.000008767624,0.2054552,0.000041651336,0.00017066592,0.00034511325,0.000040894043,0.00005550514,0.00020498763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981204,0.00043436515,0.0003068683,0.00030914138,0.00035902695,0.00047019293],"domain_scores_gemma":[0.9973689,0.0013012465,0.00001896517,0.00038018826,0.00083286554,0.00009784243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021104484,0.00017596423,0.0001819084,0.00016071169,0.0011956096,0.00051909627,0.00034254394,0.00007977157,0.00001635076],"category_scores_gemma":[0.0002875235,0.00012992368,0.000035664347,0.00082850707,0.00014010891,0.00026845248,0.000066768334,0.00035958338,0.0000118044745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015259868,0.000018971414,0.00002195831,0.00002317563,0.000045161752,2.866276e-7,0.0007176484,0.98274213,0.00029957827,0.004305288,0.0005488253,0.0112616895],"study_design_scores_gemma":[0.0006638298,0.00023687753,0.00013065248,0.000058479323,0.000014452737,0.0000043928317,0.00024088963,0.9978776,0.00039512248,0.000044664113,0.00016227308,0.00017079423],"about_ca_topic_score_codex":0.000025606683,"about_ca_topic_score_gemma":0.00007771277,"teacher_disagreement_score":0.78781635,"about_ca_system_score_codex":0.000120204226,"about_ca_system_score_gemma":0.000119512784,"threshold_uncertainty_score":0.9195783},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8159813,0.000008634759,0.18159841,0.0008038769,0.00015179723,0.00042684565,0.0000016318193,0.000083903695,0.00094354525],"genre_scores_gemma":[0.97433764,0.0000026271307,0.024322886,0.00012567232,0.000862256,0.000043034684,0.00009461524,0.000020997368,0.00019025369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982272,0.000060328668,0.0003233086,0.0004998386,0.00054488576,0.00034445236],"domain_scores_gemma":[0.99829143,0.00002569738,0.00004215697,0.00065517536,0.00094715384,0.000038374077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017661304,0.00013187053,0.00020001215,0.0005968986,0.0005593079,0.00031865438,0.00043295426,0.00005781228,0.000037538754],"category_scores_gemma":[0.00027388518,0.00012321366,0.000059295406,0.0014532639,0.00024309049,0.002015642,0.00020546568,0.0003091145,0.000046852387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029096485,0.0006996889,0.00005468383,0.00005854538,0.0000336241,0.0000015496267,0.00012267538,0.90035003,0.0064830915,0.08677472,0.000069230715,0.0053230682],"study_design_scores_gemma":[0.0004202438,0.00013349949,0.0001903387,0.000033286746,0.0000360501,0.00000189753,0.0004478889,0.9840991,0.0042284257,0.009656096,0.0005627419,0.00019042342],"about_ca_topic_score_codex":0.0014620399,"about_ca_topic_score_gemma":0.00029128976,"teacher_disagreement_score":0.15835631,"about_ca_system_score_codex":0.00013395835,"about_ca_system_score_gemma":0.0000725476,"threshold_uncertainty_score":0.5024507},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03100057,0.00024102852,0.9468417,0.009084741,0.0011097218,0.0023425624,0.000021401596,0.00024990528,0.009108333],"genre_scores_gemma":[0.9877231,0.000052925025,0.003541198,0.0008755939,0.00079796405,0.00038131545,0.00022628899,0.000026431031,0.0063751936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984877,0.00002616056,0.00028992243,0.00034709595,0.0004214838,0.00042762604],"domain_scores_gemma":[0.99855244,0.00003091814,0.000012663536,0.0003641932,0.0010152179,0.00002459435],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008432144,0.00012032825,0.00011665557,0.00037439732,0.00093595916,0.00065994076,0.00035074452,0.000045800953,0.00039489826],"category_scores_gemma":[0.00017073283,0.0001245802,0.000048887607,0.00092953927,0.000052687818,0.00069159246,0.0002412586,0.00014633221,0.0014096953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000135195405,0.0007642214,0.0005870275,0.0005866317,0.000041339616,0.0000012081805,0.0008296676,0.549479,0.00016722183,0.09414629,0.3407215,0.0126623465],"study_design_scores_gemma":[0.00034911148,0.000016145088,0.00050908985,0.0000192539,0.0000060617062,2.4231448e-7,0.00019697592,0.7819845,0.000008765033,0.00013610806,0.21665883,0.00011492146],"about_ca_topic_score_codex":0.00040077223,"about_ca_topic_score_gemma":0.0016567092,"teacher_disagreement_score":0.9567225,"about_ca_system_score_codex":0.00007284119,"about_ca_system_score_gemma":0.000017233497,"threshold_uncertainty_score":0.99936783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8392994,0.000033732333,0.011112583,0.1152762,0.00055765774,0.0013904361,0.000007678427,0.000086206535,0.032236118],"genre_scores_gemma":[0.9950595,0.0000072415583,0.00026392267,0.0031049482,0.00020449693,0.00006304243,0.000011599742,0.000008391564,0.0012768852],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882376,0.000051220548,0.00020139177,0.0002150171,0.00047988593,0.00022869898],"domain_scores_gemma":[0.99908197,0.0000672166,0.000007081431,0.00045293136,0.00037355692,0.00001726521],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008337717,0.00007207433,0.000082910046,0.00035501254,0.0004306675,0.00024354545,0.0004574526,0.000020099627,0.0018311755],"category_scores_gemma":[0.0002935611,0.000058789574,0.000038967133,0.001063753,0.00006766543,0.00024146409,0.00027626258,0.00013676209,0.0048123496],"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.000016281,0.0003151639,0.00014686673,0.00008698827,0.000037737667,0.0000028960444,0.00079952175,0.08143908,0.00022253333,0.3524286,0.53740346,0.027100876],"study_design_scores_gemma":[0.00032449487,0.000066007815,0.005183009,0.00006700957,0.0000069481925,3.900926e-7,0.0005955422,0.85418296,0.00011874366,0.0010915836,0.138173,0.00019028503],"about_ca_topic_score_codex":0.0009379486,"about_ca_topic_score_gemma":0.0006198492,"teacher_disagreement_score":0.7727439,"about_ca_system_score_codex":0.000030301711,"about_ca_system_score_gemma":0.000008731587,"threshold_uncertainty_score":0.9990813},"labels":[],"label_agreement":null},{"id":"W2039638040","doi":"10.1016/j.cor.2014.07.001","title":"Heuristics for dynamic and stochastic inventory-routing","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Mathematical optimization; Heuristic; Time horizon; Vendor; Routing (electronic design automation); Context (archaeology); Operations research; Inventory control; Inventory management; Stochastic programming; Dynamic programming; Operations management; Algorithm; Mathematics; Artificial intelligence; Economics","score_opus":0.050700185426448344,"score_gpt":0.36830883582356255,"score_spread":0.3176086503971142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039638040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032741405,0.000069461894,0.96611094,0.00017387242,0.00023807732,0.0003435745,0.0000051393413,0.00016407864,0.0001534587],"genre_scores_gemma":[0.7419662,0.000008726573,0.2576967,0.000023116161,0.00009796492,0.000047513186,0.000018913119,0.000032283075,0.00010858143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893653,0.00017988903,0.00019350591,0.00019564324,0.0001821891,0.0003122539],"domain_scores_gemma":[0.9988736,0.0005659543,0.000006509649,0.00021536731,0.00023440033,0.000104195155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013299352,0.000095121344,0.00012316997,0.0001986948,0.00039927257,0.000210691,0.00016082889,0.000057453504,0.000005282601],"category_scores_gemma":[0.00065267977,0.00010521355,0.000021969972,0.00026098697,0.000080870974,0.00008790102,0.000082953484,0.00022446254,0.000010449454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016205121,0.000007641441,0.00003144834,0.00003918941,0.00001059746,1.9803028e-7,0.00030933876,0.9813403,0.00044524964,0.0037278996,0.00039537647,0.013691128],"study_design_scores_gemma":[0.0002694242,0.000044876408,0.00014473688,0.00003189762,0.000004214879,0.0000032946716,0.000041013347,0.99866736,0.000052469662,0.00020961635,0.0004248603,0.000106214095],"about_ca_topic_score_codex":0.0000064904943,"about_ca_topic_score_gemma":0.000014752181,"teacher_disagreement_score":0.7092248,"about_ca_system_score_codex":0.0000846489,"about_ca_system_score_gemma":0.000029758326,"threshold_uncertainty_score":0.4290484},"labels":[],"label_agreement":null},{"id":"W2041088973","doi":"10.1016/j.cor.2014.06.007","title":"A decomposition-based heuristic for the multiple-product inventory-routing problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Vendor; Computer science; Vehicle routing problem; Operations research; Routing (electronic design automation); Integer programming; Decomposition; Time horizon; Mathematical optimization; Product (mathematics); Linear programming; Mathematics; Algorithm; Business; Artificial intelligence; Marketing","score_opus":0.06450626381469744,"score_gpt":0.37307536225457844,"score_spread":0.308569098439881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041088973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009215952,0.00009573189,0.9875649,0.0012197089,0.00033127493,0.001056286,0.000006915332,0.00028445764,0.00022477949],"genre_scores_gemma":[0.667274,0.0000044528206,0.33194774,0.000076370634,0.00028336258,0.00028252896,0.00003606312,0.000039859784,0.000055616365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981829,0.00046149228,0.0003044914,0.00029300002,0.0003216067,0.00043649523],"domain_scores_gemma":[0.9965743,0.0023418404,0.000013911082,0.00049023057,0.00048400188,0.000095714444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027440258,0.00013895474,0.00014426178,0.00020465233,0.0010327655,0.0003577368,0.00043015202,0.000049416383,0.000014689027],"category_scores_gemma":[0.00093247247,0.00011933444,0.00006513168,0.0005470371,0.000107858374,0.0001085326,0.00006905111,0.0003405092,0.000029207804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053674044,0.000023565239,0.00025459036,0.00005432309,0.000021410671,2.617626e-7,0.00028200977,0.9834431,0.0011973834,0.0013738207,0.0017929343,0.011551231],"study_design_scores_gemma":[0.0004755252,0.000045975572,0.00031687302,0.00004963322,0.000008279071,0.0000019591564,0.00003396109,0.99506676,0.0013498109,0.0000655215,0.0024495746,0.0001361344],"about_ca_topic_score_codex":0.000038982347,"about_ca_topic_score_gemma":0.000044569493,"teacher_disagreement_score":0.65805805,"about_ca_system_score_codex":0.0001388028,"about_ca_system_score_gemma":0.00008407062,"threshold_uncertainty_score":0.7943301},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08660952,0.0006336555,0.7668353,0.13976431,0.0010381689,0.0029673667,0.00000585898,0.00016921706,0.0019766404],"genre_scores_gemma":[0.99437004,0.00012080013,0.0020791066,0.0019911402,0.00070934184,0.0002059465,0.00006988511,0.000012670322,0.0004410666],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877137,0.00005446977,0.00019656983,0.00032593662,0.0003291105,0.000322541],"domain_scores_gemma":[0.9990465,0.00017151472,0.000013626826,0.00031566434,0.00042389106,0.000028786966],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000980672,0.00010962091,0.00009422448,0.00012751279,0.0014292884,0.0019310307,0.00028672826,0.000041309908,0.00021693391],"category_scores_gemma":[0.00020512218,0.00008987731,0.00002998991,0.00047523665,0.00016199272,0.0012517166,0.0001228254,0.0001725852,0.000058546462],"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.00003328691,0.00040060244,0.0013396852,0.00033319776,0.0001050493,0.000004825575,0.002969928,0.12010163,0.0003986303,0.13318789,0.386396,0.3547293],"study_design_scores_gemma":[0.00027618828,0.000021058337,0.00054364075,0.000022272536,0.000011264981,6.4745234e-7,0.0014642718,0.95633405,0.0000047760536,0.00019857634,0.041018818,0.000104409686],"about_ca_topic_score_codex":0.001141817,"about_ca_topic_score_gemma":0.0038829793,"teacher_disagreement_score":0.9077605,"about_ca_system_score_codex":0.000029086055,"about_ca_system_score_gemma":0.00001442144,"threshold_uncertainty_score":0.9998707},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6861785,0.00027090276,0.3120102,0.00072774757,0.0001870091,0.00036652692,0.000016044838,0.00021412672,0.000028937648],"genre_scores_gemma":[0.93445104,0.00003909411,0.06491095,0.00000950953,0.00010846832,0.00008603783,0.00020101311,0.000021028447,0.00017286692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988286,0.00007052978,0.00020919382,0.0002511076,0.00032660319,0.00031398074],"domain_scores_gemma":[0.9993846,0.000061362625,0.000009066517,0.00017123604,0.00029981538,0.00007393236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004072058,0.000116955765,0.00010903344,0.00025083852,0.0003527988,0.00025972835,0.00017823801,0.00007352883,0.000014515763],"category_scores_gemma":[0.00015240093,0.000112493406,0.000011715294,0.0009686581,0.00006633751,0.00046369704,0.000040314302,0.0005190828,0.000016616157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055609403,0.000049157097,0.003185439,0.000020519265,0.000013131113,0.000004204623,0.0017421308,0.9892331,0.00007402116,0.000013911492,0.00026250168,0.005396319],"study_design_scores_gemma":[0.00031746336,0.000028595043,0.005300047,0.0001231323,0.000002082535,0.000005670021,0.0009234867,0.9916814,0.0012637859,0.000001094338,0.0002157467,0.0001375267],"about_ca_topic_score_codex":0.000021142398,"about_ca_topic_score_gemma":0.00012896379,"teacher_disagreement_score":0.24827252,"about_ca_system_score_codex":0.00026559012,"about_ca_system_score_gemma":0.000109840614,"threshold_uncertainty_score":0.45873478},"labels":[],"label_agreement":null},{"id":"W2046064436","doi":"10.1016/j.cor.2011.09.021","title":"A parallel iterated tabu search heuristic for vehicle routing problems","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":228,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Vehicle routing problem; Mathematical optimization; Heuristics; Guided Local Search; Iterated local search; Heuristic; Incremental heuristic search; Computer science; Mathematics; Algorithm; Routing (electronic design automation); Beam search; Search algorithm","score_opus":0.15695137458492678,"score_gpt":0.3647560928907695,"score_spread":0.2078047183058427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046064436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05789894,0.00011902308,0.93867683,0.000121825266,0.00023295268,0.0011214699,0.000014804645,0.00043873952,0.0013753994],"genre_scores_gemma":[0.6178319,0.000022732114,0.38133317,0.000026370812,0.000114423376,0.00023378723,0.000045445642,0.000063577616,0.00032860303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771225,0.0003910021,0.00040683284,0.00037167073,0.0003763614,0.0007418652],"domain_scores_gemma":[0.9982624,0.00036620445,0.000010694509,0.00042497067,0.0007500992,0.00018564252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020387676,0.00017801722,0.00020933313,0.00036565296,0.0006431495,0.00032583636,0.0004535939,0.00011114052,0.00008561829],"category_scores_gemma":[0.00023433242,0.00018804365,0.000061921004,0.00097542506,0.00010664567,0.00027478777,0.00014196865,0.00048621098,0.000091853544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013398269,0.000062697945,0.00025160448,0.000085377724,0.000042628853,0.000004245191,0.004324763,0.9836853,0.002419654,0.0024878276,0.0010215208,0.0056009972],"study_design_scores_gemma":[0.00057210034,0.00010623437,0.00063633564,0.000064543805,0.0000054958673,0.0000060164,0.00015977703,0.9959787,0.0018143571,0.000095708434,0.00035704672,0.00020366802],"about_ca_topic_score_codex":0.00009551538,"about_ca_topic_score_gemma":0.000026188145,"teacher_disagreement_score":0.55993295,"about_ca_system_score_codex":0.00015135248,"about_ca_system_score_gemma":0.00011074437,"threshold_uncertainty_score":0.7668197},"labels":[],"label_agreement":null},{"id":"W2046798010","doi":"10.1016/j.cor.2010.12.008","title":"An interior point cutting plane heuristic for mixed integer programming","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cutting-plane method; Integer programming; Integer (computer science); Mathematical optimization; Point (geometry); Heuristic; Plane (geometry); Interior point method; Mathematics; Branch and price; Computer science; Geometry","score_opus":0.046283844041415535,"score_gpt":0.38598582486289673,"score_spread":0.3397019808214812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046798010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13728012,0.000017417922,0.86048657,0.0002102039,0.00082789524,0.0006599192,0.000009890214,0.00038252719,0.00012548131],"genre_scores_gemma":[0.50855726,0.000002069985,0.4908875,0.000015827754,0.00023836202,0.00014572048,0.000061606595,0.000042026735,0.00004959513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984192,0.0002005051,0.00032945105,0.00030679884,0.00024546348,0.0004985504],"domain_scores_gemma":[0.99848324,0.00043493288,0.000011613924,0.0004442763,0.0004453938,0.00018052016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019023217,0.00014814608,0.00017151634,0.00033155584,0.000452763,0.00058093894,0.0004269176,0.0001059101,0.0000461001],"category_scores_gemma":[0.0005606999,0.00015359039,0.00004755328,0.0004098294,0.00009908645,0.00028596437,0.00009310132,0.0007059623,0.000029063087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001665903,0.00008084796,0.0001573031,0.00013040628,0.000046788595,0.0000073151004,0.0024273975,0.7608274,0.057140313,0.0023553693,0.001960557,0.17484964],"study_design_scores_gemma":[0.00027391076,0.000109483844,0.00009829206,0.00003873052,0.000004461079,0.000016677115,0.00024292801,0.9904994,0.005324185,0.00003430194,0.0031911454,0.000166509],"about_ca_topic_score_codex":0.000027204964,"about_ca_topic_score_gemma":0.000097350014,"teacher_disagreement_score":0.37127715,"about_ca_system_score_codex":0.0000737218,"about_ca_system_score_gemma":0.00006675342,"threshold_uncertainty_score":0.62632346},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06796938,0.00013833438,0.92863077,0.0009241585,0.00023813052,0.0019698055,0.00006348218,0.000025146872,0.000040771894],"genre_scores_gemma":[0.6066424,0.00006915647,0.39015165,0.000108657725,0.00047502064,0.0007255259,0.00083271286,0.000030812258,0.0009640527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978499,0.000235112,0.0004256893,0.00049632887,0.00060022774,0.00039274397],"domain_scores_gemma":[0.996722,0.0005122456,0.000051397616,0.00031993483,0.0022652769,0.00012918016],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032405695,0.00010626878,0.00016333883,0.00035835517,0.0013083089,0.0012797903,0.00028004797,0.00008607706,0.000055290864],"category_scores_gemma":[0.0017090641,0.0000897401,0.000050404433,0.00075453485,0.00007580075,0.0009759433,0.00013311261,0.00012029219,0.000011379483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001637351,0.000044786088,0.0011114469,0.0000065676318,0.0000081067965,1.9403122e-7,0.0005137189,0.96884656,0.000101047764,0.0021266143,0.021381794,0.0058427667],"study_design_scores_gemma":[0.00046615538,0.000084199535,0.00047396563,0.000019766303,0.000005286857,0.0000029027062,0.0003873082,0.99096966,0.00010757133,0.00071180763,0.0066656466,0.00010575143],"about_ca_topic_score_codex":0.00005879033,"about_ca_topic_score_gemma":0.000014781204,"teacher_disagreement_score":0.53867304,"about_ca_system_score_codex":0.000089277026,"about_ca_system_score_gemma":0.00017305114,"threshold_uncertainty_score":0.99999183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051870212,0.000074255695,0.94637626,0.00048430983,0.00021817822,0.00045802313,0.0000037996851,0.00021339805,0.00030157212],"genre_scores_gemma":[0.4234217,0.000003587061,0.57610565,0.0001394025,0.00012607842,0.00004957953,0.00002884754,0.000015056705,0.000110070876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573123,0.0013095628,0.00034144026,0.00092904025,0.00091369904,0.00077504176],"domain_scores_gemma":[0.9974376,0.00026232813,0.000013736493,0.0010868835,0.00084752846,0.0003519289],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0034565083,0.0002184579,0.00025543614,0.0006406276,0.0011180546,0.0012121387,0.00170535,0.00010684641,0.0000024716244],"category_scores_gemma":[0.00020997746,0.000201061,0.0000305521,0.0016858927,0.00028552857,0.00088066707,0.0009010466,0.0008234517,0.00006322655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050886924,0.00032219934,0.0007128255,0.00002606307,0.000033509,0.00003138958,0.014054587,0.9101384,0.0013998976,0.027337343,0.0005786743,0.04536001],"study_design_scores_gemma":[0.00048043142,0.00029127434,0.0077236975,0.000046875255,0.0000013200289,0.000033449352,0.00026491826,0.9903188,0.00026111465,0.000037388836,0.00031057853,0.00023019908],"about_ca_topic_score_codex":0.00029103956,"about_ca_topic_score_gemma":0.0000038625403,"teacher_disagreement_score":0.37155148,"about_ca_system_score_codex":0.00011395479,"about_ca_system_score_gemma":0.00025365723,"threshold_uncertainty_score":0.9998247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01933503,0.0006421097,0.9774075,0.00047312016,0.00056972477,0.0006811502,0.0000066671873,0.000186757,0.0006979205],"genre_scores_gemma":[0.72877944,0.00001390932,0.27041993,0.00003184664,0.0004108884,0.00020148452,0.000019056717,0.000026804973,0.00009665846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988836,0.00005378867,0.00019849418,0.00012623315,0.00027101726,0.00046684913],"domain_scores_gemma":[0.99884474,0.0005369244,0.0000065068953,0.0002526118,0.00026093892,0.00009827741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009983386,0.00009539459,0.000085217915,0.00021542369,0.001057406,0.00026443374,0.00023627895,0.000053050753,0.000017935638],"category_scores_gemma":[0.00007896328,0.00007575136,0.000052611234,0.00062843336,0.000048852093,0.00013182304,0.00006978578,0.00024940877,0.000040805993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011757002,0.00002172809,0.00008010031,0.000017898428,0.000025470828,8.442013e-8,0.0008351979,0.9744177,0.00008068618,0.01185924,0.00063176197,0.012028993],"study_design_scores_gemma":[0.00018461079,0.00001530826,0.00053440704,0.000026293661,0.000007036023,0.0000045975303,0.0001964819,0.99738425,0.00014144156,0.000027293814,0.0013816479,0.00009663101],"about_ca_topic_score_codex":0.000021038159,"about_ca_topic_score_gemma":0.000010452193,"teacher_disagreement_score":0.7094444,"about_ca_system_score_codex":0.00011309749,"about_ca_system_score_gemma":0.00003216652,"threshold_uncertainty_score":0.8132819},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8957243,0.0004333805,0.092234984,0.00139408,0.00021927213,0.00045311873,0.00007371303,0.000048519505,0.009418656],"genre_scores_gemma":[0.97861904,0.00008842251,0.01892768,0.000072285264,0.000051562172,0.00011907969,0.000057555895,0.000026189377,0.0020381678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877334,0.000021037757,0.0003293961,0.00042528828,0.00005152943,0.00039940674],"domain_scores_gemma":[0.99924666,0.000030350324,0.000027690794,0.00047629233,0.000097894816,0.00012112927],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005545895,0.00011811638,0.00021199702,0.00030294133,0.00044601067,0.00034511805,0.00034845804,0.00006586942,0.00022858335],"category_scores_gemma":[0.000010979931,0.00012180887,0.000048995043,0.00030071347,0.000178618,0.00027961688,0.00009719734,0.00028630474,0.0012401922],"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.000009311965,0.0001229004,0.00027993537,0.000005886917,0.000021298307,0.00000744915,0.00043345598,0.06808071,0.00004174064,0.9306069,0.00007432709,0.000316074],"study_design_scores_gemma":[0.010746933,0.0024883763,0.012441949,0.00022834771,0.000033913515,0.00029922542,0.0029062913,0.18074873,0.00037734737,0.7241799,0.062534064,0.0030149075],"about_ca_topic_score_codex":0.000814236,"about_ca_topic_score_gemma":0.0014002821,"teacher_disagreement_score":0.206427,"about_ca_system_score_codex":0.00032905248,"about_ca_system_score_gemma":0.00012860926,"threshold_uncertainty_score":0.99953747},"labels":[],"label_agreement":null},{"id":"W2050001280","doi":"10.1016/j.cor.2005.05.011","title":"Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Column generation; Scheduling (production processes); Computer science; Mathematical optimization; Linear programming; Relaxation (psychology); Preprocessor; Degenerate energy levels; Column (typography); Linear programming relaxation; Mathematics; Algorithm; Artificial intelligence","score_opus":0.09169753236726466,"score_gpt":0.34373809634236985,"score_spread":0.2520405639751052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050001280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36328894,0.000206647,0.6344214,0.0002574075,0.000333459,0.0010255247,0.000018758587,0.0003479278,0.00009990858],"genre_scores_gemma":[0.59001154,0.000019849145,0.40858006,0.000019613753,0.0005012099,0.00039314636,0.00019079077,0.00006412268,0.00021967331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765617,0.00032609666,0.00053297187,0.00044332785,0.00042705017,0.0006143621],"domain_scores_gemma":[0.99814206,0.00043185925,0.000020255322,0.00041902543,0.0008680218,0.0001187668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016767444,0.00020040682,0.00023171704,0.0003368576,0.0008939931,0.0006461569,0.00030331413,0.00014138641,0.000019770412],"category_scores_gemma":[0.00025506484,0.00022597244,0.000075248354,0.00081639376,0.00008797069,0.00035565393,0.00008175923,0.00032636165,0.000033564695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051545776,0.000042694825,0.00021138144,0.000041327236,0.000015798383,7.7454763e-7,0.00011343272,0.7532574,0.24227059,0.00073217123,0.0014590065,0.0018502829],"study_design_scores_gemma":[0.0010591663,0.00005888014,0.00014199708,0.00002525933,0.000006637489,0.0000023408713,0.000024794508,0.9416209,0.05540092,0.000056995017,0.0013696136,0.00023250797],"about_ca_topic_score_codex":0.0001773579,"about_ca_topic_score_gemma":0.00061903504,"teacher_disagreement_score":0.2267226,"about_ca_system_score_codex":0.00028061017,"about_ca_system_score_gemma":0.00013393456,"threshold_uncertainty_score":0.9214889},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015808143,0.00006655341,0.9811695,0.0007979507,0.00030126338,0.0015293902,0.00002642629,0.000077642144,0.00022312225],"genre_scores_gemma":[0.8781515,8.923565e-7,0.11983087,0.000024896073,0.0014188857,0.00046872612,0.00006846829,0.000021251826,0.000014545128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734193,0.0005694352,0.00034547792,0.00037117815,0.00064987526,0.0007220767],"domain_scores_gemma":[0.997533,0.00086278195,0.000025217036,0.00045589334,0.0009802098,0.0001428538],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018487858,0.00016292263,0.00019521329,0.00017463237,0.0017384535,0.00056397176,0.0004039493,0.00006197841,0.000056225712],"category_scores_gemma":[0.00004253232,0.00013761768,0.00016129462,0.0012162067,0.00023837268,0.00036635905,0.00020985154,0.00034634984,0.00000951408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017424171,0.0014490201,0.020254724,0.0000805993,0.00039443807,0.000001210818,0.0010713098,0.55254066,0.002940258,0.298203,0.0034448325,0.119445704],"study_design_scores_gemma":[0.0005327396,0.00009235447,0.00041127886,0.000033726865,0.000047736816,0.0000016747929,0.00016221651,0.9892433,0.0022098003,0.006191227,0.00091642945,0.000157483],"about_ca_topic_score_codex":0.0020336069,"about_ca_topic_score_gemma":0.00006913426,"teacher_disagreement_score":0.8623433,"about_ca_system_score_codex":0.0002780811,"about_ca_system_score_gemma":0.00022977674,"threshold_uncertainty_score":0.99956113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23939343,0.00032505897,0.75832415,0.0011610122,0.00020364311,0.00022018321,0.0000034034329,0.00025323802,0.000115888855],"genre_scores_gemma":[0.61015534,0.000020848134,0.3894629,0.0001229346,0.00012378547,0.000019781271,0.000021135076,0.000019030746,0.000054247354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860364,0.00010322279,0.00026358088,0.0002744638,0.0003429613,0.00041214272],"domain_scores_gemma":[0.99931973,0.000060778988,0.0000059385043,0.00023204439,0.00019470819,0.00018680443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059290836,0.00015623777,0.00016489964,0.0005208525,0.0005932976,0.00064319844,0.00020410687,0.00008280698,0.000027693883],"category_scores_gemma":[0.00010231606,0.0001536157,0.000035226312,0.0007014592,0.00007628969,0.00024823952,0.000052150284,0.0004112059,0.000025876629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046628443,0.000025794725,0.000054212065,0.000012436079,0.000011673228,0.000009544087,0.0011772825,0.9929201,0.00066935644,0.0021188254,0.000045778237,0.0029503542],"study_design_scores_gemma":[0.0004103742,0.000049143884,0.000132841,0.00005558117,0.0000042361066,0.000012422594,0.0002459951,0.9985259,0.00031882705,0.000048907834,0.000024033296,0.00017174489],"about_ca_topic_score_codex":0.000012542363,"about_ca_topic_score_gemma":0.000011197035,"teacher_disagreement_score":0.3707619,"about_ca_system_score_codex":0.00006201821,"about_ca_system_score_gemma":0.000070944276,"threshold_uncertainty_score":0.62642664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9564902,0.00040402816,0.040592026,0.00042255037,0.000097062046,0.0002464625,0.00006622815,0.00001630022,0.0016650984],"genre_scores_gemma":[0.99453163,0.00018491352,0.004687821,0.000077042314,0.00006217433,0.000024247103,0.00011016548,0.000013772147,0.0003082607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856097,0.00002735006,0.000542475,0.00040409932,0.00013586247,0.00032922495],"domain_scores_gemma":[0.9989189,0.0000317462,0.0000648493,0.0005977145,0.00024719295,0.0001396146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483579,0.00011268945,0.00037777505,0.001306347,0.00022651421,0.00018344905,0.00040578368,0.000057346155,0.00030441588],"category_scores_gemma":[0.000040584862,0.00010891967,0.00013414481,0.0027569921,0.0001926291,0.0002836206,0.00010407638,0.00020769336,0.000108091095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008002686,0.00025354102,0.014896224,0.000016656417,0.00016116878,0.0000043753184,0.0015810796,0.7987247,0.000037662965,0.18374048,0.000056259138,0.00051986746],"study_design_scores_gemma":[0.00040863192,0.00018458298,0.08374147,0.000015696818,0.000022026403,0.0000018586484,0.000071408846,0.90829176,0.000053260712,0.0053610764,0.0016763869,0.00017185412],"about_ca_topic_score_codex":0.0009057811,"about_ca_topic_score_gemma":0.00050183514,"teacher_disagreement_score":0.1783794,"about_ca_system_score_codex":0.00012591157,"about_ca_system_score_gemma":0.00008632364,"threshold_uncertainty_score":0.4441615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015385674,0.00004977515,0.9462193,0.045189943,0.0008085166,0.0013728556,0.0000029710682,0.00011668214,0.0047013387],"genre_scores_gemma":[0.86744505,0.00005116797,0.09816047,0.0069677318,0.009012696,0.0008895242,0.00051016733,0.0000902938,0.016872907],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855644,0.000037257985,0.0002573667,0.00031550918,0.00042554433,0.00040786038],"domain_scores_gemma":[0.9990067,0.00012563179,0.000011886669,0.00039967083,0.00042378865,0.000032355205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016458336,0.00011698821,0.00011206353,0.0002754964,0.0011789497,0.0008582646,0.00058766647,0.000035660796,0.00016687259],"category_scores_gemma":[0.00028265052,0.0000901502,0.000056693334,0.00059061986,0.00007363573,0.00044870094,0.00019585658,0.00018255146,0.00065812166],"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.000013649625,0.000073787094,0.00010115095,0.00017261675,0.000038605376,7.885433e-7,0.00036726802,0.06347162,0.00008127768,0.20974055,0.5912085,0.13473018],"study_design_scores_gemma":[0.00023705557,0.000015720709,0.00040892992,0.000017336839,0.0000071252502,2.885675e-7,0.00013335512,0.67888963,0.000005781818,0.0020316215,0.3181603,0.00009287251],"about_ca_topic_score_codex":0.0034388069,"about_ca_topic_score_gemma":0.0031831355,"teacher_disagreement_score":0.8659065,"about_ca_system_score_codex":0.00004260568,"about_ca_system_score_gemma":0.00006340905,"threshold_uncertainty_score":0.90676475},"labels":[],"label_agreement":null},{"id":"W2060597711","doi":"10.1016/j.cor.2012.06.011","title":"Heuristics for dynamic and stochastic routing in industrial shipping","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Computer science; Operations research; Routing (electronic design automation); Vehicle routing problem; Metaheuristic; Key (lock); Mathematical optimization; Set (abstract data type); Engineering; Mathematics; Algorithm; Computer security; Computer network","score_opus":0.13374856411112754,"score_gpt":0.39890553355726316,"score_spread":0.26515696944613565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060597711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16993101,0.000115391376,0.82896924,0.00010384669,0.00032767237,0.000418105,0.000005488455,0.00007504249,0.000054227516],"genre_scores_gemma":[0.86775446,0.0000083167615,0.13190629,0.000008752305,0.0001950377,0.00005452277,0.00001638287,0.000026879346,0.000029345001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988074,0.00018328577,0.0002355431,0.0001429997,0.00016430228,0.00046648216],"domain_scores_gemma":[0.9989219,0.0007148817,0.000006663921,0.00014408736,0.000105407526,0.00010707697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018923512,0.00009189903,0.00012875765,0.00031135208,0.00023825238,0.00015198298,0.00012348172,0.000090879126,0.0000048725033],"category_scores_gemma":[0.0007348353,0.00010507574,0.00001647203,0.0004496803,0.000049769616,0.00019905368,0.000086297405,0.0003889477,0.0000045590164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000358749,0.000016209926,0.0006193696,0.000020124791,0.000008315224,3.544134e-7,0.000997586,0.982344,0.00034054427,0.0013192189,0.00010044136,0.014230295],"study_design_scores_gemma":[0.00042381976,0.000019377047,0.000833415,0.000053050037,0.0000028657357,0.0000036177516,0.00016906335,0.9982534,0.00004599459,0.000026612794,0.00006459775,0.00010418013],"about_ca_topic_score_codex":0.0000142612525,"about_ca_topic_score_gemma":0.000021351258,"teacher_disagreement_score":0.69782346,"about_ca_system_score_codex":0.00017096185,"about_ca_system_score_gemma":0.000043159147,"threshold_uncertainty_score":0.42848644},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02249432,0.0013135576,0.9744665,0.000134714,0.00010372313,0.0006421088,0.0000013430795,0.00034371376,0.00050003885],"genre_scores_gemma":[0.54922515,0.00007882592,0.45043653,0.000018023951,0.00011964659,0.000076134245,0.000006657139,0.000015519972,0.000023527424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988202,0.00002770474,0.0001797306,0.00022189118,0.00016754074,0.00058294745],"domain_scores_gemma":[0.9990913,0.00047118447,0.0000046072705,0.00025427615,0.00010937235,0.00006925205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010892064,0.00011044212,0.00011731875,0.00008248,0.0006107022,0.0001982883,0.000308883,0.00010443817,9.174417e-7],"category_scores_gemma":[0.00009364847,0.00008792054,0.000027419354,0.00068967184,0.00021214175,0.00013871529,0.00013576633,0.00035042307,0.0000014633004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007141425,0.0000093807885,0.000027422197,0.000012441411,0.000013768439,0.000001507919,0.000054306307,0.93619984,0.000041716154,0.0052877325,0.0016120884,0.056732666],"study_design_scores_gemma":[0.00017111565,0.000047209447,0.00013394876,0.000017043356,0.0000035143396,0.000009613515,0.00029776496,0.99802595,0.000037014095,0.00019462334,0.0009624524,0.0000997487],"about_ca_topic_score_codex":0.000004569052,"about_ca_topic_score_gemma":0.00002914533,"teacher_disagreement_score":0.52673084,"about_ca_system_score_codex":0.00012760272,"about_ca_system_score_gemma":0.000015892738,"threshold_uncertainty_score":0.46970892},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5726036,0.00008150052,0.42609167,0.00027717825,0.00009798829,0.00048707574,0.0000063995303,0.00004716362,0.0003074585],"genre_scores_gemma":[0.8615934,0.000021163638,0.13789666,0.000029365678,0.00015674607,0.000046041827,0.00018879154,0.00001203305,0.000055786997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851704,0.0002695374,0.00025138602,0.00026406217,0.0003452364,0.00035275694],"domain_scores_gemma":[0.99926263,0.00023305175,0.000023297225,0.00009864607,0.00032916275,0.000053207372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008489346,0.00008189519,0.000112472706,0.00034540799,0.0010637719,0.00033463648,0.00016332227,0.000084316125,0.0000050590947],"category_scores_gemma":[0.000056699573,0.00009230165,0.000034630968,0.00067354616,0.000091436326,0.0002745134,0.000013385606,0.000140239,0.0000011786849],"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.000019001163,0.000098572105,0.016159514,0.00002426104,0.000007228429,0.000002388937,0.0059926095,0.97537535,0.0004655859,0.0011975846,0.00017803682,0.00047987662],"study_design_scores_gemma":[0.0004925888,0.00003773827,0.007237988,0.00011022561,0.000008705648,0.0000016355649,0.0064891065,0.98470795,0.00026732255,0.000098072414,0.0003773005,0.00017133534],"about_ca_topic_score_codex":0.006846848,"about_ca_topic_score_gemma":0.0055920924,"teacher_disagreement_score":0.28898984,"about_ca_system_score_codex":0.000157628,"about_ca_system_score_gemma":0.0002403588,"threshold_uncertainty_score":0.99976665},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96587205,0.00011171413,0.02773042,0.00028777146,0.00027060285,0.0007403742,0.000002297437,0.000113766306,0.0048709777],"genre_scores_gemma":[0.99680597,0.0000013376042,0.0016291714,0.00007176741,0.0009967355,0.000052127038,0.00006894814,0.00003301719,0.00034090588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725634,0.00026386976,0.000507641,0.00046513454,0.0010824547,0.00042453883],"domain_scores_gemma":[0.99722075,0.00013874366,0.00009871767,0.00054311025,0.0019821578,0.000016521595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004363133,0.00018324317,0.00027549657,0.0006794621,0.0009028923,0.0005345986,0.0004033325,0.000042447486,0.000106069856],"category_scores_gemma":[0.00019965872,0.00017532235,0.000068367466,0.0009835275,0.00013512438,0.0013707007,0.00019651676,0.0002564817,0.00012257519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022564453,0.00007494525,0.00045796277,0.00011142425,0.000039478164,0.0000020304685,0.000027924712,0.96460235,0.018559502,0.011988483,0.0001013367,0.0040119723],"study_design_scores_gemma":[0.00089645496,0.000021312046,0.001070202,0.00013541187,0.000071471346,0.0000022791253,0.0003303675,0.990483,0.006406896,0.00013022676,0.00026930872,0.00018306526],"about_ca_topic_score_codex":0.00082904083,"about_ca_topic_score_gemma":0.0002469905,"teacher_disagreement_score":0.030933915,"about_ca_system_score_codex":0.0003111392,"about_ca_system_score_gemma":0.00009474233,"threshold_uncertainty_score":0.71494377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17674464,0.000032797314,0.81666523,0.004785075,0.0002556807,0.0012186086,0.000028908573,0.000015894462,0.00025316083],"genre_scores_gemma":[0.99413264,0.0000030222845,0.0055133393,0.00007909198,0.00007810038,0.000078737234,0.000059932463,0.000005043205,0.00005008826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989597,0.000037190584,0.0003162392,0.00017027662,0.0003650741,0.00015149602],"domain_scores_gemma":[0.9987272,0.00013050536,0.0000412324,0.00022433036,0.00086687005,0.000009867433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009207652,0.00007662191,0.0001140414,0.00010848721,0.0006103971,0.00011904187,0.00028343982,0.00003325075,0.0000150398355],"category_scores_gemma":[0.00009623368,0.000052163417,0.00003814504,0.00041374547,0.00040044708,0.00037195103,0.00014601406,0.00017512093,0.000002244566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019079578,0.00009362333,0.00047031458,0.0001619943,0.000019540259,1.3557776e-8,0.0004012932,0.7671809,0.00028128337,0.22794257,0.0018374794,0.001591917],"study_design_scores_gemma":[0.0002776524,0.0000113402875,0.0061191665,0.000028761207,0.000011231267,3.5964524e-7,0.00023511518,0.9896123,0.000050412815,0.0024571675,0.0011408089,0.000055703244],"about_ca_topic_score_codex":0.0015838268,"about_ca_topic_score_gemma":0.0041585215,"teacher_disagreement_score":0.817388,"about_ca_system_score_codex":0.00001911706,"about_ca_system_score_gemma":0.00006785578,"threshold_uncertainty_score":0.46947423},"labels":[],"label_agreement":null},{"id":"W2066938616","doi":"10.1016/j.cor.2011.12.020","title":"The inventory-routing problem with transshipment","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":223,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Transshipment (information security); Heuristics; Computer science; Routing (electronic design automation); Heuristic; Mathematical optimization; Vehicle routing problem; Operations research; Vendor; Mathematics; Artificial intelligence; Computer network; Business","score_opus":0.06979017429723672,"score_gpt":0.3511868917928779,"score_spread":0.28139671749564116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066938616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062593944,0.00050697394,0.93023455,0.0009336831,0.0003023884,0.00067895855,0.0000015344083,0.00031584184,0.0044320957],"genre_scores_gemma":[0.8431851,0.00004499146,0.15610555,0.000023376546,0.00018867235,0.00011046049,0.0000064373976,0.000036454116,0.0002989571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983196,0.0003595218,0.00019848385,0.00012792343,0.00041138995,0.000583084],"domain_scores_gemma":[0.99913305,0.00024723553,0.000006193519,0.00029067966,0.00017779008,0.00014505546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023934953,0.00010391326,0.00008633692,0.00010552596,0.0009079303,0.00029885868,0.00028559484,0.000042447457,0.000017307784],"category_scores_gemma":[0.00004038697,0.000073419564,0.00002380578,0.0005582574,0.000108431756,0.00024890093,0.000054361408,0.00039193712,0.000046522924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041684834,0.000029219596,0.0013796852,0.000019416655,0.000039404367,7.729826e-7,0.0030025246,0.9705636,0.00044811252,0.006649754,0.0013073608,0.016555993],"study_design_scores_gemma":[0.00023078412,0.000038807644,0.00068291184,0.000040904466,0.000004431152,0.000008355743,0.00033245055,0.9893927,0.0011531791,0.000017010647,0.007964102,0.00013438355],"about_ca_topic_score_codex":0.000015574635,"about_ca_topic_score_gemma":0.000031436768,"teacher_disagreement_score":0.7805912,"about_ca_system_score_codex":0.0001527745,"about_ca_system_score_gemma":0.000055062093,"threshold_uncertainty_score":0.6983158},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15585457,0.00005813649,0.8290567,0.009988769,0.0010227066,0.0011946129,0.000009828915,0.000109758075,0.0027049608],"genre_scores_gemma":[0.99592716,0.0000042591614,0.0016864691,0.0005162764,0.0010345116,0.00015817615,0.00046063322,0.0000110914,0.00020142473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.00005648568,0.00025984115,0.00029198563,0.00029778815,0.0004310473],"domain_scores_gemma":[0.9993397,0.00008355777,0.000008572675,0.00024186107,0.000306436,0.0000198745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001691518,0.000095805975,0.00011780539,0.00020802343,0.00058627245,0.00043516234,0.0002604882,0.000047435493,0.000060176248],"category_scores_gemma":[0.00036906,0.000097591816,0.00004216216,0.0007716268,0.00005457723,0.00054178457,0.00020257992,0.0001861601,0.0001737904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000425259,0.00012913854,0.0026588202,0.000100197314,0.00001635624,5.7388525e-7,0.00009514927,0.59888077,0.000013773289,0.28714967,0.10111685,0.009796202],"study_design_scores_gemma":[0.00035954601,0.000029492176,0.005256774,0.000028766708,0.0000027655726,1.3872045e-7,0.00006592034,0.7247292,0.0000030741578,0.000862087,0.2685733,0.000088929104],"about_ca_topic_score_codex":0.0002326784,"about_ca_topic_score_gemma":0.0011671635,"teacher_disagreement_score":0.8400726,"about_ca_system_score_codex":0.000073662595,"about_ca_system_score_gemma":0.000024357314,"threshold_uncertainty_score":0.45091927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43361238,0.00038350277,0.5641868,0.00018800459,0.0000763501,0.00021527482,0.0000044150624,0.00055694836,0.00077632454],"genre_scores_gemma":[0.57844603,0.000034138222,0.42135534,0.000013634438,0.00007672125,0.000011555583,0.000016090762,0.000015277086,0.000031230484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.00008267311,0.00028366255,0.00018930597,0.00026242973,0.00026290567],"domain_scores_gemma":[0.99933,0.000092334674,0.000008957865,0.00020628776,0.00026883133,0.00009358231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357919,0.00009741656,0.00014356477,0.00027034292,0.00023276858,0.00015622441,0.00017309192,0.000047118836,0.000009268195],"category_scores_gemma":[0.00009429474,0.00010116909,0.000025213905,0.00044876497,0.00008610155,0.00018075998,0.00008069667,0.0002461005,0.000015328613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011689729,0.000025721716,0.00004160487,0.000025742753,0.000020911002,8.2185767e-7,0.0006153305,0.9896868,0.0011747245,0.00036583946,0.00038188734,0.007659432],"study_design_scores_gemma":[0.00030801335,0.000015066937,0.00009446499,0.000039933937,0.0000031526106,0.00001509772,0.00020103416,0.99529564,0.0038462635,0.000003945515,0.000078899946,0.000098508855],"about_ca_topic_score_codex":0.000020321413,"about_ca_topic_score_gemma":0.0000022428014,"teacher_disagreement_score":0.14483362,"about_ca_system_score_codex":0.00005961765,"about_ca_system_score_gemma":0.00004955664,"threshold_uncertainty_score":0.41255558},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5117019,0.00019307378,0.1676076,0.0037198612,0.0013847875,0.005465543,0.000004360231,0.00016945468,0.30975345],"genre_scores_gemma":[0.9798723,0.0000058386995,0.015116224,0.0011722428,0.0006830269,0.00041134772,0.0000450305,0.000031238975,0.002662753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784064,0.000055527842,0.00032420165,0.00049232726,0.00071315235,0.0005741578],"domain_scores_gemma":[0.9991416,0.0000366067,0.00002253063,0.0004268694,0.00030644634,0.00006595455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026803277,0.0001586738,0.00018897388,0.002329898,0.00029149215,0.00085027236,0.0006192388,0.000045695015,0.00001975659],"category_scores_gemma":[0.00016055576,0.00015958831,0.0000436361,0.0038224505,0.00005149835,0.00067594333,0.0009730186,0.00025527793,0.00060022343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007520567,0.00089334324,0.006854142,0.00045124957,0.00007158058,0.0001203191,0.0013190323,0.5076964,0.000020029584,0.046042297,0.40453008,0.03192632],"study_design_scores_gemma":[0.0009881118,0.000035690795,0.0026311418,0.00010693597,0.000008806825,0.0000021813453,0.0014894246,0.8887413,0.0000069322973,0.00065594335,0.10508765,0.00024586477],"about_ca_topic_score_codex":0.0007910508,"about_ca_topic_score_gemma":0.00019593028,"teacher_disagreement_score":0.46817043,"about_ca_system_score_codex":0.00023427876,"about_ca_system_score_gemma":0.000035770718,"threshold_uncertainty_score":0.8199196},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016285876,0.00023575113,0.9782224,0.002846232,0.0001614043,0.001773287,0.0000069411926,0.00006934955,0.0003987462],"genre_scores_gemma":[0.7059882,0.00020668622,0.2917795,0.00013645864,0.00033424815,0.0004310979,0.00015033814,0.000015300235,0.00095815514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985251,0.00038847214,0.0001677861,0.00023591393,0.00031985692,0.00036288332],"domain_scores_gemma":[0.9984949,0.0005332519,0.000014682058,0.00009264784,0.0007145205,0.00015000175],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014630589,0.00008009359,0.00009980256,0.00012404432,0.0018065702,0.00052793784,0.00014584634,0.00009605653,0.000089341585],"category_scores_gemma":[0.0001156309,0.000079658894,0.000023933875,0.0004378754,0.0002066507,0.0004618162,0.0000075933863,0.00015610097,0.000016521037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014367735,0.000023226661,0.00020278712,0.000008356962,0.000010840993,7.8572594e-7,0.00911413,0.9582456,0.00003298395,0.009654637,0.011277485,0.011414819],"study_design_scores_gemma":[0.0005936447,0.00011193795,0.0027488947,0.000040803552,0.000011538327,0.0000013367047,0.0020706714,0.9735286,0.000031888852,0.00025581886,0.020439994,0.0001648696],"about_ca_topic_score_codex":0.0008719811,"about_ca_topic_score_gemma":0.0005290279,"teacher_disagreement_score":0.68970233,"about_ca_system_score_codex":0.000056035216,"about_ca_system_score_gemma":0.000238696,"threshold_uncertainty_score":0.99949294},"labels":[],"label_agreement":null},{"id":"W2070595290","doi":"10.1016/j.cor.2009.09.014","title":"Solving a rich vehicle routing and inventory problem using column generation","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Column generation; Computer science; Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Column (typography); Production (economics); Work (physics); Sequence (biology); Construct (python library); Operations research; Mathematics; Economics; Engineering","score_opus":0.0986991988754276,"score_gpt":0.36455434726329644,"score_spread":0.26585514838786883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070595290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5303719,0.00018615324,0.46818796,0.00019283965,0.00010920796,0.0003206382,0.0000011358825,0.00019164618,0.00043852875],"genre_scores_gemma":[0.71110284,0.000024425683,0.28850484,0.000054118056,0.00021265101,0.000011607799,0.000009613426,0.000022963926,0.000056913694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830246,0.0003496076,0.0003046195,0.00028878372,0.000333893,0.00042066345],"domain_scores_gemma":[0.9992529,0.00007786851,0.00001308689,0.0002388784,0.00029072256,0.00012653058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014787423,0.00013129634,0.00014909382,0.0003062949,0.00078206067,0.00054533273,0.00016764768,0.00009046993,0.000012681829],"category_scores_gemma":[0.00011023532,0.00015500032,0.000023879413,0.0007284229,0.000059105376,0.00039881302,0.00008387108,0.0003769668,0.000008551506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012071796,0.000017037302,0.0004666933,0.000014665975,0.000011227037,0.0000028257568,0.0012126833,0.9354874,0.051013052,0.0007255323,0.00043072217,0.010616954],"study_design_scores_gemma":[0.00024451583,0.000045510045,0.0007115731,0.00004763928,0.00000487546,0.000010875479,0.00008639994,0.9962073,0.0023666602,0.000039075036,0.00007899207,0.00015656951],"about_ca_topic_score_codex":0.00003777663,"about_ca_topic_score_gemma":0.000022812517,"teacher_disagreement_score":0.18073097,"about_ca_system_score_codex":0.00023664063,"about_ca_system_score_gemma":0.000084458945,"threshold_uncertainty_score":0.632073},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027070502,0.00004204966,0.9707688,0.0002762104,0.000017697159,0.0014320441,0.000024826863,0.00003347118,0.0003343771],"genre_scores_gemma":[0.94984716,0.0000051237776,0.04896233,0.00002055032,0.0001949124,0.00060286315,0.0001398672,0.00001800738,0.00020919873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979277,0.00063516817,0.00031299953,0.0003161537,0.0004550288,0.00035292198],"domain_scores_gemma":[0.9978051,0.000944479,0.00002576176,0.00042712793,0.00062625273,0.00017123707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019926364,0.00012967548,0.00042607918,0.00021195147,0.00028667902,0.00010568975,0.000320449,0.000021560001,0.00007691098],"category_scores_gemma":[0.000015708521,0.00010009204,0.000165622,0.0003338728,0.00044722218,0.00008185563,0.00015409519,0.0002025952,0.0000062032486],"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.011299647,0.0008667929,0.005617847,0.000073129646,0.0009044877,0.0000020315376,0.00081821874,0.15160276,0.0002907686,0.22703192,0.0034932632,0.59799916],"study_design_scores_gemma":[0.021459466,0.00016391466,0.00010740016,0.000059082235,0.000044636745,2.6035374e-7,0.000111425245,0.9745681,0.0006422563,0.0018254201,0.00089608313,0.00012192655],"about_ca_topic_score_codex":0.0005711841,"about_ca_topic_score_gemma":0.000031204905,"teacher_disagreement_score":0.92277664,"about_ca_system_score_codex":0.000058664453,"about_ca_system_score_gemma":0.000196953,"threshold_uncertainty_score":0.4081635},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19304843,0.000267991,0.7128562,0.019764775,0.0011215329,0.001715722,0.0000035881649,0.00046655364,0.07075525],"genre_scores_gemma":[0.96257913,0.000060263726,0.03259966,0.00020689411,0.00043490445,0.000062220955,0.00003845434,0.0000078536505,0.0040105996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858797,0.00032490035,0.00014076283,0.00016608053,0.00041928937,0.00036102714],"domain_scores_gemma":[0.9990162,0.00020758071,0.0000086233595,0.00012862239,0.0005240662,0.000114880015],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009119696,0.000048287493,0.0000643362,0.00011482266,0.001777995,0.0004843865,0.00022069241,0.000056816974,0.000461117],"category_scores_gemma":[0.000109213106,0.00004773205,0.000021339714,0.00075125217,0.000168883,0.00037894904,0.000020197002,0.00018762998,0.00044751065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018571624,0.00003265541,0.0042633857,0.000003539351,0.000009475418,0.0000021683686,0.010549424,0.85747206,0.000033009066,0.051477734,0.061994407,0.014160295],"study_design_scores_gemma":[0.0006566958,0.00015234921,0.08253562,0.00014564004,0.000010038527,0.0000016737395,0.008498654,0.73972744,0.000059267863,0.0031078714,0.16457951,0.00052521675],"about_ca_topic_score_codex":0.003818569,"about_ca_topic_score_gemma":0.0012371895,"teacher_disagreement_score":0.7695307,"about_ca_system_score_codex":0.00006404149,"about_ca_system_score_gemma":0.00020188249,"threshold_uncertainty_score":0.99952155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03953164,0.00034586503,0.95749533,0.00024480873,0.00019940195,0.00093330815,0.000019411433,0.00010621946,0.0011240176],"genre_scores_gemma":[0.97303295,0.00006829169,0.026494328,0.000027740103,0.000030530526,0.000120735116,0.00003880941,0.00002089808,0.00016572916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.00010384013,0.000210161,0.00016144273,0.00023163734,0.00024143035],"domain_scores_gemma":[0.99898326,0.00023033247,0.000009403768,0.00032256695,0.00039806403,0.000056387555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000815127,0.00008351196,0.00013380045,0.0004090903,0.00038294564,0.00028535104,0.00024122081,0.000045783898,0.00006937351],"category_scores_gemma":[0.00008121521,0.00006461242,0.00006795676,0.0014431649,0.00007931451,0.00015287338,0.000016174949,0.00013805654,0.0000040752525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031506913,0.000040116265,0.00020326769,0.000036298716,0.0002016554,2.2794887e-7,0.0007785988,0.9879604,0.0008734852,0.008048424,0.001051874,0.0008025027],"study_design_scores_gemma":[0.00013983226,0.000067731555,0.00026764316,0.000017386092,0.00004699884,7.968954e-7,0.00014264729,0.9949522,0.00082903565,0.00006696819,0.0033875187,0.00008123634],"about_ca_topic_score_codex":0.000028073202,"about_ca_topic_score_gemma":0.0003649349,"teacher_disagreement_score":0.9335013,"about_ca_system_score_codex":0.00004207261,"about_ca_system_score_gemma":0.0000944046,"threshold_uncertainty_score":0.29453468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928898,0.00004047612,0.0052821687,0.00031237016,0.00045898734,0.0008659663,7.650536e-7,0.00008431625,0.00006511855],"genre_scores_gemma":[0.9869705,0.0000025795746,0.012596314,0.0000064768587,0.00019890744,0.00017376573,0.0000060517878,0.000016246295,0.000029158537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987627,0.00021453701,0.00021016561,0.0002820765,0.0003060536,0.00022446946],"domain_scores_gemma":[0.99942714,0.00006385408,0.000008392161,0.00029221183,0.00015295263,0.00005543003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014335099,0.00010637253,0.000116995194,0.00035713305,0.00039526357,0.0002432992,0.00013300964,0.000087908535,0.0000042407955],"category_scores_gemma":[0.00007681647,0.00008436059,0.000008340591,0.00094240083,0.000073840085,0.00019939172,0.000039822495,0.001320057,0.0000037997625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009461895,0.00010440148,0.037408095,0.000026917116,0.000013756097,0.00033819207,0.009027219,0.9524836,0.00008831322,0.00005431661,0.000046006513,0.00039972775],"study_design_scores_gemma":[0.000583781,0.00008612132,0.007138341,0.00009260266,0.0000041187036,0.0008335842,0.037443507,0.9535902,0.000100463614,7.394084e-7,0.000009120612,0.000117429365],"about_ca_topic_score_codex":0.00034388946,"about_ca_topic_score_gemma":0.0010068573,"teacher_disagreement_score":0.030269753,"about_ca_system_score_codex":0.000070544455,"about_ca_system_score_gemma":0.000058288242,"threshold_uncertainty_score":0.5735064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15727995,0.0001190322,0.83613765,0.0012124256,0.0011764853,0.00039554795,0.0000029256937,0.00040289926,0.00327307],"genre_scores_gemma":[0.7488149,0.00007447847,0.25030252,0.000026316053,0.00026631984,0.00005678411,0.000009530229,0.000035004574,0.00041417082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987641,0.00017516059,0.00021034644,0.00016684072,0.0002995035,0.00038407542],"domain_scores_gemma":[0.9987123,0.0004896493,0.0000048250677,0.00042566977,0.00027548565,0.0000920834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018048334,0.000089947105,0.000083797364,0.00008772539,0.0009773043,0.00045616634,0.0004484303,0.00007124586,0.000030895735],"category_scores_gemma":[0.00020117218,0.00007228792,0.000030968473,0.0005159094,0.00013381678,0.00011913568,0.00008104827,0.00083085557,0.000100481906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014032672,0.0000080413065,0.00007963808,0.0000074323893,0.000013167541,0.0000013113972,0.0003501812,0.93575627,0.022603765,0.0051569887,0.0018614201,0.034160383],"study_design_scores_gemma":[0.000136504,0.00001031386,0.0006717334,0.000008863157,0.000001233515,0.0000060472075,0.000054023545,0.9886696,0.0025987155,0.00008094354,0.0076747853,0.00008727903],"about_ca_topic_score_codex":0.000012690852,"about_ca_topic_score_gemma":0.00012344924,"teacher_disagreement_score":0.5915349,"about_ca_system_score_codex":0.00003993926,"about_ca_system_score_gemma":0.000060469618,"threshold_uncertainty_score":0.75167334},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7604336,0.00003276337,0.23603755,0.0023472856,0.00007922754,0.0005776505,0.0000045893253,0.000055961667,0.00043135672],"genre_scores_gemma":[0.93012273,0.0000021151225,0.068819664,0.00016209042,0.00029180245,0.00018217212,0.000052908206,0.000024815647,0.00034169803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941733,0.0012561113,0.00084417633,0.0010192381,0.0021296395,0.00057753053],"domain_scores_gemma":[0.99611646,0.0011945241,0.000045173885,0.0013316376,0.001108985,0.00020324525],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007136468,0.0001791888,0.00025967337,0.00156953,0.0007636423,0.0020903614,0.0014429429,0.00011288882,0.000207935],"category_scores_gemma":[0.0007776501,0.00011952667,0.000037812406,0.0014195458,0.00021837742,0.0015116697,0.00033307498,0.00044342355,0.00071495975],"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.00053706294,0.00071697595,0.029703258,0.000009508908,0.000016402191,0.0000309447,0.03375799,0.39761868,0.122443065,0.0013219223,0.004272707,0.40957147],"study_design_scores_gemma":[0.0006448798,0.00011469691,0.03989842,0.000035401164,0.0000012400715,0.0000114928625,0.0016546561,0.9231468,0.0015668783,0.00027636424,0.03247312,0.00017605451],"about_ca_topic_score_codex":0.00020018597,"about_ca_topic_score_gemma":0.0014924085,"teacher_disagreement_score":0.52552813,"about_ca_system_score_codex":0.00018972861,"about_ca_system_score_gemma":0.00007371876,"threshold_uncertainty_score":0.9989456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74988383,0.000175756,0.24913996,0.00036075636,0.00006737814,0.00026320483,0.000029309796,0.00001946669,0.00006030784],"genre_scores_gemma":[0.94381684,0.00011522766,0.055235047,0.00005617862,0.00007863426,0.000009498718,0.000553611,0.00000891806,0.00012604965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898363,0.0017327117,0.0010626599,0.0013636809,0.005496198,0.0005084613],"domain_scores_gemma":[0.99392533,0.0010666552,0.00011391778,0.002338067,0.0023541285,0.00020187104],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.017438669,0.0001950862,0.00058113603,0.0054656,0.0025097022,0.0008127132,0.001958403,0.000075745156,0.0003001024],"category_scores_gemma":[0.0013553812,0.00016250943,0.00016764335,0.018337445,0.0004779218,0.000871306,0.0016958325,0.00038036608,0.000044856093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007328846,0.00021104096,0.07521104,0.0000016056546,0.0009324706,0.0000069074817,0.0011359367,0.90227824,0.00029568054,0.0000331087,0.000108399996,0.019778265],"study_design_scores_gemma":[0.00016178645,0.000022482547,0.2512296,0.000006656833,0.0006294341,0.00000679502,0.000159071,0.74729276,0.00006123988,0.0000106587995,0.00028543628,0.00013405901],"about_ca_topic_score_codex":0.0006942526,"about_ca_topic_score_gemma":0.0017827849,"teacher_disagreement_score":0.19393298,"about_ca_system_score_codex":0.00031372107,"about_ca_system_score_gemma":0.00061396585,"threshold_uncertainty_score":0.9987889},"labels":[],"label_agreement":null},{"id":"W2083487387","doi":"10.1016/j.cor.2014.12.001","title":"A hybrid method for the Probabilistic Maximal Covering Location–Allocation Problem","year":2014,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Université Laval","keywords":"Mathematical optimization; Benchmark (surveying); Solver; Probabilistic logic; Heuristic; Integer programming; Computer science; Metaheuristic; Linear programming; Mathematics; Algorithm; Artificial intelligence","score_opus":0.05287132260263117,"score_gpt":0.36430405751876127,"score_spread":0.3114327349161301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083487387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012275251,0.00009234402,0.99507004,0.0012101018,0.00024429697,0.0014369506,0.0000054075826,0.00025791515,0.0004554281],"genre_scores_gemma":[0.28503773,0.000013526751,0.713709,0.000059449678,0.00023115623,0.00068670453,0.00003598538,0.000044983863,0.00018144862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981777,0.0004635203,0.00032276515,0.00029532626,0.0003485767,0.00039211585],"domain_scores_gemma":[0.99682647,0.0017347261,0.000014907652,0.00049334974,0.00084799196,0.00008254419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038881402,0.00013860341,0.00014689844,0.00018913922,0.00074779114,0.00040490623,0.00044502987,0.00005123295,0.00001546374],"category_scores_gemma":[0.00081864157,0.000119346536,0.000045496894,0.00060188223,0.000083928935,0.00020499059,0.00009600037,0.00030336465,0.00003259968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004527429,0.000017556104,0.0000068985314,0.000095104646,0.000023575787,1.208213e-7,0.0002846785,0.92992085,0.0007365967,0.014423594,0.0012911304,0.05319537],"study_design_scores_gemma":[0.00027222827,0.00005434301,0.00012039619,0.00003775479,0.000010903497,0.00000788325,0.000035110475,0.99143267,0.0012144255,0.0007744272,0.005905108,0.0001347484],"about_ca_topic_score_codex":0.000042527874,"about_ca_topic_score_gemma":0.000026351954,"teacher_disagreement_score":0.28381023,"about_ca_system_score_codex":0.00019593291,"about_ca_system_score_gemma":0.00011221614,"threshold_uncertainty_score":0.57514805},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67311996,0.0014817001,0.32204384,0.0016993461,0.000051158928,0.0006333239,0.00007167622,0.000017045753,0.0008819147],"genre_scores_gemma":[0.9884953,0.00011529919,0.011045422,0.00006857953,0.000046625253,0.00010844896,0.000021769598,0.000013991346,0.00008454545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988861,0.000030721247,0.00042093114,0.00029492337,0.0000822228,0.000285099],"domain_scores_gemma":[0.9994173,0.00009469726,0.000057792324,0.00018498072,0.00019769276,0.00004754995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087864936,0.00011273087,0.0002283636,0.00023242254,0.00071136164,0.00043376783,0.0002521228,0.00004883728,0.000008003781],"category_scores_gemma":[0.00007757431,0.00009398391,0.00005877028,0.0003049695,0.00035880064,0.0005298363,0.00008018968,0.00015760283,0.0000035911055],"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.000014026674,0.00002702645,0.00060099055,0.000053299,0.000025693485,2.7861066e-7,0.0018898996,0.3383801,0.00012290785,0.658556,0.00014421169,0.00018556266],"study_design_scores_gemma":[0.0004488724,0.00009684192,0.004451861,0.000037292793,0.000002887873,0.0000021253868,0.0004990111,0.8617597,0.00008522652,0.13232328,0.0001767004,0.00011617416],"about_ca_topic_score_codex":0.00046854524,"about_ca_topic_score_gemma":0.00007660863,"teacher_disagreement_score":0.5262327,"about_ca_system_score_codex":0.000080419726,"about_ca_system_score_gemma":0.00025246025,"threshold_uncertainty_score":0.5471291},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023630552,0.00004371555,0.960751,0.0016027289,0.00015031041,0.0024643252,0.0000020630405,0.00029378163,0.011061502],"genre_scores_gemma":[0.9534232,0.0000015509233,0.036966152,0.0010995874,0.0016638853,0.0009162469,0.0008364054,0.000075812604,0.0050171763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971716,0.00015690624,0.0003220454,0.0006718598,0.0005625952,0.0011150377],"domain_scores_gemma":[0.99712884,0.00018692267,0.000035427045,0.0006858967,0.0019108687,0.000052045933],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0042149373,0.0002371574,0.00024727714,0.0014242146,0.0016194987,0.0028521242,0.00097488135,0.00009339857,0.0000732215],"category_scores_gemma":[0.0005942147,0.00022843055,0.0000719265,0.0016801307,0.00014948887,0.0019917558,0.00050011027,0.00035565067,0.000055424433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007461754,0.00032746076,0.0009539177,0.00053503143,0.000043483975,0.000019131263,0.00043322527,0.5383584,0.00009591078,0.3776256,0.069535784,0.011997414],"study_design_scores_gemma":[0.0006288835,0.00007144145,0.0003173767,0.000020306861,0.000009825553,7.6465227e-7,0.009754643,0.7841863,0.000020715934,0.0012633556,0.2035009,0.00022548014],"about_ca_topic_score_codex":0.0015134931,"about_ca_topic_score_gemma":0.000036109504,"teacher_disagreement_score":0.92979264,"about_ca_system_score_codex":0.00023913645,"about_ca_system_score_gemma":0.00011079476,"threshold_uncertainty_score":0.9996803},"labels":[],"label_agreement":null},{"id":"W2085543268","doi":"10.1016/j.cor.2009.05.005","title":"The undirected capacitated arc routing problem with profits","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Arc routing; Mathematical optimization; Profit (economics); Vehicle routing problem; Computer science; Undirected graph; Graph; Enhanced Data Rates for GSM Evolution; Mathematics; Routing (electronic design automation); Theoretical computer science; Economics; Artificial intelligence; Microeconomics","score_opus":0.045654646211437444,"score_gpt":0.3336104762566733,"score_spread":0.28795583004523584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085543268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095653445,0.00019453448,0.8883883,0.0028927645,0.00018271993,0.0013669349,0.0000041836806,0.001105515,0.010211601],"genre_scores_gemma":[0.7452965,0.000031741773,0.2539176,0.000037480822,0.0000868051,0.000054784483,0.000018061526,0.000032811997,0.00052420463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981263,0.0004207256,0.0002514865,0.00022894124,0.00043707437,0.00053542224],"domain_scores_gemma":[0.9986171,0.00034071069,0.00001071354,0.00036262558,0.0005626158,0.00010624971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014099911,0.00013711938,0.00012363684,0.00017900695,0.0011174824,0.0005581251,0.0003580059,0.000058451853,0.000007963199],"category_scores_gemma":[0.00014164687,0.000098653734,0.000022946573,0.0013878304,0.00011323645,0.00019148467,0.000040406354,0.00053346565,0.000032115295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007536828,0.000018397333,0.00007121544,0.000007720414,0.000027354045,0.00000424691,0.000886133,0.96510756,0.0023838968,0.0033341118,0.0011562114,0.026995616],"study_design_scores_gemma":[0.00026752884,0.000102555845,0.0009592707,0.000060977163,0.0000034307282,0.000012410365,0.00012120333,0.99528164,0.0019938522,0.00007124829,0.0009837225,0.00014216112],"about_ca_topic_score_codex":0.0000206279,"about_ca_topic_score_gemma":0.000045733672,"teacher_disagreement_score":0.64964306,"about_ca_system_score_codex":0.00015315413,"about_ca_system_score_gemma":0.00010063149,"threshold_uncertainty_score":0.85948837},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005725153,0.00009293448,0.99518466,0.0023342061,0.00038206985,0.0006761679,0.000009522406,0.00009021693,0.0006576848],"genre_scores_gemma":[0.20818335,0.000012462862,0.78962404,0.00021060935,0.0006024817,0.00017762401,0.00017289596,0.000014264966,0.0010022591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981029,0.0006110672,0.00015601642,0.00020531184,0.00055152,0.00037321],"domain_scores_gemma":[0.99806726,0.00055760925,0.000012471734,0.00013700077,0.0010151258,0.00021052863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037648156,0.00006232578,0.00009040333,0.00014470855,0.0012473747,0.00030734928,0.00023880559,0.00006866557,0.000023718041],"category_scores_gemma":[0.00034980997,0.00006280357,0.00003372384,0.00076728786,0.00013602835,0.00020620224,0.000009836826,0.00012438033,0.000026087762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019552803,0.00003312582,0.0002564502,0.000002741023,0.0000066711477,0.0000014918011,0.0028470969,0.94064903,0.0000024074416,0.006847192,0.04631199,0.0030222249],"study_design_scores_gemma":[0.00050280953,0.00013565195,0.0002066467,0.000019041445,0.0000049263326,8.798119e-8,0.0011292299,0.9637398,0.000023083185,0.0004340996,0.03370864,0.00009596054],"about_ca_topic_score_codex":0.0005151562,"about_ca_topic_score_gemma":0.0005068909,"teacher_disagreement_score":0.20761083,"about_ca_system_score_codex":0.000121034536,"about_ca_system_score_gemma":0.000980352,"threshold_uncertainty_score":0.95939237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028420288,0.00007881373,0.9657669,0.0007174872,0.0003824014,0.00037872043,0.0000037103737,0.0040482683,0.00020339571],"genre_scores_gemma":[0.55082756,0.0000031002555,0.44857517,0.0001729568,0.0003003392,0.000016747876,0.000029994972,0.000014314298,0.000059814185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970186,0.00025599505,0.00043268804,0.00081666565,0.00083046587,0.0006456027],"domain_scores_gemma":[0.9949343,0.0017824684,0.000035213267,0.002481441,0.00057914807,0.00018739168],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0051965467,0.0001763982,0.00017322024,0.0005898966,0.0011472633,0.0011333573,0.0026093868,0.00010526315,0.000011516322],"category_scores_gemma":[0.0024338271,0.0001720594,0.00003440187,0.0014736905,0.000111081376,0.0010623002,0.0018890138,0.0005280934,0.00011140687],"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.0000015750436,0.00023572412,0.0035319496,0.00003343914,0.000025390746,0.00007727247,0.0012263006,0.0030405773,0.008337192,0.0010922153,0.049898706,0.93249965],"study_design_scores_gemma":[0.0001423921,0.00013564194,0.0020354954,0.000052139134,0.0000025549712,0.00006990004,0.0000053972985,0.9924894,0.0038758,0.00049553334,0.00049901224,0.00019671474],"about_ca_topic_score_codex":0.00032433204,"about_ca_topic_score_gemma":0.00018086887,"teacher_disagreement_score":0.98944885,"about_ca_system_score_codex":0.00017838612,"about_ca_system_score_gemma":0.00023773512,"threshold_uncertainty_score":0.99990356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15206993,0.0007387109,0.84462094,0.001554993,0.0002122264,0.0004373789,0.000011661816,0.00019252054,0.00016164331],"genre_scores_gemma":[0.45565325,0.00026401604,0.54355586,0.000088919434,0.00015175978,0.00007502662,0.000034479337,0.00003526841,0.00014139795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987723,0.00007247026,0.00022249823,0.0003135848,0.0002704589,0.0003486938],"domain_scores_gemma":[0.9992415,0.00008318367,0.000005974507,0.00017170467,0.00024181548,0.00025583198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528771,0.00016174011,0.00017952152,0.00039021758,0.000515301,0.0004078597,0.00014178347,0.000081488484,0.000022813529],"category_scores_gemma":[0.000098236414,0.00016416011,0.000022446398,0.0006967742,0.000057660825,0.00020636889,0.00011113828,0.00038474277,0.000031067408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012388091,0.00001734325,0.00056630495,0.000021819247,0.000026268226,0.0000038304274,0.00043321564,0.9921819,0.0004987041,0.00050663593,0.00008533274,0.00564629],"study_design_scores_gemma":[0.00095083273,0.000051512416,0.0023054879,0.00004860081,0.0000060648485,0.000035967743,0.00007211778,0.9956868,0.00034196704,0.000040905103,0.00027476676,0.00018497332],"about_ca_topic_score_codex":0.00025010994,"about_ca_topic_score_gemma":0.00027385927,"teacher_disagreement_score":0.30358332,"about_ca_system_score_codex":0.00011575014,"about_ca_system_score_gemma":0.000056045246,"threshold_uncertainty_score":0.6694255},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968549,0.00054599444,0.14976789,0.0011217383,0.00062783813,0.0009124721,0.000106773856,0.00007655984,0.049985845],"genre_scores_gemma":[0.9890529,0.00009360456,0.0074925576,0.00014193461,0.0003548437,0.00009181454,0.00007833411,0.000021288603,0.0026727226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985464,0.000045944296,0.0004293514,0.00041250914,0.00008410374,0.00048166586],"domain_scores_gemma":[0.9992454,0.00015665329,0.000044796478,0.00030581086,0.00018967628,0.000057684538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016142817,0.00012852029,0.0002524416,0.0003589661,0.00074285,0.00040922654,0.0001792794,0.00008004767,0.00006381534],"category_scores_gemma":[0.00008746898,0.00014380869,0.00007516788,0.00041959825,0.00012196161,0.0004621025,0.00009552289,0.00020965106,0.00017002833],"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.000020037332,0.00018949475,0.010516755,0.00005508473,0.000025111873,0.000008884593,0.00014529751,0.032808572,0.0002525435,0.92462593,0.028585957,0.0027663275],"study_design_scores_gemma":[0.00068180193,0.00027979258,0.14864565,0.000037573263,0.0000032399412,0.000010827349,0.000042259897,0.7736542,0.00046168204,0.016296571,0.05950169,0.00038466105],"about_ca_topic_score_codex":0.0016134984,"about_ca_topic_score_gemma":0.00017067998,"teacher_disagreement_score":0.90832937,"about_ca_system_score_codex":0.0001503723,"about_ca_system_score_gemma":0.00009189989,"threshold_uncertainty_score":0.5864348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11083051,0.000077637356,0.8848984,0.001463662,0.00013485449,0.00038215928,0.000013302245,0.00017791499,0.002021557],"genre_scores_gemma":[0.97769886,0.000012650414,0.020895643,0.00009725491,0.00031610206,0.000037284375,0.000754879,0.000020697687,0.00016661793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985223,0.00015381891,0.0003953055,0.00026456136,0.00045450064,0.00020950974],"domain_scores_gemma":[0.99776745,0.00013272105,0.00008308356,0.00059784384,0.0013988678,0.00002001071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009924987,0.000111564215,0.0001696861,0.00062253675,0.0005371142,0.00028479917,0.0006927783,0.00005324222,0.00018512103],"category_scores_gemma":[0.00023559803,0.000114028975,0.000054501103,0.001336314,0.00012783505,0.0017138926,0.00028877877,0.00020982417,0.00010497693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011705293,0.00016570883,0.000045374996,0.00003935148,0.000031677177,0.0000018927188,0.0000603323,0.94601935,0.0001577105,0.0499616,0.00031579676,0.003189509],"study_design_scores_gemma":[0.00027705432,0.000019307146,0.00025161635,0.00006063144,0.000016602178,0.0000022841198,0.00028723074,0.99739635,0.00005394328,0.00019302456,0.0013346004,0.00010735193],"about_ca_topic_score_codex":0.0002771395,"about_ca_topic_score_gemma":0.00014913271,"teacher_disagreement_score":0.8668684,"about_ca_system_score_codex":0.00015739705,"about_ca_system_score_gemma":0.000016698119,"threshold_uncertainty_score":0.46499667},"labels":[],"label_agreement":null},{"id":"W2089432311","doi":"10.1016/j.cor.2015.04.002","title":"A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Metaheuristic; FIFO and LIFO accounting; Crossover; Population; Mathematical optimization; Tabu search; Computer science; Local search (optimization); Vehicle routing problem; Mathematics; Algorithm; Artificial intelligence","score_opus":0.06616750905945257,"score_gpt":0.3289781835126778,"score_spread":0.26281067445322526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089432311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0660934,0.00044961396,0.93170553,0.00059576525,0.00004585167,0.00090459525,0.000007893187,0.000111426794,0.00008591479],"genre_scores_gemma":[0.59077954,0.000011876219,0.40882218,0.00003855,0.00006605026,0.000121690435,0.000024086346,0.000029027933,0.00010701602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904466,0.00017170596,0.00015319821,0.00018456312,0.0002254515,0.00022041355],"domain_scores_gemma":[0.9984823,0.0008847149,0.000008625124,0.00018561134,0.0003241455,0.00011461012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012218426,0.00009862827,0.00012575366,0.00015918104,0.0003986232,0.00033075298,0.00011998259,0.00003941387,0.0000046149958],"category_scores_gemma":[0.00016811662,0.00007355115,0.00001347686,0.00032209448,0.00007191899,0.00014811895,0.000049052105,0.0001661062,0.0000048384773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013009079,0.00000754808,0.0008650233,0.000030148314,0.000029451356,7.82982e-7,0.00031829125,0.9935715,0.0001236224,0.00022836195,0.0005603711,0.004251888],"study_design_scores_gemma":[0.00055801065,0.000081549784,0.0009883855,0.000034760407,0.000015914557,0.0000062234217,0.000048053324,0.9976233,0.000084338775,0.000039881656,0.00042497183,0.00009460262],"about_ca_topic_score_codex":0.000082859275,"about_ca_topic_score_gemma":0.000038221737,"teacher_disagreement_score":0.5246861,"about_ca_system_score_codex":0.00007087915,"about_ca_system_score_gemma":0.000090712994,"threshold_uncertainty_score":0.31894585},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23658094,0.00045295214,0.75973594,0.0005982854,0.00016906885,0.0008378915,0.00030459443,0.000049786722,0.0012705595],"genre_scores_gemma":[0.67178744,0.000020355541,0.32451704,0.000036908645,0.0007463187,0.00011208627,0.0007845588,0.00003327294,0.0019620415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977115,0.00008500333,0.0005944082,0.000847683,0.00016295385,0.0005984852],"domain_scores_gemma":[0.9985455,0.00012066215,0.000053565444,0.0008559405,0.00034784322,0.000076462326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032943082,0.00017002795,0.00038387184,0.00032415244,0.0010588871,0.00052372686,0.00065884454,0.0001343854,0.000018577259],"category_scores_gemma":[0.0003910246,0.00020398035,0.00009538868,0.0004821882,0.00014061613,0.0011987009,0.00036937636,0.00032966843,0.00009634401],"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.00009465777,0.0002545686,0.0005344316,0.000051774878,0.000021972659,0.0000020990371,0.0005233686,0.48503417,0.00029256317,0.5030238,0.008176574,0.0019900475],"study_design_scores_gemma":[0.00048055965,0.00012466477,0.001596223,0.000012217393,0.0000037868995,0.0000033869549,0.000018772931,0.9375507,0.000057263,0.05891045,0.001034441,0.00020749617],"about_ca_topic_score_codex":0.0014913063,"about_ca_topic_score_gemma":0.00038957858,"teacher_disagreement_score":0.45251656,"about_ca_system_score_codex":0.0001724075,"about_ca_system_score_gemma":0.00024262318,"threshold_uncertainty_score":0.83180773},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493224,0.000053811076,0.8330593,0.0010856324,0.00049016916,0.0018060362,0.0000069630096,0.000092892675,0.014082772],"genre_scores_gemma":[0.98975265,0.000037897877,0.008781805,0.0005093632,0.00014372704,0.00031348565,0.000051115087,0.000015654756,0.00039427518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867624,0.000043422657,0.00026610997,0.00044112751,0.00025531906,0.00031779212],"domain_scores_gemma":[0.99899465,0.000028930996,0.000013559097,0.0002864805,0.0006511566,0.00002520764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006996691,0.00014730133,0.00013141813,0.0004829547,0.00051771617,0.00033222276,0.00030076248,0.00004295884,0.00022631326],"category_scores_gemma":[0.00003820857,0.00014656158,0.000038320344,0.00055463135,0.00022571157,0.0009450136,0.00023081625,0.00013904077,0.00014358725],"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.00025153693,0.00036987872,0.0019611772,0.0010176611,0.00023182953,0.000008361734,0.0024693864,0.0050626555,0.00014619957,0.7287704,0.0071471413,0.25256377],"study_design_scores_gemma":[0.0040207515,0.00023676066,0.08221008,0.00030850281,0.00014630136,0.000010402001,0.006901382,0.8129003,0.00040210094,0.05681232,0.0348322,0.0012188958],"about_ca_topic_score_codex":0.0009346084,"about_ca_topic_score_gemma":0.0004968836,"teacher_disagreement_score":0.84043026,"about_ca_system_score_codex":0.000054306995,"about_ca_system_score_gemma":0.00002136197,"threshold_uncertainty_score":0.5976608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06557914,0.0004059875,0.9314085,0.0016102633,0.0002479519,0.00043639145,0.00003427382,0.000028847822,0.0002486258],"genre_scores_gemma":[0.6215419,0.000010622408,0.37755874,0.00003077658,0.0000847902,0.000051089723,0.000015191413,0.0000094836605,0.0006974062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941718,0.002748713,0.0006888993,0.00054182834,0.0012687626,0.0005800097],"domain_scores_gemma":[0.9819053,0.012602226,0.00003065868,0.0007641717,0.0044928654,0.00020481495],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.039879594,0.00010616906,0.00031109323,0.0011785221,0.0009291568,0.00044488668,0.0011562237,0.000089183995,0.000100853766],"category_scores_gemma":[0.0070916475,0.00008799877,0.00013264119,0.0036125993,0.00050903397,0.00029384947,0.0003210583,0.00036937295,0.00014073655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004800273,0.00019323637,0.0008828058,0.0000056345475,0.000044599674,4.172672e-7,0.0006966123,0.5652843,0.0010560912,0.008909879,0.005769648,0.41710877],"study_design_scores_gemma":[0.00039704988,0.00015478293,0.010033529,0.000014371358,0.0000042607967,0.000002526248,0.0003638064,0.9777556,0.0040609217,0.00075428217,0.006355638,0.000103220365],"about_ca_topic_score_codex":0.0010058384,"about_ca_topic_score_gemma":0.001109309,"teacher_disagreement_score":0.55596274,"about_ca_system_score_codex":0.00009347255,"about_ca_system_score_gemma":0.0006432793,"threshold_uncertainty_score":0.98864603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.535714,0.0000720993,0.44950846,0.0023423615,0.00025294547,0.0009734762,0.0000019652834,0.000030933526,0.011103804],"genre_scores_gemma":[0.9986101,0.000017482333,0.00066082133,0.00033249936,0.00006502044,0.000086855354,0.00001625993,0.000006048387,0.00020493942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998668,0.00010093097,0.00027036277,0.00021435012,0.0005044003,0.00024196442],"domain_scores_gemma":[0.9992455,0.0000444872,0.000011645923,0.00034327374,0.00034643646,0.000008618636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017499198,0.000078460376,0.00008905997,0.0002867352,0.00026142734,0.00025064943,0.00037658424,0.000027443057,0.0000795657],"category_scores_gemma":[0.00031261935,0.00006628128,0.000028320655,0.0011217021,0.000083050414,0.0006857045,0.00012228114,0.00016531971,0.00009776569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008346792,0.000119292374,0.0004863178,0.000061238934,0.000004240262,0.0000010197098,0.00031264618,0.83772904,0.00010909054,0.15866286,0.0016633929,0.0008425049],"study_design_scores_gemma":[0.00022910215,0.000008572278,0.001770872,0.000021569565,0.0000029123305,3.3144798e-7,0.0003441564,0.99189883,0.000061155224,0.0006745743,0.004916969,0.00007095445],"about_ca_topic_score_codex":0.0014726307,"about_ca_topic_score_gemma":0.00091853016,"teacher_disagreement_score":0.46289614,"about_ca_system_score_codex":0.00003845003,"about_ca_system_score_gemma":0.00007130734,"threshold_uncertainty_score":0.27028722},"labels":[],"label_agreement":null},{"id":"W2106852598","doi":"10.1016/j.cor.2005.07.015","title":"A first multilevel cooperative algorithm for capacitated multicommodity network design","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Benchmark (surveying); Computer science; Mathematical optimization; Set (abstract data type); Network planning and design; Algorithm; Mathematics; Computer network","score_opus":0.13078813271017706,"score_gpt":0.3751517516909518,"score_spread":0.24436361898077472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106852598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097347103,0.00013637487,0.9960888,0.00047977592,0.00032172582,0.0014880825,0.000046837104,0.0003831083,0.000081837956],"genre_scores_gemma":[0.05110432,0.000040512892,0.94738543,0.000072413124,0.0005760415,0.00044994225,0.00006764007,0.000066121334,0.00023758649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775445,0.0005266124,0.0003755769,0.0003444038,0.00031552548,0.0006834227],"domain_scores_gemma":[0.99707586,0.0014810453,0.000011792241,0.00037257915,0.0008771797,0.0001815459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019167478,0.00020949473,0.00024572283,0.0002175138,0.0010928911,0.00032203906,0.00037816764,0.00013184591,0.000051141982],"category_scores_gemma":[0.00031056677,0.00022020262,0.00006118779,0.00065775844,0.00013539045,0.00032696637,0.000090477566,0.00046285053,0.000080321355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059453578,0.000050802446,0.0000038267785,0.00001302917,0.00004700305,0.0000012210146,0.0009620194,0.91235477,0.00016238059,0.00021679168,0.012880149,0.073302075],"study_design_scores_gemma":[0.0008409924,0.00007386545,0.000062965504,0.000043618358,0.0000064527417,0.0000044671247,0.00004834004,0.9918964,0.0013664837,0.000021796146,0.005397871,0.00023675065],"about_ca_topic_score_codex":0.00003012111,"about_ca_topic_score_gemma":0.00009021634,"teacher_disagreement_score":0.07954164,"about_ca_system_score_codex":0.00032252612,"about_ca_system_score_gemma":0.00010491745,"threshold_uncertainty_score":0.89796025},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11246484,0.0002841041,0.87507,0.010163425,0.0004471091,0.00081351085,0.000026202355,0.000048636648,0.00068217615],"genre_scores_gemma":[0.7578488,0.000076947945,0.23574923,0.00029565874,0.0010703214,0.00015807178,0.000036982416,0.000016402602,0.0047476143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574363,0.00093545933,0.00068283454,0.0005590826,0.0014652617,0.0006137335],"domain_scores_gemma":[0.9967444,0.0013584179,0.000038920738,0.0006595671,0.001026641,0.00017206966],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010036244,0.00012378195,0.00030611956,0.00045230796,0.0016048313,0.001703053,0.0010984025,0.00007952402,0.0004652202],"category_scores_gemma":[0.0011530888,0.00009706318,0.00012543167,0.0013790859,0.00012421462,0.0004766752,0.00027475506,0.00016785148,0.0009641738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006558792,0.00008390216,0.00023169679,0.0000025467482,0.00006211896,0.0000041635253,0.0009851928,0.52768856,0.003434308,0.0023484868,0.118190125,0.3469033],"study_design_scores_gemma":[0.0010667283,0.000261271,0.0029920621,0.000050379193,0.000023846596,0.000009598848,0.000657161,0.8545333,0.007962136,0.009325472,0.12272329,0.00039477035],"about_ca_topic_score_codex":0.00011502904,"about_ca_topic_score_gemma":0.00036392568,"teacher_disagreement_score":0.64538395,"about_ca_system_score_codex":0.00010419969,"about_ca_system_score_gemma":0.00019656631,"threshold_uncertainty_score":0.9998137},"labels":[],"label_agreement":null},{"id":"W2111991140","doi":"10.1016/j.cor.2013.07.002","title":"A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Column generation; Column (typography); Computer science; Operations research; Distribution (mathematics); Algorithm; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.11643665802848882,"score_gpt":0.3754091867212523,"score_spread":0.25897252869276344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111991140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023663653,0.000056358604,0.9748517,0.00034118196,0.00017084711,0.0006503122,0.00009873618,0.000052040676,0.000115152245],"genre_scores_gemma":[0.57218796,0.000025536934,0.4269568,0.00001906962,0.00015825381,0.00015657351,0.00041616088,0.00001892667,0.000060696744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989447,0.00012743504,0.00024587856,0.00016526692,0.00018738925,0.000329329],"domain_scores_gemma":[0.9987726,0.00030633854,0.000010361976,0.00015070091,0.00057995634,0.00018003791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060918863,0.00008704286,0.00013209703,0.0003543056,0.00036962007,0.00023916173,0.00012127922,0.00009364269,0.00002099587],"category_scores_gemma":[0.00032182407,0.000095795636,0.00002321099,0.00051619986,0.0001005939,0.000190589,0.000033805958,0.0001818367,0.000004952897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.383454e-7,0.000011517731,0.00007758757,0.000027453229,0.000024480623,8.336574e-7,0.00030121283,0.9475941,0.0016130181,0.0016637556,0.007650644,0.041034628],"study_design_scores_gemma":[0.00020099572,0.000056717283,0.00042877696,0.000018074294,0.000005613226,0.0000037742986,0.00008615418,0.99607885,0.0018658645,0.00004195159,0.0011201493,0.00009305069],"about_ca_topic_score_codex":0.006500946,"about_ca_topic_score_gemma":0.002395713,"teacher_disagreement_score":0.5485243,"about_ca_system_score_codex":0.00016671025,"about_ca_system_score_gemma":0.00013346624,"threshold_uncertainty_score":0.9827529},"labels":[],"label_agreement":null},{"id":"W2112496246","doi":"10.1016/j.cor.2005.02.033","title":"Variable neighborhood search and local branching","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":188,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Variable neighborhood search; Solver; Mathematical optimization; Integer programming; Local search (optimization); Branching (polymer chemistry); Heuristic; Variable (mathematics); Mathematics; Limit (mathematics); Set (abstract data type); Black box; Computer science; Integer (computer science); Metaheuristic; Algorithm; Artificial intelligence","score_opus":0.03926352547568592,"score_gpt":0.3419667686314819,"score_spread":0.302703243155796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112496246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024294889,0.0003222674,0.97093934,0.0005627503,0.00011249227,0.00022052397,0.0000034090326,0.00023426449,0.003310087],"genre_scores_gemma":[0.603884,0.00004327923,0.39560217,0.000051465875,0.0001886861,0.0000144190235,0.000008377452,0.000027422355,0.0001802425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984638,0.00029179626,0.00020947408,0.00024393479,0.000349728,0.00044124917],"domain_scores_gemma":[0.99909025,0.00025291616,0.0000025419754,0.00028125636,0.00021099864,0.00016205228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014188918,0.00011141747,0.00013116276,0.0002849891,0.00046172747,0.00036149178,0.00022796668,0.000079715566,0.00010050096],"category_scores_gemma":[0.000070113725,0.00011977525,0.000018613488,0.00067640434,0.00011259648,0.0003516903,0.00015774526,0.0005445659,0.00007831847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016621624,0.000016543592,0.00006827213,0.000019577552,0.0000143437555,0.0000012988284,0.00052766217,0.90391797,0.0011365509,0.0075224186,0.0005608739,0.08621283],"study_design_scores_gemma":[0.00027280013,0.000024553614,0.00024680275,0.000026963276,0.0000021619367,0.00001349618,0.00008378068,0.99600554,0.0010494713,0.000057538018,0.0020950846,0.00012179827],"about_ca_topic_score_codex":0.00004765474,"about_ca_topic_score_gemma":0.0000239383,"teacher_disagreement_score":0.57958907,"about_ca_system_score_codex":0.00014006428,"about_ca_system_score_gemma":0.0000787235,"threshold_uncertainty_score":0.4884293},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.368978,0.00012371957,0.6149744,0.0044062003,0.000096111675,0.0006998021,0.000008732874,0.0001522602,0.010560788],"genre_scores_gemma":[0.9764307,0.000013445706,0.021197299,0.00036426834,0.0005341961,0.000036562982,0.000042168376,0.000031058993,0.0013502622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.00007274946,0.00028921108,0.00034862227,0.0005106269,0.00042193616],"domain_scores_gemma":[0.998812,0.00010523926,0.000043706492,0.0004186247,0.0005929248,0.00002750959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719157,0.00014562687,0.00022265266,0.0007237641,0.00041912677,0.000253834,0.0004324358,0.000045264384,0.00010473424],"category_scores_gemma":[0.0000614744,0.0001249743,0.00006213007,0.0011320359,0.00017365206,0.001327046,0.0003331672,0.00028517013,0.000100999336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099355566,0.00023705936,0.00032926933,0.00006760364,0.00008924615,0.000013998186,0.0002966222,0.94753534,0.0011660041,0.03028008,0.0032540902,0.016631357],"study_design_scores_gemma":[0.00058586226,0.000020560987,0.000080039965,0.00009971634,0.000016999464,0.000002948387,0.00011573293,0.9916325,0.0002768061,0.000480252,0.0065213637,0.00016719748],"about_ca_topic_score_codex":0.00035068628,"about_ca_topic_score_gemma":0.00077563484,"teacher_disagreement_score":0.60745275,"about_ca_system_score_codex":0.00009816125,"about_ca_system_score_gemma":0.000045591816,"threshold_uncertainty_score":0.5096304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80311185,0.0001067625,0.18880323,0.0034995873,0.0006363708,0.0033366757,0.0000022201739,0.00020475264,0.00029854395],"genre_scores_gemma":[0.9456424,0.0000022475745,0.05089966,0.00009515723,0.0016566594,0.00045952728,0.00006707312,0.00004350546,0.0011337858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813473,0.00004922753,0.00023036584,0.0006543995,0.00040781667,0.00052343216],"domain_scores_gemma":[0.99836576,0.000074531534,0.000041084462,0.0004482547,0.001038894,0.00003147309],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020689368,0.00018318725,0.0001841286,0.0006585855,0.0012112875,0.0012365828,0.00030467237,0.000054414028,0.000009591996],"category_scores_gemma":[0.00033037426,0.00015611677,0.000028597533,0.0007790645,0.00018312279,0.0009387278,0.00030582643,0.00038382885,0.000013800189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009112435,0.0006105893,0.016900692,0.00593138,0.0003935832,0.00021577325,0.002595217,0.82043415,0.011779121,0.063859686,0.048716787,0.027651757],"study_design_scores_gemma":[0.0010856527,0.00004923093,0.0019397377,0.0001272276,0.000026526151,0.000014111394,0.004422567,0.9815158,0.00024102116,0.000018021183,0.0103129875,0.00024710185],"about_ca_topic_score_codex":0.0004386646,"about_ca_topic_score_gemma":0.00023210618,"teacher_disagreement_score":0.16108164,"about_ca_system_score_codex":0.00009001173,"about_ca_system_score_gemma":0.00008258642,"threshold_uncertainty_score":0.9998002},"labels":[],"label_agreement":null},{"id":"W2121490839","doi":"10.1016/j.cor.2005.07.002","title":"Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Column generation; Mathematical optimization; Fixed cost; Computer science; Minification; Vehicle routing problem; Scheduling (production processes); Shortest path problem; Lexicographical order; Routing (electronic design automation); Mathematics","score_opus":0.04871979780575466,"score_gpt":0.33819297534956044,"score_spread":0.2894731775438058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121490839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.382472,0.00049680506,0.61513317,0.0008554179,0.000099601515,0.00047227152,0.000005627026,0.00017758559,0.00028748618],"genre_scores_gemma":[0.8104865,0.00013179233,0.18883543,0.0000678726,0.00021008369,0.000064224,0.000054167245,0.000040796418,0.00010912305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800277,0.0003696782,0.0003881023,0.00035053928,0.00032266843,0.0005662238],"domain_scores_gemma":[0.9992831,0.00015398079,0.0000141126775,0.00024408064,0.00018274887,0.00012199139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022038885,0.00014818186,0.00017693591,0.0003330797,0.0005373975,0.00053646305,0.00019761312,0.00010135638,0.000021079402],"category_scores_gemma":[0.0001351309,0.00018090085,0.000022385211,0.0007515256,0.00004839462,0.00047244332,0.0001499491,0.00050169654,0.00002138008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016752525,0.000031218322,0.0009898772,0.000024163326,0.000011608358,0.0000016037939,0.0010424256,0.9520383,0.023592934,0.00027833637,0.00071147806,0.021276396],"study_design_scores_gemma":[0.0006826593,0.000020881324,0.00041414754,0.000081701655,0.0000025361303,0.0000029095759,0.0001566667,0.994784,0.0031336744,0.000006466854,0.000534884,0.00017946826],"about_ca_topic_score_codex":0.00008263541,"about_ca_topic_score_gemma":0.00043772534,"teacher_disagreement_score":0.4280145,"about_ca_system_score_codex":0.00036937487,"about_ca_system_score_gemma":0.00004812058,"threshold_uncertainty_score":0.73769224},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1669187,0.00003761496,0.83030343,0.0002945795,0.00007623639,0.0017788981,0.00007247441,0.000044239943,0.00047382762],"genre_scores_gemma":[0.41033643,0.000005248217,0.5891837,0.000008867426,0.00007566402,0.00010132185,0.00007091223,0.000028099052,0.00018972934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973557,0.00037360608,0.000627952,0.00044324683,0.00065468915,0.0005448332],"domain_scores_gemma":[0.9965765,0.0015735911,0.000048567323,0.00050176104,0.0012137011,0.00008587408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027731715,0.00013926525,0.00029086566,0.0005474792,0.00033987607,0.00013411324,0.00044133927,0.00010233936,0.00005167988],"category_scores_gemma":[0.0017002122,0.00014012882,0.00007192533,0.0007661267,0.00042143816,0.0003605597,0.00024739467,0.0004707499,0.0000050393564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040186202,0.0047936738,0.013250096,0.0019171725,0.00011141642,0.000059135502,0.0037316883,0.6504254,0.023822062,0.16028893,0.0032344118,0.1379642],"study_design_scores_gemma":[0.0013199133,0.000090470756,0.0006170936,0.00007606917,0.000003102676,0.0000043604987,0.00018912226,0.9867593,0.002888857,0.007842032,0.0000607158,0.00014893676],"about_ca_topic_score_codex":0.0004852961,"about_ca_topic_score_gemma":0.0008635885,"teacher_disagreement_score":0.33633396,"about_ca_system_score_codex":0.000322584,"about_ca_system_score_gemma":0.00039123563,"threshold_uncertainty_score":0.5714287},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16696748,0.00031931908,0.7518787,0.021817131,0.0006946103,0.0026265192,0.0000058925457,0.00033620093,0.055354178],"genre_scores_gemma":[0.99521995,0.000013998432,0.001565874,0.00019820065,0.0003304347,0.00013946295,0.000086368906,0.000013367729,0.0024323657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851847,0.00004008491,0.0002641203,0.00029220604,0.0005281005,0.00035703424],"domain_scores_gemma":[0.9987431,0.000047037032,0.000015975316,0.00034835475,0.0008318072,0.000013699799],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000776649,0.000115956784,0.000085283194,0.00017889863,0.0014404589,0.0010692348,0.00036357398,0.00002700628,0.000081741855],"category_scores_gemma":[0.000031406544,0.000083091654,0.000023162795,0.0011140638,0.00034557012,0.0006441808,0.00015157255,0.00016333703,0.00036909172],"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.000058984213,0.00023160997,0.0015737218,0.00018151727,0.000046042132,0.000006626674,0.00011484759,0.2623039,0.0002063688,0.6599718,0.051585775,0.023718864],"study_design_scores_gemma":[0.00050642726,0.000020666823,0.0056006503,0.00007216525,0.00000929937,0.000001359645,0.00041798325,0.8112953,0.000041831652,0.0009571755,0.18086284,0.0002143167],"about_ca_topic_score_codex":0.0021088973,"about_ca_topic_score_gemma":0.008555576,"teacher_disagreement_score":0.82825243,"about_ca_system_score_codex":0.00008179782,"about_ca_system_score_gemma":0.000069923495,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W2130798138","doi":"10.1016/j.cor.2007.10.017","title":"The capacity and distance constrained plant location problem","year":2007,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad Carlos III de Madrid","keywords":"Tabu search; Mathematical optimization; Computer science; Extension (predicate logic); Heuristic; TRIPS architecture; Operations research; Mathematics","score_opus":0.053392370844684185,"score_gpt":0.33606661152574513,"score_spread":0.28267424068106095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130798138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035657946,0.00020854172,0.96194655,0.00045442188,0.00012323697,0.00032306867,0.000005813904,0.00012697582,0.0011534494],"genre_scores_gemma":[0.83394414,0.0000768048,0.16574433,0.000016500751,0.000069498004,0.000020111338,0.000012428227,0.00001398673,0.00010217208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896604,0.00014831439,0.00020174148,0.00014405297,0.00023715271,0.00030271284],"domain_scores_gemma":[0.9988713,0.00056345394,0.0000065754866,0.00020379221,0.00026990796,0.0000849364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025068226,0.00007467981,0.00006965892,0.00009409278,0.00070636626,0.0002630581,0.00015976849,0.00004490313,0.0000033781232],"category_scores_gemma":[0.00013470024,0.00006128294,0.0000105945255,0.00047450577,0.00024226082,0.00011462606,0.000045287063,0.00027921263,0.000008017737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008107142,0.000016745636,0.00035134624,0.000045670182,0.000023404793,0.000003094967,0.0013332039,0.91214746,0.001758062,0.04010194,0.0012856887,0.042925283],"study_design_scores_gemma":[0.0001471715,0.000017974731,0.0016194447,0.000027547794,0.000001440259,0.000011660501,0.0001426035,0.9933681,0.0010161242,0.00012555564,0.0034420749,0.000080290716],"about_ca_topic_score_codex":0.000026977517,"about_ca_topic_score_gemma":0.00024770823,"teacher_disagreement_score":0.7982862,"about_ca_system_score_codex":0.00009335435,"about_ca_system_score_gemma":0.000042277607,"threshold_uncertainty_score":0.543287},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2983501,0.00007450526,0.6579814,0.0145927295,0.00067635014,0.0019212837,0.000009969146,0.0004625867,0.02593108],"genre_scores_gemma":[0.9911227,0.000015772848,0.0021027091,0.0005926077,0.0005773184,0.0002866245,0.0005987714,0.000017149609,0.004686335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833477,0.00004237023,0.00025855546,0.00036957706,0.0006857857,0.00030892706],"domain_scores_gemma":[0.99818224,0.000026517684,0.000015732667,0.00030859155,0.0014398649,0.00002704136],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050916115,0.00012994788,0.00010579219,0.00059798575,0.0017152817,0.00030668106,0.00021439425,0.000045162098,0.0006645664],"category_scores_gemma":[0.00005183173,0.00011951101,0.000035449808,0.0015946398,0.0002079298,0.0015843747,0.00011057403,0.00025325068,0.0027341428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058378657,0.0005497327,0.0023441822,0.000129543,0.00007043016,0.000011757032,0.00023342909,0.78855246,0.00019657699,0.067873195,0.13677397,0.0032063066],"study_design_scores_gemma":[0.0010382945,0.00009158258,0.05685641,0.000060594553,0.000026103533,0.000033549644,0.00072100793,0.70966595,0.000034510555,0.00043180177,0.23062809,0.00041208064],"about_ca_topic_score_codex":0.002197887,"about_ca_topic_score_gemma":0.0023008212,"teacher_disagreement_score":0.6927726,"about_ca_system_score_codex":0.00011639683,"about_ca_system_score_gemma":0.00013586573,"threshold_uncertainty_score":0.9995844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0526299,0.0000902669,0.9448197,0.000041851767,0.000030429988,0.0020378323,0.0000031912448,0.00015405042,0.00019278754],"genre_scores_gemma":[0.892656,0.000007525983,0.10609746,0.0000060004854,0.000028912336,0.0006582972,0.0002075667,0.000033145872,0.00030503926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905765,0.00004640326,0.00014224273,0.00021564585,0.00022028426,0.0003177622],"domain_scores_gemma":[0.9994072,0.00010631066,0.0000075582793,0.00017770202,0.00022380803,0.00007744772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018549025,0.00012263862,0.00011110873,0.00021893413,0.00034255316,0.00052461564,0.00014591389,0.000034354165,0.000009074733],"category_scores_gemma":[0.000013500797,0.00009352344,0.000016747268,0.00029545726,0.00006187684,0.00027785165,0.000066480825,0.000120952915,0.00000967194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075952266,0.00003698836,0.000020645568,0.000073220945,0.000035266246,4.239382e-7,0.0007605385,0.9833146,0.00012959988,0.00007874326,0.00006233299,0.015480101],"study_design_scores_gemma":[0.00039787695,0.00011726496,0.000059166694,0.000035571364,0.000007140073,0.000001538131,0.00010236489,0.9989679,0.000015217768,0.00005905634,0.000117617536,0.000119273536],"about_ca_topic_score_codex":0.0000471348,"about_ca_topic_score_gemma":0.000014410161,"teacher_disagreement_score":0.84002614,"about_ca_system_score_codex":0.00005495191,"about_ca_system_score_gemma":0.000014327748,"threshold_uncertainty_score":0.50588804},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048199602,0.00028855316,0.99236923,0.0027307584,0.00031171282,0.0007184095,0.000006481079,0.00018698572,0.0029058713],"genre_scores_gemma":[0.8265691,0.00027480768,0.17053539,0.00027735948,0.000367138,0.00015943356,0.0000653707,0.00003578822,0.0017156231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992042,0.000048302634,0.00015971097,0.00012558728,0.00018629107,0.00027591127],"domain_scores_gemma":[0.9991948,0.0002558561,0.000004055177,0.000231341,0.00025919906,0.00005473984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050936354,0.00007802176,0.00007643188,0.00011696755,0.00055922195,0.00033274482,0.0002595603,0.000041975916,0.000023336763],"category_scores_gemma":[0.000052156043,0.0000618876,0.000033442215,0.0003827683,0.00004105238,0.00008664259,0.000026135136,0.00021569648,0.000044168763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016728194,0.000013887393,0.0000028659579,0.0000147982055,0.00001275962,3.9165457e-7,0.00035376247,0.9343392,0.00026875595,0.007509176,0.03951127,0.017971436],"study_design_scores_gemma":[0.00017572845,0.00004775887,0.000097884,0.000023007391,0.0000029254315,0.000002075267,0.000039354378,0.94935423,0.00024770014,0.00030825674,0.049622986,0.00007807437],"about_ca_topic_score_codex":0.000005432589,"about_ca_topic_score_gemma":0.000016736738,"teacher_disagreement_score":0.8260871,"about_ca_system_score_codex":0.000046020865,"about_ca_system_score_gemma":0.000038339138,"threshold_uncertainty_score":0.43011394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6819102,0.000401381,0.1920426,0.022728933,0.0019615833,0.0056907265,0.0000075928965,0.00053422805,0.09472274],"genre_scores_gemma":[0.983996,0.000013638724,0.001034094,0.0051473994,0.0009039338,0.00046847394,0.00009274171,0.000040283623,0.0083034625],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746686,0.00008684226,0.00036867333,0.0005056746,0.000884745,0.0006871779],"domain_scores_gemma":[0.9986918,0.000073495896,0.000040570976,0.00059453014,0.0005385106,0.00006111087],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010235929,0.00022434923,0.00021179144,0.0008057051,0.00083672703,0.0015371217,0.0007079487,0.00007090345,0.0021748159],"category_scores_gemma":[0.00009419728,0.00021528213,0.000099645375,0.0006383473,0.00018639107,0.0017452035,0.0007374153,0.0004061771,0.004251415],"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.00002054155,0.0005080367,0.00027550073,0.00013480827,0.00013259477,0.000023320217,0.00038267023,0.31734273,0.00095650763,0.14792724,0.5240138,0.008282209],"study_design_scores_gemma":[0.00076312124,0.000023185154,0.001435412,0.00003685818,0.000013978267,6.4729704e-7,0.00086503744,0.9543465,0.000018063552,0.00229598,0.039949607,0.0002516432],"about_ca_topic_score_codex":0.0014624026,"about_ca_topic_score_gemma":0.00027283403,"teacher_disagreement_score":0.6370037,"about_ca_system_score_codex":0.00023293513,"about_ca_system_score_gemma":0.00007253569,"threshold_uncertainty_score":0.9994994},"labels":[],"label_agreement":null},{"id":"W2146004814","doi":"10.1016/j.cor.2012.04.007","title":"An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":506,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; HEC Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Vehicle routing problem; Heuristic; Computer science; Context (archaeology); Routing (electronic design automation); Mathematical optimization; Scheme (mathematics); Local search (optimization); Operations research; Mathematics; Algorithm; Artificial intelligence; Computer network","score_opus":0.13790653681425669,"score_gpt":0.4106109157336956,"score_spread":0.27270437891943894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146004814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08073785,0.00015381692,0.9171859,0.00008696344,0.00025560235,0.0009390454,0.000029678195,0.00022368642,0.00038746698],"genre_scores_gemma":[0.78703755,0.000010193525,0.21239725,0.00002266471,0.0002913105,0.000096605654,0.000060596198,0.000058625796,0.00002520809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967758,0.0007623157,0.0004546292,0.0003579623,0.00045302548,0.0011962571],"domain_scores_gemma":[0.9979612,0.00081024854,0.000016761309,0.00044679316,0.00050099567,0.00026400253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005336909,0.00020043457,0.00025677393,0.00045125853,0.0006191744,0.00033291677,0.00040455585,0.00013759093,0.000019724388],"category_scores_gemma":[0.00049320364,0.0002246528,0.00004742201,0.0010785974,0.000086630054,0.0005865743,0.0001635103,0.00082373386,0.000019648438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012616186,0.00018609955,0.004961028,0.000048186397,0.000018188266,0.0000018044527,0.0027916282,0.9776144,0.0018650909,0.006767613,0.0000601808,0.005673167],"study_design_scores_gemma":[0.000775975,0.00012590521,0.0025552036,0.00007293684,0.0000059722556,0.000003625648,0.0005354655,0.9942925,0.0012317819,0.00011546076,0.000048497164,0.00023669832],"about_ca_topic_score_codex":0.00013758538,"about_ca_topic_score_gemma":0.00012585522,"teacher_disagreement_score":0.7062997,"about_ca_system_score_codex":0.00046210422,"about_ca_system_score_gemma":0.00012616781,"threshold_uncertainty_score":0.91610754},"labels":[],"label_agreement":null},{"id":"W2147424049","doi":"10.1016/j.cor.2009.02.017","title":"An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":196,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Pickup; Computer science; Ant colony optimization algorithms; Benchmark (surveying); Mathematical optimization; Ant colony; Routing (electronic design automation); Backhaul (telecommunications); Combinatorial optimization; Algorithm; Artificial intelligence; Mathematics; Computer network","score_opus":0.03016327053796509,"score_gpt":0.3280864310040777,"score_spread":0.2979231604661126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147424049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38678613,0.00008303883,0.61166036,0.00014672913,0.000047140806,0.0007726507,0.000007956422,0.00033507138,0.00016091081],"genre_scores_gemma":[0.700743,0.000009904606,0.29901463,0.000026059199,0.000084950414,0.000040626597,0.000017073406,0.000026133575,0.000037604215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850005,0.00022608814,0.00025079102,0.00031696385,0.00026932242,0.00043676043],"domain_scores_gemma":[0.9985937,0.00045672795,0.000012383464,0.00029147678,0.0004893797,0.00015632945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101688,0.00014470247,0.00018555374,0.00019252807,0.0006185542,0.00042744438,0.00022452112,0.00007948201,0.0000018456981],"category_scores_gemma":[0.0000664725,0.00013702725,0.000018914692,0.00043604508,0.00006120745,0.00027610915,0.00003587833,0.0002537264,0.000004443996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022196982,0.0000316518,0.0000872303,0.000064004016,0.000017344342,0.000011874316,0.00080044713,0.971566,0.0064837458,0.0011931524,0.00009674091,0.019625606],"study_design_scores_gemma":[0.0005419215,0.000493776,0.00019245679,0.00010951341,0.0000077405775,0.000028398506,0.00035572154,0.9966338,0.0013276759,0.000008067077,0.00013207633,0.00016885022],"about_ca_topic_score_codex":0.000033539178,"about_ca_topic_score_gemma":0.000033660945,"teacher_disagreement_score":0.31395686,"about_ca_system_score_codex":0.00019577779,"about_ca_system_score_gemma":0.00007839728,"threshold_uncertainty_score":0.5587809},"labels":[],"label_agreement":null},{"id":"W2154025454","doi":"10.1016/j.cor.2011.12.016","title":"The Canadian minimum duration truck driver scheduling problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Truck; Duration (music); Integer programming; Schedule; Operations research; Scheduling (production processes); Computer science; Dynamic programming; Service (business); Transport engineering; Linear programming; Operations management; Automotive engineering; Business; Engineering; Marketing; Algorithm; Operating system","score_opus":0.05594305595633055,"score_gpt":0.3457641357038667,"score_spread":0.2898210797475362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154025454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12560235,0.0007914624,0.856159,0.0040765502,0.0016012557,0.0012924329,0.000008643598,0.0004260653,0.010042245],"genre_scores_gemma":[0.74718285,0.000040128045,0.25197327,0.00003743227,0.00030782775,0.00006231192,0.00001937802,0.000030077983,0.00034670418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982336,0.00034428053,0.00025457906,0.0001402308,0.00034842215,0.00067886803],"domain_scores_gemma":[0.998775,0.00026858755,0.000007866835,0.0003162717,0.00033795976,0.00029432352],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021691234,0.000105328814,0.00008480488,0.00025448133,0.0018681872,0.0005902494,0.00030607366,0.00008934228,0.000033946126],"category_scores_gemma":[0.0001769546,0.00009102938,0.000030197381,0.000657376,0.000101584075,0.0003987558,0.000059469876,0.00043639587,0.00017411781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011507876,0.000009195864,0.00087223726,0.000009954778,0.00002211135,7.926105e-7,0.0012623792,0.9773634,0.0008108366,0.006608634,0.002643331,0.010395944],"study_design_scores_gemma":[0.00011743287,0.0000108424965,0.0017102339,0.00001509592,0.000002795703,0.0000056915324,0.0001276333,0.9856172,0.00073201745,0.000034981855,0.011510778,0.00011526775],"about_ca_topic_score_codex":0.0024355473,"about_ca_topic_score_gemma":0.024414029,"teacher_disagreement_score":0.62158054,"about_ca_system_score_codex":0.00043171033,"about_ca_system_score_gemma":0.00022865811,"threshold_uncertainty_score":0.99943125},"labels":[],"label_agreement":null},{"id":"W2155293443","doi":"10.1016/j.cor.2013.08.010","title":"A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":160,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Benchmark (surveying); Vehicle routing problem; Heuristic; Computer science; Mathematical optimization; Variable (mathematics); Variable neighborhood search; Ant colony optimization algorithms; Algorithm; Routing (electronic design automation); Metaheuristic; Mathematics","score_opus":0.030289850259653747,"score_gpt":0.29436816292635276,"score_spread":0.264078312666699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155293443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021594202,0.000095097676,0.9735874,0.000743091,0.00009516264,0.0027020627,0.000020799393,0.00031745073,0.00084471615],"genre_scores_gemma":[0.6447034,0.000009417459,0.35353887,0.00005072931,0.00018760264,0.00073053024,0.000040485542,0.00008038732,0.00065857166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760723,0.0003610522,0.00033992718,0.00037629798,0.0005121226,0.0008033537],"domain_scores_gemma":[0.99622273,0.002112241,0.000014563311,0.0005772913,0.00090787,0.00016529881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018768935,0.000200679,0.000216173,0.00019633216,0.0011522509,0.00086004985,0.00059090625,0.00006329152,0.00016167352],"category_scores_gemma":[0.00030855375,0.00015244179,0.00004598447,0.0007970293,0.0001338072,0.00039086898,0.00018349949,0.00057941244,0.00023121577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009341153,0.00004054322,0.00024629635,0.000045480698,0.0000675521,0.0000013859293,0.0004798072,0.98435336,0.003224608,0.0007821207,0.0028809486,0.007868571],"study_design_scores_gemma":[0.000763701,0.000113130845,0.00039870807,0.00006050945,0.000010978401,0.000012629728,0.000118584605,0.9964517,0.001259858,0.0000786027,0.00053601415,0.000195627],"about_ca_topic_score_codex":0.00024244763,"about_ca_topic_score_gemma":0.000011672019,"teacher_disagreement_score":0.6231092,"about_ca_system_score_codex":0.00016665409,"about_ca_system_score_gemma":0.00019226017,"threshold_uncertainty_score":0.88622993},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005367372,0.00016724378,0.98378134,0.00023835307,0.00016673024,0.00083404756,0.0000037819427,0.00028903288,0.009152093],"genre_scores_gemma":[0.66567975,0.000039703114,0.33296493,0.000043659245,0.00016330087,0.0002586614,0.00044352163,0.00004930244,0.00035717702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854296,0.00018101661,0.0002960359,0.0002698417,0.0003246625,0.00038545727],"domain_scores_gemma":[0.99940956,0.00003900394,0.0000072525063,0.00027383995,0.00019147858,0.00007883886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064087764,0.00013291923,0.00013315461,0.00044528052,0.00019347583,0.0004190131,0.00020874963,0.00009200299,0.00006352409],"category_scores_gemma":[0.000016878763,0.00013366257,0.000029419836,0.00087516266,0.000048373633,0.000450545,0.00005046658,0.00032345013,0.000020587191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002846099,0.00016314157,0.00020881888,0.00001950139,0.000007718904,0.0000023982946,0.00045034147,0.994146,0.000104398576,0.0012265182,0.0010511082,0.0026172139],"study_design_scores_gemma":[0.00036510493,0.00004414586,0.00028056337,0.000024570852,0.0000018245144,0.000003432536,0.00008135223,0.9948902,0.00006556787,0.000029453158,0.0040661213,0.00014766639],"about_ca_topic_score_codex":0.00023784219,"about_ca_topic_score_gemma":0.00025271604,"teacher_disagreement_score":0.66031235,"about_ca_system_score_codex":0.00018915925,"about_ca_system_score_gemma":0.000046630663,"threshold_uncertainty_score":0.54506016},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875684,0.0009937603,0.117614575,0.0037062683,0.00032377013,0.00077190605,0.0000025976615,0.00007719054,0.0008259094],"genre_scores_gemma":[0.9549091,0.000020366466,0.044266157,0.00012411393,0.000045924386,0.0001413558,0.0000065580775,0.000014238286,0.00047220284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954668,0.0017741746,0.00048855064,0.00052146666,0.0011615602,0.0005873989],"domain_scores_gemma":[0.99373335,0.0043519265,0.000043381697,0.00068551075,0.0010038433,0.00018202071],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008376407,0.0001380201,0.0001841961,0.0004616318,0.0027045642,0.0038953803,0.00078167144,0.00006492172,0.0001449263],"category_scores_gemma":[0.0013300941,0.00008704107,0.000066895176,0.0013971925,0.0004975916,0.00051171536,0.00047206992,0.00061061996,0.00031497143],"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.000025365132,0.0002859871,0.0004979159,0.000011715023,0.000120236116,0.00001435339,0.02018215,0.27483276,0.00210488,0.23202965,0.0018034799,0.46809152],"study_design_scores_gemma":[0.00022192163,0.0001374772,0.000643906,0.000051645624,0.0000069236785,0.000020902658,0.021265926,0.95625997,0.000062053274,0.02024423,0.0009274565,0.00015759759],"about_ca_topic_score_codex":0.00041896067,"about_ca_topic_score_gemma":0.00012574422,"teacher_disagreement_score":0.6814272,"about_ca_system_score_codex":0.00006185122,"about_ca_system_score_gemma":0.00020220655,"threshold_uncertainty_score":0.9985938},"labels":[],"label_agreement":null},{"id":"W2165941447","doi":"10.1016/j.cor.2012.04.003","title":"Lower and upper bounds for the two-echelon capacitated location-routing problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":166,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Heuristics; Mathematical optimization; Computer science; Vehicle routing problem; Heuristic; Upper and lower bounds; Branch and bound; Routing (electronic design automation); Set (abstract data type); Neighbourhood (mathematics); Mathematics","score_opus":0.07168323218806766,"score_gpt":0.37346540804947786,"score_spread":0.3017821758614102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165941447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037014905,0.0006217326,0.9595526,0.00083977036,0.00040914887,0.0008115924,0.0000050327794,0.0001765969,0.00056864694],"genre_scores_gemma":[0.7477053,0.000031932108,0.25148597,0.000051660914,0.00024467648,0.00017616787,0.000017065431,0.00003611097,0.00025114484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986535,0.00020277876,0.0002312925,0.00017325298,0.00023975475,0.00049946614],"domain_scores_gemma":[0.99825156,0.0008532175,0.000009524396,0.00029229518,0.00048241278,0.000110976034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025088275,0.00011885974,0.00010920168,0.00015840265,0.0008930481,0.00037003367,0.00020991097,0.00006287257,0.0000188641],"category_scores_gemma":[0.000265487,0.000097911136,0.000028051221,0.00064669154,0.000129513,0.0003459399,0.00008323182,0.00031487414,0.00002141965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004798086,0.000030426268,0.00068183226,0.0000453085,0.00004811453,1.7748808e-7,0.0030479461,0.9700231,0.0015181983,0.006837207,0.0021370247,0.015625866],"study_design_scores_gemma":[0.00029496124,0.000024165249,0.00083288294,0.000031881682,0.0000081854205,0.0000066593,0.00028265122,0.99464345,0.00065093493,0.00004342612,0.003058378,0.0001224509],"about_ca_topic_score_codex":0.000050361898,"about_ca_topic_score_gemma":0.000019104933,"teacher_disagreement_score":0.7106904,"about_ca_system_score_codex":0.00011884877,"about_ca_system_score_gemma":0.000058019235,"threshold_uncertainty_score":0.68686944},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033998907,0.0011072805,0.9602224,0.0031082304,0.00015022268,0.0008618025,0.000009526401,0.000023227505,0.0005183953],"genre_scores_gemma":[0.8491857,0.000004688611,0.15042707,0.000018478268,0.000038275903,0.0001108083,0.000003164417,0.0000054049024,0.00020642928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997465,0.00030457947,0.0005028369,0.00033122022,0.0010649102,0.00033142304],"domain_scores_gemma":[0.9938935,0.0030086131,0.000042539952,0.0004386151,0.0024695382,0.00014719163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009320334,0.000079943755,0.00020633504,0.00032886467,0.0007578011,0.0006626508,0.00064990413,0.000047723202,0.0000060862653],"category_scores_gemma":[0.0027125506,0.0000482766,0.00005869566,0.0010656412,0.000699233,0.00023262842,0.00023879726,0.00024877596,0.000014277092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024261506,0.00023734581,0.00077205396,0.000008796561,0.000023928249,3.6061178e-7,0.009296818,0.6928493,0.00010440865,0.14704007,0.0066969236,0.14294575],"study_design_scores_gemma":[0.0002800417,0.00017976845,0.000059260266,0.000018817234,0.000007091282,0.000005110079,0.006485306,0.9775959,0.00011446128,0.0120737525,0.0031222468,0.000058224552],"about_ca_topic_score_codex":0.00017008901,"about_ca_topic_score_gemma":0.00011003453,"teacher_disagreement_score":0.8151868,"about_ca_system_score_codex":0.00003535118,"about_ca_system_score_gemma":0.00048752033,"threshold_uncertainty_score":0.6389957},"labels":[],"label_agreement":null},{"id":"W2204163060","doi":"10.1016/j.cor.2015.12.013","title":"The Steiner traveling salesman problem with online advanced edge blockages","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Zhejiang Sci-Tech University; National Natural Science Foundation of China; China Postdoctoral Science Foundation; Alberta Innovates - Technology Futures; Genome Canada; Southern Taiwan Science Park; Georgia Southern University","keywords":"Travelling salesman problem; Enhanced Data Rates for GSM Evolution; Computer science; Competitive analysis; Mathematical optimization; Upper and lower bounds; Online algorithm; Service (business); Steiner tree problem; Mathematics; Algorithm; Telecommunications; Economics","score_opus":0.08018762853346349,"score_gpt":0.36395403354220485,"score_spread":0.28376640500874134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204163060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18028516,0.00062985055,0.8139282,0.0018298414,0.00028080202,0.00079569384,0.000009631862,0.00045732156,0.0017835394],"genre_scores_gemma":[0.4058548,0.00009906216,0.59246916,0.000030608557,0.00022831834,0.00007999619,0.000043530636,0.00006520211,0.0011293023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998322,0.00030636677,0.00024731297,0.00022483805,0.000473284,0.00042617918],"domain_scores_gemma":[0.99843735,0.0002953116,0.000009674085,0.00041524586,0.00067006645,0.00017237867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013619711,0.00013751978,0.00013251654,0.00012514132,0.0005465888,0.00033987864,0.00040429272,0.000053532498,0.000004326868],"category_scores_gemma":[0.00012664,0.000097494034,0.000022678283,0.0007371753,0.00013610942,0.00018744727,0.00010160283,0.00047408824,0.000026078143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008792156,0.000024788424,0.00006987746,0.000011466624,0.000024282139,0.0000037622062,0.00075041543,0.9718061,0.0006272318,0.00052441924,0.0012831369,0.024865735],"study_design_scores_gemma":[0.00055032637,0.00010711702,0.00020254265,0.00005221805,0.0000041543262,0.000011377315,0.0005279723,0.9908947,0.0007347427,0.000032651737,0.0067385626,0.00014367171],"about_ca_topic_score_codex":0.0000152135535,"about_ca_topic_score_gemma":0.00017237685,"teacher_disagreement_score":0.22556964,"about_ca_system_score_codex":0.00013414188,"about_ca_system_score_gemma":0.00016132633,"threshold_uncertainty_score":0.42039743},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03669254,0.0001318655,0.95484614,0.0045342324,0.00052513904,0.0018974915,0.000032300486,0.00008061951,0.0012596948],"genre_scores_gemma":[0.96063757,0.000002089944,0.034929235,0.00007072111,0.00038276133,0.00054902956,0.000026043355,0.000015810527,0.0033867545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957915,0.00080108806,0.00060093,0.00081762875,0.0015264512,0.00046241682],"domain_scores_gemma":[0.9939736,0.0015032778,0.000047338945,0.0010438669,0.003129156,0.00030276968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015165231,0.00012963734,0.00021165771,0.0004316725,0.0012779643,0.0007181834,0.0009871601,0.000050531275,0.00007298104],"category_scores_gemma":[0.0051414296,0.00010117214,0.00008050052,0.001920577,0.00036777122,0.000160328,0.0003272159,0.00029371394,0.00059004006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000513728,0.0006038648,0.00017517591,0.000017825854,0.000022746892,0.000001953334,0.0034601488,0.7133077,0.0005134034,0.03411183,0.06137028,0.1863637],"study_design_scores_gemma":[0.00035319416,0.00011007565,0.00027886746,0.000012015321,0.000003713499,0.000010624501,0.00081908325,0.9083335,0.00049655413,0.03214528,0.05730733,0.00012976746],"about_ca_topic_score_codex":0.000045528242,"about_ca_topic_score_gemma":0.000021423335,"teacher_disagreement_score":0.923945,"about_ca_system_score_codex":0.0001246917,"about_ca_system_score_gemma":0.00045430844,"threshold_uncertainty_score":0.98291975},"labels":[],"label_agreement":null},{"id":"W2233419640","doi":"10.1016/j.cor.2015.06.001","title":"Time-dependent routing problems: A review","year":2015,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":244,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tree traversal; Arc routing; Computer science; Time horizon; Routing (electronic design automation); Graph traversal; Arc (geometry); Point (geometry); Graph; Vehicle routing problem; Point of interest; Field (mathematics); Operations research; Node (physics); Mathematical optimization; Algorithm; Artificial intelligence; Theoretical computer science; Computer network; Mathematics","score_opus":0.1917023661751183,"score_gpt":0.44913487507889294,"score_spread":0.25743250890377467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233419640","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.2169e-8,0.916354,0.07774267,0.00006758,0.00032701247,0.0025104606,0.000028985129,0.00054730946,0.0024218755],"genre_scores_gemma":[2.6264004e-7,0.9533417,0.043614347,0.000031618772,0.00033537022,0.0005362658,0.00030414012,0.0001906635,0.0016456152],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944676,0.0020362192,0.0011089884,0.0006078926,0.0010269642,0.00075233955],"domain_scores_gemma":[0.9972813,0.00046234083,0.000050848048,0.0010380136,0.0008611045,0.0003063548],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0070578116,0.00048164555,0.001596091,0.0006263035,0.00035077563,0.00041390458,0.0010691246,0.0003117438,0.00017483174],"category_scores_gemma":[0.0005357014,0.0004447872,0.0002595306,0.0019144777,0.000110472305,0.00022424212,0.0004819832,0.0016004952,0.0021039064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4457152e-7,0.00001969172,3.5315185e-8,0.022853894,0.00009426305,0.000008361607,0.00009095002,0.21891548,3.479218e-7,0.00004302849,0.023781953,0.73419183],"study_design_scores_gemma":[0.00007107875,0.00002023852,1.2010001e-8,0.03641974,0.00008586357,0.000043348184,0.0000042396396,0.3131282,2.6608095e-7,0.0000028058446,0.6499253,0.00029890286],"about_ca_topic_score_codex":0.000011449817,"about_ca_topic_score_gemma":0.0000043788614,"teacher_disagreement_score":0.7338929,"about_ca_system_score_codex":0.00086091243,"about_ca_system_score_gemma":0.0007726791,"threshold_uncertainty_score":0.9998004},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082646154,0.000033377055,0.9044006,0.01123434,0.000099390025,0.0013411522,0.000023375826,0.000059714366,0.00016189131],"genre_scores_gemma":[0.99260736,0.000016458644,0.005994407,0.0005363412,0.0002723084,0.00031358693,0.000042051157,0.0000067840206,0.00021071419],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870783,0.000054272085,0.00020850856,0.0003656993,0.00038077924,0.0002829347],"domain_scores_gemma":[0.99868923,0.000097688186,0.000015939746,0.0002869113,0.00088769867,0.000022552891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397401,0.0001225745,0.00009919029,0.00013025122,0.0009805915,0.000430803,0.00019467775,0.00003661198,0.00003829029],"category_scores_gemma":[0.00011083737,0.00007027257,0.000026220963,0.0005866681,0.00017140996,0.00055904186,0.00014012717,0.00007705133,0.00007038566],"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.00020751343,0.00039277747,0.0020960385,0.00036636254,0.00013724128,0.00000207501,0.0003665154,0.14308058,0.00016526644,0.058941644,0.008870002,0.785374],"study_design_scores_gemma":[0.00085496414,0.00010175858,0.0079443455,0.00009761493,0.000020049178,0.0000017292497,0.00021571036,0.98524666,0.000027703545,0.00056065066,0.004780856,0.00014793847],"about_ca_topic_score_codex":0.00094343367,"about_ca_topic_score_gemma":0.0025455796,"teacher_disagreement_score":0.90996116,"about_ca_system_score_codex":0.00010807023,"about_ca_system_score_gemma":0.000037983442,"threshold_uncertainty_score":0.75420165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2587544,0.018319275,0.62718093,0.043996386,0.0006861432,0.0021010076,0.000012134728,0.00025547398,0.048694216],"genre_scores_gemma":[0.9961459,0.0018432847,0.0008934099,0.00009021226,0.00014596114,0.0000692131,0.00006074225,0.000003986252,0.0007472711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708337,0.0012952276,0.00024280392,0.0002890803,0.0007866695,0.0003028298],"domain_scores_gemma":[0.9977871,0.000233132,0.000013728172,0.0002942986,0.0014791357,0.00019257443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004548997,0.000060302664,0.00014287894,0.0009216418,0.0006972801,0.0002650858,0.00034654822,0.000057971116,0.00022197964],"category_scores_gemma":[0.0009122412,0.00006221418,0.000046214318,0.006968229,0.00031774762,0.00046263952,0.0000484757,0.00020801848,0.00014501004],"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.000009306796,0.00020466093,0.0080655115,0.000004523807,0.000049373015,0.0000021579272,0.019083329,0.7585175,0.0000035507164,0.013452992,0.0010451062,0.19956198],"study_design_scores_gemma":[0.00040111187,0.000073671596,0.00646119,0.000023287548,0.000052295392,1.2514849e-7,0.020741515,0.6111202,0.000024574212,0.0015499662,0.35933027,0.00022176065],"about_ca_topic_score_codex":0.009207144,"about_ca_topic_score_gemma":0.29273963,"teacher_disagreement_score":0.73739153,"about_ca_system_score_codex":0.00054556516,"about_ca_system_score_gemma":0.0010114287,"threshold_uncertainty_score":0.9973906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8173127,0.00029880833,0.07943766,0.04751296,0.00044313644,0.0054685506,0.000014927134,0.00058797287,0.04892326],"genre_scores_gemma":[0.99138874,0.000020659496,0.0059893555,0.0009933169,0.0003075481,0.00020521396,0.000014609098,0.000028893883,0.0010516915],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805635,0.00006710283,0.00030343942,0.0005284805,0.0005544855,0.0004901393],"domain_scores_gemma":[0.99913096,0.00013115941,0.000037507183,0.00039174984,0.0002575141,0.000051125146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011533079,0.0001782104,0.00018374655,0.0004458595,0.00063819706,0.00077002286,0.00022149952,0.000040662933,0.0002657361],"category_scores_gemma":[0.00010783369,0.00012046213,0.00003401102,0.00027533196,0.00048647996,0.00061927934,0.00057197997,0.00016355579,0.00011974643],"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.0005080128,0.0011946618,0.05032782,0.0011770645,0.0006979189,0.0005308229,0.0038369284,0.0066529755,0.0138153415,0.21163926,0.16879442,0.5408248],"study_design_scores_gemma":[0.009101436,0.00038553422,0.0116496645,0.0017888652,0.000060469025,0.000050938972,0.0053932406,0.08623308,0.0022815904,0.0018778229,0.87987226,0.0013050914],"about_ca_topic_score_codex":0.00019619329,"about_ca_topic_score_gemma":0.0002965777,"teacher_disagreement_score":0.71107787,"about_ca_system_score_codex":0.00012118101,"about_ca_system_score_gemma":0.000054267635,"threshold_uncertainty_score":0.7425348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044657893,0.00031279607,0.94941646,0.0030032129,0.0002637466,0.00086455385,0.0000054068855,0.00038401058,0.001091926],"genre_scores_gemma":[0.49829972,0.00017313655,0.49885106,0.000057252884,0.00024492826,0.00034740235,0.000018040255,0.000067247645,0.0019412366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985693,0.00014823476,0.000218124,0.00021249783,0.00038944097,0.000462368],"domain_scores_gemma":[0.99895734,0.00024259767,0.000008059668,0.0003288726,0.00033618527,0.00012695795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006372488,0.00012758568,0.00010920728,0.00012601461,0.00086468505,0.00069453655,0.00029420556,0.000049611048,0.000053679905],"category_scores_gemma":[0.000051496223,0.000068640686,0.00003056137,0.000404654,0.0004345155,0.00018342059,0.000048964383,0.00021093497,0.00010132774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033965385,0.0000735225,0.0002577557,0.000038063157,0.00019688018,0.000017444709,0.0014633717,0.5146523,0.0014825575,0.01569762,0.0039595254,0.46212697],"study_design_scores_gemma":[0.0011875414,0.00013922085,0.00012320836,0.00017076323,0.00000832077,0.000034639615,0.00039695407,0.9848306,0.0012818531,0.00012581333,0.011412699,0.00028839087],"about_ca_topic_score_codex":0.00001503523,"about_ca_topic_score_gemma":0.00008861512,"teacher_disagreement_score":0.47017828,"about_ca_system_score_codex":0.00010197805,"about_ca_system_score_gemma":0.00013571129,"threshold_uncertainty_score":0.66974324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132529475,0.00011900729,0.98467225,0.00081338227,0.00024347108,0.0004563302,0.000023676097,0.00029475792,0.00012419424],"genre_scores_gemma":[0.44678542,0.00001400285,0.5525792,0.000017829389,0.000115657385,0.00018513919,0.00006203312,0.000025867728,0.00021481572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984047,0.00009321433,0.0003243129,0.00033183245,0.00041378103,0.00043218862],"domain_scores_gemma":[0.99820906,0.00046680382,0.000010136603,0.00027405232,0.00088019896,0.00015975369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072378304,0.00014850484,0.00021180797,0.0007972874,0.0003874926,0.00033129673,0.00030271898,0.00009061415,0.000040106923],"category_scores_gemma":[0.00012506382,0.00012007695,0.0001426622,0.001388751,0.00010088693,0.00032451074,0.000069625836,0.00018173743,0.000040366904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061337782,0.000029841545,0.000050994622,0.000012403669,0.00026236943,9.689685e-7,0.00025394486,0.96940184,0.00006396375,0.006348775,0.00035827217,0.023210485],"study_design_scores_gemma":[0.0004904989,0.000036627906,0.000048577167,0.000032728658,0.00003484332,0.0000018017008,0.00011689558,0.9981953,0.000114830014,0.00044497242,0.0003134753,0.00016947572],"about_ca_topic_score_codex":0.000010143911,"about_ca_topic_score_gemma":0.00003668995,"teacher_disagreement_score":0.43353248,"about_ca_system_score_codex":0.00014986702,"about_ca_system_score_gemma":0.000100557954,"threshold_uncertainty_score":0.48965958},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0263043,0.00010579707,0.9688618,0.0035273985,0.00010503632,0.00066703185,0.000022460268,0.00004606657,0.00036006488],"genre_scores_gemma":[0.9507518,0.00007575307,0.0486354,0.000058144287,0.00015951217,0.00005620828,0.000014202257,0.000008773055,0.00024023713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980047,0.001014637,0.0001770087,0.00020475306,0.00032434257,0.00027456917],"domain_scores_gemma":[0.99818945,0.000752422,0.000023817372,0.00017667635,0.0007736682,0.00008399197],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013559016,0.000075442615,0.000110012414,0.00008285435,0.0016734486,0.00009672547,0.00021415402,0.000053933032,0.00013924767],"category_scores_gemma":[0.000057220943,0.00004487866,0.000031240546,0.00064615795,0.0008303866,0.00027617847,0.000010287277,0.00014304092,0.000011724936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008283259,0.00008991846,0.0002988557,0.0000046945884,0.000046617053,0.00006521194,0.026555164,0.9165012,0.0001451416,0.048074856,0.0008949297,0.0072405343],"study_design_scores_gemma":[0.010651329,0.002467958,0.022320358,0.0011520002,0.00013610125,0.00027448943,0.07152681,0.8712895,0.0021607392,0.00088761933,0.015807148,0.001325938],"about_ca_topic_score_codex":0.0013992565,"about_ca_topic_score_gemma":0.0041360687,"teacher_disagreement_score":0.9244475,"about_ca_system_score_codex":0.000055225402,"about_ca_system_score_gemma":0.0003813931,"threshold_uncertainty_score":0.9996262},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013318134,0.0012871411,0.98027855,0.0036293091,0.00016223278,0.00074134936,0.000009372966,0.00036743676,0.00020647391],"genre_scores_gemma":[0.643599,0.00068674644,0.35428122,0.00004912641,0.0002630376,0.00058379694,0.0000041989615,0.00004993333,0.0004829769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880016,0.000038750673,0.0001906958,0.00025112898,0.00022223088,0.00049701],"domain_scores_gemma":[0.9981001,0.0013238691,0.0000057657085,0.00034069072,0.00016308487,0.00006646681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003657401,0.00012854207,0.00013958637,0.00012887646,0.0004532283,0.00017368377,0.00040800316,0.000081552316,0.000008207037],"category_scores_gemma":[0.00012980076,0.00007743792,0.000038102746,0.00034728876,0.00031431433,0.0002716828,0.00019132913,0.00024019113,0.00002605547],"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.0000051828124,0.000012606881,0.00002398688,0.00002106632,0.000044019427,0.0000012565039,0.00016524807,0.029097067,0.003715091,0.002925147,0.0028148326,0.9611745],"study_design_scores_gemma":[0.00050440803,0.00010757209,0.0002407032,0.00010182909,0.0000072617063,0.0000057976804,0.00006935362,0.9835768,0.0020664707,0.0022246498,0.010938048,0.00015711739],"about_ca_topic_score_codex":0.0000056307863,"about_ca_topic_score_gemma":0.000053020372,"teacher_disagreement_score":0.9610174,"about_ca_system_score_codex":0.00006924109,"about_ca_system_score_gemma":0.000025468851,"threshold_uncertainty_score":0.34859115},"labels":[],"label_agreement":null},{"id":"W2567598518","doi":"10.1016/j.cor.2019.05.008","title":"An RLT approach for solving the binary-constrained mixed linear complementarity problem","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mixed complementarity problem; Complementarity theory; Linear complementarity problem; Complementarity (molecular biology); Linear programming; Mathematical optimization; Binary number; Mathematics; Generalized linear mixed model; Applied mathematics; Computer science; Nonlinear system","score_opus":0.08351850770169487,"score_gpt":0.37789104834462384,"score_spread":0.29437254064292895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567598518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08680813,0.000033321754,0.9097365,0.00038740507,0.00020690724,0.001891786,0.000028152584,0.00024106592,0.00066673895],"genre_scores_gemma":[0.44271785,0.000004313892,0.55666906,0.000036527603,0.00011567951,0.00015353461,0.00018725515,0.00003292727,0.000082836654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812627,0.00036364954,0.00031799366,0.0003378544,0.0003506836,0.00050356856],"domain_scores_gemma":[0.9984988,0.0004037025,0.000012779677,0.00058288494,0.00039393382,0.00010791245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026299302,0.00015291983,0.0001827027,0.00019741923,0.00071433134,0.00035614174,0.0006148443,0.000074383024,0.00006509347],"category_scores_gemma":[0.000055308454,0.00013011452,0.000059903687,0.0005571485,0.00011599878,0.00028470522,0.00012843969,0.00044123322,0.000026235968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000620336,0.00006332823,0.00035101402,0.000067580244,0.000035101544,2.9763768e-7,0.00065227953,0.9873452,0.0055166516,0.0021661848,0.0011805982,0.0026155575],"study_design_scores_gemma":[0.0005341894,0.00012749157,0.0003369837,0.000016323438,0.0000054117218,0.0000035975208,0.0004911335,0.9964544,0.00089412,0.000037205675,0.0009444342,0.00015469373],"about_ca_topic_score_codex":0.00005974934,"about_ca_topic_score_gemma":0.000043973316,"teacher_disagreement_score":0.35590973,"about_ca_system_score_codex":0.00012933496,"about_ca_system_score_gemma":0.00010431901,"threshold_uncertainty_score":0.5494131},"labels":[],"label_agreement":null},{"id":"W2584833029","doi":"10.1016/j.cor.2017.01.020","title":"Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Austrian Science Fund","keywords":"Truck; Trailer; Computer science; Vehicle routing problem; Metaheuristic; Routing (electronic design automation); Branch and price; Set (abstract data type); Order (exchange); Service (business); Operations research; Variable neighborhood search; Transport engineering; Mathematical optimization; Automotive engineering; Integer programming; Business; Algorithm; Engineering; Computer network; Mathematics","score_opus":0.05007025236499678,"score_gpt":0.3340841521052146,"score_spread":0.2840138997402178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584833029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06945941,0.00032618045,0.9264433,0.0013431032,0.000038956496,0.0013134684,0.000023148395,0.000082491606,0.0009699595],"genre_scores_gemma":[0.88790673,0.00007964131,0.11147612,0.000026865922,0.00010299576,0.00010244371,0.0000054881275,0.000038635804,0.00026110283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987254,0.00017392224,0.0001571566,0.0002898966,0.0002386391,0.00041494553],"domain_scores_gemma":[0.9985284,0.0007323855,0.000014372417,0.00035330828,0.0002580591,0.00011345147],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001749745,0.00013328122,0.00016343629,0.0001042927,0.002028477,0.00092593784,0.0002627196,0.00006342063,0.000010607293],"category_scores_gemma":[0.00010272758,0.000099216326,0.000016943899,0.00014295564,0.00022457748,0.00034932457,0.0002250188,0.0003599519,0.0000035598136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119681805,0.00007026844,0.0069784694,0.00021224897,0.0003627461,0.0000062249806,0.012934221,0.8132324,0.0026851795,0.020393977,0.00072050124,0.14228404],"study_design_scores_gemma":[0.0009341003,0.00010969849,0.0110019855,0.000057962738,0.000010531062,0.000014642965,0.00017682258,0.98706037,0.0002462095,0.00004374153,0.00021618768,0.00012775698],"about_ca_topic_score_codex":0.000031662,"about_ca_topic_score_gemma":0.00003486147,"teacher_disagreement_score":0.8184473,"about_ca_system_score_codex":0.000035338566,"about_ca_system_score_gemma":0.000059648602,"threshold_uncertainty_score":0.99927074},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027573738,0.00064843526,0.90235543,0.06394708,0.0016368678,0.001892166,0.00015304449,0.000095576506,0.001697665],"genre_scores_gemma":[0.7045999,0.000102538805,0.2790226,0.0002873483,0.0009357455,0.00045067558,0.000045643865,0.00003164206,0.014523872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965742,0.00032018352,0.00045574462,0.0005895284,0.0014229108,0.00063740794],"domain_scores_gemma":[0.9918041,0.0035192096,0.00006399083,0.00209228,0.0023534473,0.00016697794],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009985016,0.00012773044,0.0002162465,0.00042734697,0.009532701,0.0045578983,0.0032799044,0.00008434274,0.00009587462],"category_scores_gemma":[0.0053482074,0.00007849387,0.00017235584,0.00078674534,0.00067238347,0.00053619954,0.0005790771,0.00045698578,0.0003308162],"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.00006163321,0.0010101203,0.0018144175,0.000013108821,0.00023131123,0.000011162351,0.0016778273,0.22725229,0.00048956677,0.06021303,0.20576528,0.50146025],"study_design_scores_gemma":[0.0005362971,0.00013320227,0.0044541513,0.000019764406,0.000012283034,0.0000071073614,0.00053138804,0.86037093,0.00015323017,0.023358213,0.11028502,0.00013843963],"about_ca_topic_score_codex":0.00072782073,"about_ca_topic_score_gemma":0.001028682,"teacher_disagreement_score":0.6770262,"about_ca_system_score_codex":0.000050028153,"about_ca_system_score_gemma":0.00041557377,"threshold_uncertainty_score":0.99647546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093276106,0.00013723972,0.99202436,0.0029786334,0.0021626435,0.0011839744,0.000026377285,0.00013952324,0.00041448534],"genre_scores_gemma":[0.06803185,0.000051169132,0.928362,0.00012134035,0.0020737818,0.00040907,0.000047320475,0.000025814454,0.0008776478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972328,0.00021392589,0.00035260915,0.0007194705,0.0006276133,0.00085360504],"domain_scores_gemma":[0.99692124,0.00040059743,0.0000590971,0.001603354,0.0007887787,0.00022690425],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016425622,0.00019758541,0.000257789,0.00023482223,0.0059783203,0.0032799242,0.0026364154,0.00011499111,0.000018313438],"category_scores_gemma":[0.0001375352,0.00019433776,0.00015116984,0.000327403,0.0003386043,0.0014275383,0.0009728722,0.0005199822,0.00005146432],"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.000011801076,0.00019182338,0.00003949705,0.000014222116,0.000056148296,0.000009861919,0.00040792392,0.08368388,0.00014097693,0.022949422,0.028777698,0.8637167],"study_design_scores_gemma":[0.0008775616,0.00027437607,0.00087712926,0.00005654548,0.00000383909,0.000014996183,0.000019684616,0.9672554,0.000104749306,0.0021987737,0.028099226,0.00021769576],"about_ca_topic_score_codex":0.000324622,"about_ca_topic_score_gemma":0.00031076657,"teacher_disagreement_score":0.88357157,"about_ca_system_score_codex":0.000113423346,"about_ca_system_score_gemma":0.00036888925,"threshold_uncertainty_score":0.99775475},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04912801,0.000025671348,0.93854284,0.006509611,0.00023041363,0.0024937203,0.000038767175,0.000047791815,0.0029831626],"genre_scores_gemma":[0.9916318,0.0000018324813,0.0073654978,0.00008175997,0.00009642467,0.00028685675,0.00016635298,0.000008572868,0.00036089862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984325,0.00003883653,0.0004032498,0.0002955694,0.00053465273,0.00029516345],"domain_scores_gemma":[0.9972731,0.000115549214,0.00006796725,0.0007292703,0.0017941287,0.00002001393],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013204387,0.00012950037,0.0001719033,0.00019752812,0.0024392651,0.00078762765,0.000614167,0.000034464567,0.00012206158],"category_scores_gemma":[0.00027799766,0.00009443789,0.00004758252,0.00034591433,0.00057963404,0.0008639682,0.00021297939,0.00014913973,0.000065681954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009414364,0.0008056301,0.006778802,0.00035130442,0.00016285994,3.3608947e-7,0.00084601203,0.79911804,0.00095280673,0.11683168,0.0064149927,0.0676434],"study_design_scores_gemma":[0.0010050419,0.00007539226,0.017434495,0.00006521006,0.000035893296,2.8635307e-7,0.0011208184,0.9726472,0.00035387013,0.0005376555,0.006559835,0.00016430211],"about_ca_topic_score_codex":0.0019758237,"about_ca_topic_score_gemma":0.0057592397,"teacher_disagreement_score":0.9425038,"about_ca_system_score_codex":0.000088820685,"about_ca_system_score_gemma":0.000091193426,"threshold_uncertainty_score":0.9988594},"labels":[],"label_agreement":null},{"id":"W2767831630","doi":"10.1016/j.cor.2017.11.003","title":"Vehicle routing with backhauls: Review and research perspectives","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Vehicle routing problem; Computer science; Heuristic; Operations research; Routing (electronic design automation); Computer network; Artificial intelligence; Mathematics","score_opus":0.11812769133609638,"score_gpt":0.44026408235878545,"score_spread":0.3221363910226891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767831630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30619308,0.06608635,0.53719825,0.03163991,0.0005433067,0.006015564,0.000035880432,0.0013769036,0.050910767],"genre_scores_gemma":[0.8733437,0.005580322,0.119852915,0.000051531657,0.00018967639,0.00010599275,0.000006407485,0.00006619948,0.0008032752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758345,0.0006493636,0.00021348281,0.00039599303,0.0005992992,0.0005583994],"domain_scores_gemma":[0.99746895,0.00038019574,0.000013924663,0.0009142062,0.0010514277,0.00017131283],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0045632333,0.00013679104,0.00022791245,0.0002581479,0.0025261168,0.0011004191,0.00061776594,0.000066346736,0.00005597669],"category_scores_gemma":[0.00089501013,0.00012370817,0.000024306073,0.0004723991,0.0005368098,0.000521062,0.0003862545,0.00086741865,0.000054732394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053395575,0.00033631432,0.0066269552,0.0032589226,0.0005452791,0.00013812128,0.021302033,0.7061805,0.0060048113,0.034042697,0.048285097,0.17322586],"study_design_scores_gemma":[0.0005087563,0.00013703054,0.0053049847,0.0010331991,0.00001597534,0.000028042594,0.0010364705,0.9885,0.0005640351,0.000060659586,0.0025209056,0.00028993067],"about_ca_topic_score_codex":0.000092653674,"about_ca_topic_score_gemma":0.000051858904,"teacher_disagreement_score":0.5671506,"about_ca_system_score_codex":0.00015542428,"about_ca_system_score_gemma":0.00010524345,"threshold_uncertainty_score":0.9999365},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1211918,0.00041094725,0.86093634,0.015285229,0.00033260524,0.0012617522,0.00003212216,0.00005555462,0.00049365254],"genre_scores_gemma":[0.96793306,0.00004396944,0.027370308,0.00021662879,0.00056442496,0.00019847252,0.000016745,0.000021773683,0.0036346111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946166,0.0010399168,0.000530589,0.00079604186,0.0021367532,0.000880061],"domain_scores_gemma":[0.99092925,0.0047320686,0.00001885856,0.0009463052,0.0030788705,0.00029464628],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.013680166,0.00016224697,0.00023082698,0.000633623,0.0039112465,0.002438316,0.0012453066,0.00010500142,0.00020648027],"category_scores_gemma":[0.00096153805,0.000102327875,0.000086657696,0.0022279038,0.0015329679,0.0003300446,0.00062966195,0.0005576305,0.00060965266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002611889,0.0006508688,0.0025580972,0.00003217002,0.0003033118,0.0000108807435,0.011570691,0.4169377,0.0075282822,0.062201902,0.084464684,0.41348022],"study_design_scores_gemma":[0.0005611586,0.00041242474,0.0021120836,0.000030424966,0.000008887657,0.000014603617,0.0013786157,0.9735604,0.0024002527,0.0008870799,0.018489173,0.00014490096],"about_ca_topic_score_codex":0.00044642235,"about_ca_topic_score_gemma":0.00028926713,"teacher_disagreement_score":0.84674126,"about_ca_system_score_codex":0.0001240239,"about_ca_system_score_gemma":0.00059529126,"threshold_uncertainty_score":0.99859726},"labels":[],"label_agreement":null},{"id":"W2800829962","doi":"10.1016/j.cor.2018.05.004","title":"A decomposition heuristic for a rich production routing problem","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Solver; Mathematical optimization; Heuristic; Computer science; Benchmark (surveying); Routing (electronic design automation); Vehicle routing problem; Context (archaeology); Set (abstract data type); Production (economics); Decomposition; Mathematics","score_opus":0.06507195492111406,"score_gpt":0.4036858702288438,"score_spread":0.3386139153077297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800829962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081920065,0.000033083325,0.91507596,0.0004907204,0.00051970064,0.0009517749,0.0000045757097,0.00036720457,0.00063691847],"genre_scores_gemma":[0.5411187,0.000006520031,0.45788804,0.000013588131,0.0005984603,0.00017303911,0.00003179715,0.000031923624,0.00013798357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850965,0.00023055592,0.0002790477,0.00030996784,0.0002635331,0.00040723922],"domain_scores_gemma":[0.9984893,0.00020097001,0.000011071516,0.0002865459,0.0009315759,0.0000805308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001599487,0.00011516297,0.0001243168,0.0003092271,0.0008220711,0.00027221325,0.00020188796,0.0000680927,0.000018293353],"category_scores_gemma":[0.00031761895,0.00012551268,0.000032990367,0.0008222785,0.00010226981,0.00023917235,0.00006524573,0.00022795005,0.000064044565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012371261,0.000045567027,0.00006763251,0.00007338877,0.00003031334,6.59816e-7,0.0016083341,0.96003777,0.013784524,0.001784112,0.005148753,0.017406592],"study_design_scores_gemma":[0.0002200995,0.000098800025,0.00016844216,0.00006237124,0.0000061261744,0.000011497132,0.00006978892,0.98898566,0.009380079,0.00018745773,0.0006750005,0.00013470664],"about_ca_topic_score_codex":0.000012464202,"about_ca_topic_score_gemma":0.000026764827,"teacher_disagreement_score":0.4591986,"about_ca_system_score_codex":0.00019960871,"about_ca_system_score_gemma":0.000066875546,"threshold_uncertainty_score":0.632279},"labels":[],"label_agreement":null},{"id":"W2883994353","doi":"10.1016/j.cor.2018.07.012","title":"The green mixed fleet vehicle routing problem with partial battery recharging and time windows","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":180,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Computer science; Battery (electricity); Heuristic; Routing (electronic design automation); Automotive engineering; Set (abstract data type); Electric vehicle; Mathematical optimization; Computer network; Engineering; Mathematics; Artificial intelligence","score_opus":0.03899741903171219,"score_gpt":0.31642982938420966,"score_spread":0.2774324103524975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883994353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3244306,0.000121576355,0.66874325,0.002941015,0.00024044019,0.0009185484,0.000006057302,0.00047406665,0.0021244178],"genre_scores_gemma":[0.81513727,0.000023024708,0.18329339,0.00006586605,0.0005530437,0.00008337942,0.000012684551,0.00006817077,0.00076317886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981188,0.0004912192,0.0002479602,0.00027957142,0.00034923587,0.0005131907],"domain_scores_gemma":[0.99871725,0.00047378134,0.000013219085,0.00035534814,0.00032337374,0.00011704985],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002144519,0.00013744019,0.00013521446,0.00013445012,0.0014205591,0.0005758553,0.00029164774,0.00006256992,0.000024406141],"category_scores_gemma":[0.00008282862,0.00010579166,0.000018953451,0.00058842055,0.00028093762,0.00025489647,0.00018565546,0.0003831287,0.00008882641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048913033,0.000034351735,0.0014179214,0.00004737382,0.00013597263,0.000011102635,0.0043558935,0.87258613,0.015571358,0.0015838344,0.0045649465,0.09964218],"study_design_scores_gemma":[0.00031374735,0.00009944688,0.0004180217,0.00006091483,0.000004916207,0.000013538546,0.00009409266,0.99305326,0.0037172057,0.000026980635,0.0020587877,0.00013906743],"about_ca_topic_score_codex":0.000054575896,"about_ca_topic_score_gemma":0.000059396883,"teacher_disagreement_score":0.49070665,"about_ca_system_score_codex":0.00008196265,"about_ca_system_score_gemma":0.000066277506,"threshold_uncertainty_score":0.9998795},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12657028,0.000029191558,0.8706499,0.0005648016,0.00027385555,0.0005683326,0.00003597617,0.00019004403,0.0011176533],"genre_scores_gemma":[0.902101,0.00001871607,0.09706256,0.00006841607,0.00018234662,0.00006696148,0.000174036,0.000019344858,0.0003066371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933064,0.000021173648,0.00018048228,0.00015680511,0.00011760117,0.00019330526],"domain_scores_gemma":[0.99923944,0.00006298191,0.0000038308744,0.00016629379,0.0004654777,0.00006194767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026256748,0.0000699704,0.00007648363,0.00021637106,0.00036487548,0.00015527348,0.00009773032,0.000048980368,0.00008242597],"category_scores_gemma":[0.000029335104,0.00007547281,0.000017847558,0.00038273254,0.00012868628,0.00018257674,0.00001324967,0.00010532184,0.000013665305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007104709,0.000027371638,0.0001163918,0.000026896261,0.00002864107,4.2050738e-7,0.0011607888,0.970359,0.0014382278,0.009901031,0.005553106,0.011381015],"study_design_scores_gemma":[0.00032451577,0.00006889533,0.0015669169,0.000008386923,0.0000037059447,0.0000016450678,0.000072904826,0.9877827,0.00089123636,0.000048387476,0.009148703,0.000081999286],"about_ca_topic_score_codex":0.000026318383,"about_ca_topic_score_gemma":0.00015225705,"teacher_disagreement_score":0.7755307,"about_ca_system_score_codex":0.000055252913,"about_ca_system_score_gemma":0.00005485986,"threshold_uncertainty_score":0.3077692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029043695,0.0002748348,0.9630978,0.0053909495,0.0002502458,0.000495455,0.0000011781085,0.00013412187,0.001311716],"genre_scores_gemma":[0.7967808,0.00008158356,0.20245059,0.000054851746,0.00023420455,0.000061217215,0.0000062885083,0.0000112059,0.00031925854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758756,0.0004122129,0.00025668947,0.00051648845,0.00060953276,0.0006174925],"domain_scores_gemma":[0.99798536,0.00047883275,0.00002396935,0.0008295172,0.00054075086,0.00014156793],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014375414,0.00013288483,0.0001038291,0.00019803269,0.0034454656,0.0013090966,0.001131971,0.00007098603,0.0000028819777],"category_scores_gemma":[0.000080156315,0.000099243895,0.00003156206,0.0010860533,0.0007355455,0.00062339613,0.00080040016,0.00035199005,0.000040585237],"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.000012217845,0.00011064187,0.00019754376,0.00001113094,0.000032819946,0.000004014147,0.0022572197,0.11745251,0.00086032186,0.74008465,0.005821925,0.13315503],"study_design_scores_gemma":[0.00014306667,0.00014237926,0.0014335884,0.000024779463,0.0000015578396,0.000009171622,0.00003919686,0.9920736,0.00033452778,0.00077414064,0.004903059,0.00012094052],"about_ca_topic_score_codex":0.000111253416,"about_ca_topic_score_gemma":0.00056504115,"teacher_disagreement_score":0.8746211,"about_ca_system_score_codex":0.00009685036,"about_ca_system_score_gemma":0.00016179768,"threshold_uncertainty_score":0.99972767},"labels":[],"label_agreement":null},{"id":"W2898596225","doi":"10.1016/j.cor.2019.02.014","title":"Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":223,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Queueing theory; Queue; Computer science; Routing (electronic design automation); Driving range; Mathematical optimization; Range (aeronautics); Vehicle routing problem; Electric vehicle; Real-time computing; Operations research; Computer network; Mathematics; Engineering","score_opus":0.025915186573026647,"score_gpt":0.3053319213757771,"score_spread":0.2794167348027504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898596225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6349245,0.00013174591,0.35142925,0.00048517226,0.0001325544,0.0012994222,0.000008947652,0.0008688053,0.010719652],"genre_scores_gemma":[0.8395916,0.000019699435,0.15595251,0.000030643412,0.000091052185,0.00007748371,0.000051364317,0.000093485105,0.004092123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747527,0.00042323433,0.0003595921,0.00041470295,0.00062685605,0.0007003626],"domain_scores_gemma":[0.9984662,0.0005128519,0.000023945864,0.00041893686,0.0004405675,0.00013750566],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016739456,0.00019228233,0.00021502568,0.0004744199,0.00074892776,0.00039365244,0.0003342939,0.00008463378,0.00033813625],"category_scores_gemma":[0.000083806466,0.00019153538,0.000037903807,0.0013556703,0.00003736503,0.00039587988,0.00017975149,0.00058100035,0.0009533035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067479796,0.000020981463,0.0006798281,0.000034338096,0.000040467294,0.0000040938444,0.00073945033,0.9518307,0.040308658,0.0006799344,0.00052438513,0.005130447],"study_design_scores_gemma":[0.00043592777,0.00008416899,0.0001729758,0.00009556508,0.000006737724,0.000017270453,0.0001219363,0.98900694,0.009575532,0.00001826519,0.00023157372,0.0002331214],"about_ca_topic_score_codex":0.00003973213,"about_ca_topic_score_gemma":0.000019604357,"teacher_disagreement_score":0.2046672,"about_ca_system_score_codex":0.0005432068,"about_ca_system_score_gemma":0.00013519455,"threshold_uncertainty_score":0.9998246},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106691726,0.00020202834,0.8919328,0.00016844041,0.00017759383,0.0006341175,0.000033279706,0.00012059587,0.000039446622],"genre_scores_gemma":[0.6251715,0.00010059378,0.37392926,0.000035376284,0.00034647688,0.00008664646,0.00021970118,0.00004596661,0.000064511034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985339,0.000101442354,0.00037479223,0.00038917706,0.00018339683,0.00041726086],"domain_scores_gemma":[0.9990335,0.0001563006,0.000010257996,0.00020332873,0.0004543371,0.00014225651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009836991,0.0001572587,0.00018389562,0.00053243176,0.0005739983,0.0006528512,0.0001409173,0.00006801267,0.000017804326],"category_scores_gemma":[0.00004774556,0.0001673342,0.000019385916,0.0003275006,0.00023347621,0.00043884682,0.000095163596,0.0002928319,0.00001750776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004558902,0.000007882217,0.00006282789,0.00003541097,0.000016984795,0.0000023147124,0.001173274,0.9228027,0.0001660663,0.00009943126,0.000085675914,0.075542875],"study_design_scores_gemma":[0.00070889207,0.00009992988,0.0000654122,0.00007833117,0.0000031436666,0.000030066687,0.00019923234,0.9963051,0.0020438798,0.000057073285,0.0002262569,0.0001826687],"about_ca_topic_score_codex":0.00013102972,"about_ca_topic_score_gemma":0.00013971268,"teacher_disagreement_score":0.51847976,"about_ca_system_score_codex":0.00043059752,"about_ca_system_score_gemma":0.00024455492,"threshold_uncertainty_score":0.6823691},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55421066,0.00012871259,0.4440898,0.00010249329,0.00009457874,0.000222715,0.0000028459306,0.00009981663,0.0010483491],"genre_scores_gemma":[0.57673556,0.0000718829,0.4228833,0.000038637838,0.000063633364,0.00006727147,0.000032730204,0.00002611313,0.000080873346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901336,0.000044408767,0.00023431666,0.00027606756,0.00012610847,0.00030571636],"domain_scores_gemma":[0.9994612,0.0000983965,0.00000855453,0.00027169657,0.000056782304,0.00010338947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755902,0.000118617056,0.00017449103,0.00044835324,0.00011837431,0.00024021354,0.00020456404,0.00009147664,0.000009970538],"category_scores_gemma":[0.000025160472,0.00013214056,0.000016610107,0.0004875293,0.000025205616,0.00018558312,0.0001636351,0.00041796552,0.0000150432015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064921287,0.000020631644,0.0011196058,0.000034818237,0.000007933158,0.0000018006644,0.0010977195,0.99318236,0.00020178063,0.0011925665,0.00047816627,0.0026561017],"study_design_scores_gemma":[0.00022850573,0.000051869898,0.00012223641,0.00012426966,0.0000012076625,0.00000489945,0.00018783283,0.998682,0.00011729126,0.000047832327,0.0002876174,0.00014440832],"about_ca_topic_score_codex":0.00005974488,"about_ca_topic_score_gemma":0.000021520145,"teacher_disagreement_score":0.022524884,"about_ca_system_score_codex":0.00012106457,"about_ca_system_score_gemma":0.000031657553,"threshold_uncertainty_score":0.5388536},"labels":[],"label_agreement":null},{"id":"W2947585677","doi":"10.1016/j.cor.2019.05.026","title":"Exact solution methods for the multi-period vehicle routing problem with due dates","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Period (music); Computer science; Mathematical optimization; Routing (electronic design automation); Operations research; Mathematics; Computer network","score_opus":0.07459327942086358,"score_gpt":0.4055867442912805,"score_spread":0.3309934648704169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947585677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011169109,0.0002254969,0.985345,0.00097103807,0.00022541946,0.0015876745,0.0000074202894,0.00025614392,0.00021269475],"genre_scores_gemma":[0.20362328,0.000017326338,0.7955857,0.0000335445,0.000089911206,0.00023023222,0.00002960508,0.000054635886,0.0003357603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804324,0.0005609835,0.00027929986,0.00033116265,0.0002602665,0.00052502565],"domain_scores_gemma":[0.9978293,0.0011010247,0.000016922686,0.00052239205,0.00044960112,0.0000807225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034759685,0.00016184486,0.00019140812,0.00017300871,0.0007828708,0.00046543294,0.0004387092,0.000082377774,0.00003463266],"category_scores_gemma":[0.0001838318,0.00012013268,0.00005013811,0.0007005318,0.000093342285,0.00032706073,0.00013937666,0.00043659718,0.00004463873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010023974,0.000024320096,0.00019913586,0.00004681585,0.00005427456,5.4288773e-7,0.00086916593,0.94312805,0.013582055,0.0007148028,0.0002701794,0.04110062],"study_design_scores_gemma":[0.0006262016,0.0000888633,0.0005338938,0.000054018677,0.000009560455,0.000009736051,0.00027246564,0.99183476,0.0039554937,0.000011119665,0.0024397476,0.000164155],"about_ca_topic_score_codex":0.000061021383,"about_ca_topic_score_gemma":0.00003141676,"teacher_disagreement_score":0.19245417,"about_ca_system_score_codex":0.00015214845,"about_ca_system_score_gemma":0.00010201208,"threshold_uncertainty_score":0.60212886},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027199115,0.00003361796,0.99387413,0.0003120395,0.00069350697,0.0014746166,0.0000288933,0.00026191105,0.0006013982],"genre_scores_gemma":[0.6912547,0.000019865207,0.30747214,0.00017922261,0.00016915602,0.00018752945,0.0004669773,0.00005848347,0.0001919265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838525,0.0002777329,0.0002307321,0.00027940335,0.00031380478,0.0005130513],"domain_scores_gemma":[0.9985106,0.00071549276,0.0000108412505,0.00034587824,0.00029671777,0.000120493714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010528378,0.00016082228,0.00016787148,0.00026215235,0.00045446426,0.00027380406,0.00022427349,0.000105185194,0.00017104179],"category_scores_gemma":[0.00003676528,0.00016623766,0.00006383532,0.00047986078,0.000040404768,0.00018465034,0.00002772311,0.00033132237,0.0002356991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026505084,0.000058219644,0.000034083216,0.000037446363,0.000024816614,7.626964e-7,0.00014466982,0.98218894,0.0005217794,0.00051236956,0.014135587,0.002314811],"study_design_scores_gemma":[0.0008791774,0.00021746465,0.00007918864,0.00007892651,0.000004052873,8.235436e-7,0.00001591561,0.9958215,0.0010990839,0.000047194477,0.0015713614,0.00018530623],"about_ca_topic_score_codex":0.000013426925,"about_ca_topic_score_gemma":0.0000083582,"teacher_disagreement_score":0.6885348,"about_ca_system_score_codex":0.00016878883,"about_ca_system_score_gemma":0.000065736436,"threshold_uncertainty_score":0.6778975},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7641735,0.00060341245,0.22342025,0.00032753267,0.00016352598,0.00076823053,0.000017891452,0.00025432184,0.010271345],"genre_scores_gemma":[0.9907889,0.000050498147,0.008205012,0.00002574075,0.000051514882,0.00001898976,0.000028363633,0.000024452103,0.00080656365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912417,0.000035173576,0.00012585931,0.00018582464,0.00024261925,0.0002863358],"domain_scores_gemma":[0.9995421,0.00007188446,0.0000021065805,0.00020541376,0.000081634855,0.00009685598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021574707,0.00010494537,0.00012640336,0.00014621495,0.00014682187,0.00016096773,0.00014302623,0.000047127563,0.00014100946],"category_scores_gemma":[0.0000027271558,0.000090078545,0.00001705898,0.00022342315,0.000102447586,0.0001329509,0.000016420874,0.00026933255,0.00019496366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003521578,0.00008455923,0.0070889825,0.00023080545,0.00015906057,0.00004769372,0.0026137999,0.958256,0.016249025,0.0066576716,0.0020892955,0.0064878725],"study_design_scores_gemma":[0.0006952551,0.00014891868,0.008750957,0.00009400544,0.000008803442,0.000013287812,0.000073009345,0.98413235,0.0013436062,0.00003184799,0.004465834,0.00024214308],"about_ca_topic_score_codex":0.000019116736,"about_ca_topic_score_gemma":0.000037278765,"teacher_disagreement_score":0.22661537,"about_ca_system_score_codex":0.000046928715,"about_ca_system_score_gemma":0.00003482012,"threshold_uncertainty_score":0.36732963},"labels":[],"label_agreement":null},{"id":"W2982586778","doi":"10.1016/j.cor.2020.105085","title":"A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints","year":2020,"lang":"en","type":"preprint","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Constraint programming; Mathematical optimization; Linear programming; Computer science; Constraint (computer-aided design); Synchronization (alternating current); Constraint satisfaction; Goal programming; Routing (electronic design automation); Mathematics; Stochastic programming; Artificial intelligence","score_opus":0.07258725483866049,"score_gpt":0.34493051542850567,"score_spread":0.27234326058984515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982586778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008494432,0.00024462902,0.989983,0.0018184274,0.000088868444,0.0062946887,0.00010256563,0.00054097123,0.00007736016],"genre_scores_gemma":[0.46196392,0.000014862343,0.53699607,0.000037507365,0.00015965573,0.0005755762,0.0001435684,0.00009329099,0.000015532407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963573,0.0004407616,0.0005804494,0.00087832834,0.00076316285,0.000979968],"domain_scores_gemma":[0.996999,0.0008499948,0.000057518748,0.0005522636,0.0011775041,0.00036371348],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023085573,0.0004545612,0.00045944168,0.00029638165,0.0010512859,0.0011916386,0.00061012886,0.00030654992,0.0000130890185],"category_scores_gemma":[0.00020775791,0.00038807097,0.00010181011,0.00087330403,0.0004544047,0.00017809341,0.00057716004,0.0018316575,0.00000364568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038410883,0.000049503804,0.00009381459,0.00033410857,0.00017721276,0.000004835682,0.002321047,0.85321313,0.00006323365,0.0035745602,0.00007599916,0.14005412],"study_design_scores_gemma":[0.0014140925,0.00026384677,0.000020084923,0.0005147494,0.0000628499,0.000008422395,0.00070905685,0.9961991,0.00020889327,0.00007438497,0.0001173788,0.0004071728],"about_ca_topic_score_codex":0.00006560592,"about_ca_topic_score_gemma":0.000078908895,"teacher_disagreement_score":0.4611145,"about_ca_system_score_codex":0.0003422988,"about_ca_system_score_gemma":0.0021350812,"threshold_uncertainty_score":0.9998571},"labels":[],"label_agreement":null},{"id":"W3025850278","doi":"10.1016/j.cor.2020.104944","title":"The two-echelon inventory-routing problem with fleet management","year":2020,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Transport Canada","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Vehicle routing problem; Computer science; Vendor-managed inventory; Remanufacturing; Inventory theory; Renting; Product (mathematics); Supply chain; Operations research; Fleet management; Vendor; Inventory management; Set (abstract data type); Inventory control; Routing (electronic design automation); Supply chain management; Operations management; Business; Manufacturing engineering; Mathematics; Economics; Engineering","score_opus":0.06683703304782425,"score_gpt":0.3465967150423648,"score_spread":0.27975968199454054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025850278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008811673,0.00013475545,0.9768849,0.004000155,0.00011369939,0.00080581463,0.0000017642209,0.00044286143,0.008804401],"genre_scores_gemma":[0.54362106,0.00008972381,0.45527247,0.00018823527,0.0002116251,0.00014676688,0.000015700776,0.00006407184,0.00039032422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982975,0.0003276518,0.00023303683,0.0002526405,0.00046714893,0.0004219905],"domain_scores_gemma":[0.999176,0.00015611967,0.000009460568,0.00031149318,0.00020089377,0.00014602747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011921215,0.00012489183,0.00010784412,0.00009625908,0.0008119391,0.0005083001,0.00046168282,0.000033275843,0.000014674385],"category_scores_gemma":[0.000047018424,0.00009563165,0.00002631009,0.0009541803,0.00009601649,0.0001519171,0.00021270796,0.00043579735,0.00007398251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006378722,0.000008805058,0.000116510564,0.00003665341,0.000051945284,0.00000782899,0.001105653,0.9707689,0.0002060968,0.006733608,0.0027976187,0.018159969],"study_design_scores_gemma":[0.0003537496,0.00005202539,0.00006767224,0.000043580727,0.000005291163,0.0000028371187,0.0003456557,0.9918715,0.00044470414,0.000027391905,0.006666279,0.00011933384],"about_ca_topic_score_codex":0.000012927704,"about_ca_topic_score_gemma":0.0000231166,"teacher_disagreement_score":0.5348094,"about_ca_system_score_codex":0.00014595984,"about_ca_system_score_gemma":0.000051294064,"threshold_uncertainty_score":0.62448615},"labels":[],"label_agreement":null},{"id":"W3028512226","doi":"10.1016/j.cor.2020.104987","title":"A review of vehicle routing with simultaneous pickup and delivery","year":2020,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":200,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; Vehicle routing problem; Computer science; Routing (electronic design automation); Destinations; Operations research; Tourism; Artificial intelligence; Computer network; Mathematics; Geography","score_opus":0.08792970271494478,"score_gpt":0.389522005941624,"score_spread":0.30159230322667924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028512226","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004934684,0.9303172,0.06826449,0.000056525725,0.00005561913,0.0009856398,0.000019711335,0.00012971828,0.00016611925],"genre_scores_gemma":[0.00004012961,0.9187071,0.08089682,0.000043853073,0.000089579626,0.0000619726,0.000051867024,0.000080319034,0.000028365579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756205,0.0007181827,0.0006278006,0.0003781024,0.00038550032,0.00032839144],"domain_scores_gemma":[0.9977608,0.0011887127,0.000042772182,0.0004144952,0.0004367672,0.00015646004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147751,0.00027912596,0.0011024119,0.00025429463,0.00018851856,0.00012648603,0.00038396867,0.00013312876,0.000019951935],"category_scores_gemma":[0.0004584323,0.00023902564,0.00010055287,0.0013062103,0.0001232337,0.00010352326,0.00023437508,0.00080675696,0.000022763641],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010711383,0.000010108779,5.097262e-7,0.06225529,0.000102314065,0.000023979528,0.00011126172,0.07658615,0.0000017186678,0.00005513645,0.00042947897,0.86042297],"study_design_scores_gemma":[0.00009535612,0.00006782075,1.5155123e-7,0.07151508,0.0000943617,0.00004403157,0.000011369788,0.57295036,0.0000022926965,4.801502e-7,0.3550119,0.00020678245],"about_ca_topic_score_codex":0.00001783853,"about_ca_topic_score_gemma":0.000005450889,"teacher_disagreement_score":0.8602162,"about_ca_system_score_codex":0.00014655775,"about_ca_system_score_gemma":0.00033043153,"threshold_uncertainty_score":0.9747183},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00957946,0.000092143484,0.96366835,0.023156606,0.000750207,0.002079054,0.000007900253,0.00031507853,0.00035120416],"genre_scores_gemma":[0.9839424,0.000004477655,0.012263938,0.0013820103,0.0011640163,0.00078179396,0.00021493845,0.000039029856,0.0002073922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973746,0.000060773713,0.0005277423,0.00056627573,0.0009247855,0.00054583506],"domain_scores_gemma":[0.9982167,0.000025166974,0.000020345971,0.0003439586,0.001286095,0.00010776052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011240736,0.00019121327,0.00022287038,0.00027921927,0.00093666516,0.00047813295,0.0007748699,0.00007144426,0.00028558224],"category_scores_gemma":[0.00031077227,0.00018899837,0.000091864065,0.001398011,0.000054559394,0.000869796,0.0005413541,0.00026316446,0.00057451014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047598638,0.000214605,0.000018677667,0.001333792,0.00007466411,0.0000059119243,0.0010475168,0.9368256,0.0001053164,0.038436517,0.009699077,0.012190765],"study_design_scores_gemma":[0.00087175827,0.000022391365,0.000025363488,0.000060696868,0.000017224189,8.507405e-7,0.0017740754,0.9900676,0.000002429925,0.000024498539,0.006936656,0.00019647683],"about_ca_topic_score_codex":0.0015850561,"about_ca_topic_score_gemma":0.0022412573,"teacher_disagreement_score":0.97436297,"about_ca_system_score_codex":0.00008126753,"about_ca_system_score_gemma":0.00012019683,"threshold_uncertainty_score":0.770713},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77666134,0.002746007,0.08048069,0.028458746,0.002702875,0.0022620568,0.0000072250814,0.000683268,0.10599782],"genre_scores_gemma":[0.9915394,0.00008951515,0.0028358833,0.0013411606,0.00073044235,0.00006618404,0.00011528187,0.000028282784,0.0032538245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986568,0.00005905061,0.00020095849,0.00036804334,0.0003557084,0.00035942355],"domain_scores_gemma":[0.9991482,0.00006068823,0.000014495041,0.00025396005,0.0004982825,0.00002440655],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000785726,0.00011535101,0.000125987,0.0004314205,0.0007156795,0.0016534484,0.0002146232,0.000037523805,0.00037075864],"category_scores_gemma":[0.00014130313,0.00011078739,0.000032557087,0.0010598662,0.00009965851,0.0008310325,0.0006340346,0.00025845782,0.00022688897],"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.000033125423,0.0007536892,0.010248484,0.001169128,0.00028922857,0.0003332332,0.0018197723,0.036250733,0.017934775,0.59468716,0.16028519,0.17619546],"study_design_scores_gemma":[0.00053032907,0.00001819711,0.0010129324,0.00019009934,0.000012472409,0.000006107643,0.0021258395,0.54332566,0.00032588647,0.00083208596,0.4513792,0.0002411909],"about_ca_topic_score_codex":0.0004220364,"about_ca_topic_score_gemma":0.00035092898,"teacher_disagreement_score":0.5938551,"about_ca_system_score_codex":0.000065759894,"about_ca_system_score_gemma":0.000057962538,"threshold_uncertainty_score":0.9993829},"labels":[],"label_agreement":null},{"id":"W3104464641","doi":"10.1016/j.cor.2023.106526","title":"Unified Branch-and-Benders-Cut for two-stage stochastic mixed-integer programs","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Canada Foundation for Innovation; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Mathematical optimization; Benders' decomposition; Integer (computer science); Decomposition; Generality; Heuristic; Branch and bound; Heuristics; Discretization; Stochastic programming; Mathematics; Branch and cut; Computer science; Integer programming","score_opus":0.09352603497581218,"score_gpt":0.3962700240992904,"score_spread":0.3027439891234782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104464641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012413161,0.00039523715,0.98396873,0.0005352479,0.0006565716,0.00094250037,0.000016630143,0.00065634615,0.00041559918],"genre_scores_gemma":[0.8848013,0.00001751088,0.11325092,0.000025264333,0.0002393804,0.0002796624,0.000077267905,0.00007839677,0.0012302593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984689,0.00017321498,0.00025166545,0.00035602695,0.00028886818,0.00046132682],"domain_scores_gemma":[0.9987758,0.00054324325,0.000004414164,0.00028512962,0.00025305335,0.00013840498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011850704,0.00015843518,0.00016507073,0.00039066238,0.00032761434,0.0008475084,0.00022795344,0.00007959051,0.000026110221],"category_scores_gemma":[0.0001260059,0.00015833075,0.000059015205,0.0007149648,0.00011854874,0.00024147515,0.00010085614,0.00043140585,0.000043068474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047549183,0.000017572367,0.000003390347,0.0001640833,0.000055669017,0.0000036031888,0.0007447816,0.936435,0.00096874556,0.017125264,0.0013566676,0.043120455],"study_design_scores_gemma":[0.0003055076,0.0000793842,0.000009787719,0.000107143635,0.000008749135,0.0000082801,0.0001571199,0.9960316,0.0005644241,0.00016384,0.002399005,0.00016519352],"about_ca_topic_score_codex":0.000028598764,"about_ca_topic_score_gemma":0.00006750174,"teacher_disagreement_score":0.8723882,"about_ca_system_score_codex":0.00012845037,"about_ca_system_score_gemma":0.000102625236,"threshold_uncertainty_score":0.8172543},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5444474,0.00023682183,0.4524504,0.001712672,0.00040091132,0.00013579658,0.000019133557,0.000012295469,0.0005845824],"genre_scores_gemma":[0.8158222,0.000070941256,0.18208797,0.00007112214,0.00011468453,0.0000069700695,0.000018491408,0.000010349098,0.001797282],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914196,0.00485475,0.0009394933,0.00058222085,0.0016499504,0.0005539845],"domain_scores_gemma":[0.9937858,0.0029606367,0.00007498541,0.0008551196,0.0022009453,0.0001224863],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.017730882,0.000111480644,0.0005121953,0.0005951098,0.0009111827,0.0007062189,0.0008886328,0.00009739421,0.0012358867],"category_scores_gemma":[0.005682718,0.0000934728,0.000126793,0.00242976,0.00021763351,0.00036743685,0.0010855973,0.00021819906,0.00017236118],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060443475,0.00023532957,0.001384689,0.000018053288,0.00022797188,0.00010350361,0.004501344,0.285014,0.62351525,0.017377162,0.0029238334,0.06463841],"study_design_scores_gemma":[0.0009944792,0.00015718228,0.00241683,0.000103149854,0.00005854713,0.000078406636,0.00823657,0.5761908,0.38955176,0.018792132,0.0030178514,0.00040226112],"about_ca_topic_score_codex":0.0005949903,"about_ca_topic_score_gemma":0.00023787312,"teacher_disagreement_score":0.29117683,"about_ca_system_score_codex":0.000091846174,"about_ca_system_score_gemma":0.00059286004,"threshold_uncertainty_score":0.9996771},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3764933,0.0003217052,0.6023602,0.011392983,0.0005257328,0.001696014,0.000021627238,0.0001597333,0.0070287255],"genre_scores_gemma":[0.7595961,0.00012692428,0.23513213,0.0008390525,0.0003842313,0.0005468945,0.00022532034,0.000040311847,0.0031090355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957413,0.0019382894,0.00047576122,0.0005362924,0.0006058955,0.0007024693],"domain_scores_gemma":[0.9951556,0.00059514615,0.000028415787,0.0005622925,0.0034130912,0.00024548094],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016871315,0.00014905061,0.00023859213,0.00027475262,0.004086843,0.00017338933,0.00019173653,0.00015619639,0.0005701581],"category_scores_gemma":[0.00044583748,0.00012646696,0.00004115003,0.00135986,0.00011108214,0.00028600742,0.00020487717,0.0011918182,0.00052184716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014059347,0.00069745444,0.0067496244,0.0002851518,0.00018557067,0.0001696912,0.026413718,0.8318343,0.0026989982,0.112640865,0.005493248,0.012690765],"study_design_scores_gemma":[0.0019349188,0.00047560726,0.0033310885,0.0007534615,0.00001667861,0.000030640665,0.021826064,0.9573243,0.0009193769,0.00016260205,0.012812243,0.0004130088],"about_ca_topic_score_codex":0.00056387513,"about_ca_topic_score_gemma":0.0020538303,"teacher_disagreement_score":0.3831028,"about_ca_system_score_codex":0.00041991004,"about_ca_system_score_gemma":0.0040384536,"threshold_uncertainty_score":0.9972097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055805426,0.0031806792,0.9389755,0.00040828311,0.0007213569,0.00017968197,0.0000027062347,0.00015099943,0.0005753562],"genre_scores_gemma":[0.8828875,0.006920552,0.10865229,0.00016392201,0.00063079596,0.0001890107,0.00017339789,0.00006656213,0.0003159761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987717,0.00022449251,0.00021045472,0.00026147242,0.00020896859,0.00032290895],"domain_scores_gemma":[0.99940336,0.0000875037,0.000005081974,0.00027159133,0.00014686056,0.00008561035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047789488,0.00010894697,0.00013527198,0.00027716256,0.0001908455,0.00026144492,0.00013661588,0.00007038662,0.000022250808],"category_scores_gemma":[0.000045540608,0.00012928063,0.000019714618,0.00081655924,0.000032313863,0.00021054568,0.00022776506,0.00024292411,0.000003633633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015638132,0.000027011996,0.00034516657,0.000024051586,0.000028887222,0.0000372914,0.0001886103,0.9940614,0.00009404233,0.0014120983,0.0027858885,0.0009939596],"study_design_scores_gemma":[0.00029800157,0.000013735094,0.0014833942,0.00006244753,0.0000041356407,0.00000752116,0.00004474674,0.9942637,0.00019620078,0.000017607337,0.0034874242,0.00012108879],"about_ca_topic_score_codex":0.0001245048,"about_ca_topic_score_gemma":0.0010730772,"teacher_disagreement_score":0.8303232,"about_ca_system_score_codex":0.0001541038,"about_ca_system_score_gemma":0.00005022666,"threshold_uncertainty_score":0.52719104},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007529653,0.00054421485,0.9887283,0.0005054207,0.0003610852,0.00027663537,0.0000076075926,0.00017736776,0.0018697032],"genre_scores_gemma":[0.9886048,0.000050030423,0.010119851,0.00006604966,0.0001189804,0.000074689306,0.0002170678,0.000032174645,0.0007163823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845964,0.00024988953,0.00025944534,0.00024861662,0.00041690946,0.0003654953],"domain_scores_gemma":[0.9988336,0.00016688491,0.000009470937,0.0003663294,0.0005181108,0.000105630934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003383744,0.000130671,0.00015442968,0.00025623912,0.0003065986,0.00024887675,0.00019466125,0.00007950063,0.00008658275],"category_scores_gemma":[0.000046225578,0.00014775028,0.000030905914,0.0009880709,0.00006628122,0.00020217613,0.0000717531,0.00023559965,0.00005697849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016639361,0.000040657233,0.000003223494,0.000020884949,0.000035311412,0.000005396787,0.0002261297,0.9748682,0.0018101434,0.018893879,0.0012249361,0.0028696093],"study_design_scores_gemma":[0.00035271826,0.000034583103,0.00008821979,0.000055669316,0.000004808927,0.000027792821,0.00014073374,0.9955988,0.0028295887,0.000134776,0.00058901217,0.0001432878],"about_ca_topic_score_codex":0.000028646578,"about_ca_topic_score_gemma":0.0000857721,"teacher_disagreement_score":0.9810751,"about_ca_system_score_codex":0.00024408239,"about_ca_system_score_gemma":0.00020607944,"threshold_uncertainty_score":0.6025082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005264482,0.00090842706,0.99519914,0.000845294,0.00028989557,0.0005303443,0.000039440903,0.00022299266,0.0014380275],"genre_scores_gemma":[0.6478718,0.0009021163,0.34408426,0.00016611959,0.0007851179,0.00024240887,0.00048817444,0.000111848356,0.0053481446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833894,0.00029081153,0.0002728546,0.00023072198,0.00029722103,0.0005694304],"domain_scores_gemma":[0.9987136,0.00042665878,0.0000050759977,0.00039502734,0.00032201732,0.00013762127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008281494,0.00014670228,0.00017266939,0.00005115471,0.00090673316,0.00031354133,0.00034383454,0.000090753376,0.00016737115],"category_scores_gemma":[0.00002977174,0.00012149599,0.000065109554,0.00053150096,0.0002553634,0.000090759015,0.000034521952,0.0005361296,0.0002481774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009277535,0.0000805827,0.000023108156,0.000026012307,0.00010238471,0.00007227615,0.00040834572,0.93679875,0.0030948317,0.005978615,0.04875349,0.0046523027],"study_design_scores_gemma":[0.0004223055,0.000032058844,0.0001329898,0.00002788025,0.000008627597,0.00001135797,0.000017525315,0.9815485,0.0013659643,0.000109746055,0.016170148,0.00015291836],"about_ca_topic_score_codex":0.000009619002,"about_ca_topic_score_gemma":0.00011430166,"teacher_disagreement_score":0.6511149,"about_ca_system_score_codex":0.00007254793,"about_ca_system_score_gemma":0.00018155086,"threshold_uncertainty_score":0.69739497},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64465976,0.006724262,0.009494582,0.0037523638,0.009988624,0.0004651451,0.0036862749,0.0016684267,0.31956056],"genre_scores_gemma":[0.9513751,0.004258762,0.007919914,0.004067911,0.008579839,0.0076133283,0.011401033,0.0040732925,0.00071076746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.95873976,0.0030704883,0.008553393,0.0083935065,0.0108420355,0.010400804],"domain_scores_gemma":[0.96754766,0.009020455,0.008330818,0.00856864,0.0020189844,0.0045134216],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.010423584,0.0042522326,0.001779238,0.0037139973,0.012091739,0.0101554375,0.010333565,0.008659852,0.3292705],"category_scores_gemma":[0.010852882,0.008308773,0.007510016,0.00808304,0.008958402,0.0074451137,0.012708852,0.00828602,0.0049125254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047222883,0.0016762827,0.00006235595,0.0060991724,0.00707349,0.0038489508,0.0045869537,0.023560377,0.0038380066,0.5535982,0.38681293,0.0041209804],"study_design_scores_gemma":[0.007895977,0.004754489,0.00018159326,0.0065176673,0.007756904,0.005866005,0.011614757,0.13393328,0.8005298,0.002353144,0.011088418,0.0075079678],"about_ca_topic_score_codex":0.008409946,"about_ca_topic_score_gemma":0.008187056,"teacher_disagreement_score":0.7966918,"about_ca_system_score_codex":0.00016419547,"about_ca_system_score_gemma":0.008462574,"threshold_uncertainty_score":0.99819314},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005631722,0.00019366357,0.9886367,0.00044195846,0.00023995558,0.0009865947,0.000006313538,0.000362363,0.0035007747],"genre_scores_gemma":[0.93888754,0.000026829597,0.05857822,0.000030791143,0.00020210931,0.00041351686,0.00035472616,0.000026795764,0.0014794786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989856,0.0000705384,0.00021975757,0.00023861686,0.00023806373,0.0002474637],"domain_scores_gemma":[0.99885386,0.00006625045,0.0000056817344,0.00030438998,0.00070886704,0.00006094475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005242263,0.00008697226,0.000104032726,0.00013560154,0.00030583632,0.00014508882,0.00015372316,0.000054060452,0.000016575428],"category_scores_gemma":[0.000029380608,0.00009459199,0.000035097,0.0006310746,0.000032269243,0.00019968057,0.000058479778,0.00012647737,0.00003471627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023383575,0.000039687413,0.000034401222,0.00036350946,0.000023844372,0.0000020448533,0.00024000341,0.9565591,0.00006688685,0.012369216,0.02679122,0.0035077366],"study_design_scores_gemma":[0.00021154969,0.00002539156,0.00021831087,0.00006248231,0.0000053350877,0.000001763268,0.00027851743,0.9843369,0.0005111899,0.000014133705,0.014240104,0.0000943057],"about_ca_topic_score_codex":0.000011143775,"about_ca_topic_score_gemma":0.000044118562,"teacher_disagreement_score":0.9332558,"about_ca_system_score_codex":0.00020802932,"about_ca_system_score_gemma":0.000095514086,"threshold_uncertainty_score":0.38573495},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09329377,0.002705755,0.76059234,0.04851384,0.0019854787,0.006120674,0.00023340127,0.00044932755,0.08610541],"genre_scores_gemma":[0.9921025,0.000009433977,0.0020458158,0.00007153056,0.0002671627,0.00025673574,0.00009324971,0.000022803051,0.005130776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872905,0.00010525213,0.00017624118,0.00018117318,0.00042093644,0.0003873364],"domain_scores_gemma":[0.9983484,0.00053427275,0.000007829392,0.00022932435,0.00079408544,0.00008608722],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011481051,0.00009152804,0.000082175764,0.000109963425,0.002394104,0.00038399518,0.00025016343,0.000056935314,0.00006714664],"category_scores_gemma":[0.00013728172,0.00006196931,0.000053743774,0.00055647676,0.000060693146,0.00012617522,0.000078130615,0.00020583264,0.00009348956],"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.0000010806369,0.000006223492,0.000011636886,0.000008536774,0.000029515757,0.000001084033,0.0011573532,0.9551902,0.0007755404,0.021122776,0.02007655,0.0016195469],"study_design_scores_gemma":[0.00014259561,0.0000139233125,0.00026413662,0.000021331876,0.0000027627339,0.000010324136,0.0001848547,0.94945425,0.00066840596,0.00007045252,0.04909141,0.00007557734],"about_ca_topic_score_codex":0.0066884994,"about_ca_topic_score_gemma":0.17391132,"teacher_disagreement_score":0.8988087,"about_ca_system_score_codex":0.0006844269,"about_ca_system_score_gemma":0.0005477849,"threshold_uncertainty_score":0.99992603},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78094715,0.0005260636,0.14990751,0.046063066,0.0007087584,0.0025533328,0.000043730015,0.00022269035,0.019027714],"genre_scores_gemma":[0.9842213,0.00003392216,0.011845443,0.002476071,0.00036852979,0.00012374263,0.00012508832,0.00003106879,0.0007748583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977509,0.00017081831,0.0004450721,0.00057189487,0.0005701563,0.0004911892],"domain_scores_gemma":[0.99824315,0.00049266755,0.000034589368,0.00041091864,0.0007552764,0.00006337886],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013113603,0.00019734065,0.00026715442,0.0007956217,0.0010571835,0.0015642983,0.0002402843,0.000043412874,0.00053969875],"category_scores_gemma":[0.00087576674,0.00018642537,0.00004650644,0.0012704524,0.00018240263,0.0010220045,0.00084507535,0.00043038567,0.000085862666],"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.00026016097,0.0014177084,0.067365505,0.0002745299,0.00034497087,0.000983404,0.0030229047,0.123226166,0.0011541367,0.6790202,0.07228019,0.050650086],"study_design_scores_gemma":[0.004573146,0.00008437685,0.047684554,0.0006428624,0.000031667256,0.000038583177,0.0058224774,0.91160524,0.00007168778,0.0018124202,0.02701516,0.00061784795],"about_ca_topic_score_codex":0.0012524478,"about_ca_topic_score_gemma":0.01086828,"teacher_disagreement_score":0.7883791,"about_ca_system_score_codex":0.00012758597,"about_ca_system_score_gemma":0.00023516297,"threshold_uncertainty_score":0.9994722},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864466,0.000028524177,0.011257237,0.00086097204,0.00010157346,0.0004722695,0.0002101888,0.00011503494,0.00050756306],"genre_scores_gemma":[0.99768144,0.0000023759603,0.0017223617,0.00006157091,0.000036923586,0.0002692864,0.00019765452,0.000015278501,0.000013081965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907625,0.00010494187,0.00026810387,0.00015226094,0.00025535023,0.000143119],"domain_scores_gemma":[0.9996222,0.000087311746,0.000014557705,0.0001594255,0.000082174076,0.00003431291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038148995,0.00007234207,0.000114568924,0.00025171036,0.0009049015,0.000040551025,0.00014431616,0.000026063786,0.000029424218],"category_scores_gemma":[0.0000037144455,0.000086135056,0.000023373657,0.00046668618,0.00005636049,0.00007402123,0.00005925853,0.0003085222,0.0000073814535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020401174,0.000122708,0.00059578964,0.00012929196,0.00006176722,0.0000020156103,0.005557144,0.8934426,0.05164393,0.04357332,0.0007192416,0.0041318224],"study_design_scores_gemma":[0.0018347336,0.0001297448,0.0373932,0.000032276293,0.000024164106,0.00002054479,0.012963226,0.9433419,0.0015861121,0.000073300456,0.0022795165,0.00032125396],"about_ca_topic_score_codex":0.000067811496,"about_ca_topic_score_gemma":0.000056653116,"teacher_disagreement_score":0.05005782,"about_ca_system_score_codex":0.00021348425,"about_ca_system_score_gemma":0.000052801443,"threshold_uncertainty_score":0.6959862},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015616358,0.0016280174,0.99261314,0.0015208727,0.00025403616,0.0015283324,0.0004672385,0.00023623301,0.00019049006],"genre_scores_gemma":[0.055244777,0.00019871783,0.94170094,0.00022119957,0.00013489868,0.0011268439,0.00064347906,0.00006677947,0.0006623681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976726,0.00035326843,0.00039992578,0.00044735128,0.0004279778,0.0006988739],"domain_scores_gemma":[0.99881876,0.0002717994,0.000020581561,0.00027442796,0.0003289435,0.0002855149],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015207643,0.00019578615,0.00028147333,0.00040358875,0.00210073,0.00030392315,0.00027056743,0.000046957586,0.00014524005],"category_scores_gemma":[0.00006260841,0.0002177099,0.000055326174,0.0007892472,0.000107601925,0.00021356245,0.00030296805,0.0007503305,0.000005140531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073408078,0.00008204713,0.000025697,0.00006198818,0.000083286846,0.000004365409,0.00084089296,0.980453,0.00009911109,0.007472126,0.0007977683,0.010072373],"study_design_scores_gemma":[0.0012350373,0.00021554953,0.000027890692,0.0000487514,0.00000659105,0.00005515851,0.00042974512,0.9960171,0.00003678636,0.00062297925,0.0010909156,0.00021351538],"about_ca_topic_score_codex":0.000219976,"about_ca_topic_score_gemma":0.000037315196,"teacher_disagreement_score":0.053683143,"about_ca_system_score_codex":0.00031608393,"about_ca_system_score_gemma":0.0004303424,"threshold_uncertainty_score":0.9991984},"labels":[],"label_agreement":null},{"id":"W4214807431","doi":"10.1016/j.cor.2022.105761","title":"The doubly open park-and-loop routing problem","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Canada First Research Excellence Fund","keywords":"Vehicle routing problem; Computer science; Routing (electronic design automation); Heuristic; Extension (predicate logic); Mathematical optimization; Set (abstract data type); Quality (philosophy); Loop (graph theory); Operations research; Mathematics; Artificial intelligence; Computer network","score_opus":0.0847938384632459,"score_gpt":0.38310976878355396,"score_spread":0.29831593032030806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214807431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113904774,0.001401599,0.84199023,0.011671273,0.0013426968,0.004425694,0.0000306015,0.000891478,0.02434163],"genre_scores_gemma":[0.7912988,0.00012530196,0.20454498,0.0001262617,0.00013931013,0.0007695992,0.000030640524,0.00007141295,0.0028936777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978627,0.0007954429,0.00025840325,0.00024619757,0.00042280377,0.00041447816],"domain_scores_gemma":[0.9988163,0.00053612853,0.000009978022,0.00038344745,0.00016443519,0.00008972747],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0041934354,0.000098539385,0.000114185146,0.00012605128,0.00355897,0.0012305271,0.0009523021,0.000026814787,0.0000613124],"category_scores_gemma":[0.000107286796,0.0000871799,0.000022874812,0.000803818,0.00009124951,0.00021782135,0.0016050108,0.0006541932,0.000016495935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043468417,0.000012679744,0.00010661083,0.0000062170616,0.000020773787,0.0000024181957,0.0007997155,0.9589892,0.0002864212,0.007988343,0.0046419953,0.027141264],"study_design_scores_gemma":[0.00027074837,0.00004157581,0.00015556277,0.0000087108665,0.0000023169548,0.0000139421645,0.00042329112,0.979722,0.00013568303,0.00011592328,0.019001175,0.00010904921],"about_ca_topic_score_codex":0.00010340384,"about_ca_topic_score_gemma":0.000038452847,"teacher_disagreement_score":0.67739403,"about_ca_system_score_codex":0.0001744168,"about_ca_system_score_gemma":0.00010888023,"threshold_uncertainty_score":0.9998063},"labels":[],"label_agreement":null},{"id":"W4280615951","doi":"10.1016/j.cor.2022.105870","title":"Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Vehicle routing problem; Piecewise linear function; Computer science; Routing (electronic design automation); Mathematical optimization; Piecewise; Operations research; Mathematics; Computer network","score_opus":0.041906010411408796,"score_gpt":0.3142522808123648,"score_spread":0.272346270400956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280615951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301622,0.00067216007,0.7921162,0.002100418,0.000063530395,0.0015660303,0.000030509565,0.00028222607,0.00015269895],"genre_scores_gemma":[0.7991824,0.0001688949,0.19947092,0.00009436543,0.000085169915,0.00054335804,0.00004490151,0.00008289694,0.00032709606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809855,0.0004545001,0.0002714067,0.0003501338,0.0003384134,0.00048702167],"domain_scores_gemma":[0.9978658,0.0014970733,0.000024586418,0.00023096033,0.00027554733,0.000106043226],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026598582,0.0001571313,0.00017816384,0.00033512723,0.0025490033,0.00033181492,0.000204068,0.00004074173,0.000018786584],"category_scores_gemma":[0.00019380078,0.00014021804,0.000020334937,0.0012807583,0.00008753774,0.00025428543,0.00017732987,0.00065268326,0.0000026907592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019377567,0.000015811069,0.00015144328,0.00004494884,0.00006660359,0.0000014523476,0.0033704303,0.96737593,0.012593458,0.0011116385,0.00026845833,0.014980466],"study_design_scores_gemma":[0.0006119982,0.000117762065,0.00023091452,0.000032472362,0.000017307964,0.00003344457,0.0004263183,0.9968584,0.00079088256,0.0000693229,0.00064044655,0.00017068618],"about_ca_topic_score_codex":0.00005612512,"about_ca_topic_score_gemma":0.000012338303,"teacher_disagreement_score":0.5961662,"about_ca_system_score_codex":0.00016314517,"about_ca_system_score_gemma":0.00010406414,"threshold_uncertainty_score":0.99874955},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85731494,0.00065235246,0.10827837,0.030091824,0.00048679623,0.001329945,0.000056571313,0.00025116917,0.0015380386],"genre_scores_gemma":[0.9965705,0.00002401975,0.00028273655,0.0012937485,0.0001558126,0.00019849387,0.00049293094,0.000009845319,0.0009718821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857515,0.00008405524,0.00017907606,0.00030865535,0.00055907073,0.00029398335],"domain_scores_gemma":[0.9994691,0.000047764566,0.000010980219,0.0002118944,0.00021688204,0.000043395103],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010772295,0.00010623708,0.00010676402,0.00030957325,0.0026668245,0.00063928,0.00024468845,0.000017551645,0.00045731227],"category_scores_gemma":[0.00014161711,0.00010094596,0.000019958161,0.0007324031,0.00017652831,0.00057541934,0.0006037348,0.00023081411,0.000026525428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008692788,0.00008670442,0.011486579,0.0002446517,0.000040604187,0.000017844635,0.0011062041,0.8313437,0.000029357861,0.07817611,0.07554193,0.0018393886],"study_design_scores_gemma":[0.0007338983,0.000087445194,0.0106473025,0.000022903061,0.00001591874,0.00000753071,0.008644178,0.54370147,0.000005979068,0.0004861764,0.43538368,0.00026349974],"about_ca_topic_score_codex":0.003921548,"about_ca_topic_score_gemma":0.0009351318,"teacher_disagreement_score":0.35984176,"about_ca_system_score_codex":0.00019356252,"about_ca_system_score_gemma":0.00015269312,"threshold_uncertainty_score":0.9986316},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734693,0.00020023108,0.020040136,0.0033135577,0.0001823356,0.00096902746,0.00007631162,0.00020622516,0.0015428533],"genre_scores_gemma":[0.996813,0.000035915444,0.002231086,0.000059058588,0.000027950271,0.0004410747,0.00007533209,0.000017318871,0.00029927387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906516,0.000098484445,0.0001638911,0.00013724041,0.00031328842,0.00022195055],"domain_scores_gemma":[0.999444,0.00012184741,0.000004720698,0.00025246662,0.00011965816,0.000057325993],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005032055,0.00007133815,0.00007052137,0.00011434369,0.0016033539,0.0001918868,0.00019702245,0.000015311562,0.000029446066],"category_scores_gemma":[0.000006709274,0.00005575262,0.000012609326,0.0006112934,0.00014017436,0.00010149915,0.00006360091,0.00039725663,0.0000038664703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020665726,0.000060118837,0.0023287672,0.000026990298,0.00007323197,0.000010425916,0.0029856476,0.92578834,0.0013270107,0.045783684,0.00928246,0.01231268],"study_design_scores_gemma":[0.0014598739,0.0003806292,0.034451447,0.000028030196,0.000016977194,0.00004794533,0.0018582944,0.5133071,0.0010545502,0.00058180024,0.4463809,0.0004324462],"about_ca_topic_score_codex":0.000086457396,"about_ca_topic_score_gemma":0.00081381266,"teacher_disagreement_score":0.43709844,"about_ca_system_score_codex":0.00007076957,"about_ca_system_score_gemma":0.000064014304,"threshold_uncertainty_score":0.99969643},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086145066,0.00022894048,0.91039175,0.0013988606,0.0003116604,0.0010316384,0.000033063872,0.000030531406,0.00042848673],"genre_scores_gemma":[0.9867304,0.000054632597,0.011293361,0.00015003026,0.000052912073,0.0001990105,0.00005241567,0.000017525035,0.0014496901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942666,0.0020383531,0.0005146943,0.00047157163,0.0023881309,0.00032063885],"domain_scores_gemma":[0.99607646,0.0011111811,0.00007234017,0.0007132902,0.0019039544,0.0001227527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005226346,0.00011483901,0.00024295048,0.0006288311,0.0012478771,0.000489335,0.0010298752,0.000040864466,0.00030238164],"category_scores_gemma":[0.000119905046,0.00008660093,0.00003912125,0.0036644714,0.00012708141,0.00036147694,0.00040594372,0.00030900244,0.000047560363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000673846,0.00007925039,0.00031018394,0.0000042909887,0.000022777682,0.000005828503,0.0008770834,0.9871734,0.000120068726,0.0014113493,0.009344359,0.00058404636],"study_design_scores_gemma":[0.00040940265,0.0003150909,0.00042802718,0.000012388276,0.0000055070946,0.000021068574,0.004879577,0.9913039,0.000055111017,0.00015995961,0.0023024403,0.0001074941],"about_ca_topic_score_codex":0.0015865049,"about_ca_topic_score_gemma":0.0002692837,"teacher_disagreement_score":0.90058535,"about_ca_system_score_codex":0.00015663252,"about_ca_system_score_gemma":0.000654338,"threshold_uncertainty_score":0.9597788},"labels":[],"label_agreement":null},{"id":"W4288061053","doi":"10.1016/j.cor.2022.105974","title":"Trip planning for visitors in a service system with capacity constraints","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China; Zhejiang Office of Philosophy and Social Science","keywords":"Computer science; Capacity planning; Operations research; Service (business); Operations management; Business; Mathematical optimization; Mathematics; Marketing; Economics","score_opus":0.09284608348410901,"score_gpt":0.3549047532957981,"score_spread":0.2620586698116891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288061053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25533885,0.000029149625,0.7427978,0.00017016866,0.00021422766,0.00072209403,0.000029152745,0.00019143455,0.00050713617],"genre_scores_gemma":[0.8573592,4.4490224e-7,0.14207083,0.00003095966,0.000060345057,0.00039139306,0.000028669034,0.000029419665,0.00002875397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984485,0.00041611283,0.00022195143,0.0002208566,0.00034720046,0.00034540787],"domain_scores_gemma":[0.99913836,0.0003454607,0.0000087831795,0.00021401588,0.00022012657,0.00007323868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016368454,0.000098180884,0.00015315971,0.00040142983,0.0005886718,0.00013543974,0.00027666477,0.00003495975,0.000019859279],"category_scores_gemma":[0.000041657313,0.000105731604,0.000020148105,0.0011641893,0.000047389123,0.00011666794,0.000096914024,0.00044559085,0.000003813807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001430281,0.00001774437,0.0003323726,0.00009816483,0.000017014692,0.000008167689,0.0020814885,0.9944792,0.00036600832,0.0012974095,0.00029132847,0.0009968444],"study_design_scores_gemma":[0.00067781284,0.00007125622,0.00031428423,0.000062586616,0.0000021943247,0.000027229773,0.0020299407,0.99607384,0.00019149615,0.0000034021796,0.000429996,0.00011595805],"about_ca_topic_score_codex":0.00008375702,"about_ca_topic_score_gemma":0.000043321146,"teacher_disagreement_score":0.6020203,"about_ca_system_score_codex":0.00047992988,"about_ca_system_score_gemma":0.00011617797,"threshold_uncertainty_score":0.45276472},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14609553,0.000025919886,0.84809613,0.0032145327,0.00052741705,0.0017805141,0.00005332967,0.000049288574,0.00015732246],"genre_scores_gemma":[0.9780442,0.000009776996,0.019866627,0.00019770113,0.00043173978,0.0010401738,0.00013036832,0.000018774264,0.00026061098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99632037,0.001372506,0.00037188767,0.0005701764,0.0011078214,0.000257235],"domain_scores_gemma":[0.9968552,0.0016440802,0.00007414466,0.00058540085,0.00074026274,0.00010092445],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008016463,0.000117365635,0.00015769733,0.00029808778,0.0045549036,0.0016394089,0.00069718936,0.000043952034,0.00014830954],"category_scores_gemma":[0.00026068557,0.0000776191,0.000029733083,0.0011255115,0.00017390799,0.00048701675,0.00018653995,0.00027277807,0.000009296415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019512758,0.00016272103,0.00007379909,0.0000029452508,0.000019516192,5.95706e-7,0.0009370893,0.60733926,0.00600951,0.3584781,0.0024575947,0.024323702],"study_design_scores_gemma":[0.0009288107,0.0008607788,0.00055598916,0.000005891082,0.000011627678,0.000011985962,0.0010955355,0.944443,0.0018451734,0.009466388,0.040622775,0.000152038],"about_ca_topic_score_codex":0.00021578136,"about_ca_topic_score_gemma":0.00011724617,"teacher_disagreement_score":0.8319487,"about_ca_system_score_codex":0.00011564214,"about_ca_system_score_gemma":0.00020705009,"threshold_uncertainty_score":0.999397},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4345732,0.00014008884,0.54347324,0.015069553,0.0005519257,0.0058273654,0.00010448265,0.00010934292,0.0001508138],"genre_scores_gemma":[0.70012695,0.000005943161,0.29314023,0.0006961302,0.00021118109,0.00514071,0.00045502404,0.000031334414,0.00019247964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99503964,0.0025000246,0.00075928477,0.0005475931,0.0005634277,0.0005900423],"domain_scores_gemma":[0.9955988,0.002180276,0.00006802917,0.000339523,0.0016342578,0.00017910867],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004039115,0.0001399107,0.0002133081,0.0004278969,0.011842267,0.00017113466,0.00016954694,0.000094306015,0.00013866628],"category_scores_gemma":[0.0014123289,0.00015259562,0.000048351165,0.0008035332,0.00009378594,0.00018906489,0.00022137511,0.00085191673,0.000012726074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004696397,0.00015375149,0.0013281944,0.0001475898,0.000012774539,0.0000012094575,0.010525401,0.963775,0.00056467275,0.013928483,0.0035939803,0.005921981],"study_design_scores_gemma":[0.0008603483,0.0007773417,0.00020535795,0.00007196061,0.0000065041313,0.0000015025223,0.0055676117,0.9871058,0.000012881292,0.00012502652,0.0051135994,0.00015207239],"about_ca_topic_score_codex":0.0005799249,"about_ca_topic_score_gemma":0.00053693214,"teacher_disagreement_score":0.26555377,"about_ca_system_score_codex":0.0006555033,"about_ca_system_score_gemma":0.0018038925,"threshold_uncertainty_score":0.9894442},"labels":[],"label_agreement":null},{"id":"W4294724286","doi":"10.1016/j.cor.2022.106015","title":"A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Drone; Computer science; Pickup; Payload (computing); Truck; Last mile (transportation); TRIPS architecture; Mile; Operations research; Real-time computing; Engineering; Artificial intelligence; Computer security; Network packet; Automotive engineering; Geography","score_opus":0.08399262146980647,"score_gpt":0.3299644542793425,"score_spread":0.24597183280953605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294724286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23773183,0.00021583647,0.7594631,0.0006190928,0.000099822806,0.0011467687,0.000029338888,0.00033704378,0.0003571591],"genre_scores_gemma":[0.4367903,0.000029874833,0.56201684,0.00007355472,0.000053942065,0.00036485546,0.000051880255,0.00006120335,0.00055754045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974123,0.00059902616,0.00032067165,0.0004552734,0.0006874725,0.00052523945],"domain_scores_gemma":[0.99874824,0.0002322554,0.000014731373,0.000432174,0.00032855352,0.00024402597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629156,0.00018060778,0.0002576838,0.00058528647,0.0010703505,0.0003283189,0.00037245674,0.00005613844,0.00012784005],"category_scores_gemma":[0.000055393913,0.00020394227,0.000030058543,0.0015112795,0.00008979567,0.00022470395,0.00051090604,0.0006949865,0.000034313507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033922486,0.00017518151,0.00029311783,0.000050374972,0.000079622085,0.000011376551,0.0015509299,0.97347426,0.0072598876,0.00019013685,0.000968282,0.015912877],"study_design_scores_gemma":[0.001377443,0.00035296555,0.0033734983,0.000057954916,0.000013706773,0.000027450353,0.00030847907,0.9918335,0.00060820015,0.000007385732,0.001762138,0.00027728686],"about_ca_topic_score_codex":0.00011272511,"about_ca_topic_score_gemma":0.00018095715,"teacher_disagreement_score":0.19905844,"about_ca_system_score_codex":0.00036224505,"about_ca_system_score_gemma":0.00015705307,"threshold_uncertainty_score":0.8316524},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98487484,0.00026795614,0.011385487,0.00071097794,0.00022181847,0.0005502319,0.0000050287936,0.00018348717,0.0018001733],"genre_scores_gemma":[0.9171675,0.0000062155555,0.08238374,0.000051267634,0.000060196173,0.00009145312,0.00002493462,0.000026537873,0.00018818655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986752,0.00018244375,0.00025288595,0.00022892287,0.00033391206,0.00032663604],"domain_scores_gemma":[0.9995493,0.00011144303,0.000008838921,0.00015328403,0.00010086794,0.000076226905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011174323,0.00009475601,0.000108817425,0.00040159273,0.00064376666,0.00017719848,0.00017355061,0.000047743146,0.00010825263],"category_scores_gemma":[0.000047669328,0.00010931118,0.000015319458,0.0007804681,0.000040827206,0.00014837168,0.0004502454,0.001244038,0.0000062485574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017942572,0.000023972374,0.003869688,0.000021467842,0.000007989747,0.0000051204765,0.00063710706,0.9897323,0.0008186093,0.0009554173,0.00017116588,0.0037553401],"study_design_scores_gemma":[0.0004064482,0.0000260716,0.00074230204,0.000051561707,9.786928e-7,0.000015730091,0.00017153019,0.99764025,0.00011242944,0.00003920084,0.0006797814,0.00011372972],"about_ca_topic_score_codex":0.00007312559,"about_ca_topic_score_gemma":0.000025584077,"teacher_disagreement_score":0.070998244,"about_ca_system_score_codex":0.00013260159,"about_ca_system_score_gemma":0.00007327152,"threshold_uncertainty_score":0.54047954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036982924,0.00002840275,0.9545218,0.005802424,0.000102896374,0.002225518,0.000069028705,0.000080463746,0.0001865978],"genre_scores_gemma":[0.9343947,0.0000036441756,0.06240585,0.00018385294,0.00018743852,0.0014582248,0.00028741398,0.000026152491,0.0010527251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521273,0.00084120466,0.0007835287,0.0007212615,0.0019607516,0.00048051134],"domain_scores_gemma":[0.99457234,0.0027956553,0.000054412354,0.0007645896,0.0016808843,0.00013210774],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.006393454,0.00013910263,0.00021201382,0.0023439534,0.0018671233,0.00062581495,0.0010525174,0.00007044962,0.0003796099],"category_scores_gemma":[0.001805728,0.00014366045,0.00008587471,0.0049774237,0.00012705057,0.00048292003,0.00054999534,0.000433506,0.000044658624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003841296,0.0001553507,0.00005123592,0.0000018842891,0.00000405659,4.1020772e-7,0.0008579844,0.9700765,0.00016102518,0.01581102,0.0013959116,0.011446206],"study_design_scores_gemma":[0.00053026224,0.00017208974,0.000376244,0.000005163818,0.0000018733335,0.0000022955603,0.0007914755,0.99235576,0.000078076104,0.001795068,0.003750712,0.00014095841],"about_ca_topic_score_codex":0.00029880996,"about_ca_topic_score_gemma":0.00005299474,"teacher_disagreement_score":0.89741176,"about_ca_system_score_codex":0.00062400225,"about_ca_system_score_gemma":0.000675512,"threshold_uncertainty_score":0.9994323},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8943536,0.00006687621,0.10404884,0.00017555215,0.0004222873,0.00057346333,0.000046182737,0.00021342996,0.000099717996],"genre_scores_gemma":[0.94640785,0.000007297915,0.053112045,0.000048049504,0.00011389676,0.00013610469,0.00009112488,0.000030830844,0.000052767507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981745,0.00040816117,0.00033249322,0.00019286224,0.00057568576,0.00031628332],"domain_scores_gemma":[0.9988985,0.00033256976,0.00001566751,0.0004433482,0.00022042141,0.00008947759],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008654342,0.00014354641,0.0001397377,0.00025882787,0.0019672294,0.00054332375,0.0004265502,0.00007318977,0.00040250525],"category_scores_gemma":[0.000081701786,0.00012932264,0.00003769281,0.0010904653,0.00006035367,0.0003872676,0.00034097568,0.0012378424,0.000086664004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004588978,0.00005195017,0.00010383308,0.0000031514337,0.00005731779,0.00010988476,0.0052488297,0.99210274,0.00012684257,0.000011887656,0.00011066656,0.0020683126],"study_design_scores_gemma":[0.00042138845,0.000056044635,0.00012347492,0.000011880078,0.000013760157,0.00021598661,0.018924514,0.9800354,0.000009632553,0.0000040465393,0.00004356949,0.0001402748],"about_ca_topic_score_codex":0.0008869244,"about_ca_topic_score_gemma":0.000066257846,"teacher_disagreement_score":0.052054234,"about_ca_system_score_codex":0.00031834404,"about_ca_system_score_gemma":0.00019589037,"threshold_uncertainty_score":0.9993321},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9602708,0.00013523757,0.03172183,0.006027861,0.00066721434,0.00021561858,0.00006506361,0.000098650184,0.00079772796],"genre_scores_gemma":[0.9914082,0.00009232313,0.005965304,0.0005095437,0.0004436691,0.00043898716,0.0001975362,0.000068782305,0.0008756189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99389637,0.000487801,0.0010077268,0.0009941361,0.002603258,0.0010107026],"domain_scores_gemma":[0.99160635,0.005812004,0.0001520392,0.001705363,0.00048598458,0.00023826324],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009421828,0.00025312687,0.0002699961,0.0009450504,0.002394143,0.0021182687,0.0023752418,0.00024792406,0.000051017196],"category_scores_gemma":[0.003897209,0.00022008788,0.00036784352,0.0036950647,0.00076877465,0.00053285254,0.0012650548,0.00077371544,0.0025088107],"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.000075125536,0.00013522494,0.000028935174,0.000026613794,0.00008016968,0.00006535901,0.0017723223,0.0780366,0.00076673547,0.8999871,0.011101099,0.007924726],"study_design_scores_gemma":[0.00043751113,0.00025910905,0.00050419226,0.000093580915,0.00003184326,0.000023549173,0.0009563757,0.98475915,0.00053057424,0.0008915134,0.011305713,0.00020686156],"about_ca_topic_score_codex":0.0007626574,"about_ca_topic_score_gemma":0.0025978596,"teacher_disagreement_score":0.9067226,"about_ca_system_score_codex":0.000049449583,"about_ca_system_score_gemma":0.0009132099,"threshold_uncertainty_score":0.99891764},"labels":[],"label_agreement":null},{"id":"W4320033621","doi":"10.1016/j.cor.2023.106184","title":"The road train optimization problem with load assignment","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Truck; Solver; Computer science; Train; Iterated local search; Computation; Vehicle routing problem; Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Iterated function; Trailer; Optimization problem; Algorithm; Local search (optimization); Mathematics; Automotive engineering; Computer network; Engineering","score_opus":0.055466430265227865,"score_gpt":0.34737811217694564,"score_spread":0.2919116819117178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320033621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034783443,0.00007500246,0.9907748,0.0017394925,0.00015805854,0.00066599646,0.000003791887,0.0006159165,0.0024885614],"genre_scores_gemma":[0.24537304,0.00039449846,0.74937594,0.00005944748,0.00027317888,0.00065086276,0.000104588944,0.0001394403,0.003628998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799705,0.00037985595,0.00023187202,0.00022789124,0.00069487066,0.00046846227],"domain_scores_gemma":[0.9988287,0.00030608656,0.000008474155,0.00037023018,0.00038900448,0.00009747302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023670825,0.00012093385,0.00010303495,0.0001938309,0.00095630385,0.0005346415,0.0003461253,0.000056827226,0.000026213584],"category_scores_gemma":[0.000096619944,0.00008919099,0.000025232392,0.0016920104,0.000116539435,0.00018062728,0.00009375861,0.00033033165,0.00010523528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041557005,0.000010275889,0.000013893907,0.000010805713,0.000026187963,0.0000047741596,0.00064279774,0.9674841,0.00017995984,0.00054866815,0.0046347985,0.026439589],"study_design_scores_gemma":[0.00025750714,0.000054923716,0.00017701295,0.000029815981,0.0000028391416,0.0000054597613,0.00020385097,0.9964026,0.00025953163,0.00001992975,0.0024726924,0.00011381093],"about_ca_topic_score_codex":0.000022768272,"about_ca_topic_score_gemma":0.0000438316,"teacher_disagreement_score":0.24189469,"about_ca_system_score_codex":0.0002734358,"about_ca_system_score_gemma":0.00016763114,"threshold_uncertainty_score":0.7355213},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029055353,0.00019357652,0.9675282,0.0010435898,0.00040347714,0.00092505116,0.000033826895,0.0004030299,0.0004138635],"genre_scores_gemma":[0.7926197,0.0014612619,0.19541976,0.0002239078,0.0006610566,0.0011896812,0.0008588486,0.00019162236,0.007374146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860245,0.000057837453,0.0002274417,0.0003046315,0.00024240077,0.0005652316],"domain_scores_gemma":[0.99905473,0.00021142847,0.000007307012,0.00024624492,0.000354273,0.0001260321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094659516,0.000117370495,0.00014554898,0.00025323062,0.000527071,0.0001535105,0.00017545586,0.00008177019,0.000011409893],"category_scores_gemma":[0.00016872436,0.00011006463,0.00003918334,0.0008748429,0.000060443548,0.00023828092,0.000108807304,0.00025213888,0.00003641651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070966375,0.000022811057,0.00007567529,0.00011981734,0.000014065504,0.0000018248503,0.001850947,0.9708573,0.0010992489,0.0010978181,0.021363853,0.0034894978],"study_design_scores_gemma":[0.00046043523,0.000052745017,0.00046525808,0.00013698003,0.000002184229,0.0000032522548,0.00029952292,0.962946,0.0002799173,0.00024512078,0.034983505,0.00012507083],"about_ca_topic_score_codex":0.000012383338,"about_ca_topic_score_gemma":0.0000115508465,"teacher_disagreement_score":0.7721085,"about_ca_system_score_codex":0.00008560297,"about_ca_system_score_gemma":0.000043943553,"threshold_uncertainty_score":0.44883054},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2337692,0.000052232223,0.75852793,0.0043200264,0.000604423,0.00050903735,0.000017849408,0.00021693516,0.0019823655],"genre_scores_gemma":[0.991283,0.00014977729,0.005278856,0.00011966525,0.00020263171,0.000060175047,0.00008445971,0.000017699254,0.0028037243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995243,0.0009925432,0.00053828437,0.0005462711,0.00224522,0.00043469697],"domain_scores_gemma":[0.99481374,0.0022796837,0.000048834958,0.0008198272,0.001869278,0.00016861988],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007899055,0.00011133497,0.00016490693,0.0017120705,0.00142931,0.0014526034,0.00096298265,0.0000927515,0.00024963522],"category_scores_gemma":[0.0036073164,0.000092620896,0.00008161207,0.006460799,0.00016674392,0.0004939954,0.00016853045,0.0004021606,0.0031477623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070758447,0.000032297252,0.014707819,7.811266e-7,0.0000057117322,0.000005538906,0.00048900454,0.8501717,0.000053722662,0.0010110352,0.031100007,0.10241532],"study_design_scores_gemma":[0.00024389717,0.000041211577,0.04575543,0.000008564701,0.0000018964,0.0000010275166,0.00032185158,0.9360413,0.000203939,0.001256677,0.016021673,0.00010251069],"about_ca_topic_score_codex":0.00028746173,"about_ca_topic_score_gemma":0.00031454477,"teacher_disagreement_score":0.7575138,"about_ca_system_score_codex":0.000071925366,"about_ca_system_score_gemma":0.00046318752,"threshold_uncertainty_score":0.9998707},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74819124,0.000065400876,0.24458781,0.0035618239,0.0004118669,0.0004478208,0.0000634296,0.00016453527,0.0025060596],"genre_scores_gemma":[0.9451654,0.00011696412,0.052273095,0.000496892,0.00031029317,0.0007584992,0.0006235808,0.000060642265,0.00019466582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945896,0.00046136978,0.00086683204,0.0010008394,0.002297374,0.0007839701],"domain_scores_gemma":[0.9961509,0.0013725499,0.00015839085,0.0013736571,0.0006146444,0.00032985603],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005662949,0.00026166035,0.00022245805,0.0005264123,0.002137182,0.0019274176,0.0014308799,0.00028251248,0.00004989253],"category_scores_gemma":[0.00057605153,0.0002259979,0.00026860178,0.0026045411,0.0004584681,0.00070645893,0.0007609519,0.00063877413,0.001659646],"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.00013322668,0.00016265128,0.000017882086,0.000018860832,0.000033801025,0.000015107849,0.00122334,0.37929294,0.00013778813,0.61007416,0.005162778,0.0037274377],"study_design_scores_gemma":[0.00052556535,0.0002988573,0.00030314445,0.0000470342,0.0000240504,0.000026686634,0.0012140753,0.9918132,0.00060338044,0.0010327756,0.003888292,0.00022297895],"about_ca_topic_score_codex":0.0005938347,"about_ca_topic_score_gemma":0.00046217442,"teacher_disagreement_score":0.6125202,"about_ca_system_score_codex":0.00005200416,"about_ca_system_score_gemma":0.000733796,"threshold_uncertainty_score":0.9991619},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03293707,0.0006401859,0.95725083,0.0043562884,0.00036869413,0.0028208727,0.000085032334,0.0008108566,0.0007301815],"genre_scores_gemma":[0.7802218,0.00036282866,0.21180415,0.0003621195,0.0007672956,0.0010818413,0.00043001518,0.00022698201,0.0047429325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988826,0.00006829652,0.00015840941,0.00023927941,0.0002895879,0.00036180997],"domain_scores_gemma":[0.9989409,0.00054086186,0.000007734284,0.00019672998,0.00021810405,0.00009571268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006566656,0.0001274276,0.00012985994,0.00020382606,0.0006989782,0.00036735288,0.00015512476,0.000031343985,0.000032694603],"category_scores_gemma":[0.000021463891,0.000092697024,0.000025010275,0.0004697822,0.00011504781,0.00015889734,0.000109631124,0.00024729548,0.000070686205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050191265,0.000009040941,0.000019015197,0.000028811004,0.000059987437,0.0000028356521,0.00042115542,0.9581833,0.00047248122,0.00046199042,0.006206934,0.034129463],"study_design_scores_gemma":[0.0005675575,0.00006616695,0.00017737893,0.000056191464,0.000006994237,0.000023207072,0.000015278889,0.9949041,0.0003559034,0.00008052317,0.003619118,0.0001276021],"about_ca_topic_score_codex":0.00002194422,"about_ca_topic_score_gemma":0.000017400362,"teacher_disagreement_score":0.74728477,"about_ca_system_score_codex":0.00003690061,"about_ca_system_score_gemma":0.00005983195,"threshold_uncertainty_score":0.53760463},"labels":[],"label_agreement":null},{"id":"W4377030783","doi":"10.1016/j.cor.2023.106282","title":"The synchronized multi-commodity multi-service Transshipment-Hub Location Problem with cyclic schedules","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Università degli studi di Bergamo; Université du Québec à Montréal","keywords":"Transshipment (information security); Computer science; Context (archaeology); Operations research; Service (business); Port (circuit theory); Flow network; Supply chain; Heuristic; Service provider; Truck; Flexibility (engineering); Mathematical optimization; Business; Mathematics; Computer security","score_opus":0.10521001024260995,"score_gpt":0.37416070598910345,"score_spread":0.2689506957464935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377030783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06853439,0.00018210549,0.92710316,0.0020991988,0.00016287838,0.0010361559,0.000009085121,0.00081115455,0.0000619031],"genre_scores_gemma":[0.5092865,0.0001745481,0.48958886,0.00004302855,0.00008362152,0.0004181864,0.00011623937,0.00007515517,0.00021383462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997569,0.0006390585,0.00033586667,0.00033444818,0.00052213663,0.0005994771],"domain_scores_gemma":[0.99799037,0.0005682578,0.0000149009165,0.00057381677,0.000716919,0.00013571105],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002158787,0.0001890429,0.00017017403,0.00028519347,0.0013985562,0.00055484846,0.0006070143,0.00009580435,0.00001104398],"category_scores_gemma":[0.00012030872,0.00014832622,0.000034076802,0.0027050504,0.000148125,0.00028940712,0.00011636647,0.0005717127,0.000228327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009218568,0.000050369224,0.0001853854,0.00008364825,0.00005102498,0.0000025554348,0.0010643569,0.98674184,0.0011971435,0.00046445295,0.00027194156,0.009878049],"study_design_scores_gemma":[0.0010229265,0.00003441138,0.0028223163,0.00008727446,0.0000071006716,0.000003283403,0.0003407075,0.9936179,0.0011696186,0.000012403867,0.00070348603,0.00017860864],"about_ca_topic_score_codex":0.00010893267,"about_ca_topic_score_gemma":0.0011755879,"teacher_disagreement_score":0.44075212,"about_ca_system_score_codex":0.00022125138,"about_ca_system_score_gemma":0.00017162526,"threshold_uncertainty_score":0.9999015},"labels":[],"label_agreement":null},{"id":"W4379644131","doi":"10.1016/j.cor.2023.106246","title":"Heterogeneous instant delivery orders scheduling and routing problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"National Natural Science Foundation of China","keywords":"Instant; Computer science; Mathematical optimization; Column generation; Scheduling (production processes); Job shop scheduling; Integer programming; Vehicle routing problem; Heuristic; Routing (electronic design automation); Algorithm; Mathematics; Computer network","score_opus":0.0665305166915655,"score_gpt":0.3491616430742612,"score_spread":0.28263112638269566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379644131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65359384,0.00016980866,0.34404588,0.00030344428,0.0001467861,0.0003723637,0.0000042897946,0.0007763301,0.0005872315],"genre_scores_gemma":[0.7827651,0.00018523794,0.21679842,0.000024953682,0.000060446644,0.000037271984,0.000020539324,0.00004314279,0.000064917236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845153,0.00022592966,0.00025485773,0.000274904,0.00031314674,0.00047965502],"domain_scores_gemma":[0.9991585,0.00025412487,0.000006854953,0.00023472439,0.00022371327,0.00012207426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013010076,0.00012404396,0.00013626291,0.00045396242,0.00058088056,0.0003579767,0.00019929522,0.000074581265,0.000012989354],"category_scores_gemma":[0.0001200778,0.00013597439,0.000026895294,0.0013023516,0.00008151685,0.00019502241,0.00022713804,0.00036493177,0.00007328663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017260429,0.000006249894,0.00015130358,0.000034009874,0.000023016508,0.000012906056,0.00063080544,0.981333,0.0026655735,0.000666975,0.00015431656,0.014320102],"study_design_scores_gemma":[0.00020813587,0.000026303824,0.00014069445,0.000055855722,0.0000026284713,0.00001334668,0.00018163922,0.9977626,0.00091500883,0.000030019552,0.00052443054,0.00013934099],"about_ca_topic_score_codex":0.00004461106,"about_ca_topic_score_gemma":0.000029458319,"teacher_disagreement_score":0.12917121,"about_ca_system_score_codex":0.00010195563,"about_ca_system_score_gemma":0.000080644575,"threshold_uncertainty_score":0.55448747},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94208163,0.00012689186,0.039556064,0.013700456,0.0015534976,0.00072346244,0.00009007218,0.00038073552,0.0017871945],"genre_scores_gemma":[0.9918164,0.00008066235,0.002423046,0.0015039765,0.0011270337,0.0012886479,0.0011219301,0.00007466766,0.0005636472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976255,0.00006390474,0.00043522462,0.0004924969,0.00076635624,0.00061649544],"domain_scores_gemma":[0.99865377,0.00035554802,0.000052590705,0.00064700417,0.00022617322,0.00006489468],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016481219,0.00019644148,0.00012565832,0.000364267,0.0014762686,0.00083658646,0.00072000385,0.00012563885,0.00009651238],"category_scores_gemma":[0.00035881664,0.00019483473,0.00017399313,0.0009347579,0.00022058375,0.00049405126,0.00035870136,0.00034472632,0.0024916877],"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.000056475164,0.00010968914,0.000010253697,0.00047017564,0.00009059746,0.000020842266,0.0003473998,0.06903137,0.000098917655,0.8913224,0.03596078,0.002481101],"study_design_scores_gemma":[0.00042369045,0.00006709968,0.00023963806,0.000092090166,0.00004830962,0.000001971857,0.00066251255,0.9565393,0.00004348152,0.00016340388,0.041538443,0.00018005708],"about_ca_topic_score_codex":0.0014430594,"about_ca_topic_score_gemma":0.0025765842,"teacher_disagreement_score":0.891159,"about_ca_system_score_codex":0.000024275789,"about_ca_system_score_gemma":0.00022825511,"threshold_uncertainty_score":0.9998237},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9351015,0.00028601813,0.055619262,0.0042562843,0.00015793022,0.003282726,0.000091603266,0.00091013924,0.00029451732],"genre_scores_gemma":[0.98489577,0.000011937722,0.010234842,0.0000679026,0.0001455834,0.00086803135,0.00017537511,0.0000035302853,0.0035970467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833125,0.00016206832,0.0001829378,0.0003876933,0.00023286692,0.00070318475],"domain_scores_gemma":[0.9985902,0.00062363053,0.000015198147,0.00009016734,0.00059510267,0.0000857356],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011445995,0.00011384449,0.00016125203,0.00011301228,0.0015983061,0.00024842576,0.00038925136,0.00010740258,0.000028098075],"category_scores_gemma":[0.00019535287,0.000052332092,0.000068021334,0.0012249007,0.00014699296,0.000079567784,0.00024781647,0.0002673972,0.00013586393],"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.00013249165,0.0015414695,0.0019994269,0.00015169676,0.0003593533,0.00041634092,0.0029098645,0.22804241,0.06963103,0.0388007,0.032350104,0.6236651],"study_design_scores_gemma":[0.00046232756,0.0004105042,0.011228267,0.000025417537,0.000009146097,0.0000050273648,0.003099018,0.97861755,0.00058715884,0.00039087614,0.0049943477,0.00017037892],"about_ca_topic_score_codex":0.00020939833,"about_ca_topic_score_gemma":0.0001469429,"teacher_disagreement_score":0.7505751,"about_ca_system_score_codex":0.000069422,"about_ca_system_score_gemma":0.0000359457,"threshold_uncertainty_score":0.9997015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019437168,0.00020755244,0.99655086,0.00088491756,0.0004929181,0.0011116182,0.00006071119,0.00045599733,0.000041034364],"genre_scores_gemma":[0.01692991,0.00016831298,0.9795336,0.000057914847,0.00043472083,0.001558047,0.00021741888,0.00008464641,0.0010154244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0000714623,0.0002297686,0.00024210416,0.00036466648,0.00044065135],"domain_scores_gemma":[0.99866563,0.00061605015,0.0000070222063,0.00034883645,0.00025710216,0.00010533692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012613152,0.0001285988,0.00011990383,0.00024494846,0.0007400225,0.00036726543,0.00038015202,0.00006006424,0.000029915436],"category_scores_gemma":[0.00008862211,0.0000997377,0.00005828302,0.0008631168,0.00008177334,0.000090892674,0.00009764911,0.0002806935,0.00026047125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001281961,0.000052934593,0.0000015119222,0.00001375003,0.000044427896,0.000003855689,0.0004836732,0.81098276,0.0001054916,0.00026648265,0.009760212,0.17828363],"study_design_scores_gemma":[0.00081229734,0.00006344163,0.000022079053,0.000023264603,0.000008068532,0.0000025284744,0.00014630334,0.99346834,0.00014936093,0.000074639094,0.0051090093,0.00012063746],"about_ca_topic_score_codex":0.000020690297,"about_ca_topic_score_gemma":0.00002626212,"teacher_disagreement_score":0.18248563,"about_ca_system_score_codex":0.0000965277,"about_ca_system_score_gemma":0.00007050758,"threshold_uncertainty_score":0.569173},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76965773,0.00004546144,0.21907645,0.00739103,0.00041683548,0.0027584445,0.000005441007,0.00018740185,0.0004612231],"genre_scores_gemma":[0.9959568,0.000009349712,0.0015990641,0.00039186366,0.00023657522,0.00088431156,0.00027873134,0.00001627146,0.0006270814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824536,0.00010627674,0.000510649,0.00039364325,0.00042700447,0.00031705873],"domain_scores_gemma":[0.9986691,0.00004084,0.000015775258,0.00059425074,0.0006544325,0.00002560053],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025486716,0.00011168145,0.00013707716,0.00083019433,0.0006774988,0.0003645166,0.00058853644,0.000047429698,0.0000802409],"category_scores_gemma":[0.00025219427,0.00009893552,0.000033350636,0.0037706778,0.00007053193,0.0007163039,0.00034336784,0.0002079772,0.0015488124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079188185,0.00016069351,0.0013245618,0.000040273924,0.0000071967747,6.473181e-7,0.0018433097,0.9844353,0.00063080055,0.002853823,0.0024105522,0.006284915],"study_design_scores_gemma":[0.00023199331,0.00002699594,0.029798385,0.000033710458,0.000003823117,1.7105899e-7,0.003914401,0.9581085,0.000025825333,0.000014665853,0.007737084,0.00010443426],"about_ca_topic_score_codex":0.0038861341,"about_ca_topic_score_gemma":0.00956267,"teacher_disagreement_score":0.22629905,"about_ca_system_score_codex":0.00006970405,"about_ca_system_score_gemma":0.00007621493,"threshold_uncertainty_score":0.9992286},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0829493,0.00006695828,0.91384387,0.0011345067,0.000068677524,0.0014735531,0.000030243486,0.00037153537,0.00006133089],"genre_scores_gemma":[0.9608894,0.000021155542,0.037558768,0.000023830165,0.00003512431,0.0010581885,0.0001384896,0.000032648066,0.00024241603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989497,0.000028869697,0.00021945912,0.00020972028,0.00022274931,0.00036947805],"domain_scores_gemma":[0.99908584,0.00032065783,0.000008573074,0.00020734193,0.00031966742,0.00005789116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078441325,0.00010517909,0.000109238696,0.0002351347,0.000724808,0.00024833242,0.00014801783,0.000041466774,0.0000052533123],"category_scores_gemma":[0.000031360556,0.00007952009,0.00001930201,0.0014764338,0.000101906095,0.00019549513,0.00003086727,0.00022627162,0.000010233787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009804955,0.0000259333,0.00005846717,0.000089849935,0.00006349486,8.5896573e-7,0.0009490185,0.9694193,0.00080663525,0.0069234804,0.0002959758,0.02135717],"study_design_scores_gemma":[0.00043862604,0.00006055131,0.00083371665,0.00005013158,0.000016684753,0.0000025912727,0.00039835833,0.99645597,0.000052729985,0.000045368346,0.001545676,0.00009957977],"about_ca_topic_score_codex":0.000037877307,"about_ca_topic_score_gemma":0.00021915979,"teacher_disagreement_score":0.87794006,"about_ca_system_score_codex":0.000052177413,"about_ca_system_score_gemma":0.000075030875,"threshold_uncertainty_score":0.55747104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019305613,0.00022303987,0.97570086,0.0034432102,0.0001269474,0.0006656595,0.000002386592,0.00019169439,0.00034057396],"genre_scores_gemma":[0.07527752,0.00018717827,0.9238347,0.000086301385,0.000101573445,0.000117973475,0.0000062614613,0.000013948805,0.0003745839],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977408,0.00055417675,0.00024043677,0.0006670927,0.00036837423,0.00042910155],"domain_scores_gemma":[0.998479,0.00045468766,0.000011035876,0.0005382311,0.00032234762,0.00019467062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025788343,0.00013278016,0.00019139715,0.0003208671,0.0006862419,0.00058153353,0.00046924426,0.00007316959,0.000003528839],"category_scores_gemma":[0.00020780868,0.00011472945,0.000024653693,0.0013105792,0.00024709475,0.00045885364,0.0010092604,0.00036493046,0.000020631382],"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.000007849924,0.00011050842,0.00020305584,0.0002201789,0.000031959622,0.000044858043,0.0070239734,0.0051051034,0.0016692624,0.16963686,0.0014360055,0.8145104],"study_design_scores_gemma":[0.00026981314,0.00010177558,0.0010877843,0.0000360098,0.000001941006,0.00002158068,0.000015635056,0.97971624,0.00014086586,0.015627082,0.0028398307,0.0001414557],"about_ca_topic_score_codex":0.00008862493,"about_ca_topic_score_gemma":0.000042742937,"teacher_disagreement_score":0.9746111,"about_ca_system_score_codex":0.00003811564,"about_ca_system_score_gemma":0.0001550784,"threshold_uncertainty_score":0.56077415},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15624166,0.00004497935,0.8386659,0.0011698704,0.0007326983,0.0012059433,0.000023407609,0.001116246,0.00079929526],"genre_scores_gemma":[0.89702827,0.00024800544,0.09922765,0.0000992846,0.000330676,0.0008077213,0.00053283246,0.000085302236,0.0016402289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895746,0.00006921768,0.00017485443,0.00019981728,0.00021790768,0.0003807483],"domain_scores_gemma":[0.9991643,0.00016645447,0.0000032851274,0.00031677683,0.00025267893,0.000096507654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000747894,0.00008482351,0.00010454438,0.00028523055,0.0003434262,0.00020693922,0.00023012365,0.000062043284,0.00003838987],"category_scores_gemma":[0.0001223109,0.000083365725,0.00004125742,0.0007093377,0.00007092412,0.0003405412,0.00004626903,0.0001504939,0.0001767157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001967281,0.000018133536,0.000007503195,0.000057353678,0.000012296497,0.00000119503,0.00071050716,0.95367473,0.00075003004,0.0011332764,0.03208157,0.011551425],"study_design_scores_gemma":[0.00021662415,0.0000697476,0.0001925751,0.000025139023,0.000002410162,9.4253903e-7,0.00024439266,0.99290437,0.00034290645,0.00026365274,0.0056403438,0.00009687891],"about_ca_topic_score_codex":0.000023992006,"about_ca_topic_score_gemma":0.00006060709,"teacher_disagreement_score":0.7407866,"about_ca_system_score_codex":0.00010413242,"about_ca_system_score_gemma":0.000059533795,"threshold_uncertainty_score":0.33995557},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985358,0.00003658218,0.011115179,0.0010560544,0.0002891058,0.00032844386,0.000030770672,0.00053209194,0.0012537434],"genre_scores_gemma":[0.9976182,0.00008665386,0.0016050114,0.00006381737,0.000044276512,0.00009007346,0.00028399238,0.000018511088,0.00018948248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989228,0.00007005619,0.00025664878,0.0001676843,0.00026443534,0.00031832908],"domain_scores_gemma":[0.99936956,0.00011803515,0.0000034807683,0.00024137694,0.00019447728,0.00007305427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000581674,0.000081577375,0.00010064681,0.0008536694,0.00020765739,0.00010367629,0.0001982669,0.00005488305,0.00007815849],"category_scores_gemma":[0.00003878381,0.00009308162,0.000027711973,0.0020513062,0.00007024183,0.00020826334,0.000037115235,0.00034213648,0.00028932653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052455434,0.00007048252,0.0035806259,0.00007105552,0.00003202815,0.00006518761,0.001959554,0.94102186,0.0044443817,0.009416895,0.025726695,0.013606014],"study_design_scores_gemma":[0.00041358062,0.000025122075,0.21118622,0.00006861888,0.0000025332122,0.000003238512,0.0008775118,0.78018796,0.00021895838,0.00021818928,0.0065833493,0.0002147353],"about_ca_topic_score_codex":0.00004516099,"about_ca_topic_score_gemma":0.0009633536,"teacher_disagreement_score":0.20760559,"about_ca_system_score_codex":0.00010207625,"about_ca_system_score_gemma":0.000115083756,"threshold_uncertainty_score":0.37957582},"labels":[],"label_agreement":null},{"id":"W4385840825","doi":"10.1016/j.cor.2023.106385","title":"Enhanced iterated local search for the technician routing and scheduling problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"European Regional Development Fund; Région Hauts-de-France","keywords":"Iterated local search; Computer science; Scheduling (production processes); Operations research; Job shop scheduling; Mathematical optimization; Local optimum; Local search (optimization); Routing (electronic design automation); Engineering; Mathematics; Artificial intelligence; Computer network","score_opus":0.07122862884273742,"score_gpt":0.3804832934992185,"score_spread":0.3092546646564811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385840825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04145518,0.00010509755,0.9556779,0.0010190215,0.00011708769,0.0009031097,0.0000057432258,0.0005431552,0.00017368411],"genre_scores_gemma":[0.8139364,0.0000788278,0.18539108,0.00002561422,0.00013137837,0.0002107043,0.00002720914,0.000044329114,0.00015443887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984639,0.00020794339,0.0002453543,0.00026300517,0.0002995706,0.000520217],"domain_scores_gemma":[0.9982561,0.00097477,0.0000059759054,0.00027092107,0.00041073962,0.000081483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002763325,0.0001146612,0.00012562484,0.00032558464,0.001036845,0.0004548605,0.0002929364,0.00008012244,0.00000721762],"category_scores_gemma":[0.00014452547,0.00009750737,0.000030337242,0.0016244933,0.00014637693,0.00015249173,0.00019187758,0.0004513794,0.000029534838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033582542,0.0000050624194,0.000013641973,0.000038923168,0.000021661159,9.3440553e-7,0.00093558274,0.93236494,0.010061092,0.0015554565,0.00020374445,0.054795597],"study_design_scores_gemma":[0.00023944682,0.00003453472,0.00011902751,0.00006354608,0.0000034708803,0.0000028169698,0.00058172824,0.98790914,0.010658764,0.000027954162,0.00025215605,0.000107438806],"about_ca_topic_score_codex":0.000024418363,"about_ca_topic_score_gemma":0.00001863639,"teacher_disagreement_score":0.7724812,"about_ca_system_score_codex":0.00009677101,"about_ca_system_score_gemma":0.00007575546,"threshold_uncertainty_score":0.7974679},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2634544,0.000054072236,0.7351818,0.00028408784,0.00015076454,0.0004514026,0.000016258937,0.00031084396,0.000096369586],"genre_scores_gemma":[0.9882378,0.000018930037,0.010427618,0.00004503081,0.0002541353,0.00012121859,0.0003718133,0.000031085543,0.00049235474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987187,0.00014485282,0.00018792931,0.0003039974,0.00030593795,0.00033858322],"domain_scores_gemma":[0.9990579,0.00019039863,0.000020507692,0.00028587758,0.00036751217,0.00007780182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038186024,0.000121737765,0.00014207941,0.0004237786,0.0006658932,0.00016135875,0.00021374703,0.00004692056,0.0001536696],"category_scores_gemma":[0.000021843105,0.00012068951,0.00004558312,0.0010020607,0.00008783024,0.0002853867,0.00006996974,0.00041020877,0.0000618766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050979008,0.00011907208,0.0025807633,0.0000030001477,0.0001192501,0.00000794871,0.0014603744,0.8663792,0.026538668,0.0018521152,0.007602182,0.09328647],"study_design_scores_gemma":[0.00049863546,0.00007056599,0.009589592,0.0000212476,0.0000013769599,0.0000010800717,0.00013933456,0.9829424,0.0034721505,0.0005959039,0.0025141763,0.00015354669],"about_ca_topic_score_codex":0.00030339992,"about_ca_topic_score_gemma":0.0000016877879,"teacher_disagreement_score":0.7247834,"about_ca_system_score_codex":0.000103365805,"about_ca_system_score_gemma":0.00007545883,"threshold_uncertainty_score":0.512158},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.618733,0.00001307644,0.3790794,0.00033773296,0.00007864121,0.0005267763,0.00001624032,0.0012032976,0.000011872582],"genre_scores_gemma":[0.73074913,0.00001912325,0.268468,0.00006590696,0.00009400596,0.0001439312,0.00030283758,0.000049138976,0.00010789868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981988,0.00018142279,0.0002392263,0.0004387267,0.00046951222,0.0004723185],"domain_scores_gemma":[0.9989208,0.00007497082,0.000008581302,0.00039195543,0.0002255532,0.00037812872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050817896,0.00017566507,0.00015615414,0.0004083593,0.00043844045,0.0005571896,0.0002801275,0.00008903939,0.000018588597],"category_scores_gemma":[0.000052184438,0.00016145727,0.00001904771,0.0008817888,0.000061531144,0.00038339064,0.00008165777,0.00035081734,0.00014406726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018690373,0.00006556728,0.00053578685,0.000020958174,0.000027277736,0.000012681338,0.0014632378,0.9936047,0.0017301962,0.00031168855,0.000060033028,0.0021491759],"study_design_scores_gemma":[0.0005533181,0.00014884507,0.0067858305,0.000043319353,0.000005613638,0.000008107456,0.00036341714,0.99160033,0.00026798306,0.000010894817,0.0000141784085,0.00019813754],"about_ca_topic_score_codex":0.00015785405,"about_ca_topic_score_gemma":0.00026795638,"teacher_disagreement_score":0.112016186,"about_ca_system_score_codex":0.00011756772,"about_ca_system_score_gemma":0.00007066449,"threshold_uncertainty_score":0.65840364},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019493023,0.0012947071,0.9930924,0.00022528351,0.0003333708,0.0011477331,0.00010116818,0.0011310749,0.00072495575],"genre_scores_gemma":[0.14610302,0.0027325102,0.8470122,0.000018016872,0.00022199172,0.00021539936,0.0034271965,0.00013444292,0.00013520061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967993,0.0006849253,0.0005614164,0.0006664789,0.000634627,0.000653272],"domain_scores_gemma":[0.9963718,0.00041228975,0.000028564877,0.0021289077,0.0008601894,0.0001982215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023228847,0.00024951756,0.00026446575,0.0009548596,0.00079236156,0.00078760704,0.0017099302,0.00014562701,0.0000287947],"category_scores_gemma":[0.00009137147,0.00027632513,0.000042919364,0.0026213012,0.00016551913,0.0017539683,0.0009675289,0.00073951576,0.00052236696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045973798,0.000033611726,0.000009451988,0.000034040317,0.00006461952,0.000008512164,0.0018402966,0.88082135,0.0033788919,0.00008335821,0.00010720051,0.113614075],"study_design_scores_gemma":[0.0002491495,0.000065636676,0.00016165372,0.00011427721,0.000006654494,0.000012346803,0.0010942502,0.9969209,0.00027753977,0.00005478536,0.0007627475,0.00028006296],"about_ca_topic_score_codex":0.00016141366,"about_ca_topic_score_gemma":0.000171993,"teacher_disagreement_score":0.14608018,"about_ca_system_score_codex":0.00040423684,"about_ca_system_score_gemma":0.00015653622,"threshold_uncertainty_score":0.9999689},"labels":[],"label_agreement":null},{"id":"W4386968557","doi":"10.1016/j.cor.2023.106434","title":"Split demand and deliveries in an integrated three-level lot sizing and replenishment problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"Heuristics; Sizing; Computer science; Production (economics); Time horizon; Mathematical optimization; Heuristic; Routing (electronic design automation); Operations research; Holding cost; Mathematics; Economics; Microeconomics","score_opus":0.12825433258663296,"score_gpt":0.375426004235031,"score_spread":0.247171671648398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386968557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7496402,0.00019953738,0.24909087,0.00030345665,0.00005159198,0.00039495784,0.000008944555,0.00023957666,0.00007082673],"genre_scores_gemma":[0.68187207,0.00024728882,0.3176168,0.00001595921,0.0000319277,0.000067732886,0.00004654796,0.00003095894,0.00007073264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987215,0.00022924865,0.00023560849,0.00028648818,0.00020863621,0.00031855816],"domain_scores_gemma":[0.99930453,0.00019877769,0.0000057798666,0.00020965603,0.00017485031,0.00010643126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014897304,0.00011135874,0.00014039647,0.00042976817,0.00027739938,0.00038845246,0.0001329621,0.00006343964,0.0000095534715],"category_scores_gemma":[0.00009248542,0.00011399428,0.000009663684,0.00093784876,0.000104395396,0.00032426935,0.00017683177,0.00029467858,0.000008326482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069222197,0.000016204061,0.0049881637,0.000065972185,0.00001440343,0.00001194543,0.002661964,0.9388124,0.0018565877,0.0008370948,0.0002447264,0.050483666],"study_design_scores_gemma":[0.00027174575,0.000060496484,0.017578987,0.00007369471,0.0000019112526,0.00000607794,0.0004359621,0.980804,0.00034092608,0.000101123296,0.00020675408,0.00011826657],"about_ca_topic_score_codex":0.00015326653,"about_ca_topic_score_gemma":0.00089484476,"teacher_disagreement_score":0.068525925,"about_ca_system_score_codex":0.00008356298,"about_ca_system_score_gemma":0.000046825244,"threshold_uncertainty_score":0.4648552},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013411967,0.00006943497,0.99460167,0.0013933326,0.0004602978,0.0018710339,0.000014185378,0.00015733771,0.00009152175],"genre_scores_gemma":[0.14623302,0.00008606812,0.8516816,0.000120245924,0.0004699863,0.0005979302,0.00029934762,0.00003517546,0.00047665532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493974,0.001689921,0.0006112789,0.00074442395,0.001307076,0.0007075538],"domain_scores_gemma":[0.99423647,0.0034340546,0.00005301372,0.00071722834,0.0013088703,0.0002503802],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.011805767,0.0001611169,0.0002608483,0.0008559383,0.0017363136,0.0013439684,0.0009276517,0.000118849675,0.000059677604],"category_scores_gemma":[0.000605945,0.0001381676,0.00009488734,0.0030717766,0.000112575086,0.0006859943,0.00013863687,0.00024199711,0.00033663673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003744799,0.000053995525,0.000024904253,0.0000020569075,0.000016153093,0.0000022068518,0.0007891833,0.90423495,0.00013755151,0.0034137808,0.03591937,0.055368435],"study_design_scores_gemma":[0.00041388738,0.00044050225,0.00037933674,0.000015431164,0.000006845544,0.000006602108,0.00027221246,0.97936994,0.000028091335,0.017530348,0.0013775073,0.00015928464],"about_ca_topic_score_codex":0.0000794518,"about_ca_topic_score_gemma":0.00012565144,"teacher_disagreement_score":0.14489183,"about_ca_system_score_codex":0.00010137287,"about_ca_system_score_gemma":0.00036183797,"threshold_uncertainty_score":0.99969274},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047776806,0.00010394144,0.9920614,0.001322699,0.00047231143,0.0010353639,0.000030622232,0.00013899826,0.000057019603],"genre_scores_gemma":[0.54198873,0.00004153719,0.45713875,0.000022300015,0.00006493006,0.0001885235,0.000036208414,0.000017331393,0.0005016983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750674,0.0007216912,0.00041182037,0.00050045946,0.00050029677,0.00035899243],"domain_scores_gemma":[0.9968734,0.0011290371,0.00007402807,0.00062487146,0.0012311655,0.000067518515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013435883,0.00011517742,0.00025145113,0.0009077553,0.00040250213,0.00006371957,0.00077224645,0.00007793621,0.000004486259],"category_scores_gemma":[0.00042421333,0.00012270451,0.00009217768,0.0020350015,0.00034559032,0.0005954388,0.00026544483,0.00020370247,0.000025842945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046757195,0.000116634976,0.00027384795,0.000043747277,0.000027455593,0.0000053787394,0.002501421,0.9010072,0.06649228,0.0017677549,0.020581855,0.0071356697],"study_design_scores_gemma":[0.00054831564,0.00042646384,0.0131209735,0.00003419571,0.000004562796,0.0000096734175,0.00026332017,0.9589031,0.025464436,0.00094515865,0.0001786595,0.000101179685],"about_ca_topic_score_codex":0.00031039992,"about_ca_topic_score_gemma":0.000025032588,"teacher_disagreement_score":0.53721106,"about_ca_system_score_codex":0.00031238922,"about_ca_system_score_gemma":0.00046129845,"threshold_uncertainty_score":0.5003745},"labels":[],"label_agreement":null},{"id":"W4389304834","doi":"10.1016/j.cor.2023.106502","title":"A heuristic approach for the integrated production–transportation problem with process flexibility","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Fundo de Apoio ao Ensino, à Pesquisa e Extensão, Universidade Estadual de Campinas; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Flexibility (engineering); Computer science; Mathematical optimization; Sizing; Production (economics); Heuristic; Process (computing); Integer programming; Linear programming; Investment (military); Operations research; Constraint (computer-aided design); Mathematics; Algorithm; Economics; Artificial intelligence","score_opus":0.09606306208765346,"score_gpt":0.3827119897256506,"score_spread":0.28664892763799715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389304834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03854691,0.000038064176,0.95781475,0.0005998554,0.00012215195,0.0020753795,0.00002107483,0.00067049486,0.00011134189],"genre_scores_gemma":[0.6648911,0.000022701915,0.33251244,0.000011096959,0.00012864928,0.0015908707,0.00038686476,0.000052322648,0.0004039125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985407,0.0001668364,0.0002428558,0.0003405124,0.00036574685,0.0003433284],"domain_scores_gemma":[0.9983617,0.00030444263,0.000010332936,0.0003579759,0.0009069663,0.000058560156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018864211,0.00012478119,0.0001232295,0.00022740503,0.000675284,0.00020457387,0.00028482242,0.000053123735,0.0000063711536],"category_scores_gemma":[0.00020477512,0.000087570246,0.000028686043,0.0024418535,0.00014082619,0.00019192585,0.000013372679,0.0003467273,0.000010396048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001828185,0.00003050857,0.000121286284,0.00018436818,0.00003561208,4.7876154e-7,0.0014224483,0.99185926,0.00025765155,0.00030331072,0.001666938,0.0040998543],"study_design_scores_gemma":[0.00020226899,0.000052171574,0.0009975703,0.000030563584,0.000010449878,0.0000025255479,0.0005983669,0.9968494,0.0007301508,0.00006668749,0.00035007333,0.000109725544],"about_ca_topic_score_codex":0.000024965084,"about_ca_topic_score_gemma":0.000056668472,"teacher_disagreement_score":0.6263442,"about_ca_system_score_codex":0.00009008901,"about_ca_system_score_gemma":0.00015116166,"threshold_uncertainty_score":0.5193807},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08227085,0.00007431849,0.9145122,0.00035145076,0.00068918953,0.00078325585,0.000012345813,0.0012412122,0.00006517213],"genre_scores_gemma":[0.47858956,0.000018106055,0.5204873,0.00004631271,0.0003535412,0.00015661177,0.00010440785,0.0000773601,0.00016682221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787915,0.00008475674,0.0004041926,0.00045546365,0.0005303133,0.0006461393],"domain_scores_gemma":[0.9981926,0.00063455035,0.000013910616,0.00045171694,0.0004378516,0.00026936305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000758748,0.00022626868,0.00020825032,0.0010837466,0.0007951758,0.00065005687,0.0003001311,0.00018194255,0.000119399614],"category_scores_gemma":[0.00044984822,0.00025269933,0.00005683402,0.0020251567,0.000046861896,0.00040801283,0.00018023659,0.0006306086,0.00046354055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004212922,0.000015911526,0.000003562554,0.000046960715,0.000033230255,0.00002457057,0.0015661812,0.99549735,0.00022170649,0.00020981385,0.00017375052,0.0022027781],"study_design_scores_gemma":[0.00022334722,0.000041472333,0.000009837457,0.00018329463,0.0000072855773,0.00002150699,0.00045648974,0.9979125,0.0007390667,0.00007660059,0.00005723515,0.00027131525],"about_ca_topic_score_codex":0.00002085853,"about_ca_topic_score_gemma":0.00001158899,"teacher_disagreement_score":0.3963187,"about_ca_system_score_codex":0.00022887622,"about_ca_system_score_gemma":0.00008306422,"threshold_uncertainty_score":0.99999255},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8394412,0.00020016993,0.15918942,0.0002807856,0.00009273817,0.00044378775,0.000076847944,0.00018409498,0.0000909886],"genre_scores_gemma":[0.9958699,0.0000100644365,0.0038622352,0.000007893023,0.00003549832,0.00007515298,0.000109462715,0.000018822104,0.000010992557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988395,0.00006246911,0.00033559237,0.00025068788,0.0003488714,0.00016288989],"domain_scores_gemma":[0.9993838,0.00020556043,0.0000061373084,0.00008506448,0.00024864112,0.000070795664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051983044,0.00011257352,0.00014113284,0.0005072254,0.0002421482,0.0002667151,0.00007388481,0.000043320488,0.000007015293],"category_scores_gemma":[0.000010268706,0.00011101071,0.00002712314,0.00063902815,0.000099196805,0.00027058975,0.000004325207,0.00030772365,0.0000029279688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030810228,0.00047927818,0.007556068,0.0018856234,0.0006111381,0.00006662394,0.091012485,0.6573961,0.009113842,0.13567068,0.000531911,0.09564548],"study_design_scores_gemma":[0.00030646555,0.0001355338,0.047928564,0.0001883518,0.000013071492,0.000005993609,0.0072679906,0.94382644,0.0001301975,0.000029091543,0.00006835569,0.00009992519],"about_ca_topic_score_codex":0.00006924142,"about_ca_topic_score_gemma":0.00020488202,"teacher_disagreement_score":0.2864304,"about_ca_system_score_codex":0.00006313988,"about_ca_system_score_gemma":0.000068938294,"threshold_uncertainty_score":0.45268854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058897883,0.00017251862,0.98667777,0.0052935,0.0005010881,0.0006905473,0.000016995955,0.00058193284,0.00017583813],"genre_scores_gemma":[0.8578656,0.000015728994,0.1393201,0.0000919237,0.00043736197,0.00045996453,0.00083291734,0.000027774442,0.00094866386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973244,0.0006528596,0.0003372019,0.0008476545,0.00043937325,0.00039851925],"domain_scores_gemma":[0.9976871,0.00066950696,0.000024671317,0.0008681565,0.0005887169,0.00016187523],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020744253,0.0001565059,0.00014094838,0.00056171796,0.0012809851,0.0034013658,0.0010035599,0.00009687734,0.000019389843],"category_scores_gemma":[0.00038970058,0.00015290984,0.00006876331,0.0010101992,0.00009817281,0.0008986908,0.00009139582,0.0005062029,0.000115557894],"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.000017331038,0.00032090832,0.00017410677,0.00012180362,0.00003966369,0.0000057381667,0.001411728,0.18073697,0.14091057,0.26476204,0.0106549915,0.40084416],"study_design_scores_gemma":[0.00020572943,0.00035363005,0.0011638217,0.000030801453,0.000005400488,0.0000031900186,0.0000498034,0.97593224,0.0005559091,0.00020317611,0.021324702,0.00017158937],"about_ca_topic_score_codex":0.00009768935,"about_ca_topic_score_gemma":0.00013150522,"teacher_disagreement_score":0.85197574,"about_ca_system_score_codex":0.00015997747,"about_ca_system_score_gemma":0.000579442,"threshold_uncertainty_score":0.9976332},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021929933,0.00028249272,0.9741212,0.00079741166,0.00064807694,0.0010042726,0.00012838293,0.0006710898,0.00041714855],"genre_scores_gemma":[0.48658335,0.00013676121,0.50477767,0.00012385858,0.0009066971,0.0021365439,0.0017058759,0.00015655569,0.0034727002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873036,0.00003578902,0.00031777282,0.00027941397,0.0002782213,0.0003584532],"domain_scores_gemma":[0.99902785,0.00021092144,0.0000034716193,0.00023752594,0.00042481787,0.000095402946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874157,0.00012252943,0.0001239669,0.00046561458,0.00033946338,0.00034308407,0.00016928694,0.00006868417,0.000078916615],"category_scores_gemma":[0.00004188148,0.00012703183,0.0000679327,0.001145068,0.00007362605,0.00028748013,0.000021682841,0.0003453738,0.00022235919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002829604,0.0000699422,0.000013134219,0.00019542902,0.00013170562,0.000008699315,0.0016090376,0.8609429,0.011421363,0.010451837,0.015262417,0.099890694],"study_design_scores_gemma":[0.0002111254,0.0000390061,0.00008258221,0.00009210921,0.000007817435,0.0000037692512,0.000059327296,0.9501694,0.0013992187,0.000102616366,0.04770534,0.00012772979],"about_ca_topic_score_codex":0.00003221707,"about_ca_topic_score_gemma":0.00005344229,"teacher_disagreement_score":0.46934354,"about_ca_system_score_codex":0.00012292776,"about_ca_system_score_gemma":0.00015552202,"threshold_uncertainty_score":0.5180208},"labels":[],"label_agreement":null},{"id":"W4393236743","doi":"10.1016/j.cor.2024.106632","title":"Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Ministerio de Ciencia e Innovación; European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades","keywords":"Travelling salesman problem; Computer science; Service (business); Traveling purchaser problem; Operations research; Mathematical optimization; Bottleneck traveling salesman problem; Mathematics; Algorithm; Business; Marketing","score_opus":0.07149047988899913,"score_gpt":0.347697424587011,"score_spread":0.2762069446980118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393236743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39206812,0.0012782472,0.60311496,0.0018402427,0.000086038766,0.00074623455,0.0000072622465,0.0002732487,0.0005856325],"genre_scores_gemma":[0.75103974,0.00005992627,0.2486216,0.000055201977,0.000064827196,0.00003892155,0.000009678348,0.000028136312,0.000081960214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876785,0.00035895887,0.00016638268,0.00023703986,0.00022000939,0.00024975758],"domain_scores_gemma":[0.9992039,0.00047943168,0.0000029795976,0.00013219855,0.00013260383,0.000048891652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014015983,0.00010203279,0.000101102545,0.0002269207,0.00025421949,0.0006575556,0.00016571996,0.000058950027,0.000005602385],"category_scores_gemma":[0.000056853976,0.00008652448,0.000012047575,0.00087867223,0.00005749582,0.00022126189,0.00008483104,0.00046014017,0.00001680732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028116372,0.000026500507,0.00013956317,0.00014886977,0.00003148673,0.000017149534,0.017846188,0.94369566,0.0129746655,0.0005685204,0.00019484789,0.024353707],"study_design_scores_gemma":[0.00014726387,0.000028867113,0.0011272649,0.00009830446,0.0000040967875,0.000036950587,0.00038554228,0.99739224,0.0005029876,0.000055236884,0.00012731936,0.000093957286],"about_ca_topic_score_codex":0.00004821915,"about_ca_topic_score_gemma":0.0001990815,"teacher_disagreement_score":0.35897163,"about_ca_system_score_codex":0.00007864873,"about_ca_system_score_gemma":0.000049085254,"threshold_uncertainty_score":0.6340824},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014014443,0.00026222868,0.970411,0.006293986,0.0007771216,0.0028972665,0.000012979278,0.00056230504,0.0047686542],"genre_scores_gemma":[0.99189365,0.000028059132,0.005066949,0.0002883739,0.0003437146,0.0004446303,0.00047423114,0.000025244115,0.0014351772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973086,0.00011343374,0.00047779185,0.000744576,0.0008606277,0.0004949463],"domain_scores_gemma":[0.99739707,0.00006521979,0.000017704573,0.00054166594,0.0019391248,0.00003920455],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021398384,0.00023255593,0.0002082268,0.00065725046,0.0008293504,0.0019064527,0.00039253925,0.000079255165,0.0002811216],"category_scores_gemma":[0.00041404532,0.00019773951,0.0000666999,0.002348841,0.00022828214,0.0016521375,0.00028071465,0.00037913639,0.00077914825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028618527,0.00029094896,0.0020930213,0.0031196186,0.00017901143,0.000023976909,0.00069620425,0.828973,0.00007676227,0.05385902,0.040561248,0.06984102],"study_design_scores_gemma":[0.00064123416,0.000032897413,0.00096031197,0.0001516113,0.000034213546,0.0000012688478,0.00043020453,0.9525956,0.000020630694,0.0005320315,0.044353426,0.00024656704],"about_ca_topic_score_codex":0.002465773,"about_ca_topic_score_gemma":0.0024762726,"teacher_disagreement_score":0.97787917,"about_ca_system_score_codex":0.00019383345,"about_ca_system_score_gemma":0.000262609,"threshold_uncertainty_score":0.99999887},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09240091,0.00040440497,0.9003225,0.0045417803,0.0005963105,0.0010876752,0.0000040500586,0.00020855297,0.0004338491],"genre_scores_gemma":[0.9971449,0.000054164007,0.0015341558,0.000289855,0.0001936812,0.00020459126,0.0003189619,0.000023523842,0.00023619048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986788,0.000029013725,0.00026577304,0.00042449744,0.00029071386,0.00031122568],"domain_scores_gemma":[0.99931437,0.0000474697,0.000007305671,0.00018081738,0.00042772063,0.000022339153],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00084725267,0.0001304116,0.00010752029,0.00059219165,0.00073461427,0.0016739548,0.00017978984,0.000050206618,0.00005587716],"category_scores_gemma":[0.0000403634,0.0001338189,0.000036890244,0.0009408751,0.00008853447,0.0014179454,0.00017626496,0.0001864377,0.00013629852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021997674,0.0000784825,0.000043354554,0.0014290857,0.000062153056,0.000002296836,0.00037859194,0.83674264,0.0012686284,0.034007236,0.0043107937,0.12165476],"study_design_scores_gemma":[0.00024662755,0.000020012534,0.00066185865,0.00014740255,0.000012772105,0.0000014492016,0.0002968946,0.98475456,0.000028589477,0.0011773153,0.012506141,0.00014639161],"about_ca_topic_score_codex":0.0010061786,"about_ca_topic_score_gemma":0.0015363618,"teacher_disagreement_score":0.90474397,"about_ca_system_score_codex":0.00014288297,"about_ca_system_score_gemma":0.000053899053,"threshold_uncertainty_score":0.9993624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30272186,0.00045319265,0.69602174,0.00022068815,0.00011332569,0.00027895608,0.000040779905,0.00011301393,0.000036458197],"genre_scores_gemma":[0.741741,0.00008717003,0.2579752,0.000010943643,0.00004676464,0.000028692413,0.000042857628,0.000034834102,0.00003255175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985392,0.00003892707,0.00037032313,0.00033180826,0.00038774955,0.00033198926],"domain_scores_gemma":[0.9990685,0.000359388,0.0000063356756,0.00027822854,0.00016688045,0.00012065703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043101332,0.0001665692,0.00023112145,0.00045334132,0.00014213598,0.00025801142,0.00023566974,0.0000623038,0.000015476862],"category_scores_gemma":[0.0000587102,0.00015242716,0.00003897676,0.0007277479,0.00015372703,0.00016771839,0.000023135923,0.00044877437,0.0000037587508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002498927,0.000046780697,0.000106628584,0.00012964387,0.000044307508,0.00014064765,0.0021615087,0.9942223,0.0002632006,0.00019789985,0.000026280404,0.002635834],"study_design_scores_gemma":[0.000788171,0.000077854726,0.00009057349,0.00042406502,0.000012706649,0.000035059496,0.00033094175,0.99779856,0.00021880055,0.0000104955225,0.00004333826,0.00016943624],"about_ca_topic_score_codex":0.00005725646,"about_ca_topic_score_gemma":0.00014312028,"teacher_disagreement_score":0.43901914,"about_ca_system_score_codex":0.00006667203,"about_ca_system_score_gemma":0.00014705464,"threshold_uncertainty_score":0.62157995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014410634,0.0010702149,0.9964258,0.00013071814,0.00021512822,0.00047027227,0.00002069668,0.000082392624,0.00014372678],"genre_scores_gemma":[0.94686794,0.000055215798,0.052500486,0.000005324731,0.000057547968,0.00025643912,0.000058371355,0.000015255211,0.00018343457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991962,0.000036140078,0.0001824052,0.00015447257,0.0002607588,0.0001700236],"domain_scores_gemma":[0.9993481,0.00033137767,0.0000042789256,0.00019286251,0.00008951154,0.000033844888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003577202,0.00007429708,0.00010895159,0.00031673597,0.00019053748,0.0001766613,0.00016510245,0.000031918404,0.000028259374],"category_scores_gemma":[0.000014251509,0.000055122644,0.000065456086,0.0005614908,0.000058238922,0.00008744811,0.00004694531,0.00014557192,0.0000046275186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018192823,0.000023523538,0.0000011613205,0.000031594023,0.0003478119,8.826209e-7,0.0007955206,0.9882594,0.0010291303,0.003809435,0.0005825053,0.005117226],"study_design_scores_gemma":[0.000072248775,0.000050010873,0.000032097054,0.000016473867,0.00005981153,4.96781e-7,0.000253961,0.9878377,0.010801599,0.000084074,0.0007323095,0.000059260823],"about_ca_topic_score_codex":0.000027131651,"about_ca_topic_score_gemma":0.000018238834,"teacher_disagreement_score":0.9454269,"about_ca_system_score_codex":0.0001324816,"about_ca_system_score_gemma":0.000033088523,"threshold_uncertainty_score":0.22478361},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042450787,0.001325602,0.9881686,0.0046396875,0.00029035276,0.00048982736,0.0000059365243,0.00027510364,0.0005598158],"genre_scores_gemma":[0.17821507,0.00017884931,0.8196754,0.00012755864,0.00038204083,0.0002578673,0.000022224303,0.000060123795,0.0010808992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859005,0.00007136818,0.0002529988,0.00032593927,0.0003973946,0.00036222622],"domain_scores_gemma":[0.9992522,0.00016008723,0.000003112977,0.00022509795,0.00019981335,0.00015970375],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007083552,0.00014828717,0.00014029304,0.00025945643,0.00045919,0.0015376089,0.00028132633,0.00006792935,0.00001953364],"category_scores_gemma":[0.00002763884,0.00011038541,0.000033884273,0.0007994375,0.000093319264,0.00029482396,0.00014828674,0.0004364031,0.00007143868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002784103,0.000013133879,0.000009146568,0.000075502765,0.000022976092,0.000009390214,0.0020739052,0.946049,0.00005678189,0.0007393604,0.0020185655,0.048929494],"study_design_scores_gemma":[0.00013454139,0.000020333444,0.000069316775,0.00012965861,0.0000067978526,0.00002186094,0.00018880266,0.9984471,0.000040092622,0.00025466364,0.00054918684,0.00013763482],"about_ca_topic_score_codex":0.000037644077,"about_ca_topic_score_gemma":0.000015769341,"teacher_disagreement_score":0.17396998,"about_ca_system_score_codex":0.000056335997,"about_ca_system_score_gemma":0.00009009214,"threshold_uncertainty_score":0.9994989},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057239872,0.0006580957,0.96487206,0.012683009,0.001277426,0.0052354764,0.0000081309245,0.000830976,0.008710843],"genre_scores_gemma":[0.94513345,0.000017563609,0.04168762,0.0015973607,0.004808405,0.0024907656,0.00018723586,0.00010496076,0.0039726286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982816,0.000035879813,0.00027647777,0.00045287856,0.00040335924,0.00054980424],"domain_scores_gemma":[0.99919355,0.00012380007,0.00001386859,0.00025290804,0.00039118555,0.000024674317],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017178623,0.00015059549,0.0001541063,0.00068711216,0.000700958,0.002553222,0.00036552778,0.000049688857,0.00008257785],"category_scores_gemma":[0.00007640093,0.00013477835,0.00010211576,0.0008825336,0.00009018425,0.001020245,0.00023780849,0.00024543228,0.00030918786],"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.00005801583,0.00027177503,0.00018856373,0.0024728824,0.00022162795,0.0000453411,0.0005801645,0.032609075,0.00062577403,0.66857475,0.101392835,0.19295919],"study_design_scores_gemma":[0.00029584722,0.000021744774,0.000008270157,0.0001135368,0.000011949794,6.839033e-7,0.00014742812,0.6019716,0.000015242264,0.0006484177,0.39666262,0.000102634156],"about_ca_topic_score_codex":0.000249425,"about_ca_topic_score_gemma":0.000081715174,"teacher_disagreement_score":0.9394095,"about_ca_system_score_codex":0.000087712084,"about_ca_system_score_gemma":0.00006580971,"threshold_uncertainty_score":0.9984822},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089618705,0.001420703,0.90002155,0.005846573,0.00065293943,0.00043605466,0.000008381981,0.0003672115,0.0016278584],"genre_scores_gemma":[0.9183474,0.00006733328,0.074831866,0.000056301837,0.0006780672,0.00012340037,0.000038468268,0.0000312974,0.0058258316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99387336,0.0011045303,0.00060812937,0.0010371556,0.0026313507,0.0007454864],"domain_scores_gemma":[0.9940919,0.0031115047,0.000015895253,0.00081359706,0.0016878342,0.00027925722],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01417716,0.0001618101,0.00023001818,0.0017844519,0.0020512894,0.004040011,0.0011511144,0.00012673753,0.00023781341],"category_scores_gemma":[0.0028366118,0.00013555722,0.00014683451,0.005763298,0.00030791017,0.00066205097,0.00045829391,0.0014534171,0.006465262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057362913,0.00007185204,0.00024016555,0.0000111950785,0.000040960767,0.000016219308,0.0021218527,0.6997981,0.0022973404,0.025484007,0.00276281,0.26714975],"study_design_scores_gemma":[0.00011542302,0.00007828484,0.00024447642,0.000056218683,0.00000574104,0.000021034399,0.0011872628,0.9606011,0.0004019153,0.0018410897,0.03530358,0.00014390128],"about_ca_topic_score_codex":0.0003114477,"about_ca_topic_score_gemma":0.00005174753,"teacher_disagreement_score":0.82872874,"about_ca_system_score_codex":0.00018580083,"about_ca_system_score_gemma":0.0007439927,"threshold_uncertainty_score":0.9992479},"labels":[],"label_agreement":null},{"id":"W4400338818","doi":"10.1016/j.cor.2024.106761","title":"An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Column generation; Pickup; Computer science; Vehicle routing problem; Mathematical optimization; Solver; Algorithm; Heuristic; Routing (electronic design automation); Mathematics; Artificial intelligence","score_opus":0.024986264957067815,"score_gpt":0.32485885482482557,"score_spread":0.2998725898677578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400338818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0647748,0.00064370845,0.93326354,0.0001235536,0.00004668409,0.00075309654,0.000023639082,0.00026443353,0.000106544896],"genre_scores_gemma":[0.1974639,0.00009978477,0.80183566,0.00001622735,0.0001219364,0.00007994643,0.000040301806,0.00005206667,0.00029019223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889845,0.00013952544,0.00015641225,0.0003245769,0.00019093412,0.0002901051],"domain_scores_gemma":[0.9988144,0.00065385946,0.0000035663697,0.00018473528,0.00020225182,0.00014117798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007634969,0.00012885006,0.00013845651,0.00023376876,0.00030598693,0.0007392406,0.00011547113,0.00006651859,0.0000133009125],"category_scores_gemma":[0.000027400021,0.00011578977,0.000014268511,0.00032759603,0.000097644086,0.00031274525,0.000052759064,0.0002297078,0.000009237903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055057726,0.000012569628,0.00001167725,0.00008932317,0.000039737053,0.000016746586,0.0006054236,0.7979921,0.0012692513,0.000172193,0.0002386663,0.19954681],"study_design_scores_gemma":[0.0002770613,0.0002374466,0.000038843387,0.000085960295,0.000010936374,0.000050156923,0.000043511653,0.997668,0.00027190687,0.000037912745,0.0011331259,0.00014512976],"about_ca_topic_score_codex":0.00001812897,"about_ca_topic_score_gemma":0.000011450585,"teacher_disagreement_score":0.19967592,"about_ca_system_score_codex":0.000060180042,"about_ca_system_score_gemma":0.000069741975,"threshold_uncertainty_score":0.7128514},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09052891,0.0009771051,0.8022087,0.07302994,0.0025833447,0.0039289263,0.000010859417,0.00093502615,0.025797144],"genre_scores_gemma":[0.99443823,0.000057902555,0.00082377845,0.00024721053,0.0006106016,0.0003757037,0.00008298353,0.000022735401,0.0033408513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840975,0.00006015273,0.00025909138,0.00037649972,0.00052645896,0.00036804515],"domain_scores_gemma":[0.9986708,0.00007910044,0.0000078762105,0.00032039243,0.00090004073,0.000021770622],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00096297305,0.00013491933,0.00008975207,0.00028058683,0.0020354693,0.0029160078,0.00030902468,0.000034438657,0.0001852615],"category_scores_gemma":[0.000077967,0.000093823495,0.000032703047,0.0017872985,0.00019209525,0.0013518335,0.00019573727,0.0003282848,0.0012328359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004416004,0.000109988316,0.00007961669,0.00016513468,0.000101645936,0.000008807716,0.00033799387,0.6541689,0.00017556643,0.29251638,0.032363776,0.019928027],"study_design_scores_gemma":[0.00014073751,0.000026751544,0.0004638451,0.000062825595,0.000012156487,0.0000021734731,0.00056245364,0.738546,0.00003124539,0.00010725735,0.2599245,0.00012005958],"about_ca_topic_score_codex":0.001956789,"about_ca_topic_score_gemma":0.006095054,"teacher_disagreement_score":0.9039093,"about_ca_system_score_codex":0.00011252491,"about_ca_system_score_gemma":0.00018626067,"threshold_uncertainty_score":0.9995448},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13584925,0.0016199317,0.75478154,0.08026344,0.00470465,0.0093998,0.000008458372,0.000918649,0.0124542825],"genre_scores_gemma":[0.823191,0.00010324788,0.14949799,0.0052375128,0.012856151,0.0025654463,0.00006965048,0.00015768092,0.0063213105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812186,0.00004289612,0.00020394714,0.0005159838,0.0006828327,0.0004325114],"domain_scores_gemma":[0.9991263,0.00004455066,0.000011894204,0.00041423435,0.00037379554,0.000029222747],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009961955,0.00015574935,0.00010761596,0.00052611576,0.0008012797,0.0017389441,0.00039629673,0.000028506369,0.00010931386],"category_scores_gemma":[0.000037466692,0.000103208724,0.000043205877,0.001502517,0.0001227662,0.0006543891,0.00039218942,0.00029733704,0.0007127706],"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.00003103104,0.00033234013,0.0001491789,0.0006098868,0.0002677673,0.000057068275,0.0033762408,0.16950685,0.0008104428,0.074445084,0.28509736,0.46531677],"study_design_scores_gemma":[0.00016927009,0.00009732725,0.0015420396,0.00035965734,0.0000370961,0.000010321853,0.0012125244,0.6217434,0.0001169001,0.00052079436,0.37391624,0.0002744347],"about_ca_topic_score_codex":0.0008815362,"about_ca_topic_score_gemma":0.00042376973,"teacher_disagreement_score":0.68734175,"about_ca_system_score_codex":0.00017464647,"about_ca_system_score_gemma":0.00006860645,"threshold_uncertainty_score":0.9992973},"labels":[],"label_agreement":null},{"id":"W4401665365","doi":"10.1016/j.cor.2024.106807","title":"A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fundamental Research Funds for the Central Universities; National University's Basic Research Foundation of China; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Computer science; Combinatorial auction; Branch and cut; Routing (electronic design automation); Combinatorial optimization; Algorithm; Common value auction; Mathematical optimization; Integer programming; Mathematics; Computer network","score_opus":0.023290804997226442,"score_gpt":0.3124205499573705,"score_spread":0.28912974496014404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401665365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005401353,0.0005356143,0.99064964,0.0012626087,0.00031064518,0.001174104,0.000024405226,0.00038440156,0.0002572096],"genre_scores_gemma":[0.44137576,0.00017073753,0.55313617,0.00006418268,0.0012280069,0.0008081336,0.00006167819,0.00020594975,0.0029493908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986797,0.00018328513,0.00020300433,0.00030085226,0.00029673125,0.0003364086],"domain_scores_gemma":[0.9985843,0.00088999723,0.0000065223053,0.00021410894,0.00021159397,0.00009349455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014128331,0.00013685177,0.00014419584,0.00017653726,0.00083218544,0.00088241586,0.0001683525,0.00006905821,0.000021268854],"category_scores_gemma":[0.000048835256,0.00010574239,0.000028237944,0.0005034151,0.00013942055,0.0002538745,0.00012034811,0.00040529165,0.000034562825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008227203,0.00002452863,0.000015404636,0.00006477349,0.00015293012,0.0000039511974,0.0013361849,0.85154766,0.0018607798,0.0022809182,0.0015918656,0.14111277],"study_design_scores_gemma":[0.00049432664,0.00009564355,0.000037082507,0.000078925055,0.000021480748,0.0000338177,0.00005079607,0.99691784,0.0004895432,0.00014995421,0.0015006195,0.00012997496],"about_ca_topic_score_codex":0.000032818534,"about_ca_topic_score_gemma":0.000008756381,"teacher_disagreement_score":0.4375135,"about_ca_system_score_codex":0.00009492296,"about_ca_system_score_gemma":0.000095085845,"threshold_uncertainty_score":0.8509157},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06774944,0.00017784182,0.9106513,0.00020894267,0.0004916155,0.00072998734,0.0000027976512,0.0015495219,0.018438535],"genre_scores_gemma":[0.94533575,0.00006671818,0.053090032,0.000013761733,0.0001853865,0.00017715327,0.00008479121,0.00007263439,0.0009737692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998512,0.0001189687,0.00035654916,0.0003378291,0.00022058675,0.0004540096],"domain_scores_gemma":[0.999182,0.00023795408,0.000008154843,0.0003668952,0.00007608389,0.00012893985],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012670609,0.00016173303,0.0002082906,0.00036907924,0.00051043247,0.0016751922,0.00059220707,0.00008282372,0.00016463596],"category_scores_gemma":[0.000023246266,0.00017015058,0.000056652163,0.0003724589,0.000034562003,0.00039337875,0.00035356946,0.00046513695,0.00027758835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038054893,0.000005157472,0.00001777017,0.00016298726,0.00003281243,0.000023456754,0.00085889705,0.9848085,0.0006249448,0.0036105763,0.004412619,0.0054384796],"study_design_scores_gemma":[0.00013037254,0.000081374645,0.000017321066,0.0004590183,0.000005386633,0.000008949447,0.00027955972,0.99369234,0.00038231988,0.000007759162,0.0047502606,0.00018534991],"about_ca_topic_score_codex":0.00022106721,"about_ca_topic_score_gemma":0.000034064215,"teacher_disagreement_score":0.8775863,"about_ca_system_score_codex":0.0005096426,"about_ca_system_score_gemma":0.00010406334,"threshold_uncertainty_score":0.99936116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015547908,0.0015582076,0.99631834,0.0003795588,0.0004388361,0.00052619027,0.000020519874,0.00029730488,0.0003055799],"genre_scores_gemma":[0.29362798,0.0010201549,0.7025268,0.000054343673,0.0006214563,0.00063035166,0.00012489078,0.00006823657,0.0013258054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930745,0.000029186596,0.000115384726,0.00015845375,0.00015341035,0.00023609801],"domain_scores_gemma":[0.9991383,0.00049755303,0.0000017334329,0.0001726343,0.00014879569,0.0000409773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031285247,0.00007811377,0.000063723244,0.00012066268,0.0003719733,0.00037067282,0.00017861056,0.00003852456,0.000011286602],"category_scores_gemma":[0.000021498485,0.000058752954,0.00003473681,0.00023496218,0.000074667965,0.00012995655,0.000047664496,0.00024431967,0.00003495146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1033255e-7,0.0000011612502,9.153459e-8,0.000031234886,0.00002805564,0.0000023133312,0.00017307185,0.87238264,0.00008563688,0.0035711539,0.007821171,0.11590263],"study_design_scores_gemma":[0.00007988408,0.00003116347,0.000002983028,0.00002978401,0.00000581235,0.0000037132756,0.000041636842,0.9668604,0.0006568617,0.00043362437,0.031782318,0.000071816205],"about_ca_topic_score_codex":0.00002533879,"about_ca_topic_score_gemma":0.000009333869,"teacher_disagreement_score":0.29379153,"about_ca_system_score_codex":0.00007571378,"about_ca_system_score_gemma":0.000045068176,"threshold_uncertainty_score":0.35744065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93290555,0.011875665,0.047774456,0.0032827372,0.0004357354,0.0012652178,0.000036178404,0.00011539847,0.0023090544],"genre_scores_gemma":[0.99667275,0.000039097682,0.0018655007,0.000015959115,0.00011572824,0.00013725685,0.000021977996,0.000020753962,0.0011109951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834245,0.00025173737,0.00022921556,0.00036257462,0.00037468714,0.00043932555],"domain_scores_gemma":[0.9982422,0.00080193544,0.000006998307,0.00032995784,0.00051647896,0.000102412276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011432391,0.00012162903,0.00016434147,0.00021758123,0.00059555564,0.0004842577,0.0003308671,0.00009723386,0.000017052165],"category_scores_gemma":[0.00024409391,0.00008681704,0.000053098665,0.00061439996,0.00038553018,0.00009396105,0.00019621545,0.00048237902,0.000002497745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080733815,0.000097228076,0.000070581824,0.00041781084,0.00011899386,0.00007647696,0.0057128835,0.8110501,0.0009542872,0.17094918,0.00014348225,0.010328214],"study_design_scores_gemma":[0.0002750357,0.00013832073,0.00013084328,0.000099510726,0.0000087350845,0.000014755725,0.0051183295,0.9897543,0.0001246173,0.0021309268,0.0021086882,0.00009592558],"about_ca_topic_score_codex":0.0028203137,"about_ca_topic_score_gemma":0.00058880437,"teacher_disagreement_score":0.17870419,"about_ca_system_score_codex":0.000116004965,"about_ca_system_score_gemma":0.00037197783,"threshold_uncertainty_score":0.4669708},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48531857,0.00089549477,0.4909844,0.014472209,0.0018172404,0.0010325526,0.00008844799,0.0003678445,0.005023236],"genre_scores_gemma":[0.9492127,0.00035400147,0.0448969,0.0010751955,0.0013357555,0.0013512616,0.00070360064,0.00012012138,0.000950505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975257,0.00012700017,0.0004472999,0.0006074277,0.00065177353,0.00064082304],"domain_scores_gemma":[0.9984824,0.0004999933,0.00003350807,0.0005883567,0.00031838566,0.0000773391],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033205429,0.00021755698,0.00014567803,0.00035073239,0.001391886,0.0020642846,0.0005843378,0.00015235692,0.0001253796],"category_scores_gemma":[0.0003002345,0.00020230621,0.0001283254,0.0010981302,0.00026687063,0.0009803155,0.00068488845,0.00051694777,0.00055678666],"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.000036931786,0.0000899774,0.0000049354862,0.00074448163,0.00018916243,0.000012330374,0.0006421234,0.052563667,0.00031481436,0.9283799,0.006566011,0.0104557015],"study_design_scores_gemma":[0.00029291218,0.00007138895,0.000042940625,0.0001568037,0.000074590964,0.000007778961,0.00091963523,0.9674456,0.00011661507,0.00050845504,0.030173264,0.00018999861],"about_ca_topic_score_codex":0.0024982772,"about_ca_topic_score_gemma":0.0007640609,"teacher_disagreement_score":0.9278714,"about_ca_system_score_codex":0.000030419538,"about_ca_system_score_gemma":0.00026026915,"threshold_uncertainty_score":0.99990815},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010447705,0.0023766311,0.98460484,0.00043194726,0.00078877574,0.0005227427,0.000013890078,0.0006960015,0.000117473646],"genre_scores_gemma":[0.77810293,0.00012319665,0.2198927,0.000049283586,0.0006663418,0.0002983151,0.0003591045,0.00007420187,0.00043389975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861574,0.00012512878,0.00024474566,0.00031462472,0.00031377363,0.00038599526],"domain_scores_gemma":[0.9989834,0.00034503895,0.0000048003485,0.0001874642,0.00036766264,0.00011165064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007060001,0.00013976364,0.00013148131,0.00059723173,0.0005635219,0.000903581,0.00018750671,0.00009223089,0.000046882757],"category_scores_gemma":[0.00023677455,0.00015021369,0.000067337525,0.0011852563,0.000031799125,0.00014577285,0.000024303372,0.00051632384,0.000103929735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003203651,0.000019043917,0.0000049935147,0.000074794516,0.000029073326,0.0000051836532,0.00018384887,0.9878517,0.0016562005,0.0007934551,0.0011765632,0.00820194],"study_design_scores_gemma":[0.00026579047,0.00010046041,0.0000051031984,0.000048878537,0.00000980811,0.0000050008975,0.00002270428,0.99492586,0.0017314388,0.000021782447,0.0027000683,0.00016310441],"about_ca_topic_score_codex":0.00002568746,"about_ca_topic_score_gemma":0.000030007983,"teacher_disagreement_score":0.76765525,"about_ca_system_score_codex":0.00018820133,"about_ca_system_score_gemma":0.00021181702,"threshold_uncertainty_score":0.8713252},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0870275,0.00037660287,0.91099846,0.0005942324,0.000034523637,0.00027094156,0.0000037332836,0.00007925087,0.0006147801],"genre_scores_gemma":[0.9727669,0.00004303778,0.026269086,0.000022574015,0.00027508865,0.00005700456,0.000089197405,0.000013551989,0.000463579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988954,0.0001568642,0.00025044222,0.0002609696,0.00018869509,0.00024763469],"domain_scores_gemma":[0.9993103,0.00026082815,0.000007404524,0.00020671565,0.0001379937,0.00007674678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047765422,0.00009440703,0.00012235242,0.00044135028,0.0002441678,0.00065500673,0.0001558772,0.000029590543,0.00011041017],"category_scores_gemma":[0.000012553843,0.000094064235,0.000034376608,0.0011126652,0.000065483226,0.0004605971,0.00017054468,0.00027982486,0.000008422486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012238904,0.000014823572,0.001986433,0.000004913215,0.00001715266,9.301474e-7,0.00048283907,0.89194596,0.000012042855,0.09225864,0.0017352791,0.011539792],"study_design_scores_gemma":[0.000081022714,0.000020591398,0.0009055865,0.00008935656,0.000004995241,5.6380435e-7,0.00007744545,0.9929272,0.000023104834,0.004510685,0.0012660499,0.00009341297],"about_ca_topic_score_codex":0.001509019,"about_ca_topic_score_gemma":0.00018218704,"teacher_disagreement_score":0.8857394,"about_ca_system_score_codex":0.000054307933,"about_ca_system_score_gemma":0.00014237897,"threshold_uncertainty_score":0.6316245},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13466856,0.00022715524,0.86038446,0.0019408871,0.00025405202,0.00043632142,0.000034376782,0.00007627851,0.0019779177],"genre_scores_gemma":[0.9921027,0.000115092414,0.0067249783,0.00011783841,0.00024405183,0.000025109663,0.00025769774,0.000014670903,0.00039786435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889976,0.000036270783,0.00020412802,0.0002802308,0.0003746798,0.00020492991],"domain_scores_gemma":[0.9994236,0.00008425485,0.000018398832,0.00015520526,0.00029735453,0.000021178805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006205174,0.00009873224,0.00010259417,0.00042718934,0.000358775,0.00061662274,0.00015723205,0.000041737025,0.00020459249],"category_scores_gemma":[0.000070585025,0.000092182505,0.000045941208,0.0004785164,0.00020396244,0.0007137714,0.0003068906,0.00018500815,0.000043577136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075302546,0.00004488241,0.00013228346,0.00008202619,0.00003569544,0.0000034706254,0.000087398745,0.8476102,0.000061324456,0.14307201,0.007270796,0.0015923746],"study_design_scores_gemma":[0.000240709,0.000015233362,0.00023268547,0.00007141073,0.000020854937,0.0000012699796,0.00048487211,0.9961523,0.000014951628,0.0010549553,0.0016181113,0.00009268423],"about_ca_topic_score_codex":0.0004039337,"about_ca_topic_score_gemma":0.000061317405,"teacher_disagreement_score":0.85743415,"about_ca_system_score_codex":0.000081120015,"about_ca_system_score_gemma":0.00007972819,"threshold_uncertainty_score":0.59461075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7849795,0.034231633,0.17708841,0.00048753107,0.00020915721,0.0018573587,0.000037465878,0.0003140741,0.00079483684],"genre_scores_gemma":[0.9821531,0.0025066342,0.014828516,0.000005013879,0.00003118353,0.00020356738,0.000118534954,0.000028554614,0.00012486252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986468,0.00031220148,0.00037097395,0.00022331484,0.0002400136,0.0002067262],"domain_scores_gemma":[0.99857646,0.00058617094,0.0000076038195,0.0004639186,0.0003079099,0.000057915542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015558014,0.00010031082,0.00015333507,0.0005187905,0.00009529247,0.00027807863,0.0002552409,0.00006856192,0.000005844524],"category_scores_gemma":[0.00005638363,0.000102428836,0.000019502211,0.0015801535,0.000085692045,0.00028512315,0.00010866912,0.00032961564,0.000036448488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100761545,0.00014851848,0.061330296,0.002087035,0.00016024958,0.0000060492757,0.018558567,0.7349682,0.0326933,0.024619587,0.00018330567,0.12523481],"study_design_scores_gemma":[0.00012251698,0.000018912926,0.07578171,0.0003270011,0.0000020635998,0.0000033749195,0.00015832722,0.9111168,0.00094841525,0.000093446644,0.011296494,0.00013094816],"about_ca_topic_score_codex":0.00054246106,"about_ca_topic_score_gemma":0.0015144693,"teacher_disagreement_score":0.1971736,"about_ca_system_score_codex":0.00006949391,"about_ca_system_score_gemma":0.00007345359,"threshold_uncertainty_score":0.41769266},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09790939,0.0012938788,0.87210786,0.011052727,0.00074009557,0.00087855686,0.0000023761045,0.0005715579,0.015443573],"genre_scores_gemma":[0.99713284,0.000021456946,0.000623393,0.00036601105,0.0007875039,0.00006485007,0.000044303684,0.000025512445,0.00093411567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858004,0.00015779286,0.00022001196,0.0004001283,0.0003181297,0.0003239204],"domain_scores_gemma":[0.9990017,0.0002920366,0.000018891475,0.00039513822,0.00027819345,0.000014029387],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016107449,0.00013334889,0.00018195972,0.0014301987,0.00052041485,0.001337925,0.00034679807,0.000045486144,0.00016566754],"category_scores_gemma":[0.000082081104,0.000088868466,0.00009447673,0.0078087635,0.00013083513,0.00093348656,0.0002090652,0.0006187422,0.0001891254],"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.00002250858,0.000023241566,0.0010882663,0.000017871367,0.00027483242,0.000029654357,0.00020549937,0.97541565,0.000016326454,0.013068911,0.0019971698,0.00784008],"study_design_scores_gemma":[0.00009819484,0.0000068348713,0.0003438402,0.00009470571,0.00014055002,0.0000010593105,0.00041212732,0.97894865,0.0000040437985,0.00027346908,0.019559978,0.00011654577],"about_ca_topic_score_codex":0.0016923877,"about_ca_topic_score_gemma":0.02491873,"teacher_disagreement_score":0.89922345,"about_ca_system_score_codex":0.00012319139,"about_ca_system_score_gemma":0.000034858283,"threshold_uncertainty_score":0.99969876},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42092314,0.00059187884,0.57317525,0.0036202564,0.00065775396,0.0007963054,0.000041328014,0.0001048066,0.00008930752],"genre_scores_gemma":[0.9852929,0.000063127765,0.013239611,0.00018730226,0.00021686348,0.0002158792,0.0004500372,0.0000277247,0.00030654087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711883,0.00088651414,0.0004982854,0.00047669874,0.00048501062,0.0005346517],"domain_scores_gemma":[0.9977776,0.00082183746,0.000019858895,0.00023405404,0.00089420954,0.0002524785],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012222275,0.00015396005,0.00017596436,0.00031302182,0.00328384,0.000282444,0.0001198263,0.00022127254,0.00014198267],"category_scores_gemma":[0.0002546567,0.00013601787,0.00003294059,0.00068280863,0.00015469432,0.0003603908,0.00018354742,0.0012674022,0.00013316362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123451255,0.00006870778,0.00029654484,0.00008227315,0.000023043785,0.000009063303,0.006889067,0.97240525,0.00009808782,0.012699774,0.0046029696,0.0028128917],"study_design_scores_gemma":[0.0002550533,0.00021702172,0.0032759374,0.00068710215,0.000008390493,0.000007473549,0.0017710115,0.99266684,0.000005755609,0.00017106095,0.00077609543,0.00015824387],"about_ca_topic_score_codex":0.00032942143,"about_ca_topic_score_gemma":0.00006142889,"teacher_disagreement_score":0.5643698,"about_ca_system_score_codex":0.00038351183,"about_ca_system_score_gemma":0.0008934801,"threshold_uncertainty_score":0.99801373},"labels":[],"label_agreement":null},{"id":"W4404094938","doi":"10.1016/j.cor.2024.106890","title":"Optimizing task assignment and routing operations with a heterogeneous fleet of unmanned aerial vehicles for emergency healthcare services","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Task (project management); Routing (electronic design automation); Computer science; Vehicle routing problem; Health care; Operations research; Emergency vehicle; Medical emergency; Aeronautics; Computer network; Transport engineering; Real-time computing; Systems engineering; Engineering; Medicine","score_opus":0.047266171689287956,"score_gpt":0.36209067222948693,"score_spread":0.31482450054019895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404094938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20665814,0.0014173475,0.7896361,0.000721632,0.00035872293,0.00087554456,0.00006540116,0.00023042661,0.000036725818],"genre_scores_gemma":[0.77486193,0.0001795269,0.22445536,0.000014424571,0.00015917241,0.00016952715,0.000066404864,0.000051455656,0.000042208725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827325,0.00023109581,0.0004209811,0.00035900783,0.0003205066,0.00039512684],"domain_scores_gemma":[0.9990394,0.0001856198,0.000010735217,0.000256521,0.0003801465,0.00012759032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085749367,0.00017125142,0.00021873265,0.0003093716,0.0005293116,0.00035911307,0.00020767265,0.000083376064,0.00001403779],"category_scores_gemma":[0.000028928887,0.00016154101,0.00004477186,0.0005809854,0.00006426605,0.0002743833,0.00010917334,0.00023571786,0.0000028530685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140258435,0.000019249812,0.000046127832,0.00046066713,0.00008551447,0.0000034683253,0.0033887639,0.9817688,0.00802018,0.0011409349,0.000066715475,0.0049855676],"study_design_scores_gemma":[0.0002905088,0.000199226,0.000029680099,0.00026005943,0.000015600375,0.000012468323,0.00041946536,0.99403805,0.0043151244,0.000022581908,0.00023656046,0.00016070105],"about_ca_topic_score_codex":0.0001328956,"about_ca_topic_score_gemma":0.00029063207,"teacher_disagreement_score":0.5682038,"about_ca_system_score_codex":0.00011673288,"about_ca_system_score_gemma":0.00011666822,"threshold_uncertainty_score":0.65874517},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002754674,0.00022005025,0.96841365,0.004062928,0.0007752167,0.0009661059,0.000013927437,0.00043022961,0.022363234],"genre_scores_gemma":[0.95897514,0.000055591394,0.030728605,0.00072067743,0.0010936557,0.00036205765,0.0013507614,0.000035371584,0.0066781435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975075,0.00009568602,0.00040888015,0.0006838218,0.0008258763,0.00047825254],"domain_scores_gemma":[0.9985442,0.000036938796,0.000010188722,0.0005796276,0.00078823837,0.00004080658],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017845479,0.00019279338,0.00016203003,0.00079651206,0.00093438453,0.0024405762,0.00059171865,0.00006568903,0.0010129703],"category_scores_gemma":[0.00014622243,0.00018998714,0.000077079734,0.0026304517,0.00017652212,0.001791827,0.0008088642,0.00037425355,0.0014399085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067213714,0.00012732884,0.00003882222,0.0004360286,0.000031735126,0.0000037483692,0.00017019165,0.91372454,0.000019812309,0.06757164,0.01164953,0.0062198755],"study_design_scores_gemma":[0.00020641505,0.000009907613,0.000096866286,0.00004166787,0.000012594367,9.3672907e-7,0.00035423206,0.9654353,0.000004507137,0.000053157728,0.03359266,0.00019174904],"about_ca_topic_score_codex":0.002018691,"about_ca_topic_score_gemma":0.0006708026,"teacher_disagreement_score":0.95622045,"about_ca_system_score_codex":0.00021584648,"about_ca_system_score_gemma":0.00015705232,"threshold_uncertainty_score":0.9999002},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6276697,0.0005205421,0.36141476,0.0037942622,0.0019738066,0.0016091865,0.00015042762,0.0002676077,0.0025997092],"genre_scores_gemma":[0.93334633,0.000019366977,0.06129286,0.00013489141,0.00019053166,0.00022166873,0.000013726619,0.00003540182,0.004745236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99278873,0.00089479843,0.0010423454,0.0012714857,0.003258063,0.0007445695],"domain_scores_gemma":[0.9907425,0.005736562,0.000029484925,0.0013140296,0.0018185287,0.00035891234],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00628095,0.00024297212,0.00035699533,0.00152468,0.0009460268,0.0056523765,0.0012294021,0.00014535795,0.00080142485],"category_scores_gemma":[0.003341048,0.00019987827,0.000135265,0.001976945,0.00054254034,0.0005225396,0.001197587,0.00081483735,0.0023105047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007094506,0.00030949182,0.00039929245,0.000031190604,0.00005784639,0.0011498857,0.0049841614,0.36226016,0.038657546,0.028515738,0.27594095,0.2876228],"study_design_scores_gemma":[0.00027668854,0.00005162277,0.0003224493,0.00010538112,0.000007342356,0.0001185129,0.00046594598,0.98240733,0.000693347,0.0018846536,0.013442898,0.00022383382],"about_ca_topic_score_codex":0.00006447192,"about_ca_topic_score_gemma":0.00017173984,"teacher_disagreement_score":0.62014717,"about_ca_system_score_codex":0.00018937711,"about_ca_system_score_gemma":0.0009960654,"threshold_uncertainty_score":0.9984663},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012641017,0.0004222269,0.9737774,0.0024907866,0.0017279539,0.004900482,0.000021531685,0.00064523047,0.0033733314],"genre_scores_gemma":[0.430919,0.000062086954,0.56332296,0.0010875984,0.0012064584,0.0023218116,0.0002572395,0.000052516923,0.0007703316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902763,0.0019522598,0.0011861376,0.0029638428,0.0018219386,0.0017995476],"domain_scores_gemma":[0.99336636,0.0008618092,0.00009391095,0.004154119,0.0010075477,0.0005162586],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.006914924,0.00063947256,0.0007506987,0.00040768788,0.0017480645,0.003723829,0.0062075406,0.00033398828,0.000017544942],"category_scores_gemma":[0.00028884847,0.00068717584,0.00027944808,0.0037325325,0.00017830938,0.0003530852,0.016713029,0.0037555562,0.00014618132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004563638,0.00021792606,0.00006791089,0.00012148279,0.00008445647,0.000020086323,0.0016368076,0.84286416,0.000002953755,0.009436022,0.022982903,0.12256075],"study_design_scores_gemma":[0.00021208436,0.000108571105,0.00015320425,0.0010765127,0.000016731794,0.000003991485,0.000117457625,0.9934043,0.0000095340365,0.00020449552,0.0041286903,0.00056438503],"about_ca_topic_score_codex":0.0003587729,"about_ca_topic_score_gemma":0.00014778582,"teacher_disagreement_score":0.41827798,"about_ca_system_score_codex":0.0013848675,"about_ca_system_score_gemma":0.00144567,"threshold_uncertainty_score":0.9995579},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04055814,0.0011806737,0.9544325,0.00035221534,0.00041645346,0.0008685631,0.000001673138,0.00030882042,0.0018809427],"genre_scores_gemma":[0.95442086,0.00015153416,0.04477675,0.00002846356,0.00003776652,0.00022946656,0.000021946149,0.000028867895,0.00030431943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980049,0.0003517533,0.00036412844,0.0003211856,0.0003300879,0.0006279567],"domain_scores_gemma":[0.9988683,0.0004908113,0.000007791979,0.00037572984,0.00019026542,0.0000671352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910915,0.00014871187,0.00019921134,0.0013306671,0.00027380252,0.00035947797,0.00039774925,0.00015264587,0.0000176115],"category_scores_gemma":[0.0003775746,0.00016806704,0.00003770324,0.0041856403,0.000040733998,0.00024005705,0.00010087499,0.000810417,0.000032860476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010457285,0.00010483206,0.0010131556,0.00014567206,0.00006581175,0.000019703226,0.00088503986,0.8359884,0.00082722685,0.00530867,0.0023053072,0.15332574],"study_design_scores_gemma":[0.00020085512,0.00002629144,0.0019033786,0.00031001793,0.0000029727878,0.0000028146194,0.000044015967,0.9954602,0.00024950533,0.0001553667,0.0015048779,0.00013967416],"about_ca_topic_score_codex":0.000065701104,"about_ca_topic_score_gemma":0.0002055555,"teacher_disagreement_score":0.91386276,"about_ca_system_score_codex":0.0008434443,"about_ca_system_score_gemma":0.0001673762,"threshold_uncertainty_score":0.6853575},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010103327,0.00062730187,0.9931211,0.0024898124,0.00020622122,0.0021352188,0.0000028884176,0.00036815123,0.000038997638],"genre_scores_gemma":[0.8105843,0.00003672427,0.18827616,0.00014595056,0.000037835976,0.00064943824,0.000034723587,0.000016966751,0.00021789296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976787,0.0001948997,0.00043323636,0.00067372306,0.00033975235,0.0006796807],"domain_scores_gemma":[0.9980414,0.00040285595,0.00001107384,0.0006473425,0.0008329853,0.00006436442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576751,0.0001930088,0.00025770912,0.0009740947,0.00061367016,0.00058573525,0.0012702276,0.00017361225,0.0000031438008],"category_scores_gemma":[0.00007730217,0.0002059733,0.000068033165,0.0032698037,0.00020460025,0.00055891153,0.00026663166,0.00045365974,0.000006096351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008059143,0.000078321726,0.000009477664,0.00003345229,0.000016785103,0.000001646831,0.00045149593,0.81503147,0.00004128006,0.06133519,0.00055875705,0.12243406],"study_design_scores_gemma":[0.00077266473,0.000083448,0.00004181134,0.00012840323,0.0000042687784,0.0000020312627,0.000062585576,0.9966789,0.00006974884,0.0016574017,0.00032407444,0.00017466063],"about_ca_topic_score_codex":0.000025052652,"about_ca_topic_score_gemma":0.00016775212,"teacher_disagreement_score":0.809574,"about_ca_system_score_codex":0.0003169051,"about_ca_system_score_gemma":0.0004786564,"threshold_uncertainty_score":0.8399347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046558905,0.000749332,0.91931903,0.028661687,0.00039609967,0.0014478713,0.000009270204,0.000067532324,0.0027902431],"genre_scores_gemma":[0.9450134,0.00017911644,0.04493723,0.00033163198,0.00015197566,0.00022620123,0.0000087998615,0.000012292072,0.009139362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970657,0.0005014037,0.00038053998,0.00056658353,0.0009595093,0.00052624993],"domain_scores_gemma":[0.9924965,0.0048700976,0.000020424957,0.0007348577,0.0017591153,0.000119005956],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007722025,0.00011279915,0.00017997764,0.0009874023,0.003510888,0.0019865402,0.0010079041,0.000076023854,0.000021455442],"category_scores_gemma":[0.0018732524,0.00007602328,0.000088262816,0.0028627382,0.00043471807,0.0003883597,0.0006690931,0.00041182304,0.0000736163],"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.00012231771,0.00023680994,0.009359436,0.000045625566,0.00014794632,0.0000074892414,0.002499811,0.1360492,0.00056987914,0.6306681,0.07476842,0.14552498],"study_design_scores_gemma":[0.0010719126,0.0001650195,0.008525672,0.000114858725,0.000024555795,0.000016085163,0.002829709,0.9271414,0.00041342573,0.018675905,0.04083598,0.00018544185],"about_ca_topic_score_codex":0.00042101787,"about_ca_topic_score_gemma":0.00026676324,"teacher_disagreement_score":0.8984545,"about_ca_system_score_codex":0.000083745115,"about_ca_system_score_gemma":0.00055879145,"threshold_uncertainty_score":0.9990495},"labels":[],"label_agreement":null},{"id":"W4410815503","doi":"10.1016/j.cor.2025.107152","title":"Learning-based column generation approach for the vehicle routing problem with release dates and incompatible loading constraints","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Column generation; Vehicle routing problem; Column (typography); Computer science; Routing (electronic design automation); Mathematical optimization; Operations research; Mathematics; Computer network","score_opus":0.047957797486706706,"score_gpt":0.3309234114648892,"score_spread":0.2829656139781825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410815503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04351199,0.00012734586,0.9541068,0.00045052366,0.000054245225,0.0011185546,0.000005168707,0.00017862744,0.00044671388],"genre_scores_gemma":[0.67533934,0.0000104976825,0.32415465,0.00004066974,0.000050597733,0.00021043512,0.0000576829,0.000020936985,0.00011521711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985784,0.00033291895,0.00024326665,0.00029436892,0.00021966163,0.00033134484],"domain_scores_gemma":[0.9985101,0.00078326295,0.000015897169,0.00023526579,0.00039085693,0.000064574495],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0016901685,0.0001309366,0.00014822258,0.00022560285,0.0013540313,0.000608669,0.00020792836,0.00006468979,0.000006243919],"category_scores_gemma":[0.00021183486,0.00010942766,0.000022979459,0.0007625816,0.00022814547,0.00016813951,0.00007350812,0.00041290047,0.0000014438658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010046415,0.000022692624,0.0009513207,0.000077910954,0.000040645788,4.1976529e-7,0.00035347615,0.9812114,0.0022088932,0.0011343457,0.00049297884,0.01349586],"study_design_scores_gemma":[0.00070392556,0.000075797754,0.0002191253,0.00006519723,0.000013981557,0.000001986227,0.0003149409,0.9952185,0.003039822,0.000008263683,0.0002203508,0.00011809936],"about_ca_topic_score_codex":0.000046616806,"about_ca_topic_score_gemma":0.00003473262,"teacher_disagreement_score":0.63182735,"about_ca_system_score_codex":0.00011135374,"about_ca_system_score_gemma":0.00017654157,"threshold_uncertainty_score":0.99994606},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008568044,0.0001304017,0.993119,0.00094767776,0.00010518622,0.0028463823,0.0000035420742,0.00022098358,0.001769994],"genre_scores_gemma":[0.6474387,0.00010572918,0.34255084,0.00012527606,0.00006296658,0.002078041,0.00017459819,0.00007964702,0.007384174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986021,0.00013080137,0.0002672579,0.000253944,0.00029598852,0.0004499172],"domain_scores_gemma":[0.99865925,0.0003680472,0.00001649857,0.000284158,0.0005987042,0.00007334944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007760312,0.00018060282,0.00018813841,0.00025732297,0.0012709053,0.0005953112,0.00027409103,0.0000592332,0.000034674464],"category_scores_gemma":[0.000059939823,0.00011974762,0.000036761638,0.0008198611,0.0001372083,0.00019543114,0.00006303366,0.0005222335,0.000009777376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009948502,0.000019974812,0.00008488811,0.00008048517,0.00016152993,0.0000014970067,0.0023535877,0.99223375,0.000111391324,0.0005009873,0.0018549049,0.0024975024],"study_design_scores_gemma":[0.0035925913,0.00014147093,0.000022782455,0.0002311604,0.000019040523,0.00000499988,0.00053234806,0.9847613,0.00029894005,0.0000015840228,0.010236159,0.00015764488],"about_ca_topic_score_codex":0.000056059762,"about_ca_topic_score_gemma":0.00011772848,"teacher_disagreement_score":0.6505682,"about_ca_system_score_codex":0.00013493818,"about_ca_system_score_gemma":0.0001644096,"threshold_uncertainty_score":0.9774904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024376793,0.00019351595,0.9664017,0.0026865553,0.0002286591,0.00064734765,0.000009206527,0.00005108011,0.005405145],"genre_scores_gemma":[0.69518393,0.00042289437,0.25040123,0.0001760655,0.00011047557,0.0002582173,0.00016448201,0.00003171677,0.053250957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962006,0.0008122598,0.00074120687,0.000596632,0.0012630221,0.0003862283],"domain_scores_gemma":[0.9970176,0.00065481407,0.000045388988,0.00065325503,0.0015379367,0.000090994174],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0039047096,0.00014727339,0.00025753846,0.0022204898,0.0006391557,0.0013081697,0.00085935736,0.00009374989,0.00048415668],"category_scores_gemma":[0.0007842646,0.0001149675,0.000087264634,0.0039823586,0.00023914632,0.00071957574,0.00032599753,0.00037305563,0.00020726053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004266222,0.0001435156,0.0015709869,0.000004167558,0.000017001528,0.000008146687,0.0004107328,0.98051953,0.000011421386,0.0020298993,0.008008149,0.007233776],"study_design_scores_gemma":[0.0005193418,0.00012226994,0.0012405975,0.00013041648,0.0000059585313,0.0000042230813,0.0006442754,0.9956145,0.00006831192,0.0001924046,0.0013369625,0.000120737604],"about_ca_topic_score_codex":0.000336891,"about_ca_topic_score_gemma":0.0009553283,"teacher_disagreement_score":0.7160005,"about_ca_system_score_codex":0.00019128021,"about_ca_system_score_gemma":0.00045363462,"threshold_uncertainty_score":0.99972856},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85238516,0.000043665477,0.14241672,0.000822551,0.00024346549,0.0014539721,0.000022727227,0.000042788575,0.0025689637],"genre_scores_gemma":[0.9895142,0.0000024525582,0.0020074511,0.00030459542,0.000029459838,0.00029023978,0.000037961832,0.000014212563,0.0077994806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99661386,0.0017973562,0.00038183623,0.00028844696,0.00045958036,0.0004589358],"domain_scores_gemma":[0.9963252,0.0022857692,0.00003258197,0.00046452208,0.00080270285,0.0000892272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015808207,0.00011166182,0.00019901697,0.000681574,0.001062559,0.00004068872,0.00032185073,0.00006771354,0.000054945453],"category_scores_gemma":[0.0007731076,0.00009050336,0.0000280672,0.000794957,0.00014900883,0.00014266912,0.00044695436,0.000463903,0.000071018476],"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.038028274,0.003436974,0.18104118,0.0018819825,0.00092473655,0.000093969815,0.103099555,0.3074733,0.0023497296,0.032586705,0.30717608,0.021907495],"study_design_scores_gemma":[0.013563131,0.0028213137,0.6432852,0.0046926416,0.00008274449,0.0000010223142,0.045703463,0.17967778,0.00029515414,0.00025997256,0.10891239,0.0007051602],"about_ca_topic_score_codex":0.00019789764,"about_ca_topic_score_gemma":0.00024751917,"teacher_disagreement_score":0.46224403,"about_ca_system_score_codex":0.00017454363,"about_ca_system_score_gemma":0.00074682065,"threshold_uncertainty_score":0.81724524},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18670091,0.000071159535,0.80877626,0.0015698288,0.00032646174,0.0014807162,0.000008313115,0.00015232187,0.000914024],"genre_scores_gemma":[0.9931909,0.0000060207935,0.0027934078,0.00045339245,0.00007803532,0.0002927515,0.00016167307,0.000010582662,0.0030132579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979699,0.00007704163,0.00035201546,0.00056335225,0.0005852881,0.00045235283],"domain_scores_gemma":[0.9980554,0.000028576387,0.00001787598,0.00059186417,0.0012777752,0.000028520148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011317002,0.00019081862,0.0001745658,0.0006787216,0.0011229204,0.0006529315,0.0004562859,0.000058995305,0.00014871923],"category_scores_gemma":[0.00020266132,0.00017537075,0.000041036154,0.0017637996,0.0001938586,0.0010529672,0.00037314382,0.00030593306,0.00044293536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016970635,0.00032820363,0.00073316647,0.00042434692,0.00005882078,0.0000011638125,0.00021080185,0.97937715,0.0002616093,0.013349695,0.0015181842,0.0037198665],"study_design_scores_gemma":[0.00064616883,0.000016517859,0.010370922,0.00011044686,0.00001645747,1.8481475e-7,0.00038301494,0.9830706,0.000029007382,0.000079773185,0.005097272,0.00017960311],"about_ca_topic_score_codex":0.0059875627,"about_ca_topic_score_gemma":0.0053759036,"teacher_disagreement_score":0.80648994,"about_ca_system_score_codex":0.0002101558,"about_ca_system_score_gemma":0.00011590775,"threshold_uncertainty_score":0.9051444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006646861,0.0018365842,0.98333484,0.003172411,0.0007026128,0.0012394453,0.0000080730915,0.00013484202,0.0029243163],"genre_scores_gemma":[0.8236482,0.0017935631,0.16805136,0.0004973244,0.0001937872,0.0006907273,0.00007921049,0.00006223371,0.0049835606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989895,0.00007066184,0.00022045466,0.00022198619,0.00020637378,0.00029097247],"domain_scores_gemma":[0.99863684,0.00074856303,0.0000052981327,0.0003277992,0.00023453831,0.00004696377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005079041,0.00011924842,0.000121749996,0.00015907931,0.00081787346,0.000633391,0.00026045644,0.000076308424,0.000046495683],"category_scores_gemma":[0.000060852217,0.00008693644,0.000043178905,0.00062912377,0.00013311589,0.00023173857,0.00015280196,0.00025101186,0.000027022976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015448459,0.00005344058,0.000092136346,0.00009452878,0.00006457161,0.0000011612036,0.0010903123,0.87251556,0.00018883677,0.020051692,0.07597438,0.029857937],"study_design_scores_gemma":[0.00037576116,0.00007248216,0.00020342594,0.00012050011,0.000008123943,0.0000017979968,0.00007062647,0.9215059,0.00010688677,0.0016992355,0.07573053,0.00010469498],"about_ca_topic_score_codex":0.0000217532,"about_ca_topic_score_gemma":0.000079486825,"teacher_disagreement_score":0.81700134,"about_ca_system_score_codex":0.0000616611,"about_ca_system_score_gemma":0.000077034674,"threshold_uncertainty_score":0.6290504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02168146,0.00020577069,0.97539383,0.00060225074,0.00048567596,0.0007380102,0.000006073243,0.00022416166,0.000662766],"genre_scores_gemma":[0.5365736,0.00005233936,0.4600157,0.00012538063,0.00022542088,0.0005656217,0.00017710181,0.000041003557,0.0022238404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989756,0.00006851536,0.00018925384,0.00020316482,0.00023795574,0.00032553027],"domain_scores_gemma":[0.9992278,0.00017142219,0.0000030273025,0.00019983944,0.00033393726,0.0000639575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055241125,0.00009154166,0.0000973166,0.0004746824,0.00037107998,0.0003717064,0.00019553573,0.00006542267,0.000035245255],"category_scores_gemma":[0.000046325993,0.0000952581,0.000043069205,0.00078802573,0.000056572873,0.00016637858,0.00005813952,0.00024460387,0.0000256848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001067304,0.000041430074,0.00008534531,0.000064833235,0.00004602655,7.524133e-7,0.00063619565,0.9037544,0.0006195013,0.005073855,0.003497554,0.0861694],"study_design_scores_gemma":[0.00047243966,0.00003887517,0.00012928636,0.00005385,0.00000416322,6.840326e-7,0.0002951134,0.99220246,0.0035321317,0.00003089674,0.0031518156,0.00008826469],"about_ca_topic_score_codex":0.00004301534,"about_ca_topic_score_gemma":0.000027080185,"teacher_disagreement_score":0.5153781,"about_ca_system_score_codex":0.00018186953,"about_ca_system_score_gemma":0.00010605389,"threshold_uncertainty_score":0.38845128},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044707246,0.00043922407,0.9524335,0.000607484,0.00006165314,0.0012978266,0.000048797185,0.000094285984,0.00030997017],"genre_scores_gemma":[0.82346463,0.00029977478,0.174419,0.000037840557,0.000024397605,0.0007289966,0.00083029916,0.000023126737,0.00017189942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895114,0.00009828261,0.0003754717,0.00021175173,0.00015643895,0.0002069376],"domain_scores_gemma":[0.9983537,0.00030056507,0.000024803789,0.00040871263,0.00086395326,0.000048268663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838433,0.00010894466,0.00014360581,0.0004539236,0.0005626616,0.00016386676,0.00019131212,0.000072323826,0.000019814173],"category_scores_gemma":[0.00007383217,0.00012500901,0.000027771237,0.0007069528,0.00010691637,0.00036368452,0.00008561402,0.00014997266,0.000003143681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066417615,0.000054547407,0.000040958683,0.0000852421,0.000024842358,3.1154656e-8,0.001337135,0.977508,0.0026733358,0.008886716,0.0005243737,0.0088581825],"study_design_scores_gemma":[0.00041866917,0.00004462471,0.00021971556,0.00009193612,0.000014795271,6.246137e-7,0.00087277807,0.9960103,0.0016935685,0.00009192544,0.0004416855,0.00009935349],"about_ca_topic_score_codex":0.00011293092,"about_ca_topic_score_gemma":0.0000756419,"teacher_disagreement_score":0.7787574,"about_ca_system_score_codex":0.00012487106,"about_ca_system_score_gemma":0.00008308941,"threshold_uncertainty_score":0.509772},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052837253,0.0018469979,0.93895924,0.0010019611,0.00028248515,0.00035574808,0.0000080271775,0.00008137875,0.004626907],"genre_scores_gemma":[0.9928132,0.00020565053,0.0061099976,0.00002131719,0.000028992237,0.00002452346,0.000023089033,0.00000827335,0.00076491863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992591,0.00007731177,0.00021112715,0.00011433573,0.00015661624,0.00018151055],"domain_scores_gemma":[0.99918914,0.0003471428,0.000006325517,0.00019646809,0.00022190729,0.000039039303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062399154,0.00006956581,0.000092827984,0.00013968554,0.0004118526,0.00019465583,0.00016834428,0.000036325324,0.000013769417],"category_scores_gemma":[0.00013877882,0.00005337106,0.000013288531,0.00033628073,0.00014738378,0.00005896775,0.000076707314,0.00025458622,0.0000022757877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008819259,0.00003514029,0.0010435951,0.00008836296,0.000087627115,0.0000040472787,0.00064286386,0.93316555,0.0032318896,0.027023366,0.006663877,0.028004887],"study_design_scores_gemma":[0.00014807537,0.000027471737,0.0016441725,0.00009870339,0.0000045732068,0.000001129544,0.00031205232,0.98781615,0.0008942434,0.00012947117,0.008863827,0.000060097012],"about_ca_topic_score_codex":0.000116969975,"about_ca_topic_score_gemma":0.000073491654,"teacher_disagreement_score":0.939976,"about_ca_system_score_codex":0.000040534782,"about_ca_system_score_gemma":0.00007364578,"threshold_uncertainty_score":0.3167679},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3246232,0.057236396,0.53583604,0.012545594,0.003615564,0.0061807153,0.000027063157,0.0027763455,0.057159122],"genre_scores_gemma":[0.93547034,0.005447061,0.05265801,0.00011695753,0.00013135528,0.0004506217,0.00014926659,0.00004946375,0.005526894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982662,0.00043848803,0.0004090984,0.00020434675,0.00032221558,0.00035961904],"domain_scores_gemma":[0.9976785,0.00063751586,0.0000103778075,0.00086586736,0.00074736343,0.000060363913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015158093,0.00012683988,0.00012901617,0.00028708272,0.0009956519,0.000808774,0.00078802113,0.00008091107,0.000010774844],"category_scores_gemma":[0.00013311872,0.0001025944,0.000042573753,0.0017410758,0.00013182203,0.00024593913,0.00017859877,0.00058260176,0.00019725009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015253943,0.000059341604,0.0011843084,0.00013881565,0.000183969,0.000002414706,0.00202814,0.55762076,0.029615304,0.060664386,0.0045652534,0.34392208],"study_design_scores_gemma":[0.00014954503,0.000012245249,0.0016266016,0.0001499401,0.0000022858687,0.0000013246622,0.00040193618,0.63915104,0.0026602286,0.00014689165,0.35559928,0.00009865833],"about_ca_topic_score_codex":0.00008845778,"about_ca_topic_score_gemma":0.0003431258,"teacher_disagreement_score":0.6108472,"about_ca_system_score_codex":0.0001710616,"about_ca_system_score_gemma":0.00015763138,"threshold_uncertainty_score":0.77990264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8640866,0.000085992324,0.12729637,0.0060582343,0.00026790574,0.0004567717,0.000026796331,0.000028557948,0.0016927229],"genre_scores_gemma":[0.98820853,0.00013806167,0.0032468652,0.000058560163,0.000058118192,0.000060400318,0.00007361754,0.000005299941,0.008150534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996313,0.0010758775,0.0006462543,0.00047960255,0.001097216,0.00038806346],"domain_scores_gemma":[0.9973932,0.000729852,0.000030427664,0.00050670997,0.0012702948,0.0000695488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057065035,0.000093392286,0.00021787526,0.0016513043,0.0008193237,0.00094948313,0.000636748,0.0000875595,0.00022901325],"category_scores_gemma":[0.0011723209,0.00008011744,0.000085894164,0.0041527147,0.00014901774,0.0005676451,0.00006730441,0.00030249663,0.00013814043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018795086,0.00028397614,0.031000555,0.00002270152,0.000060740767,0.00008180408,0.005483332,0.67650133,0.0009341096,0.08631889,0.029641941,0.1694827],"study_design_scores_gemma":[0.0012166821,0.00012486128,0.24897833,0.000053412554,0.000023824348,0.0000011651119,0.010449489,0.6212676,0.0026988413,0.090621196,0.024287827,0.00027675377],"about_ca_topic_score_codex":0.0035633852,"about_ca_topic_score_gemma":0.0061382744,"teacher_disagreement_score":0.21797778,"about_ca_system_score_codex":0.0001689139,"about_ca_system_score_gemma":0.00038143067,"threshold_uncertainty_score":0.9155888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18137453,0.002041037,0.48166132,0.058297943,0.0025560136,0.010049373,0.00002475611,0.00071588665,0.2632791],"genre_scores_gemma":[0.9788594,0.00020603972,0.0018850941,0.0012621527,0.00020713412,0.0003077817,0.00009647595,0.000017124605,0.017158777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974261,0.00007823756,0.000388442,0.00059351785,0.00059233716,0.00092134485],"domain_scores_gemma":[0.9988809,0.000074667514,0.00002408711,0.0005889445,0.0004065552,0.00002481914],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013940439,0.00020973079,0.00022115646,0.001461291,0.0007487199,0.0010428117,0.0009695876,0.00008131943,0.00008292682],"category_scores_gemma":[0.000096408476,0.00020217898,0.00006407623,0.003935328,0.00021950365,0.00069878733,0.0015686102,0.0003088948,0.00027475756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043819702,0.000355942,0.013553126,0.00056511216,0.00006633744,0.00039720765,0.00007315794,0.07259023,0.000006812167,0.8301787,0.035714194,0.046455376],"study_design_scores_gemma":[0.0016844792,0.000051174484,0.0495457,0.0002921021,0.000032723543,0.0000016670139,0.008844827,0.7532341,0.000004400074,0.029119017,0.15670276,0.00048707562],"about_ca_topic_score_codex":0.0072581894,"about_ca_topic_score_gemma":0.003971563,"teacher_disagreement_score":0.80105966,"about_ca_system_score_codex":0.00057886395,"about_ca_system_score_gemma":0.000105309635,"threshold_uncertainty_score":0.9999942},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05018708,0.00030726296,0.94333136,0.0002913282,0.00019602632,0.0014159363,0.000010120988,0.00040478678,0.003856071],"genre_scores_gemma":[0.92618,0.00012492789,0.07008718,0.000030630155,0.000080782615,0.0017852044,0.00012242662,0.000036046982,0.0015527693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881494,0.00009081213,0.0002777956,0.00027404376,0.00023856491,0.0003038637],"domain_scores_gemma":[0.9989971,0.00015783118,0.00000808006,0.0003777083,0.00039032128,0.00006897275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000368698,0.00012875315,0.00014007081,0.0005689709,0.00062987185,0.00029787282,0.00024536895,0.000091909555,0.0000646443],"category_scores_gemma":[0.000028559376,0.00013862345,0.00004341479,0.001824292,0.00006474297,0.00011318358,0.000048386544,0.0002883515,0.000062161605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047276017,0.00013281111,0.00004498243,0.0000584747,0.000036899037,0.0000012250106,0.00011017146,0.985213,0.002058888,0.002888318,0.0062029804,0.0032475442],"study_design_scores_gemma":[0.00049708213,0.00010981306,0.00008534426,0.000052752348,0.00001730065,0.0000013563133,0.000034381785,0.9911753,0.003123143,0.00022612792,0.004565527,0.00011188427],"about_ca_topic_score_codex":0.00009544682,"about_ca_topic_score_gemma":0.000116057556,"teacher_disagreement_score":0.87599295,"about_ca_system_score_codex":0.00017629433,"about_ca_system_score_gemma":0.00019908023,"threshold_uncertainty_score":0.56529003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008140867,0.0002857033,0.9943475,0.00070328335,0.0005009329,0.0016045365,0.000011128626,0.000273619,0.0014591945],"genre_scores_gemma":[0.5745643,0.00012008439,0.4161685,0.0003431807,0.00018824078,0.0011442,0.0006371772,0.00013196125,0.0067023304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985172,0.00018508524,0.0002859612,0.0003360841,0.00025459682,0.00042106147],"domain_scores_gemma":[0.99872965,0.00031578267,0.0000105679255,0.0003385493,0.0005120755,0.00009337717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009068138,0.0001577381,0.00020205411,0.00043550986,0.000829926,0.0008538121,0.00052727765,0.00009827513,0.000044215576],"category_scores_gemma":[0.00011023514,0.00016247985,0.000053418393,0.00086457,0.00007384575,0.00020106709,0.00020752817,0.00038795266,0.000037367958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035541727,0.00004320801,0.000042776668,0.000086877495,0.000027835948,0.0000010190565,0.00017752567,0.9428287,0.00036069908,0.00084682147,0.0074118935,0.048169084],"study_design_scores_gemma":[0.00075703254,0.00010089861,0.00005119875,0.00022179,0.000007877827,0.0000010593095,0.000039499326,0.95848614,0.00082954834,0.00014095979,0.039201643,0.00016234146],"about_ca_topic_score_codex":0.00004413761,"about_ca_topic_score_gemma":0.000032828477,"teacher_disagreement_score":0.578179,"about_ca_system_score_codex":0.00014137938,"about_ca_system_score_gemma":0.0001718757,"threshold_uncertainty_score":0.82333297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08250351,0.00019246347,0.91598815,0.00027517468,0.00009336543,0.0008435653,0.0000031068282,0.00005786551,0.000042827538],"genre_scores_gemma":[0.582398,0.0000069912076,0.41739032,0.000008155261,0.000037513455,0.00012051166,0.000009582247,0.000012076672,0.000016860457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878263,0.000043608838,0.00046761325,0.00023316607,0.0002592652,0.00021370167],"domain_scores_gemma":[0.9987051,0.00022607279,0.00002553159,0.00033703775,0.0006680505,0.00003824763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011780384,0.00009927803,0.00018665392,0.00038711022,0.00021681617,0.000058642807,0.00034234452,0.0000723447,0.000001109319],"category_scores_gemma":[0.000281146,0.00009009234,0.000040899173,0.0010258442,0.00011930461,0.00016104971,0.000059375914,0.0002729599,7.4894143e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090354315,0.00012959294,0.000051961306,0.00032504695,0.000026746182,3.782259e-8,0.001871431,0.98304915,0.002752364,0.0073730187,0.0000083165705,0.004403286],"study_design_scores_gemma":[0.00033635087,0.000017812425,0.000027437813,0.00020828337,0.000009513613,0.0000011167942,0.00064077106,0.9947472,0.0031664344,0.00077015726,0.0000021301573,0.00007279608],"about_ca_topic_score_codex":0.000013477035,"about_ca_topic_score_gemma":0.000020666059,"teacher_disagreement_score":0.4998945,"about_ca_system_score_codex":0.00006366209,"about_ca_system_score_gemma":0.00017949841,"threshold_uncertainty_score":0.3673859},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06128884,0.00011353526,0.90601707,0.02248515,0.00026319295,0.0019036605,0.0000037084187,0.00014709601,0.007777774],"genre_scores_gemma":[0.9564145,0.000015131054,0.034557093,0.006523523,0.00050113525,0.0005169206,0.00007231117,0.000022579869,0.0013767676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853325,0.00004563659,0.00026935578,0.00044569996,0.00038033773,0.00032574646],"domain_scores_gemma":[0.9989441,0.00013005963,0.000026199232,0.00031235963,0.0005534677,0.000033809123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007869544,0.0001346523,0.00013929972,0.00064656325,0.0008039342,0.00079705013,0.00028125005,0.00006743596,0.000030189183],"category_scores_gemma":[0.00043162677,0.00014413513,0.000029061399,0.001204279,0.000050944614,0.0003129919,0.0005952255,0.00022162432,0.00008222826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007542641,0.00006973905,0.00028279645,0.0000844895,0.000024942698,9.4476786e-7,0.00009074912,0.84831625,0.00023570817,0.133437,0.011818466,0.0056313667],"study_design_scores_gemma":[0.00023961808,0.0000099302115,0.0003609307,0.000110760164,0.000013153964,1.7130013e-7,0.00015093345,0.98549116,0.00006244412,0.0013723691,0.01205969,0.00012884238],"about_ca_topic_score_codex":0.00025585957,"about_ca_topic_score_gemma":0.000080344005,"teacher_disagreement_score":0.8951257,"about_ca_system_score_codex":0.00013178201,"about_ca_system_score_gemma":0.00005557398,"threshold_uncertainty_score":0.76859725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051797718,0.00011675568,0.943687,0.0006855997,0.000110323024,0.0005375916,0.000004414131,0.00016351233,0.0028970803],"genre_scores_gemma":[0.81328565,0.00019002278,0.1852633,0.00015369075,0.00006844306,0.00027280024,0.00015185867,0.000030361847,0.00058389123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988889,0.000072186405,0.00020998511,0.00027917806,0.00028775286,0.0002619746],"domain_scores_gemma":[0.99909645,0.00011785284,0.000007274539,0.00039249632,0.00032215426,0.00006378523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034868324,0.00012364122,0.000117203264,0.0004350075,0.0004995942,0.0002734645,0.00019561505,0.000062238425,0.00007099206],"category_scores_gemma":[0.000019057652,0.000117326366,0.000020158932,0.0008953995,0.00006148831,0.0001857932,0.00006433635,0.00025256985,0.00004135011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021212518,0.00004881903,0.000042699838,0.000021446216,0.000041890722,9.5358064e-7,0.00011310961,0.9888785,0.00016195036,0.005287289,0.0041626403,0.0012194901],"study_design_scores_gemma":[0.00046698036,0.00008525808,0.000096629155,0.00009054212,0.0000077990135,0.0000016420396,0.00006566113,0.9979046,0.00063574675,0.000036568388,0.0004941113,0.00011448505],"about_ca_topic_score_codex":0.000024895102,"about_ca_topic_score_gemma":0.000034427936,"teacher_disagreement_score":0.7614879,"about_ca_system_score_codex":0.00021319246,"about_ca_system_score_gemma":0.00009337023,"threshold_uncertainty_score":0.47844306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006199528,0.0002933384,0.98322874,0.0010026839,0.0004966278,0.000563287,0.0000022318488,0.00021908543,0.007994455],"genre_scores_gemma":[0.9374033,0.00020637827,0.05549609,0.00014042883,0.00018599228,0.0002980183,0.00007802516,0.000026395048,0.006165379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929726,0.00003078002,0.00013472668,0.00015216683,0.00013214364,0.00025290615],"domain_scores_gemma":[0.99953544,0.00011024159,0.0000023077746,0.00018518866,0.00012999082,0.000036816476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030474973,0.00007468928,0.00008214916,0.00027608193,0.0002957101,0.00019758048,0.00019625427,0.000044084572,0.000026143884],"category_scores_gemma":[0.000033058586,0.00007698309,0.000032857803,0.0005864231,0.00003071604,0.0001331605,0.0000563428,0.00013082745,0.000023159993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031168054,0.000012170744,0.00008331024,0.00005186242,0.000030491434,4.8204885e-7,0.00014569836,0.905714,0.00007367814,0.004627214,0.060786504,0.02847149],"study_design_scores_gemma":[0.00023217544,0.000012456527,0.00020810448,0.00006558077,0.0000047012954,7.6472425e-8,0.00010594296,0.97750837,0.00029104817,0.00005520391,0.021443779,0.00007258317],"about_ca_topic_score_codex":0.000009021343,"about_ca_topic_score_gemma":0.00003414535,"teacher_disagreement_score":0.9312038,"about_ca_system_score_codex":0.000097659045,"about_ca_system_score_gemma":0.00003136105,"threshold_uncertainty_score":0.31392792},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013504781,0.00014455046,0.96069026,0.00016464166,0.00087086356,0.00037095402,0.000016193426,0.00019159338,0.024046184],"genre_scores_gemma":[0.98652464,0.00006983461,0.005683668,0.000014196314,0.00021419126,0.00022153447,0.000117108866,0.000031800253,0.0071230372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998742,0.00009781985,0.0002873359,0.00027419752,0.00026343248,0.0003352431],"domain_scores_gemma":[0.9993308,0.00009209522,0.000007687084,0.00020859625,0.0002934371,0.00006734381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005265418,0.00012789853,0.00015601137,0.0004165083,0.0004213786,0.0002991909,0.00040710805,0.00007573495,0.000044848213],"category_scores_gemma":[0.000053013282,0.00013037713,0.000060528546,0.0004380244,0.000049207283,0.00037439755,0.00008984376,0.0003204208,0.00002510258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008205614,0.000034892502,0.0000048464603,0.000028853743,0.00005216994,9.012545e-7,0.0010770959,0.96003854,0.01676951,0.0025942584,0.002291352,0.017099353],"study_design_scores_gemma":[0.00032067785,0.000054815926,0.00014172867,0.000077116936,0.000004146518,0.0000033596982,0.00007938993,0.9851497,0.00060347153,0.000071740054,0.013394518,0.00009937761],"about_ca_topic_score_codex":0.00006143457,"about_ca_topic_score_gemma":0.000013703336,"teacher_disagreement_score":0.97301984,"about_ca_system_score_codex":0.00013749019,"about_ca_system_score_gemma":0.000044700755,"threshold_uncertainty_score":0.53166246},"labels":[],"label_agreement":null},{"id":"W4416773034","doi":"10.1016/j.cor.2025.107341","title":"A data-driven heuristic for the dynamic vehicle routing problem with multiple soft time windows","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"King Fahd University of Petroleum and Minerals","keywords":"Vehicle routing problem; Benchmark (surveying); Flexibility (engineering); Heuristic; Adaptability; Genetic algorithm; Crossover; Service (business)","score_opus":0.047575154236137486,"score_gpt":0.35770509348541674,"score_spread":0.31012993924927923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416773034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051657185,0.00013989741,0.9913719,0.0011023992,0.000112107366,0.0014776002,0.00007686705,0.0002858791,0.00026760463],"genre_scores_gemma":[0.5480638,0.000015817839,0.450302,0.0000624729,0.00007231856,0.00027729568,0.00020366877,0.000051812614,0.00095079484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983773,0.00024111813,0.0002801263,0.0003723567,0.00027997926,0.00044908148],"domain_scores_gemma":[0.99667966,0.002005894,0.000012782109,0.000871555,0.00036867813,0.000061450955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014588647,0.00014630813,0.00017236124,0.00020114404,0.0009317403,0.00043348531,0.000919534,0.00006187183,0.0000126207915],"category_scores_gemma":[0.00041731296,0.000114170296,0.000030075755,0.0008745641,0.00012332154,0.0002319388,0.00035995626,0.00040202567,0.000032753444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001293772,0.000024002285,0.00016568396,0.000050397517,0.00008183741,0.000001250451,0.00026323725,0.9824957,0.0007918481,0.0002675198,0.002346622,0.013498933],"study_design_scores_gemma":[0.0006121805,0.00003933591,0.00039926523,0.00009544466,0.000019450757,0.000002809784,0.00008892268,0.9964752,0.00009056755,0.000022039205,0.0020305475,0.00012423737],"about_ca_topic_score_codex":0.00003636824,"about_ca_topic_score_gemma":0.0001671535,"teacher_disagreement_score":0.5428981,"about_ca_system_score_codex":0.00015390824,"about_ca_system_score_gemma":0.00019223985,"threshold_uncertainty_score":0.7166287},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4407081,0.00049307704,0.45691106,0.02829466,0.0014283638,0.006541364,0.000006381012,0.0007201965,0.06489681],"genre_scores_gemma":[0.99449384,0.00004822695,0.0022088832,0.000623893,0.000093526076,0.00026131672,0.0000621342,0.000011711622,0.002196484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839383,0.0000957064,0.0003237138,0.0004515726,0.00040083186,0.00033432792],"domain_scores_gemma":[0.9975346,0.00005767622,0.000015546915,0.00032764822,0.0020398719,0.00002469334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013428119,0.0001534419,0.00017447627,0.0009346282,0.0012428734,0.0006708973,0.00023183474,0.000049933984,0.00011714022],"category_scores_gemma":[0.0001939879,0.00013813541,0.000033155113,0.0028937296,0.00021336385,0.000857865,0.00023341755,0.00025333243,0.00013639832],"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.0012289309,0.0010046074,0.006532115,0.0021247,0.0005853515,0.0000110308165,0.0021119544,0.5951608,0.00045783317,0.13525121,0.19978158,0.055749927],"study_design_scores_gemma":[0.0017532328,0.000026132338,0.0042382986,0.00013836386,0.00003220668,7.3816665e-7,0.0014573581,0.95994264,0.00004330487,0.0003278857,0.031842723,0.00019712212],"about_ca_topic_score_codex":0.007927179,"about_ca_topic_score_gemma":0.0058361473,"teacher_disagreement_score":0.55378574,"about_ca_system_score_codex":0.00013103157,"about_ca_system_score_gemma":0.0001544409,"threshold_uncertainty_score":0.9986791},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006654037,0.00007374119,0.98925793,0.0005888211,0.00005829555,0.003129829,0.0000134931,0.00016535458,0.00005851894],"genre_scores_gemma":[0.39858982,0.000031968335,0.6006621,0.00004881967,0.000026012858,0.0005101505,0.00007721575,0.00001460591,0.000039303868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963824,0.0012390164,0.00042805195,0.0010969967,0.00039857216,0.0004549565],"domain_scores_gemma":[0.99642986,0.0009040881,0.000037927148,0.00063627335,0.0018326079,0.00015921441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025543892,0.00023261945,0.00030754425,0.0010118112,0.0010034089,0.00047887448,0.00052437757,0.00012183592,0.000006922626],"category_scores_gemma":[0.0003814249,0.0002263054,0.00003824187,0.0024543838,0.0002485358,0.0012772437,0.0002556178,0.0006418269,0.0000016563018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000123389,0.00023277769,0.00055146415,0.000027930997,0.00002167159,0.0000015772388,0.00085715274,0.854539,0.001970377,0.0010132006,5.2672397e-7,0.14066096],"study_design_scores_gemma":[0.0027875805,0.00059567334,0.00216486,0.00003509058,0.0000054269053,0.000010425371,0.00026042998,0.9885912,0.005224827,0.00008390303,0.000028105149,0.00021251154],"about_ca_topic_score_codex":0.00059888425,"about_ca_topic_score_gemma":0.0011498077,"teacher_disagreement_score":0.39193577,"about_ca_system_score_codex":0.00040304757,"about_ca_system_score_gemma":0.00044535118,"threshold_uncertainty_score":0.9228467},"labels":[],"label_agreement":null},{"id":"W6921793134","doi":"10.1016/j.cor.2025.107198","title":"Integrated and sequential algorithms for the robust two-echelon location-routing problem under demand uncertainty","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"GLS Industries (Canada); Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Robustness (evolution); Benchmark (surveying); Robust optimization; Heuristic; Facility location problem; Vehicle routing problem","score_opus":0.0952182887740222,"score_gpt":0.39118072464910475,"score_spread":0.29596243587508253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921793134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043932516,0.00036837233,0.9919022,0.0015925285,0.00023999026,0.0009851665,0.00000792011,0.00017331622,0.0003372713],"genre_scores_gemma":[0.54750705,0.00007435397,0.45132136,0.000104906234,0.000114587056,0.0002701019,0.00006837628,0.000032155112,0.00050711096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985876,0.00030114467,0.00029006452,0.00027437753,0.0002031648,0.00034362893],"domain_scores_gemma":[0.9979488,0.0009813893,0.000010887118,0.00027805284,0.00072332646,0.00005752936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093742,0.00013583252,0.00013995577,0.0002373157,0.0009553418,0.0005192971,0.00027846653,0.00007988353,0.000009390955],"category_scores_gemma":[0.00021658685,0.000110827605,0.000031128588,0.0011132461,0.000149983,0.00015008298,0.0001295803,0.00039366243,0.0000034528643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049879227,0.000011817277,0.00003475002,0.000044483684,0.00006581304,2.7769943e-7,0.00031358394,0.96575797,0.0005401001,0.010163204,0.00080500223,0.022258025],"study_design_scores_gemma":[0.0005073296,0.000018995595,0.00012920181,0.00009015272,0.000015595351,0.0000027918525,0.00043110267,0.9971847,0.00059394486,0.00030014728,0.0006184726,0.000107546075],"about_ca_topic_score_codex":0.00019846132,"about_ca_topic_score_gemma":0.00020046528,"teacher_disagreement_score":0.54311377,"about_ca_system_score_codex":0.00022187142,"about_ca_system_score_gemma":0.00022382043,"threshold_uncertainty_score":0.7347813},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09286495,0.00088954787,0.79688096,0.09282506,0.0009670743,0.0015773578,0.000004933855,0.00028944013,0.013700673],"genre_scores_gemma":[0.7632302,0.000049868686,0.21776079,0.0003195796,0.000115428695,0.00015786145,0.000025083162,0.0000045543766,0.018336646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723214,0.0003638046,0.0003835724,0.0008689086,0.00043691194,0.0007146899],"domain_scores_gemma":[0.99799025,0.00024431798,0.000020142486,0.0010759135,0.00056954846,0.000099843775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016897469,0.00018670705,0.00024496065,0.0006000693,0.0005408717,0.0006564939,0.0017714036,0.00010460003,0.00006339547],"category_scores_gemma":[0.00041612284,0.00018532666,0.000053704556,0.0026962198,0.00017678531,0.00044087888,0.0012319849,0.0007165635,0.000112801434],"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.000048228354,0.0009898222,0.0027203208,0.00043071702,0.000120155644,0.00021677454,0.0039459695,0.3312131,0.054289855,0.40286973,0.08176866,0.12138667],"study_design_scores_gemma":[0.0013090383,0.0001264504,0.0018457653,0.0004453878,0.000003412598,0.000021250922,0.00022971856,0.8347218,0.07146995,0.0036741265,0.08565123,0.0005018875],"about_ca_topic_score_codex":0.0002622292,"about_ca_topic_score_gemma":0.00012126817,"teacher_disagreement_score":0.6703652,"about_ca_system_score_codex":0.00014622357,"about_ca_system_score_gemma":0.0005082015,"threshold_uncertainty_score":0.75574017},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14587003,0.00064994994,0.8386925,0.0077173766,0.00023678062,0.0012568565,0.0000080726595,0.00010594252,0.005462477],"genre_scores_gemma":[0.995544,0.00003052971,0.0020232266,0.00007042747,0.00006730963,0.000087911525,0.000056212073,0.0000067394844,0.002113618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719346,0.0013245394,0.00024629998,0.0002518406,0.0005256089,0.00045827535],"domain_scores_gemma":[0.99875325,0.00053595327,0.00002048776,0.00018733858,0.00045227373,0.00005067429],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022402192,0.000098453565,0.00014054638,0.00025416966,0.003873504,0.0005277145,0.00037541686,0.000077586665,0.000013219989],"category_scores_gemma":[0.0004001206,0.000079897174,0.000051972802,0.0019447964,0.0004816722,0.00020091387,0.00013322194,0.00053966534,0.000007594812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017900387,0.00015794003,0.020236151,0.000027335216,0.000033239376,0.000001760387,0.020009594,0.92452216,0.000105725805,0.028755875,0.0033320817,0.0028002132],"study_design_scores_gemma":[0.00029773838,0.00002086335,0.003611066,0.00006597674,0.000005700509,2.33378e-7,0.011160015,0.97623247,0.000013604184,0.00014360198,0.008354676,0.0000940506],"about_ca_topic_score_codex":0.003743603,"about_ca_topic_score_gemma":0.002508229,"teacher_disagreement_score":0.849674,"about_ca_system_score_codex":0.0005872682,"about_ca_system_score_gemma":0.0006714927,"threshold_uncertainty_score":0.9974233},"labels":[],"label_agreement":null}]}