{"meta":{"query_hash":"24d4a056ff7e","filters":{"venue":"International Journal of Metaheuristics"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/24d4a056ff7e","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Metaheuristics"},"results":[{"id":"W2081796443","doi":"10.1504/ijmheur.2011.041197","title":"A particle swarm optimisation for fuzzy dynamic facility layout problem","year":2011,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Particle swarm optimization; Computer science; Fuzzy logic; Ranking (information retrieval); Mathematical optimization; Product (mathematics); Order (exchange); Service (business); Operations research; Algorithm; Engineering; Artificial intelligence; Mathematics","score_opus":0.03060021369642182,"score_gpt":0.25980212663898433,"score_spread":0.2292019129425625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081796443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021278236,0.00014376621,0.97633857,0.000052476073,0.0010647298,0.00010502912,0.00007633226,0.000053982145,0.0008868599],"genre_scores_gemma":[0.83115405,0.000090286485,0.16855453,0.00002028332,0.00008656832,0.0000053805547,0.00001774987,0.00001261128,0.000058532325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911857,0.000014817435,0.00043716404,0.000078018995,0.000226309,0.0001251441],"domain_scores_gemma":[0.9991313,0.00007881213,0.00017411051,0.00008445619,0.0004686319,0.0000626608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002445515,0.00010391393,0.00014537263,0.00007707922,0.000026451109,0.000027880893,0.00021740397,0.00004718993,0.000027461156],"category_scores_gemma":[0.00022316913,0.00009686133,0.00008565938,0.000037395534,0.000028758652,0.00016102016,0.000016164016,0.000121357116,0.000006750448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012834338,0.000091180715,0.00019047904,0.000034458262,0.00023440836,0.000015195036,0.00053567823,0.9862113,0.0002729607,0.0021458105,0.0003237737,0.009816404],"study_design_scores_gemma":[0.0039345836,0.0005614919,0.0040908586,0.0001216393,0.00046432982,0.00021588539,0.0004284086,0.82781523,0.040560216,0.10623315,0.014757211,0.0008169859],"about_ca_topic_score_codex":0.000002232436,"about_ca_topic_score_gemma":0.0000024583721,"teacher_disagreement_score":0.80987585,"about_ca_system_score_codex":0.00009854167,"about_ca_system_score_gemma":0.000020892143,"threshold_uncertainty_score":0.39498904},"labels":[],"label_agreement":null},{"id":"W2148047235","doi":"10.1504/ijmheur.2014.068904","title":"Nonlinear threshold accepting meta-heuristic for combinatorial optimisation problems","year":2014,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Mathematical optimization; Neighbourhood (mathematics); Hill climbing; Simulated annealing; Heuristic; Nonlinear system; Local search (optimization); Algorithm; Filter (signal processing); Tabu search; Mathematics; Artificial intelligence","score_opus":0.03353671793684426,"score_gpt":0.2730317602403623,"score_spread":0.23949504230351804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148047235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002138729,0.00023485032,0.9920673,0.000106037485,0.004327121,0.000134838,0.00003480859,0.00006969786,0.00088664424],"genre_scores_gemma":[0.8118135,0.00016924163,0.18634039,0.000046434256,0.0014966215,0.000010568166,0.00003421929,0.000043478998,0.000045541667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858356,0.000026709455,0.0006744268,0.00011461028,0.00043351666,0.00016719013],"domain_scores_gemma":[0.998274,0.00039247316,0.00035453995,0.000103294515,0.00079652754,0.000079160745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060428947,0.00017956161,0.0003554352,0.00014553517,0.000050941762,0.000096759686,0.0003793313,0.000079622514,0.00003038462],"category_scores_gemma":[0.0011143206,0.00015743992,0.00021805598,0.000056436038,0.00003357786,0.000182434,0.000028050446,0.00022352616,0.0000039394954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037024845,0.000048449798,0.000020242418,0.00003767253,0.0008140307,0.0000033585934,0.000059311304,0.9885485,0.00016251836,0.00770781,0.0006956791,0.0018653908],"study_design_scores_gemma":[0.001833725,0.00022800767,0.000054012962,0.000042711334,0.0012275352,0.000052097363,0.00002336171,0.90912724,0.0044079507,0.051492434,0.031193564,0.0003173644],"about_ca_topic_score_codex":9.216116e-7,"about_ca_topic_score_gemma":7.0819726e-7,"teacher_disagreement_score":0.80967474,"about_ca_system_score_codex":0.00008268729,"about_ca_system_score_gemma":0.000021936192,"threshold_uncertainty_score":0.64202136},"labels":[],"label_agreement":null},{"id":"W2401996179","doi":"10.1504/ijmheur.2015.074245","title":"An iterated local search approach for carbon footprint optimisation in an intercloud environment","year":2015,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"American Society of Heating, Refrigerating and Air-Conditioning Engineers","keywords":"Computer science; Carbon footprint; Iterated local search; Virtual machine; Mathematical optimization; Workload; Reduction (mathematics); Heuristic; Iterated function; Local search (optimization); Algorithm; Mathematics; Greenhouse gas; Artificial intelligence","score_opus":0.05038048531903208,"score_gpt":0.29881953648164344,"score_spread":0.24843905116261136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401996179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38577047,0.000036040685,0.6132874,0.00032958447,0.00038476198,0.000089705034,0.0000012071309,0.000011832619,0.00008901738],"genre_scores_gemma":[0.865533,0.0000036722859,0.13394393,0.00006368901,0.0004159865,0.0000035726737,0.000008329793,0.0000066481234,0.00002118707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814147,0.0001897713,0.0005240176,0.00022481222,0.0007516391,0.00016830684],"domain_scores_gemma":[0.99887073,0.000071647024,0.000228879,0.00021093029,0.00043995268,0.00017783219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015610452,0.00012058083,0.00018179032,0.00024068463,0.000021342801,0.00020115492,0.0012743486,0.00004883448,0.000001050871],"category_scores_gemma":[0.000056204994,0.000096774405,0.00006710018,0.00009382334,0.000032784526,0.000048314483,0.00018127583,0.00020301019,6.670069e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011448113,0.00056973,0.00065369543,0.0000057519187,0.00007015765,0.000054644093,0.001455976,0.9043274,0.00037666195,0.002276839,0.000021127158,0.09007357],"study_design_scores_gemma":[0.0009412033,0.0005601141,0.0007831157,0.000019885603,0.000013170739,0.000056519824,0.0003683475,0.99475783,0.000606002,0.00087788404,0.0008989503,0.00011696438],"about_ca_topic_score_codex":0.00003248257,"about_ca_topic_score_gemma":0.0000027756769,"teacher_disagreement_score":0.47976252,"about_ca_system_score_codex":0.00030305242,"about_ca_system_score_gemma":0.000066643406,"threshold_uncertainty_score":0.39463457},"labels":[],"label_agreement":null},{"id":"W2555091906","doi":"10.1504/ijmheur.2016.080266","title":"Simulated annealing for the uncapacitated exam scheduling problem","year":2016,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Computer science; Scheduling (production processes); Benchmark (surveying); Mathematical optimization; Heuristic; Job shop scheduling; Graph; Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Schedule","score_opus":0.1799146154358367,"score_gpt":0.428892417151283,"score_spread":0.2489778017154463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555091906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07067696,0.00069022784,0.9118166,0.012312028,0.004036172,0.00014496209,0.000073290415,0.000024250552,0.00022552986],"genre_scores_gemma":[0.9391239,0.00008846346,0.058886703,0.00022016051,0.00091971236,0.0000022123284,0.0000014015344,0.000015837013,0.000741609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635875,0.00016377961,0.0012877387,0.0002014316,0.0017463589,0.00024191313],"domain_scores_gemma":[0.98052084,0.012165661,0.001110337,0.00028173503,0.005803005,0.0001184143],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0071593598,0.00013519911,0.00028232284,0.0003979785,0.00019999457,0.00032328733,0.0015638631,0.000069724454,0.00014314553],"category_scores_gemma":[0.033492252,0.00006158485,0.00032974465,0.00037470835,0.00013852531,0.0003051463,0.00007531747,0.00019495098,0.00006099596],"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.0015753931,0.000517161,0.010604353,0.000011154712,0.004266797,0.00013320147,0.0013584386,0.58192265,0.020861045,0.06311371,0.026609292,0.2890268],"study_design_scores_gemma":[0.0074041546,0.00050527364,0.0040937685,0.00050602015,0.00079659384,0.0005438767,0.0012435035,0.27745432,0.0077398084,0.4290588,0.26999417,0.0006597042],"about_ca_topic_score_codex":0.0000061787237,"about_ca_topic_score_gemma":0.0000023052546,"teacher_disagreement_score":0.86844695,"about_ca_system_score_codex":0.00007310171,"about_ca_system_score_gemma":0.00019856782,"threshold_uncertainty_score":0.9746491},"labels":[],"label_agreement":null},{"id":"W3028414821","doi":"10.1504/ijmheur.2020.10029590","title":"A Tabu search approach for a virtual networks splitting strategy across multiple cloud providers","year":2020,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Computer science; Cloud computing; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.036765548348359656,"score_gpt":0.29143733972268393,"score_spread":0.2546717913743243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028414821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033591986,0.0005558083,0.96429026,0.00029488676,0.0007957412,0.00017934153,0.000044008357,0.00013778808,0.00011020617],"genre_scores_gemma":[0.81020427,0.00014999666,0.18808872,0.00009389183,0.0013940529,0.000007296348,0.000012006872,0.000039298855,0.000010476234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842453,0.00002293985,0.00062164903,0.00015412694,0.0004395317,0.00033724733],"domain_scores_gemma":[0.9986196,0.00049011206,0.00016595688,0.00009818465,0.00048805808,0.00013805056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034433266,0.00017739528,0.00030469586,0.000057718946,0.000048299986,0.0001212618,0.0006820569,0.00012171645,0.0000050407507],"category_scores_gemma":[0.0012815687,0.00016277433,0.00016306876,0.00015230407,0.00009713406,0.00020492356,0.00011278094,0.000619808,0.000002134274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015950171,0.000033048826,0.00023404285,0.00002768568,0.00029886502,0.00004007799,0.00017109723,0.9678821,0.00036689106,0.0016936014,0.001054968,0.028038133],"study_design_scores_gemma":[0.00094710774,0.00020596341,0.000071441216,0.000025752088,0.000032311265,0.000044687975,0.00085171557,0.9938919,0.00040854872,0.00041939874,0.0029365756,0.0001645973],"about_ca_topic_score_codex":8.579182e-7,"about_ca_topic_score_gemma":6.3164094e-7,"teacher_disagreement_score":0.7766123,"about_ca_system_score_codex":0.000087350614,"about_ca_system_score_gemma":0.000032963286,"threshold_uncertainty_score":0.66377443},"labels":[],"label_agreement":null},{"id":"W4240363831","doi":"10.1504/ijmheur.2016.10001113","title":"Simulated annealing for the uncapacitated exam scheduling problem","year":2016,"lang":"en","type":"article","venue":"International Journal of Metaheuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Computer science; Scheduling (production processes); Benchmark (surveying); Mathematical optimization; Heuristic; Job shop scheduling; Graph; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Schedule","score_opus":0.1799146154358367,"score_gpt":0.428892417151283,"score_spread":0.2489778017154463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240363831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07067696,0.00069022784,0.9118166,0.012312028,0.004036172,0.00014496209,0.000073290415,0.000024250552,0.00022552986],"genre_scores_gemma":[0.9391239,0.00008846346,0.058886703,0.00022016051,0.00091971236,0.0000022123284,0.0000014015344,0.000015837013,0.000741609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635875,0.00016377961,0.0012877387,0.0002014316,0.0017463589,0.00024191313],"domain_scores_gemma":[0.98052084,0.012165661,0.001110337,0.00028173503,0.005803005,0.0001184143],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0071593598,0.00013519911,0.00028232284,0.0003979785,0.00019999457,0.00032328733,0.0015638631,0.000069724454,0.00014314553],"category_scores_gemma":[0.033492252,0.00006158485,0.00032974465,0.00037470835,0.00013852531,0.0003051463,0.00007531747,0.00019495098,0.00006099596],"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.0015753931,0.000517161,0.010604353,0.000011154712,0.004266797,0.00013320147,0.0013584386,0.58192265,0.020861045,0.06311371,0.026609292,0.2890268],"study_design_scores_gemma":[0.0074041546,0.00050527364,0.0040937685,0.00050602015,0.00079659384,0.0005438767,0.0012435035,0.27745432,0.0077398084,0.4290588,0.26999417,0.0006597042],"about_ca_topic_score_codex":0.0000061787237,"about_ca_topic_score_gemma":0.0000023052546,"teacher_disagreement_score":0.86844695,"about_ca_system_score_codex":0.00007310171,"about_ca_system_score_gemma":0.00019856782,"threshold_uncertainty_score":0.9746491},"labels":[],"label_agreement":null}]}