{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004991315,0.00007229276,0.0001441092,0.0001100077,0.00004038112,0.00003883074,0.0001156618,0.00005345431,0.0001089353],"category_scores_gemma":[0.0001245007,0.00007080853,0.00003941756,0.0002270674,0.00001067146,0.0001044996,0.00001226176,0.0002510256,0.00001240503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007007556,"about_ca_system_score_gemma":0.00003176382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.329583e-7,"about_ca_topic_score_gemma":9.148894e-8,"domain_scores_codex":[0.9992149,0.00005598082,0.0003352086,0.00004207838,0.0002005193,0.0001512923],"domain_scores_gemma":[0.9994135,0.0001287382,0.00006553129,0.00009326408,0.000211074,0.00008782445],"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.00001492585,0.00003514975,0.002889034,0.00002582634,0.00003931824,0.00006559135,0.00007530704,0.9858889,0.002767125,0.001344682,0.001928641,0.004925492],"study_design_scores_gemma":[0.0006069971,0.0001164299,0.002428524,0.00007001795,0.00005385628,0.0008565596,0.00004219021,0.9850467,0.001643674,0.002251484,0.00671958,0.000163925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02359594,0.0002021853,0.9690291,0.00006977293,0.0004968909,0.0000276573,0.000001935268,0.00004651056,0.006530045],"genre_scores_gemma":[0.5567801,0.0001972975,0.4425572,0.00003605966,0.0003375441,2.266746e-7,0.000001399741,0.00002436106,0.00006588699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5331841,"threshold_uncertainty_score":0.2887488,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015245,0.0001812076,0.0003479701,0.0001143489,0.0001317288,0.0001404421,0.0001303079,0.00009124875,0.00005202568],"category_scores_gemma":[0.0003216853,0.0001786945,0.00007169534,0.000209097,0.00008563602,0.0001640764,0.00002285728,0.0004285641,0.000002170511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008139743,"about_ca_system_score_gemma":0.00004900748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003198757,"about_ca_topic_score_gemma":4.804691e-7,"domain_scores_codex":[0.9984272,0.00008993466,0.0007865925,0.0001109973,0.0002649236,0.0003204248],"domain_scores_gemma":[0.9990805,0.0002191347,0.0002188067,0.0001232017,0.0001998761,0.000158499],"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.000009850206,0.00003778525,0.003460797,0.0001668851,0.0001178888,0.00008510362,0.0007677027,0.8669691,0.003427205,0.0001842984,0.0000664462,0.1247069],"study_design_scores_gemma":[0.0004902911,0.00006868417,0.0004311892,0.0002281461,0.0001511554,0.0006687663,0.0001613983,0.9945974,0.000554718,0.0002246125,0.00218262,0.0002410258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4922488,0.001217024,0.5050896,0.00003928661,0.0003657861,0.0001486483,0.000005683218,0.0001276137,0.000757554],"genre_scores_gemma":[0.6166497,0.0001809702,0.382922,0.0000156792,0.0001737375,4.272322e-7,5.184464e-7,0.00003837526,0.00001853225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1276283,"threshold_uncertainty_score":0.728695,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006777932,0.00009615059,0.000143353,0.00009884108,0.0002293343,0.0001526343,0.0002871322,0.00003001255,0.0001804225],"category_scores_gemma":[0.00032244,0.00006298056,0.00007740965,0.0002579,0.00004362634,0.0003242064,0.00005587754,0.0001539434,0.00007890452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004189521,"about_ca_system_score_gemma":0.00008366343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001367665,"about_ca_topic_score_gemma":0.00005008464,"domain_scores_codex":[0.9990683,0.000006884091,0.0003705625,0.00008502256,0.0002819014,0.0001873361],"domain_scores_gemma":[0.9989754,0.00006573351,0.0001148615,0.0001424495,0.0006847352,0.00001683663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001732225,0.0003348317,0.0009521107,0.0002347929,0.0002076085,0.00001414838,0.0002528257,0.3513052,0.00006286267,0.5950369,0.04750514,0.003920433],"study_design_scores_gemma":[0.005302419,0.0002229255,0.00605201,0.0001312221,0.0004920785,0.00001499986,0.003016599,0.112794,0.00007401688,0.06562828,0.8057714,0.0004999845],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005546254,0.0003300419,0.9533705,0.0298189,0.002368091,0.000562161,0.00001001041,0.00002644504,0.00796765],"genre_scores_gemma":[0.9901063,0.0001332109,0.004424634,0.002874613,0.001877926,0.000009649097,0.000008717216,0.00001630635,0.000548676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.98456,"threshold_uncertainty_score":0.2568273,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006885387,0.0001514473,0.000236557,0.00009861797,0.0001345722,0.0001053036,0.00020572,0.00005475991,0.00008809378],"category_scores_gemma":[0.0002228011,0.0001051615,0.00005630541,0.0003226629,0.00005218148,0.00008972627,0.00001830937,0.0003532529,0.00001715231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001071227,"about_ca_system_score_gemma":0.00005099099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001568838,"about_ca_topic_score_gemma":5.570242e-7,"domain_scores_codex":[0.9988167,0.00007051881,0.0004775232,0.00008516777,0.0002937492,0.0002563719],"domain_scores_gemma":[0.9990652,0.0002217616,0.0001647933,0.0001604708,0.0002530677,0.0001347708],"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.000008523463,0.00001952596,0.0007235043,0.00001553376,0.00004027759,0.00003486081,0.0003184587,0.9930303,0.003686102,0.0000487629,0.0005937984,0.001480317],"study_design_scores_gemma":[0.0004937506,0.0001100938,0.00009621133,0.0001410873,0.00006053914,0.0001500235,0.00009209427,0.9955916,0.002456726,0.00001056581,0.000642714,0.0001545393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1536065,0.0001038376,0.8443575,0.0003705089,0.0001731634,0.0001955833,0.000006926968,0.00007387778,0.00111205],"genre_scores_gemma":[0.5533728,0.000003134825,0.4462563,0.0001614147,0.0001459172,7.379143e-7,2.535009e-7,0.00003925694,0.00002020152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3997662,"threshold_uncertainty_score":0.4288361,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006042543,0.000113801,0.0001757969,0.00005617044,0.0001393996,0.00004020792,0.0001823451,0.00005164894,0.000008747935],"category_scores_gemma":[0.0001770656,0.00007631243,0.00006845214,0.0001717059,0.00003858982,0.0001107866,0.00001550914,0.0002544694,0.00000569003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001340508,"about_ca_system_score_gemma":0.00009080511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001547098,"about_ca_topic_score_gemma":3.547733e-7,"domain_scores_codex":[0.9990786,0.00002766532,0.0003873969,0.00006658102,0.0002372052,0.000202548],"domain_scores_gemma":[0.9990209,0.0003359891,0.0001746353,0.0001220764,0.000282596,0.0000638575],"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.0000226327,0.0000209882,0.0002032307,0.000022775,0.00007060078,0.00001057747,0.0001585545,0.9953305,0.0003779161,0.0002437171,0.0006989019,0.002839586],"study_design_scores_gemma":[0.001542262,0.0002474943,0.001266884,0.0001346546,0.0001261008,0.0003373781,0.00008523654,0.9908339,0.000797107,0.001206807,0.003246273,0.0001759153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00612695,0.0004341328,0.9922119,0.0004501129,0.0002138189,0.0001974031,0.000009604633,0.00006404569,0.0002920523],"genre_scores_gemma":[0.2323479,0.00004144252,0.76695,0.00005023848,0.0004712872,0.000004615996,0.000001672931,0.00004894022,0.00008394536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.226221,"threshold_uncertainty_score":0.311193,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008162076,0.0001111836,0.000235818,0.00006843479,0.00008408253,0.00004422105,0.0001328563,0.00006996929,0.00007102712],"category_scores_gemma":[0.0003560418,0.0001019963,0.00006151725,0.0002117626,0.00002910362,0.00007932071,0.000008118447,0.0002729827,0.000009169185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006329884,"about_ca_system_score_gemma":0.00001963486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.34214e-7,"about_ca_topic_score_gemma":1.77001e-7,"domain_scores_codex":[0.9989496,0.0001389846,0.0004263922,0.00006106491,0.0001738862,0.0002500172],"domain_scores_gemma":[0.9986441,0.0006199848,0.00009211481,0.00009131842,0.0004499717,0.000102506],"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.00001905553,0.00001698708,0.00008085318,0.00002033299,0.00006096676,0.00001456992,0.0003071456,0.9607341,0.0001703127,0.0001870001,0.03730967,0.001079072],"study_design_scores_gemma":[0.0005795148,0.0001675927,0.00005139827,0.00003666873,0.00003433148,0.00005477688,0.00004041868,0.9953794,0.0006042118,0.0001518331,0.00278384,0.0001160523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002017935,0.0006830816,0.9962392,0.00008919315,0.0004515627,0.0001427279,0.00000647573,0.00004285661,0.0003269874],"genre_scores_gemma":[0.1172742,0.0003469159,0.8815968,0.00005111083,0.0004805564,0.000002825055,0.000001331704,0.0000430926,0.000203176],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1152563,"threshold_uncertainty_score":0.4159288,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904272,0.00006699231,0.0001625791,0.00009338115,0.00008539103,0.0001811011,0.0003664809,0.00003653246,0.000003750974],"category_scores_gemma":[0.0004508042,0.00005283969,0.00004186761,0.0002462537,0.00002374922,0.0005489103,0.0000336923,0.0001946421,0.00001239276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003553516,"about_ca_system_score_gemma":0.0001258063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001637157,"about_ca_topic_score_gemma":0.000001284036,"domain_scores_codex":[0.9989483,0.0001154688,0.0003875597,0.00009242033,0.0003642836,0.00009191238],"domain_scores_gemma":[0.9986576,0.0001612358,0.0004855218,0.0001954185,0.0004097716,0.0000904344],"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.00001653609,0.0002866023,0.1398834,0.00003179324,0.0002887851,0.0000805415,0.009856646,0.003548621,0.0004390305,0.0794975,0.02123494,0.7448356],"study_design_scores_gemma":[0.0009570065,0.0005387223,0.2691785,0.00007646184,0.0001834254,0.0001445956,0.0004611411,0.6300559,0.0002817792,0.05609059,0.04167579,0.0003561105],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007254543,0.000116644,0.9902336,0.001154872,0.000276837,0.00002102387,0.000004893236,0.00002008642,0.0009175063],"genre_scores_gemma":[0.7697024,0.00002175713,0.2298441,0.00004022306,0.00032554,2.127909e-7,0.00001039297,0.000002910328,0.00005247257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7624478,"threshold_uncertainty_score":0.215474,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068753,0.000089234,0.0001502829,0.00004602579,0.000123347,0.00006171103,0.0001683169,0.0000513609,0.000004289041],"category_scores_gemma":[0.0002832169,0.00006532668,0.00008667244,0.0001249799,0.00001694735,0.0000648023,0.00001502447,0.0002385044,0.000001415179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005571132,"about_ca_system_score_gemma":0.00002592436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002841575,"about_ca_topic_score_gemma":8.749541e-7,"domain_scores_codex":[0.9990395,0.00003440777,0.0005137149,0.00005134025,0.0001788756,0.0001821667],"domain_scores_gemma":[0.9988367,0.0005984287,0.0002075051,0.000107894,0.0002192431,0.00003025058],"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.000008021782,0.00001376756,0.001481702,0.00005514925,0.00002661032,0.000006606544,0.0001019237,0.9853532,0.001146373,0.001342912,0.004850187,0.005613494],"study_design_scores_gemma":[0.0004481294,0.00004788979,0.001284347,0.00008752912,0.00007077747,0.00005288473,0.0000548555,0.9848622,0.0009516433,0.002544699,0.009482022,0.0001130432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01266299,0.0006601249,0.9851127,0.0002178635,0.0005065068,0.0001097297,0.000003929306,0.00005839981,0.0006677684],"genre_scores_gemma":[0.6400168,0.00005078812,0.3590759,0.00003173698,0.0007277335,0.000001757124,8.658121e-7,0.00003432271,0.00006008029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6273538,"threshold_uncertainty_score":0.2663945,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511071,0.00008438474,0.0001580307,0.00007096895,0.00005519337,0.00006112627,0.00007227044,0.00005494164,0.00006721961],"category_scores_gemma":[0.0003647014,0.00008525193,0.00007106482,0.0000785481,0.00002040593,0.00005089142,0.000004055379,0.0001278412,0.000001993393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001024887,"about_ca_system_score_gemma":0.00002002415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.671941e-7,"about_ca_topic_score_gemma":3.154352e-7,"domain_scores_codex":[0.9991505,0.00004107192,0.0004284175,0.00005545875,0.0001792216,0.0001454006],"domain_scores_gemma":[0.9993358,0.0001539335,0.0001522736,0.00007865123,0.000200861,0.00007847203],"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.000004816007,0.00006148835,0.0001985792,0.00007165494,0.00004217449,0.000013284,0.00009056876,0.9240739,0.003820978,0.0001313859,0.01269764,0.05879348],"study_design_scores_gemma":[0.0005406823,0.0001227518,0.00002821793,0.00002999178,0.00004300257,0.00002835348,0.00001920684,0.9793248,0.002419514,0.00001870748,0.01733279,0.0000920282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003679509,0.0002697796,0.9949911,0.0001277808,0.0005240183,0.0001468671,0.000007124454,0.00004088762,0.0002129537],"genre_scores_gemma":[0.3873343,0.00003101454,0.6122143,0.00004389805,0.0003169649,0.000004050099,0.000002181955,0.00002052514,0.00003284709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3836547,"threshold_uncertainty_score":0.3476473,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000208978,0.0001209315,0.0001713331,0.00005537787,0.00008212189,0.0001289827,0.0003080825,0.00006312664,0.0000582966],"category_scores_gemma":[0.0001961339,0.0001089689,0.0001083434,0.0002633895,0.00009252691,0.0001427572,0.00002606366,0.0001356697,0.00002405137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002185561,"about_ca_system_score_gemma":0.0003336177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005346445,"about_ca_topic_score_gemma":0.000008121459,"domain_scores_codex":[0.9987565,0.00005111123,0.0004474347,0.0001307809,0.0004325819,0.000181616],"domain_scores_gemma":[0.9989982,0.0001058876,0.0003323395,0.0001670743,0.0002857024,0.0001107825],"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.0001091936,0.0005436801,0.02681994,0.00002930836,0.00005577675,0.0008180873,0.00003120699,0.3926876,0.00004960959,0.2877679,0.04004012,0.2510476],"study_design_scores_gemma":[0.003478276,0.0006393377,0.05036538,0.0001589189,0.00006557591,0.001409487,0.00002493819,0.8741205,0.0002266668,0.06192823,0.007057086,0.0005256173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004827246,0.00003400846,0.9884618,0.0009267806,0.00114192,0.00004478317,0.0000252611,0.00003934595,0.004498836],"genre_scores_gemma":[0.8584988,0.000002923682,0.1408361,0.0004904709,0.0001488275,2.368952e-7,0.000002040662,0.000003236273,0.00001744577],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8536715,"threshold_uncertainty_score":0.4443624,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001199869,0.0001354682,0.0002489026,0.00009309125,0.0005925024,0.00009460653,0.0001670634,0.0001066539,0.00002421561],"category_scores_gemma":[0.0006111501,0.0001138728,0.00008184692,0.0002413386,0.0001340379,0.0002215822,0.000003130335,0.0002103823,0.000003777363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001321207,"about_ca_system_score_gemma":0.0003531889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004533474,"about_ca_topic_score_gemma":0.0001680383,"domain_scores_codex":[0.9984969,0.0001541231,0.0004753653,0.0001274813,0.0004345111,0.0003116264],"domain_scores_gemma":[0.9979239,0.0004773488,0.0005522097,0.00009075539,0.0007848828,0.0001709028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00103612,0.0003371408,0.01213933,0.0001057631,0.0001391901,0.0001414737,0.01633344,0.9622737,0.00005404904,0.003214226,0.002387948,0.001837664],"study_design_scores_gemma":[0.09038083,0.01543003,0.6176283,0.01172467,0.01017189,0.0008830043,0.019155,0.1315276,0.004168507,0.07402234,0.01567283,0.009235027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09473635,0.0002354047,0.9033377,0.0005140593,0.0005836638,0.0003587269,0.00002363689,0.00004413985,0.0001663125],"genre_scores_gemma":[0.904741,0.0001266637,0.09411993,0.0001195573,0.0006464298,0.000005346268,0.00003963215,0.00002277683,0.0001786906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8307461,"threshold_uncertainty_score":0.4643596,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003442288,0.00007338117,0.0001719499,0.00004877383,0.0001096691,0.00004065009,0.0002427865,0.0000418969,0.000003262397],"category_scores_gemma":[0.0007370994,0.00005481395,0.00006316831,0.00001770821,0.00005217973,0.00008296563,0.00001949613,0.000108122,1.960426e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002638404,"about_ca_system_score_gemma":0.00001784549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001400943,"about_ca_topic_score_gemma":4.688209e-7,"domain_scores_codex":[0.9994515,0.000004983313,0.000336102,0.00005057597,0.00006896799,0.00008789134],"domain_scores_gemma":[0.9991297,0.00007117977,0.0003672905,0.0002489085,0.0001562234,0.00002674511],"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.00002551688,0.00002179665,0.00007597781,0.00009894819,0.00004294822,3.886789e-7,0.00004209625,0.9967645,0.0000690959,0.0004272134,0.001491677,0.0009397785],"study_design_scores_gemma":[0.0001866431,0.00008554548,0.0002405873,0.00004459794,0.00009335956,0.0000357074,0.00004070723,0.9981049,0.0003642458,0.0005110825,0.0002279093,0.00006476254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01884541,0.0003042312,0.979974,0.00007831408,0.000528625,0.0001369719,0.000009286076,0.00001516456,0.0001079953],"genre_scores_gemma":[0.7535174,0.0001677332,0.2459176,0.000002726189,0.0003503772,0.000004350222,0.000001815653,0.00001725671,0.00002065871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.734672,"threshold_uncertainty_score":0.2235248,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305803,0.0001175089,0.0002100546,0.00005810801,0.00009156935,0.0000849495,0.00009672295,0.00002995749,0.000002137072],"category_scores_gemma":[0.00106166,0.00007822685,0.00003122064,0.00008131863,0.00008772272,0.0001054224,0.00001400115,0.0001909521,6.491742e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000482268,"about_ca_system_score_gemma":0.00007791949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.502027e-7,"about_ca_topic_score_gemma":7.654492e-7,"domain_scores_codex":[0.9990495,0.0000587861,0.0004404491,0.00007319333,0.0002144739,0.0001635251],"domain_scores_gemma":[0.9984589,0.0006989537,0.0002377311,0.00009223702,0.0003961285,0.0001160438],"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.00006718416,0.00001529177,0.0003145863,0.00006129988,0.0001268199,0.00001580118,0.0004419195,0.9924834,0.000203552,0.0005268023,0.0006289518,0.005114342],"study_design_scores_gemma":[0.001195148,0.0002033964,0.0002663389,0.00007922316,0.000249278,0.0005908151,0.0002139876,0.9956166,0.0002620009,0.001007332,0.0001945643,0.0001213264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03601101,0.0004571234,0.9628684,0.0001517839,0.0001850925,0.0002115623,0.000008509452,0.00003106088,0.00007549327],"genre_scores_gemma":[0.8336235,0.00001649049,0.1661487,0.00002135889,0.0001470468,0.000003942147,0.000001004484,0.00002579412,0.00001220618],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7976125,"threshold_uncertainty_score":0.3189998,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532537,0.0001540312,0.0003511905,0.0002400796,0.000128048,0.00006545747,0.0001877297,0.00008548622,0.00001618033],"category_scores_gemma":[0.00725344,0.0001277858,0.00009778499,0.0001948895,0.0001163321,0.0001272249,0.00007407343,0.00035826,0.000001871958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008780206,"about_ca_system_score_gemma":0.00007844516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.495773e-7,"about_ca_topic_score_gemma":0.000005728346,"domain_scores_codex":[0.9982325,0.0000427229,0.0007711756,0.0001352721,0.0004481557,0.0003701043],"domain_scores_gemma":[0.9961174,0.001985945,0.0005069796,0.0001533394,0.00100641,0.0002299714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004617183,0.004732873,0.007360408,0.005326252,0.001630413,0.002849807,0.008662695,0.002653894,0.001199152,0.1628124,0.1105971,0.6875578],"study_design_scores_gemma":[0.01664748,0.005751271,0.002037618,0.001457624,0.001168932,0.004603512,0.00717671,0.09180707,0.005537021,0.5702987,0.2912451,0.002268991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006391054,0.0003146431,0.9922851,0.0001747683,0.0003165479,0.0003234788,0.00001169089,0.00002263613,0.0001600725],"genre_scores_gemma":[0.1103338,0.0001390999,0.8882363,0.00004871054,0.0004655911,0.000005820544,0.00000256897,0.00005766206,0.0007104848],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6852888,"threshold_uncertainty_score":0.8683569,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003284397,0.0003158103,0.0006759363,0.0003923745,0.000129792,0.0001199923,0.000380533,0.000336652,0.0001863839],"category_scores_gemma":[0.008083252,0.0003670149,0.0001871507,0.0006935166,0.0001328015,0.0002685535,0.00007847216,0.001358091,0.0001748401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004699467,"about_ca_system_score_gemma":0.0001751145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002146538,"about_ca_topic_score_gemma":0.000006334123,"domain_scores_codex":[0.9962577,0.000691599,0.001766132,0.0001927155,0.0005087514,0.0005830919],"domain_scores_gemma":[0.9962243,0.0017311,0.0008759269,0.0003428955,0.0005499411,0.0002757693],"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.00001986774,0.0001645974,0.01197557,0.0001752465,0.00007234103,0.0001089749,0.0008796151,0.96243,0.000731101,0.004036652,0.00415135,0.01525471],"study_design_scores_gemma":[0.001263089,0.0001940411,0.0121121,0.0007126402,0.0001800774,0.0002254621,0.000113549,0.9649797,0.0003885238,0.002057653,0.01739096,0.0003821864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1003593,0.00280744,0.8829877,0.002792694,0.00479047,0.0001823533,0.00003400944,0.0000872029,0.005958878],"genre_scores_gemma":[0.5426098,0.0005331232,0.4526653,0.0001298107,0.001835866,0.000001193965,0.000005650184,0.0001368306,0.002082389],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4422506,"threshold_uncertainty_score":0.9998782,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001009715,0.00006916889,0.0001719342,0.00005832388,0.0002668437,0.00005120038,0.0001485257,0.00005906432,0.00001650733],"category_scores_gemma":[0.0007170217,0.00006393419,0.00006360974,0.0002450367,0.0000241595,0.0001028316,0.000001173364,0.0001060603,0.000002992062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003277435,"about_ca_system_score_gemma":0.0002361452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007951778,"about_ca_topic_score_gemma":0.00001713759,"domain_scores_codex":[0.9990159,0.00009337941,0.0003570565,0.00006342414,0.0002766398,0.0001936297],"domain_scores_gemma":[0.998328,0.0005325839,0.0003432948,0.0000531292,0.0006304791,0.0001125041],"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.0001615882,0.00005532159,0.00006355208,0.000008705492,0.00002630879,0.000012387,0.002569862,0.9701812,0.000008208225,0.01028307,0.0149906,0.001639204],"study_design_scores_gemma":[0.009481957,0.005286644,0.02691691,0.001205348,0.003660754,0.0001478156,0.006524781,0.3070046,0.00006858192,0.395146,0.2424424,0.002114323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006920123,0.0002670012,0.9963555,0.001745555,0.0005051314,0.0001437029,0.000005152666,0.00002024623,0.0002656991],"genre_scores_gemma":[0.7765418,0.0000640674,0.2211178,0.0008810297,0.001149313,0.000001583576,0.000005874217,0.00001010596,0.0002283942],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7758498,"threshold_uncertainty_score":0.2607161,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009224104,0.0001617027,0.0003978827,0.0003687172,0.0005179791,0.0004993115,0.001158656,0.0000895255,0.00003623994],"category_scores_gemma":[0.006663387,0.00009269667,0.0002524237,0.00120709,0.00004827049,0.0002327134,0.000106079,0.0008436884,0.0001420788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005731526,"about_ca_system_score_gemma":0.0003039978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000106121,"about_ca_topic_score_gemma":0.000006871497,"domain_scores_codex":[0.9962847,0.0003782233,0.0008172658,0.0002734967,0.001742795,0.0005035283],"domain_scores_gemma":[0.9969521,0.0008886278,0.0004449131,0.0005296412,0.0008574288,0.0003273056],"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.001094702,0.01426294,0.03623502,0.00005316457,0.0005749553,0.0002629339,0.0289956,0.6570678,0.002525727,0.08967175,0.02818794,0.1410674],"study_design_scores_gemma":[0.004576656,0.00171311,0.3246551,0.0002120167,0.0003286425,0.0007639577,0.004798695,0.5611724,0.0009564004,0.04978739,0.04997749,0.0010581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1794046,0.0002975277,0.810928,0.007153873,0.0003860812,0.0001648957,0.00001729905,0.00001952901,0.001628159],"genre_scores_gemma":[0.8263791,0.00001080062,0.1725388,0.0003983489,0.000431015,0.000001069408,3.919808e-7,0.000009277434,0.0002312298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6469744,"threshold_uncertainty_score":0.7977178,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603685,0.0001027548,0.0002059786,0.00005409514,0.00007718257,0.00004881827,0.0001127934,0.00004804018,0.00008147787],"category_scores_gemma":[0.00007159136,0.00008640017,0.00005211754,0.0001407103,0.00002603473,0.00009038774,0.000006161064,0.0002191191,0.000003863989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005424089,"about_ca_system_score_gemma":0.00004004395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001994867,"about_ca_topic_score_gemma":0.000001769086,"domain_scores_codex":[0.999105,0.00003988319,0.0003519325,0.00006096012,0.0001874522,0.0002547219],"domain_scores_gemma":[0.9992327,0.0003439599,0.00006309909,0.00008805638,0.0001892896,0.00008291441],"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.0000606738,0.000010345,0.00275135,0.0001070203,0.00004560219,0.000008708845,0.0003469067,0.9864185,0.00006999142,0.00005193494,0.001757431,0.00837148],"study_design_scores_gemma":[0.001177828,0.0002827334,0.0005017794,0.0001971735,0.00004891652,0.0001586662,0.0001656355,0.9474232,0.0007955838,0.0002491359,0.04878142,0.0002179781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09552807,0.0003602543,0.9019675,0.00005197659,0.0001547401,0.0001741833,0.00002054262,0.00007130461,0.001671466],"genre_scores_gemma":[0.3353161,0.0001159654,0.6633195,0.00001677929,0.0003920751,0.000003158151,0.000001907041,0.00003903367,0.0007955171],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.239788,"threshold_uncertainty_score":0.3523297,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007795549,0.0001636716,0.0003078523,0.0001170268,0.0001235158,0.0001365138,0.0001932621,0.0001048758,0.00002126047],"category_scores_gemma":[0.0004548366,0.0001533477,0.0001297375,0.0001611255,0.00002383795,0.0001901623,0.00002932328,0.0003677566,0.00001068211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000104688,"about_ca_system_score_gemma":0.00005351046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005200229,"about_ca_topic_score_gemma":4.153385e-7,"domain_scores_codex":[0.9985162,0.0000602786,0.0007678647,0.0001057054,0.0002322938,0.0003176294],"domain_scores_gemma":[0.998727,0.0002098208,0.0003018808,0.0001340506,0.0004949103,0.0001323183],"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.00001768336,0.000229561,0.004856831,0.0006165637,0.0002924835,0.00008043641,0.003324204,0.4620448,0.01247583,0.0002082525,0.005658797,0.5101945],"study_design_scores_gemma":[0.0008591382,0.00009585451,0.000636416,0.0001604713,0.00004505571,0.00009101078,0.0001428093,0.9962287,0.0005614919,0.0002123374,0.0007926066,0.0001741016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02236958,0.0003399694,0.9763258,0.00006603748,0.0004477469,0.0002497976,0.000007119047,0.0001041399,0.00008983158],"genre_scores_gemma":[0.1560347,0.00006156739,0.8433801,0.00004555031,0.0003479332,0.000009863676,0.000001673564,0.00006388684,0.00005475993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5341839,"threshold_uncertainty_score":0.6253338,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002407507,0.000103062,0.0001785493,0.00009029621,0.00004118265,0.00006159201,0.0001132409,0.00004998814,0.000028534],"category_scores_gemma":[0.0001005991,0.00009172705,0.0000476735,0.0002434755,0.00001159143,0.00007201373,0.00001120915,0.0001552151,0.00003098596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000808967,"about_ca_system_score_gemma":0.00002004914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.080503e-7,"about_ca_topic_score_gemma":5.474483e-7,"domain_scores_codex":[0.9990651,0.00001412332,0.0004427959,0.00006750154,0.0002235371,0.0001869658],"domain_scores_gemma":[0.9994118,0.0000303106,0.0001037078,0.00009982671,0.0001876041,0.0001667709],"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.00005449339,0.0001910238,0.0002329704,0.0001396656,0.00007183717,0.00003467438,0.0003666089,0.8453102,0.003772717,0.004505263,0.001598698,0.1437219],"study_design_scores_gemma":[0.001416857,0.0005666876,0.00006793939,0.0002779478,0.000183094,0.0003058411,0.0003565913,0.7099045,0.001322444,0.004310832,0.2807325,0.0005547636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01355502,0.0001628334,0.9843364,0.000206633,0.000268087,0.0002333059,4.667609e-7,0.00008180803,0.001155405],"genre_scores_gemma":[0.3910016,0.00008818911,0.608481,0.00006252327,0.0002348504,0.000008295722,0.000002307266,0.00003128789,0.00008993618],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3774466,"threshold_uncertainty_score":0.374052,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001498003,0.000108372,0.0001722606,0.00008966443,0.00005237992,0.00002430851,0.0001075185,0.00006007841,0.000006155416],"category_scores_gemma":[0.00006093508,0.0000967613,0.00005523404,0.00003465767,0.00003509069,0.0001395517,0.00000764484,0.0001726639,0.000001162727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005276131,"about_ca_system_score_gemma":0.00004975492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003168359,"about_ca_topic_score_gemma":0.000002852918,"domain_scores_codex":[0.9993975,0.00001893854,0.0002931944,0.00005347369,0.00009132799,0.000145625],"domain_scores_gemma":[0.9994816,0.0001136224,0.0001290425,0.00006934896,0.0001518823,0.00005446324],"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.0001412386,0.00007049715,0.00004885492,0.0001144309,0.00008654891,0.00002513872,0.001274766,0.9868708,0.000155383,0.002704466,0.005597781,0.002910155],"study_design_scores_gemma":[0.005432269,0.004771135,0.006512931,0.0005031509,0.0008419608,0.0004080717,0.003484033,0.2310654,0.03427568,0.6931152,0.01772201,0.00186813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007160148,0.000129744,0.9970805,0.000006490022,0.0005824386,0.0001216575,0.0000100088,0.00004648963,0.001306655],"genre_scores_gemma":[0.6435668,0.00007053276,0.3560607,0.00001068016,0.0002460344,0.000004257019,0.000001542077,0.00002316163,0.00001624124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7558053,"threshold_uncertainty_score":0.3945811,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097379,0.0001372567,0.000271046,0.00006334863,0.0004209173,0.0001224308,0.0002014904,0.00009610321,0.00007820428],"category_scores_gemma":[0.0006666422,0.0001117701,0.00006068354,0.0002075637,0.0003070972,0.0002112896,0.000002481193,0.0002091431,0.00001004864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006085838,"about_ca_system_score_gemma":0.0003724171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006277751,"about_ca_topic_score_gemma":0.00007471417,"domain_scores_codex":[0.9985788,0.0001694997,0.0004752753,0.0001198356,0.0003281677,0.0003284373],"domain_scores_gemma":[0.9971685,0.001034539,0.0005954448,0.0000942165,0.0009080735,0.0001992472],"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.001254799,0.001003855,0.01370966,0.00008626616,0.0002722717,0.0001744777,0.008674177,0.8706491,0.0001014684,0.003215875,0.09004757,0.01081048],"study_design_scores_gemma":[0.01890595,0.003217949,0.02137486,0.001041784,0.0008796504,0.0001517803,0.003528955,0.9196232,0.000233638,0.01903426,0.01057737,0.001430634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004352749,0.00008181565,0.9941369,0.0002694776,0.0003188204,0.0007031027,0.00005014257,0.00003479526,0.00005215568],"genre_scores_gemma":[0.5117838,0.0000402286,0.4877684,0.00008420814,0.000220955,0.00001897986,0.00001365928,0.00001653088,0.00005315966],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5074311,"threshold_uncertainty_score":0.455785,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004661116,0.0001581466,0.0004372686,0.0001282828,0.0000447056,0.00003555823,0.0001520394,0.00008913414,0.000003278365],"category_scores_gemma":[0.0004525119,0.0001449905,0.0001316219,0.0001543528,0.00002478858,0.0001555916,0.000007305949,0.0001496469,6.808092e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008587721,"about_ca_system_score_gemma":0.00005779944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002574515,"about_ca_topic_score_gemma":9.294509e-7,"domain_scores_codex":[0.9985902,0.00004190088,0.0008803753,0.00009949582,0.0001834342,0.0002045403],"domain_scores_gemma":[0.9985641,0.0001163905,0.000397877,0.0001696907,0.0006636566,0.00008827788],"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.0001327347,0.00007310391,0.00001110313,0.0002771008,0.00004561727,0.00001526201,0.0001411907,0.9962531,0.0007099889,0.0002327539,0.0009641979,0.001143888],"study_design_scores_gemma":[0.0008464482,0.0004814377,0.00007911019,0.0001704638,0.00008192206,0.0001795853,0.00004621079,0.9961012,0.0005369157,0.0006129545,0.0007192772,0.0001444559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001015338,0.0005721293,0.9970883,0.00005908668,0.0007813864,0.0003021872,0.00003472609,0.00002997232,0.0001168359],"genre_scores_gemma":[0.1818358,0.001214061,0.8165925,0.00001619281,0.0001394326,0.000004703106,0.000008689713,0.00003297892,0.000155605],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1808205,"threshold_uncertainty_score":0.5912542,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116567,0.0001159162,0.0001886134,0.0001731859,0.0001899755,0.0002650183,0.001867391,0.00004064569,0.00003906632],"category_scores_gemma":[0.0002085931,0.00007252955,0.00008295212,0.0005974281,0.0001049085,0.0004306365,0.0004680413,0.0006100217,0.0004383352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007987401,"about_ca_system_score_gemma":0.0001484597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001010244,"about_ca_topic_score_gemma":0.000001807344,"domain_scores_codex":[0.9979837,0.0001870397,0.0003933774,0.0001617548,0.0008468653,0.0004272597],"domain_scores_gemma":[0.9979908,0.0004417159,0.0001273575,0.0004672024,0.0006898431,0.0002830283],"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.00009629762,0.000224252,0.00108885,0.0001024973,0.0001347028,0.0002986135,0.002987348,0.0534458,0.002618209,0.1127506,0.1581839,0.6680689],"study_design_scores_gemma":[0.002071519,0.002501437,0.006620423,0.0003902762,0.00003994024,0.002128915,0.002295362,0.4048935,0.004455511,0.3445552,0.2290656,0.000982262],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005885343,0.0001411478,0.9883611,0.004339166,0.000262797,0.0004362591,0.00000188858,0.00001751888,0.0005547899],"genre_scores_gemma":[0.9037805,0.00003763917,0.09480002,0.0007337051,0.0001884214,0.00002809348,2.850902e-7,0.00001787185,0.0004134976],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8978951,"threshold_uncertainty_score":0.5634059,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009688427,0.00009361955,0.0001530637,0.00003726959,0.0001251473,0.0001657151,0.0001261408,0.00004254188,0.000007981793],"category_scores_gemma":[0.0001885674,0.00006268199,0.00002564046,0.0001041504,0.00009719526,0.00008721106,0.00002590525,0.0003308161,0.000002696546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003607359,"about_ca_system_score_gemma":0.00002976505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.498093e-7,"about_ca_topic_score_gemma":3.686887e-7,"domain_scores_codex":[0.9991238,0.00005764426,0.0003592437,0.00006496195,0.000207046,0.0001872795],"domain_scores_gemma":[0.9990381,0.0004428669,0.0001894944,0.0001148627,0.0001489817,0.00006566617],"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.0000454517,0.00001051595,0.1089642,0.00008525864,0.00008906115,0.00003529351,0.0006067742,0.8684753,0.001034506,0.0009489756,0.0002509848,0.01945368],"study_design_scores_gemma":[0.002548385,0.0003585349,0.03181687,0.0006134678,0.00009329027,0.001321484,0.0009922668,0.9434092,0.002001139,0.0005481101,0.01582716,0.0004700611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.921769,0.0004202604,0.07237803,0.0001249616,0.0002125802,0.0001203045,0.000002260078,0.00005527289,0.004917342],"genre_scores_gemma":[0.9504286,0.00004226458,0.04929957,0.00002453643,0.00009302816,3.143477e-7,2.026557e-7,0.0000276701,0.00008379396],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0771473,"threshold_uncertainty_score":0.2556097,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007897754,0.0001307878,0.0002031574,0.00005696172,0.0001763639,0.0001031888,0.0001852203,0.00003561764,0.00002052719],"category_scores_gemma":[0.0001579362,0.00009022348,0.00006972111,0.00008708845,0.00003973012,0.00006871133,0.00001537657,0.0002133566,0.000005628493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005306266,"about_ca_system_score_gemma":0.000065709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.710193e-7,"about_ca_topic_score_gemma":2.326941e-7,"domain_scores_codex":[0.998929,0.00007254755,0.0004394001,0.00008431046,0.0002709273,0.000203792],"domain_scores_gemma":[0.9988432,0.0004425932,0.0001977031,0.0001355939,0.0003070249,0.00007390576],"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.000008889097,0.00001356724,0.0002073629,0.0000181732,0.00006558594,0.000004994621,0.00009307862,0.9253827,0.0005877521,0.00005727001,0.001118623,0.07244205],"study_design_scores_gemma":[0.0006577238,0.0001546886,0.0005575954,0.00003297683,0.00008533343,0.0002438549,0.00001101139,0.9923456,0.0007218332,0.0001486803,0.004920268,0.0001203962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01205295,0.0002823558,0.9869998,0.00014752,0.0001855823,0.0001660372,0.00001101508,0.0000395331,0.0001152002],"genre_scores_gemma":[0.1291093,0.0000291574,0.8697643,0.00008078374,0.0008675567,0.000006964897,0.000002939727,0.00004957733,0.00008943844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1172355,"threshold_uncertainty_score":0.3679206,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008187,0.0002274922,0.0003748171,0.00008740248,0.000172867,0.0000792303,0.0007097434,0.00009963774,0.00002926115],"category_scores_gemma":[0.0006863688,0.0001624527,0.00008453378,0.0002086636,0.00006049236,0.0002551606,0.0001257371,0.0004813198,0.00003249012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001181831,"about_ca_system_score_gemma":0.0001229334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005092164,"about_ca_topic_score_gemma":0.000009772914,"domain_scores_codex":[0.9982731,0.00006218199,0.0007066436,0.0001956454,0.0004032812,0.0003591182],"domain_scores_gemma":[0.9969687,0.001443342,0.0003843326,0.0006087228,0.0004857539,0.0001090805],"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.00008516345,0.00005953254,0.02225119,0.00009293396,0.0001829425,0.00001154598,0.0001221854,0.9701895,0.0007147758,0.0000613761,0.004864566,0.001364361],"study_design_scores_gemma":[0.001669135,0.0001638067,0.006082222,0.0001165487,0.0001592238,0.00008916185,0.0000606515,0.9864755,0.00008707758,0.00006633957,0.00481447,0.0002158663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01682704,0.0004038646,0.9811216,0.0001798433,0.0004856783,0.000617282,0.0001741719,0.0001012826,0.00008925144],"genre_scores_gemma":[0.3108543,0.00004157488,0.6884645,0.00004175082,0.0003764889,0.000004983907,0.00003080596,0.00008849599,0.00009712495],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2940272,"threshold_uncertainty_score":0.6624629,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008208688,0.00006402528,0.0001119204,0.00005746424,0.0001529127,0.00008031279,0.0001915826,0.00004042896,0.000002711405],"category_scores_gemma":[0.0005000889,0.00004436677,0.00004414575,0.0001003779,0.00005271853,0.00004835359,0.00001191735,0.0001391006,0.000008994516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006598671,"about_ca_system_score_gemma":0.00004344837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001434319,"about_ca_topic_score_gemma":0.0000121746,"domain_scores_codex":[0.9991515,0.00003632127,0.0003583016,0.00004300781,0.0002249746,0.0001859003],"domain_scores_gemma":[0.99861,0.0005509349,0.0001116041,0.0001121703,0.0005665056,0.00004879274],"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.0006614111,0.0001623961,0.01715845,0.001343859,0.001433058,0.0000640967,0.00487233,0.01623548,0.1486671,0.01357943,0.661702,0.1341205],"study_design_scores_gemma":[0.0008615773,0.0004484612,0.004082506,0.0002626386,0.00004664645,0.0001513319,0.0001941746,0.1338091,0.01567434,0.002526286,0.8417507,0.0001921282],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6926821,0.003203974,0.290222,0.001169752,0.005634478,0.000958509,0.00001540659,0.0001959682,0.005917681],"genre_scores_gemma":[0.9949208,0.00007223928,0.003590419,0.000009037143,0.001268805,0.000006044901,6.443686e-7,0.00002296133,0.0001090557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3022386,"threshold_uncertainty_score":0.1809224,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006932603,0.0001763314,0.0002878832,0.0002810685,0.0001933259,0.00007734678,0.0002453914,0.00003894595,0.00006300358],"category_scores_gemma":[0.00007597077,0.0001347171,0.0001270543,0.0002265401,0.0001158461,0.0003683235,0.00007310984,0.0001335164,0.00001778355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007914363,"about_ca_system_score_gemma":0.00003249429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001345351,"about_ca_topic_score_gemma":0.000006504715,"domain_scores_codex":[0.9986328,0.00001414757,0.0004882963,0.0001680388,0.0003829079,0.0003137623],"domain_scores_gemma":[0.998508,0.00004405159,0.0008123378,0.0001552295,0.0004541853,0.00002622067],"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.00135027,0.0008575342,0.006733001,0.002413911,0.001032526,0.001774256,0.0003649188,0.003048046,0.0002535845,0.2148798,0.7328205,0.03447163],"study_design_scores_gemma":[0.005691682,0.0003229145,0.00285152,0.0005085035,0.000632829,0.0004390713,0.00108578,0.02261832,0.00005925037,0.01152415,0.9537087,0.0005572736],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00528628,0.0001055152,0.9601637,0.001735183,0.0007027185,0.0008153666,0.000007369654,0.00004848573,0.03113536],"genre_scores_gemma":[0.6065382,0.0001498859,0.3847871,0.003546666,0.002055295,0.00004874744,0.00001634118,0.00007190978,0.002785808],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6012519,"threshold_uncertainty_score":0.5493604,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181927,0.0001163834,0.0002036404,0.0001111221,0.00007708027,0.0001282637,0.00008505581,0.0001393706,0.000007365655],"category_scores_gemma":[0.0002876456,0.0001110018,0.00003135474,0.0002164374,0.00002250329,0.0002826153,0.00001854564,0.0003448801,0.000001686048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007300163,"about_ca_system_score_gemma":0.00004141971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006207043,"about_ca_topic_score_gemma":6.230964e-7,"domain_scores_codex":[0.9990059,0.00006719059,0.0004657171,0.00008137959,0.0002176599,0.0001621172],"domain_scores_gemma":[0.9991136,0.00007447035,0.0001491136,0.0001040125,0.0004555108,0.000103284],"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.00000445745,0.00001280474,0.0007239643,0.00007981629,0.00002776925,0.000001462564,0.0005194802,0.9936055,0.0007417782,0.0004651308,0.0004776625,0.003340186],"study_design_scores_gemma":[0.0001823791,0.00002994878,0.0001790753,0.00006603319,0.00003588146,0.00004613378,0.0004009747,0.9956913,0.000129187,0.003042493,0.00007944375,0.0001171567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1598194,0.0005008538,0.8388294,0.00008722334,0.0002606567,0.0001085053,0.00000338199,0.0000408689,0.0003497073],"genre_scores_gemma":[0.527042,0.0001369887,0.472614,0.00001235187,0.0001558025,0.00000232086,0.000001362939,0.00001953097,0.00001569766],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3672225,"threshold_uncertainty_score":0.4526521,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009166587,0.0001487049,0.0003711809,0.000369767,0.00003906924,0.00002326933,0.0001762925,0.00006168561,0.00003586531],"category_scores_gemma":[0.0001923567,0.0001407356,0.0001601852,0.0003039734,0.00001931322,0.00004849807,0.00001497738,0.0002691916,0.00001124889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001697848,"about_ca_system_score_gemma":0.00002399877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005698332,"about_ca_topic_score_gemma":0.00001296195,"domain_scores_codex":[0.9984207,0.0000845591,0.0007279103,0.0001125852,0.0003499259,0.0003042783],"domain_scores_gemma":[0.9992948,0.000156864,0.0000855304,0.0002187965,0.0001296626,0.0001143812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001620252,0.000269904,0.004274916,0.002603024,0.001202353,0.001991926,0.002185209,0.8971522,0.0003637949,0.008385688,0.07595003,0.005458869],"study_design_scores_gemma":[0.006565845,0.0006913514,0.006320441,0.0009566469,0.0009488515,0.001149055,0.008894376,0.1997723,0.0006965099,0.00343606,0.7692126,0.001355914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6410129,0.01288345,0.3131069,0.0002050873,0.00184417,0.001159691,0.000104624,0.0001267134,0.02955647],"genre_scores_gemma":[0.9849179,0.0001931221,0.01418601,0.00002102639,0.0001381569,0.000005476236,0.000002861402,0.00004453395,0.0004909317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6973799,"threshold_uncertainty_score":0.573903,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588595,0.0001664484,0.0003795281,0.00020621,0.0001787863,0.0003967218,0.00176302,0.00007620465,0.00006856092],"category_scores_gemma":[0.001100464,0.0001126744,0.0001520863,0.0005705495,0.0001156611,0.0005282686,0.0002413902,0.0003890448,0.00001158161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006643833,"about_ca_system_score_gemma":0.0005399036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002614312,"about_ca_topic_score_gemma":8.830402e-7,"domain_scores_codex":[0.9969863,0.0003620901,0.001005509,0.0002333789,0.0009969434,0.0004157463],"domain_scores_gemma":[0.9957386,0.0005559773,0.000605222,0.0006630871,0.002175408,0.0002617263],"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.0006658186,0.004580683,0.00856105,0.002520241,0.00133767,0.0006508222,0.01694695,0.6179126,0.02612093,0.1677292,0.05247238,0.1005017],"study_design_scores_gemma":[0.000879059,0.0006187554,0.001264758,0.00008808417,0.00003617437,0.0002137159,0.00007115769,0.9891039,0.002608109,0.003487951,0.001463383,0.0001649307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0129794,0.0000738328,0.9850534,0.0005875085,0.000591887,0.0005448899,0.0000294967,0.00001664717,0.0001229455],"genre_scores_gemma":[0.653334,0.00003803286,0.3460703,0.00009815735,0.0002608873,0.00001589032,0.00000237324,0.00002369236,0.0001565763],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6403546,"threshold_uncertainty_score":0.4594728,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009978031,0.0001681348,0.0002658189,0.00007178447,0.0001459211,0.0001004329,0.0001547999,0.00006724188,0.000002935824],"category_scores_gemma":[0.0007391563,0.0001112658,0.00006162788,0.0001439061,0.00005150622,0.00002223883,0.00002918011,0.0002831477,8.358624e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004702495,"about_ca_system_score_gemma":0.00002647594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.906258e-7,"about_ca_topic_score_gemma":0.000001251366,"domain_scores_codex":[0.9988599,0.00007184009,0.0004681505,0.0001033303,0.0002443648,0.0002524205],"domain_scores_gemma":[0.997764,0.001465125,0.0002568696,0.0001683984,0.0002474546,0.00009818609],"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.00004739274,0.00001834914,0.00036367,0.00007420876,0.00006992709,0.000007871973,0.0001885855,0.9907059,0.00005274849,0.000237439,0.0002250439,0.008008867],"study_design_scores_gemma":[0.0006892518,0.0003849001,0.0001593712,0.0001294903,0.000149494,0.000185254,0.00003274369,0.994118,0.0001681436,0.0001709583,0.003662591,0.0001497734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03938776,0.0003614955,0.9594733,0.0000932121,0.0003041661,0.0001819942,0.000009053423,0.00004226289,0.0001467791],"genre_scores_gemma":[0.7212005,0.00005196053,0.2783313,0.0000368053,0.0003087258,0.000003198883,6.959024e-7,0.00004578638,0.00002093811],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6818128,"threshold_uncertainty_score":0.4537288,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003680857,0.00009766041,0.0001562144,0.00007525193,0.0002266165,0.00003701506,0.00007987563,0.00004521055,0.000004040442],"category_scores_gemma":[0.0003074521,0.00006719565,0.00003139049,0.0001231963,0.00009741666,0.0001118454,0.00001305275,0.0002269936,1.638133e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006864885,"about_ca_system_score_gemma":0.00004842978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005603952,"about_ca_topic_score_gemma":0.000004207332,"domain_scores_codex":[0.9992691,0.00004632607,0.000336543,0.00006143977,0.0001454212,0.0001412087],"domain_scores_gemma":[0.9988871,0.0005626824,0.0001629069,0.00008229691,0.0002523335,0.00005272132],"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.00001972041,0.00001052046,0.001365335,0.00003786081,0.00005285292,0.000003352631,0.0008161145,0.9967394,0.00002586381,0.0001603179,0.0004372199,0.0003314127],"study_design_scores_gemma":[0.0005177498,0.0001547211,0.00283232,0.00005441975,0.00006683001,0.0003096752,0.0004979327,0.9944806,0.000100775,0.0001288311,0.0007546844,0.0001014704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1047838,0.0001366018,0.8944769,0.000161277,0.0001754678,0.0001332554,0.00001607272,0.00003537548,0.00008133093],"genre_scores_gemma":[0.6611332,0.0005770866,0.3380717,0.00002093004,0.0001181302,0.000003950624,0.000001167669,0.00001946623,0.00005434125],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5564052,"threshold_uncertainty_score":0.2740159,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004249122,0.0001243215,0.0002272415,0.0001574025,0.00007680737,0.00009484766,0.0001478579,0.00008217819,0.00002149956],"category_scores_gemma":[0.00003845167,0.0001235745,0.0001060884,0.00007422542,0.00002056605,0.000116072,0.00001367063,0.0002633188,0.00001219295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001328471,"about_ca_system_score_gemma":0.00008873424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006344606,"about_ca_topic_score_gemma":0.00000199534,"domain_scores_codex":[0.9989768,0.00001012753,0.0005345034,0.00008564867,0.0001449279,0.0002480483],"domain_scores_gemma":[0.9993696,0.0001377424,0.0001234022,0.00009079418,0.000196317,0.00008210522],"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.000004937464,0.00002155987,0.0001096265,0.00004416067,0.00003629567,0.00001034,0.00005203241,0.9859561,0.0001518049,0.0001998043,0.0009713896,0.012442],"study_design_scores_gemma":[0.0006131867,0.00006218084,0.00005215152,0.0000547373,0.00003324827,0.00007850039,0.00007723155,0.9956536,0.001327548,0.0005348964,0.001371119,0.0001416238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01621859,0.000740486,0.9816645,0.00005918449,0.0008080794,0.0001017559,0.00002132217,0.00006297155,0.000323086],"genre_scores_gemma":[0.07025958,0.0001001764,0.9280729,0.00001607906,0.001380086,0.000002774406,0.00000706613,0.00005031033,0.000111046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05404098,"threshold_uncertainty_score":0.5039221,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002173295,0.0001200225,0.0001794695,0.0001034568,0.00006160844,0.000128268,0.0001821275,0.00004883606,0.000005823206],"category_scores_gemma":[0.0003138584,0.0001066638,0.00006317764,0.00009292577,0.0000227834,0.0001337838,0.000007164178,0.0002734087,0.000004294678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006755775,"about_ca_system_score_gemma":0.00006734515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000120161,"about_ca_topic_score_gemma":2.981238e-7,"domain_scores_codex":[0.9992645,0.00001209392,0.000307517,0.00007374046,0.0001857698,0.0001563715],"domain_scores_gemma":[0.9992371,0.00009938645,0.00009852424,0.0001335277,0.0002695628,0.0001619667],"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.0003765173,0.0008593394,0.003700813,0.0004586659,0.00009318646,0.0001402068,0.0005854812,0.8537713,0.003275455,0.001023772,0.03854442,0.09717088],"study_design_scores_gemma":[0.0005730625,0.0005485584,0.00005376279,0.0000487702,0.00003260321,0.00003164363,0.00002737394,0.9715254,0.0008434207,0.001260479,0.02490979,0.0001451077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01518153,0.0002560754,0.9830893,0.0001496865,0.0001631058,0.0001059036,0.00005099444,0.0002034934,0.000799922],"genre_scores_gemma":[0.9432695,0.00001159776,0.05634119,0.00005220308,0.0002134536,0.000005730024,0.00002096604,0.00004348117,0.00004190906],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9280879,"threshold_uncertainty_score":0.4349622,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610192,0.0001557665,0.0004415754,0.000323407,0.00006805631,0.00001849907,0.0000530359,0.0000937078,0.0000063539],"category_scores_gemma":[0.0003195188,0.0001420044,0.00009604445,0.0002779796,0.00006560102,0.00004294002,0.00002022417,0.0001902342,1.070576e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005110516,"about_ca_system_score_gemma":0.00001839165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005697679,"about_ca_topic_score_gemma":0.00001590544,"domain_scores_codex":[0.9985968,0.00003685693,0.000821894,0.0001111623,0.0002334643,0.000199781],"domain_scores_gemma":[0.9984431,0.0007063936,0.0003428006,0.0001091984,0.0002489144,0.0001495982],"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.0001063973,0.0001280247,0.03466332,0.0004226447,0.001692074,0.0004127359,0.001426453,0.9474624,0.003974919,0.00125807,0.0001802613,0.008272674],"study_design_scores_gemma":[0.001124755,0.0001773617,0.006291735,0.0001277094,0.001644873,0.0009888135,0.0002825519,0.9872128,0.0008770084,0.0002052855,0.0008302174,0.0002368931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.264402,0.0005124712,0.7347677,0.00001383839,0.0001266808,0.00009589623,0.00004063589,0.00001197051,0.0000287997],"genre_scores_gemma":[0.5717961,0.00005244047,0.428013,0.00001723652,0.00007583648,5.759657e-7,0.00000195564,0.00002775394,0.00001519366],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3073941,"threshold_uncertainty_score":0.579077,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003749699,0.0001154127,0.0002120259,0.0001444782,0.000141736,0.0001559734,0.0004246884,0.00003900327,0.001160047],"category_scores_gemma":[0.0005605752,0.00007507987,0.0001284173,0.0002936493,0.00002987973,0.0001580806,0.0000467976,0.000273382,0.0003337276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005327816,"about_ca_system_score_gemma":0.00002320927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.152276e-7,"about_ca_topic_score_gemma":0.000003484368,"domain_scores_codex":[0.9987465,0.00009350845,0.0004305403,0.0001416073,0.0004423074,0.0001455373],"domain_scores_gemma":[0.9988582,0.000133337,0.0002887556,0.0003129555,0.0002954568,0.0001112619],"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.00001457468,0.00007547607,0.00002178862,0.000002946595,0.0001078133,0.0000288326,0.0003788318,0.05702177,0.0000067834,0.01120519,0.8746198,0.05651622],"study_design_scores_gemma":[0.000203872,0.0002612226,0.0004850601,0.000004525522,0.0001335013,0.0002034967,0.00002478317,0.03263173,0.00004038195,0.0006712358,0.9652333,0.0001068861],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001063125,0.00008609252,0.9219292,0.06962191,0.004575119,0.0001035761,0.0000037396,0.00002231429,0.003551751],"genre_scores_gemma":[0.1816971,0.001505643,0.6255923,0.01171661,0.1652386,0.00001093439,0.000003868041,0.00006404774,0.01417096],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2963369,"threshold_uncertainty_score":0.999753,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974998,0.0001728237,0.0002629624,0.0002619785,0.0001577556,0.00008960368,0.0004566076,0.0001102108,0.000002419081],"category_scores_gemma":[0.0006714649,0.0001476242,0.00006101201,0.0005299842,0.00005816621,0.0007918073,0.00004293505,0.0002464311,9.935254e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002119688,"about_ca_system_score_gemma":0.000226289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004419075,"about_ca_topic_score_gemma":0.000007957188,"domain_scores_codex":[0.9984061,0.00005893443,0.0005767092,0.0002641707,0.0004288205,0.0002653298],"domain_scores_gemma":[0.9964947,0.000439422,0.0008317108,0.0002860712,0.001710892,0.0002371813],"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.0002187315,0.0003380774,0.0004403749,0.000006700921,0.00006199261,0.00002940673,0.0004316297,0.7215399,0.000083553,0.0007400905,0.00007741288,0.2760321],"study_design_scores_gemma":[0.002495434,0.001051291,0.0002432712,0.00001897985,0.00003658027,0.0001201462,0.0001704814,0.9929512,0.001501952,0.0005454759,0.0006682526,0.0001969341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002307246,0.000031733,0.9986488,0.00006086845,0.0004370451,0.0004836531,0.00001300813,0.0000461545,0.0000480208],"genre_scores_gemma":[0.03652412,0.00001447496,0.9628078,0.00008093905,0.0005035297,0.0000111819,0.00001207045,0.00002604344,0.00001985608],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2758352,"threshold_uncertainty_score":0.6019939,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089772,0.0001330883,0.0003841606,0.0001691485,0.00007251645,0.00002372427,0.0002140177,0.00006900636,0.0000235482],"category_scores_gemma":[0.0003153435,0.000102014,0.0002470946,0.0003849872,0.00004234387,0.0000841955,0.00002060197,0.000193392,8.000429e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006796009,"about_ca_system_score_gemma":0.00002428484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001185474,"about_ca_topic_score_gemma":4.225303e-7,"domain_scores_codex":[0.9986318,0.00005605024,0.0007521365,0.00005711116,0.000261845,0.0002410401],"domain_scores_gemma":[0.9984632,0.0006833628,0.0003453218,0.0001732468,0.00023541,0.00009942274],"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.00002760164,0.0001089229,0.005116494,0.0000832238,0.001207572,0.000001729526,0.001247709,0.9833485,0.005656252,0.0007054972,0.00107933,0.001417194],"study_design_scores_gemma":[0.0006137888,0.0001276274,0.005745048,0.00005156055,0.002652928,0.00003443367,0.0006153152,0.9652128,0.02159731,0.00008657298,0.003033639,0.0002290207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07220146,0.002396071,0.9243696,0.00003508831,0.0006110141,0.0001198589,0.00003007418,0.0000238009,0.0002129754],"genre_scores_gemma":[0.7421651,0.0001037682,0.257377,0.00001478586,0.0002843317,0.000002197457,0.000003088719,0.00002933544,0.00002030556],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6699637,"threshold_uncertainty_score":0.4160008,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002418152,0.0001338476,0.0003360465,0.0001227693,0.0000834839,0.00003291077,0.0001485179,0.00009345297,0.0002924599],"category_scores_gemma":[0.002267047,0.0001134746,0.0001068186,0.0001601668,0.00004204733,0.00005341572,0.00001822634,0.0003360713,0.0003359753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009050369,"about_ca_system_score_gemma":0.00004180957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.607741e-8,"about_ca_topic_score_gemma":9.717555e-8,"domain_scores_codex":[0.9986511,0.00002234484,0.0005917899,0.00006238834,0.0004634075,0.0002089961],"domain_scores_gemma":[0.9988241,0.0002823434,0.00008867641,0.0001264003,0.0004095898,0.0002689004],"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.00003105803,0.0001670535,0.000003169851,0.00004167002,0.00005528527,0.00009217998,0.000223711,0.01855038,0.0000397496,0.007199924,0.9725163,0.001079495],"study_design_scores_gemma":[0.000551201,0.0002727908,0.000009477002,0.00005769104,0.00007683613,0.0001725527,0.00003229545,0.005559932,0.0004266314,0.004853532,0.987811,0.000176077],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"editorial","genre_scores_codex":[0.001573736,0.00005160886,0.8914358,0.0007335934,0.07208193,0.0003229936,0.00007909635,0.0001640456,0.03355718],"genre_scores_gemma":[0.05757065,0.0002121129,0.2263952,0.0003187267,0.7143248,0.000007437022,0.000007838897,0.0001181092,0.001045085],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6650406,"threshold_uncertainty_score":0.4627361,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004117968,0.00008311823,0.00014628,0.00008948958,0.00004083667,0.00002173875,0.00009111746,0.00006659432,0.000005769335],"category_scores_gemma":[0.00007156933,0.0000807914,0.0000610485,0.0001540153,0.00001217911,0.0001614265,8.076161e-7,0.0001345549,0.000001060058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006141594,"about_ca_system_score_gemma":0.00002867149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001050519,"about_ca_topic_score_gemma":0.0000028019,"domain_scores_codex":[0.9992087,0.00002007666,0.0004276291,0.000055957,0.000146693,0.0001409125],"domain_scores_gemma":[0.9993405,0.0000460394,0.0001406679,0.00008242798,0.00031135,0.00007906801],"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.00002289786,0.00008544747,0.002723459,0.00007829239,0.00002109697,0.000006106328,0.00017043,0.9819909,0.00149879,0.00007475206,0.0002938921,0.01303389],"study_design_scores_gemma":[0.0005580002,0.0003829327,0.005866449,0.00004303734,0.00005444711,0.00003233009,0.00003681734,0.9874023,0.0003218825,0.0003872291,0.004812884,0.0001016864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1056659,0.0000577269,0.8935599,0.00002805375,0.0003373032,0.0002011805,0.000007155785,0.0000801396,0.00006268019],"genre_scores_gemma":[0.5434631,0.00005105535,0.4561628,0.000005848461,0.0002633427,0.000005428367,0.00001044246,0.00002432485,0.00001366128],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4377972,"threshold_uncertainty_score":0.3294578,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001485021,0.0001100613,0.0002017124,0.0002434425,0.000195206,0.0001116969,0.0004346906,0.00007838257,9.589005e-7],"category_scores_gemma":[0.0009864438,0.0001046683,0.0001025424,0.0002556691,0.00002762148,0.0001718051,0.00006875194,0.0003489518,0.000001770562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006181144,"about_ca_system_score_gemma":0.00009084618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.578122e-7,"about_ca_topic_score_gemma":3.134366e-7,"domain_scores_codex":[0.9987106,0.00004437373,0.000608213,0.0001299404,0.0002764181,0.000230458],"domain_scores_gemma":[0.9980878,0.0003406859,0.0006218555,0.0001530815,0.0006903458,0.0001062467],"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.0002096614,0.0003381054,0.006407056,0.000190325,0.0001449734,0.0001987277,0.001496052,0.7557334,0.001376416,0.04326883,0.00697712,0.1836593],"study_design_scores_gemma":[0.001447797,0.001167258,0.001188692,0.0001684481,0.0000517167,0.0008690812,0.0001057827,0.9470842,0.00667486,0.01193398,0.02891225,0.0003959453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02500255,0.0001318608,0.9734092,0.0001357433,0.0008492898,0.00006286433,5.128763e-7,0.000102246,0.0003056654],"genre_scores_gemma":[0.4618226,0.00004690279,0.537689,0.00005526132,0.0003231943,2.42871e-7,4.864334e-7,0.000008101041,0.00005421167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4368201,"threshold_uncertainty_score":0.4268248,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547946,0.00008340405,0.0001592727,0.0000859161,0.0002186522,0.00002883777,0.0002422794,0.00004566414,0.00004105114],"category_scores_gemma":[0.001907059,0.00005139566,0.00009196124,0.0002067126,0.00004752856,0.00003292742,0.00003506462,0.0002205297,0.00001219308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005190272,"about_ca_system_score_gemma":0.000033527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.174281e-7,"about_ca_topic_score_gemma":1.747981e-7,"domain_scores_codex":[0.9990671,0.0000566928,0.0004313585,0.00005390778,0.0002011274,0.0001898093],"domain_scores_gemma":[0.9982427,0.001119446,0.0001571,0.0001467777,0.0002786471,0.00005530383],"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.00002578373,0.00001530964,0.00009196034,0.00001174674,0.00004521615,7.732977e-7,0.0009679201,0.9704512,0.001175044,0.0005986149,0.026062,0.0005543985],"study_design_scores_gemma":[0.0001772921,0.000207839,0.0003993081,0.0001133829,0.00005578227,0.00002078198,0.000139245,0.99077,0.002684485,0.000221654,0.00512764,0.00008260639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1390915,0.00004176154,0.8588787,0.0009439143,0.0004867526,0.0001032329,0.000008847078,0.00001937487,0.0004258903],"genre_scores_gemma":[0.7360553,0.000005551517,0.2629213,0.0001530289,0.0007502628,0.00000207388,5.242366e-7,0.0000304409,0.00008159082],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5969638,"threshold_uncertainty_score":0.2283065,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002746039,0.0004128216,0.0008140492,0.0005581978,0.000358582,0.0007833523,0.002318992,0.0003940875,0.001497655],"category_scores_gemma":[0.01426082,0.0003964724,0.0003135362,0.00156836,0.001110115,0.0006903121,0.0005604713,0.001646815,0.001448041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000245792,"about_ca_system_score_gemma":0.001454285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002211752,"about_ca_topic_score_gemma":0.000001769105,"domain_scores_codex":[0.9940554,0.0007009617,0.001833504,0.0004551305,0.002001928,0.0009530076],"domain_scores_gemma":[0.989193,0.001863529,0.00132676,0.001047941,0.005686472,0.0008822773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002835632,0.002279669,0.00134951,0.0006305129,0.0008210951,0.005899269,0.005588914,0.004201246,0.00008625781,0.4789701,0.2699659,0.229924],"study_design_scores_gemma":[0.001006109,0.002569526,0.001138896,0.000934722,0.000265106,0.003309681,0.000119713,0.3386366,0.0006587267,0.05590141,0.5948083,0.0006511201],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008572863,0.009033521,0.9568239,0.007487422,0.02052635,0.0001669998,0.00003003467,0.00003494708,0.005039534],"genre_scores_gemma":[0.06298277,0.004103811,0.9061635,0.001003316,0.0102779,0.000001700498,0.000001561399,0.00008006355,0.01538538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4230687,"threshold_uncertainty_score":0.9998487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001623846,0.0001380108,0.000311624,0.0002819469,0.00008148266,0.00003673528,0.0003484906,0.0001511524,0.000005270826],"category_scores_gemma":[0.0006255705,0.0001354181,0.00009441133,0.0002632992,0.00007583256,0.00007181871,0.00003597817,0.0007023449,0.000004075353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003025864,"about_ca_system_score_gemma":0.00005381016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001418129,"about_ca_topic_score_gemma":0.0001749832,"domain_scores_codex":[0.9983388,0.00006047692,0.0008589535,0.00008168421,0.0002674754,0.0003925752],"domain_scores_gemma":[0.9985274,0.0005549791,0.0001445107,0.0002918798,0.0003324373,0.0001487994],"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.0002379015,0.000625347,0.03078588,0.0005456563,0.0001976598,0.0003197493,0.001800321,0.9135623,0.003088046,0.0006855452,0.01686546,0.03128616],"study_design_scores_gemma":[0.00137777,0.000153568,0.02033859,0.0002408318,0.00002648204,0.0002544405,0.0003807028,0.9547763,0.0007266354,0.00008327394,0.0213944,0.0002469751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1002604,0.0008477425,0.8977095,0.00003065285,0.0007779971,0.000182165,0.000008916743,0.00002993308,0.0001526575],"genre_scores_gemma":[0.9410177,0.0001770141,0.05836035,0.00001234236,0.0003555045,0.000004347364,0.000003568,0.00004124765,0.00002795181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8407573,"threshold_uncertainty_score":0.5522191,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003231864,0.00008231206,0.0001638377,0.00006676513,0.00009022212,0.00004329825,0.0001225852,0.00006007791,0.000006518856],"category_scores_gemma":[0.0001706111,0.00005954673,0.00005484955,0.0001820098,0.00005221238,0.00005757871,0.00001919923,0.0002739078,3.998967e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004171747,"about_ca_system_score_gemma":0.00003410907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002550093,"about_ca_topic_score_gemma":6.269354e-7,"domain_scores_codex":[0.9991264,0.00004092489,0.0003755963,0.00005616867,0.0001938882,0.0002070132],"domain_scores_gemma":[0.9985199,0.0009303932,0.00007648344,0.0001051006,0.000280271,0.00008784776],"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.0001033833,0.00004413332,0.01065997,0.0002818344,0.0002451445,0.0000192885,0.0003586347,0.9367483,0.000677362,0.01220507,0.002156432,0.0365005],"study_design_scores_gemma":[0.001308886,0.0002433833,0.01284636,0.00008499286,0.0002457529,0.0003627494,0.0004353564,0.9634558,0.002975488,0.005742514,0.01204155,0.0002571506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003686337,0.0007155778,0.994333,0.00009754847,0.0002474118,0.0001095908,0.000005836823,0.00002173844,0.0007829309],"genre_scores_gemma":[0.697496,0.0001297161,0.3021384,0.00002940029,0.0001653942,7.218917e-7,4.558474e-7,0.00002018871,0.00001975651],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6938096,"threshold_uncertainty_score":0.2428245,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002300656,0.0000891358,0.0001657547,0.000123253,0.00002703924,0.00001911363,0.0001309916,0.00005325688,0.0001455293],"category_scores_gemma":[0.00003573519,0.0000738661,0.00006810901,0.0001126761,0.00001949596,0.0001338955,0.000007191952,0.000162696,0.00002059503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002013001,"about_ca_system_score_gemma":0.000009261266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001264752,"about_ca_topic_score_gemma":3.449735e-7,"domain_scores_codex":[0.9992964,0.00003274413,0.0003971993,0.00003796555,0.000126387,0.0001092835],"domain_scores_gemma":[0.9995687,0.00003712804,0.0001383878,0.00008631074,0.0001034759,0.00006598271],"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.00008215507,0.0001076341,0.0009760787,0.000229229,0.0002064367,0.0001914411,0.002509594,0.9862054,0.0007298374,0.003226082,0.004416417,0.001119693],"study_design_scores_gemma":[0.0009215027,0.0006213832,0.0009089376,0.000308178,0.0003246494,0.001336745,0.001072379,0.9809002,0.004524799,0.004437011,0.004065006,0.0005791766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1046444,0.0008258576,0.8889489,0.000005712741,0.001301673,0.00004424374,0.00000222189,0.00004404769,0.004182936],"genre_scores_gemma":[0.9786498,0.00009313736,0.02101789,0.000007815994,0.0001676521,5.966272e-7,5.464592e-7,0.00001852917,0.00004401183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8740054,"threshold_uncertainty_score":0.3012172,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000472522,0.0002350367,0.0004012862,0.00017056,0.00006030148,0.00007088856,0.0002623918,0.0002008423,0.001705924],"category_scores_gemma":[0.0001869607,0.0002314403,0.0001707178,0.0002411009,0.00008555807,0.0002457874,0.00002783793,0.0005965101,0.000269819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101545,"about_ca_system_score_gemma":0.000126234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000247688,"about_ca_topic_score_gemma":0.000009695691,"domain_scores_codex":[0.9981701,0.00008220979,0.0009958878,0.0001020992,0.0002993722,0.0003503457],"domain_scores_gemma":[0.9986072,0.00008839949,0.0004575498,0.0002097694,0.0003860109,0.0002510527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001012603,0.00136512,0.008332464,0.004336425,0.001166672,0.0009343086,0.02092668,0.6950602,0.0005709575,0.05155579,0.1916123,0.02403782],"study_design_scores_gemma":[0.003946669,0.002640925,0.004418287,0.0048925,0.00144979,0.003251989,0.0006915361,0.2322501,0.002687862,0.03946624,0.702415,0.001889104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008815225,0.05193372,0.824473,0.002204588,0.02591799,0.000451506,0.00006768462,0.0001467358,0.08598952],"genre_scores_gemma":[0.5738665,0.01422098,0.3930388,0.0002762128,0.002073946,0.000002885187,0.000007158844,0.0002294398,0.0162841],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5650513,"threshold_uncertainty_score":0.9992067,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318995,0.00007330974,0.000150401,0.0001022588,0.0004649131,0.0001068047,0.00008444401,0.00005801155,0.000007396747],"category_scores_gemma":[0.0007555524,0.00006503808,0.00002918669,0.0003094985,0.00007712374,0.0001269245,0.000002999451,0.0001707092,0.000001451637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002601595,"about_ca_system_score_gemma":0.0001795748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005644577,"about_ca_topic_score_gemma":0.000005399633,"domain_scores_codex":[0.9990397,0.0001610334,0.0002936364,0.00008606369,0.0002066382,0.0002129128],"domain_scores_gemma":[0.9985514,0.0005671472,0.0003445589,0.00002988614,0.0003937923,0.0001131669],"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.0001009274,0.00002470743,0.001660287,0.00002827629,0.00002431845,0.00003503182,0.006920264,0.981661,0.00001010129,0.00193446,0.001531931,0.006068659],"study_design_scores_gemma":[0.002608404,0.002611334,0.006264153,0.001461932,0.000581893,0.00007608332,0.02581869,0.8925858,0.00001564349,0.02891599,0.03826167,0.0007984315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008268716,0.0001991354,0.9907678,0.0001826959,0.0002426941,0.0002234898,0.000004734142,0.00007710401,0.00003367703],"genre_scores_gemma":[0.8166921,0.0001235986,0.1823762,0.00002214675,0.000482997,0.000008632991,0.00002413501,0.00002283206,0.0002473839],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8084233,"threshold_uncertainty_score":0.3575782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}