{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041517556,0.00018383926,0.9208175,0.00014743724,0.00010475824,0.00022162014,0.0014809711,0.024462938,0.0110633],"genre_scores_gemma":[0.48915115,0.00016907105,0.499725,0.000070683855,0.000026836013,0.00033047682,0.0021067334,0.0005825455,0.0078374585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975246,0.00004195934,0.000017250652,0.00007696242,0.00007216826,0.000039079536],"domain_scores_gemma":[0.99966776,0.00014115976,0.000016564829,0.000058868223,0.00006683704,0.000048836762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035711445,0.00081447297,0.00084847194,0.00079877523,0.00096093357,0.00094340794,0.0014018286,0.000732107,0.016395878],"category_scores_gemma":[0.0011323192,0.00041517368,0.00059432525,0.00068055827,0.00028954347,0.0009753541,0.001351989,0.000645084,0.0016854255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014168039,0.0004312905,0.0028733816,0.00039994737,0.00012854306,0.0012540048,0.0009022736,0.49760333,0.027561946,0.018134682,0.038788937,0.41050482],"study_design_scores_gemma":[0.00004700437,0.000040681563,0.00026413007,0.000009587506,0.000030542284,0.00007373846,0.000069233494,0.9847238,0.0033960203,0.0033587161,0.007965026,0.000021472995],"about_ca_topic_score_codex":0.019580677,"about_ca_topic_score_gemma":0.023572296,"teacher_disagreement_score":0.019580677,"about_ca_system_score_codex":0.00068321975,"about_ca_system_score_gemma":0.0014525384,"threshold_uncertainty_score":0.054849625},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14372706,0.004344292,0.81708467,0.0015845451,0.0006230262,0.0007959642,0.00081842317,0.002415371,0.028606677],"genre_scores_gemma":[0.45445737,0.00083242025,0.53587747,0.0005355397,0.00015327899,0.00070484704,0.00064596103,0.00042310066,0.0063699763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986914,0.0007867333,0.00004667746,0.00010844196,0.000147951,0.00021878422],"domain_scores_gemma":[0.99513406,0.0040203445,0.00015283076,0.00015527524,0.00037805617,0.00015949064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030412683,0.0011834956,0.0022296591,0.003524227,0.001702853,0.0018998564,0.0028137793,0.0031464084,0.011644638],"category_scores_gemma":[0.009403053,0.0013373175,0.0011262993,0.0035795763,0.0017170674,0.002515337,0.0012546177,0.001552535,0.0010014299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026069026,0.00017887885,0.0005054152,0.00013264806,0.000060339866,0.000052114832,0.00009270436,0.91770726,0.00025396113,0.008870512,0.0050732996,0.06681225],"study_design_scores_gemma":[0.00009506698,0.000066413915,0.00011509316,0.00002670343,0.000026075691,0.000013646025,0.000044184373,0.9925372,0.00013031867,0.0062201186,0.0007152331,0.00001002902],"about_ca_topic_score_codex":0.018399412,"about_ca_topic_score_gemma":0.014755092,"teacher_disagreement_score":0.018399412,"about_ca_system_score_codex":0.0024061208,"about_ca_system_score_gemma":0.0029969467,"threshold_uncertainty_score":0.038955152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024535507,0.0010423319,0.96286535,0.00042405844,0.00011865534,0.00022016148,0.00015714331,0.00025187558,0.010384866],"genre_scores_gemma":[0.20485692,0.0011376883,0.79013646,0.00021887445,0.00010380184,0.0005180677,0.00025017306,0.00011619093,0.0026617798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910223,0.00046536684,0.00004663569,0.000086953616,0.00019431168,0.00010457726],"domain_scores_gemma":[0.99772793,0.0017932041,0.00016197345,0.00008623603,0.0001877646,0.00004279118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018647513,0.0012618538,0.0012954873,0.0016730671,0.00063985,0.0019456057,0.001755632,0.0021926432,0.0029305525],"category_scores_gemma":[0.0050882017,0.0010455501,0.0011799588,0.003222766,0.0007084743,0.0014603671,0.0008097127,0.001698728,0.00028467504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044054264,0.000063168045,0.00022175076,0.00012678685,0.000069952934,0.000042154745,0.00002767699,0.9475182,0.00047476354,0.014960805,0.0011376371,0.035312984],"study_design_scores_gemma":[0.00002756155,0.000020521717,0.000046899695,0.000018402812,0.000017741662,0.000011919314,0.000018203093,0.9922903,0.000313639,0.006306694,0.00092241046,0.000005640254],"about_ca_topic_score_codex":0.0150071485,"about_ca_topic_score_gemma":0.012912485,"teacher_disagreement_score":0.0150071485,"about_ca_system_score_codex":0.0012013905,"about_ca_system_score_gemma":0.002591121,"threshold_uncertainty_score":0.029839575},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002272554,0.117940314,0.3412636,0.032364145,0.38869426,0.00042537693,0.00190233,0.0024596974,0.112677835],"genre_scores_gemma":[0.020691354,0.097944275,0.16609193,0.017697288,0.4517141,0.0005837728,0.004899152,0.0037360068,0.23664209],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987508,0.00024082116,0.0001298018,0.00031649007,0.00047702738,0.00008505437],"domain_scores_gemma":[0.9954379,0.0021966083,0.00016142608,0.00059175456,0.0012517258,0.00036063112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015830307,0.0018573843,0.0025336323,0.0026205385,0.00094682444,0.0038792917,0.0018456357,0.0020942837,0.056124125],"category_scores_gemma":[0.005393089,0.0009456195,0.0017030953,0.0044218865,0.00093048846,0.004585167,0.0016106756,0.005216264,0.025898263],"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.00010016755,0.00014878732,0.00019465004,0.0008161042,0.00010294645,0.00016308615,0.000037312195,0.0033995747,0.0012130837,0.02156873,0.73932505,0.23293048],"study_design_scores_gemma":[0.000034619516,0.0001100272,0.00041741252,0.00025027856,0.0000714125,0.00049812807,0.000027775732,0.0070786383,0.0008311878,0.043974068,0.94666225,0.000044219953],"about_ca_topic_score_codex":0.0007224838,"about_ca_topic_score_gemma":0.0015156571,"teacher_disagreement_score":0.056124125,"about_ca_system_score_codex":0.0010044269,"about_ca_system_score_gemma":0.0010453032,"threshold_uncertainty_score":0.18775392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021516277,0.00027498446,0.9692798,0.00041130476,0.000052739342,0.0000628159,0.000067308516,0.00008242236,0.008252335],"genre_scores_gemma":[0.51194483,0.0011650319,0.46598315,0.00020425128,0.000108881046,0.00047461165,0.00028533212,0.00017590812,0.019658027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996815,0.00014137509,0.000011674819,0.000032223805,0.00009900154,0.00003420351],"domain_scores_gemma":[0.99898547,0.00078104174,0.000047052425,0.000025002442,0.00012561405,0.000035734305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010042278,0.0005117301,0.0007057717,0.00051902625,0.0003506864,0.0007385661,0.0007570862,0.001030567,0.002878586],"category_scores_gemma":[0.0031056216,0.00036592127,0.0004960924,0.00081223156,0.00077714043,0.00089316134,0.0008496257,0.0013796602,0.00021105121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004844695,0.00008152304,0.00037589754,0.00008476602,0.00002114118,0.00006998397,0.00010656565,0.81943965,0.0008283835,0.12874405,0.0019128057,0.04828684],"study_design_scores_gemma":[0.000007727412,0.000012541237,0.000033468565,0.0000061161104,0.000003479249,0.000006898019,0.0000066232856,0.9849183,0.00008822612,0.0141343735,0.0007804488,0.0000019044325],"about_ca_topic_score_codex":0.004004979,"about_ca_topic_score_gemma":0.0030968632,"teacher_disagreement_score":0.004004979,"about_ca_system_score_codex":0.00076658675,"about_ca_system_score_gemma":0.0009233166,"threshold_uncertainty_score":0.009629786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034704152,0.0004631029,0.955997,0.00088110834,0.00026016892,0.00015618539,0.00019942857,0.000297256,0.007041567],"genre_scores_gemma":[0.38211718,0.0013128762,0.6041683,0.00039159096,0.00031426112,0.0003631189,0.00032716137,0.00020164018,0.010803932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993405,0.00037506063,0.000017923438,0.00009275305,0.00010255435,0.00007122713],"domain_scores_gemma":[0.99855596,0.0010002332,0.000111630696,0.00005981261,0.00016363768,0.00010864368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702896,0.001167445,0.0014434301,0.0008398376,0.0010877578,0.0015023348,0.0014802684,0.0018926816,0.0038591987],"category_scores_gemma":[0.004292551,0.0005551383,0.0011904321,0.002215624,0.0011586678,0.0014984958,0.0014082977,0.0021241484,0.00037552146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017415988,0.00018829809,0.0006118449,0.00021269519,0.00006627078,0.0003572469,0.00013370224,0.8864833,0.00096334773,0.05241977,0.0065780403,0.051811296],"study_design_scores_gemma":[0.000056474266,0.000060622082,0.00020487621,0.000013108957,0.000023894267,0.000070340495,0.000088060886,0.95013535,0.00029994614,0.04675853,0.0022747533,0.000013978533],"about_ca_topic_score_codex":0.010332871,"about_ca_topic_score_gemma":0.011478553,"teacher_disagreement_score":0.010332871,"about_ca_system_score_codex":0.0012159651,"about_ca_system_score_gemma":0.002139343,"threshold_uncertainty_score":0.020545483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016387621,0.0001858339,0.98038703,0.000107901506,0.000058411188,0.00007679931,0.000057949772,0.00014219912,0.0025962545],"genre_scores_gemma":[0.19952337,0.00035804012,0.79763573,0.00011082799,0.00005160571,0.00023660538,0.00015589476,0.0001448518,0.0017830641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.00023685195,0.00003617926,0.00006348144,0.00016105217,0.00008993993],"domain_scores_gemma":[0.9982457,0.0013240266,0.000112288006,0.0000676988,0.0001898379,0.000060391176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015336828,0.00095746043,0.0008322761,0.00065600825,0.0004975816,0.0010109893,0.0013060911,0.0008460629,0.002599214],"category_scores_gemma":[0.003912565,0.00046726904,0.000764237,0.0015225586,0.00056237506,0.0015451448,0.0008311594,0.0016857786,0.00026447553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027679594,0.00016076287,0.000378031,0.00016546725,0.000075480806,0.00015385577,0.00011020182,0.8262054,0.004387077,0.06856456,0.0031134586,0.096408986],"study_design_scores_gemma":[0.00003669258,0.000038914044,0.000034398035,0.000008556674,0.00001296098,0.000018595589,0.000013146241,0.98614234,0.0008278803,0.0119379265,0.0009209997,0.0000075282433],"about_ca_topic_score_codex":0.008087788,"about_ca_topic_score_gemma":0.005157164,"teacher_disagreement_score":0.008087788,"about_ca_system_score_codex":0.00059329014,"about_ca_system_score_gemma":0.0018087993,"threshold_uncertainty_score":0.016081393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017296527,0.00017828634,0.9738461,0.00022293213,0.00009542907,0.00026742366,0.00047971823,0.0012487102,0.0063649],"genre_scores_gemma":[0.18481709,0.00014850851,0.8090634,0.00020057801,0.00004270927,0.00038256767,0.0010021228,0.00026963296,0.0040733363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993697,0.00028528503,0.000020244335,0.000083615676,0.00014534667,0.00009582188],"domain_scores_gemma":[0.99834204,0.0010388619,0.00008599336,0.00016832573,0.00030163387,0.000063124135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007051935,0.0008959963,0.0010167859,0.0012716408,0.0009317531,0.0010659315,0.0017338333,0.0009880493,0.009749372],"category_scores_gemma":[0.002993758,0.00075223803,0.0008646293,0.0023084613,0.00058092107,0.0010967348,0.00077512243,0.0012409053,0.000940334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019137886,0.0002432869,0.00047184076,0.00016903513,0.000051762618,0.0001504458,0.00008498883,0.7527699,0.004033598,0.013613154,0.013087865,0.21513277],"study_design_scores_gemma":[0.00002952497,0.000029824241,0.00007378326,0.000007671802,0.0000106947045,0.000018798204,0.000019073555,0.9927981,0.0012162704,0.004491285,0.0012961554,0.000008774015],"about_ca_topic_score_codex":0.017202448,"about_ca_topic_score_gemma":0.01980662,"teacher_disagreement_score":0.017202448,"about_ca_system_score_codex":0.00083610154,"about_ca_system_score_gemma":0.001737533,"threshold_uncertainty_score":0.034204602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07344269,0.0007278159,0.9115822,0.0005680374,0.0003643064,0.00055960054,0.00017381106,0.0013255884,0.0112559395],"genre_scores_gemma":[0.20849791,0.0002030729,0.7867105,0.00032341768,0.00006617277,0.00027896784,0.0002665237,0.00023075912,0.0034226791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903727,0.0004131407,0.000034241635,0.00009166386,0.00019130606,0.00023237633],"domain_scores_gemma":[0.9988128,0.0006831145,0.000079905534,0.00011795699,0.00014710928,0.00015904228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018161503,0.0010833564,0.0018276201,0.0018094315,0.001360014,0.0011777197,0.0024599745,0.0017144849,0.006017327],"category_scores_gemma":[0.0037965055,0.0011121252,0.001207854,0.0018474928,0.0013840247,0.0020136635,0.0033902714,0.0021132564,0.00072369486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012942557,0.00076974893,0.002542857,0.00033678132,0.00013083116,0.0002941946,0.00039490394,0.47015443,0.005682565,0.061175797,0.012779423,0.44444427],"study_design_scores_gemma":[0.00023286718,0.00031494792,0.00036290596,0.00004670598,0.00005041709,0.00008674045,0.00011837791,0.96788603,0.0020977303,0.02495303,0.0038085503,0.000041676794],"about_ca_topic_score_codex":0.005582447,"about_ca_topic_score_gemma":0.012070923,"teacher_disagreement_score":0.006017327,"about_ca_system_score_codex":0.001016216,"about_ca_system_score_gemma":0.00238339,"threshold_uncertainty_score":0.020129979},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13330427,0.0013846129,0.8550733,0.0007559049,0.0001836861,0.00034905632,0.0003569055,0.002383857,0.006208527],"genre_scores_gemma":[0.59752077,0.00051990565,0.3966777,0.0002749489,0.00014443744,0.00031947537,0.00079792907,0.0002445726,0.00350028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992544,0.00028900156,0.00004887125,0.0001238635,0.00013134372,0.00015242808],"domain_scores_gemma":[0.99142295,0.0072590825,0.00023459201,0.00036650055,0.00049977656,0.00021709458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021641653,0.000990022,0.0019486183,0.001436538,0.00077801856,0.0010704084,0.002042861,0.0016122874,0.0041758344],"category_scores_gemma":[0.01032981,0.0010636512,0.000934061,0.0016073739,0.0010034116,0.0020013617,0.0009846457,0.0024675052,0.00042958895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031138942,0.0001984572,0.0008081196,0.00009352255,0.000043348045,0.000026186544,0.000069361144,0.87367374,0.00037312356,0.008102858,0.0035756263,0.11272427],"study_design_scores_gemma":[0.000055984685,0.000033098444,0.00007815377,0.000006160691,0.0000092094615,0.0000042927827,0.00000992801,0.9895084,0.00015392022,0.00985346,0.00028368746,0.0000037340121],"about_ca_topic_score_codex":0.019593304,"about_ca_topic_score_gemma":0.019834356,"teacher_disagreement_score":0.019593304,"about_ca_system_score_codex":0.0022161019,"about_ca_system_score_gemma":0.0040701106,"threshold_uncertainty_score":0.03895849},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018504996,0.00094413734,0.9680949,0.0003080045,0.00016539458,0.00018307302,0.00022282865,0.0017973464,0.009779322],"genre_scores_gemma":[0.090557426,0.00037560888,0.9043323,0.00016558808,0.00006257151,0.0003196162,0.00039262432,0.00029387503,0.0035003538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.00026013318,0.000023025555,0.000065715925,0.00016863659,0.00007022281],"domain_scores_gemma":[0.9989563,0.0006650622,0.000055205386,0.00011144798,0.00017420776,0.00003764752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595522,0.00088342157,0.0012221279,0.0014899897,0.0009352432,0.0010839212,0.0013890556,0.0019166187,0.0100404415],"category_scores_gemma":[0.0037861916,0.00082845165,0.00093818794,0.0028070002,0.0006403261,0.0012078437,0.0009868075,0.0012932707,0.001962089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025455368,0.00017566993,0.00037503173,0.0001834627,0.00006524965,0.0000760546,0.00010657806,0.50386333,0.0033028184,0.016509984,0.011482627,0.46360463],"study_design_scores_gemma":[0.00009482011,0.000099157995,0.00013467262,0.000028134848,0.000023643435,0.00005616534,0.000022099077,0.98397344,0.000722438,0.01005506,0.0047754813,0.000014806539],"about_ca_topic_score_codex":0.0046193884,"about_ca_topic_score_gemma":0.0041772383,"teacher_disagreement_score":0.0100404415,"about_ca_system_score_codex":0.00089344435,"about_ca_system_score_gemma":0.0013858944,"threshold_uncertainty_score":0.03358859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18048072,0.0018226696,0.79831964,0.001067889,0.00019790712,0.0008604117,0.0007915965,0.0011222268,0.015336877],"genre_scores_gemma":[0.7823592,0.0005905196,0.21133858,0.00022709472,0.00007274654,0.00046770976,0.00053795084,0.00025360353,0.0041525364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981748,0.0009394988,0.00007747133,0.00022290209,0.00013631802,0.00044896637],"domain_scores_gemma":[0.9900123,0.008193858,0.00048350004,0.00030867342,0.00039731732,0.00060428807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044078818,0.0014144671,0.0033163242,0.002877757,0.0015360978,0.0023611642,0.0038620464,0.0020493513,0.009303001],"category_scores_gemma":[0.009656372,0.0016702287,0.0015695384,0.0033456963,0.0014826165,0.0038244724,0.0018696444,0.0021194266,0.0004939766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018921803,0.00009039729,0.00037840017,0.000111193745,0.00005768975,0.000059112423,0.000102273174,0.97456306,0.00025115124,0.008675806,0.0019688478,0.013552982],"study_design_scores_gemma":[0.00006751928,0.00006446821,0.00012657497,0.000020391164,0.000030040606,0.000023134262,0.0000943548,0.9891555,0.00020440726,0.009592737,0.0006073939,0.000013442385],"about_ca_topic_score_codex":0.011315204,"about_ca_topic_score_gemma":0.012737636,"teacher_disagreement_score":0.011315204,"about_ca_system_score_codex":0.003460433,"about_ca_system_score_gemma":0.0027546985,"threshold_uncertainty_score":0.031121671},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9459353,0.0019478892,0.03614484,0.0004589701,0.00027205763,0.00047813996,0.0014918614,0.00065998983,0.012610983],"genre_scores_gemma":[0.960378,0.00047980392,0.034699872,0.000078660596,0.000059917427,0.00026212202,0.00193407,0.00022664484,0.0018810458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933883,0.0039779698,0.00045908135,0.0006017196,0.0009861817,0.00058662886],"domain_scores_gemma":[0.8691915,0.11176915,0.0034577674,0.0073487917,0.007384013,0.0008488056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075546377,0.0014018407,0.0010570689,0.0018745414,0.0011557577,0.0013631858,0.0020941813,0.001215139,0.0066607334],"category_scores_gemma":[0.04198158,0.00072894426,0.0007630545,0.002254419,0.0013427474,0.002241332,0.0007691596,0.001627952,0.0006464038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011296825,0.017610788,0.0068305167,0.0020762144,0.0005601058,0.00013894231,0.00037032136,0.79410213,0.015537832,0.016049014,0.009652739,0.12577455],"study_design_scores_gemma":[0.0010026069,0.0046068444,0.0037163068,0.00007275769,0.00024272484,0.00009042432,0.00034502422,0.9630487,0.016558517,0.007825445,0.0024259388,0.00006462667],"about_ca_topic_score_codex":0.0075005856,"about_ca_topic_score_gemma":0.0071709687,"teacher_disagreement_score":0.0075546377,"about_ca_system_score_codex":0.0036153276,"about_ca_system_score_gemma":0.0026762392,"threshold_uncertainty_score":0.03995323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004976629,0.000035237288,0.98818845,0.0000754322,0.000023898423,0.00014110288,0.000047280628,0.00021067863,0.0063013528],"genre_scores_gemma":[0.2106176,0.00008980258,0.7834194,0.00015472298,0.000028099324,0.0005930595,0.00012913284,0.00016251784,0.004805649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994772,0.00019820903,0.000017954224,0.00005889462,0.00018702504,0.00006069429],"domain_scores_gemma":[0.9993143,0.00037664134,0.00006500918,0.00005599254,0.00014626118,0.000041757765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015977928,0.0012812867,0.0010225971,0.0010462058,0.00086426723,0.0011479285,0.00218967,0.0014415523,0.010890081],"category_scores_gemma":[0.0024128512,0.0010012868,0.0011688715,0.0006840032,0.0007568413,0.0010922832,0.0017642908,0.0011992919,0.0010070576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007348569,0.00007901499,0.00018310665,0.00008929099,0.000021050088,0.000044543915,0.000053031566,0.9558793,0.001712729,0.013170774,0.0007357288,0.027958076],"study_design_scores_gemma":[0.000019410909,0.000035897105,0.000026536754,0.000006464145,0.00000593323,0.000008285352,0.000007020498,0.99630654,0.00029010946,0.0026306137,0.0006588167,0.00000436012],"about_ca_topic_score_codex":0.005851253,"about_ca_topic_score_gemma":0.008091817,"teacher_disagreement_score":0.010890081,"about_ca_system_score_codex":0.0011302007,"about_ca_system_score_gemma":0.0019747354,"threshold_uncertainty_score":0.036430895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04398417,0.0013514693,0.94134104,0.0004264812,0.00027925952,0.00025097872,0.0003269639,0.0022604745,0.009779201],"genre_scores_gemma":[0.22990623,0.00045329725,0.764692,0.00023739901,0.00008706336,0.00045512998,0.000432597,0.00029593767,0.0034402816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994368,0.0002845257,0.000025104671,0.00005693597,0.00012766955,0.00006881386],"domain_scores_gemma":[0.9989525,0.0006531442,0.00006180552,0.00007680855,0.00021931193,0.000036362155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014521788,0.00071480894,0.0012752921,0.0012965852,0.001121694,0.00094494224,0.0016463263,0.0016696816,0.00590996],"category_scores_gemma":[0.0032458121,0.000670595,0.0007114096,0.0025156515,0.0006881131,0.0011863525,0.00073330867,0.001108914,0.0009815969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028911018,0.00018250015,0.00043381067,0.00014603787,0.000075927055,0.000053612956,0.00007525311,0.80377203,0.0014184711,0.009493133,0.006923584,0.17713653],"study_design_scores_gemma":[0.00006548441,0.000053398522,0.00010857785,0.000008893967,0.000016256085,0.000016335389,0.000013566182,0.99432385,0.0003019125,0.003929168,0.0011545796,0.0000078798275],"about_ca_topic_score_codex":0.007642119,"about_ca_topic_score_gemma":0.005768456,"teacher_disagreement_score":0.007642119,"about_ca_system_score_codex":0.00088417827,"about_ca_system_score_gemma":0.0016954481,"threshold_uncertainty_score":0.019770741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16352856,0.011157809,0.7803921,0.0028798934,0.0005847751,0.00036986568,0.0010329916,0.0010164911,0.039037455],"genre_scores_gemma":[0.8187441,0.0024126784,0.16702965,0.00069102447,0.0005678729,0.0003278446,0.00082970475,0.0007218417,0.008675385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9891566,0.006563739,0.00026639964,0.0006551163,0.001641237,0.0017168433],"domain_scores_gemma":[0.9433042,0.049630046,0.0018969557,0.0016703425,0.0023238584,0.0011745594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018390745,0.0033027786,0.0030468511,0.0036963176,0.0019654264,0.0046269963,0.004822563,0.002542764,0.0064137895],"category_scores_gemma":[0.040509887,0.0016600128,0.0032207984,0.0040419837,0.003315029,0.0049281986,0.0020894422,0.003406068,0.00052391674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059660577,0.0001846287,0.0007226073,0.0002251282,0.00013774444,0.00007773147,0.000058970596,0.9591969,0.00035085288,0.0249467,0.0036548222,0.009847184],"study_design_scores_gemma":[0.000026986036,0.000086161344,0.00022554981,0.000020002557,0.000057174242,0.000040011048,0.000042937954,0.9864563,0.0002275344,0.01246888,0.00033464486,0.000013848272],"about_ca_topic_score_codex":0.008566026,"about_ca_topic_score_gemma":0.008626375,"teacher_disagreement_score":0.018390745,"about_ca_system_score_codex":0.0066844053,"about_ca_system_score_gemma":0.003948153,"threshold_uncertainty_score":0.09726071},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009430577,0.00713199,0.0004890772,0.018890483,0.97000396,0.000013093465,0.000039069702,0.00003463923,0.0033034584],"genre_scores_gemma":[0.00087117235,0.0038696125,0.00022667974,0.004251474,0.9826985,0.000014431325,0.000028810879,0.000058645914,0.007980733],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960524,0.0007835884,0.00040865972,0.0005541151,0.0018585179,0.0003426417],"domain_scores_gemma":[0.9796443,0.0071976185,0.0016242922,0.00092562055,0.008149785,0.0024582963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004854917,0.0031149166,0.0032470978,0.006071091,0.0023244007,0.007908036,0.0029549147,0.007533431,0.02461628],"category_scores_gemma":[0.017256172,0.0008845301,0.0023927677,0.0023688076,0.0019135872,0.0044997213,0.0019562878,0.007950471,0.009692174],"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.00007189159,0.00003059626,0.000056056542,0.00033020842,0.000042748914,0.00010144238,0.000013616623,0.00017312089,0.00019256312,0.0023352294,0.9848577,0.01179486],"study_design_scores_gemma":[0.00008555739,0.000078329846,0.00038105538,0.00037585438,0.000111465466,0.00023562406,0.000033048796,0.0009441965,0.00031132347,0.007486671,0.9899311,0.000025709136],"about_ca_topic_score_codex":0.0005892726,"about_ca_topic_score_gemma":0.0012970818,"teacher_disagreement_score":0.02461628,"about_ca_system_score_codex":0.0025584481,"about_ca_system_score_gemma":0.002025577,"threshold_uncertainty_score":0.08234966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9222093,0.0005531128,0.070797734,0.00031797893,0.0001296684,0.00011372948,0.00031163674,0.0016077877,0.003959046],"genre_scores_gemma":[0.9524529,0.0000719681,0.04559127,0.000069380425,0.000017839007,0.0001024942,0.00058756775,0.0006048519,0.0005017896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99010676,0.004938975,0.0007742854,0.001232887,0.002217947,0.000729213],"domain_scores_gemma":[0.8483396,0.13017166,0.002692352,0.011384323,0.0064696204,0.000942403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009226498,0.0006590858,0.0009569346,0.0022464327,0.0007954164,0.002417388,0.0015595885,0.0017683551,0.002231169],"category_scores_gemma":[0.0975994,0.0005488398,0.00087572593,0.002212462,0.0011849102,0.0030606787,0.0013353582,0.0024049731,0.0006087402],"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.007971299,0.002116025,0.07362862,0.0010017533,0.0012746132,0.0008064486,0.0020329624,0.3701016,0.04992733,0.015079955,0.0073138643,0.4687456],"study_design_scores_gemma":[0.00039041517,0.0017472606,0.019156845,0.00009658874,0.0004979477,0.00064757874,0.0007816268,0.9198545,0.0270957,0.026638722,0.0029866889,0.0001061674],"about_ca_topic_score_codex":0.0009357745,"about_ca_topic_score_gemma":0.0010380845,"teacher_disagreement_score":0.009226498,"about_ca_system_score_codex":0.0009523596,"about_ca_system_score_gemma":0.0013021996,"threshold_uncertainty_score":0.048794985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05469687,0.005286457,0.8567971,0.0020713548,0.0009909144,0.0004174992,0.0014747513,0.0013596978,0.0769053],"genre_scores_gemma":[0.49407572,0.00442687,0.42674685,0.0006942779,0.0008728858,0.00053691707,0.004927144,0.00093655195,0.0667828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979533,0.0006140227,0.00011485767,0.00033290903,0.0005499148,0.0004350939],"domain_scores_gemma":[0.9944931,0.0033937749,0.0002694463,0.00048142,0.0010317327,0.00033051244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027097412,0.0013830608,0.0020632874,0.001754252,0.0015581627,0.003137376,0.0034392069,0.0019461366,0.024918944],"category_scores_gemma":[0.011366188,0.0012379374,0.0008500055,0.0031605077,0.00097204564,0.0051661623,0.002309172,0.003046443,0.003706441],"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.0014652851,0.0014035869,0.0014713204,0.0019925043,0.00016767453,0.00032205868,0.00023156845,0.4624974,0.004384006,0.20215143,0.07786141,0.24605174],"study_design_scores_gemma":[0.00017115573,0.00022115109,0.00051174324,0.0001107716,0.0000595896,0.00016544618,0.0001277689,0.8404853,0.003044037,0.13517863,0.019889219,0.000035260142],"about_ca_topic_score_codex":0.0036670817,"about_ca_topic_score_gemma":0.0044309474,"teacher_disagreement_score":0.024918944,"about_ca_system_score_codex":0.0014765678,"about_ca_system_score_gemma":0.0018335608,"threshold_uncertainty_score":0.08336216},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021568525,0.27703464,0.0202017,0.022853646,0.6059904,0.00015096976,0.0006025537,0.0005178959,0.07049143],"genre_scores_gemma":[0.010434796,0.2513964,0.015071242,0.008698065,0.5699633,0.00014936617,0.0018668164,0.00073018344,0.14168988],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990885,0.00015689246,0.00009456788,0.00014583582,0.0004264023,0.00008779066],"domain_scores_gemma":[0.99520665,0.0018432772,0.00032372313,0.00031997086,0.0017478424,0.00055841065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015124377,0.0013485556,0.002397138,0.0030352555,0.0007250869,0.0038825376,0.0018166241,0.0017552803,0.04915131],"category_scores_gemma":[0.0048552374,0.00041985678,0.00078117626,0.0042834585,0.00064255873,0.0029936715,0.0010712608,0.0027345836,0.0198429],"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.000115603114,0.00011805879,0.00021101606,0.0012896619,0.00007557723,0.00011118174,0.000021669517,0.0008362801,0.00094575115,0.005607108,0.79210466,0.19856346],"study_design_scores_gemma":[0.000026254776,0.0001016202,0.00048355115,0.00031905714,0.00007499231,0.00029868862,0.000032152533,0.0015608701,0.00057547673,0.008666726,0.98784095,0.000019639141],"about_ca_topic_score_codex":0.00064397184,"about_ca_topic_score_gemma":0.0018353314,"teacher_disagreement_score":0.04915131,"about_ca_system_score_codex":0.0008229206,"about_ca_system_score_gemma":0.0011155976,"threshold_uncertainty_score":0.16442746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24476306,0.0009962216,0.72269547,0.0005713751,0.000052671454,0.00032603007,0.000181379,0.00035164118,0.030062167],"genre_scores_gemma":[0.806505,0.0005942919,0.18375926,0.000082328275,0.000020555804,0.000309255,0.00015759996,0.00010682722,0.0084649455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973637,0.00010599999,0.0000123045365,0.00002743112,0.000055783064,0.000062197156],"domain_scores_gemma":[0.9994407,0.00036901623,0.000047958252,0.000031063613,0.00004431308,0.000066783825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000860325,0.0010941838,0.0012011102,0.0011815634,0.00052856957,0.0011570812,0.0010666248,0.0017781063,0.0045672907],"category_scores_gemma":[0.0019419222,0.0006772795,0.0008883592,0.0012653068,0.0006398424,0.0011117529,0.0013766395,0.0008450248,0.00032433256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009722124,0.00006795407,0.0002747084,0.00009551599,0.000046665013,0.000104718085,0.00008234921,0.96130115,0.0013949248,0.012360606,0.00075141224,0.02342279],"study_design_scores_gemma":[0.00004079119,0.00009361851,0.00010650669,0.000015332349,0.000021622447,0.00002746503,0.000049193673,0.9912258,0.00025552526,0.0074817566,0.00067467906,0.0000076935485],"about_ca_topic_score_codex":0.0044100215,"about_ca_topic_score_gemma":0.0037555583,"teacher_disagreement_score":0.0045672907,"about_ca_system_score_codex":0.0009187248,"about_ca_system_score_gemma":0.000887352,"threshold_uncertainty_score":0.015279114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017776271,0.0005162943,0.96665025,0.0010989086,0.000106512154,0.00023295432,0.00034421525,0.00009847825,0.013176169],"genre_scores_gemma":[0.6163009,0.0022447365,0.35444793,0.0004198878,0.00031709514,0.00080696144,0.0007164052,0.00013363828,0.024612384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987803,0.00046048986,0.000037875267,0.00027451932,0.00019683894,0.0002500011],"domain_scores_gemma":[0.99890625,0.0006286401,0.00012985965,0.000060035472,0.00015232529,0.00012287046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019776376,0.0013964975,0.0021309676,0.0015142658,0.0011703438,0.0026488502,0.004897763,0.00396795,0.006833243],"category_scores_gemma":[0.003230858,0.0008867127,0.0018698002,0.0026460371,0.0012035376,0.0033790187,0.0025495843,0.002260628,0.0005003848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034466095,0.00011864021,0.0003359814,0.00010121738,0.000043262713,0.00014473303,0.00006118711,0.8897394,0.00042647246,0.09898248,0.0025312447,0.007480946],"study_design_scores_gemma":[0.000014901026,0.000025257757,0.000084468615,0.00001241899,0.000015976348,0.00004397656,0.000057658053,0.9725165,0.00012361204,0.025745125,0.001349248,0.000010870718],"about_ca_topic_score_codex":0.01215239,"about_ca_topic_score_gemma":0.00925035,"teacher_disagreement_score":0.01215239,"about_ca_system_score_codex":0.0021871491,"about_ca_system_score_gemma":0.0038867043,"threshold_uncertainty_score":0.024163365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020206574,0.0004600872,0.95333076,0.0010730863,0.00017482987,0.00018396547,0.00034133994,0.0005878177,0.02364145],"genre_scores_gemma":[0.29488572,0.00043435115,0.69258136,0.0004869714,0.00015826618,0.00040883888,0.00042134261,0.00034335905,0.010279831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913675,0.00034967336,0.000030063788,0.00012959167,0.00020846861,0.00014552109],"domain_scores_gemma":[0.99666554,0.0026878647,0.00011737854,0.00018153474,0.00024110322,0.000106617634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011600294,0.0014938711,0.001257846,0.0017411129,0.0008713279,0.0020161825,0.00144175,0.001697239,0.012784613],"category_scores_gemma":[0.007579332,0.0010939685,0.00083239033,0.0023749594,0.0010002566,0.0021390326,0.0019899001,0.001905584,0.0015082972],"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.00016759997,0.00023576716,0.00026284126,0.00017188139,0.000039371986,0.000060628885,0.000089788795,0.8367434,0.001346769,0.062145665,0.011161381,0.08757485],"study_design_scores_gemma":[0.000049819533,0.000030799893,0.000044652577,0.000016463151,0.000008513224,0.000016043363,0.00003177583,0.96452624,0.0003576984,0.03382447,0.0010862665,0.00000738554],"about_ca_topic_score_codex":0.0079338085,"about_ca_topic_score_gemma":0.0087607,"teacher_disagreement_score":0.012784613,"about_ca_system_score_codex":0.0016457018,"about_ca_system_score_gemma":0.0023198447,"threshold_uncertainty_score":0.042768776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05181366,0.00030329035,0.9413409,0.00017925182,0.0000914656,0.00008724147,0.000053949014,0.0004533668,0.005676824],"genre_scores_gemma":[0.52253634,0.00020846844,0.47256082,0.00013942701,0.00004536069,0.00025981953,0.00012757537,0.000100920915,0.0040211887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997435,0.000095995674,0.000009239895,0.000037532656,0.00007702634,0.00003666734],"domain_scores_gemma":[0.9995678,0.00027822546,0.00003236967,0.00003536049,0.00006466958,0.000021433152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059970445,0.00047173994,0.0006238674,0.00050687965,0.00034420795,0.0005913723,0.0011283181,0.0010078378,0.0022314675],"category_scores_gemma":[0.0012843717,0.00033031707,0.00047237755,0.0005757164,0.00037674577,0.0005842129,0.0006525266,0.0005565857,0.00024393026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006786318,0.00005648058,0.00029750392,0.0000278267,0.000030678162,0.000055088196,0.000038227427,0.9303714,0.0015235738,0.007127223,0.0007796131,0.059624575],"study_design_scores_gemma":[0.000016063545,0.00002202688,0.00004211943,0.0000024482783,0.000005746838,0.0000103533985,0.0000037582731,0.9985129,0.0001752284,0.00092639873,0.00028050167,0.0000024701856],"about_ca_topic_score_codex":0.0042110006,"about_ca_topic_score_gemma":0.0041807448,"teacher_disagreement_score":0.0042110006,"about_ca_system_score_codex":0.0005057879,"about_ca_system_score_gemma":0.0008489605,"threshold_uncertainty_score":0.008373022},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017605076,0.002348667,0.9704865,0.0008495626,0.00039150266,0.000115792776,0.00013125972,0.00011966457,0.007951881],"genre_scores_gemma":[0.46309903,0.00469652,0.5094718,0.0005625235,0.0008972664,0.00096811797,0.000475754,0.0005813821,0.019247675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984139,0.0009879397,0.000061206316,0.00014555483,0.00022224816,0.00016915923],"domain_scores_gemma":[0.9866888,0.012059356,0.00042129116,0.00023676337,0.0003461534,0.0002476044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056574745,0.0014017478,0.0019841252,0.0012046696,0.00065867766,0.0018438403,0.0023359358,0.0018681305,0.0071998797],"category_scores_gemma":[0.0193139,0.0018556595,0.0012859098,0.0021692365,0.0014267185,0.004329919,0.0016055417,0.0044510686,0.0005172626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020764054,0.000111341426,0.00016766356,0.00018039744,0.000053751253,0.000039790706,0.00010398619,0.8856121,0.00038602704,0.08565122,0.0028347163,0.024651412],"study_design_scores_gemma":[0.00003064171,0.000028900062,0.000038043665,0.000026705588,0.000013523902,0.0000056941203,0.000018490538,0.9655624,0.00013171179,0.033145875,0.0009918999,0.0000061312126],"about_ca_topic_score_codex":0.0066913017,"about_ca_topic_score_gemma":0.004287294,"teacher_disagreement_score":0.0071998797,"about_ca_system_score_codex":0.0016524099,"about_ca_system_score_gemma":0.0017476819,"threshold_uncertainty_score":0.029919982},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042135928,0.000613264,0.94481575,0.00068774004,0.00011881014,0.00013845954,0.00019584,0.0002149692,0.01107921],"genre_scores_gemma":[0.576785,0.0009253428,0.40420422,0.00016005186,0.00015043141,0.00036074713,0.00032196692,0.00024200555,0.016850224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999316,0.00035717114,0.000021296493,0.00007796035,0.0001245639,0.00010295636],"domain_scores_gemma":[0.9979285,0.0015422071,0.00015961516,0.00008516129,0.00017276415,0.00011173166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011495261,0.0009818185,0.0014212359,0.00082863163,0.00055832585,0.0014674886,0.0017360979,0.0015390752,0.003812273],"category_scores_gemma":[0.0040899357,0.0007890114,0.0008367196,0.0013877783,0.0009975805,0.0016238233,0.0010413909,0.0017089067,0.00040619617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052249703,0.000034305103,0.00011845078,0.000046552177,0.000022766006,0.00003611504,0.000025108324,0.97929823,0.00033805022,0.01195523,0.001088766,0.0069841794],"study_design_scores_gemma":[0.000013729203,0.000012307974,0.000026385684,0.000003995765,0.000005364996,0.000006737881,0.000008621974,0.99325883,0.00006712839,0.006280261,0.00031414366,0.000002559424],"about_ca_topic_score_codex":0.0109719485,"about_ca_topic_score_gemma":0.0072315554,"teacher_disagreement_score":0.0109719485,"about_ca_system_score_codex":0.0011930753,"about_ca_system_score_gemma":0.0016219004,"threshold_uncertainty_score":0.021816194},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054662637,0.00037682478,0.9380234,0.00026086086,0.00010292781,0.00021738095,0.00013913309,0.000836756,0.005380112],"genre_scores_gemma":[0.26107234,0.00028625588,0.7340605,0.00008630921,0.000036253336,0.0002111552,0.000294919,0.00015704686,0.0037952138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996884,0.00008925811,0.000018738157,0.00007287251,0.00007168835,0.000059083053],"domain_scores_gemma":[0.99933726,0.00036342198,0.00006109279,0.000072155766,0.00011195129,0.000053993233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009014618,0.0007253374,0.001225561,0.00080626184,0.00072548434,0.000861728,0.0018132715,0.001076872,0.004262661],"category_scores_gemma":[0.0018995907,0.00062639173,0.00066128455,0.0009952347,0.0005251494,0.0011306648,0.0010285989,0.0011536265,0.0004707138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021626161,0.00015301819,0.0004075122,0.00012508911,0.000037659243,0.000055709264,0.00007804501,0.84588224,0.0026427768,0.008158084,0.0020874985,0.14015602],"study_design_scores_gemma":[0.000040474948,0.00005985992,0.00007397448,0.000006858306,0.000010354646,0.000017248769,0.000014204005,0.99658394,0.0003595463,0.0022159289,0.0006120324,0.000005586786],"about_ca_topic_score_codex":0.0063506514,"about_ca_topic_score_gemma":0.0061125,"teacher_disagreement_score":0.0063506514,"about_ca_system_score_codex":0.000782709,"about_ca_system_score_gemma":0.0017761261,"threshold_uncertainty_score":0.014259994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01033842,0.0002642302,0.98139805,0.00030264026,0.00012717127,0.00021091178,0.00009683468,0.00038847586,0.006873208],"genre_scores_gemma":[0.07704447,0.0002573003,0.9172926,0.00010677699,0.000054107197,0.00032429307,0.00013963794,0.0001277483,0.004653114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995819,0.00013747184,0.00002431338,0.00007586915,0.00011423074,0.00006621168],"domain_scores_gemma":[0.9990103,0.0006399493,0.00005181066,0.000049932478,0.00019724661,0.000050759932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010859298,0.0009473871,0.0010901012,0.0015122233,0.0009120048,0.0014377957,0.0016495114,0.0022192493,0.010018028],"category_scores_gemma":[0.0030533094,0.00083966035,0.0010609425,0.0018804533,0.00063616334,0.0014247288,0.0012187567,0.0014345229,0.0007710904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022380096,0.0002929395,0.00063624285,0.0005045778,0.00010411191,0.0002692085,0.00032416373,0.58036447,0.0058189565,0.044125825,0.009543716,0.35779193],"study_design_scores_gemma":[0.00012174302,0.00006528787,0.0001060651,0.000034809906,0.000031488882,0.00007613348,0.000057315203,0.98472494,0.0007509406,0.009679897,0.00433645,0.00001494197],"about_ca_topic_score_codex":0.00788021,"about_ca_topic_score_gemma":0.007890495,"teacher_disagreement_score":0.010018028,"about_ca_system_score_codex":0.0009737581,"about_ca_system_score_gemma":0.002218674,"threshold_uncertainty_score":0.033513606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11274908,0.00076318334,0.87761873,0.0003529779,0.00008443823,0.00031750926,0.00034907006,0.0004598318,0.0073050787],"genre_scores_gemma":[0.72524446,0.00036585855,0.27070388,0.000103252925,0.00004625858,0.00022905174,0.00042616154,0.000110079796,0.0027709806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931085,0.00024351326,0.00002813451,0.00012795672,0.0000766049,0.00021295421],"domain_scores_gemma":[0.99812394,0.0013931436,0.00017705963,0.00009415403,0.00008216624,0.00012943217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015476348,0.0012205975,0.0017506094,0.0012300607,0.0008116571,0.0017284638,0.0025900516,0.0017403383,0.0030776367],"category_scores_gemma":[0.0031667193,0.0012811128,0.0011670275,0.0015136711,0.0010413046,0.0022549198,0.0012785479,0.0013889114,0.00023838233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000847344,0.000055983113,0.00020719988,0.000040471677,0.000025760055,0.000038149905,0.000027051767,0.9841127,0.00030693613,0.004286484,0.0005949306,0.010219527],"study_design_scores_gemma":[0.000027406897,0.000030350242,0.00007797586,0.0000079489055,0.000011148408,0.000008630858,0.0000253041,0.9946577,0.000113488204,0.0047879643,0.00024598977,0.0000060667553],"about_ca_topic_score_codex":0.01619174,"about_ca_topic_score_gemma":0.020692455,"teacher_disagreement_score":0.01619174,"about_ca_system_score_codex":0.0021612234,"about_ca_system_score_gemma":0.0025673795,"threshold_uncertainty_score":0.03219503},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022877527,0.0013421322,0.97086674,0.00035934246,0.00008512062,0.000039774426,0.000033064785,0.000087619024,0.0043086424],"genre_scores_gemma":[0.44992915,0.0022466504,0.5367945,0.00018059711,0.00017597151,0.0002485632,0.00014086072,0.00013800537,0.010145678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961424,0.0001793756,0.000016831335,0.00004325958,0.0000920935,0.00005419611],"domain_scores_gemma":[0.9984049,0.0013274506,0.000077491335,0.000046747275,0.00009717024,0.000046268706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011325377,0.0007053447,0.00087783247,0.00082019466,0.00041569307,0.0009493699,0.0011290712,0.0015341195,0.0023507266],"category_scores_gemma":[0.0046243686,0.0006454053,0.00070272066,0.0012055581,0.0006608095,0.0016506849,0.00087704824,0.0015203825,0.000245424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044205477,0.000035472298,0.00021427164,0.000034453602,0.000036460497,0.000024637466,0.000041916337,0.92815083,0.00032405125,0.035109762,0.0006024896,0.035381276],"study_design_scores_gemma":[0.000024212257,0.000015494914,0.00006285004,0.000008487678,0.000009242241,0.000010697145,0.000010491303,0.9842994,0.000095984426,0.014746701,0.0007126624,0.0000037695575],"about_ca_topic_score_codex":0.0045728353,"about_ca_topic_score_gemma":0.0033445787,"teacher_disagreement_score":0.0045728353,"about_ca_system_score_codex":0.00083317864,"about_ca_system_score_gemma":0.00081504905,"threshold_uncertainty_score":0.00909245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12729459,0.0009956525,0.8601606,0.0008554762,0.00013181638,0.0002520696,0.00014471798,0.001000555,0.009164511],"genre_scores_gemma":[0.6932683,0.0002871495,0.30087838,0.00027014795,0.00009840208,0.00028505677,0.0002829663,0.00022256991,0.0044070254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986192,0.00075147697,0.000048543832,0.00017147405,0.00023316243,0.00017605111],"domain_scores_gemma":[0.99196273,0.00666165,0.00030212483,0.00038126958,0.00044215246,0.00025014346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357106,0.0007995538,0.0022236884,0.0017891199,0.0010283348,0.001408892,0.0026894712,0.0021726587,0.0047761924],"category_scores_gemma":[0.0133909965,0.0007022042,0.0008695111,0.0020272878,0.0011399855,0.0025283007,0.002139285,0.0015300987,0.00047873968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004307115,0.00044338655,0.0009922876,0.00024811452,0.000084996806,0.0001399165,0.0001499328,0.86994714,0.0012630776,0.022355957,0.003529556,0.10041488],"study_design_scores_gemma":[0.00007773259,0.00007898253,0.00007328917,0.000014986528,0.000017757102,0.000018265959,0.000035038523,0.9773285,0.00030384038,0.0217068,0.00033883317,0.000005848772],"about_ca_topic_score_codex":0.006891348,"about_ca_topic_score_gemma":0.007388662,"teacher_disagreement_score":0.006891348,"about_ca_system_score_codex":0.0013713522,"about_ca_system_score_gemma":0.0019342529,"threshold_uncertainty_score":0.01597792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57174546,0.006202752,0.37113845,0.0041116895,0.00044164414,0.00027130486,0.00041637907,0.0013078355,0.044364523],"genre_scores_gemma":[0.8843464,0.0011076098,0.10899938,0.0005479546,0.00018543472,0.00020263322,0.0005253062,0.00048415843,0.0036009941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962108,0.0020990167,0.000113260816,0.00034963377,0.0005785986,0.0006486347],"domain_scores_gemma":[0.8945896,0.09450805,0.0022708483,0.003791725,0.0033981188,0.0014416244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008362933,0.0011056345,0.0014712653,0.0017653812,0.0016317539,0.0017563676,0.0027060066,0.0020325736,0.0058629005],"category_scores_gemma":[0.08541317,0.0007956173,0.0008219312,0.002110755,0.0029386922,0.004384786,0.0021557081,0.0026432313,0.00060326647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012369179,0.00046715536,0.0052082846,0.0005310852,0.0001530554,0.00012801496,0.00038665358,0.84872246,0.0032432,0.07843581,0.0077012707,0.053786077],"study_design_scores_gemma":[0.0000646683,0.0001793505,0.00062057684,0.00004611957,0.00004080831,0.000062001265,0.0000975964,0.9694485,0.000731993,0.028284525,0.0004094042,0.000014425815],"about_ca_topic_score_codex":0.007271808,"about_ca_topic_score_gemma":0.008008822,"teacher_disagreement_score":0.008362933,"about_ca_system_score_codex":0.0024201826,"about_ca_system_score_gemma":0.0033660976,"threshold_uncertainty_score":0.044227958},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015466062,0.0013181265,0.9658702,0.0003070401,0.00021235598,0.000044933022,0.000024071911,0.00027636206,0.016480863],"genre_scores_gemma":[0.36337435,0.00127285,0.6175095,0.0001423448,0.00011420427,0.00023138666,0.000045385492,0.0000914915,0.017218418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973685,0.000107588625,0.000009398856,0.000021802764,0.00010557471,0.00001871542],"domain_scores_gemma":[0.99971014,0.00016657503,0.000018583309,0.000021275231,0.000075116775,0.000008345002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007232454,0.0007306308,0.00055238703,0.0008777651,0.0008333336,0.0007330606,0.0007321063,0.0011829119,0.0025163204],"category_scores_gemma":[0.0012315847,0.00029895638,0.0005838082,0.0012301994,0.0004771731,0.0005100503,0.00048752612,0.00088283845,0.00036207004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008720441,0.00013072843,0.00028339372,0.00015869256,0.00007003404,0.00017101874,0.00006027169,0.7266835,0.0045206794,0.050156508,0.004357311,0.21332072],"study_design_scores_gemma":[0.000014053847,0.000052326643,0.00009147791,0.000008687032,0.000015526814,0.000045750843,0.000011561636,0.98736304,0.0015631664,0.007800325,0.0030271707,0.000006805173],"about_ca_topic_score_codex":0.001087895,"about_ca_topic_score_gemma":0.0012975285,"teacher_disagreement_score":0.0025163204,"about_ca_system_score_codex":0.000397411,"about_ca_system_score_gemma":0.0006074732,"threshold_uncertainty_score":0.008417964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07262432,0.00033712052,0.92308956,0.00016092042,0.00002813543,0.00011508165,0.000053025396,0.0005401951,0.0030515436],"genre_scores_gemma":[0.5595442,0.00016861306,0.43786073,0.00012590017,0.000045487923,0.00011209589,0.00015209304,0.00012555055,0.0018653364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948955,0.00013944937,0.000025393678,0.0001246497,0.00013715196,0.00008384962],"domain_scores_gemma":[0.9977652,0.001514361,0.00018040778,0.00018514205,0.0002575473,0.00009734034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083601027,0.0006266518,0.0014895238,0.0011768198,0.0006717844,0.0008911599,0.0014433792,0.0012107919,0.0024103068],"category_scores_gemma":[0.0038273113,0.00056820584,0.0006600995,0.0007548188,0.0008660177,0.0017004148,0.0010126121,0.000904964,0.0002059375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038734285,0.00033342163,0.0018405375,0.00017182589,0.0000909837,0.00010624856,0.00019599362,0.63578206,0.0047992966,0.027352976,0.0034839024,0.32545543],"study_design_scores_gemma":[0.000025656696,0.00005055282,0.00016125456,0.000011794997,0.0000097957745,0.000024186693,0.000018428718,0.9905856,0.0008674815,0.007888039,0.00034947606,0.000007788548],"about_ca_topic_score_codex":0.006347204,"about_ca_topic_score_gemma":0.0075355778,"teacher_disagreement_score":0.006347204,"about_ca_system_score_codex":0.0012634083,"about_ca_system_score_gemma":0.0017453989,"threshold_uncertainty_score":0.012620509},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045040276,0.0006058533,0.9465634,0.00030662946,0.00016367597,0.00012980476,0.00019226318,0.00043613263,0.00656191],"genre_scores_gemma":[0.4092031,0.00039297223,0.58349407,0.00033263944,0.00013431314,0.00047510504,0.00034385407,0.00017998264,0.0054439483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999428,0.000245699,0.000028641185,0.00007495827,0.00013840987,0.00008428041],"domain_scores_gemma":[0.99901557,0.0006674428,0.00007582877,0.00006492977,0.00011949774,0.000056713565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295704,0.00096110615,0.0010844448,0.0013159836,0.00041756048,0.0011378103,0.0021560725,0.0018821313,0.0027355915],"category_scores_gemma":[0.0017221787,0.00077019085,0.0012682448,0.0014702757,0.0004689812,0.0010918805,0.0009381183,0.0011173993,0.00031084038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008342852,0.00009311492,0.00029044284,0.000052986514,0.0000780499,0.000044418724,0.000022571774,0.9585127,0.001211049,0.0075609977,0.00090699486,0.03114332],"study_design_scores_gemma":[0.000028307524,0.000035348687,0.000047687678,0.0000059153076,0.000012775479,0.000012453285,0.00000600366,0.9975879,0.00015690606,0.0016682863,0.0004340431,0.0000043788787],"about_ca_topic_score_codex":0.005439724,"about_ca_topic_score_gemma":0.0062413597,"teacher_disagreement_score":0.005439724,"about_ca_system_score_codex":0.0011409954,"about_ca_system_score_gemma":0.0015229472,"threshold_uncertainty_score":0.010816157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1442863,0.00070162705,0.8313515,0.00054834015,0.00021894605,0.0003251146,0.00021396947,0.00071985077,0.021634307],"genre_scores_gemma":[0.5510395,0.00023076739,0.44354987,0.0001451278,0.000076375654,0.00024443728,0.000268373,0.00018570943,0.004259717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948347,0.00021344586,0.00001734855,0.000074892676,0.000112840135,0.00009795609],"domain_scores_gemma":[0.9988955,0.00072200026,0.000069401874,0.00010891615,0.00014144609,0.000062630395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009934797,0.0006597869,0.0013446644,0.00076597003,0.0006625231,0.0009764647,0.0022604463,0.001634429,0.0038708248],"category_scores_gemma":[0.0036938426,0.0005245221,0.0011651709,0.0010330107,0.0006638106,0.0010588624,0.0010103452,0.0010280537,0.000302657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106248444,0.00011077462,0.0004421502,0.00009052748,0.000058974525,0.00014369644,0.000079687896,0.9249974,0.0014074217,0.014806832,0.002338175,0.055418096],"study_design_scores_gemma":[0.000021326816,0.00003940426,0.00009372262,0.0000083776995,0.000016527963,0.000032774627,0.000012333448,0.99631363,0.00026703495,0.0025917594,0.00059716875,0.0000060163084],"about_ca_topic_score_codex":0.005816432,"about_ca_topic_score_gemma":0.005873956,"teacher_disagreement_score":0.005816432,"about_ca_system_score_codex":0.0011410324,"about_ca_system_score_gemma":0.0014534364,"threshold_uncertainty_score":0.012949169},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051242147,0.0013530526,0.9378989,0.00067271467,0.0001575284,0.0001609178,0.00019641295,0.00025840016,0.00805993],"genre_scores_gemma":[0.43548563,0.0020485672,0.55192053,0.00019485882,0.00014836919,0.0002627659,0.0004865567,0.00029487637,0.0091578765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990445,0.00049960025,0.000033013926,0.00012308768,0.00015805737,0.00014178916],"domain_scores_gemma":[0.99701595,0.0022994806,0.00018450775,0.00016633648,0.00020223805,0.00013145855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017797982,0.0010246992,0.0013243557,0.0010572829,0.00081510615,0.001156192,0.0016770007,0.0011435814,0.005312195],"category_scores_gemma":[0.0066269436,0.0007721158,0.0008464669,0.0014351924,0.0011905556,0.0025217864,0.0014635071,0.0026718355,0.00054966175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022033816,0.00012367716,0.0004099003,0.00022766071,0.000043661905,0.00006205672,0.00012003617,0.88714075,0.00088518875,0.04221092,0.0033016216,0.06525416],"study_design_scores_gemma":[0.000047344638,0.00008293196,0.00010853627,0.00002845175,0.000023900671,0.00003671761,0.00005220068,0.94967616,0.00040082133,0.047948536,0.0015826817,0.000011708355],"about_ca_topic_score_codex":0.0062449747,"about_ca_topic_score_gemma":0.0049955584,"teacher_disagreement_score":0.0062449747,"about_ca_system_score_codex":0.0010090119,"about_ca_system_score_gemma":0.001731702,"threshold_uncertainty_score":0.017771065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026370116,0.0006528378,0.96498513,0.00045955094,0.00009810641,0.000085760774,0.00006584599,0.00014124412,0.007141441],"genre_scores_gemma":[0.5367602,0.0007691348,0.45084095,0.00016735635,0.00016857119,0.00036872498,0.00023002857,0.000118355616,0.01057664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944764,0.0003291548,0.000019076026,0.00005422875,0.000110099434,0.00003976248],"domain_scores_gemma":[0.99826056,0.0014098298,0.00006821803,0.000056520763,0.00013526765,0.0000696259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011480269,0.00045536496,0.0013174496,0.0011376885,0.00064236403,0.00080250483,0.0014164917,0.0014409723,0.0038176351],"category_scores_gemma":[0.004445146,0.00045415375,0.0007312026,0.0012996285,0.00075618527,0.0014273769,0.0010978606,0.001032172,0.00034773594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007686853,0.00006438048,0.00018502054,0.000072515155,0.00003373133,0.000048445992,0.00006177891,0.940849,0.0005313898,0.027360264,0.0010904907,0.0296261],"study_design_scores_gemma":[0.00002630804,0.00002328084,0.0000483764,0.0000051910174,0.0000063625275,0.000008922785,0.000010542859,0.9885535,0.000060841812,0.0107407095,0.0005114922,0.000004472607],"about_ca_topic_score_codex":0.0067496905,"about_ca_topic_score_gemma":0.007330165,"teacher_disagreement_score":0.0067496905,"about_ca_system_score_codex":0.000979166,"about_ca_system_score_gemma":0.0011201467,"threshold_uncertainty_score":0.01342082},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020099726,0.0002991515,0.97543746,0.000079628364,0.00008460581,0.0001082323,0.000051944397,0.00033999057,0.0034992837],"genre_scores_gemma":[0.44637698,0.00026876607,0.54951537,0.000113566144,0.00008846506,0.00035749338,0.00014169449,0.00014567074,0.0029920312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973005,0.00010905238,0.00001300123,0.00003245561,0.00006912746,0.000046262823],"domain_scores_gemma":[0.99929655,0.0004369303,0.000059733567,0.000050008457,0.000120083445,0.000036754765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010427451,0.00079306756,0.0013620853,0.0010965029,0.00063737226,0.0006613699,0.0014407907,0.00089086057,0.0028649224],"category_scores_gemma":[0.0015700848,0.00057831494,0.00086094823,0.0010444352,0.0005996667,0.0006504209,0.00066116476,0.0007585739,0.0002677612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007697789,0.000061914856,0.0001366124,0.000071066745,0.000041016876,0.000045874425,0.000030229789,0.9451809,0.001474307,0.0046155676,0.0007971085,0.0474685],"study_design_scores_gemma":[0.000017732249,0.00002425348,0.000031566084,0.000003989073,0.000008649924,0.0000070746155,0.0000043256236,0.99821246,0.0002445071,0.001198334,0.00024341918,0.0000035876826],"about_ca_topic_score_codex":0.005356031,"about_ca_topic_score_gemma":0.0055848486,"teacher_disagreement_score":0.005356031,"about_ca_system_score_codex":0.00074444985,"about_ca_system_score_gemma":0.0012451605,"threshold_uncertainty_score":0.010649741},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059508532,0.00045338346,0.92920136,0.00020777213,0.00008906857,0.00020406557,0.00010006058,0.0008795768,0.009356115],"genre_scores_gemma":[0.5175674,0.00019600822,0.4766559,0.00014805132,0.000058490095,0.0007262537,0.00020704369,0.00021063314,0.0042301835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991721,0.00045407808,0.000025254736,0.00009090781,0.00014775312,0.00011001745],"domain_scores_gemma":[0.9977912,0.0014573906,0.00016264655,0.00022315646,0.00028601574,0.000079603575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021907184,0.0010664292,0.0013086486,0.0015640863,0.0012031811,0.0008882809,0.0022306098,0.0013024204,0.005226444],"category_scores_gemma":[0.004455176,0.0010661996,0.0008465346,0.002011971,0.0009557947,0.001341139,0.0012123447,0.0010784499,0.00069964415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011662403,0.00008449503,0.00024341865,0.000044928922,0.000030485786,0.000021661617,0.000046894293,0.95552224,0.0005885883,0.0034664473,0.0010547444,0.03877952],"study_design_scores_gemma":[0.000032271153,0.000031488347,0.00003360979,0.000002596055,0.0000071903332,0.0000045697866,0.000009215812,0.99699044,0.0002128284,0.0024381834,0.00023527422,0.0000022546205],"about_ca_topic_score_codex":0.008684323,"about_ca_topic_score_gemma":0.009071293,"teacher_disagreement_score":0.008684323,"about_ca_system_score_codex":0.0009958096,"about_ca_system_score_gemma":0.0017061983,"threshold_uncertainty_score":0.017484188},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043813713,0.00055208395,0.94860995,0.00040601246,0.000138761,0.00014493361,0.00013369787,0.00052109896,0.0056798705],"genre_scores_gemma":[0.44349766,0.00021668234,0.5494859,0.00020265972,0.00012058342,0.00031585642,0.00027946843,0.00015774631,0.005723497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989079,0.00049822126,0.000044309098,0.00021126174,0.00016497751,0.00017332335],"domain_scores_gemma":[0.9973368,0.001882222,0.00014421734,0.00022075388,0.00027978624,0.00013620383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344081,0.00075558526,0.0023926664,0.0015920154,0.0015476083,0.0012250346,0.0029116273,0.0016582231,0.005428411],"category_scores_gemma":[0.006311774,0.00086667197,0.0010712097,0.0021487488,0.0010822187,0.0024677236,0.0017761252,0.0012580227,0.0005864266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056444894,0.00019410197,0.0007415937,0.000096062155,0.00007730074,0.00006264454,0.00007835902,0.89685935,0.00076143444,0.021092782,0.0039922763,0.075479575],"study_design_scores_gemma":[0.000047870817,0.000041511954,0.000048993006,0.000003904616,0.000007823317,0.0000101862315,0.000013072846,0.99190474,0.00016123938,0.007384113,0.00037242158,0.000004159726],"about_ca_topic_score_codex":0.011773059,"about_ca_topic_score_gemma":0.013320059,"teacher_disagreement_score":0.011773059,"about_ca_system_score_codex":0.0014036361,"about_ca_system_score_gemma":0.0024187728,"threshold_uncertainty_score":0.023409069},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18428165,0.0017577613,0.7850865,0.0013390753,0.00025103506,0.00058806,0.0010740939,0.001856643,0.023765162],"genre_scores_gemma":[0.4300352,0.00053307565,0.5595274,0.00025622695,0.00008783262,0.0006024766,0.0007706987,0.00043222652,0.007754844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991092,0.0005202016,0.00002826126,0.000090032176,0.00010608838,0.00014620104],"domain_scores_gemma":[0.9959674,0.0033465847,0.00018869483,0.00012577148,0.00025895383,0.00011264883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002096614,0.0010079829,0.0015336104,0.0022905837,0.0015431291,0.0017366341,0.002142448,0.0027576238,0.01190671],"category_scores_gemma":[0.007817013,0.0014660927,0.0011724774,0.0031324942,0.0011941174,0.002160703,0.0010480992,0.0015323908,0.0009509138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018065677,0.00015689115,0.000448733,0.000145938,0.000045506655,0.000060344737,0.000069763526,0.9503018,0.0003738805,0.008125047,0.003412394,0.036678936],"study_design_scores_gemma":[0.0000582469,0.000046387973,0.00009888393,0.000015653903,0.000017136483,0.000015652962,0.000039959312,0.99286216,0.00014880054,0.006125012,0.0005641482,0.000007886222],"about_ca_topic_score_codex":0.018050665,"about_ca_topic_score_gemma":0.0146903135,"teacher_disagreement_score":0.018050665,"about_ca_system_score_codex":0.0017777628,"about_ca_system_score_gemma":0.002238264,"threshold_uncertainty_score":0.039831936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19018432,0.0010381277,0.79804176,0.00086036645,0.000075242606,0.00011773544,0.00020549961,0.00034827934,0.009128587],"genre_scores_gemma":[0.76840574,0.0003132109,0.22603396,0.000113747905,0.000060143688,0.0001729993,0.00026997674,0.00011377698,0.0045163813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941754,0.00035616144,0.00001355299,0.000065043496,0.00007763957,0.00006997214],"domain_scores_gemma":[0.9971686,0.0023296678,0.00016450658,0.000108004024,0.00012192931,0.00010723019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012801003,0.0004184441,0.0012535488,0.00091126905,0.0006423909,0.0008005618,0.0014887303,0.0008269315,0.0025408114],"category_scores_gemma":[0.005196433,0.00042794013,0.00060294,0.0011286255,0.0008156003,0.0014917075,0.0009417991,0.0008010799,0.0001758552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002015694,0.000109957065,0.0009861381,0.000077055935,0.000049414375,0.000042813055,0.00006759719,0.9402904,0.00042289804,0.029261447,0.0019288877,0.02656184],"study_design_scores_gemma":[0.000027887423,0.00002254822,0.000118096,0.00000571842,0.000009070979,0.000009843798,0.00001949031,0.9873487,0.00009736833,0.012103721,0.00023389835,0.0000036884048],"about_ca_topic_score_codex":0.0067885523,"about_ca_topic_score_gemma":0.009799905,"teacher_disagreement_score":0.0067885523,"about_ca_system_score_codex":0.0009508483,"about_ca_system_score_gemma":0.0010470634,"threshold_uncertainty_score":0.013498068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022297295,0.00053082866,0.96866757,0.00045840314,0.00018683236,0.00019830797,0.00017987828,0.00042553642,0.007055285],"genre_scores_gemma":[0.29610845,0.0004593715,0.69770694,0.0002949284,0.00016655782,0.0006745772,0.00027121848,0.00018574382,0.0041321856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932814,0.00033202049,0.000031582564,0.00007758437,0.00014402953,0.00008666081],"domain_scores_gemma":[0.99811697,0.0013672689,0.00012219226,0.00009436183,0.00020679036,0.00009248853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020936064,0.0012893406,0.0016742058,0.0020163946,0.0008157172,0.0013223618,0.0019869362,0.0024529556,0.0036869384],"category_scores_gemma":[0.0043715313,0.00101953,0.0017578773,0.0020163206,0.0010696102,0.0011372333,0.0013603482,0.0018838169,0.0003603768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037268866,0.00003393589,0.00012696738,0.000029123787,0.00003485478,0.000020754705,0.000017213213,0.9743269,0.00021602432,0.008804773,0.00069796114,0.015654234],"study_design_scores_gemma":[0.0000226921,0.000016286407,0.00002548625,0.000006759499,0.000009938634,0.0000050860035,0.000004530329,0.9961738,0.0000590264,0.0033141137,0.00035954607,0.0000027253811],"about_ca_topic_score_codex":0.011317456,"about_ca_topic_score_gemma":0.0089254435,"teacher_disagreement_score":0.011317456,"about_ca_system_score_codex":0.0023269178,"about_ca_system_score_gemma":0.0027666786,"threshold_uncertainty_score":0.022503197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02367569,0.001328686,0.93662065,0.00053547806,0.00040371442,0.00013517454,0.00019520568,0.00049456157,0.036610823],"genre_scores_gemma":[0.27674156,0.00071740313,0.6928264,0.00040361704,0.00019596604,0.00036766607,0.00070257357,0.00038239412,0.027662374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995141,0.00021672015,0.000014653317,0.000099700344,0.00010247147,0.00005235987],"domain_scores_gemma":[0.9994209,0.00031773277,0.000035643734,0.00008463098,0.00010601354,0.000035177713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008397948,0.00073085434,0.0013461636,0.0011894432,0.0008501987,0.0011510109,0.0010093037,0.0013139141,0.011766904],"category_scores_gemma":[0.0029766383,0.0007105193,0.0008246004,0.0012573262,0.0007583617,0.0012429961,0.0009921413,0.0013083422,0.0014490678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002750498,0.00021657284,0.00081032317,0.00015218313,0.00011425689,0.00006522565,0.000107100466,0.56234795,0.0016911577,0.09347977,0.023943454,0.3167969],"study_design_scores_gemma":[0.00005320726,0.000059913426,0.00014683402,0.000029689236,0.000024116147,0.00003700827,0.000025346013,0.96950924,0.0005676379,0.023794018,0.005745017,0.000007869416],"about_ca_topic_score_codex":0.0034228603,"about_ca_topic_score_gemma":0.0043275123,"teacher_disagreement_score":0.011766904,"about_ca_system_score_codex":0.0006955572,"about_ca_system_score_gemma":0.0010373114,"threshold_uncertainty_score":0.03936422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040087752,0.0013802748,0.93039334,0.0027476521,0.0004607443,0.00018166752,0.00030232404,0.00023525335,0.024210922],"genre_scores_gemma":[0.6928072,0.001972571,0.29146004,0.0011666795,0.00053120806,0.00024969387,0.0003905983,0.00029833443,0.011123646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985133,0.00076995895,0.000050037837,0.00017498064,0.00028246787,0.00020932376],"domain_scores_gemma":[0.9913298,0.007015067,0.0003789829,0.0004099506,0.0006047294,0.00026149658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002900182,0.0012297414,0.0014428865,0.0016192626,0.0011351829,0.002307637,0.0020547798,0.0018277281,0.009074659],"category_scores_gemma":[0.013651974,0.00083265366,0.0012304104,0.0020201027,0.0026036296,0.0077604805,0.00315198,0.0038737252,0.00034225886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018731749,0.0000817134,0.00060065364,0.00026245572,0.00006415991,0.00015487516,0.00023422927,0.62484235,0.000797142,0.30316618,0.006251024,0.06335792],"study_design_scores_gemma":[0.000042023275,0.00005204645,0.00026001842,0.000056624423,0.000036004418,0.000041449406,0.00009886426,0.6607459,0.0006185342,0.33392525,0.004093905,0.000029477142],"about_ca_topic_score_codex":0.0067356043,"about_ca_topic_score_gemma":0.007869856,"teacher_disagreement_score":0.009074659,"about_ca_system_score_codex":0.0011675701,"about_ca_system_score_gemma":0.0012064317,"threshold_uncertainty_score":0.030357778},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11389897,0.00072330545,0.8742726,0.0004763627,0.00018518182,0.00024813527,0.00008847493,0.00075920916,0.009347766],"genre_scores_gemma":[0.8103518,0.00013677051,0.18669367,0.00018473997,0.000047268608,0.00019308511,0.00007785068,0.00011002036,0.0022048585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961877,0.00017438512,0.000014629144,0.000042761858,0.00007987634,0.000069614456],"domain_scores_gemma":[0.99901557,0.000572838,0.000093990864,0.00007680725,0.00015455886,0.0000861943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010777664,0.00096371165,0.0013921268,0.0009573432,0.00068918784,0.0007183641,0.0020418025,0.0012961823,0.003543453],"category_scores_gemma":[0.0030987745,0.00073556864,0.0005538775,0.0010091676,0.00068339,0.0013699926,0.0011432851,0.0012217188,0.0002982947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014026414,0.00009278482,0.00018522814,0.00003391881,0.000016712556,0.000038565428,0.000029883615,0.96967643,0.0006607023,0.0029675092,0.0007812908,0.025376763],"study_design_scores_gemma":[0.000016497675,0.000032214833,0.000023844948,0.000003419446,0.000005093813,0.000004986418,0.000005589841,0.99871814,0.0001441745,0.0009498689,0.0000933247,0.000002945639],"about_ca_topic_score_codex":0.0055603245,"about_ca_topic_score_gemma":0.006048015,"teacher_disagreement_score":0.0055603245,"about_ca_system_score_codex":0.0011105029,"about_ca_system_score_gemma":0.0012572891,"threshold_uncertainty_score":0.011854053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099912494,0.0015958931,0.8690974,0.0014460055,0.0004792071,0.00020962839,0.0006593014,0.00029557856,0.026304452],"genre_scores_gemma":[0.77047807,0.0014059126,0.2000481,0.00038881955,0.00025296726,0.00022401934,0.00058367226,0.00024073452,0.02637764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986255,0.00063249614,0.000049389073,0.00022732606,0.00014079262,0.000324464],"domain_scores_gemma":[0.99827313,0.0012105904,0.00014600475,0.000098349185,0.00011266868,0.00015921837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017313443,0.0014894074,0.0020618525,0.0013380437,0.0009033822,0.0029893294,0.0024063315,0.0028707571,0.0066459556],"category_scores_gemma":[0.004538298,0.001524771,0.001503983,0.0027000126,0.0013205406,0.0036926917,0.0022180565,0.0018548631,0.00063969754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000876715,0.00005550511,0.0003021457,0.00007676759,0.00005523443,0.0002103782,0.000022195152,0.9665551,0.00036720888,0.021437058,0.0016552033,0.009175557],"study_design_scores_gemma":[0.00003651123,0.00004993554,0.00019351664,0.000017674309,0.000029516697,0.000098727745,0.00005092019,0.9773597,0.00028006374,0.020225696,0.0016393663,0.000018297818],"about_ca_topic_score_codex":0.012304268,"about_ca_topic_score_gemma":0.008511057,"teacher_disagreement_score":0.012304268,"about_ca_system_score_codex":0.0015859657,"about_ca_system_score_gemma":0.0020830361,"threshold_uncertainty_score":0.024465322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014178286,0.00022589875,0.9807961,0.00011625067,0.000038993763,0.00014371233,0.000092387665,0.00019655551,0.0042118146],"genre_scores_gemma":[0.34847206,0.00037082226,0.64715785,0.0001136896,0.00006188097,0.00063491537,0.00021759004,0.00010266162,0.0028686386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927646,0.00034754683,0.000024004092,0.00006978162,0.00019762061,0.000084528256],"domain_scores_gemma":[0.99842936,0.0012140092,0.00012548787,0.000052434294,0.00012692422,0.00005189701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014483505,0.00089482876,0.0009863761,0.0013788313,0.0005045081,0.00078935886,0.0012743974,0.0009457695,0.0029449025],"category_scores_gemma":[0.0029065637,0.0007046051,0.0010750387,0.0012421245,0.0008790148,0.00056751905,0.0006032432,0.0008974907,0.0002717434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001893853,0.00001862789,0.00011106616,0.00002742186,0.000018963543,0.00002540443,0.000016155816,0.98503876,0.00027265152,0.0060245334,0.00026135432,0.008166085],"study_design_scores_gemma":[0.00001622135,0.000027358714,0.000047810234,0.000006669492,0.0000056509075,0.0000101478845,0.000006648193,0.9956285,0.00013276126,0.00357779,0.000535909,0.0000046388236],"about_ca_topic_score_codex":0.0068574683,"about_ca_topic_score_gemma":0.008576358,"teacher_disagreement_score":0.0068574683,"about_ca_system_score_codex":0.0015296267,"about_ca_system_score_gemma":0.002565994,"threshold_uncertainty_score":0.013635099},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41205072,0.0014692849,0.5606632,0.0020434281,0.00028409134,0.0005147189,0.0008585311,0.0004262846,0.02168973],"genre_scores_gemma":[0.89840716,0.0005179359,0.092754364,0.00018801316,0.00010259014,0.0001646113,0.0005411883,0.00010243147,0.007221713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903715,0.00047846604,0.000042048247,0.00016089101,0.00008370344,0.00019776159],"domain_scores_gemma":[0.99732107,0.0019429352,0.00015035819,0.000104589126,0.0001459238,0.00033514673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013880824,0.0011028417,0.0020160365,0.0012947058,0.0011112177,0.0022668152,0.0022194996,0.0023229835,0.0065656677],"category_scores_gemma":[0.0057816035,0.0012111848,0.0012068155,0.0019404144,0.0014138658,0.0037030599,0.0015680313,0.0012509814,0.00041066395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000538781,0.00018497121,0.0010597006,0.00029334862,0.00015443224,0.00018404829,0.0001522844,0.91886175,0.0008030217,0.04657199,0.0042216107,0.026974037],"study_design_scores_gemma":[0.00010980735,0.00012543298,0.00033431145,0.000023230536,0.000046706187,0.00008003051,0.00012925296,0.9245729,0.00035112124,0.0727433,0.0014644443,0.000019493242],"about_ca_topic_score_codex":0.005852324,"about_ca_topic_score_gemma":0.0053343303,"teacher_disagreement_score":0.0065656677,"about_ca_system_score_codex":0.0016978404,"about_ca_system_score_gemma":0.0017063111,"threshold_uncertainty_score":0.021964312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81989425,0.014036142,0.13031112,0.005833247,0.0011233455,0.00021181222,0.004615898,0.0039770566,0.019997086],"genre_scores_gemma":[0.9408738,0.0014787967,0.04979403,0.0004942634,0.00034697133,0.0001640656,0.003836859,0.001137889,0.001873303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98327315,0.008060735,0.001331684,0.0030553944,0.0032059245,0.0010731448],"domain_scores_gemma":[0.65742326,0.29817796,0.0067745065,0.025725722,0.009628088,0.002270354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015135426,0.0013702641,0.0013274356,0.004002226,0.0013750048,0.0023716514,0.0029600607,0.0033834632,0.005737657],"category_scores_gemma":[0.22823985,0.00090767944,0.0010595198,0.0052946676,0.0030620452,0.006368378,0.0020476845,0.003989242,0.0012499165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026855837,0.0012319336,0.069369175,0.0014326049,0.0007108227,0.0005442162,0.0008888763,0.681981,0.007235079,0.023413101,0.028484114,0.18202342],"study_design_scores_gemma":[0.00017629491,0.0004919653,0.024192464,0.00017332881,0.00018659847,0.0010295043,0.0004968358,0.948473,0.003382355,0.017367033,0.003935114,0.00009555216],"about_ca_topic_score_codex":0.0061830166,"about_ca_topic_score_gemma":0.0052238884,"teacher_disagreement_score":0.015135426,"about_ca_system_score_codex":0.0020809458,"about_ca_system_score_gemma":0.0019011744,"threshold_uncertainty_score":0.08004475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009774608,0.0029839172,0.8766768,0.0011286284,0.0007892709,0.00015911029,0.00014864936,0.00035520547,0.107983835],"genre_scores_gemma":[0.42091516,0.00470825,0.47730318,0.00083361106,0.0008691502,0.00060733204,0.0005347759,0.00026128176,0.09396729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996666,0.00013331472,0.000012537088,0.000049064325,0.000107987085,0.000030593565],"domain_scores_gemma":[0.99983156,0.000053122523,0.000014196428,0.000033639448,0.00004995561,0.00001751317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047220464,0.0006501467,0.0007057549,0.0007159717,0.0004992492,0.0016531369,0.0012465958,0.0013138902,0.007805852],"category_scores_gemma":[0.0009556326,0.00023573427,0.0006388303,0.0007998869,0.00052876025,0.0010764556,0.001030542,0.001247274,0.00178011],"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.00005745492,0.000097360324,0.00030282923,0.00016774551,0.000113761176,0.00014752174,0.00006731352,0.26885748,0.002790575,0.595128,0.010993609,0.12127648],"study_design_scores_gemma":[0.000035579313,0.00007271135,0.00013780082,0.000037564194,0.000033586537,0.00009246658,0.0000320283,0.84285873,0.0012879217,0.12275353,0.032642648,0.000015415448],"about_ca_topic_score_codex":0.001131807,"about_ca_topic_score_gemma":0.0012325775,"teacher_disagreement_score":0.007805852,"about_ca_system_score_codex":0.00064145157,"about_ca_system_score_gemma":0.001008824,"threshold_uncertainty_score":0.026113212},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14223814,0.0015724415,0.8225098,0.0010675611,0.00015980296,0.0006399548,0.001195142,0.002442904,0.028174242],"genre_scores_gemma":[0.49253356,0.0005295915,0.49798784,0.0003885746,0.000056822428,0.0006068358,0.0010839985,0.00037483033,0.0064379782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992291,0.0004117225,0.000024244357,0.00010140037,0.000089785215,0.00014368162],"domain_scores_gemma":[0.9961486,0.0031102975,0.00019436608,0.0001223273,0.0002972804,0.00012716047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014675432,0.0015176653,0.0014883853,0.0027109243,0.0008971428,0.0015403801,0.002092417,0.0021749486,0.013021538],"category_scores_gemma":[0.0074415226,0.001273776,0.0009495092,0.002233594,0.0011710107,0.0016553419,0.0012160469,0.0012885929,0.001132055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019222366,0.00012474103,0.0005881701,0.00016753658,0.00003536581,0.000051289928,0.00008142181,0.9279671,0.00052586995,0.0079667615,0.0036089695,0.05869057],"study_design_scores_gemma":[0.00005125557,0.00007597358,0.0000722521,0.000025521458,0.000011654282,0.000011109092,0.00005589634,0.99203414,0.00019511992,0.0068705967,0.0005901371,0.000006284999],"about_ca_topic_score_codex":0.008114025,"about_ca_topic_score_gemma":0.009057824,"teacher_disagreement_score":0.013021538,"about_ca_system_score_codex":0.0017237837,"about_ca_system_score_gemma":0.0023817634,"threshold_uncertainty_score":0.04356134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06854966,0.00063203386,0.9221539,0.00034280107,0.00020601056,0.0004603392,0.0001643296,0.00055332866,0.0069375993],"genre_scores_gemma":[0.4994416,0.00027520495,0.49529517,0.00021094778,0.000059593916,0.0005352441,0.00024951695,0.00017377512,0.0037589697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888307,0.0003808264,0.000064289154,0.00012300373,0.00027485358,0.00027394656],"domain_scores_gemma":[0.99729484,0.0015348555,0.00024689682,0.00019208055,0.0004012237,0.00033005633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024031,0.0012005223,0.001705052,0.0013093905,0.0007567147,0.0015754333,0.0033827655,0.0020686216,0.0033686915],"category_scores_gemma":[0.005538717,0.000862651,0.0013717323,0.0011661879,0.0007370499,0.0013775554,0.0019999403,0.0018638116,0.00036421142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004025416,0.00026155563,0.00075950654,0.00010033248,0.000082860905,0.0000723387,0.00007889252,0.93328977,0.0018909913,0.008120505,0.00084149605,0.05409918],"study_design_scores_gemma":[0.00008916627,0.00016544727,0.00021213686,0.000013378225,0.000026220087,0.000018858118,0.000023526229,0.9961886,0.00081479974,0.0019832025,0.0004462174,0.00001850332],"about_ca_topic_score_codex":0.0048947614,"about_ca_topic_score_gemma":0.006495995,"teacher_disagreement_score":0.0048947614,"about_ca_system_score_codex":0.0017475387,"about_ca_system_score_gemma":0.0023540447,"threshold_uncertainty_score":0.012708962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071928697,0.00010143905,0.9856409,0.00025795345,0.000053724263,0.00009612202,0.000089451896,0.000092428716,0.0064752437],"genre_scores_gemma":[0.35476312,0.00037636206,0.63346523,0.0003258747,0.00021722307,0.0005444431,0.00048948266,0.00024850524,0.009569773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978975,0.0010907731,0.00007667462,0.00023595091,0.00054851494,0.00015048886],"domain_scores_gemma":[0.9958638,0.002701224,0.00018872846,0.0005209539,0.0005485682,0.00017664894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032180073,0.0011909854,0.0017284177,0.001326707,0.00065923785,0.0013439973,0.0027838757,0.0016680952,0.0068250443],"category_scores_gemma":[0.010648592,0.0006605425,0.0015932627,0.0010054762,0.0012863998,0.0021582423,0.0028624334,0.0031962073,0.0006912134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015396433,0.0001462703,0.00040905885,0.00022056159,0.000059817306,0.00011083134,0.00008842668,0.83222705,0.002882643,0.11411811,0.0039827316,0.045600556],"study_design_scores_gemma":[0.000015838285,0.000038016795,0.000077764,0.000011819507,0.0000119504175,0.000021869217,0.000006327564,0.9767989,0.00036183733,0.021622559,0.0010260459,0.000007076108],"about_ca_topic_score_codex":0.0044555822,"about_ca_topic_score_gemma":0.0033667567,"teacher_disagreement_score":0.0068250443,"about_ca_system_score_codex":0.001174562,"about_ca_system_score_gemma":0.0018345078,"threshold_uncertainty_score":0.022831976},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004482266,0.036219176,0.0017875098,0.040499464,0.859738,0.00008091461,0.0005016067,0.00025024032,0.06047486],"genre_scores_gemma":[0.0025794855,0.025975961,0.0010238925,0.009304818,0.85013884,0.00010843594,0.0006071963,0.00033339264,0.10992798],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981811,0.00030722804,0.00024157627,0.00026400635,0.0008093667,0.00019669702],"domain_scores_gemma":[0.98958695,0.0040193936,0.000602732,0.0006946697,0.0028040526,0.0022921383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002083981,0.0024110922,0.002817066,0.0063644145,0.0017091207,0.006158044,0.002094493,0.0049074893,0.14092894],"category_scores_gemma":[0.010930985,0.0006575405,0.0015409258,0.0030724867,0.0015262236,0.0040069995,0.0031921584,0.0038172132,0.047204107],"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.00002724554,0.000029512908,0.00013335975,0.00023788144,0.000011377372,0.00007332895,0.000017102799,0.00007254448,0.00007208202,0.0015673246,0.96518433,0.03257392],"study_design_scores_gemma":[0.000013892197,0.000034629833,0.00057645264,0.0003505858,0.000011194078,0.0003495347,0.000032273474,0.00011425977,0.000040437797,0.0048350603,0.9936307,0.000010980937],"about_ca_topic_score_codex":0.0012963747,"about_ca_topic_score_gemma":0.003909099,"teacher_disagreement_score":0.14092894,"about_ca_system_score_codex":0.0019489133,"about_ca_system_score_gemma":0.00307211,"threshold_uncertainty_score":0.47145426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7704523,0.0013224694,0.20163576,0.0017783827,0.00010017885,0.0003658611,0.00033285518,0.00016636563,0.023845723],"genre_scores_gemma":[0.9782016,0.0002986353,0.020030433,0.00006816408,0.000012640524,0.00005048341,0.000071087044,0.000011578134,0.0012554344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991019,0.00058121263,0.00003588957,0.00006754525,0.000051261,0.00016234568],"domain_scores_gemma":[0.99179137,0.0069775237,0.00040509983,0.00016769156,0.00034409258,0.00031432157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027573642,0.0004944875,0.0012058555,0.0012104518,0.00057027984,0.002128826,0.0012477516,0.0013243638,0.0039695785],"category_scores_gemma":[0.010361099,0.0006270255,0.00044513334,0.0011336915,0.0010101368,0.0018307301,0.00085722574,0.0009621337,0.00013918914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002834466,0.00012678668,0.001536803,0.00008254077,0.00004501333,0.000094338,0.00010899134,0.963373,0.00013772582,0.02027216,0.0011403154,0.012798927],"study_design_scores_gemma":[0.00007562782,0.00006984711,0.000689775,0.000027466176,0.000022360018,0.00001807476,0.0002339939,0.9796363,0.00011708306,0.018552376,0.0005454241,0.0000116253195],"about_ca_topic_score_codex":0.016527573,"about_ca_topic_score_gemma":0.014905181,"teacher_disagreement_score":0.016527573,"about_ca_system_score_codex":0.0023461527,"about_ca_system_score_gemma":0.002638765,"threshold_uncertainty_score":0.032862723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030086167,0.00024175373,0.9638143,0.0002921064,0.00004417968,0.0001181507,0.00007132351,0.00014480103,0.0051872116],"genre_scores_gemma":[0.7075735,0.00035299634,0.28411183,0.00022281297,0.00011021746,0.000312761,0.0001841547,0.00006999617,0.0070617795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994286,0.0002300625,0.00002809784,0.00010966779,0.0001241242,0.00007942797],"domain_scores_gemma":[0.9983626,0.0011417582,0.00009655314,0.0000919945,0.00019489879,0.00011221208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021533638,0.0010097312,0.0016920852,0.00090732443,0.0005153654,0.0011164454,0.002023395,0.0017963193,0.0044325003],"category_scores_gemma":[0.0042772195,0.0006574212,0.00084580976,0.00072129123,0.0009162897,0.0015783919,0.00204307,0.0018060404,0.00026645756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053141484,0.00009710943,0.000327525,0.000060128536,0.000027858265,0.0000393544,0.00003118157,0.96162975,0.00043658816,0.011395298,0.0006666504,0.02523539],"study_design_scores_gemma":[0.000008861391,0.000025516507,0.00003422646,0.0000034259658,0.000005743035,0.0000055112105,0.0000024452795,0.99640864,0.00007164046,0.0033098126,0.000121971134,0.0000022033817],"about_ca_topic_score_codex":0.0059340694,"about_ca_topic_score_gemma":0.005718991,"teacher_disagreement_score":0.0059340694,"about_ca_system_score_codex":0.0012673881,"about_ca_system_score_gemma":0.0016496904,"threshold_uncertainty_score":0.014828205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14004906,0.0007167099,0.8499814,0.00061899493,0.0001292226,0.00018287668,0.00012839402,0.00028031398,0.00791299],"genre_scores_gemma":[0.674318,0.00026793763,0.31957445,0.00016303832,0.0000842895,0.0002816138,0.00020507885,0.000089882684,0.005015597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.0003222125,0.000022442706,0.00008602938,0.00011092048,0.00007884358],"domain_scores_gemma":[0.99790925,0.0016273081,0.00013558225,0.00006872566,0.00016468107,0.00009439727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840085,0.0006029121,0.001535913,0.0011043556,0.0007028342,0.0007312267,0.0016876189,0.0013948552,0.002318157],"category_scores_gemma":[0.0046057887,0.00054804474,0.0006939996,0.0008203491,0.0006457714,0.001123229,0.00090231723,0.0009501047,0.00015852718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013452803,0.00012353629,0.0004317947,0.000061987754,0.000033208053,0.00004124367,0.000045524852,0.96637326,0.0009203024,0.0075896145,0.0011676217,0.023077298],"study_design_scores_gemma":[0.000014494967,0.000025943584,0.000036729405,0.0000023766122,0.0000044420103,0.0000047522885,0.00000523258,0.99844235,0.000070434726,0.0012613423,0.00013008785,0.0000019234449],"about_ca_topic_score_codex":0.0090886485,"about_ca_topic_score_gemma":0.00807229,"teacher_disagreement_score":0.0090886485,"about_ca_system_score_codex":0.0011159643,"about_ca_system_score_gemma":0.0016905947,"threshold_uncertainty_score":0.018071473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022282868,0.0017752977,0.9859466,0.0007332961,0.00013829883,0.0000319054,0.00005215718,0.000030991472,0.009063088],"genre_scores_gemma":[0.26887855,0.0066631883,0.6988089,0.0004979587,0.0007441236,0.0006312498,0.00024059485,0.0002311092,0.023304379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990325,0.00053001085,0.0000375737,0.00007685844,0.00024985705,0.00007330255],"domain_scores_gemma":[0.99660945,0.0026154853,0.00026279426,0.00013633263,0.00031019264,0.000065797016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023625607,0.0012813336,0.0012050064,0.001573545,0.0008409058,0.0026192826,0.0022893776,0.0022006596,0.0050912923],"category_scores_gemma":[0.00985723,0.0008039603,0.00149806,0.0023730914,0.0020478892,0.0029238015,0.0017288662,0.0036261517,0.0006778312],"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.000008253929,0.000026611962,0.00014115425,0.000089405,0.000027900987,0.000020655762,0.000051473588,0.42069522,0.00016333471,0.56399465,0.0018084238,0.012972954],"study_design_scores_gemma":[0.000008241096,0.000008720228,0.000044812798,0.000028775063,0.000009961196,0.000015277657,0.000016573955,0.76361287,0.000101457306,0.23298171,0.0031632443,0.000008344756],"about_ca_topic_score_codex":0.005578084,"about_ca_topic_score_gemma":0.0044390154,"teacher_disagreement_score":0.005578084,"about_ca_system_score_codex":0.0020304914,"about_ca_system_score_gemma":0.0019915057,"threshold_uncertainty_score":0.017032027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04939164,0.00041841195,0.94317,0.00029672962,0.00012151007,0.0002427664,0.00017059455,0.00097547995,0.0052128457],"genre_scores_gemma":[0.30350032,0.00021826455,0.6908835,0.00011692679,0.00006620789,0.00055266137,0.00041780376,0.00016558579,0.004078672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995981,0.00016395569,0.000020915975,0.00006744217,0.00010632691,0.000043249023],"domain_scores_gemma":[0.9989832,0.0006413883,0.000057343193,0.00008513861,0.00016229652,0.00007049641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392398,0.00054783607,0.0013100179,0.00081103545,0.0008001313,0.00069775013,0.0016203483,0.0010481457,0.0030925984],"category_scores_gemma":[0.003037367,0.00049304095,0.00062074466,0.001054259,0.0003990668,0.0012725028,0.0013194971,0.00080281036,0.000446138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024576604,0.00021910142,0.00061786664,0.000081259575,0.000043518143,0.000056587247,0.00006597234,0.8442339,0.0015152532,0.008730077,0.003765133,0.1404257],"study_design_scores_gemma":[0.00003470851,0.000033560085,0.00005635639,0.0000026950386,0.000005563084,0.000008250735,0.000007918138,0.9976611,0.00011752863,0.0016306819,0.0004388193,0.0000028195102],"about_ca_topic_score_codex":0.00755496,"about_ca_topic_score_gemma":0.009362407,"teacher_disagreement_score":0.00755496,"about_ca_system_score_codex":0.00079285714,"about_ca_system_score_gemma":0.0014067522,"threshold_uncertainty_score":0.01502192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28975987,0.0006041178,0.66269827,0.0013236633,0.00044413083,0.0003981406,0.00017767497,0.0036232679,0.04097095],"genre_scores_gemma":[0.7318702,0.00009827109,0.2615941,0.0003744679,0.00006701724,0.00026508787,0.00023011935,0.00038086617,0.0051199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986141,0.00060500385,0.000039428403,0.00018463774,0.00031589883,0.00024093957],"domain_scores_gemma":[0.99758077,0.0014971503,0.000081785605,0.00038853832,0.00031597822,0.0001357679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017243491,0.0007451043,0.0017909877,0.00084812153,0.001147319,0.0011630036,0.0025456038,0.00161668,0.008611028],"category_scores_gemma":[0.0044354745,0.00067935296,0.0010110788,0.0012376385,0.0009257875,0.0016084802,0.0016580502,0.001419781,0.00094052573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049343746,0.00050963304,0.0011939838,0.0001474721,0.000115225404,0.0000929539,0.00016461105,0.8608679,0.0073272567,0.023473399,0.0038794747,0.101734586],"study_design_scores_gemma":[0.000030331523,0.000046849844,0.00010771574,0.0000030903946,0.000012430772,0.000009912972,0.000021321648,0.9949936,0.0006587358,0.003622686,0.00048954,0.0000037414286],"about_ca_topic_score_codex":0.0059790886,"about_ca_topic_score_gemma":0.010754398,"teacher_disagreement_score":0.008611028,"about_ca_system_score_codex":0.0014277379,"about_ca_system_score_gemma":0.0020554194,"threshold_uncertainty_score":0.028806746},"labels":[],"label_agreement":null}]}