{"meta":{"query_hash":"facb819bf4e4","filters":{"venue":"Journal of Heuristics"},"cohort_total":62,"direct_labels_cover":0,"predictions_cover":62,"exported":62,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/facb819bf4e4","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Heuristics"},"results":[{"id":"W1147399608","doi":"10.1007/s10732-015-9299-9","title":"Interactive planning system for forest road location","year":2015,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristic; Exploit; Process (computing); Human–computer interaction; Domain (mathematical analysis); Space (punctuation); User interface; Interface (matter); Function (biology); Artificial intelligence; Machine learning; Mathematics","score_opus":0.025859980014780546,"score_gpt":0.2811982982584409,"score_spread":0.2553383182436603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1147399608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10255228,0.00029521945,0.89405084,0.00003451244,0.0014757466,0.000070379196,0.000006221972,0.0000397945,0.0014750238],"genre_scores_gemma":[0.99496406,0.0000042652746,0.004735905,0.000011486445,0.00022599463,0.0000015457404,0.000004087905,0.0000144878295,0.000038159247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995033,0.000009148987,0.00026661824,0.000028165656,0.00011923299,0.00007349069],"domain_scores_gemma":[0.9992685,0.00005829917,0.00012020376,0.00005010681,0.00043038363,0.00007256087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020709044,0.000056363788,0.00011102415,0.00006850332,0.000017174792,0.000027504064,0.000067424946,0.000034733876,6.341965e-7],"category_scores_gemma":[0.00020901125,0.00005124198,0.000032394986,0.00005433533,0.000005916129,0.000103556486,0.0000048958814,0.000102628044,0.000005007356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007010368,0.000017939798,0.0013776247,0.00016873248,0.00006365094,0.00001787162,0.0009275252,0.9838433,0.00011518123,0.0014271237,0.009901006,0.0020699115],"study_design_scores_gemma":[0.0006421509,0.00012396148,0.0016076363,0.0001875074,0.000043598327,0.000118243806,0.0018000178,0.9908099,0.00014594139,0.00040680953,0.004026319,0.00008790906],"about_ca_topic_score_codex":9.3052347e-7,"about_ca_topic_score_gemma":0.0000020524742,"teacher_disagreement_score":0.89241177,"about_ca_system_score_codex":0.00017137558,"about_ca_system_score_gemma":0.000042381187,"threshold_uncertainty_score":0.20895873},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal; 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","score_opus":0.013596303410225358,"score_gpt":0.23877234716798337,"score_spread":0.22517604375775802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495972231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6410129,0.012883455,0.31310686,0.00020508726,0.0018441696,0.0011596908,0.00010462396,0.00012671336,0.029556472],"genre_scores_gemma":[0.9849179,0.00019312206,0.014186013,0.000021026386,0.00013815695,0.000005476236,0.0000028614018,0.000044533954,0.00049093174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984207,0.0000845591,0.00072791026,0.00011258518,0.00034992592,0.00030427834],"domain_scores_gemma":[0.99929476,0.00015686396,0.000085530395,0.00021879651,0.00012966261,0.00011438116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009166587,0.00014870492,0.00037118094,0.000369767,0.000039069244,0.000023269327,0.00017629248,0.000061685605,0.000035865312],"category_scores_gemma":[0.00019235669,0.00014073556,0.00016018524,0.0003039734,0.000019313216,0.00004849807,0.000014977377,0.00026919157,0.00001124889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016202519,0.00026990398,0.004274916,0.002603024,0.0012023528,0.0019919255,0.0021852094,0.89715225,0.00036379494,0.008385688,0.07595003,0.005458869],"study_design_scores_gemma":[0.0065658446,0.0006913514,0.006320441,0.0009566469,0.0009488515,0.0011490547,0.008894376,0.19977234,0.0006965099,0.0034360602,0.7692126,0.0013559136],"about_ca_topic_score_codex":0.000005698332,"about_ca_topic_score_gemma":0.000012961949,"teacher_disagreement_score":0.69737995,"about_ca_system_score_codex":0.00016978478,"about_ca_system_score_gemma":0.000023998766,"threshold_uncertainty_score":0.57390296},"labels":[],"label_agreement":null},{"id":"W1515177345","doi":"10.1023/a:1009621410177","title":"Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics","year":2000,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":178,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"European Commission","keywords":"Guided Local Search; Mathematical optimization; Tabu search; Local search (optimization); Constraint programming; Maxima and minima; Computer science; Hill climbing; Heuristics; Iterated local search; Benchmark (surveying); Local optimum; Beam search; Search algorithm; Algorithm; Mathematics","score_opus":0.023579582177976975,"score_gpt":0.26421585828604544,"score_spread":0.24063627610806845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515177345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4922488,0.0012170237,0.5050896,0.00003928661,0.00036578608,0.00014864831,0.000005683218,0.00012761369,0.000757554],"genre_scores_gemma":[0.61664975,0.00018097016,0.382922,0.0000156792,0.00017373751,4.272322e-7,5.1844637e-7,0.000038375256,0.00001853225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842715,0.00008993466,0.0007865925,0.00011099726,0.00026492358,0.00032042485],"domain_scores_gemma":[0.9990805,0.00021913469,0.00021880674,0.00012320167,0.00019987614,0.00015849902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015245,0.00018120756,0.00034797014,0.00011434889,0.00013172875,0.00014044209,0.00013030789,0.00009124875,0.000052025676],"category_scores_gemma":[0.0003216853,0.0001786945,0.000071695344,0.00020909695,0.00008563602,0.0001640764,0.000022857275,0.00042856412,0.000002170511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009850206,0.000037785252,0.0034607975,0.00016688509,0.0001178888,0.00008510362,0.0007677027,0.8669691,0.0034272051,0.00018429845,0.0000664462,0.12470692],"study_design_scores_gemma":[0.0004902911,0.00006868417,0.00043118923,0.00022814609,0.00015115541,0.0006687663,0.0001613983,0.9945974,0.00055471796,0.00022461251,0.0021826196,0.00024102579],"about_ca_topic_score_codex":0.0000031987565,"about_ca_topic_score_gemma":4.8046905e-7,"teacher_disagreement_score":0.12762827,"about_ca_system_score_codex":0.000081397426,"about_ca_system_score_gemma":0.000049007478,"threshold_uncertainty_score":0.72869503},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Manitoba; Université du Québec à Montréal","funders":"","keywords":"Mathematics","score_opus":0.028662797890831735,"score_gpt":0.2463276832061558,"score_spread":0.21766488531532407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526117045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010631247,0.00008609252,0.9219292,0.06962191,0.0045751194,0.00010357608,0.0000037396,0.000022314294,0.0035517511],"genre_scores_gemma":[0.18169709,0.0015056434,0.6255923,0.011716605,0.16523859,0.00001093439,0.000003868041,0.00006404774,0.014170956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987465,0.000093508446,0.00043054027,0.00014160726,0.00044230736,0.00014553731],"domain_scores_gemma":[0.9988582,0.00013333697,0.0002887556,0.00031295553,0.00029545682,0.000111261936],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037496994,0.000115412724,0.00021202592,0.00014447815,0.00014173605,0.00015597335,0.00042468842,0.000039003266,0.001160047],"category_scores_gemma":[0.0005605752,0.00007507987,0.00012841735,0.00029364927,0.00002987973,0.00015808055,0.0000467976,0.000273382,0.00033372757],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014574675,0.00007547607,0.000021788615,0.0000029465955,0.00010781329,0.0000288326,0.00037883176,0.057021767,0.0000067834,0.011205185,0.8746198,0.056516223],"study_design_scores_gemma":[0.00020387203,0.00026122257,0.0004850601,0.000004525522,0.00013350126,0.00020349667,0.00002478317,0.032631733,0.000040381947,0.00067123584,0.9652333,0.0001068861],"about_ca_topic_score_codex":9.152276e-7,"about_ca_topic_score_gemma":0.0000034843679,"teacher_disagreement_score":0.29633692,"about_ca_system_score_codex":0.00005327816,"about_ca_system_score_gemma":0.000023209272,"threshold_uncertainty_score":0.999753},"labels":[],"label_agreement":null},{"id":"W1547752062","doi":"10.1023/a:1009609820093","title":"An Evolution Program for Non-Linear Transportation Problems","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Initialization; Heuristic; Mathematical optimization; Computer science; Mating; Fitness function; Function (biology); Convergence (economics); Flow network; Integer (computer science); Genetic algorithm; Mathematics; Biology; Genetics","score_opus":0.019223679010467735,"score_gpt":0.30678315734194855,"score_spread":0.2875594783314808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547752062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10566591,0.0000577269,0.8935599,0.000028053752,0.00033730318,0.00020118055,0.0000071557847,0.0000801396,0.00006268019],"genre_scores_gemma":[0.54346305,0.000051055355,0.4561628,0.000005848461,0.00026334266,0.0000054283673,0.000010442456,0.00002432485,0.000013661283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.00002007666,0.00042762907,0.000055957,0.00014669301,0.00014091251],"domain_scores_gemma":[0.9993405,0.000046039397,0.00014066794,0.00008242798,0.00031134996,0.000079068006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041179676,0.00008311823,0.00014627996,0.00008948958,0.000040836672,0.000021738746,0.000091117465,0.000066594315,0.0000057693346],"category_scores_gemma":[0.00007156933,0.000080791404,0.0000610485,0.00015401533,0.000012179109,0.00016142646,8.0761606e-7,0.00013455494,0.000001060058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022897855,0.00008544747,0.0027234587,0.00007829239,0.000021096967,0.0000061063283,0.00017043004,0.98199093,0.0014987903,0.00007475206,0.00029389205,0.01303389],"study_design_scores_gemma":[0.00055800023,0.00038293266,0.0058664493,0.00004303734,0.000054447115,0.00003233009,0.00003681734,0.9874023,0.00032188246,0.00038722908,0.0048128837,0.00010168637],"about_ca_topic_score_codex":0.0000010505188,"about_ca_topic_score_gemma":0.0000028018999,"teacher_disagreement_score":0.43779716,"about_ca_system_score_codex":0.000061415936,"about_ca_system_score_gemma":0.000028671493,"threshold_uncertainty_score":0.3294578},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012108327788104863,"score_gpt":0.26485392777579,"score_spread":0.2527455999876851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573636743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013555021,0.00016283336,0.98433644,0.00020663303,0.000268087,0.0002333059,4.667609e-7,0.00008180803,0.0011554047],"genre_scores_gemma":[0.39100164,0.00008818911,0.608481,0.00006252327,0.00023485045,0.000008295722,0.000002307266,0.00003128789,0.000089936184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990651,0.000014123318,0.00044279592,0.00006750154,0.00022353714,0.00018696582],"domain_scores_gemma":[0.99941176,0.0000303106,0.00010370784,0.000099826706,0.00018760409,0.00016677087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024075074,0.000103062026,0.00017854926,0.00009029621,0.000041182648,0.000061592014,0.000113240865,0.000049988143,0.000028533997],"category_scores_gemma":[0.00010059911,0.00009172705,0.0000476735,0.0002434755,0.000011591432,0.00007201373,0.000011209147,0.00015521514,0.00003098596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054493386,0.00019102382,0.00023297037,0.00013966557,0.00007183717,0.00003467438,0.0003666089,0.84531015,0.0037727174,0.004505263,0.0015986979,0.14372192],"study_design_scores_gemma":[0.0014168569,0.00056668755,0.000067939385,0.00027794778,0.00018309403,0.00030584107,0.00035659134,0.7099045,0.0013224443,0.004310832,0.28073248,0.0005547636],"about_ca_topic_score_codex":6.080503e-7,"about_ca_topic_score_gemma":5.4744834e-7,"teacher_disagreement_score":0.37744662,"about_ca_system_score_codex":0.0000808967,"about_ca_system_score_gemma":0.000020049145,"threshold_uncertainty_score":0.37405205},"labels":[],"label_agreement":null},{"id":"W1588856286","doi":"10.1023/a:1013661617536","title":"Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":162,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Pruning; Mathematical optimization; Computer science; Reduction (mathematics); Descent (aeronautics); Constraint programming; Variable neighborhood search; Constraint (computer-aided design); Mathematics; Metaheuristic; Stochastic programming","score_opus":0.0272116258951607,"score_gpt":0.2542900346914363,"score_spread":0.2270784087962756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588856286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15360653,0.00010383758,0.8443575,0.00037050893,0.00017316341,0.00019558334,0.000006926968,0.00007387778,0.0011120499],"genre_scores_gemma":[0.5533728,0.0000031348245,0.4462563,0.00016141475,0.00014591716,7.3791426e-7,2.5350093e-7,0.00003925694,0.000020201524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881667,0.000070518814,0.00047752322,0.00008516777,0.0002937492,0.00025637192],"domain_scores_gemma":[0.99906516,0.00022176164,0.00016479331,0.00016047082,0.00025306767,0.00013477077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006885387,0.0001514473,0.00023655703,0.00009861797,0.00013457217,0.00010530355,0.00020572003,0.000054759912,0.00008809378],"category_scores_gemma":[0.00022280106,0.00010516148,0.000056305413,0.0003226629,0.000052181476,0.000089726265,0.000018309369,0.0003532529,0.000017152308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008523463,0.000019525964,0.0007235043,0.000015533762,0.000040277595,0.000034860812,0.0003184587,0.9930303,0.0036861016,0.000048762897,0.0005937984,0.0014803166],"study_design_scores_gemma":[0.0004937506,0.00011009379,0.00009621133,0.00014108725,0.000060539136,0.00015002346,0.00009209427,0.99559164,0.002456726,0.00001056581,0.00064271403,0.00015453935],"about_ca_topic_score_codex":0.0000015688379,"about_ca_topic_score_gemma":5.5702424e-7,"teacher_disagreement_score":0.39976624,"about_ca_system_score_codex":0.00010712271,"about_ca_system_score_gemma":0.00005099099,"threshold_uncertainty_score":0.42883608},"labels":[],"label_agreement":null},{"id":"W1783225223","doi":"10.1023/a:1013613701606","title":"Constraint Programming Based Column Generation for Crew Assignment","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Column generation; Constraint (computer-aided design); Shortest path problem; Domain (mathematical analysis); Limit (mathematics); Path (computing); Computer science; Space (punctuation); Mathematics; Theoretical computer science","score_opus":0.0538748117578501,"score_gpt":0.2743114601091357,"score_spread":0.22043664835128562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783225223","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036795086,0.0002697796,0.99499106,0.0001277808,0.0005240183,0.00014686714,0.0000071244535,0.000040887622,0.00021295373],"genre_scores_gemma":[0.38733426,0.00003101454,0.61221427,0.000043898046,0.0003169649,0.0000040500986,0.0000021819546,0.000020525144,0.000032847092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915045,0.000041071922,0.00042841746,0.00005545875,0.00017922159,0.00014540055],"domain_scores_gemma":[0.9993358,0.00015393346,0.00015227358,0.00007865123,0.00020086099,0.000078472025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511071,0.000084384745,0.00015803074,0.00007096895,0.000055193366,0.00006112627,0.000072270435,0.00005494164,0.00006721961],"category_scores_gemma":[0.0003647014,0.00008525193,0.00007106482,0.000078548095,0.000020405929,0.000050891416,0.000004055379,0.00012784122,0.0000019933925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004816007,0.00006148835,0.00019857919,0.00007165494,0.00004217449,0.000013283997,0.00009056876,0.92407393,0.003820978,0.00013138591,0.0126976445,0.05879348],"study_design_scores_gemma":[0.0005406823,0.00012275181,0.000028217928,0.00002999178,0.00004300257,0.000028353481,0.000019206836,0.97932476,0.0024195143,0.000018707477,0.017332792,0.000092028204],"about_ca_topic_score_codex":1.6719413e-7,"about_ca_topic_score_gemma":3.1543516e-7,"teacher_disagreement_score":0.38365474,"about_ca_system_score_codex":0.00010248866,"about_ca_system_score_gemma":0.000020024148,"threshold_uncertainty_score":0.34764728},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Intersection (aeronautics); Integer programming; Convexity; Heuristic; Integer (computer science); Mathematical optimization; Linear programming; Software; Computer science; Mathematics; Function (biology); Algorithm; Programming language","score_opus":0.05059042372315479,"score_gpt":0.4014260918634955,"score_spread":0.3508356681403407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965523840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006391054,0.00031464305,0.99228513,0.00017476834,0.00031654793,0.00032347877,0.000011690887,0.000022636126,0.00016007246],"genre_scores_gemma":[0.11033377,0.00013909992,0.8882363,0.00004871054,0.0004655911,0.000005820544,0.0000025689699,0.000057662062,0.0007104848],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823254,0.0000427229,0.0007711756,0.00013527206,0.00044815574,0.00037010433],"domain_scores_gemma":[0.99611735,0.0019859446,0.00050697965,0.00015333941,0.0010064103,0.00022997141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015325367,0.0001540312,0.00035119054,0.00024007958,0.00012804804,0.00006545747,0.00018772973,0.00008548622,0.000016180331],"category_scores_gemma":[0.0072534396,0.00012778577,0.00009778499,0.00019488948,0.000116332056,0.0001272249,0.00007407343,0.00035826,0.0000018719585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046171825,0.004732873,0.0073604076,0.0053262524,0.0016304132,0.002849807,0.008662695,0.002653894,0.0011991521,0.16281241,0.11059711,0.6875578],"study_design_scores_gemma":[0.016647479,0.005751271,0.0020376183,0.001457624,0.001168932,0.004603512,0.0071767103,0.09180707,0.005537021,0.5702987,0.29124513,0.0022689914],"about_ca_topic_score_codex":7.495773e-7,"about_ca_topic_score_gemma":0.0000057283464,"teacher_disagreement_score":0.6852888,"about_ca_system_score_codex":0.00008780206,"about_ca_system_score_gemma":0.00007844516,"threshold_uncertainty_score":0.8683569},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Critical path method; Scheduling (production processes); Compiler; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.01640675964308066,"score_gpt":0.27828064970157473,"score_spread":0.2618738900584941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966497181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025002554,0.00013186083,0.97340924,0.00013574329,0.0008492898,0.00006286433,5.1287634e-7,0.000102245984,0.00030566542],"genre_scores_gemma":[0.4618226,0.00004690279,0.537689,0.000055261324,0.0003231943,2.4287104e-7,4.864334e-7,0.000008101041,0.00005421167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987106,0.000044373734,0.00060821295,0.00012994041,0.0002764181,0.00023045798],"domain_scores_gemma":[0.99808776,0.0003406859,0.00062185555,0.00015308154,0.00069034577,0.0001062467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014850207,0.0001100613,0.00020171239,0.00024344245,0.00019520603,0.000111696914,0.00043469065,0.000078382574,9.589005e-7],"category_scores_gemma":[0.0009864438,0.00010466826,0.000102542355,0.0002556691,0.000027621478,0.00017180509,0.000068751935,0.00034895184,0.0000017705624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020966142,0.0003381054,0.006407056,0.00019032502,0.00014497338,0.0001987277,0.0014960516,0.75573343,0.0013764156,0.04326883,0.0069771204,0.18365929],"study_design_scores_gemma":[0.001447797,0.001167258,0.0011886919,0.00016844805,0.0000517167,0.0008690812,0.00010578272,0.9470842,0.00667486,0.01193398,0.028912254,0.00039594527],"about_ca_topic_score_codex":8.5781215e-7,"about_ca_topic_score_gemma":3.1343663e-7,"teacher_disagreement_score":0.43682006,"about_ca_system_score_codex":0.000061811435,"about_ca_system_score_gemma":0.00009084618,"threshold_uncertainty_score":0.42682478},"labels":[],"label_agreement":null},{"id":"W1972590396","doi":"10.1007/s10732-010-9150-2","title":"A tabu search algorithm for the covering design problem","year":2010,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Block (permutation group theory); Algorithm; Set (abstract data type); Exploit; Mathematics; Computer science; Mathematical optimization; Combinatorics; Order (exchange); Space (punctuation)","score_opus":0.02156927472276331,"score_gpt":0.24791430362817013,"score_spread":0.2263450289054068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972590396","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033985852,0.00016027517,0.9980146,0.000113596274,0.000902794,0.00014547637,0.0000072808202,0.000025291427,0.00029082742],"genre_scores_gemma":[0.10562535,0.0003276794,0.8930854,0.00005382709,0.00064361293,0.0000054544685,0.0000011978505,0.0000453422,0.00021213833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942315,0.000012200514,0.00023882862,0.000036920483,0.00014813144,0.00014079077],"domain_scores_gemma":[0.99928236,0.00031722826,0.00006199807,0.00008880292,0.00019341962,0.00005619322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005536678,0.000070760056,0.00010517587,0.000050497085,0.00007431919,0.00007131498,0.00015774807,0.00004788891,0.000028761106],"category_scores_gemma":[0.00007462422,0.000048997805,0.000052872587,0.000081621605,0.000021396376,0.00005868018,0.000010362652,0.0003574379,0.0000041196745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009082352,0.000019525314,0.000063226806,0.000051914656,0.000067153,0.0000070628043,0.000305501,0.9347387,0.0019304699,0.00035582602,0.009797076,0.052654486],"study_design_scores_gemma":[0.00034094768,0.00007016152,0.000053680113,0.00002256605,0.000029485502,0.0000928814,0.000025388437,0.953251,0.0014648648,0.00042179038,0.04414887,0.00007836076],"about_ca_topic_score_codex":8.976331e-7,"about_ca_topic_score_gemma":9.3365884e-7,"teacher_disagreement_score":0.10528549,"about_ca_system_score_codex":0.0000147438695,"about_ca_system_score_gemma":0.0000426251,"threshold_uncertainty_score":0.19980726},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Computer science; Genetic algorithm; Local search (optimization); Steiner tree problem; Tree (set theory); Topology (electrical circuits); Mathematics","score_opus":0.05579251369741658,"score_gpt":0.3186129254522689,"score_spread":0.2628204117548523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985976271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1002604,0.00084774254,0.89770955,0.000030652853,0.00077799713,0.00018216502,0.000008916743,0.00002993308,0.00015265746],"genre_scores_gemma":[0.9410177,0.00017701414,0.05836035,0.000012342357,0.00035550445,0.0000043473638,0.000003568,0.00004124765,0.000027951812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983388,0.000060476916,0.0008589535,0.000081684215,0.0002674754,0.0003925752],"domain_scores_gemma":[0.9985274,0.00055497914,0.00014451069,0.0002918798,0.00033243728,0.00014879937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016238462,0.00013801082,0.000311624,0.0002819469,0.000081482656,0.000036735284,0.00034849058,0.00015115239,0.0000052708265],"category_scores_gemma":[0.0006255705,0.00013541813,0.000094411334,0.00026329915,0.00007583256,0.00007181871,0.000035978166,0.0007023449,0.000004075353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023790146,0.000625347,0.030785875,0.00054565625,0.00019765984,0.00031974932,0.0018003207,0.9135623,0.0030880459,0.0006855452,0.016865456,0.03128616],"study_design_scores_gemma":[0.00137777,0.00015356802,0.020338593,0.00024083175,0.000026482036,0.0002544405,0.00038070278,0.95477635,0.0007266354,0.00008327394,0.021394398,0.00024697508],"about_ca_topic_score_codex":0.000014181291,"about_ca_topic_score_gemma":0.00017498316,"teacher_disagreement_score":0.84075725,"about_ca_system_score_codex":0.0003025864,"about_ca_system_score_gemma":0.000053810156,"threshold_uncertainty_score":0.5522191},"labels":[],"label_agreement":null},{"id":"W1995945236","doi":"10.1007/s10732-012-9194-6","title":"Experimental analysis of heuristics for the bottleneck traveling salesman problem","year":2012,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Heuristics; Bottleneck; Mathematical optimization; Heuristic; Computer science; Lin–Kernighan heuristic; Bottleneck traveling salesman problem; Graph; Mathematics; Algorithm; Theoretical computer science","score_opus":0.028921182188774822,"score_gpt":0.30402834232860165,"score_spread":0.27510716013982683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995945236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07220146,0.0023960713,0.92436963,0.000035088313,0.00061101414,0.00011985893,0.000030074178,0.000023800902,0.00021297544],"genre_scores_gemma":[0.74216515,0.00010376816,0.25737703,0.000014785865,0.00028433168,0.0000021974565,0.0000030887195,0.000029335439,0.000020305557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863183,0.000056050238,0.0007521365,0.000057111156,0.00026184498,0.00024104008],"domain_scores_gemma":[0.9984632,0.0006833628,0.00034532184,0.00017324682,0.00023541004,0.000099422745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010897716,0.00013308831,0.00038416064,0.00016914851,0.00007251645,0.000023724273,0.00021401771,0.00006900636,0.000023548202],"category_scores_gemma":[0.0003153435,0.00010201395,0.00024709463,0.00038498722,0.000042343865,0.000084195504,0.000020601969,0.00019339201,8.000429e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027601638,0.00010892294,0.005116494,0.0000832238,0.0012075723,0.0000017295256,0.001247709,0.9833485,0.0056562517,0.00070549716,0.0010793298,0.0014171939],"study_design_scores_gemma":[0.0006137888,0.00012762743,0.005745048,0.00005156055,0.0026529278,0.000034433666,0.00061531516,0.96521276,0.021597313,0.00008657298,0.0030336387,0.00022902066],"about_ca_topic_score_codex":0.0000011854742,"about_ca_topic_score_gemma":4.225303e-7,"teacher_disagreement_score":0.6699637,"about_ca_system_score_codex":0.000067960085,"about_ca_system_score_gemma":0.000024284844,"threshold_uncertainty_score":0.41600084},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Heuristics; Mathematical optimization; Solver; Benchmark (surveying); Computer science; Neighbourhood (mathematics); Network planning and design; Mathematics","score_opus":0.07108954159709518,"score_gpt":0.319917577250896,"score_spread":0.2488280356538008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999191784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043527493,0.000081815655,0.9941369,0.0002694776,0.00031882038,0.00070310273,0.000050142575,0.000034795255,0.000052155676],"genre_scores_gemma":[0.51178384,0.000040228595,0.48776844,0.000084208135,0.00022095503,0.000018979861,0.000013659276,0.000016530881,0.00005315966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985788,0.00016949972,0.00047527533,0.000119835604,0.0003281677,0.00032843728],"domain_scores_gemma":[0.9971685,0.0010345391,0.0005954448,0.0000942165,0.0009080735,0.00019924724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097379,0.00013725673,0.00027104598,0.00006334863,0.00042091726,0.00012243084,0.00020149039,0.000096103206,0.00007820428],"category_scores_gemma":[0.0006666422,0.00011177005,0.000060683542,0.00020756373,0.00030709722,0.0002112896,0.0000024811927,0.00020914312,0.0000100486395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012547991,0.0010038549,0.013709664,0.00008626616,0.00027227166,0.00017447765,0.008674177,0.8706491,0.00010146837,0.0032158745,0.09004757,0.01081048],"study_design_scores_gemma":[0.018905949,0.0032179486,0.02137486,0.0010417844,0.0008796504,0.00015178026,0.0035289552,0.9196232,0.00023363797,0.019034263,0.010577369,0.0014306343],"about_ca_topic_score_codex":0.00006277751,"about_ca_topic_score_gemma":0.00007471417,"teacher_disagreement_score":0.5074311,"about_ca_system_score_codex":0.00006085838,"about_ca_system_score_gemma":0.00037241707,"threshold_uncertainty_score":0.45578504},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01096519587868776,"score_gpt":0.23603429980556861,"score_spread":0.22506910392688084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009921115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016218591,0.000740486,0.98166454,0.000059184487,0.0008080794,0.000101755875,0.000021322168,0.00006297155,0.000323086],"genre_scores_gemma":[0.07025958,0.00010017638,0.92807287,0.000016079059,0.0013800856,0.0000027744059,0.00000706613,0.000050310326,0.000111046014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897677,0.000010127535,0.0005345034,0.000085648666,0.0001449279,0.00024804828],"domain_scores_gemma":[0.9993696,0.00013774242,0.00012340225,0.00009079418,0.000196317,0.00008210522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042491223,0.00012432152,0.00022724149,0.00015740252,0.00007680737,0.00009484766,0.00014785789,0.00008217819,0.000021499562],"category_scores_gemma":[0.00003845167,0.00012357449,0.00010608844,0.00007422542,0.000020566049,0.00011607196,0.000013670635,0.0002633188,0.000012192947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049374644,0.000021559872,0.000109626526,0.00004416067,0.000036295674,0.000010339997,0.00005203241,0.9859561,0.00015180487,0.00019980434,0.0009713896,0.012442],"study_design_scores_gemma":[0.0006131867,0.00006218084,0.000052151518,0.0000547373,0.000033248274,0.000078500394,0.00007723155,0.99565357,0.0013275482,0.00053489645,0.0013711189,0.00014162384],"about_ca_topic_score_codex":0.000006344606,"about_ca_topic_score_gemma":0.0000019953397,"teacher_disagreement_score":0.054040983,"about_ca_system_score_codex":0.0001328471,"about_ca_system_score_gemma":0.00008873424,"threshold_uncertainty_score":0.5039221},"labels":[],"label_agreement":null},{"id":"W2012738417","doi":"10.1007/s10732-007-9033-3","title":"Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deutsche Forschungsgemeinschaft","keywords":"Travelling salesman problem; Heuristics; Regret; Greedy algorithm; Mathematical optimization; Computer science; Mathematics; Combinatorics; Machine learning","score_opus":0.0272815811744743,"score_gpt":0.28991862336377305,"score_spread":0.26263704218929873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012738417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26440197,0.0005124712,0.73476774,0.000013838394,0.00012668084,0.000095896234,0.00004063589,0.000011970513,0.000028799695],"genre_scores_gemma":[0.57179606,0.00005244047,0.42801297,0.000017236516,0.000075836484,5.759657e-7,0.00000195564,0.00002775394,0.000015193662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859685,0.000036856927,0.000821894,0.00011116226,0.00023346432,0.00019978103],"domain_scores_gemma":[0.99844307,0.00070639356,0.0003428006,0.000109198445,0.00024891435,0.00014959824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101922,0.00015576652,0.0004415754,0.00032340703,0.00006805631,0.000018499075,0.000053035896,0.0000937078,0.0000063538996],"category_scores_gemma":[0.00031951885,0.00014200437,0.00009604445,0.0002779796,0.00006560102,0.000042940017,0.000020224174,0.00019023416,1.0705757e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010639727,0.00012802468,0.034663316,0.0004226447,0.0016920735,0.00041273594,0.0014264525,0.94746244,0.0039749187,0.0012580705,0.00018026133,0.008272674],"study_design_scores_gemma":[0.0011247554,0.00017736171,0.0062917355,0.00012770937,0.0016448726,0.0009888135,0.0002825519,0.9872128,0.0008770084,0.00020528548,0.0008302174,0.00023689309],"about_ca_topic_score_codex":0.000005697679,"about_ca_topic_score_gemma":0.000015905438,"teacher_disagreement_score":0.30739406,"about_ca_system_score_codex":0.000051105162,"about_ca_system_score_gemma":0.000018391653,"threshold_uncertainty_score":0.579077},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012329317977126508,"score_gpt":0.2686253448139557,"score_spread":0.2562960268368292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022253420","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001573736,0.000051608862,0.8914358,0.0007335934,0.07208193,0.0003229936,0.00007909635,0.00016404559,0.033557184],"genre_scores_gemma":[0.057570647,0.00021211291,0.2263952,0.00031872667,0.71432483,0.0000074370223,0.000007838897,0.000118109245,0.0010450851],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986511,0.000022344837,0.0005917899,0.00006238834,0.00046340752,0.00020899613],"domain_scores_gemma":[0.99882406,0.00028234336,0.00008867641,0.0001264003,0.00040958982,0.00026890036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024181517,0.00013384757,0.0003360465,0.00012276926,0.0000834839,0.00003291077,0.00014851792,0.00009345297,0.0002924599],"category_scores_gemma":[0.0022670468,0.00011347463,0.00010681855,0.00016016678,0.000042047333,0.000053415715,0.00001822634,0.0003360713,0.00033597532],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031058033,0.0001670535,0.0000031698512,0.00004167002,0.00005528527,0.00009217998,0.00022371099,0.018550383,0.000039749604,0.007199924,0.9725163,0.0010794947],"study_design_scores_gemma":[0.000551201,0.00027279076,0.000009477002,0.000057691042,0.00007683613,0.00017255274,0.000032295447,0.0055599324,0.00042663142,0.004853532,0.98781097,0.00017607701],"about_ca_topic_score_codex":9.6077414e-8,"about_ca_topic_score_gemma":9.717555e-8,"teacher_disagreement_score":0.6650406,"about_ca_system_score_codex":0.00009050369,"about_ca_system_score_gemma":0.00004180957,"threshold_uncertainty_score":0.4627361},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Compute Canada","keywords":"Computer science; Satisfiability; Algorithm; Integer programming","score_opus":0.08233675307823943,"score_gpt":0.3237777667160881,"score_spread":0.24144101363784867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029320154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007254543,0.000116644034,0.9902336,0.0011548724,0.00027683703,0.00002102387,0.000004893236,0.000020086418,0.00091750635],"genre_scores_gemma":[0.7697024,0.000021757129,0.22984412,0.000040223058,0.00032553996,2.1279085e-7,0.000010392967,0.000002910328,0.000052472566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894834,0.00011546877,0.00038755973,0.00009242033,0.00036428357,0.00009191238],"domain_scores_gemma":[0.99865764,0.0001612358,0.00048552177,0.00019541853,0.00040977157,0.0000904344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904272,0.00006699231,0.00016257906,0.00009338115,0.00008539103,0.00018110106,0.00036648088,0.000036532456,0.000003750974],"category_scores_gemma":[0.00045080425,0.000052839692,0.00004186761,0.00024625368,0.000023749224,0.0005489103,0.000033692297,0.00019464213,0.000012392758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016536089,0.0002866023,0.13988344,0.00003179324,0.00028878512,0.0000805415,0.009856646,0.003548621,0.00043903053,0.0794975,0.021234939,0.74483556],"study_design_scores_gemma":[0.00095700653,0.0005387223,0.26917848,0.00007646184,0.00018342536,0.00014459559,0.00046114108,0.6300559,0.00028177924,0.056090593,0.041675787,0.0003561105],"about_ca_topic_score_codex":0.000016371569,"about_ca_topic_score_gemma":0.0000012840356,"teacher_disagreement_score":0.76244783,"about_ca_system_score_codex":0.000035535162,"about_ca_system_score_gemma":0.00012580627,"threshold_uncertainty_score":0.21547401},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.04580082402390537,"score_gpt":0.21986558980538526,"score_spread":0.1740647657814799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032499563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008815225,0.051933724,0.824473,0.0022045884,0.025917986,0.00045150603,0.000067684625,0.00014673577,0.08598952],"genre_scores_gemma":[0.5738665,0.014220984,0.39303878,0.00027621284,0.0020739462,0.000002885187,0.000007158844,0.00022943977,0.016284103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981701,0.000082209786,0.0009958878,0.00010209918,0.0002993722,0.00035034574],"domain_scores_gemma":[0.9986072,0.000088399494,0.00045754976,0.0002097694,0.0003860109,0.00025105267],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000472522,0.0002350367,0.00040128618,0.00017056,0.00006030148,0.000070888564,0.0002623918,0.0002008423,0.0017059236],"category_scores_gemma":[0.00018696068,0.00023144032,0.00017071785,0.00024110086,0.00008555807,0.00024578744,0.000027837934,0.0005965101,0.000269819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010126031,0.0013651196,0.008332464,0.0043364246,0.0011666716,0.00093430857,0.020926682,0.6950602,0.00057095755,0.05155579,0.19161232,0.024037821],"study_design_scores_gemma":[0.0039466694,0.0026409246,0.004418287,0.0048924997,0.0014497901,0.003251989,0.0006915361,0.23225006,0.002687862,0.039466236,0.70241505,0.0018891044],"about_ca_topic_score_codex":0.000024768802,"about_ca_topic_score_gemma":0.000009695691,"teacher_disagreement_score":0.56505126,"about_ca_system_score_codex":0.00011015455,"about_ca_system_score_gemma":0.000126234,"threshold_uncertainty_score":0.99920666},"labels":[],"label_agreement":null},{"id":"W2033740771","doi":"10.1007/s10732-010-9132-4","title":"Special issue on recent advances in metaheuristics","year":2010,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Metaheuristic; Computer science; Artificial intelligence","score_opus":0.008997029815665738,"score_gpt":0.2597852151168496,"score_spread":0.25078818530118385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033740771","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0296855,0.0035821781,0.23662725,0.0018652149,0.06372537,0.00082484557,0.000036201644,0.0003605619,0.6632929],"genre_scores_gemma":[0.39485008,0.029148124,0.513834,0.000606561,0.060351767,0.000006982278,0.0000087731705,0.00023859419,0.00095509103],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992035,0.0000114796685,0.0004156988,0.000044738637,0.00019297768,0.00013161791],"domain_scores_gemma":[0.9995219,0.000121508754,0.000087432,0.00008515083,0.00009963707,0.00008434732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002170767,0.00008830032,0.0001941529,0.000114550174,0.000016886841,0.000027991064,0.000109070745,0.000055020053,0.0004024022],"category_scores_gemma":[0.0006617299,0.00007430365,0.000039191236,0.00012696366,0.000024194538,0.00008359686,0.00000844046,0.00047371097,0.000035380483],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007754731,0.0005875668,0.00031547583,0.00031542094,0.000056380275,0.000406613,0.0005195449,0.14121194,0.00033578137,0.021746852,0.076814204,0.7576127],"study_design_scores_gemma":[0.00027640822,0.00007106554,0.000049266713,0.000029094635,0.000015746908,0.000028415476,0.000027807355,0.0099314,0.00031427894,0.0024815274,0.98668844,0.000086566695],"about_ca_topic_score_codex":4.770553e-8,"about_ca_topic_score_gemma":0.0000034674597,"teacher_disagreement_score":0.9098742,"about_ca_system_score_codex":0.00002351111,"about_ca_system_score_gemma":0.000014038733,"threshold_uncertainty_score":0.44060218},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"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","score_opus":0.044570846327856406,"score_gpt":0.24070014883157373,"score_spread":0.19612930250371732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042361754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071601477,0.00012974403,0.9970805,0.000006490022,0.0005824386,0.00012165753,0.000010008801,0.000046489633,0.0013066554],"genre_scores_gemma":[0.6435668,0.00007053276,0.35606074,0.000010680159,0.0002460344,0.000004257019,0.0000015420775,0.00002316163,0.00001624124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939746,0.000018938536,0.0002931944,0.00005347369,0.00009132799,0.00014562496],"domain_scores_gemma":[0.9994816,0.00011362244,0.00012904247,0.00006934896,0.0001518823,0.000054463242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001498003,0.00010837199,0.00017226055,0.00008966443,0.000052379917,0.000024308514,0.000107518536,0.000060078408,0.0000061554165],"category_scores_gemma":[0.000060935083,0.0000967613,0.000055234035,0.00003465767,0.000035090692,0.00013955166,0.00000764484,0.00017266389,0.0000011627275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014123862,0.00007049715,0.000048854923,0.00011443093,0.00008654891,0.000025138716,0.001274766,0.98687077,0.00015538304,0.0027044658,0.0055977814,0.0029101553],"study_design_scores_gemma":[0.0054322686,0.004771135,0.0065129306,0.00050315086,0.00084196083,0.00040807173,0.0034840326,0.2310654,0.034275677,0.69311523,0.017722009,0.0018681302],"about_ca_topic_score_codex":0.0000031683587,"about_ca_topic_score_gemma":0.0000028529175,"teacher_disagreement_score":0.7558053,"about_ca_system_score_codex":0.000052761312,"about_ca_system_score_gemma":0.000049754923,"threshold_uncertainty_score":0.39458114},"labels":[],"label_agreement":null},{"id":"W2046744595","doi":"10.1007/s10732-013-9229-7","title":"Less-Than-Truckload carrier collaboration problem: modeling framework and solution approach","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Vehicle routing problem; Local search (optimization); Transshipment (information security); Integer programming; Heuristic; Routing (electronic design automation); Mathematical optimization; Truck; Integer (computer science); Operations research; Mathematics; Computer network; Engineering; Artificial intelligence; Algorithm; Computer security","score_opus":0.01924323567560286,"score_gpt":0.2557735676930304,"score_spread":0.23653033201742754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046744595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15981942,0.0005008538,0.8388294,0.000087223336,0.00026065673,0.00010850528,0.00000338199,0.000040868905,0.00034970726],"genre_scores_gemma":[0.527042,0.00013698869,0.472614,0.00001235187,0.00015580253,0.0000023208604,0.0000013629392,0.000019530973,0.000015697658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990059,0.00006719059,0.0004657171,0.000081379585,0.00021765986,0.00016211715],"domain_scores_gemma":[0.9991136,0.00007447035,0.00014911358,0.0001040125,0.00045551083,0.00010328402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041819274,0.00011638338,0.00020364042,0.00011112207,0.000077080265,0.00012826371,0.00008505581,0.00013937058,0.0000073656547],"category_scores_gemma":[0.0002876456,0.00011100177,0.000031354735,0.00021643743,0.000022503285,0.00028261528,0.000018545637,0.00034488007,0.0000016860483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000445745,0.000012804745,0.0007239643,0.00007981629,0.000027769247,0.0000014625643,0.0005194802,0.9936055,0.0007417782,0.0004651308,0.00047766248,0.003340186],"study_design_scores_gemma":[0.00018237911,0.000029948784,0.00017907529,0.000066033186,0.000035881458,0.000046133777,0.0004009747,0.9956913,0.00012918698,0.0030424932,0.00007944375,0.00011715675],"about_ca_topic_score_codex":0.000006207043,"about_ca_topic_score_gemma":6.230964e-7,"teacher_disagreement_score":0.36722252,"about_ca_system_score_codex":0.000073001625,"about_ca_system_score_gemma":0.000041419706,"threshold_uncertainty_score":0.45265207},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011127156781275642,"score_gpt":0.18824854385799494,"score_spread":0.1771213870767193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050672239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104644425,0.0008258576,0.88894886,0.000005712741,0.0013016731,0.000044243745,0.0000022218899,0.000044047694,0.0041829357],"genre_scores_gemma":[0.9786498,0.00009313736,0.021017892,0.000007815994,0.00016765209,5.9662716e-7,5.464592e-7,0.000018529166,0.000044011827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.000032744127,0.0003971993,0.000037965554,0.000126387,0.0001092835],"domain_scores_gemma":[0.9995687,0.000037128044,0.00013838784,0.00008631074,0.00010347585,0.000065982706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023006556,0.0000891358,0.00016575473,0.000123253,0.000027039245,0.000019113631,0.00013099155,0.000053256877,0.0001455293],"category_scores_gemma":[0.000035735186,0.000073866104,0.00006810901,0.00011267608,0.000019495958,0.00013389546,0.000007191952,0.00016269596,0.000020595027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008215507,0.00010763407,0.0009760787,0.00022922902,0.00020643674,0.0001914411,0.0025095937,0.9862054,0.0007298374,0.003226082,0.004416417,0.0011196929],"study_design_scores_gemma":[0.00092150265,0.0006213832,0.0009089376,0.00030817802,0.00032464936,0.0013367452,0.0010723791,0.9809002,0.004524799,0.0044370107,0.004065006,0.0005791766],"about_ca_topic_score_codex":0.0000012647521,"about_ca_topic_score_gemma":3.4497347e-7,"teacher_disagreement_score":0.8740054,"about_ca_system_score_codex":0.000020130012,"about_ca_system_score_gemma":0.000009261266,"threshold_uncertainty_score":0.30121723},"labels":[],"label_agreement":null},{"id":"W2050999462","doi":"10.1007/s10732-014-9244-3","title":"A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows","year":2014,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université de Montréal; Transport Canada","funders":"Université de Montréal","keywords":"Crossover; Vehicle routing problem; Mathematical optimization; Population; Heuristics; Computer science; Local search (optimization); Genetic algorithm; Heuristic; Metaheuristic; Routing (electronic design automation); Algorithm; Mathematics; Artificial intelligence","score_opus":0.0087929748759454,"score_gpt":0.22447127078058876,"score_spread":0.21567829590464335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050999462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012052948,0.0002823558,0.9869998,0.00014751997,0.00018558228,0.00016603724,0.00001101508,0.000039533104,0.000115200244],"genre_scores_gemma":[0.12910926,0.000029157396,0.8697643,0.00008078374,0.0008675567,0.0000069648972,0.0000029397274,0.000049577327,0.000089438436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998929,0.00007254755,0.00043940006,0.00008431046,0.00027092732,0.00020379202],"domain_scores_gemma":[0.9988432,0.00044259324,0.00019770309,0.0001355939,0.00030702486,0.00007390576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007897754,0.00013078778,0.0002031574,0.00005696172,0.00017636393,0.000103188766,0.00018522027,0.00003561764,0.00002052719],"category_scores_gemma":[0.00015793623,0.000090223475,0.00006972111,0.000087088454,0.00003973012,0.00006871133,0.000015376574,0.00021335662,0.0000056284925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008889097,0.000013567236,0.00020736294,0.000018173198,0.00006558594,0.0000049946207,0.00009307862,0.9253827,0.0005877521,0.00005727001,0.0011186226,0.072442055],"study_design_scores_gemma":[0.00065772375,0.00015468865,0.0005575954,0.00003297683,0.000085333435,0.0002438549,0.00001101139,0.99234563,0.0007218332,0.00014868028,0.004920268,0.00012039617],"about_ca_topic_score_codex":6.710193e-7,"about_ca_topic_score_gemma":2.3269412e-7,"teacher_disagreement_score":0.1172355,"about_ca_system_score_codex":0.000053062657,"about_ca_system_score_gemma":0.000065709,"threshold_uncertainty_score":0.36792064},"labels":[],"label_agreement":null},{"id":"W2059760003","doi":"10.1007/s10732-014-9273-y","title":"Time-window relaxations in vehicle routing heuristics","year":2014,"lang":"fr","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Iterated local search; Vehicle routing problem; Heuristics; Computer science; Mathematical optimization; Relaxation (psychology); Scalability; Heuristic; Local search (optimization); Metaheuristic; Routing (electronic design automation); Algorithm; Mathematics","score_opus":0.012152139364092714,"score_gpt":0.25583713383890005,"score_spread":0.24368499447480735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059760003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10035925,0.0028074402,0.8829877,0.0027926944,0.00479047,0.00018235327,0.00003400944,0.000087202905,0.0059588784],"genre_scores_gemma":[0.5426098,0.0005331232,0.45266533,0.0001298107,0.0018358656,0.0000011939649,0.0000056501844,0.00013683063,0.0020823888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962577,0.00069159904,0.0017661322,0.00019271552,0.00050875143,0.0005830919],"domain_scores_gemma":[0.99622434,0.0017311005,0.00087592687,0.00034289545,0.00054994115,0.0002757693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032843973,0.00031581026,0.00067593635,0.00039237447,0.000129792,0.000119992335,0.00038053305,0.00033665198,0.00018638393],"category_scores_gemma":[0.008083252,0.00036701493,0.00018715073,0.0006935166,0.00013280149,0.00026855353,0.00007847216,0.0013580906,0.00017484005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019867739,0.00016459741,0.011975569,0.00017524652,0.000072341034,0.00010897488,0.00087961514,0.96243,0.00073110097,0.0040366524,0.0041513504,0.015254705],"study_design_scores_gemma":[0.0012630895,0.00019404107,0.012112098,0.0007126402,0.00018007739,0.00022546212,0.00011354903,0.9649797,0.00038852377,0.0020576527,0.017390957,0.00038218644],"about_ca_topic_score_codex":0.000021465385,"about_ca_topic_score_gemma":0.000006334123,"teacher_disagreement_score":0.44225058,"about_ca_system_score_codex":0.00046994674,"about_ca_system_score_gemma":0.00017511446,"threshold_uncertainty_score":0.99987817},"labels":[],"label_agreement":null},{"id":"W2059958986","doi":"10.1007/s10732-008-9097-8","title":"Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions","year":2008,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Arc (geometry); Heuristics; Ant colony optimization algorithms; Mathematical optimization; Routing (electronic design automation); Computer science; Mathematics; Computer network","score_opus":0.03496000000940143,"score_gpt":0.24365280378072676,"score_spread":0.20869280377132532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059958986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10478375,0.0001366018,0.8944769,0.00016127696,0.00017546781,0.00013325541,0.000016072718,0.000035375477,0.00008133093],"genre_scores_gemma":[0.6611332,0.0005770866,0.3380717,0.000020930036,0.000118130156,0.000003950624,0.0000011676692,0.000019466232,0.00005434125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926907,0.00004632607,0.000336543,0.00006143977,0.00014542119,0.00014120871],"domain_scores_gemma":[0.99888706,0.0005626824,0.00016290686,0.00008229691,0.00025233353,0.000052721316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003680857,0.00009766041,0.00015621442,0.00007525193,0.00022661647,0.000037015063,0.00007987563,0.000045210552,0.0000040404425],"category_scores_gemma":[0.00030745214,0.00006719565,0.00003139049,0.0001231963,0.00009741666,0.00011184537,0.000013052747,0.00022699364,1.638133e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019720414,0.000010520459,0.0013653347,0.000037860813,0.000052852924,0.000003352631,0.0008161145,0.99673945,0.000025863807,0.00016031794,0.00043721995,0.00033141268],"study_design_scores_gemma":[0.00051774975,0.00015472114,0.0028323203,0.000054419754,0.000066830005,0.0003096752,0.0004979327,0.9944806,0.00010077497,0.00012883115,0.0007546844,0.00010147041],"about_ca_topic_score_codex":0.000005603952,"about_ca_topic_score_gemma":0.0000042073325,"teacher_disagreement_score":0.5564052,"about_ca_system_score_codex":0.00006864885,"about_ca_system_score_gemma":0.000048429778,"threshold_uncertainty_score":0.2740159},"labels":[],"label_agreement":null},{"id":"W2066066208","doi":"10.1007/s10732-013-9221-2","title":"A path relinking algorithm for a multi-depot periodic vehicle routing problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Benchmark (surveying); Vehicle routing problem; Mathematical optimization; Path (computing); Computer science; Homogeneous; Algorithm; Routing (electronic design automation); Mathematics","score_opus":0.02416431381556332,"score_gpt":0.2740220169103621,"score_spread":0.24985770309479877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066066208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022369584,0.00033996935,0.97632575,0.00006603748,0.00044774692,0.00024979757,0.0000071190466,0.00010413991,0.000089831585],"genre_scores_gemma":[0.15603466,0.000061567385,0.8433801,0.00004555031,0.0003479332,0.000009863676,0.0000016735643,0.00006388684,0.00005475993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985162,0.0000602786,0.0007678647,0.0001057054,0.00023229381,0.00031762943],"domain_scores_gemma":[0.998727,0.00020982085,0.0003018808,0.00013405064,0.00049491035,0.00013231834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007795549,0.00016367165,0.00030785232,0.00011702681,0.00012351578,0.00013651377,0.00019326208,0.00010487578,0.00002126047],"category_scores_gemma":[0.00045483655,0.0001533477,0.00012973747,0.0001611255,0.000023837953,0.00019016227,0.00002932328,0.0003677566,0.000010682108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017683356,0.00022956105,0.004856831,0.0006165637,0.00029248346,0.00008043641,0.003324204,0.4620448,0.012475832,0.00020825252,0.005658797,0.51019454],"study_design_scores_gemma":[0.0008591382,0.00009585451,0.00063641596,0.00016047135,0.000045055705,0.000091010785,0.00014280932,0.9962287,0.00056149194,0.00021233744,0.00079260656,0.0001741016],"about_ca_topic_score_codex":0.0000052002288,"about_ca_topic_score_gemma":4.1533855e-7,"teacher_disagreement_score":0.5341839,"about_ca_system_score_codex":0.000104688006,"about_ca_system_score_gemma":0.000053510463,"threshold_uncertainty_score":0.6253338},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Renting; Computer science; Competitor analysis; Tabu search; Operations research; Stockout; Mathematical optimization; Mathematics; Algorithm; Business; Engineering; Marketing","score_opus":0.026075918571525993,"score_gpt":0.24515749066151185,"score_spread":0.21908157208998585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067834808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052862796,0.00010551521,0.9601637,0.0017351832,0.0007027185,0.0008153666,0.0000073696538,0.000048485726,0.031135356],"genre_scores_gemma":[0.6065382,0.00014988593,0.38478714,0.0035466657,0.0020552953,0.000048747435,0.00001634118,0.00007190978,0.0027858084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863285,0.000014147575,0.0004882963,0.00016803884,0.00038290792,0.00031376228],"domain_scores_gemma":[0.998508,0.000044051594,0.0008123378,0.00015522953,0.00045418527,0.000026220674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006932603,0.00017633142,0.00028788322,0.00028106847,0.0001933259,0.000077346784,0.0002453914,0.00003894595,0.00006300358],"category_scores_gemma":[0.00007597077,0.00013471709,0.00012705427,0.00022654005,0.00011584612,0.0003683235,0.00007310984,0.0001335164,0.00001778355],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013502705,0.0008575342,0.0067330007,0.0024139108,0.0010325258,0.0017742558,0.0003649188,0.0030480456,0.00025358453,0.2148798,0.7328205,0.034471627],"study_design_scores_gemma":[0.005691682,0.00032291454,0.0028515202,0.0005085035,0.000632829,0.00043907127,0.0010857802,0.02261832,0.000059250375,0.011524147,0.9537087,0.0005572736],"about_ca_topic_score_codex":0.000013453512,"about_ca_topic_score_gemma":0.000006504715,"teacher_disagreement_score":0.6012519,"about_ca_system_score_codex":0.00007914363,"about_ca_system_score_gemma":0.000032494292,"threshold_uncertainty_score":0.5493604},"labels":[],"label_agreement":null},{"id":"W2069090104","doi":"10.1007/s10732-014-9262-1","title":"Efficient heuristics for the workover rig routing problem with a heterogeneous fleet and a finite horizon","year":2014,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Workover; Heuristics; Heuristic; Mathematical optimization; Vehicle routing problem; Time horizon; Genetic algorithm; Routing (electronic design automation); Computer science; Variable neighborhood search; Deck; Marine engineering; Operations research; Engineering; Metaheuristic; Mathematics; Petroleum engineering; Computer network; Structural engineering","score_opus":0.010517163735105747,"score_gpt":0.23276165718691072,"score_spread":0.22224449345180497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069090104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039387763,0.00036149548,0.95947325,0.000093212104,0.00030416605,0.00018199418,0.000009053423,0.000042262887,0.00014677907],"genre_scores_gemma":[0.7212005,0.000051960527,0.27833134,0.0000368053,0.00030872575,0.0000031988827,6.9590243e-7,0.000045786383,0.000020938114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988599,0.00007184009,0.00046815054,0.00010333032,0.00024436475,0.00025242052],"domain_scores_gemma":[0.997764,0.001465125,0.00025686962,0.00016839837,0.00024745456,0.000098186094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000997803,0.00016813476,0.00026581893,0.00007178447,0.00014592115,0.00010043285,0.00015479988,0.00006724188,0.000002935824],"category_scores_gemma":[0.0007391563,0.00011126581,0.00006162788,0.00014390612,0.00005150622,0.000022238826,0.000029180112,0.0002831477,8.3586235e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004739274,0.00001834914,0.00036367003,0.00007420876,0.00006992709,0.000007871973,0.00018858549,0.9907059,0.00005274849,0.00023743899,0.00022504388,0.008008867],"study_design_scores_gemma":[0.0006892518,0.00038490014,0.00015937116,0.00012949035,0.00014949401,0.00018525403,0.000032743694,0.99411803,0.0001681436,0.00017095826,0.003662591,0.0001497734],"about_ca_topic_score_codex":7.906258e-7,"about_ca_topic_score_gemma":0.0000012513657,"teacher_disagreement_score":0.68181276,"about_ca_system_score_codex":0.00004702495,"about_ca_system_score_gemma":0.000026475936,"threshold_uncertainty_score":0.4537288},"labels":[],"label_agreement":null},{"id":"W2069850304","doi":"10.1007/s10732-005-5431-6","title":"Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows","year":2004,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Evolutionary algorithm; Set (abstract data type); Computer science; Interval (graph theory); Point (geometry); Mathematical optimization; Routing (electronic design automation); Genetic algorithm; Algorithm; Mathematics; Combinatorics","score_opus":0.014545897641903893,"score_gpt":0.25012543441681245,"score_spread":0.23557953677490856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069850304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061269496,0.00043413276,0.9922119,0.00045011286,0.00021381892,0.00019740307,0.000009604633,0.000064045686,0.00029205228],"genre_scores_gemma":[0.23234792,0.000041442516,0.76694995,0.000050238483,0.00047128717,0.000004615996,0.0000016729313,0.000048940223,0.00008394536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907863,0.000027665317,0.00038739693,0.00006658102,0.00023720515,0.00020254805],"domain_scores_gemma":[0.9990209,0.00033598914,0.00017463532,0.00012207635,0.00028259598,0.0000638575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006042543,0.000113801034,0.00017579689,0.000056170444,0.0001393996,0.00004020792,0.00018234512,0.000051648938,0.000008747935],"category_scores_gemma":[0.00017706562,0.00007631243,0.000068452144,0.00017170593,0.000038589817,0.000110786554,0.000015509138,0.00025446943,0.0000056900303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022632696,0.000020988204,0.00020323067,0.000022775002,0.00007060078,0.0000105774725,0.00015855454,0.9953305,0.0003779161,0.00024371709,0.00069890195,0.0028395858],"study_design_scores_gemma":[0.0015422617,0.00024749426,0.001266884,0.00013465458,0.00012610083,0.00033737812,0.00008523654,0.9908339,0.000797107,0.0012068074,0.0032462734,0.00017591527],"about_ca_topic_score_codex":0.0000015470981,"about_ca_topic_score_gemma":3.5477333e-7,"teacher_disagreement_score":0.22622097,"about_ca_system_score_codex":0.0001340508,"about_ca_system_score_gemma":0.00009080511,"threshold_uncertainty_score":0.31119305},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028701437529020143,"score_gpt":0.3008019868948117,"score_spread":0.27210054936579153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074524916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005885343,0.00014114783,0.98836106,0.0043391655,0.00026279697,0.0004362591,0.0000018885797,0.000017518883,0.0005547899],"genre_scores_gemma":[0.90378046,0.000037639165,0.09480002,0.0007337051,0.00018842141,0.000028093482,2.850902e-7,0.00001787185,0.00041349765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979837,0.00018703968,0.00039337736,0.00016175481,0.0008468653,0.00042725974],"domain_scores_gemma":[0.99799085,0.00044171588,0.00012735746,0.00046720236,0.00068984315,0.00028302826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011656696,0.00011591624,0.00018861343,0.00017318594,0.00018997553,0.00026501832,0.0018673914,0.00004064569,0.00003906632],"category_scores_gemma":[0.0002085931,0.000072529554,0.00008295212,0.0005974281,0.000104908526,0.00043063652,0.00046804134,0.0006100217,0.00043833524],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009629762,0.00022425201,0.0010888497,0.000102497346,0.0001347028,0.00029861348,0.0029873475,0.053445797,0.002618209,0.11275065,0.15818392,0.6680689],"study_design_scores_gemma":[0.0020715191,0.0025014372,0.0066204234,0.00039027617,0.00003994024,0.002128915,0.0022953618,0.40489352,0.0044555105,0.3445552,0.22906564,0.000982262],"about_ca_topic_score_codex":0.000010102439,"about_ca_topic_score_gemma":0.0000018073436,"teacher_disagreement_score":0.8978951,"about_ca_system_score_codex":0.00007987401,"about_ca_system_score_gemma":0.00014845966,"threshold_uncertainty_score":0.5634059},"labels":[],"label_agreement":null},{"id":"W2076697001","doi":"10.1007/s10732-010-9127-1","title":"On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices","year":2010,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council","keywords":"Heuristics; Travelling salesman problem; Heuristic; Asymptotically optimal algorithm; Mathematics; Combinatorics; Mathematical optimization; Applied mathematics; Discrete mathematics; Computer science","score_opus":0.013308526026506036,"score_gpt":0.2593656246455304,"score_spread":0.2460570986190244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076697001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808428,0.00010327663,0.017089458,0.00022204535,0.0010897168,0.0001445623,0.0000109378325,0.000029028817,0.00046817257],"genre_scores_gemma":[0.9818636,0.00009973625,0.017660854,0.00006286329,0.00024102918,0.0000024589663,7.9308717e-7,0.000048396272,0.000020256424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982691,0.00017429538,0.00076052226,0.00009347738,0.00046457324,0.0002380313],"domain_scores_gemma":[0.99685216,0.0021577412,0.00040216962,0.00032337825,0.00019803038,0.000066528504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015979352,0.0001826692,0.00029628226,0.00021288396,0.000109835295,0.000067890855,0.00047303957,0.000113238646,0.000039421317],"category_scores_gemma":[0.002178088,0.00011431721,0.00010788561,0.00031444253,0.00006348291,0.000064647014,0.000038243594,0.0014085333,0.000004609516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073321964,0.00033479944,0.023290262,0.00013725091,0.000093709416,0.00018329686,0.0021106233,0.9486289,0.012257082,0.006122363,0.0017144592,0.005053955],"study_design_scores_gemma":[0.0012852977,0.00048154508,0.11114226,0.0006118427,0.0003683726,0.00028253265,0.0007119377,0.87284756,0.009046223,0.0021321569,0.00051553245,0.0005747458],"about_ca_topic_score_codex":0.000008771072,"about_ca_topic_score_gemma":0.0000103626535,"teacher_disagreement_score":0.087852,"about_ca_system_score_codex":0.00006604511,"about_ca_system_score_gemma":0.00004624412,"threshold_uncertainty_score":0.61194545},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"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","score_opus":0.020248092557960003,"score_gpt":0.28023996852129207,"score_spread":0.25999187596333206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086314248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023072462,0.000031732998,0.99864876,0.000060868453,0.00043704512,0.00048365313,0.000013008128,0.000046154502,0.000048020796],"genre_scores_gemma":[0.036524124,0.000014474964,0.9628078,0.000080939055,0.0005035297,0.000011181899,0.000012070451,0.000026043444,0.000019856085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840605,0.000058934427,0.0005767092,0.00026417073,0.00042882047,0.00026532984],"domain_scores_gemma":[0.9964947,0.00043942203,0.0008317108,0.0002860712,0.001710892,0.00023718132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079749984,0.00017282374,0.00026296236,0.00026197848,0.00015775564,0.00008960368,0.00045660755,0.00011021077,0.000002419081],"category_scores_gemma":[0.0006714649,0.00014762416,0.000061012008,0.0005299842,0.000058166206,0.00079180725,0.000042935055,0.00024643107,9.935254e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021873148,0.0003380774,0.00044037492,0.000006700921,0.000061992614,0.000029406732,0.00043162965,0.7215399,0.000083553,0.0007400905,0.00007741288,0.2760321],"study_design_scores_gemma":[0.0024954337,0.0010512909,0.00024327119,0.00001897985,0.000036580266,0.0001201462,0.00017048145,0.9929512,0.0015019516,0.00054547586,0.0006682526,0.00019693414],"about_ca_topic_score_codex":0.000004419075,"about_ca_topic_score_gemma":0.000007957188,"teacher_disagreement_score":0.27583516,"about_ca_system_score_codex":0.0002119688,"about_ca_system_score_gemma":0.00022628899,"threshold_uncertainty_score":0.60199386},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02053281870351411,"score_gpt":0.2684333901716734,"score_spread":0.24790057146815928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091721145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015181531,0.00025607538,0.98308927,0.00014968647,0.00016310578,0.00010590364,0.000050994444,0.0002034934,0.00079992204],"genre_scores_gemma":[0.9432695,0.000011597763,0.056341186,0.000052203082,0.00021345362,0.000005730024,0.000020966043,0.00004348117,0.000041909065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992645,0.000012093925,0.000307517,0.000073740455,0.00018576978,0.00015637148],"domain_scores_gemma":[0.99923706,0.00009938645,0.000098524244,0.00013352769,0.00026956282,0.00016196669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021732954,0.00012002246,0.00017946953,0.00010345685,0.000061608436,0.00012826796,0.0001821275,0.000048836064,0.000005823206],"category_scores_gemma":[0.00031385839,0.00010666377,0.00006317764,0.000092925766,0.000022783399,0.00013378383,0.0000071641775,0.0002734087,0.000004294678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037651733,0.0008593394,0.0037008128,0.00045866586,0.00009318646,0.00014020683,0.00058548123,0.85377127,0.0032754552,0.0010237719,0.038544424,0.09717088],"study_design_scores_gemma":[0.00057306245,0.0005485584,0.000053762793,0.000048770202,0.00003260321,0.000031643634,0.000027373944,0.97152543,0.0008434207,0.0012604792,0.024909792,0.00014510767],"about_ca_topic_score_codex":0.0000012016097,"about_ca_topic_score_gemma":2.9812384e-7,"teacher_disagreement_score":0.92808795,"about_ca_system_score_codex":0.00006755775,"about_ca_system_score_gemma":0.00006734515,"threshold_uncertainty_score":0.4349622},"labels":[],"label_agreement":null},{"id":"W2093962234","doi":"10.1007/s10732-015-9281-6","title":"A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints","year":2015,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Duration (music); Vehicle routing problem; Mathematical optimization; GRASP; Heuristics; Metaheuristic; Computer science; Set (abstract data type); Heuristic; Local search (optimization); Constraint (computer-aided design); Greedy randomized adaptive search procedure; Routing (electronic design automation); Mathematics; Greedy algorithm","score_opus":0.024286659983326922,"score_gpt":0.25864225172967015,"score_spread":0.23435559174634324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093962234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036011007,0.00045712345,0.9628684,0.0001517839,0.00018509252,0.00021156226,0.000008509452,0.00003106088,0.00007549327],"genre_scores_gemma":[0.83362347,0.000016490489,0.16614868,0.00002135889,0.00014704681,0.0000039421475,0.0000010044839,0.000025794121,0.00001220618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904954,0.000058786103,0.00044044908,0.00007319333,0.00021447387,0.0001635251],"domain_scores_gemma":[0.9984589,0.0006989537,0.00023773112,0.000092237016,0.00039612845,0.000116043826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305803,0.00011750895,0.0002100546,0.000058108013,0.000091569345,0.000084949505,0.00009672295,0.000029957493,0.0000021370718],"category_scores_gemma":[0.0010616597,0.00007822685,0.000031220636,0.00008131863,0.00008772272,0.00010542239,0.0000140011525,0.00019095212,6.4917424e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067184155,0.000015291773,0.00031458633,0.00006129988,0.00012681994,0.000015801179,0.00044191946,0.99248344,0.00020355202,0.0005268023,0.0006289518,0.005114342],"study_design_scores_gemma":[0.0011951475,0.0002033964,0.00026633887,0.00007922316,0.00024927803,0.0005908151,0.00021398763,0.9956166,0.00026200095,0.0010073324,0.00019456432,0.000121326375],"about_ca_topic_score_codex":7.502027e-7,"about_ca_topic_score_gemma":7.654492e-7,"teacher_disagreement_score":0.7976125,"about_ca_system_score_codex":0.0000482268,"about_ca_system_score_gemma":0.00007791949,"threshold_uncertainty_score":0.31899983},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; 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","score_opus":0.031429351791645806,"score_gpt":0.30792219586600056,"score_spread":0.27649284407435476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094204336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129794,0.0000738328,0.9850534,0.00058750855,0.00059188704,0.00054488995,0.000029496701,0.000016647173,0.00012294548],"genre_scores_gemma":[0.653334,0.000038032864,0.34607035,0.00009815735,0.0002608873,0.000015890322,0.0000023732396,0.000023692359,0.00015657632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969863,0.0003620901,0.001005509,0.00023337893,0.0009969434,0.00041574633],"domain_scores_gemma":[0.99573857,0.0005559773,0.00060522195,0.00066308706,0.0021754082,0.00026172627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015885948,0.00016644839,0.0003795281,0.00020621,0.00017878631,0.00039672176,0.0017630197,0.00007620465,0.00006856092],"category_scores_gemma":[0.0011004637,0.000112674374,0.00015208632,0.00057054946,0.00011566111,0.00052826863,0.00024139018,0.00038904478,0.000011581608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006658186,0.0045806826,0.00856105,0.0025202408,0.0013376698,0.00065082224,0.016946949,0.6179126,0.026120933,0.16772915,0.052472383,0.10050168],"study_design_scores_gemma":[0.000879059,0.00061875535,0.0012647577,0.00008808417,0.000036174366,0.00021371586,0.000071157694,0.9891039,0.0026081088,0.003487951,0.0014633826,0.00016493071],"about_ca_topic_score_codex":0.000026143123,"about_ca_topic_score_gemma":8.830402e-7,"teacher_disagreement_score":0.64035463,"about_ca_system_score_codex":0.00006643833,"about_ca_system_score_gemma":0.0005399036,"threshold_uncertainty_score":0.45947278},"labels":[],"label_agreement":null},{"id":"W2107306858","doi":"10.1007/s10732-006-4192-1","title":"Path relinking for the vehicle routing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Norges Forskningsråd","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Path (computing); Vehicle routing problem; Hill climbing; Mathematics; Local search (optimization); Heuristic; Local optimum; Travelling salesman problem; Routing (electronic design automation); Computer science","score_opus":0.012837469884270425,"score_gpt":0.24824476457955647,"score_spread":0.23540729469528604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107306858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012662991,0.00066012493,0.98511267,0.0002178635,0.0005065068,0.00010972966,0.000003929306,0.00005839981,0.0006677684],"genre_scores_gemma":[0.6400168,0.000050788123,0.35907593,0.00003173698,0.0007277335,0.0000017571238,8.6581207e-7,0.000034322715,0.00006008029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990395,0.000034407774,0.00051371485,0.000051340252,0.00017887559,0.00018216665],"domain_scores_gemma":[0.9988367,0.0005984287,0.00020750506,0.00010789396,0.00021924313,0.000030250578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010687532,0.000089234,0.00015028291,0.000046025787,0.00012334697,0.000061711035,0.00016831692,0.000051360905,0.0000042890415],"category_scores_gemma":[0.00028321688,0.00006532668,0.000086672444,0.00012497988,0.00001694735,0.0000648023,0.000015024471,0.00023850439,0.0000014151785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008021782,0.000013767555,0.0014817017,0.00005514925,0.00002661032,0.0000066065436,0.00010192372,0.98535323,0.0011463729,0.0013429122,0.004850187,0.0056134937],"study_design_scores_gemma":[0.00044812943,0.000047889785,0.0012843467,0.00008752912,0.00007077747,0.000052884734,0.000054855496,0.9848622,0.00095164333,0.0025446985,0.009482022,0.00011304324],"about_ca_topic_score_codex":0.0000028415752,"about_ca_topic_score_gemma":8.749541e-7,"teacher_disagreement_score":0.6273538,"about_ca_system_score_codex":0.000055711324,"about_ca_system_score_gemma":0.000025924357,"threshold_uncertainty_score":0.26639447},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Neighbourhood (mathematics); Paradigm shift; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.1476587390143901,"score_gpt":0.4031855617987858,"score_spread":0.25552682278439565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114085960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17940465,0.00029752773,0.810928,0.007153873,0.00038608117,0.00016489571,0.00001729905,0.000019529012,0.001628159],"genre_scores_gemma":[0.82637906,0.000010800616,0.17253879,0.0003983489,0.000431015,0.0000010694079,3.9198082e-7,0.000009277434,0.00023122979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628466,0.0003782233,0.00081726577,0.0002734967,0.0017427953,0.0005035283],"domain_scores_gemma":[0.99695206,0.0008886278,0.0004449131,0.00052964117,0.0008574288,0.0003273056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009224104,0.0001617027,0.00039788272,0.00036871718,0.0005179791,0.00049931154,0.0011586557,0.0000895255,0.000036239944],"category_scores_gemma":[0.006663387,0.00009269667,0.00025242375,0.0012070901,0.00004827049,0.00023271343,0.00010607902,0.0008436884,0.00014207882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010947016,0.0142629435,0.036235023,0.000053164575,0.0005749553,0.00026293387,0.028995601,0.65706784,0.0025257273,0.089671746,0.02818794,0.14106745],"study_design_scores_gemma":[0.0045766556,0.0017131103,0.32465515,0.00021201672,0.00032864252,0.00076395774,0.0047986954,0.5611724,0.00095640036,0.049787395,0.049977485,0.0010580997],"about_ca_topic_score_codex":0.000010612099,"about_ca_topic_score_gemma":0.000006871497,"teacher_disagreement_score":0.64697444,"about_ca_system_score_codex":0.00005731526,"about_ca_system_score_gemma":0.0003039978,"threshold_uncertainty_score":0.7977178},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01103870433776294,"score_gpt":0.2578407229845529,"score_spread":0.24680201864678997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116097629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001015338,0.00057212927,0.9970883,0.00005908668,0.0007813864,0.00030218717,0.00003472609,0.000029972318,0.00011683591],"genre_scores_gemma":[0.18183583,0.0012140607,0.8165925,0.000016192811,0.00013943255,0.0000047031062,0.0000086897135,0.000032978918,0.00015560501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859023,0.000041900876,0.0008803753,0.000099495825,0.00018343417,0.00020454034],"domain_scores_gemma":[0.9985641,0.0001163905,0.00039787704,0.00016969067,0.0006636566,0.00008827788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046611158,0.00015814656,0.00043726855,0.00012828285,0.0000447056,0.000035558234,0.00015203944,0.00008913414,0.0000032783653],"category_scores_gemma":[0.00045251194,0.00014499052,0.00013162187,0.0001543528,0.000024788584,0.00015559164,0.000007305949,0.00014964689,6.808092e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013273471,0.00007310391,0.000011103126,0.0002771008,0.000045617275,0.000015262009,0.00014119067,0.9962531,0.00070998893,0.00023275385,0.0009641979,0.0011438876],"study_design_scores_gemma":[0.00084644824,0.00048143766,0.00007911019,0.00017046383,0.00008192206,0.00017958533,0.000046210786,0.9961012,0.0005369157,0.0006129545,0.0007192772,0.00014445587],"about_ca_topic_score_codex":0.0000025745148,"about_ca_topic_score_gemma":9.294509e-7,"teacher_disagreement_score":0.1808205,"about_ca_system_score_codex":0.00008587721,"about_ca_system_score_gemma":0.000057799443,"threshold_uncertainty_score":0.5912542},"labels":[],"label_agreement":null},{"id":"W2120159299","doi":"10.1023/a:1020325926188","title":"Cooperative Parallel Tabu Search for Capacitated Network Design","year":2002,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":117,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Computer science; Implementation; Mathematical optimization; Class (philosophy); Algorithm; Mathematics; Artificial intelligence","score_opus":0.07304272904768266,"score_gpt":0.2879784058940713,"score_spread":0.21493567684638865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120159299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020179346,0.00068308157,0.9962392,0.00008919315,0.0004515627,0.00014272788,0.00000647573,0.000042856613,0.00032698744],"genre_scores_gemma":[0.1172742,0.00034691585,0.8815968,0.00005111083,0.00048055637,0.0000028250552,0.0000013317042,0.000043092597,0.00020317598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894965,0.00013898463,0.0004263922,0.00006106491,0.00017388618,0.00025001724],"domain_scores_gemma":[0.9986441,0.0006199848,0.00009211481,0.00009131842,0.00044997173,0.00010250599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081620755,0.00011118357,0.00023581799,0.00006843479,0.00008408253,0.000044221055,0.00013285631,0.00006996929,0.00007102712],"category_scores_gemma":[0.0003560418,0.0001019963,0.00006151725,0.00021176258,0.000029103621,0.00007932071,0.000008118447,0.0002729827,0.0000091691845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019055526,0.000016987082,0.00008085318,0.000020332995,0.000060966762,0.000014569921,0.00030714564,0.96073407,0.00017031269,0.00018700007,0.037309665,0.0010790725],"study_design_scores_gemma":[0.00057951483,0.00016759272,0.00005139827,0.00003666873,0.00003433148,0.000054776883,0.000040418676,0.9953794,0.00060421176,0.00015183311,0.0027838398,0.000116052346],"about_ca_topic_score_codex":3.3421398e-7,"about_ca_topic_score_gemma":1.7700097e-7,"teacher_disagreement_score":0.115256265,"about_ca_system_score_codex":0.000063298845,"about_ca_system_score_gemma":0.000019634861,"threshold_uncertainty_score":0.41592884},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0335307563130683,"score_gpt":0.25858835578306466,"score_spread":0.22505759946999637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131742526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055462536,0.0003300419,0.95337045,0.029818904,0.0023680911,0.000562161,0.000010010409,0.000026445043,0.00796765],"genre_scores_gemma":[0.9901063,0.00013321085,0.0044246344,0.0028746126,0.0018779264,0.000009649097,0.000008717216,0.00001630635,0.000548676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990683,0.000006884091,0.0003705625,0.000085022555,0.00028190145,0.0001873361],"domain_scores_gemma":[0.9989754,0.00006573351,0.00011486151,0.00014244954,0.0006847352,0.000016836633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006777932,0.00009615059,0.000143353,0.00009884108,0.00022933425,0.00015263425,0.0002871322,0.000030012552,0.00018042253],"category_scores_gemma":[0.00032243997,0.00006298056,0.00007740965,0.00025789998,0.000043626344,0.00032420643,0.000055877535,0.00015394339,0.000078904515],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017322246,0.00033483165,0.00095211074,0.0002347929,0.00020760846,0.000014148376,0.00025282567,0.35130516,0.000062862666,0.59503686,0.04750514,0.0039204326],"study_design_scores_gemma":[0.0053024194,0.00022292555,0.00605201,0.00013122208,0.00049207854,0.000014999857,0.003016599,0.11279403,0.000074016876,0.06562828,0.8057714,0.0004999845],"about_ca_topic_score_codex":0.0001367665,"about_ca_topic_score_gemma":0.000050084636,"teacher_disagreement_score":0.98456,"about_ca_system_score_codex":0.000041895215,"about_ca_system_score_gemma":0.00008366343,"threshold_uncertainty_score":0.25682727},"labels":[],"label_agreement":null},{"id":"W2137944694","doi":"10.1023/a:1009679511137","title":"Tabu Search for a Network Loading Problem with Multiple Facilities","year":2000,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Tabu search; Computer science; Vertex (graph theory); Mathematical optimization; Network planning and design; Heuristic; Computer network; Mathematics; Algorithm; Theoretical computer science; Graph","score_opus":0.019457902165281662,"score_gpt":0.25524968761737876,"score_spread":0.2357917854520971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137944694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095528066,0.00036025431,0.90196747,0.000051976593,0.0001547401,0.00017418334,0.000020542624,0.00007130461,0.0016714656],"genre_scores_gemma":[0.3353161,0.000115965435,0.66331947,0.00001677929,0.00039207508,0.0000031581512,0.0000019070408,0.00003903367,0.00079551706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910504,0.000039883187,0.00035193245,0.000060960123,0.00018745223,0.0002547219],"domain_scores_gemma":[0.9992327,0.00034395987,0.00006309909,0.00008805638,0.0001892896,0.00008291441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005603685,0.00010275483,0.00020597862,0.00005409514,0.00007718257,0.000048818274,0.00011279337,0.000048040176,0.00008147787],"category_scores_gemma":[0.00007159136,0.00008640017,0.000052117543,0.00014071034,0.00002603473,0.00009038774,0.000006161064,0.00021911915,0.0000038639887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000606738,0.000010345004,0.0027513502,0.00010702029,0.000045602188,0.000008708845,0.00034690675,0.98641855,0.000069991416,0.000051934938,0.0017574308,0.00837148],"study_design_scores_gemma":[0.0011778277,0.00028273335,0.0005017794,0.00019717346,0.00004891652,0.0001586662,0.00016563546,0.94742316,0.0007955838,0.00024913586,0.048781425,0.00021797813],"about_ca_topic_score_codex":0.0000019948666,"about_ca_topic_score_gemma":0.0000017690859,"teacher_disagreement_score":0.23978803,"about_ca_system_score_codex":0.000054240885,"about_ca_system_score_gemma":0.00004004395,"threshold_uncertainty_score":0.35232967},"labels":[],"label_agreement":null},{"id":"W2141809992","doi":"10.1007/s10732-007-9046-y","title":"Local and variable neighborhood search for the k-cardinality subgraph problem","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Constructive; Heuristics; Variable neighborhood search; Combinatorics; Mathematics; Induced subgraph isomorphism problem; Cardinality (data modeling); Local search (optimization); Metaheuristic; Subgraph isomorphism problem; Heuristic; Graph; Combinatorial optimization; Variable (mathematics); Discrete mathematics; Mathematical optimization; Computer science; Line graph; Data mining","score_opus":0.018834917495229954,"score_gpt":0.2812296731848295,"score_spread":0.2623947556895995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141809992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036863366,0.0007155778,0.994333,0.000097548465,0.00024741184,0.00010959082,0.000005836823,0.00002173844,0.00078293093],"genre_scores_gemma":[0.697496,0.00012971614,0.3021384,0.000029400291,0.00016539417,7.218917e-7,4.5584744e-7,0.000020188709,0.000019756513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912643,0.000040924893,0.00037559625,0.000056168672,0.00019388823,0.00020701323],"domain_scores_gemma":[0.9985199,0.00093039323,0.00007648344,0.00010510055,0.00028027102,0.00008784776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032318642,0.00008231206,0.00016383771,0.00006676513,0.00009022212,0.000043298245,0.00012258525,0.000060077906,0.0000065188565],"category_scores_gemma":[0.00017061112,0.000059546728,0.00005484955,0.00018200981,0.00005221238,0.000057578705,0.000019199233,0.0002739078,3.9989675e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103383325,0.00004413332,0.010659967,0.00028183442,0.0002451445,0.000019288496,0.00035863472,0.93674827,0.00067736197,0.012205065,0.0021564318,0.0365005],"study_design_scores_gemma":[0.0013088861,0.00024338333,0.01284636,0.00008499286,0.00024575295,0.00036274942,0.00043535637,0.9634558,0.0029754878,0.005742514,0.01204155,0.0002571506],"about_ca_topic_score_codex":0.000002550093,"about_ca_topic_score_gemma":6.2693545e-7,"teacher_disagreement_score":0.6938096,"about_ca_system_score_codex":0.00004171747,"about_ca_system_score_gemma":0.000034109074,"threshold_uncertainty_score":0.24282451},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.044919849815607496,"score_gpt":0.31950411863800854,"score_spread":0.27458426882240106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150600488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069201225,0.00026700122,0.9963555,0.0017455554,0.00050513144,0.00014370291,0.000005152666,0.00002024623,0.00026569908],"genre_scores_gemma":[0.7765418,0.0000640674,0.2211178,0.0008810297,0.0011493126,0.0000015835764,0.000005874217,0.000010105963,0.0002283942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901587,0.000093379414,0.0003570565,0.00006342414,0.00027663982,0.00019362969],"domain_scores_gemma":[0.99832803,0.00053258386,0.00034329479,0.0000531292,0.00063047913,0.000112504116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010097151,0.00006916889,0.00017193421,0.00005832388,0.00026684365,0.00005120038,0.00014852567,0.000059064325,0.000016507329],"category_scores_gemma":[0.0007170217,0.00006393419,0.00006360974,0.0002450367,0.000024159503,0.0001028316,0.0000011733638,0.000106060266,0.0000029920616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016158824,0.000055321587,0.000063552085,0.000008705492,0.000026308791,0.000012387,0.0025698622,0.97018117,0.000008208225,0.010283068,0.014990602,0.0016392043],"study_design_scores_gemma":[0.009481957,0.0052866437,0.026916912,0.0012053482,0.0036607538,0.00014781559,0.006524781,0.3070046,0.00006858192,0.39514595,0.24244235,0.002114323],"about_ca_topic_score_codex":0.000007951778,"about_ca_topic_score_gemma":0.000017137587,"teacher_disagreement_score":0.7758498,"about_ca_system_score_codex":0.000032774355,"about_ca_system_score_gemma":0.0002361452,"threshold_uncertainty_score":0.26071605},"labels":[],"label_agreement":null},{"id":"W2152304735","doi":"10.1023/a:1011336210885","title":"Variable Neighborhood Decomposition Search","year":2001,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":291,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Variable neighborhood search; Metaheuristic; Local search (optimization); Descent (aeronautics); Mathematical optimization; Variable (mathematics); Node (physics); Gradient descent; Decomposition; Computer science; Local optimum; Algorithm; Mathematics; Artificial intelligence; Artificial neural network","score_opus":0.016014294489356155,"score_gpt":0.29095552040227646,"score_spread":0.2749412259129203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152304735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023595938,0.00020218531,0.96902907,0.00006977293,0.0004968909,0.000027657297,0.0000019352683,0.00004651056,0.0065300446],"genre_scores_gemma":[0.5567801,0.00019729753,0.44255716,0.000036059664,0.0003375441,2.2667462e-7,0.0000013997411,0.000024361058,0.00006588699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921495,0.00005598082,0.0003352086,0.000042078384,0.00020051931,0.00015129232],"domain_scores_gemma":[0.99941355,0.00012873825,0.00006553129,0.000093264076,0.00021107396,0.00008782445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004991315,0.00007229276,0.0001441092,0.0001100077,0.000040381125,0.000038830738,0.000115661845,0.000053454314,0.000108935346],"category_scores_gemma":[0.00012450069,0.00007080853,0.00003941756,0.00022706739,0.000010671456,0.000104499566,0.000012261757,0.0002510256,0.000012405032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014925846,0.000035149747,0.0028890343,0.00002582634,0.000039318238,0.000065591346,0.00007530704,0.9858889,0.0027671251,0.001344682,0.0019286412,0.0049254918],"study_design_scores_gemma":[0.00060699706,0.0001164299,0.0024285242,0.00007001795,0.00005385628,0.0008565596,0.000042190208,0.98504674,0.0016436735,0.0022514842,0.0067195804,0.000163925],"about_ca_topic_score_codex":7.329583e-7,"about_ca_topic_score_gemma":9.1488936e-8,"teacher_disagreement_score":0.5331841,"about_ca_system_score_codex":0.00007007556,"about_ca_system_score_gemma":0.000031763815,"threshold_uncertainty_score":0.2887488},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"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","score_opus":0.008280661343385138,"score_gpt":0.24325122505584842,"score_spread":0.23497056371246328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155616412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004827246,0.000034008463,0.9884618,0.00092678063,0.00114192,0.000044783166,0.000025261095,0.000039345952,0.004498836],"genre_scores_gemma":[0.85849875,0.0000029236817,0.14083609,0.0004904709,0.00014882752,2.3689525e-7,0.0000020406617,0.0000032362725,0.000017445767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875647,0.000051111227,0.00044743472,0.00013078089,0.00043258193,0.00018161602],"domain_scores_gemma":[0.9989982,0.00010588763,0.00033233946,0.00016707426,0.00028570244,0.00011078248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020897797,0.000120931465,0.00017133314,0.000055377874,0.00008212189,0.00012898266,0.0003080825,0.000063126645,0.0000582966],"category_scores_gemma":[0.00019613386,0.00010896892,0.000108343425,0.00026338955,0.000092526905,0.00014275721,0.000026063657,0.00013566973,0.000024051371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109193585,0.0005436801,0.02681994,0.000029308365,0.000055776753,0.00081808725,0.000031206993,0.39268756,0.000049609585,0.2877679,0.040040117,0.2510476],"study_design_scores_gemma":[0.003478276,0.0006393377,0.05036538,0.00015891886,0.00006557591,0.0014094873,0.000024938192,0.8741205,0.00022666677,0.061928235,0.007057086,0.00052561733],"about_ca_topic_score_codex":0.0000053464446,"about_ca_topic_score_gemma":0.000008121459,"teacher_disagreement_score":0.8536715,"about_ca_system_score_codex":0.00021855609,"about_ca_system_score_gemma":0.00033361767,"threshold_uncertainty_score":0.44436237},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Scaling; Mathematical optimization; Perturbation (astronomy); Heuristic; Fixed charge; Computer science; Term (time); Mathematics; Algorithm; Physics","score_opus":0.03750003750920303,"score_gpt":0.2883837595759827,"score_spread":0.25088372206677967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170354462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094736345,0.00023540475,0.9033377,0.00051405927,0.0005836638,0.0003587269,0.000023636892,0.000044139848,0.00016631251],"genre_scores_gemma":[0.904741,0.00012666374,0.09411993,0.000119557335,0.0006464298,0.000005346268,0.000039632152,0.000022776829,0.00017869062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9984969,0.00015412313,0.0004753653,0.00012748131,0.00043451108,0.0003116264],"domain_scores_gemma":[0.9979239,0.00047734883,0.00055220973,0.00009075539,0.00078488275,0.00017090279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001199869,0.00013546825,0.00024890256,0.00009309125,0.0005925024,0.00009460653,0.00016706338,0.00010665386,0.000024215606],"category_scores_gemma":[0.0006111501,0.00011387276,0.00008184692,0.00024133862,0.00013403792,0.00022158219,0.0000031303348,0.00021038229,0.0000037773632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010361199,0.00033714078,0.012139331,0.0001057631,0.00013919006,0.00014147366,0.016333437,0.96227366,0.00005404904,0.003214226,0.002387948,0.0018376639],"study_design_scores_gemma":[0.090380825,0.015430029,0.6176283,0.01172467,0.010171893,0.0008830043,0.019155,0.13152762,0.004168507,0.07402234,0.015672833,0.009235027],"about_ca_topic_score_codex":0.000045334742,"about_ca_topic_score_gemma":0.00016803827,"teacher_disagreement_score":0.83074605,"about_ca_system_score_codex":0.00013212072,"about_ca_system_score_gemma":0.00035318892,"threshold_uncertainty_score":0.46435964},"labels":[],"label_agreement":null},{"id":"W2622823936","doi":"10.1007/s10732-019-09423-y","title":"The vehicle routing problem with cross-docking and resource constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Saint-Gobain (Canada)","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Heuristics; Computer science; Mathematical optimization; DOCK; Routing (electronic design automation); Integer programming; Algorithm; Mathematics; Computer network; Engineering","score_opus":0.007581508004379499,"score_gpt":0.24479528799495448,"score_spread":0.23721377999057497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622823936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92176896,0.00042026045,0.07237803,0.00012496156,0.00021258015,0.00012030453,0.0000022600782,0.000055272892,0.004917342],"genre_scores_gemma":[0.9504286,0.00004226458,0.049299568,0.000024536434,0.00009302816,3.1434774e-7,2.0265573e-7,0.000027670098,0.00008379396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991238,0.00005764426,0.00035924368,0.000064961954,0.00020704597,0.00018727945],"domain_scores_gemma":[0.9990381,0.0004428669,0.0001894944,0.00011486275,0.00014898172,0.00006566617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009688427,0.00009361955,0.00015306365,0.000037269587,0.00012514726,0.00016571512,0.00012614082,0.000042541877,0.000007981793],"category_scores_gemma":[0.00018856744,0.00006268199,0.000025640456,0.000104150386,0.00009719526,0.00008721106,0.000025905249,0.0003308161,0.000002696546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045451703,0.00001051595,0.10896416,0.00008525864,0.00008906115,0.00003529351,0.00060677424,0.8684753,0.0010345057,0.00094897556,0.00025098483,0.019453682],"study_design_scores_gemma":[0.0025483852,0.00035853492,0.031816866,0.00061346777,0.00009329027,0.0013214843,0.0009922668,0.9434092,0.0020011389,0.00054811005,0.015827162,0.00047006106],"about_ca_topic_score_codex":4.4980933e-7,"about_ca_topic_score_gemma":3.6868866e-7,"teacher_disagreement_score":0.0771473,"about_ca_system_score_codex":0.000036073587,"about_ca_system_score_gemma":0.000029765055,"threshold_uncertainty_score":0.25560972},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.029008425614634462,"score_gpt":0.24801119710319716,"score_spread":0.2190027714885627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732645276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018845415,0.00030423116,0.979974,0.00007831408,0.00052862504,0.00013697188,0.0000092860755,0.000015164559,0.00010799532],"genre_scores_gemma":[0.75351745,0.00016773323,0.24591763,0.0000027261892,0.00035037717,0.000004350222,0.0000018156531,0.000017256714,0.000020658714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945146,0.0000049833134,0.000336102,0.00005057597,0.00006896799,0.00008789134],"domain_scores_gemma":[0.99912965,0.00007117977,0.0003672905,0.00024890847,0.00015622341,0.000026745114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034422884,0.00007338117,0.00017194994,0.000048773825,0.0001096691,0.00004065009,0.00024278647,0.000041896903,0.0000032623966],"category_scores_gemma":[0.0007370994,0.000054813947,0.00006316831,0.00001770821,0.000052179734,0.000082965635,0.000019496132,0.000108121974,1.9604258e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025516883,0.000021796648,0.00007597781,0.000098948185,0.000042948217,3.8867887e-7,0.000042096246,0.99676454,0.0000690959,0.00042721338,0.0014916775,0.00093977846],"study_design_scores_gemma":[0.00018664311,0.00008554548,0.00024058727,0.00004459794,0.00009335956,0.0000357074,0.000040707233,0.9981049,0.0003642458,0.0005110825,0.00022790929,0.00006476254],"about_ca_topic_score_codex":0.0000014009435,"about_ca_topic_score_gemma":4.688209e-7,"teacher_disagreement_score":0.734672,"about_ca_system_score_codex":0.000026384043,"about_ca_system_score_gemma":0.000017845488,"threshold_uncertainty_score":0.22352478},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019935459278197502,"score_gpt":0.2766271281643701,"score_spread":0.25669166888617256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781884304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69268215,0.003203974,0.29022205,0.0011697524,0.0056344783,0.00095850904,0.000015406587,0.0001959682,0.0059176814],"genre_scores_gemma":[0.9949208,0.00007223928,0.0035904194,0.000009037143,0.001268805,0.0000060449006,6.4436864e-7,0.000022961327,0.000109055705],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915147,0.000036321275,0.00035830162,0.00004300781,0.00022497459,0.00018590032],"domain_scores_gemma":[0.99861,0.0005509349,0.0001116041,0.00011217027,0.0005665056,0.000048792735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082086877,0.00006402528,0.000111920424,0.000057464236,0.00015291273,0.00008031279,0.00019158259,0.00004042896,0.0000027114052],"category_scores_gemma":[0.0005000889,0.000044366767,0.00004414575,0.00010037785,0.000052718526,0.000048353588,0.000011917355,0.00013910062,0.000008994516],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006614111,0.00016239606,0.01715845,0.0013438589,0.0014330581,0.0000640967,0.0048723305,0.016235478,0.14866705,0.013579425,0.661702,0.13412046],"study_design_scores_gemma":[0.0008615773,0.00044846119,0.0040825056,0.00026263855,0.00004664645,0.00015133187,0.00019417465,0.13380915,0.01567434,0.0025262863,0.84175074,0.00019212815],"about_ca_topic_score_codex":0.0000014343188,"about_ca_topic_score_gemma":0.000012174597,"teacher_disagreement_score":0.3022386,"about_ca_system_score_codex":0.00006598671,"about_ca_system_score_gemma":0.000043448374,"threshold_uncertainty_score":0.18092242},"labels":[],"label_agreement":null},{"id":"W2807082804","doi":"10.1007/s10732-018-9374-0","title":"On the empirical scaling of running time for finding optimal solutions to the TSP","year":2018,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS","keywords":"Scaling; Mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.10556523700704039,"score_gpt":0.35214306271432305,"score_spread":0.24657782570728265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807082804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13909146,0.000041761545,0.85887873,0.0009439143,0.0004867526,0.00010323291,0.000008847078,0.000019374866,0.00042589026],"genre_scores_gemma":[0.73605525,0.0000055515166,0.26292127,0.00015302894,0.00075026276,0.0000020738803,5.2423655e-7,0.0000304409,0.00008159082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990671,0.000056692796,0.0004313585,0.000053907785,0.00020112739,0.00018980933],"domain_scores_gemma":[0.99824274,0.0011194462,0.00015710005,0.0001467777,0.0002786471,0.00005530383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015479459,0.000083404055,0.0001592727,0.0000859161,0.00021865217,0.000028837769,0.00024227942,0.00004566414,0.000041051142],"category_scores_gemma":[0.001907059,0.00005139566,0.000091961236,0.00020671262,0.000047528563,0.000032927423,0.000035064622,0.00022052969,0.00001219308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025783735,0.000015309639,0.00009196034,0.000011746741,0.000045216148,7.732977e-7,0.0009679201,0.97045124,0.0011750436,0.0005986149,0.026062002,0.00055439846],"study_design_scores_gemma":[0.00017729211,0.00020783901,0.00039930808,0.00011338289,0.000055782268,0.000020781976,0.00013924504,0.99077,0.0026844847,0.00022165396,0.00512764,0.00008260639],"about_ca_topic_score_codex":3.1742812e-7,"about_ca_topic_score_gemma":1.747981e-7,"teacher_disagreement_score":0.5969638,"about_ca_system_score_codex":0.000051902723,"about_ca_system_score_gemma":0.000033527,"threshold_uncertainty_score":0.22830655},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0637507977471381,"score_gpt":0.35187492677389764,"score_spread":0.28812412902675955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898330572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008572863,0.009033521,0.9568239,0.0074874223,0.020526346,0.00016699983,0.000030034667,0.000034947076,0.005039534],"genre_scores_gemma":[0.06298277,0.004103811,0.9061635,0.0010033165,0.010277902,0.000001700498,0.0000015613992,0.00008006355,0.015385377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99405545,0.0007009617,0.0018335041,0.00045513047,0.002001928,0.0009530076],"domain_scores_gemma":[0.989193,0.0018635294,0.0013267598,0.0010479407,0.0056864717,0.0008822773],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027460386,0.0004128216,0.0008140492,0.0005581978,0.00035858195,0.0007833523,0.0023189918,0.00039408746,0.0014976554],"category_scores_gemma":[0.014260817,0.0003964724,0.00031353623,0.0015683597,0.001110115,0.00069031207,0.0005604713,0.0016468148,0.0014480407],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002835632,0.0022796686,0.0013495098,0.0006305129,0.0008210951,0.005899269,0.005588914,0.004201246,0.00008625781,0.47897008,0.2699659,0.22992402],"study_design_scores_gemma":[0.0010061094,0.0025695264,0.0011388963,0.00093472196,0.00026510603,0.0033096813,0.00011971302,0.33863664,0.00065872667,0.05590141,0.59480834,0.00065112015],"about_ca_topic_score_codex":0.00002211752,"about_ca_topic_score_gemma":0.0000017691049,"teacher_disagreement_score":0.42306867,"about_ca_system_score_codex":0.000245792,"about_ca_system_score_gemma":0.0014542849,"threshold_uncertainty_score":0.9998487},"labels":[],"label_agreement":null},{"id":"W2916219982","doi":"10.1007/s10732-020-09453-x","title":"A tabu search for the design of capacitated rooted survivable planar networks","year":2020,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tabu search; Combinatorics; Mathematics; Planar graph; Mathematical optimization; Shortest path problem; Graph; Path (computing); Integer programming; Computer science","score_opus":0.08577908369528642,"score_gpt":0.30450855670640997,"score_spread":0.21872947301112355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916219982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011768583,0.00071095076,0.9960947,0.0015736755,0.00016198057,0.00023593433,0.00000909173,0.000012590079,0.000024191055],"genre_scores_gemma":[0.8281026,0.000292439,0.17099889,0.00026562565,0.0002666984,0.000003839014,0.0000010270259,0.000022967164,0.000045917328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833065,0.0002816982,0.00045417107,0.00012827279,0.00049363944,0.00031159187],"domain_scores_gemma":[0.9956447,0.0028446775,0.00029413332,0.00026647202,0.0007856319,0.00016442596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017077089,0.000102539125,0.00026960592,0.00008844805,0.00012631656,0.000061577244,0.0013264329,0.000049520713,0.0000055888086],"category_scores_gemma":[0.00084814057,0.000068129775,0.000102718746,0.00065105094,0.000121887795,0.00017166519,0.00008908426,0.0004400712,0.0000018470383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011799834,0.00013862607,0.00067851465,0.00010610571,0.0003052258,0.00016319688,0.00157757,0.92228884,0.0055747377,0.044752873,0.015976325,0.007257978],"study_design_scores_gemma":[0.00071164937,0.000938028,0.00022451014,0.000033021737,0.000023179762,0.000049339298,0.00012999661,0.9860276,0.00247642,0.007780023,0.0015044513,0.0001017656],"about_ca_topic_score_codex":0.000003895628,"about_ca_topic_score_gemma":5.782919e-7,"teacher_disagreement_score":0.82692575,"about_ca_system_score_codex":0.000024346373,"about_ca_system_score_gemma":0.0001859142,"threshold_uncertainty_score":0.27782515},"labels":[],"label_agreement":null},{"id":"W2940300938","doi":"10.1007/s10732-019-09412-1","title":"Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows","year":2019,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Benchmark (surveying); Vehicle routing problem; Computer science; Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Evolutionary algorithm; Genetic algorithm; Machine learning; Mathematics","score_opus":0.03366536894842708,"score_gpt":0.26658316919298636,"score_spread":0.23291780024455927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940300938","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016827041,0.00040386457,0.9811216,0.00017984326,0.00048567832,0.000617282,0.00017417195,0.00010128263,0.00008925144],"genre_scores_gemma":[0.3108543,0.000041574884,0.6884645,0.000041750824,0.0003764889,0.000004983907,0.00003080596,0.00008849599,0.000097124954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827313,0.00006218199,0.00070664356,0.00019564538,0.00040328118,0.00035911816],"domain_scores_gemma":[0.99696875,0.0014433417,0.00038433255,0.0006087228,0.0004857539,0.00010908051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010081872,0.00022749217,0.00037481714,0.000087402484,0.00017286705,0.0000792303,0.0007097434,0.00009963774,0.000029261151],"category_scores_gemma":[0.00068636885,0.00016245269,0.00008453378,0.00020866355,0.000060492355,0.00025516056,0.00012573715,0.0004813198,0.000032490123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008516345,0.00005953254,0.02225119,0.00009293396,0.0001829425,0.000011545977,0.00012218545,0.97018945,0.0007147758,0.0000613761,0.0048645665,0.001364361],"study_design_scores_gemma":[0.0016691346,0.00016380669,0.006082222,0.00011654875,0.00015922383,0.000089161855,0.000060651502,0.98647547,0.000087077584,0.00006633957,0.00481447,0.00021586627],"about_ca_topic_score_codex":0.0000050921644,"about_ca_topic_score_gemma":0.000009772914,"teacher_disagreement_score":0.29402724,"about_ca_system_score_codex":0.000118183125,"about_ca_system_score_gemma":0.00012293337,"threshold_uncertainty_score":0.6624629},"labels":[],"label_agreement":null},{"id":"W3093810628","doi":"10.1007/s10732-020-09460-y","title":"A reduced cost-based restriction and refinement matheuristic for stochastic network design problem","year":2020,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal; Transport Canada","funders":"","keywords":"Mathematical optimization; Computer science; Quality (philosophy); Variable (mathematics); Network planning and design; Computational complexity theory; Space (punctuation); Algorithm; Mathematics","score_opus":0.17383762443154727,"score_gpt":0.3683970957695745,"score_spread":0.19455947133802726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093810628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00271399,0.00028854219,0.99360466,0.002477069,0.00037695694,0.00045910056,0.0000150251135,0.0000123724285,0.000052277534],"genre_scores_gemma":[0.60746205,0.00034636853,0.3904556,0.0006289608,0.000965465,0.000016997676,0.0000059754248,0.00002861131,0.00008996418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761635,0.00017031742,0.0010753436,0.00020347246,0.0007300682,0.0002044602],"domain_scores_gemma":[0.996009,0.0016723844,0.0010958214,0.0001467092,0.000838292,0.00023777394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020491057,0.00013250136,0.00034177123,0.0001428187,0.00016074463,0.0001796972,0.00024280348,0.00006681653,0.000019050814],"category_scores_gemma":[0.0052162516,0.00009769775,0.000090206246,0.0004912537,0.00004183254,0.000109330045,0.000025751375,0.00016552975,0.0000060594084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007047896,0.000048723126,0.00019291164,0.000010932519,0.000019557168,0.000017164379,0.00016647954,0.88883954,0.00010316798,0.00055599597,0.0985103,0.010830451],"study_design_scores_gemma":[0.0020860399,0.0022353877,0.0008189,0.00008782283,0.00022293703,0.000054839995,0.00011715795,0.9224207,0.000089917616,0.032782488,0.03884152,0.00024228942],"about_ca_topic_score_codex":0.0000010763669,"about_ca_topic_score_gemma":3.4103326e-7,"teacher_disagreement_score":0.6047481,"about_ca_system_score_codex":0.00003597982,"about_ca_system_score_gemma":0.00023651491,"threshold_uncertainty_score":0.6244717},"labels":[],"label_agreement":null},{"id":"W3137924527","doi":"10.1007/s10732-021-09472-2","title":"Special issue on matheuristics","year":2021,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Intracranial Aneurysms: Treatment and Complications","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science","score_opus":0.01887459018116268,"score_gpt":0.2833639757332861,"score_spread":0.2644893855521234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137924527","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34128904,0.0009279142,0.004546926,0.035240866,0.0110189915,0.00044955197,0.00011345648,0.000081286315,0.60633194],"genre_scores_gemma":[0.75423884,0.0014761033,0.03686822,0.005543599,0.14824408,0.000003984527,0.000057516325,0.00010573175,0.053461924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991065,0.000024387815,0.00036213093,0.00008465668,0.00029538298,0.00012692493],"domain_scores_gemma":[0.99887395,0.00010825239,0.00017413306,0.00018062444,0.00053918443,0.00012388632],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007048599,0.00009817335,0.00025833887,0.000065276196,0.000066396344,0.000022814136,0.00006637296,0.00005083966,0.00097064424],"category_scores_gemma":[0.00033683705,0.00007699637,0.00013705154,0.000119872675,0.000032583866,0.000021406848,0.000014463848,0.00025685373,0.00025187677],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087369,0.003703341,0.004358735,0.00012147424,0.00036341418,0.016925642,0.00041844312,0.000050290946,0.0025310372,0.030514421,0.89915216,0.04098735],"study_design_scores_gemma":[0.0014140812,0.001120813,0.012455801,0.00011732856,0.00044303766,0.005816228,0.00010765937,0.00008250736,0.002871503,0.0032790874,0.97217155,0.00012039122],"about_ca_topic_score_codex":5.159403e-7,"about_ca_topic_score_gemma":6.454856e-7,"teacher_disagreement_score":0.55287004,"about_ca_system_score_codex":0.000054937806,"about_ca_system_score_gemma":0.000168051,"threshold_uncertainty_score":0.9999426},"labels":[],"label_agreement":null},{"id":"W3158018870","doi":"10.1007/s10732-021-09474-0","title":"Heuristic-based allocation of supply constrained blood platelets in emerging economies","year":2021,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Platelet; Blood supply; Mathematical optimization; Business; Computer science; Economics; Mathematics; Biology; Medicine; Immunology","score_opus":0.013970366811022771,"score_gpt":0.237241453221756,"score_spread":0.22327108641073323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158018870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838267,0.0004606429,0.002628597,0.0052478057,0.00070761074,0.000086080596,0.000008456913,0.000015005058,0.007019132],"genre_scores_gemma":[0.996327,0.00010965984,0.0025877012,0.0006627107,0.00025340324,7.700275e-7,0.000012076827,0.000011960182,0.000034760982],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987813,0.000024330971,0.0007442856,0.00010175505,0.00022582654,0.00012248097],"domain_scores_gemma":[0.9982315,0.000246981,0.0007802546,0.00009928509,0.00062685594,0.000015140062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005050555,0.0001022798,0.0002717576,0.00033618626,0.000047334277,0.00009616352,0.00012252656,0.00005248905,0.00044226527],"category_scores_gemma":[0.0008231351,0.00010105806,0.000083831466,0.00029224527,0.00004574121,0.00051874475,0.000021430065,0.00019744964,0.0000096617105],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017098768,0.009192754,0.5580569,0.004356986,0.0013068456,0.0060804905,0.0008395556,0.037682436,0.045584463,0.27189574,0.010101676,0.05319232],"study_design_scores_gemma":[0.05639456,0.0005925283,0.34242848,0.003427164,0.0047276197,0.0013075678,0.008272932,0.09359145,0.11367817,0.04245088,0.3301416,0.0029870658],"about_ca_topic_score_codex":0.000031462583,"about_ca_topic_score_gemma":0.000073395284,"teacher_disagreement_score":0.32003993,"about_ca_system_score_codex":0.000011290462,"about_ca_system_score_gemma":0.00015899501,"threshold_uncertainty_score":0.48424944},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Quality (philosophy); Network planning and design; Point (geometry); Artificial intelligence; Mathematics","score_opus":0.02906346457009566,"score_gpt":0.33176446640107216,"score_spread":0.3027010018309765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385705217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008268716,0.00019913544,0.9907678,0.00018269595,0.00024269406,0.00022348978,0.000004734142,0.00007710401,0.000033677028],"genre_scores_gemma":[0.81669205,0.00012359857,0.1823762,0.000022146747,0.000482997,0.000008632991,0.000024135012,0.000022832062,0.00024738387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990397,0.00016103344,0.00029363643,0.00008606369,0.0002066382,0.0002129128],"domain_scores_gemma":[0.9985514,0.0005671472,0.0003445589,0.000029886136,0.00039379235,0.00011316692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013189949,0.00007330974,0.000150401,0.00010225879,0.0004649131,0.000106804735,0.00008444401,0.000058011552,0.000007396747],"category_scores_gemma":[0.00075555244,0.000065038075,0.000029186687,0.00030949854,0.00007712374,0.00012692447,0.0000029994512,0.0001707092,0.0000014516368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010092745,0.000024707426,0.0016602868,0.000028276289,0.000024318448,0.00003503182,0.0069202636,0.981661,0.000010101288,0.0019344597,0.0015319309,0.006068659],"study_design_scores_gemma":[0.0026084038,0.0026113344,0.0062641534,0.0014619322,0.00058189296,0.00007608332,0.025818689,0.89258575,0.000015643487,0.028915994,0.038261674,0.00079843146],"about_ca_topic_score_codex":0.0000056445765,"about_ca_topic_score_gemma":0.0000053996328,"teacher_disagreement_score":0.80842334,"about_ca_system_score_codex":0.000026015954,"about_ca_system_score_gemma":0.00017957477,"threshold_uncertainty_score":0.35757825},"labels":[],"label_agreement":null},{"id":"W4387607422","doi":"10.1007/s10732-023-09519-6","title":"Effective adaptive large neighborhood search for a firefighters timetabling problem","year":2023,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 Marie Skłodowska-Curie Actions; Ministère de l'Enseignement Supérieur, de la Recherche, de la Science et de la Technologie; CHIST-ERA; Agence Nationale de la Recherche; European Commission","keywords":"Constructive; Computer science; Metaheuristic; Neighbourhood (mathematics); Mathematical optimization; Integer programming; Operations research; Adaptive strategies; Work (physics); Linear programming; Artificial intelligence; Mathematics; Process (computing); Algorithm; Geography; Engineering","score_opus":0.12726708042342302,"score_gpt":0.4145626424144746,"score_spread":0.28729556199105155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387607422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11493118,0.0009180566,0.87589914,0.0025031508,0.002386639,0.00084438815,0.0003029734,0.000116741234,0.0020977394],"genre_scores_gemma":[0.966385,0.00003524135,0.03180921,0.000088759065,0.0005839295,0.000012384629,0.000004364419,0.00002595269,0.0010551475],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668604,0.0002686156,0.00091678125,0.00026525,0.0013329331,0.00053038646],"domain_scores_gemma":[0.99073243,0.006365327,0.0005326821,0.00027740374,0.0018755643,0.00021658542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00913065,0.00015362474,0.00048416902,0.0008430697,0.00038271083,0.00023134163,0.0005920401,0.000094541545,0.000051967614],"category_scores_gemma":[0.0069400407,0.000107859465,0.00037147276,0.0017840187,0.00006202631,0.00024551412,0.00010595014,0.00040861306,0.00029019342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037859848,0.002715258,0.043862287,0.00022729368,0.0030061458,0.0009171858,0.014835666,0.122419484,0.0049342536,0.13598384,0.39346236,0.27385023],"study_design_scores_gemma":[0.00808733,0.0036384624,0.031970292,0.00045378043,0.0007319005,0.00040967434,0.005467901,0.56743836,0.0031708714,0.2803535,0.09729783,0.000980109],"about_ca_topic_score_codex":0.000003412231,"about_ca_topic_score_gemma":0.000002098512,"teacher_disagreement_score":0.85145384,"about_ca_system_score_codex":0.000067140594,"about_ca_system_score_gemma":0.00026715404,"threshold_uncertainty_score":0.83083785},"labels":[],"label_agreement":null},{"id":"W4399181335","doi":"10.1007/s10732-024-09529-y","title":"Mathematical models and solving methods for diversity and equity optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Junta de Comunidades de Castilla-La Mancha; Generalitat Valenciana; Ministerio de Ciencia, Innovación y Universidades","keywords":"Equity (law); Diversity (politics); Mathematical optimization; Mathematics; Computer science; Mathematical economics; Management science; Economics; Sociology; Political science","score_opus":0.12590444482944654,"score_gpt":0.428268988258312,"score_spread":0.30236454342886543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399181335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012552623,0.0012284787,0.99763995,0.0004285535,0.00025727556,0.0001062419,0.000003071966,0.000022091504,0.0001888281],"genre_scores_gemma":[0.01693493,0.0005186718,0.98235565,0.000033815475,0.00007245293,9.706149e-7,3.377661e-7,0.000007770538,0.00007538556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989494,0.00011298866,0.00033153308,0.00015704114,0.0002950223,0.00015399493],"domain_scores_gemma":[0.9981245,0.0011296801,0.00010578935,0.00012516428,0.00036251216,0.00015239537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023014273,0.000083716695,0.0002063434,0.00018009929,0.00025710242,0.00034776772,0.00029867096,0.000049389215,0.000008650624],"category_scores_gemma":[0.0011423589,0.000068707544,0.000045086967,0.00017077733,0.0000602594,0.000515604,0.0011847822,0.00016966609,4.3126678e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036774658,0.00012461617,0.000045304143,0.001076307,0.00018940284,0.00011138289,0.0038340562,0.21208279,0.00007108052,0.4896278,0.0014852626,0.2913152],"study_design_scores_gemma":[0.0001582301,0.000081035825,0.00000851389,0.00004914946,0.000034774068,0.0001360754,0.000018399982,0.8998428,0.000028214738,0.09940519,0.00017551938,0.00006208334],"about_ca_topic_score_codex":6.365903e-7,"about_ca_topic_score_gemma":3.8896307e-8,"teacher_disagreement_score":0.68776006,"about_ca_system_score_codex":0.000036904454,"about_ca_system_score_gemma":0.00007959723,"threshold_uncertainty_score":0.33535323},"labels":[],"label_agreement":null},{"id":"W4399498702","doi":"10.1007/s10732-024-09527-0","title":"A large-scale neighborhood search algorithm for multi-activity tour scheduling problems","year":2024,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Scale (ratio); Scheduling (production processes); Mathematical optimization; Mathematics; Geography; Cartography","score_opus":0.17365266993463255,"score_gpt":0.4287558264857538,"score_spread":0.25510315655112126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399498702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030491468,0.0019937602,0.9641303,0.00081635383,0.0021293582,0.00016035223,0.00013120112,0.000041584957,0.00010562432],"genre_scores_gemma":[0.55872875,0.000058375794,0.4390264,0.000047156074,0.0009357127,0.0000044333538,0.0000015618226,0.000027435624,0.0011701875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691826,0.0001572473,0.0008800178,0.00032312042,0.0012470518,0.00047430146],"domain_scores_gemma":[0.99591815,0.0018928677,0.00028719718,0.00030411725,0.0013428475,0.00025479408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00693153,0.00016528847,0.00043284014,0.0005233811,0.00030548364,0.0006922976,0.0005521545,0.00012232328,0.0000840016],"category_scores_gemma":[0.003998083,0.000118627846,0.000411449,0.00088175945,0.00006428662,0.00036219566,0.00009143124,0.0006621763,0.00009378414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024679038,0.003840372,0.0068603205,0.00037823294,0.001141483,0.00057781464,0.0100817345,0.06960431,0.004907908,0.0074473736,0.03180982,0.86310387],"study_design_scores_gemma":[0.0006636076,0.00021077195,0.00060333125,0.00013311287,0.000088987596,0.00014903753,0.0006220239,0.97248894,0.00038199386,0.0074215224,0.017087432,0.00014925678],"about_ca_topic_score_codex":0.00000646569,"about_ca_topic_score_gemma":0.000009868093,"teacher_disagreement_score":0.9028846,"about_ca_system_score_codex":0.000078830584,"about_ca_system_score_gemma":0.00053513725,"threshold_uncertainty_score":0.6675841},"labels":[],"label_agreement":null},{"id":"W4412853875","doi":"10.1007/s10732-025-09565-2","title":"Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances","year":2025,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Heritage College","funders":"","keywords":"Ant colony optimization algorithms; Graph coloring; Quantum annealing; Simulated annealing; Computer science; Quantum; Graph; Mathematical optimization; Theoretical computer science; Mathematics; Algorithm; Quantum computer; Physics","score_opus":0.008322143247078195,"score_gpt":0.2488166021591408,"score_spread":0.24049445891206261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412853875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1757395,0.0005837959,0.82285935,0.00010504136,0.0005965315,0.0000789445,0.0000048857733,0.0000070159854,0.000024956598],"genre_scores_gemma":[0.89086425,0.0001825689,0.108877175,0.00003405755,0.000032030006,0.0000011434079,6.412339e-7,0.0000030177841,0.000005099829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923676,0.00004156719,0.00039349296,0.00009173474,0.00013653652,0.000099917015],"domain_scores_gemma":[0.99885,0.00025311607,0.00038367324,0.00008517538,0.00039373146,0.000034333698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005608231,0.000066460525,0.00017697566,0.00021147252,0.00011517805,0.000049209793,0.00019496365,0.000026671327,3.4940774e-7],"category_scores_gemma":[0.0002592733,0.000058034766,0.000048761845,0.00035111437,0.000050861487,0.000091562884,0.00004090636,0.00006851002,2.5640945e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000636211,0.000078024495,0.000571161,0.000118586555,0.000032194406,0.0000072308626,0.0002832986,0.82617056,0.00040847328,0.16947934,0.00007599126,0.0027115426],"study_design_scores_gemma":[0.00045802305,0.00020396715,0.00033159897,0.00015912119,0.000027578868,0.00001260223,0.000073272284,0.9812834,0.0020302369,0.015256471,0.000107190885,0.000056494035],"about_ca_topic_score_codex":7.80878e-7,"about_ca_topic_score_gemma":2.0328777e-7,"teacher_disagreement_score":0.7151248,"about_ca_system_score_codex":0.000016530244,"about_ca_system_score_gemma":0.000068218586,"threshold_uncertainty_score":0.23665892},"labels":[],"label_agreement":null}]}