{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"24d4a056ff7e","filters":{"venue":"International Journal of Metaheuristics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nabil Nahas","is_ca":false},{"name":"Mustapha Nourelfath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03353671793684426,"gpt":0.2730317602403623,"spread":0.239495042303518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006042895,0.0001795616,0.0003554352,0.0001455352,0.00005094176,0.00009675969,0.0003793313,0.00007962251,0.00003038462],"category_scores_gemma":[0.001114321,0.0001574399,0.000218056,0.00005643604,0.00003357786,0.000182434,0.00002805045,0.0002235262,0.000003939495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008268729,"about_ca_system_score_gemma":0.00002193619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.216116e-7,"about_ca_topic_score_gemma":7.081973e-7,"domain_scores_codex":[0.9985836,0.00002670945,0.0006744268,0.0001146103,0.0004335167,0.0001671901],"domain_scores_gemma":[0.998274,0.0003924732,0.00035454,0.0001032945,0.0007965275,0.00007916075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003702485,0.0000484498,0.00002024242,0.00003767253,0.0008140307,0.000003358593,0.0000593113,0.9885485,0.0001625184,0.00770781,0.0006956791,0.001865391],"study_design_scores_gemma":[0.001833725,0.0002280077,0.00005401296,0.00004271133,0.001227535,0.00005209736,0.00002336171,0.9091272,0.004407951,0.05149243,0.03119356,0.0003173644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002138729,0.0002348503,0.9920673,0.0001060375,0.004327121,0.000134838,0.00003480859,0.00006969786,0.0008866442],"genre_scores_gemma":[0.8118135,0.0001692416,0.1863404,0.00004643426,0.001496622,0.00001056817,0.00003421929,0.000043479,0.00004554167],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8096747,"threshold_uncertainty_score":0.6420214,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Meryem Cheraitia","is_ca":false},{"name":"Salim Haddadi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1799146154358367,"gpt":0.428892417151283,"spread":0.2489778017154463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00715936,0.0001351991,0.0002823228,0.0003979785,0.0001999946,0.0003232873,0.001563863,0.00006972445,0.0001431455],"category_scores_gemma":[0.03349225,0.00006158485,0.0003297447,0.0003747084,0.0001385253,0.0003051463,0.00007531747,0.000194951,0.00006099596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007310171,"about_ca_system_score_gemma":0.0001985678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006178724,"about_ca_topic_score_gemma":0.000002305255,"domain_scores_codex":[0.9963588,0.0001637796,0.001287739,0.0002014316,0.001746359,0.0002419131],"domain_scores_gemma":[0.9805208,0.01216566,0.001110337,0.000281735,0.005803005,0.0001184143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001575393,0.000517161,0.01060435,0.00001115471,0.004266797,0.0001332015,0.001358439,0.5819227,0.02086104,0.06311371,0.02660929,0.2890268],"study_design_scores_gemma":[0.007404155,0.0005052736,0.004093769,0.0005060202,0.0007965938,0.0005438767,0.001243504,0.2774543,0.007739808,0.4290588,0.2699942,0.0006597042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07067696,0.0006902278,0.9118166,0.01231203,0.004036172,0.0001449621,0.00007329042,0.00002425055,0.0002255299],"genre_scores_gemma":[0.9391239,0.00008846346,0.0588867,0.0002201605,0.0009197124,0.000002212328,0.000001401534,0.00001583701,0.000741609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8684469,"threshold_uncertainty_score":0.9746491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hamed Samarghandi","is_ca":true},{"name":"Farzad Firouzi Jahantigh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03060021369642182,"gpt":0.2598021266389843,"spread":0.2292019129425625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002445515,0.0001039139,0.0001453726,0.00007707922,0.00002645111,0.00002788089,0.000217404,0.00004718993,0.00002746116],"category_scores_gemma":[0.0002231691,0.00009686133,0.00008565938,0.00003739553,0.00002875865,0.0001610202,0.00001616402,0.0001213571,0.000006750448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009854167,"about_ca_system_score_gemma":0.00002089214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002232436,"about_ca_topic_score_gemma":0.000002458372,"domain_scores_codex":[0.9991186,0.00001481743,0.000437164,0.00007801899,0.000226309,0.0001251441],"domain_scores_gemma":[0.9991313,0.00007881213,0.0001741105,0.00008445619,0.0004686319,0.0000626608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001283434,0.00009118071,0.000190479,0.00003445826,0.0002344084,0.00001519504,0.0005356782,0.9862113,0.0002729607,0.002145811,0.0003237737,0.009816404],"study_design_scores_gemma":[0.003934584,0.0005614919,0.004090859,0.0001216393,0.0004643298,0.0002158854,0.0004284086,0.8278152,0.04056022,0.1062331,0.01475721,0.0008169859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02127824,0.0001437662,0.9763386,0.00005247607,0.00106473,0.0001050291,0.00007633226,0.00005398214,0.0008868599],"genre_scores_gemma":[0.831154,0.00009028648,0.1685545,0.00002028332,0.00008656832,0.000005380555,0.00001774987,0.00001261128,0.00005853233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8098758,"threshold_uncertainty_score":0.394989,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Valerie Danielle Justafort","is_ca":true},{"name":"Ronald Beaubrun","is_ca":true},{"name":"Samuel Pierre","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05038048531903208,"gpt":0.2988195364816434,"spread":0.2484390511626114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001561045,0.0001205808,0.0001817903,0.0002406846,0.0000213428,0.0002011549,0.001274349,0.00004883448,0.000001050871],"category_scores_gemma":[0.00005620499,0.00009677441,0.00006710018,0.00009382334,0.00003278453,0.00004831448,0.0001812758,0.0002030102,6.670069e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003030524,"about_ca_system_score_gemma":0.00006664341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003248257,"about_ca_topic_score_gemma":0.000002775677,"domain_scores_codex":[0.9981415,0.0001897713,0.0005240176,0.0002248122,0.0007516391,0.0001683068],"domain_scores_gemma":[0.9988707,0.00007164702,0.000228879,0.0002109303,0.0004399527,0.0001778322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001144811,0.00056973,0.0006536954,0.000005751919,0.00007015765,0.00005464409,0.001455976,0.9043274,0.0003766619,0.002276839,0.00002112716,0.09007357],"study_design_scores_gemma":[0.0009412033,0.0005601141,0.0007831157,0.0000198856,0.00001317074,0.00005651982,0.0003683475,0.9947578,0.000606002,0.000877884,0.0008989503,0.0001169644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3857705,0.00003604068,0.6132874,0.0003295845,0.000384762,0.00008970503,0.000001207131,0.00001183262,0.00008901738],"genre_scores_gemma":[0.865533,0.000003672286,0.1339439,0.00006368901,0.0004159865,0.000003572674,0.000008329793,0.000006648123,0.00002118707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4797625,"threshold_uncertainty_score":0.3946346,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Salim Haddadi","is_ca":false},{"name":"Meryem Cheraitia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1799146154358367,"gpt":0.428892417151283,"spread":0.2489778017154463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00715936,0.0001351991,0.0002823228,0.0003979785,0.0001999946,0.0003232873,0.001563863,0.00006972445,0.0001431455],"category_scores_gemma":[0.03349225,0.00006158485,0.0003297447,0.0003747084,0.0001385253,0.0003051463,0.00007531747,0.000194951,0.00006099596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007310171,"about_ca_system_score_gemma":0.0001985678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006178724,"about_ca_topic_score_gemma":0.000002305255,"domain_scores_codex":[0.9963588,0.0001637796,0.001287739,0.0002014316,0.001746359,0.0002419131],"domain_scores_gemma":[0.9805208,0.01216566,0.001110337,0.000281735,0.005803005,0.0001184143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001575393,0.000517161,0.01060435,0.00001115471,0.004266797,0.0001332015,0.001358439,0.5819227,0.02086104,0.06311371,0.02660929,0.2890268],"study_design_scores_gemma":[0.007404155,0.0005052736,0.004093769,0.0005060202,0.0007965938,0.0005438767,0.001243504,0.2774543,0.007739808,0.4290588,0.2699942,0.0006597042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07067696,0.0006902278,0.9118166,0.01231203,0.004036172,0.0001449621,0.00007329042,0.00002425055,0.0002255299],"genre_scores_gemma":[0.9391239,0.00008846346,0.0588867,0.0002201605,0.0009197124,0.000002212328,0.000001401534,0.00001583701,0.000741609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8684469,"threshold_uncertainty_score":0.9746491,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Computer science; Cloud computing; Mathematical optimization; Artificial intelligence; Mathematics","authors":[{"name":"Samuel Pierre","is_ca":true},{"name":"Marieme Diallo","is_ca":true},{"name":"Alejandro Quintero","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03676554834835966,"gpt":0.2914373397226839,"spread":0.2546717913743243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443327,0.0001773953,0.0003046959,0.00005771895,0.00004829999,0.0001212618,0.0006820569,0.0001217165,0.000005040751],"category_scores_gemma":[0.001281569,0.0001627743,0.0001630688,0.0001523041,0.00009713406,0.0002049236,0.0001127809,0.000619808,0.000002134274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008735061,"about_ca_system_score_gemma":0.00003296329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.579182e-7,"about_ca_topic_score_gemma":6.316409e-7,"domain_scores_codex":[0.9984245,0.00002293985,0.000621649,0.0001541269,0.0004395317,0.0003372473],"domain_scores_gemma":[0.9986196,0.0004901121,0.0001659569,0.00009818465,0.0004880581,0.0001380506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001595017,0.00003304883,0.0002340428,0.00002768568,0.000298865,0.00004007799,0.0001710972,0.9678821,0.0003668911,0.001693601,0.001054968,0.02803813],"study_design_scores_gemma":[0.0009471077,0.0002059634,0.00007144122,0.00002575209,0.00003231127,0.00004468797,0.0008517156,0.9938919,0.0004085487,0.0004193987,0.002936576,0.0001645973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03359199,0.0005558083,0.9642903,0.0002948868,0.0007957412,0.0001793415,0.00004400836,0.0001377881,0.0001102062],"genre_scores_gemma":[0.8102043,0.0001499967,0.1880887,0.00009389183,0.001394053,0.000007296348,0.00001200687,0.00003929885,0.00001047623],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7766123,"threshold_uncertainty_score":0.6637744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}