{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":62,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":62,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"facb819bf4e4","filters":{"venue":"Journal of Heuristics"}},"results":[{"id":"W2152304735","doi":"10.1023/a:1011336210885","title":"Variable Neighborhood Decomposition Search","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":291,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Variable neighborhood search; Metaheuristic; Local search (optimization); Descent (aeronautics); Mathematical optimization; Variable (mathematics); Node (physics); Gradient descent; Decomposition; Computer science; Local optimum; Algorithm; Mathematics; Artificial intelligence; Artificial neural network","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Dionisio Perez-Britos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01601429448935615,"gpt":0.2909555204022765,"spread":0.2749412259129203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008397948,0.0007308543,0.001346164,0.001189443,0.0008501987,0.001151011,0.001009304,0.001313914,0.0117669],"category_scores_gemma":[0.002976638,0.0007105193,0.0008246004,0.001257326,0.0007583617,0.001242996,0.0009921413,0.001308342,0.001449068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006955572,"about_ca_system_score_gemma":0.001037311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00342286,"about_ca_topic_score_gemma":0.004327512,"domain_scores_codex":[0.9995141,0.0002167201,0.00001465332,0.00009970034,0.0001024715,0.00005235987],"domain_scores_gemma":[0.9994209,0.0003177328,0.00003564373,0.00008463098,0.0001060135,0.00003517771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002750498,0.0002165728,0.0008103232,0.0001521831,0.0001142569,0.00006522565,0.0001071005,0.5623479,0.001691158,0.09347977,0.02394345,0.3167969],"study_design_scores_gemma":[0.00005320726,0.00005991343,0.000146834,0.00002968924,0.00002411615,0.00003700827,0.00002534601,0.9695092,0.0005676379,0.02379402,0.005745017,0.000007869416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02367569,0.001328686,0.9366207,0.0005354781,0.0004037144,0.0001351745,0.0001952057,0.0004945616,0.03661082],"genre_scores_gemma":[0.2767416,0.0007174031,0.6928264,0.000403617,0.000195966,0.0003676661,0.0007025736,0.0003823941,0.02766237],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0117669,"threshold_uncertainty_score":0.03936422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1515177345","doi":"10.1023/a:1009621410177","title":"Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics","year":2000,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":178,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"European Commission","keywords":"Guided Local Search; Mathematical optimization; Tabu search; Local search (optimization); Constraint programming; Maxima and minima; Computer science; Hill climbing; Heuristics; Iterated local search; Benchmark (surveying); Local optimum; Beam search; Search algorithm; Algorithm; Mathematics","authors":[{"name":"Bruno De Backer","is_ca":true},{"name":"Vincent Furnon","is_ca":true},{"name":"Paul Shaw","is_ca":true},{"name":"Philip Kilby","is_ca":false},{"name":"Patrick Prosser","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02357958217797698,"gpt":0.2642158582860454,"spread":0.2406362761080685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864751,0.001261854,0.001295487,0.001673067,0.00063985,0.001945606,0.001755632,0.002192643,0.002930552],"category_scores_gemma":[0.005088202,0.00104555,0.001179959,0.003222766,0.0007084743,0.001460367,0.0008097127,0.001698728,0.000284675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001201391,"about_ca_system_score_gemma":0.002591121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01500715,"about_ca_topic_score_gemma":0.01291248,"domain_scores_codex":[0.9991022,0.0004653668,0.00004663569,0.00008695362,0.0001943117,0.0001045773],"domain_scores_gemma":[0.9977279,0.001793204,0.0001619735,0.00008623603,0.0001877646,0.00004279118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004405426,0.00006316805,0.0002217508,0.0001267869,0.00006995293,0.00004215474,0.00002767699,0.9475182,0.0004747635,0.0149608,0.001137637,0.03531298],"study_design_scores_gemma":[0.00002756155,0.00002052172,0.0000468997,0.00001840281,0.00001774166,0.00001191931,0.00001820309,0.9922903,0.000313639,0.006306694,0.0009224105,0.000005640254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02453551,0.001042332,0.9628654,0.0004240584,0.0001186553,0.0002201615,0.0001571433,0.0002518756,0.01038487],"genre_scores_gemma":[0.2048569,0.001137688,0.7901365,0.0002188745,0.0001038018,0.0005180677,0.0002501731,0.0001161909,0.00266178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01500715,"threshold_uncertainty_score":0.02983958,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131742526","doi":"10.1023/b:heur.0000026897.40171.1a","title":"Cooperative Parallel Variable Neighborhood Search for the p-Median","year":2004,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":166,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Computer Research Institute of Montréal; Group for Research in Decision Analysis; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Variable neighborhood search; Benchmark (surveying); Heuristics; Variable (mathematics); Heuristic; Mathematical optimization; Computation; Local search (optimization); Mathematics; Computer science; Algorithm; Metaheuristic","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0335307563130683,"gpt":0.2585883557830647,"spread":0.2250575994699964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344081,0.0007555853,0.002392666,0.001592015,0.001547608,0.001225035,0.002911627,0.001658223,0.005428411],"category_scores_gemma":[0.006311774,0.000866672,0.00107121,0.002148749,0.001082219,0.002467724,0.001776125,0.001258023,0.0005864266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001403636,"about_ca_system_score_gemma":0.002418773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01177306,"about_ca_topic_score_gemma":0.01332006,"domain_scores_codex":[0.9989079,0.0004982213,0.0000443091,0.0002112617,0.0001649775,0.0001733234],"domain_scores_gemma":[0.9973368,0.001882222,0.0001442173,0.0002207539,0.0002797862,0.0001362038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005644489,0.000194102,0.0007415937,0.00009606215,0.00007730074,0.00006264454,0.00007835902,0.8968593,0.0007614344,0.02109278,0.003992276,0.07547957],"study_design_scores_gemma":[0.00004787082,0.00004151195,0.00004899301,0.000003904616,0.000007823317,0.00001018623,0.00001307285,0.9919047,0.0001612394,0.007384113,0.0003724216,0.000004159726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04381371,0.0005520839,0.9486099,0.0004060125,0.000138761,0.0001449336,0.0001336979,0.000521099,0.00567987],"genre_scores_gemma":[0.4434977,0.0002166823,0.5494859,0.0002026597,0.0001205834,0.0003158564,0.0002794684,0.0001577463,0.005723497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01177306,"threshold_uncertainty_score":0.02340907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1588856286","doi":"10.1023/a:1013661617536","title":"Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Pruning; Mathematical optimization; Computer science; Reduction (mathematics); Descent (aeronautics); Constraint programming; Variable neighborhood search; Constraint (computer-aided design); Mathematics; Metaheuristic; Stochastic programming","authors":[{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Gilles Pesant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0272116258951607,"gpt":0.2542900346914363,"spread":0.2270784087962756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001533683,0.0009574604,0.0008322761,0.0006560083,0.0004975816,0.001010989,0.001306091,0.0008460629,0.002599214],"category_scores_gemma":[0.003912565,0.000467269,0.000764237,0.001522559,0.0005623751,0.001545145,0.0008311594,0.001685779,0.0002644755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932901,"about_ca_system_score_gemma":0.001808799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008087788,"about_ca_topic_score_gemma":0.005157164,"domain_scores_codex":[0.9994124,0.0002368519,0.00003617926,0.00006348144,0.0001610522,0.00008993993],"domain_scores_gemma":[0.9982457,0.001324027,0.000112288,0.0000676988,0.0001898379,0.00006039118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002767959,0.0001607629,0.000378031,0.0001654673,0.00007548081,0.0001538558,0.0001102018,0.8262054,0.004387077,0.06856456,0.003113459,0.09640899],"study_design_scores_gemma":[0.00003669258,0.00003891404,0.00003439804,0.000008556674,0.00001296098,0.00001859559,0.00001314624,0.9861423,0.0008278803,0.01193793,0.0009209997,0.000007528243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01638762,0.0001858339,0.980387,0.0001079015,0.00005841119,0.00007679931,0.00005794977,0.0001421991,0.002596254],"genre_scores_gemma":[0.1995234,0.0003580401,0.7976357,0.000110828,0.00005160571,0.0002366054,0.0001558948,0.0001448518,0.001783064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008087788,"threshold_uncertainty_score":0.01608139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069850304","doi":"10.1007/s10732-005-5431-6","title":"Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows","year":2004,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Evolutionary algorithm; Set (abstract data type); Computer science; Interval (graph theory); Point (geometry); Mathematical optimization; Routing (electronic design automation); Genetic algorithm; Algorithm; Mathematics; Combinatorics","authors":[{"name":"Olli Br�ysy","is_ca":false},{"name":"Wout Dullaert","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01454589764190389,"gpt":0.2501254344168125,"spread":0.2355795367749086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132538,0.0007053447,0.0008778325,0.0008201947,0.0004156931,0.0009493699,0.001129071,0.001534119,0.002350727],"category_scores_gemma":[0.004624369,0.0006454053,0.0007027207,0.001205558,0.0006608095,0.001650685,0.0008770482,0.001520382,0.000245424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008331786,"about_ca_system_score_gemma":0.000815049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004572835,"about_ca_topic_score_gemma":0.003344579,"domain_scores_codex":[0.9996142,0.0001793756,0.00001683133,0.00004325958,0.0000920935,0.00005419611],"domain_scores_gemma":[0.9984049,0.001327451,0.00007749134,0.00004674727,0.00009717024,0.00004626871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004420548,0.0000354723,0.0002142716,0.0000344536,0.0000364605,0.00002463747,0.00004191634,0.9281508,0.0003240512,0.03510976,0.0006024896,0.03538128],"study_design_scores_gemma":[0.00002421226,0.00001549491,0.00006285004,0.000008487678,0.000009242241,0.00001069714,0.0000104913,0.9842994,0.00009598443,0.0147467,0.0007126624,0.000003769557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02287753,0.001342132,0.9708667,0.0003593425,0.00008512062,0.00003977443,0.00003306479,0.00008761902,0.004308642],"genre_scores_gemma":[0.4499291,0.00224665,0.5367945,0.0001805971,0.0001759715,0.0002485632,0.0001408607,0.0001380054,0.01014568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004572835,"threshold_uncertainty_score":0.00909245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120159299","doi":"10.1023/a:1020325926188","title":"Cooperative Parallel Tabu Search for Capacitated Network Design","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Computer science; Implementation; Mathematical optimization; Class (philosophy); Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07304272904768266,"gpt":0.2879784058940713,"spread":0.2149356768463886,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002190718,0.001066429,0.001308649,0.001564086,0.001203181,0.0008882809,0.00223061,0.00130242,0.005226444],"category_scores_gemma":[0.004455176,0.0010662,0.0008465346,0.002011971,0.0009557947,0.001341139,0.001212345,0.00107845,0.0006996442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009958096,"about_ca_system_score_gemma":0.001706198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008684323,"about_ca_topic_score_gemma":0.009071293,"domain_scores_codex":[0.9991721,0.0004540781,0.00002525474,0.00009090781,0.0001477531,0.0001100174],"domain_scores_gemma":[0.9977912,0.001457391,0.0001626466,0.0002231565,0.0002860157,0.00007960357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000116624,0.00008449503,0.0002434186,0.00004492892,0.00003048579,0.00002166162,0.00004689429,0.9555222,0.0005885883,0.003466447,0.001054744,0.03877952],"study_design_scores_gemma":[0.00003227115,0.00003148835,0.00003360979,0.000002596055,0.000007190333,0.000004569787,0.000009215812,0.9969904,0.0002128284,0.002438183,0.0002352742,0.000002254621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05950853,0.0004533835,0.9292014,0.0002077721,0.00008906857,0.0002040656,0.0001000606,0.0008795768,0.009356115],"genre_scores_gemma":[0.5175674,0.0001960082,0.4766559,0.0001480513,0.0000584901,0.0007262537,0.0002070437,0.0002106331,0.004230184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008684323,"threshold_uncertainty_score":0.01748419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029320154","doi":"10.1007/s10732-014-9275-9","title":"Analysing differences between algorithm configurations through ablation","year":2015,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Compute Canada","keywords":"Computer science; Satisfiability; Algorithm; Integer programming","authors":[{"name":"Chris Fawcett","is_ca":true},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08233675307823943,"gpt":0.3237777667160881,"spread":0.2414410136378487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009226498,0.0006590858,0.0009569346,0.002246433,0.0007954164,0.002417388,0.001559588,0.001768355,0.002231169],"category_scores_gemma":[0.0975994,0.0005488398,0.0008757259,0.002212462,0.00118491,0.003060679,0.001335358,0.002404973,0.0006087402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009523596,"about_ca_system_score_gemma":0.0013022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009357745,"about_ca_topic_score_gemma":0.001038085,"domain_scores_codex":[0.9901068,0.004938975,0.0007742854,0.001232887,0.002217947,0.000729213],"domain_scores_gemma":[0.8483396,0.1301717,0.002692352,0.01138432,0.00646962,0.000942403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.007971299,0.002116025,0.07362862,0.001001753,0.001274613,0.0008064486,0.002032962,0.3701016,0.04992733,0.01507995,0.007313864,0.4687456],"study_design_scores_gemma":[0.0003904152,0.001747261,0.01915685,0.00009658874,0.0004979477,0.0006475787,0.0007816268,0.9198545,0.0270957,0.02663872,0.002986689,0.0001061674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9222093,0.0005531128,0.07079773,0.0003179789,0.0001296684,0.0001137295,0.0003116367,0.001607788,0.003959046],"genre_scores_gemma":[0.9524529,0.0000719681,0.04559127,0.00006938042,0.00001783901,0.0001024942,0.0005875677,0.0006048519,0.0005017896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009226498,"threshold_uncertainty_score":0.04879498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107306858","doi":"10.1007/s10732-006-4192-1","title":"Path relinking for the vehicle routing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Norges Forskningsråd","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Path (computing); Vehicle routing problem; Hill climbing; Mathematics; Local search (optimization); Heuristic; Local optimum; Travelling salesman problem; Routing (electronic design automation); Computer science","authors":[{"name":"Sin C. Ho","is_ca":false},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01283746988427042,"gpt":0.2482447645795565,"spread":0.235407294695286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779798,0.001024699,0.001324356,0.001057283,0.0008151061,0.001156192,0.001677001,0.001143581,0.005312195],"category_scores_gemma":[0.006626944,0.0007721158,0.0008464669,0.001435192,0.001190556,0.002521786,0.001463507,0.002671835,0.0005496618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009012,"about_ca_system_score_gemma":0.001731702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006244975,"about_ca_topic_score_gemma":0.004995558,"domain_scores_codex":[0.9990445,0.0004996003,0.00003301393,0.0001230877,0.0001580574,0.0001417892],"domain_scores_gemma":[0.997016,0.002299481,0.0001845077,0.0001663365,0.0002022381,0.0001314586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002203382,0.0001236772,0.0004099003,0.0002276607,0.0000436619,0.00006205672,0.0001200362,0.8871408,0.0008851888,0.04221092,0.003301622,0.06525416],"study_design_scores_gemma":[0.00004734464,0.00008293196,0.0001085363,0.00002845175,0.00002390067,0.00003671761,0.00005220068,0.9496762,0.0004008213,0.04794854,0.001582682,0.00001170835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05124215,0.001353053,0.9378989,0.0006727147,0.0001575284,0.0001609178,0.0001964129,0.0002584002,0.00805993],"genre_scores_gemma":[0.4354856,0.002048567,0.5519205,0.0001948588,0.0001483692,0.0002627659,0.0004865567,0.0002948764,0.009157876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006244975,"threshold_uncertainty_score":0.01777107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1783225223","doi":"10.1023/a:1013613701606","title":"Constraint Programming Based Column Generation for Crew Assignment","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Column generation; Constraint (computer-aided design); Shortest path problem; Domain (mathematical analysis); Limit (mathematics); Path (computing); Computer science; Space (punctuation); Mathematics; Theoretical computer science","authors":[{"name":"Torsten Fahle","is_ca":false},{"name":"Ulrich Junker","is_ca":false},{"name":"Stefan E. Karisch","is_ca":true},{"name":"Niklas Kohl","is_ca":false},{"name":"Meinolf Sellmann","is_ca":false},{"name":"Bo Vaaben","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0538748117578501,"gpt":0.2743114601091357,"spread":0.2204366483512856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007051935,0.0008959963,0.001016786,0.001271641,0.0009317531,0.001065932,0.001733833,0.0009880493,0.009749372],"category_scores_gemma":[0.002993758,0.000752238,0.0008646293,0.002308461,0.0005809211,0.001096735,0.0007751224,0.001240905,0.000940334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008361015,"about_ca_system_score_gemma":0.001737533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01720245,"about_ca_topic_score_gemma":0.01980662,"domain_scores_codex":[0.9993697,0.000285285,0.00002024434,0.00008361568,0.0001453467,0.00009582188],"domain_scores_gemma":[0.998342,0.001038862,0.00008599336,0.0001683257,0.0003016339,0.00006312413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001913789,0.0002432869,0.0004718408,0.0001690351,0.00005176262,0.0001504458,0.00008498883,0.7527699,0.004033598,0.01361315,0.01308786,0.2151328],"study_design_scores_gemma":[0.00002952497,0.00002982424,0.00007378326,0.000007671802,0.0000106947,0.0000187982,0.00001907356,0.9927981,0.00121627,0.004491285,0.001296155,0.000008774015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01729653,0.0001782863,0.9738461,0.0002229321,0.00009542907,0.0002674237,0.0004797182,0.00124871,0.0063649],"genre_scores_gemma":[0.1848171,0.0001485085,0.8090634,0.000200578,0.00004270927,0.0003825677,0.001002123,0.000269633,0.004073336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01720245,"threshold_uncertainty_score":0.0342046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155616412","doi":"10.1007/s10732-006-6550-4","title":"On global warming: Flow-based soft global constraints","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Local consistency; Constraint (computer-aided design); Cardinality (data modeling); Graph; Constraint graph; Constraint satisfaction; Computer science; Mathematical optimization; Consistency (knowledge bases); Flow (mathematics); Mathematics; Theoretical computer science; Discrete mathematics; Artificial intelligence; Data mining","authors":[{"name":"Willem‐Jan van Hoeve","is_ca":false},{"name":"Gilles Pesant","is_ca":true},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008280661343385138,"gpt":0.2432512250558484,"spread":0.2349705637124633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002900182,0.001229741,0.001442887,0.001619263,0.001135183,0.002307637,0.00205478,0.001827728,0.009074659],"category_scores_gemma":[0.01365197,0.0008326537,0.00123041,0.002020103,0.00260363,0.007760481,0.00315198,0.003873725,0.0003422589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00116757,"about_ca_system_score_gemma":0.001206432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006735604,"about_ca_topic_score_gemma":0.007869856,"domain_scores_codex":[0.9985133,0.0007699589,0.00005003784,0.0001749806,0.0002824679,0.0002093238],"domain_scores_gemma":[0.9913298,0.007015067,0.0003789829,0.0004099506,0.0006047294,0.0002614966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001873175,0.0000817134,0.0006006536,0.0002624557,0.00006415991,0.0001548752,0.0002342293,0.6248423,0.000797142,0.3031662,0.006251024,0.06335792],"study_design_scores_gemma":[0.00004202328,0.00005204645,0.0002600184,0.00005662442,0.00003600442,0.00004144941,0.00009886426,0.6607459,0.0006185342,0.3339252,0.004093905,0.00002947714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04008775,0.001380275,0.9303933,0.002747652,0.0004607443,0.0001816675,0.000302324,0.0002352533,0.02421092],"genre_scores_gemma":[0.6928072,0.001972571,0.29146,0.00116668,0.0005312081,0.0002496939,0.0003905983,0.0002983344,0.01112365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009074659,"threshold_uncertainty_score":0.03035778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170354462","doi":"10.1023/b:heur.0000045323.83583.bd","title":"A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design","year":2004,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Scaling; Mathematical optimization; Perturbation (astronomy); Heuristic; Fixed charge; Computer science; Term (time); Mathematics; Algorithm; Physics","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Bernard Gendron","is_ca":true},{"name":"Geneviève Hernu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03750003750920303,"gpt":0.2883837595759827,"spread":0.2508837220667797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077766,0.0009637116,0.001392127,0.0009573432,0.0006891878,0.0007183641,0.002041803,0.001296182,0.003543453],"category_scores_gemma":[0.003098774,0.0007355686,0.0005538775,0.001009168,0.00068339,0.001369993,0.001143285,0.001221719,0.0002982947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001110503,"about_ca_system_score_gemma":0.001257289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005560325,"about_ca_topic_score_gemma":0.006048015,"domain_scores_codex":[0.9996188,0.0001743851,0.00001462914,0.00004276186,0.00007987634,0.00006961446],"domain_scores_gemma":[0.9990156,0.000572838,0.00009399086,0.00007680725,0.0001545589,0.0000861943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001402641,0.00009278482,0.0001852281,0.00003391881,0.00001671256,0.00003856543,0.00002988361,0.9696764,0.0006607023,0.002967509,0.0007812908,0.02537676],"study_design_scores_gemma":[0.00001649768,0.00003221483,0.00002384495,0.000003419446,0.000005093813,0.000004986418,0.000005589841,0.9987181,0.0001441745,0.0009498689,0.0000933247,0.000002945639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.113899,0.0007233054,0.8742726,0.0004763627,0.0001851818,0.0002481353,0.00008847493,0.0007592092,0.009347766],"genre_scores_gemma":[0.8103518,0.0001367705,0.1866937,0.00018474,0.00004726861,0.0001930851,0.00007785068,0.0001100204,0.002204858],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005560325,"threshold_uncertainty_score":0.01185405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2732645276","doi":"10.1007/s10732-017-9349-6","title":"A heuristic approach for the stochastic optimization of mine production schedules","year":2017,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","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":"Heuristic; Production (economics); Computer science; Open-pit mining; Quality (philosophy); Mathematical optimization; Industrial engineering; Mining engineering; Engineering; Mathematics; Artificial intelligence","authors":[{"name":"Luis V. Montiel","is_ca":true},{"name":"Roussos Dimitrakopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02900842561463446,"gpt":0.2480111971031972,"spread":0.2190027714885627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00144835,0.0008948288,0.0009863761,0.001378831,0.0005045081,0.0007893589,0.001274397,0.0009457695,0.002944903],"category_scores_gemma":[0.002906564,0.0007046051,0.001075039,0.001242124,0.0008790148,0.000567519,0.0006032432,0.0008974907,0.0002717434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529627,"about_ca_system_score_gemma":0.002565994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006857468,"about_ca_topic_score_gemma":0.008576358,"domain_scores_codex":[0.9992765,0.0003475468,0.00002400409,0.00006978162,0.0001976206,0.00008452826],"domain_scores_gemma":[0.9984294,0.001214009,0.0001254879,0.00005243429,0.0001269242,0.00005189701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001893853,0.00001862789,0.0001110662,0.00002742186,0.00001896354,0.00002540443,0.00001615582,0.9850388,0.0002726515,0.006024533,0.0002613543,0.008166085],"study_design_scores_gemma":[0.00001622135,0.00002735871,0.00004781023,0.000006669492,0.000005650907,0.00001014788,0.000006648193,0.9956285,0.0001327613,0.00357779,0.000535909,0.000004638824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01417829,0.0002258988,0.9807961,0.0001162507,0.00003899376,0.0001437123,0.00009238767,0.0001965555,0.004211815],"genre_scores_gemma":[0.3484721,0.0003708223,0.6471578,0.0001136896,0.00006188097,0.0006349154,0.00021759,0.0001026616,0.002868639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006857468,"threshold_uncertainty_score":0.0136351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093962234","doi":"10.1007/s10732-015-9281-6","title":"A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints","year":2015,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Duration (music); Vehicle routing problem; Mathematical optimization; GRASP; Heuristics; Metaheuristic; Computer science; Set (abstract data type); Heuristic; Local search (optimization); Constraint (computer-aided design); Greedy randomized adaptive search procedure; Routing (electronic design automation); Mathematics; Greedy algorithm","authors":[{"name":"Jorge E. Mendoza","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true},{"name":"Juan G. Villegas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02428665998332692,"gpt":0.2586422517296701,"spread":0.2343555917463432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122957,0.0009611062,0.001084445,0.001315984,0.0004175605,0.00113781,0.002156073,0.001882131,0.002735591],"category_scores_gemma":[0.001722179,0.0007701908,0.001268245,0.001470276,0.0004689812,0.00109188,0.0009381183,0.001117399,0.0003108404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001140995,"about_ca_system_score_gemma":0.001522947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005439724,"about_ca_topic_score_gemma":0.00624136,"domain_scores_codex":[0.999428,0.000245699,0.00002864119,0.00007495827,0.0001384099,0.00008428041],"domain_scores_gemma":[0.9990156,0.0006674428,0.00007582877,0.00006492977,0.0001194977,0.00005671356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008342852,0.00009311492,0.0002904428,0.00005298651,0.0000780499,0.00004441872,0.00002257177,0.9585127,0.001211049,0.007560998,0.0009069949,0.03114332],"study_design_scores_gemma":[0.00002830752,0.00003534869,0.00004768768,0.000005915308,0.00001277548,0.00001245329,0.00000600366,0.9975879,0.0001569061,0.001668286,0.0004340431,0.000004378879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04504028,0.0006058533,0.9465634,0.0003066295,0.000163676,0.0001298048,0.0001922632,0.0004361326,0.00656191],"genre_scores_gemma":[0.4092031,0.0003929722,0.5834941,0.0003326394,0.0001343131,0.000475105,0.0003438541,0.0001799826,0.005443948],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005439724,"threshold_uncertainty_score":0.01081616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965523840","doi":"10.1007/s10732-007-9021-7","title":"Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Intersection (aeronautics); Integer programming; Convexity; Heuristic; Integer (computer science); Mathematical optimization; Linear programming; Software; Computer science; Mathematics; Function (biology); Algorithm; Programming language","authors":[{"name":"Jonathan Eckstein","is_ca":false},{"name":"Mikhail Nediak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05059042372315479,"gpt":0.4014260918634955,"spread":0.3508356681403407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181615,0.001083356,0.00182762,0.001809431,0.001360014,0.00117772,0.002459974,0.001714485,0.006017327],"category_scores_gemma":[0.003796506,0.001112125,0.001207854,0.001847493,0.001384025,0.002013664,0.003390271,0.002113256,0.0007236949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016216,"about_ca_system_score_gemma":0.00238339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005582447,"about_ca_topic_score_gemma":0.01207092,"domain_scores_codex":[0.9990373,0.0004131407,0.00003424164,0.00009166386,0.0001913061,0.0002323763],"domain_scores_gemma":[0.9988128,0.0006831145,0.00007990553,0.000117957,0.0001471093,0.0001590423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001294256,0.0007697489,0.002542857,0.0003367813,0.0001308312,0.0002941946,0.0003949039,0.4701544,0.005682565,0.0611758,0.01277942,0.4444443],"study_design_scores_gemma":[0.0002328672,0.0003149479,0.000362906,0.00004670598,0.00005041709,0.00008674045,0.0001183779,0.967886,0.00209773,0.02495303,0.00380855,0.00004167679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07344269,0.0007278159,0.9115822,0.0005680374,0.0003643064,0.0005596005,0.0001738111,0.001325588,0.01125594],"genre_scores_gemma":[0.2084979,0.0002030729,0.7867105,0.0003234177,0.00006617277,0.0002789678,0.0002665237,0.0002307591,0.003422679],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006017327,"threshold_uncertainty_score":0.02012998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059760003","doi":"10.1007/s10732-014-9273-y","title":"Time-window relaxations in vehicle routing heuristics","year":2014,"lang":"fr","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Iterated local search; Vehicle routing problem; Heuristics; Computer science; Mathematical optimization; Relaxation (psychology); Scalability; Heuristic; Local search (optimization); Metaheuristic; Routing (electronic design automation); Algorithm; Mathematics","authors":[{"name":"Thibaut Vidal","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Christian Prins","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01215213936409271,"gpt":0.2558371338389001,"spread":0.2436849944748073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005657475,0.001401748,0.001984125,0.00120467,0.0006586777,0.00184384,0.002335936,0.001868131,0.00719988],"category_scores_gemma":[0.0193139,0.00185566,0.00128591,0.002169237,0.001426719,0.004329919,0.001605542,0.004451069,0.0005172626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00165241,"about_ca_system_score_gemma":0.001747682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006691302,"about_ca_topic_score_gemma":0.004287294,"domain_scores_codex":[0.9984139,0.0009879397,0.00006120632,0.0001455548,0.0002222482,0.0001691592],"domain_scores_gemma":[0.9866888,0.01205936,0.0004212912,0.0002367634,0.0003461534,0.0002476044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002076405,0.0001113414,0.0001676636,0.0001803974,0.00005375125,0.00003979071,0.0001039862,0.8856121,0.000386027,0.08565122,0.002834716,0.02465141],"study_design_scores_gemma":[0.00003064171,0.00002890006,0.00003804366,0.00002670559,0.0000135239,0.00000569412,0.00001849054,0.9655624,0.0001317118,0.03314587,0.0009918999,0.000006131213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01760508,0.002348667,0.9704865,0.0008495626,0.0003915027,0.0001157928,0.0001312597,0.0001196646,0.007951881],"genre_scores_gemma":[0.463099,0.00469652,0.5094718,0.0005625235,0.0008972664,0.000968118,0.000475754,0.0005813821,0.01924768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00719988,"threshold_uncertainty_score":0.02991998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150600488","doi":"10.1007/s10732-009-9112-8","title":"A metaheuristic for stochastic service network design","year":2009,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Metaheuristic; Computer science; Service (business); Set (abstract data type); Network planning and design; Operations research; Mathematical optimization; Artificial intelligence; Engineering; Computer network; Mathematics; Business","authors":[{"name":"Arild Hoff","is_ca":false},{"name":"Arnt-Gunnar Lium","is_ca":false},{"name":"Arne Løkketangen","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0449198498156075,"gpt":0.3195041186380085,"spread":0.2745842688224011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093606,0.001289341,0.001674206,0.002016395,0.0008157172,0.001322362,0.001986936,0.002452956,0.003686938],"category_scores_gemma":[0.004371531,0.00101953,0.001757877,0.002016321,0.00106961,0.001137233,0.001360348,0.001883817,0.0003603768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002326918,"about_ca_system_score_gemma":0.002766679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01131746,"about_ca_topic_score_gemma":0.008925444,"domain_scores_codex":[0.9993281,0.0003320205,0.00003158256,0.00007758437,0.0001440295,0.00008666081],"domain_scores_gemma":[0.998117,0.001367269,0.0001221923,0.00009436183,0.0002067904,0.00009248853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003726887,0.00003393589,0.0001269674,0.00002912379,0.00003485478,0.00002075471,0.00001721321,0.9743269,0.0002160243,0.008804773,0.0006979611,0.01565423],"study_design_scores_gemma":[0.0000226921,0.00001628641,0.00002548625,0.000006759499,0.000009938634,0.000005086004,0.000004530329,0.9961738,0.0000590264,0.003314114,0.0003595461,0.000002725381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02229729,0.0005308287,0.9686676,0.0004584031,0.0001868324,0.000198308,0.0001798783,0.0004255364,0.007055285],"genre_scores_gemma":[0.2961085,0.0004593715,0.6977069,0.0002949284,0.0001665578,0.0006745772,0.0002712185,0.0001857438,0.004132186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01131746,"threshold_uncertainty_score":0.0225032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114085960","doi":"10.1007/s10732-009-9106-6","title":"A large neighbourhood search approach to the  multi-activity shift scheduling problem","year":2009,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Neighbourhood (mathematics); Paradigm shift; Mathematical optimization; Theoretical computer science; Mathematics","authors":[{"name":"Claude-Guy Quimper","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1476587390143901,"gpt":0.4031855617987858,"spread":0.2555268227843956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001148027,0.000455365,0.00131745,0.001137689,0.000642364,0.0008025048,0.001416492,0.001440972,0.003817635],"category_scores_gemma":[0.004445146,0.0004541537,0.0007312026,0.001299629,0.0007561853,0.001427377,0.001097861,0.001032172,0.0003477359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000979166,"about_ca_system_score_gemma":0.001120147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006749691,"about_ca_topic_score_gemma":0.007330165,"domain_scores_codex":[0.9994476,0.0003291548,0.00001907603,0.00005422875,0.0001100994,0.00003976248],"domain_scores_gemma":[0.9982606,0.00140983,0.00006821803,0.00005652076,0.0001352676,0.0000696259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007686853,0.00006438048,0.0001850205,0.00007251515,0.00003373133,0.00004844599,0.00006177891,0.940849,0.0005313898,0.02736026,0.001090491,0.0296261],"study_design_scores_gemma":[0.00002630804,0.00002328084,0.0000483764,0.000005191017,0.000006362528,0.000008922785,0.00001054286,0.9885535,0.00006084181,0.01074071,0.0005114922,0.000004472607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02637012,0.0006528378,0.9649851,0.0004595509,0.00009810641,0.00008576077,0.00006584599,0.0001412441,0.007141441],"genre_scores_gemma":[0.5367602,0.0007691348,0.450841,0.0001673564,0.0001685712,0.000368725,0.0002300286,0.0001183556,0.01057664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006749691,"threshold_uncertainty_score":0.01342082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137944694","doi":"10.1023/a:1009679511137","title":"Tabu Search for a Network Loading Problem with Multiple Facilities","year":2000,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Computer science; Vertex (graph theory); Mathematical optimization; Network planning and design; Heuristic; Computer network; Mathematics; Algorithm; Theoretical computer science; Graph","authors":[{"name":"David Berger","is_ca":false},{"name":"Bernard Gendron","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true},{"name":"S. Raghavan","is_ca":false},{"name":"Patrick Soriano","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01945790216528166,"gpt":0.2552496876173788,"spread":0.2357917854520971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002096614,0.001007983,0.00153361,0.002290584,0.001543129,0.001736634,0.002142448,0.002757624,0.01190671],"category_scores_gemma":[0.007817013,0.001466093,0.001172477,0.003132494,0.001194117,0.002160703,0.001048099,0.001532391,0.0009509138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001777763,"about_ca_system_score_gemma":0.002238264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01805067,"about_ca_topic_score_gemma":0.01469031,"domain_scores_codex":[0.9991092,0.0005202016,0.00002826126,0.00009003218,0.0001060884,0.000146201],"domain_scores_gemma":[0.9959674,0.003346585,0.0001886948,0.0001257715,0.0002589538,0.0001126488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001806568,0.0001568912,0.000448733,0.000145938,0.00004550665,0.00006034474,0.00006976353,0.9503018,0.0003738805,0.008125047,0.003412394,0.03667894],"study_design_scores_gemma":[0.0000582469,0.00004638797,0.00009888393,0.0000156539,0.00001713648,0.00001565296,0.00003995931,0.9928622,0.0001488005,0.006125012,0.0005641482,0.000007886222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1842816,0.001757761,0.7850865,0.001339075,0.0002510351,0.00058806,0.001074094,0.001856643,0.02376516],"genre_scores_gemma":[0.4300352,0.0005330757,0.5595274,0.000256227,0.00008783262,0.0006024766,0.0007706987,0.0004322265,0.007754844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01805067,"threshold_uncertainty_score":0.03983194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066066208","doi":"10.1007/s10732-013-9221-2","title":"A path relinking algorithm for a multi-depot periodic vehicle routing problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec; Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Benchmark (surveying); Vehicle routing problem; Mathematical optimization; Path (computing); Computer science; Homogeneous; Algorithm; Routing (electronic design automation); Mathematics","authors":[{"name":"Alireza Rahimi-Vahed","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Walter Rei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02416431381556332,"gpt":0.2740220169103621,"spread":0.2498577030947988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009014618,0.0007253374,0.001225561,0.0008062618,0.0007254843,0.000861728,0.001813272,0.001076872,0.004262661],"category_scores_gemma":[0.001899591,0.0006263917,0.0006612845,0.0009952347,0.0005251494,0.001130665,0.001028599,0.001153626,0.0004707138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000782709,"about_ca_system_score_gemma":0.001776126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006350651,"about_ca_topic_score_gemma":0.0061125,"domain_scores_codex":[0.9996884,0.00008925811,0.00001873816,0.00007287251,0.00007168835,0.00005908305],"domain_scores_gemma":[0.9993373,0.000363422,0.00006109279,0.00007215577,0.0001119513,0.00005399323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002162616,0.0001530182,0.0004075122,0.0001250891,0.00003765924,0.00005570926,0.00007804501,0.8458822,0.002642777,0.008158084,0.002087499,0.140156],"study_design_scores_gemma":[0.00004047495,0.00005985992,0.00007397448,0.000006858306,0.00001035465,0.00001724877,0.00001420401,0.9965839,0.0003595463,0.002215929,0.0006120324,0.000005586786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05466264,0.0003768248,0.9380234,0.0002608609,0.0001029278,0.0002173809,0.0001391331,0.000836756,0.005380112],"genre_scores_gemma":[0.2610723,0.0002862559,0.7340605,0.00008630921,0.00003625334,0.0002111552,0.000294919,0.0001570469,0.003795214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006350651,"threshold_uncertainty_score":0.01425999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1573636743","doi":"10.1023/a:1011392328632","title":"Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); Université du Québec à Trois-Rivières; Université de Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Nurse scheduling problem; Computer science; Scheduling (production processes); Job shop scheduling; Mathematics; Schedule; Flow shop scheduling","authors":[{"name":"Jacques A. Ferland","is_ca":true},{"name":"Ilham Berrada","is_ca":false},{"name":"Imene Nabli","is_ca":true},{"name":"Belaïd Ahiod","is_ca":false},{"name":"Philippe Michelon","is_ca":false},{"name":"Viviane Gascon","is_ca":true},{"name":"Éric Gagné","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01210832778810486,"gpt":0.26485392777579,"spread":0.2527455999876851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702896,0.001167445,0.00144343,0.0008398376,0.001087758,0.001502335,0.001480268,0.001892682,0.003859199],"category_scores_gemma":[0.004292551,0.0005551383,0.001190432,0.002215624,0.001158668,0.001498496,0.001408298,0.002124148,0.0003755215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001215965,"about_ca_system_score_gemma":0.002139343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01033287,"about_ca_topic_score_gemma":0.01147855,"domain_scores_codex":[0.9993405,0.0003750606,0.00001792344,0.00009275305,0.0001025544,0.00007122713],"domain_scores_gemma":[0.998556,0.001000233,0.0001116307,0.00005981261,0.0001636377,0.0001086437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001741599,0.0001882981,0.0006118449,0.0002126952,0.00006627078,0.0003572469,0.0001337022,0.8864833,0.0009633477,0.05241977,0.00657804,0.0518113],"study_design_scores_gemma":[0.00005647427,0.00006062208,0.0002048762,0.00001310896,0.00002389427,0.00007034049,0.00008806089,0.9501354,0.0002999461,0.04675853,0.002274753,0.00001397853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03470415,0.0004631029,0.955997,0.0008811083,0.0002601689,0.0001561854,0.0001994286,0.000297256,0.007041567],"genre_scores_gemma":[0.3821172,0.001312876,0.6041683,0.000391591,0.0003142611,0.0003631189,0.0003271614,0.0002016402,0.01080393],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01033287,"threshold_uncertainty_score":0.02054548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042361754","doi":"10.1007/s10732-011-9160-8","title":"GRASP strategies for a bi-objective commercial territory design problem","year":2011,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; HEC Montréal","funders":"Instituto Tecnológico y de Estudios Superiores de Monterrey; Universidad Autónoma de Nuevo León; Consejo Nacional de Ciencia y Tecnología; Universidad de Málaga","keywords":"GRASP; Computer science; Mathematical optimization; Constraint (computer-aided design); Work (physics); Function (biology); Scale (ratio); Industrial engineering; Operations research; Mathematics; Engineering","authors":[{"name":"M. Angélica Salazar–Aguilar","is_ca":true},{"name":"Roger Z. Ríos‐Mercado","is_ca":false},{"name":"José Luis González–Velarde","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04457084632785641,"gpt":0.2407001488315737,"spread":0.1961293025037173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000860325,0.001094184,0.00120111,0.001181563,0.0005285696,0.001157081,0.001066625,0.001778106,0.004567291],"category_scores_gemma":[0.001941922,0.0006772795,0.0008883592,0.001265307,0.0006398424,0.001111753,0.001376639,0.0008450248,0.0003243326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009187248,"about_ca_system_score_gemma":0.000887352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004410021,"about_ca_topic_score_gemma":0.003755558,"domain_scores_codex":[0.9997364,0.000106,0.00001230454,0.00002743112,0.00005578306,0.00006219716],"domain_scores_gemma":[0.9994407,0.0003690162,0.00004795825,0.00003106361,0.00004431308,0.00006678382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009722124,0.00006795407,0.0002747084,0.00009551599,0.00004666501,0.0001047181,0.00008234921,0.9613011,0.001394925,0.01236061,0.0007514122,0.02342279],"study_design_scores_gemma":[0.00004079119,0.00009361851,0.0001065067,0.00001533235,0.00002162245,0.00002746503,0.00004919367,0.9912258,0.0002555253,0.007481757,0.0006746791,0.000007693548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2447631,0.0009962216,0.7226955,0.0005713751,0.00005267145,0.0003260301,0.000181379,0.0003516412,0.03006217],"genre_scores_gemma":[0.806505,0.0005942919,0.1837593,0.00008232828,0.0000205558,0.000309255,0.0001576,0.0001068272,0.008464945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004567291,"threshold_uncertainty_score":0.01527911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999191784","doi":"10.1007/s10732-013-9225-y","title":"A three-phase matheuristic for capacitated multi-commodity fixed-cost network design with design-balance constraints","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Heuristics; Mathematical optimization; Solver; Benchmark (surveying); Computer science; Neighbourhood (mathematics); Network planning and design; Mathematics","authors":[{"name":"Duc Minh Vu","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Toulouse","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07108954159709518,"gpt":0.319917577250896,"spread":0.2488280356538008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597793,0.001281287,0.001022597,0.001046206,0.0008642672,0.001147929,0.00218967,0.001441552,0.01089008],"category_scores_gemma":[0.002412851,0.001001287,0.001168872,0.0006840032,0.0007568413,0.001092283,0.001764291,0.001199292,0.001007058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001130201,"about_ca_system_score_gemma":0.001974735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005851253,"about_ca_topic_score_gemma":0.008091817,"domain_scores_codex":[0.9994772,0.000198209,0.00001795422,0.00005889462,0.000187025,0.00006069429],"domain_scores_gemma":[0.9993143,0.0003766413,0.00006500918,0.00005599254,0.0001462612,0.00004175776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007348569,0.00007901499,0.0001831066,0.00008929099,0.00002105009,0.00004454391,0.00005303157,0.9558793,0.001712729,0.01317077,0.0007357288,0.02795808],"study_design_scores_gemma":[0.00001941091,0.0000358971,0.00002653675,0.000006464145,0.00000593323,0.000008285352,0.000007020498,0.9963065,0.0002901095,0.002630614,0.0006588167,0.00000436012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004976629,0.00003523729,0.9881884,0.0000754322,0.00002389842,0.0001411029,0.00004728063,0.0002106786,0.006301353],"genre_scores_gemma":[0.2106176,0.00008980258,0.7834194,0.000154723,0.00002809932,0.0005930595,0.0001291328,0.0001625178,0.004805649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01089008,"threshold_uncertainty_score":0.0364309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116097629","doi":"10.1007/s10732-009-9117-3","title":"A heuristic method for non-homogeneous redundancy optimization of series-parallel multi-state systems","year":2009,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematical optimization; Redundancy (engineering); Computer science; Disjoint sets; Piecewise; Linear subspace; Series and parallel circuits; Algorithm; Heuristic; Series (stratigraphy); State space; Mathematics","authors":[{"name":"Mohamed Ouzineb","is_ca":true},{"name":"Mustapha Nourelfath","is_ca":true},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01103870433776294,"gpt":0.2578407229845529,"spread":0.24680201864679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042745,0.0007930676,0.001362085,0.001096503,0.0006373723,0.0006613699,0.001440791,0.0008908606,0.002864922],"category_scores_gemma":[0.001570085,0.0005783149,0.0008609482,0.001044435,0.0005996667,0.0006504209,0.0006611648,0.0007585739,0.0002677612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007444498,"about_ca_system_score_gemma":0.00124516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005356031,"about_ca_topic_score_gemma":0.005584849,"domain_scores_codex":[0.9997301,0.0001090524,0.00001300123,0.00003245561,0.00006912746,0.00004626282],"domain_scores_gemma":[0.9992965,0.0004369303,0.00005973357,0.00005000846,0.0001200834,0.00003675477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007697789,0.00006191486,0.0001366124,0.00007106674,0.00004101688,0.00004587443,0.00003022979,0.9451809,0.001474307,0.004615568,0.0007971085,0.0474685],"study_design_scores_gemma":[0.00001773225,0.00002425348,0.00003156608,0.000003989073,0.000008649924,0.000007074615,0.000004325624,0.9982125,0.0002445071,0.001198334,0.0002434192,0.000003587683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02009973,0.0002991515,0.9754375,0.00007962836,0.00008460581,0.0001082323,0.0000519444,0.0003399906,0.003499284],"genre_scores_gemma":[0.446377,0.0002687661,0.5495154,0.0001135661,0.00008846506,0.0003574934,0.0001416945,0.0001456707,0.002992031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005356031,"threshold_uncertainty_score":0.01064974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074524916","doi":"10.1007/s10732-013-9224-z","title":"Applying local search to the feedback vertex set problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Feedback arc set; Feedback vertex set; Directed acyclic graph; Local search (optimization); Vertex (graph theory); Simulated annealing; Set (abstract data type); Bidirectional search; Heuristic; Mathematical optimization; Representation (politics); Computer science; Graph; Greedy algorithm; Mathematics; Algorithm; Search algorithm; Theoretical computer science; Beam search; Best-first search; Line graph","authors":[{"name":"Philippe Galinier","is_ca":true},{"name":"Eunice Adjarath Lemamou","is_ca":true},{"name":"M. Bouzidi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02870143752902014,"gpt":0.3008019868948117,"spread":0.2721005493657915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357106,0.0007995538,0.002223688,0.00178912,0.001028335,0.001408892,0.002689471,0.002172659,0.004776192],"category_scores_gemma":[0.013391,0.0007022042,0.0008695111,0.002027288,0.001139986,0.002528301,0.002139285,0.001530099,0.0004787397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001371352,"about_ca_system_score_gemma":0.001934253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006891348,"about_ca_topic_score_gemma":0.007388662,"domain_scores_codex":[0.9986192,0.000751477,0.00004854383,0.0001714741,0.0002331624,0.0001760511],"domain_scores_gemma":[0.9919627,0.00666165,0.0003021248,0.0003812696,0.0004421525,0.0002501435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004307115,0.0004433866,0.0009922876,0.0002481145,0.00008499681,0.0001399165,0.0001499328,0.8699471,0.001263078,0.02235596,0.003529556,0.1004149],"study_design_scores_gemma":[0.00007773259,0.00007898253,0.00007328917,0.00001498653,0.0000177571,0.00001826596,0.00003503852,0.9773285,0.0003038404,0.0217068,0.0003388332,0.000005848772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1272946,0.0009956525,0.8601606,0.0008554762,0.0001318164,0.0002520696,0.000144718,0.001000555,0.009164511],"genre_scores_gemma":[0.6932683,0.0002871495,0.3008784,0.000270148,0.00009840208,0.0002850568,0.0002829663,0.0002225699,0.004407025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006891348,"threshold_uncertainty_score":0.01597792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2622823936","doi":"10.1007/s10732-019-09423-y","title":"The vehicle routing problem with cross-docking and resource constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Saint-Gobain (Canada)","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Heuristics; Computer science; Mathematical optimization; DOCK; Routing (electronic design automation); Integer programming; Algorithm; Mathematics; Computer network; Engineering","authors":[{"name":"Philippe Grangier","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Fabien Lehuédé","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007581508004379499,"gpt":0.2447952879949545,"spread":0.237213779990575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001731344,0.001489407,0.002061852,0.001338044,0.0009033822,0.002989329,0.002406331,0.002870757,0.006645956],"category_scores_gemma":[0.004538298,0.001524771,0.001503983,0.002700013,0.001320541,0.003692692,0.002218056,0.001854863,0.0006396975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001585966,"about_ca_system_score_gemma":0.002083036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01230427,"about_ca_topic_score_gemma":0.008511057,"domain_scores_codex":[0.9986255,0.0006324961,0.00004938907,0.0002273261,0.0001407926,0.000324464],"domain_scores_gemma":[0.9982731,0.00121059,0.0001460047,0.00009834918,0.0001126687,0.0001592184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000876715,0.00005550511,0.0003021457,0.00007676759,0.00005523443,0.0002103782,0.00002219515,0.9665551,0.0003672089,0.02143706,0.001655203,0.009175557],"study_design_scores_gemma":[0.00003651123,0.00004993554,0.0001935166,0.00001767431,0.0000295167,0.00009872775,0.00005092019,0.9773597,0.0002800637,0.0202257,0.001639366,0.00001829782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09991249,0.001595893,0.8690974,0.001446006,0.0004792071,0.0002096284,0.0006593014,0.0002955786,0.02630445],"genre_scores_gemma":[0.7704781,0.001405913,0.2000481,0.0003888195,0.0002529673,0.0002240193,0.0005836723,0.0002407345,0.02637764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01230427,"threshold_uncertainty_score":0.02446532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050999462","doi":"10.1007/s10732-014-9244-3","title":"A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows","year":2014,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université de Montréal; Transport Canada","funders":"Université de Montréal","keywords":"Crossover; Vehicle routing problem; Mathematical optimization; Population; Heuristics; Computer science; Local search (optimization); Genetic algorithm; Heuristic; Metaheuristic; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","authors":[{"name":"Phuong Nguyen","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Toulouse","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0087929748759454,"gpt":0.2244712707805888,"spread":0.2156782959046434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005997044,0.0004717399,0.0006238674,0.0005068796,0.0003442079,0.0005913723,0.001128318,0.001007838,0.002231468],"category_scores_gemma":[0.001284372,0.0003303171,0.0004723775,0.0005757164,0.0003767458,0.0005842129,0.0006525266,0.0005565857,0.0002439303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005057879,"about_ca_system_score_gemma":0.0008489605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004211001,"about_ca_topic_score_gemma":0.004180745,"domain_scores_codex":[0.9997435,0.00009599567,0.000009239895,0.00003753266,0.00007702634,0.00003666734],"domain_scores_gemma":[0.9995678,0.0002782255,0.00003236967,0.00003536049,0.00006466958,0.00002143315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006786318,0.00005648058,0.0002975039,0.0000278267,0.00003067816,0.0000550882,0.00003822743,0.9303714,0.001523574,0.007127223,0.0007796131,0.05962458],"study_design_scores_gemma":[0.00001606354,0.00002202688,0.00004211943,0.000002448278,0.000005746838,0.0000103534,0.000003758273,0.9985129,0.0001752284,0.0009263987,0.0002805017,0.000002470186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05181366,0.0003032903,0.9413409,0.0001792518,0.0000914656,0.00008724147,0.00005394901,0.0004533668,0.005676824],"genre_scores_gemma":[0.5225363,0.0002084684,0.4725608,0.000139427,0.00004536069,0.0002598195,0.0001275754,0.0001009209,0.004021189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004211001,"threshold_uncertainty_score":0.008373022,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2940300938","doi":"10.1007/s10732-019-09412-1","title":"Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows","year":2019,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Benchmark (surveying); Vehicle routing problem; Computer science; Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Evolutionary algorithm; Genetic algorithm; Machine learning; Mathematics","authors":[{"name":"Slim Belhaiza","is_ca":false},{"name":"Rym M’Hallah","is_ca":false},{"name":"Ghassen Ben Brahim","is_ca":false},{"name":"Gilbert Laporte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03366536894842708,"gpt":0.2665831691929864,"spread":0.2329178002445593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024031,0.001200522,0.001705052,0.001309391,0.0007567147,0.001575433,0.003382765,0.002068622,0.003368692],"category_scores_gemma":[0.005538717,0.000862651,0.001371732,0.001166188,0.0007370499,0.001377555,0.00199994,0.001863812,0.0003642114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001747539,"about_ca_system_score_gemma":0.002354045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004894761,"about_ca_topic_score_gemma":0.006495995,"domain_scores_codex":[0.9988831,0.0003808264,0.00006428915,0.0001230037,0.0002748536,0.0002739466],"domain_scores_gemma":[0.9972948,0.001534855,0.0002468968,0.0001920806,0.0004012237,0.0003300563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004025416,0.0002615556,0.0007595065,0.0001003325,0.0000828609,0.0000723387,0.00007889252,0.9332898,0.001890991,0.008120505,0.000841496,0.05409918],"study_design_scores_gemma":[0.00008916627,0.0001654473,0.0002121369,0.00001337823,0.00002622009,0.00001885812,0.00002352623,0.9961886,0.0008147997,0.001983203,0.0004462174,0.00001850332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06854966,0.0006320339,0.9221539,0.0003428011,0.0002060106,0.0004603392,0.0001643296,0.0005533287,0.006937599],"genre_scores_gemma":[0.4994416,0.0002752049,0.4952952,0.0002109478,0.00005959392,0.0005352441,0.0002495169,0.0001737751,0.00375897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004894761,"threshold_uncertainty_score":0.01270896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2781884304","doi":"10.1007/s10732-017-9364-7","title":"The parking allocation problem for connected vehicles","year":2018,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; HEC Montréal","funders":"","keywords":"Computer science; Heuristic; Mathematical optimization; Global Positioning System; Variable (mathematics); Moment (physics); Variable neighborhood search; Quality (philosophy); Algorithm; Artificial intelligence; Mathematics; Metaheuristic","authors":[{"name":"Marko Mladenović","is_ca":false},{"name":"Thierry Delot","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Christophe Wilbaut","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0199354592781975,"gpt":0.2766271281643701,"spread":0.2566916688861726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001388082,0.001102842,0.002016037,0.001294706,0.001111218,0.002266815,0.0022195,0.002322983,0.006565668],"category_scores_gemma":[0.005781604,0.001211185,0.001206815,0.001940414,0.001413866,0.00370306,0.001568031,0.001250981,0.000410664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169784,"about_ca_system_score_gemma":0.001706311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005852324,"about_ca_topic_score_gemma":0.00533433,"domain_scores_codex":[0.9990371,0.000478466,0.00004204825,0.000160891,0.00008370344,0.0001977616],"domain_scores_gemma":[0.9973211,0.001942935,0.0001503582,0.0001045891,0.0001459238,0.0003351467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000538781,0.0001849712,0.001059701,0.0002933486,0.0001544322,0.0001840483,0.0001522844,0.9188617,0.0008030217,0.04657199,0.004221611,0.02697404],"study_design_scores_gemma":[0.0001098073,0.000125433,0.0003343115,0.00002323054,0.00004670619,0.00008003051,0.000129253,0.9245729,0.0003511212,0.0727433,0.001464444,0.00001949324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4120507,0.001469285,0.5606632,0.002043428,0.0002840913,0.0005147189,0.0008585311,0.0004262846,0.02168973],"genre_scores_gemma":[0.8984072,0.0005179359,0.09275436,0.0001880132,0.0001025901,0.0001646113,0.0005411883,0.0001024315,0.007221713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006565668,"threshold_uncertainty_score":0.02196431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067834808","doi":"10.1007/s10732-008-9072-4","title":"A solution method for a car fleet management problem with maintenance constraints","year":2008,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Renting; Computer science; Competitor analysis; Tabu search; Operations research; Stockout; Mathematical optimization; Mathematics; Algorithm; Business; Engineering; Marketing","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"David Schindl","is_ca":true},{"name":"Nicolas Zufferey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02607591857152599,"gpt":0.2451574906615119,"spread":0.2190815720899859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108593,0.0009473871,0.001090101,0.001512223,0.0009120048,0.001437796,0.001649511,0.002219249,0.01001803],"category_scores_gemma":[0.003053309,0.0008396604,0.001060943,0.001880453,0.0006361633,0.001424729,0.001218757,0.001434523,0.0007710904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009737581,"about_ca_system_score_gemma":0.002218674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00788021,"about_ca_topic_score_gemma":0.007890495,"domain_scores_codex":[0.9995819,0.0001374718,0.00002431338,0.00007586915,0.0001142307,0.00006621168],"domain_scores_gemma":[0.9990103,0.0006399493,0.00005181066,0.00004993248,0.0001972466,0.00005075993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000223801,0.0002929395,0.0006362429,0.0005045778,0.0001041119,0.0002692085,0.0003241637,0.5803645,0.005818957,0.04412583,0.009543716,0.3577919],"study_design_scores_gemma":[0.000121743,0.00006528787,0.0001060651,0.00003480991,0.00003148888,0.00007613348,0.0000573152,0.9847249,0.0007509406,0.009679897,0.00433645,0.00001494197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01033842,0.0002642302,0.981398,0.0003026403,0.0001271713,0.0002109118,0.00009683468,0.0003884759,0.006873208],"genre_scores_gemma":[0.07704447,0.0002573003,0.9172926,0.000106777,0.0000541072,0.0003242931,0.0001396379,0.0001277483,0.004653114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001803,"threshold_uncertainty_score":0.03351361,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046744595","doi":"10.1007/s10732-013-9229-7","title":"Less-Than-Truckload carrier collaboration problem: modeling framework and solution approach","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Vehicle routing problem; Local search (optimization); Transshipment (information security); Integer programming; Heuristic; Routing (electronic design automation); Mathematical optimization; Truck; Integer (computer science); Operations research; Mathematics; Computer network; Engineering; Artificial intelligence; Algorithm; Computer security","authors":[{"name":"Selvaprabu Nadarajah","is_ca":false},{"name":"James H. Bookbinder","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01924323567560286,"gpt":0.2557735676930304,"spread":0.2365303320174275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001977638,0.001396497,0.002130968,0.001514266,0.001170344,0.00264885,0.004897763,0.00396795,0.006833243],"category_scores_gemma":[0.003230858,0.0008867127,0.0018698,0.002646037,0.001203538,0.003379019,0.002549584,0.002260628,0.0005003848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002187149,"about_ca_system_score_gemma":0.003886704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01215239,"about_ca_topic_score_gemma":0.00925035,"domain_scores_codex":[0.9987803,0.0004604899,0.00003787527,0.0002745193,0.0001968389,0.0002500011],"domain_scores_gemma":[0.9989063,0.0006286401,0.0001298596,0.00006003547,0.0001523253,0.0001228705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003446609,0.0001186402,0.0003359814,0.0001012174,0.00004326271,0.000144733,0.00006118711,0.8897394,0.0004264725,0.09898248,0.002531245,0.007480946],"study_design_scores_gemma":[0.00001490103,0.00002525776,0.00008446861,0.00001241899,0.00001597635,0.00004397656,0.00005765805,0.9725165,0.000123612,0.02574513,0.001349248,0.00001087072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01777627,0.0005162943,0.9666502,0.001098909,0.0001065122,0.0002329543,0.0003442153,0.00009847825,0.01317617],"genre_scores_gemma":[0.6163009,0.002244737,0.3544479,0.0004198878,0.0003170951,0.0008069614,0.0007164052,0.0001336383,0.02461238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01215239,"threshold_uncertainty_score":0.02416337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1495972231","doi":"10.1023/a:1022525529778","title":"A Tabu Search Heuristic for Resource Management in Naval Warfare","year":2003,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Military Defense Systems Analysis","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Université de Montréal; Lockheed Martin (Canada)","funders":"Advanced Research Projects Agency","keywords":"Tabu search; Survivability; Computer science; Operations research; Scheduling (production processes); Heuristic; Mathematical optimization; Probabilistic logic; Computation; Artificial intelligence; Engineering; Algorithm; Mathematics","authors":[{"name":"Dale E. Blodgett","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"François Guertin","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true},{"name":"René Séguin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01359630341022536,"gpt":0.2387723471679834,"spread":0.225176043757758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003041268,0.001183496,0.002229659,0.003524227,0.001702853,0.001899856,0.002813779,0.003146408,0.01164464],"category_scores_gemma":[0.009403053,0.001337318,0.001126299,0.003579576,0.001717067,0.002515337,0.001254618,0.001552535,0.00100143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002406121,"about_ca_system_score_gemma":0.002996947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01839941,"about_ca_topic_score_gemma":0.01475509,"domain_scores_codex":[0.9986914,0.0007867333,0.00004667746,0.000108442,0.000147951,0.0002187842],"domain_scores_gemma":[0.9951341,0.004020344,0.0001528308,0.0001552752,0.0003780562,0.0001594906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002606903,0.0001788789,0.0005054152,0.0001326481,0.00006033987,0.00005211483,0.00009270436,0.9177073,0.0002539611,0.008870512,0.0050733,0.06681225],"study_design_scores_gemma":[0.00009506698,0.00006641392,0.0001150932,0.00002670343,0.00002607569,0.00001364602,0.00004418437,0.9925372,0.0001303187,0.006220119,0.0007152331,0.00001002902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1437271,0.004344292,0.8170847,0.001584545,0.0006230262,0.0007959642,0.0008184232,0.002415371,0.02860668],"genre_scores_gemma":[0.4544574,0.0008324202,0.5358775,0.0005355397,0.000153279,0.000704847,0.000645961,0.0004231007,0.006369976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01839941,"threshold_uncertainty_score":0.03895515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094204336","doi":"10.1007/s10732-013-9235-9","title":"An iterated-tabu-search heuristic for a variant of the partial set covering problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Iterated local search; Local optimum; Mathematics; Guided Local Search; Iterated function; Set cover problem; Local search (optimization); Heuristic; Set (abstract data type); Algorithm; Computer science","authors":[{"name":"Bilal Nehme","is_ca":true},{"name":"Philippe Galinier","is_ca":true},{"name":"François Guibault","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03142935179164581,"gpt":0.3079221958660006,"spread":0.2764928440743548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009934797,0.0006597869,0.001344664,0.00076597,0.0006625231,0.0009764647,0.002260446,0.001634429,0.003870825],"category_scores_gemma":[0.003693843,0.0005245221,0.001165171,0.001033011,0.0006638106,0.001058862,0.001010345,0.001028054,0.000302657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141032,"about_ca_system_score_gemma":0.001453436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005816432,"about_ca_topic_score_gemma":0.005873956,"domain_scores_codex":[0.9994835,0.0002134459,0.00001734855,0.00007489268,0.0001128401,0.00009795609],"domain_scores_gemma":[0.9988955,0.0007220003,0.00006940187,0.0001089162,0.0001414461,0.0000626304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001062484,0.0001107746,0.0004421502,0.00009052748,0.00005897453,0.0001436964,0.0000796879,0.9249974,0.001407422,0.01480683,0.002338175,0.0554181],"study_design_scores_gemma":[0.00002132682,0.00003940426,0.00009372262,0.000008377699,0.00001652796,0.00003277463,0.00001233345,0.9963136,0.0002670349,0.002591759,0.0005971687,0.000006016308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1442863,0.0007016271,0.8313515,0.0005483401,0.0002189461,0.0003251146,0.0002139695,0.0007198508,0.02163431],"genre_scores_gemma":[0.5510395,0.0002307674,0.4435499,0.0001451278,0.00007637565,0.0002444373,0.000268373,0.0001857094,0.004259717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005816432,"threshold_uncertainty_score":0.01294917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069090104","doi":"10.1007/s10732-014-9262-1","title":"Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon","year":2014,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Workover; Heuristics; Heuristic; Mathematical optimization; Vehicle routing problem; Time horizon; Genetic algorithm; Routing (electronic design automation); Computer science; Variable neighborhood search; Deck; Marine engineering; Operations research; Engineering; Metaheuristic; Mathematics; Petroleum engineering; Computer network; Structural engineering","authors":[{"name":"Glaydston Mattos Ribeiro","is_ca":false},{"name":"Guy Desaulniers","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"Thibaut Vidal","is_ca":false},{"name":"Bruno Salezze Vieira","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01051716373510575,"gpt":0.2327616571869107,"spread":0.222244493451805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547635,0.001220598,0.001750609,0.001230061,0.0008116571,0.001728464,0.002590052,0.001740338,0.003077637],"category_scores_gemma":[0.003166719,0.001281113,0.001167028,0.001513671,0.001041305,0.00225492,0.001278548,0.001388911,0.0002383823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002161223,"about_ca_system_score_gemma":0.00256738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01619174,"about_ca_topic_score_gemma":0.02069245,"domain_scores_codex":[0.9993109,0.0002435133,0.00002813451,0.0001279567,0.0000766049,0.0002129542],"domain_scores_gemma":[0.9981239,0.001393144,0.0001770596,0.00009415403,0.00008216624,0.0001294322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000847344,0.00005598311,0.0002071999,0.00004047168,0.00002576005,0.0000381499,0.00002705177,0.9841127,0.0003069361,0.004286484,0.0005949306,0.01021953],"study_design_scores_gemma":[0.0000274069,0.00003035024,0.00007797586,0.000007948905,0.00001114841,0.000008630858,0.0000253041,0.9946577,0.0001134882,0.004787964,0.0002459898,0.000006066755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1127491,0.0007631833,0.8776187,0.0003529779,0.00008443823,0.0003175093,0.0003490701,0.0004598318,0.007305079],"genre_scores_gemma":[0.7252445,0.0003658585,0.2707039,0.0001032529,0.00004625858,0.0002290517,0.0004261615,0.0001100798,0.002770981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01619174,"threshold_uncertainty_score":0.03219503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059958986","doi":"10.1007/s10732-008-9097-8","title":"Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions","year":2008,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Arc (geometry); Heuristics; Ant colony optimization algorithms; Mathematical optimization; Routing (electronic design automation); Computer science; Mathematics; Computer network","authors":[{"name":"Gianpaolo Ghiani","is_ca":false},{"name":"Demetrio Laganà","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Francesco Mari","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03496000000940143,"gpt":0.2436528037807268,"spread":0.2086928037713253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001149526,0.0009818185,0.001421236,0.0008286316,0.0005583258,0.001467489,0.001736098,0.001539075,0.003812273],"category_scores_gemma":[0.004089936,0.0007890114,0.0008367196,0.001387778,0.0009975805,0.001623823,0.001041391,0.001708907,0.0004061962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001193075,"about_ca_system_score_gemma":0.0016219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01097195,"about_ca_topic_score_gemma":0.007231555,"domain_scores_codex":[0.999316,0.0003571711,0.00002129649,0.00007796035,0.0001245639,0.0001029564],"domain_scores_gemma":[0.9979285,0.001542207,0.0001596152,0.00008516129,0.0001727642,0.0001117317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000522497,0.0000343051,0.0001184508,0.00004655218,0.00002276601,0.00003611504,0.00002510832,0.9792982,0.0003380502,0.01195523,0.001088766,0.006984179],"study_design_scores_gemma":[0.0000137292,0.00001230797,0.00002638568,0.000003995765,0.000005364996,0.000006737881,0.000008621974,0.9932588,0.00006712839,0.006280261,0.0003141437,0.000002559424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04213593,0.000613264,0.9448158,0.00068774,0.0001188101,0.0001384595,0.00019584,0.0002149692,0.01107921],"genre_scores_gemma":[0.576785,0.0009253428,0.4042042,0.0001600519,0.0001504314,0.0003607471,0.0003219669,0.0002420056,0.01685022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01097195,"threshold_uncertainty_score":0.02181619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009921115","doi":"10.1007/s10732-006-6017-7","title":"A tabu search algorithm for solving economic lot scheduling problem","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Computer science; Hill climbing; Benchmark (surveying); Scheduling (production processes); Job shop scheduling; Algorithm; Heuristic; Mathematics; Schedule","authors":[{"name":"Syed Asif Raza","is_ca":true},{"name":"Ali Akgündüz","is_ca":true},{"name":"M. Y. Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01096519587868776,"gpt":0.2360342998055686,"spread":0.2250691039268808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452179,0.0007148089,0.001275292,0.001296585,0.001121694,0.0009449422,0.001646326,0.001669682,0.00590996],"category_scores_gemma":[0.003245812,0.000670595,0.0007114096,0.002515652,0.0006881131,0.001186352,0.0007333087,0.001108914,0.0009815969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008841783,"about_ca_system_score_gemma":0.001695448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007642119,"about_ca_topic_score_gemma":0.005768456,"domain_scores_codex":[0.9994368,0.0002845257,0.00002510467,0.00005693597,0.0001276696,0.00006881386],"domain_scores_gemma":[0.9989525,0.0006531442,0.00006180552,0.00007680855,0.0002193119,0.00003636215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002891102,0.0001825002,0.0004338107,0.0001460379,0.00007592706,0.00005361296,0.00007525311,0.803772,0.001418471,0.009493133,0.006923584,0.1771365],"study_design_scores_gemma":[0.00006548441,0.00005339852,0.0001085778,0.000008893967,0.00001625608,0.00001633539,0.00001356618,0.9943238,0.0003019125,0.003929168,0.00115458,0.000007879828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04398417,0.001351469,0.941341,0.0004264812,0.0002792595,0.0002509787,0.0003269639,0.002260474,0.009779201],"genre_scores_gemma":[0.2299062,0.0004532973,0.764692,0.000237399,0.00008706336,0.00045513,0.000432597,0.0002959377,0.003440282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007642119,"threshold_uncertainty_score":0.01977074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091721145","doi":"10.1007/s10732-015-9291-4","title":"An autofocus heuristic for digital cameras based on supervised machine learning","year":2015,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Image Processing Techniques and Applications","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Autofocus; Computer science; Artificial intelligence; Heuristic; Focus (optics); Computer vision; Machine learning","authors":[{"name":"Hashim Mir","is_ca":true},{"name":"Wei Xu","is_ca":true},{"name":"Rudi Chen","is_ca":true},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02053281870351411,"gpt":0.2684333901716734,"spread":0.2479005714681593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008360103,0.0006266518,0.001489524,0.00117682,0.0006717844,0.0008911599,0.001443379,0.001210792,0.002410307],"category_scores_gemma":[0.003827311,0.0005682058,0.0006600995,0.0007548188,0.0008660177,0.001700415,0.001012612,0.000904964,0.0002059375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263408,"about_ca_system_score_gemma":0.001745399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006347204,"about_ca_topic_score_gemma":0.007535578,"domain_scores_codex":[0.9994895,0.0001394494,0.00002539368,0.0001246497,0.000137152,0.00008384962],"domain_scores_gemma":[0.9977652,0.001514361,0.0001804078,0.0001851421,0.0002575473,0.00009734034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003873429,0.0003334216,0.001840538,0.0001718259,0.0000909837,0.0001062486,0.0001959936,0.6357821,0.004799297,0.02735298,0.003483902,0.3254554],"study_design_scores_gemma":[0.0000256567,0.00005055282,0.0001612546,0.000011795,0.000009795775,0.00002418669,0.00001842872,0.9905856,0.0008674815,0.007888039,0.0003494761,0.000007788548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07262432,0.0003371205,0.9230896,0.0001609204,0.00002813543,0.0001150817,0.0000530254,0.0005401951,0.003051544],"genre_scores_gemma":[0.5595442,0.0001686131,0.4378607,0.0001259002,0.00004548792,0.0001120959,0.000152093,0.0001255505,0.001865336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006347204,"threshold_uncertainty_score":0.01262051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012738417","doi":"10.1007/s10732-007-9033-3","title":"Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Deutsche Forschungsgemeinschaft","keywords":"Travelling salesman problem; Heuristics; Regret; Greedy algorithm; Mathematical optimization; Computer science; Mathematics; Combinatorics; Machine learning","authors":[{"name":"Gregory Gutin","is_ca":false},{"name":"Boris Goldengorin","is_ca":false},{"name":"Jing Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0272815811744743,"gpt":0.2899186233637731,"spread":0.2626370421892987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01839074,0.003302779,0.003046851,0.003696318,0.001965426,0.004626996,0.004822563,0.002542764,0.006413789],"category_scores_gemma":[0.04050989,0.001660013,0.003220798,0.004041984,0.003315029,0.004928199,0.002089442,0.003406068,0.0005239167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006684405,"about_ca_system_score_gemma":0.003948153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008566026,"about_ca_topic_score_gemma":0.008626375,"domain_scores_codex":[0.9891566,0.006563739,0.0002663996,0.0006551163,0.001641237,0.001716843],"domain_scores_gemma":[0.9433042,0.04963005,0.001896956,0.001670343,0.002323858,0.001174559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005966058,0.0001846287,0.0007226073,0.0002251282,0.0001377444,0.00007773147,0.0000589706,0.9591969,0.0003508529,0.0249467,0.003654822,0.009847184],"study_design_scores_gemma":[0.00002698604,0.00008616134,0.0002255498,0.00002000256,0.00005717424,0.00004001105,0.00004293795,0.9864563,0.0002275344,0.01246888,0.0003346449,0.00001384827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1635286,0.01115781,0.7803921,0.002879893,0.0005847751,0.0003698657,0.001032992,0.001016491,0.03903745],"genre_scores_gemma":[0.8187441,0.002412678,0.1670296,0.0006910245,0.0005678729,0.0003278446,0.0008297047,0.0007218417,0.008675385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01839074,"threshold_uncertainty_score":0.09726071,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1526117045","doi":"10.1023/a:1015084116772","title":"Introduction to the Special Issue on Parallel Meta-Heuristics","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; University of Manitoba; Université du Québec à Montréal","funders":"","keywords":"Mathematics","authors":[{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Toulouse","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02866279789083174,"gpt":0.2463276832061558,"spread":0.2176648853153241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001583031,0.001857384,0.002533632,0.002620538,0.0009468244,0.003879292,0.001845636,0.002094284,0.05612412],"category_scores_gemma":[0.005393089,0.0009456195,0.001703095,0.004421887,0.0009304885,0.004585167,0.001610676,0.005216264,0.02589826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004427,"about_ca_system_score_gemma":0.001045303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007224838,"about_ca_topic_score_gemma":0.001515657,"domain_scores_codex":[0.9987508,0.0002408212,0.0001298018,0.0003164901,0.0004770274,0.00008505437],"domain_scores_gemma":[0.9954379,0.002196608,0.0001614261,0.0005917546,0.001251726,0.0003606311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001001675,0.0001487873,0.00019465,0.0008161042,0.0001029464,0.0001630862,0.00003731219,0.003399575,0.001213084,0.02156873,0.739325,0.2329305],"study_design_scores_gemma":[0.00003461952,0.0001100272,0.0004174125,0.0002502786,0.0000714125,0.0004981281,0.00002777573,0.007078638,0.0008311878,0.04397407,0.9466622,0.00004421995],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.002272554,0.1179403,0.3412636,0.03236414,0.3886943,0.0004253769,0.00190233,0.002459697,0.1126778],"genre_scores_gemma":[0.02069135,0.09794427,0.1660919,0.01769729,0.4517141,0.0005837728,0.004899152,0.003736007,0.2366421],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.05612412,"threshold_uncertainty_score":0.1877539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2086314248","doi":"10.1007/s10732-007-9042-2","title":"Pareto memetic algorithm for multiple objective optimization with an industrial application","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Memetic algorithm; Mathematical optimization; Heuristics; Knapsack problem; Computer science; Pareto principle; Local search (optimization); Combinatorial optimization; Scheduling (production processes); Job shop scheduling; Continuous knapsack problem; Multi-objective optimization; Algorithm; Mathematics","authors":[{"name":"Arnaud Zinflou","is_ca":true},{"name":"Caroline Gagné","is_ca":true},{"name":"Marc Gravel","is_ca":true},{"name":"Wilson L. Price","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02024809255796,"gpt":0.2802399685212921,"spread":0.2599918759633321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232454,0.0007306308,0.000552387,0.0008777651,0.0008333336,0.0007330606,0.0007321063,0.001182912,0.00251632],"category_scores_gemma":[0.001231585,0.0002989564,0.0005838082,0.001230199,0.0004771731,0.0005100503,0.0004875261,0.0008828384,0.00036207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000397411,"about_ca_system_score_gemma":0.0006074732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001087895,"about_ca_topic_score_gemma":0.001297529,"domain_scores_codex":[0.9997368,0.0001075886,0.000009398856,0.00002180276,0.0001055747,0.00001871542],"domain_scores_gemma":[0.9997101,0.000166575,0.00001858331,0.00002127523,0.00007511678,0.000008345002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008720441,0.0001307284,0.0002833937,0.0001586926,0.00007003404,0.0001710187,0.00006027169,0.7266835,0.004520679,0.05015651,0.004357311,0.2133207],"study_design_scores_gemma":[0.00001405385,0.00005232664,0.00009147791,0.000008687032,0.00001552681,0.00004575084,0.00001156164,0.987363,0.001563166,0.007800325,0.003027171,0.000006805173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01546606,0.001318126,0.9658702,0.0003070401,0.000212356,0.00004493302,0.00002407191,0.0002763621,0.01648086],"genre_scores_gemma":[0.3633744,0.00127285,0.6175095,0.0001423448,0.0001142043,0.0002313867,0.00004538549,0.0000914915,0.01721842],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00251632,"threshold_uncertainty_score":0.008417964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995945236","doi":"10.1007/s10732-012-9194-6","title":"Experimental analysis of heuristics for the bottleneck traveling salesman problem","year":2012,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Heuristics; Bottleneck; Mathematical optimization; Heuristic; Computer science; Lin–Kernighan heuristic; Bottleneck traveling salesman problem; Graph; Mathematics; Algorithm; Theoretical computer science","authors":[{"name":"John Larusic","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true},{"name":"Eric Aubanel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02892118218877482,"gpt":0.3040283423286017,"spread":0.2751071601398268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007554638,0.001401841,0.001057069,0.001874541,0.001155758,0.001363186,0.002094181,0.001215139,0.006660733],"category_scores_gemma":[0.04198158,0.0007289443,0.0007630545,0.002254419,0.001342747,0.002241332,0.0007691596,0.001627952,0.0006464038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003615328,"about_ca_system_score_gemma":0.002676239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007500586,"about_ca_topic_score_gemma":0.007170969,"domain_scores_codex":[0.9933883,0.00397797,0.0004590813,0.0006017196,0.0009861817,0.0005866289],"domain_scores_gemma":[0.8691915,0.1117691,0.003457767,0.007348792,0.007384013,0.0008488056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01129682,0.01761079,0.006830517,0.002076214,0.0005601058,0.0001389423,0.0003703214,0.7941021,0.01553783,0.01604901,0.009652739,0.1257745],"study_design_scores_gemma":[0.001002607,0.004606844,0.003716307,0.00007275769,0.0002427248,0.00009042432,0.0003450242,0.9630487,0.01655852,0.007825445,0.002425939,0.00006462667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9459353,0.001947889,0.03614484,0.0004589701,0.0002720576,0.00047814,0.001491861,0.0006599898,0.01261098],"genre_scores_gemma":[0.960378,0.0004798039,0.03469987,0.0000786606,0.00005991743,0.000262122,0.00193407,0.0002266448,0.001881046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007554638,"threshold_uncertainty_score":0.03995323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022253420","doi":"10.1007/s10732-008-9093-z","title":"Special issue on mathematical contributions to metaheuristics editorial","year":2008,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Heuristics; Optimization problem; Scheduling (production processes); Combinatorial optimization; Parallel metaheuristic; Embedding; Mathematics; Algorithm; Artificial intelligence; Meta-optimization","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Vittorio Maniezzo","is_ca":false},{"name":"Stefan Voß","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01232931797712651,"gpt":0.2686253448139557,"spread":0.2562960268368292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004854917,0.003114917,0.003247098,0.006071091,0.002324401,0.007908036,0.002954915,0.007533431,0.02461628],"category_scores_gemma":[0.01725617,0.0008845301,0.002392768,0.002368808,0.001913587,0.004499721,0.001956288,0.007950471,0.009692174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002558448,"about_ca_system_score_gemma":0.002025577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005892726,"about_ca_topic_score_gemma":0.001297082,"domain_scores_codex":[0.9960524,0.0007835884,0.0004086597,0.0005541151,0.001858518,0.0003426417],"domain_scores_gemma":[0.9796443,0.007197618,0.001624292,0.0009256206,0.008149785,0.002458296],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007189159,0.00003059626,0.00005605654,0.0003302084,0.00004274891,0.0001014424,0.00001361662,0.0001731209,0.0001925631,0.002335229,0.9848577,0.01179486],"study_design_scores_gemma":[0.00008555739,0.00007832985,0.0003810554,0.0003758544,0.0001114655,0.0002356241,0.0000330488,0.0009441965,0.0003113235,0.007486671,0.9899311,0.00002570914],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00009430577,0.00713199,0.0004890772,0.01889048,0.970004,0.00001309346,0.0000390697,0.00003463923,0.003303458],"genre_scores_gemma":[0.0008711723,0.003869612,0.0002266797,0.004251474,0.9826985,0.00001443133,0.00002881088,0.00005864591,0.007980733],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.02461628,"threshold_uncertainty_score":0.08234966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1547752062","doi":"10.1023/a:1009609820093","title":"An Evolution Program for Non-Linear Transportation Problems","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Initialization; Heuristic; Mathematical optimization; Computer science; Mating; Fitness function; Function (biology); Convergence (economics); Flow network; Integer (computer science); Genetic algorithm; Mathematics; Biology; Genetics","authors":[{"name":"Nesa Ilich","is_ca":false},{"name":"Slobodan P. Simonović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01922367901046773,"gpt":0.3067831573419486,"spread":0.2875594783314808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004228,0.0005117301,0.0007057717,0.0005190262,0.0003506864,0.0007385661,0.0007570862,0.001030567,0.002878586],"category_scores_gemma":[0.003105622,0.0003659213,0.0004960924,0.0008122316,0.0007771404,0.0008931613,0.0008496257,0.00137966,0.0002110512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007665867,"about_ca_system_score_gemma":0.0009233166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004004979,"about_ca_topic_score_gemma":0.003096863,"domain_scores_codex":[0.9996815,0.0001413751,0.00001167482,0.0000322238,0.00009900154,0.00003420351],"domain_scores_gemma":[0.9989855,0.0007810417,0.00004705242,0.00002500244,0.0001256141,0.00003573431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004844695,0.00008152304,0.0003758975,0.00008476602,0.00002114118,0.00006998397,0.0001065656,0.8194396,0.0008283835,0.1287441,0.001912806,0.04828684],"study_design_scores_gemma":[0.000007727412,0.00001254124,0.00003346856,0.00000611611,0.000003479249,0.000006898019,0.000006623286,0.9849183,0.00008822612,0.01413437,0.0007804488,0.000001904432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02151628,0.0002749845,0.9692798,0.0004113048,0.00005273934,0.0000628159,0.00006730852,0.00008242236,0.008252335],"genre_scores_gemma":[0.5119448,0.001165032,0.4659832,0.0002042513,0.000108881,0.0004746116,0.0002853321,0.0001759081,0.01965803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004004979,"threshold_uncertainty_score":0.009629786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966497181","doi":"10.1007/s10732-007-9051-1","title":"Learning heuristics for basic block instruction scheduling","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Critical path method; Scheduling (production processes); Compiler; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Programming language","authors":[{"name":"Abid M. Malik","is_ca":true},{"name":"Tyrel Russell","is_ca":true},{"name":"Michael Chase","is_ca":true},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01640675964308066,"gpt":0.2782806497015747,"spread":0.2618738900584941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002164165,0.000990022,0.001948618,0.001436538,0.0007780186,0.001070408,0.002042861,0.001612287,0.004175834],"category_scores_gemma":[0.01032981,0.001063651,0.000934061,0.001607374,0.001003412,0.002001362,0.0009846457,0.002467505,0.000429589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002216102,"about_ca_system_score_gemma":0.004070111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0195933,"about_ca_topic_score_gemma":0.01983436,"domain_scores_codex":[0.9992544,0.0002890016,0.00004887125,0.0001238635,0.0001313437,0.0001524281],"domain_scores_gemma":[0.991423,0.007259083,0.000234592,0.0003665005,0.0004997766,0.0002170946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003113894,0.0001984572,0.0008081196,0.00009352255,0.00004334805,0.00002618654,0.00006936114,0.8736737,0.0003731236,0.008102858,0.003575626,0.1127243],"study_design_scores_gemma":[0.00005598468,0.00003309844,0.00007815377,0.000006160691,0.000009209461,0.000004292783,0.00000992801,0.9895084,0.0001539202,0.00985346,0.0002836875,0.000003734012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1333043,0.001384613,0.8550733,0.0007559049,0.0001836861,0.0003490563,0.0003569055,0.002383857,0.006208527],"genre_scores_gemma":[0.5975208,0.0005199056,0.3966777,0.0002749489,0.0001444374,0.0003194754,0.0007979291,0.0002445726,0.00350028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0195933,"threshold_uncertainty_score":0.03895849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2807082804","doi":"10.1007/s10732-018-9374-0","title":"On the empirical scaling of running time for finding optimal solutions to the TSP","year":2018,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS","keywords":"Scaling; Mathematics; Mathematical optimization; Computer science; Geometry","authors":[{"name":"Zongxu Mu","is_ca":true},{"name":"Jérémie Dubois-Lacoste","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Thomas Stützle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1055652370070404,"gpt":0.3521430627143231,"spread":0.2465778257072826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01513543,0.001370264,0.001327436,0.004002226,0.001375005,0.002371651,0.002960061,0.003383463,0.005737657],"category_scores_gemma":[0.2282398,0.0009076794,0.00105952,0.005294668,0.003062045,0.006368378,0.002047685,0.003989242,0.001249917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002080946,"about_ca_system_score_gemma":0.001901174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006183017,"about_ca_topic_score_gemma":0.005223888,"domain_scores_codex":[0.9832731,0.008060735,0.001331684,0.003055394,0.003205925,0.001073145],"domain_scores_gemma":[0.6574233,0.298178,0.006774507,0.02572572,0.009628088,0.002270354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002685584,0.001231934,0.06936917,0.001432605,0.0007108227,0.0005442162,0.0008888763,0.681981,0.007235079,0.0234131,0.02848411,0.1820234],"study_design_scores_gemma":[0.0001762949,0.0004919653,0.02419246,0.0001733288,0.0001865985,0.001029504,0.0004968358,0.948473,0.003382355,0.01736703,0.003935114,0.00009555216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8198943,0.01403614,0.1303111,0.005833247,0.001123345,0.0002118122,0.004615898,0.003977057,0.01999709],"genre_scores_gemma":[0.9408738,0.001478797,0.04979403,0.0004942634,0.0003469713,0.0001640656,0.003836859,0.001137889,0.001873303],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01513543,"threshold_uncertainty_score":0.08004475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898330572","doi":"10.1007/s10732-018-9397-6","title":"Swarm hyperheuristic framework","year":2018,"lang":"fr","type":"article","venue":"Journal of Heuristics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Metaheuristic; Computer science; Swarm behaviour; Swarm intelligence; Benchmark (surveying); Parallel metaheuristic; Heuristics; Novelty; Artificial intelligence; Mathematical optimization; Algorithm; Machine learning; Mathematics; Particle swarm optimization; Meta-optimization","authors":[{"name":"Surafel Luleseged Tilahun","is_ca":false},{"name":"Mohamed A. Tawhid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0637507977471381,"gpt":0.3518749267738976,"spread":0.2881241290267595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004722046,0.0006501467,0.0007057549,0.0007159717,0.0004992492,0.001653137,0.001246596,0.00131389,0.007805852],"category_scores_gemma":[0.0009556326,0.0002357343,0.0006388303,0.0007998869,0.0005287603,0.001076456,0.001030542,0.001247274,0.00178011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006414516,"about_ca_system_score_gemma":0.001008824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001131807,"about_ca_topic_score_gemma":0.001232577,"domain_scores_codex":[0.9996666,0.0001333147,0.00001253709,0.00004906433,0.0001079871,0.00003059356],"domain_scores_gemma":[0.9998316,0.00005312252,0.00001419643,0.00003363945,0.00004995561,0.00001751317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005745492,0.00009736032,0.0003028292,0.0001677455,0.0001137612,0.0001475217,0.00006731352,0.2688575,0.002790575,0.595128,0.01099361,0.1212765],"study_design_scores_gemma":[0.00003557931,0.00007271135,0.0001378008,0.00003756419,0.00003358654,0.00009246658,0.0000320283,0.8428587,0.001287922,0.1227535,0.03264265,0.00001541545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009774608,0.002983917,0.8766768,0.001128628,0.0007892709,0.0001591103,0.0001486494,0.0003552055,0.1079838],"genre_scores_gemma":[0.4209152,0.00470825,0.4773032,0.0008336111,0.0008691502,0.000607332,0.0005347759,0.0002612818,0.09396729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007805852,"threshold_uncertainty_score":0.02611321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985976271","doi":"10.1007/s10732-007-9067-6","title":"Heuristics for multi-period capacity expansion in local telecommunications networks","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Computer science; Genetic algorithm; Local search (optimization); Steiner tree problem; Tree (set theory); Topology (electrical circuits); Mathematics","authors":[{"name":"Roxane Kouassi","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Jean‐Yves Potvin","is_ca":true},{"name":"Patrick Soriano","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05579251369741658,"gpt":0.3186129254522689,"spread":0.2628204117548523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004407882,0.001414467,0.003316324,0.002877757,0.001536098,0.002361164,0.003862046,0.002049351,0.009303001],"category_scores_gemma":[0.009656372,0.001670229,0.001569538,0.003345696,0.001482617,0.003824472,0.001869644,0.002119427,0.0004939766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003460433,"about_ca_system_score_gemma":0.002754699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0113152,"about_ca_topic_score_gemma":0.01273764,"domain_scores_codex":[0.9981748,0.0009394988,0.00007747133,0.0002229021,0.000136318,0.0004489664],"domain_scores_gemma":[0.9900123,0.008193858,0.0004835,0.0003086734,0.0003973173,0.0006042881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000189218,0.00009039729,0.0003784002,0.0001111937,0.00005768975,0.00005911242,0.0001022732,0.9745631,0.0002511512,0.008675806,0.001968848,0.01355298],"study_design_scores_gemma":[0.00006751928,0.00006446821,0.000126575,0.00002039116,0.00003004061,0.00002313426,0.0000943548,0.9891555,0.0002044073,0.009592737,0.0006073939,0.00001344239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1804807,0.00182267,0.7983196,0.001067889,0.0001979071,0.0008604117,0.0007915965,0.001122227,0.01533688],"genre_scores_gemma":[0.7823592,0.0005905196,0.2113386,0.0002270947,0.00007274654,0.0004677098,0.0005379508,0.0002536035,0.004152536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0113152,"threshold_uncertainty_score":0.03112167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141809992","doi":"10.1007/s10732-007-9046-y","title":"Local and variable neighborhood search for the k-cardinality subgraph problem","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Constructive; Heuristics; Variable neighborhood search; Combinatorics; Mathematics; Induced subgraph isomorphism problem; Cardinality (data modeling); Local search (optimization); Metaheuristic; Subgraph isomorphism problem; Heuristic; Graph; Combinatorial optimization; Variable (mathematics); Discrete mathematics; Mathematical optimization; Computer science; Line graph; Data mining","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Nenad Mladenović","is_ca":false},{"name":"Dragan Urošević","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01883491749522995,"gpt":0.2812296731848295,"spread":0.2623947556895995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012801,0.0004184441,0.001253549,0.000911269,0.0006423909,0.0008005618,0.00148873,0.0008269315,0.002540811],"category_scores_gemma":[0.005196433,0.0004279401,0.00060294,0.001128625,0.0008156003,0.001491708,0.0009417991,0.0008010799,0.0001758552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009508483,"about_ca_system_score_gemma":0.001047063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006788552,"about_ca_topic_score_gemma":0.009799905,"domain_scores_codex":[0.9994175,0.0003561614,0.00001355299,0.0000650435,0.00007763957,0.00006997214],"domain_scores_gemma":[0.9971686,0.002329668,0.0001645066,0.000108004,0.0001219293,0.0001072302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002015694,0.0001099571,0.0009861381,0.00007705593,0.00004941438,0.00004281306,0.00006759719,0.9402904,0.000422898,0.02926145,0.001928888,0.02656184],"study_design_scores_gemma":[0.00002788742,0.00002254822,0.000118096,0.00000571842,0.000009070979,0.000009843798,0.00001949031,0.9873487,0.00009736833,0.01210372,0.0002338983,0.000003688405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1901843,0.001038128,0.7980418,0.0008603664,0.00007524261,0.0001177354,0.0002054996,0.0003482793,0.009128587],"genre_scores_gemma":[0.7684057,0.0003132109,0.226034,0.0001137479,0.00006014369,0.0001729993,0.0002699767,0.000113777,0.004516381],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006788552,"threshold_uncertainty_score":0.01349807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050672239","doi":"10.1007/s10732-011-9173-3","title":"D-optimal matrices via quadratic integer optimization","year":2011,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Integer (computer science); Integer matrix; Circulant matrix; Matrix (chemical analysis); Mathematical optimization; Quadratic equation; Quadratic assignment problem; Optimization problem; Block matrix; Algorithm; Computer science; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors","authors":[{"name":"Ilias Kotsireas","is_ca":true},{"name":"Pãnos M. Pardalos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01112715678127564,"gpt":0.1882485438579949,"spread":0.1771213870767193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160029,0.001493871,0.001257846,0.001741113,0.0008713279,0.002016183,0.00144175,0.001697239,0.01278461],"category_scores_gemma":[0.007579332,0.001093969,0.0008323903,0.002374959,0.001000257,0.002139033,0.0019899,0.001905584,0.001508297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001645702,"about_ca_system_score_gemma":0.002319845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007933808,"about_ca_topic_score_gemma":0.0087607,"domain_scores_codex":[0.9991367,0.0003496734,0.00003006379,0.0001295917,0.0002084686,0.0001455211],"domain_scores_gemma":[0.9966655,0.002687865,0.0001173785,0.0001815347,0.0002411032,0.0001066176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001676,0.0002357672,0.0002628413,0.0001718814,0.00003937199,0.00006062888,0.00008978879,0.8367434,0.001346769,0.06214567,0.01116138,0.08757485],"study_design_scores_gemma":[0.00004981953,0.00003079989,0.00004465258,0.00001646315,0.000008513224,0.00001604336,0.00003177583,0.9645262,0.0003576984,0.03382447,0.001086266,0.00000738554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02020657,0.0004600872,0.9533308,0.001073086,0.0001748299,0.0001839655,0.0003413399,0.0005878177,0.02364145],"genre_scores_gemma":[0.2948857,0.0004343512,0.6925814,0.0004869714,0.0001582662,0.0004088389,0.0004213426,0.000343359,0.01027983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01278461,"threshold_uncertainty_score":0.04276878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032499563","doi":"10.1007/s10732-011-9175-1","title":"Quadratic bottleneck knapsack problems","year":2011,"lang":"fr","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Bottleneck; Heuristic; Continuous knapsack problem; Polynomial-time approximation scheme; Mathematical optimization; Mathematics; Quadratic equation; Point (geometry); Computational complexity theory; Approximation algorithm; Computer science; Algorithm","authors":[{"name":"Ruonan Zhang","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04580082402390537,"gpt":0.2198655898053853,"spread":0.1740647657814799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002709741,0.001383061,0.002063287,0.001754252,0.001558163,0.003137376,0.003439207,0.001946137,0.02491894],"category_scores_gemma":[0.01136619,0.001237937,0.0008500055,0.003160508,0.0009720456,0.005166162,0.002309172,0.003046443,0.003706441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476568,"about_ca_system_score_gemma":0.001833561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003667082,"about_ca_topic_score_gemma":0.004430947,"domain_scores_codex":[0.9979533,0.0006140227,0.0001148577,0.000332909,0.0005499148,0.0004350939],"domain_scores_gemma":[0.9944931,0.003393775,0.0002694463,0.00048142,0.001031733,0.0003305124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001465285,0.001403587,0.00147132,0.001992504,0.0001676745,0.0003220587,0.0002315685,0.4624974,0.004384006,0.2021514,0.07786141,0.2460517],"study_design_scores_gemma":[0.0001711557,0.0002211511,0.0005117432,0.0001107716,0.0000595896,0.0001654462,0.0001277689,0.8404853,0.003044037,0.1351786,0.01988922,0.00003526014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05469687,0.005286457,0.8567971,0.002071355,0.0009909144,0.0004174992,0.001474751,0.001359698,0.0769053],"genre_scores_gemma":[0.4940757,0.00442687,0.4267468,0.0006942779,0.0008728858,0.0005369171,0.004927144,0.000936552,0.0667828],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02491894,"threshold_uncertainty_score":0.08336216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385705217","doi":"10.1007/s10732-023-09515-w","title":"An integrated learning and progressive hedging matheuristic for stochastic network design problem","year":2023,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Quality (philosophy); Network planning and design; Point (geometry); Artificial intelligence; Mathematics","authors":[{"name":"Fatemeh Sarayloo","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Walter Rei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02906346457009566,"gpt":0.3317644664010722,"spread":0.3027010018309765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153364,0.001009731,0.001692085,0.0009073244,0.0005153654,0.001116445,0.002023395,0.001796319,0.0044325],"category_scores_gemma":[0.00427722,0.0006574212,0.0008458098,0.0007212912,0.0009162897,0.001578392,0.00204307,0.00180604,0.0002664576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001267388,"about_ca_system_score_gemma":0.00164969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005934069,"about_ca_topic_score_gemma":0.005718991,"domain_scores_codex":[0.9994286,0.0002300625,0.00002809784,0.0001096678,0.0001241242,0.00007942797],"domain_scores_gemma":[0.9983626,0.001141758,0.00009655314,0.0000919945,0.0001948988,0.0001122121],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005314148,0.00009710943,0.000327525,0.00006012854,0.00002785826,0.0000393544,0.00003118157,0.9616297,0.0004365882,0.0113953,0.0006666504,0.02523539],"study_design_scores_gemma":[0.000008861391,0.00002551651,0.00003422646,0.000003425966,0.000005743035,0.00000551121,0.00000244528,0.9964086,0.00007164046,0.003309813,0.0001219711,0.000002203382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03008617,0.0002417537,0.9638143,0.0002921064,0.00004417968,0.0001181507,0.00007132351,0.000144801,0.005187212],"genre_scores_gemma":[0.7075735,0.0003529963,0.2841118,0.000222813,0.0001102175,0.000312761,0.0001841547,0.00006999617,0.007061779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005934069,"threshold_uncertainty_score":0.01482821,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}