{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001317776,0.001213449,0.001224324,0.001358148,0.0004858447,0.0013862,0.001925847,0.001676076,0.002424716],"category_scores_gemma":[0.003252929,0.0005305146,0.001314494,0.001463686,0.0008950176,0.0009615119,0.0008515165,0.001508181,0.0004196235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256739,"about_ca_system_score_gemma":0.001271558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002864725,"about_ca_topic_score_gemma":0.002872462,"domain_scores_codex":[0.9993663,0.00027285,0.0000457366,0.00007937699,0.0001659606,0.00006975097],"domain_scores_gemma":[0.9986022,0.001011865,0.0001314845,0.0000837461,0.0001198441,0.00005080751],"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.00004429851,0.00004835182,0.0003870246,0.00008853642,0.0000564984,0.00004751358,0.00004198785,0.9659957,0.00068076,0.006784317,0.0004855045,0.02533939],"study_design_scores_gemma":[0.00001502616,0.00003328677,0.00006064455,0.0000146261,0.00001307343,0.00001451546,0.00001020707,0.995559,0.0002693993,0.003423242,0.0005824295,0.000004578282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04237328,0.001126111,0.9463798,0.0002922645,0.00008788362,0.0002098202,0.0001253807,0.0005484127,0.008857198],"genre_scores_gemma":[0.4714342,0.0008557279,0.5211944,0.0002763367,0.00006899206,0.0007723039,0.0003508769,0.0001858848,0.004861226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002864725,"threshold_uncertainty_score":0.009118259,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009525279,0.0009267732,0.0008895471,0.0007207762,0.0005236796,0.0008681758,0.0009698583,0.001031432,0.002718065],"category_scores_gemma":[0.003757344,0.0005909497,0.000902052,0.000903594,0.0007102546,0.0007422744,0.0005377277,0.001442605,0.0003830314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173242,"about_ca_system_score_gemma":0.001631683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008501755,"about_ca_topic_score_gemma":0.008661541,"domain_scores_codex":[0.9992319,0.000457201,0.00002330303,0.00009808716,0.0001159576,0.00007347566],"domain_scores_gemma":[0.9982851,0.001334121,0.0001197627,0.00009839108,0.0001004713,0.00006217235],"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.00004257532,0.00002306336,0.0001362176,0.00002926817,0.00001684361,0.00001453181,0.0000257501,0.9866167,0.0004319327,0.004217179,0.0004996702,0.007946243],"study_design_scores_gemma":[0.00001150312,0.00001710288,0.00006026486,0.000004564281,0.000005146098,0.000004716366,0.000006433218,0.9952992,0.0001949422,0.003751006,0.0006422357,0.00000285133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09968962,0.001589768,0.8805912,0.0008980543,0.0001415654,0.0002309402,0.0003657869,0.0008150212,0.01567804],"genre_scores_gemma":[0.5939101,0.0007936964,0.3985772,0.0002115359,0.00006206483,0.0004500921,0.0005860021,0.0002125497,0.005196781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008501755,"threshold_uncertainty_score":0.01690459,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095321,0.0007212486,0.0008999848,0.0005374034,0.0005092662,0.0009002172,0.0008119231,0.001823919,0.001900332],"category_scores_gemma":[0.001597608,0.000359055,0.0006913827,0.0006994429,0.0005182123,0.0006182136,0.0005872703,0.0007535621,0.0001675989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006551978,"about_ca_system_score_gemma":0.001092437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007164138,"about_ca_topic_score_gemma":0.003156721,"domain_scores_codex":[0.9997185,0.0001068497,0.00001162463,0.00005711535,0.00007039333,0.00003537905],"domain_scores_gemma":[0.9996568,0.0002147249,0.00003671517,0.00001601601,0.00005358441,0.00002207663],"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.00002901571,0.00002241797,0.0002193675,0.00004083926,0.00001485007,0.00004852243,0.00002348183,0.9834313,0.0005846216,0.004716604,0.0004798676,0.01038916],"study_design_scores_gemma":[0.00001295809,0.00001899433,0.00005928271,0.000003150603,0.000003428549,0.000008165569,0.000004479622,0.9986035,0.00009642588,0.0008902641,0.0002966791,0.000002714617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0317158,0.0003697189,0.961794,0.0003314009,0.00008783596,0.0001102222,0.00008016615,0.0001103853,0.00540042],"genre_scores_gemma":[0.6257204,0.0005182352,0.3673272,0.0001361517,0.00008715961,0.0003867041,0.000204708,0.0000273754,0.005592045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007164138,"threshold_uncertainty_score":0.01424491,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000771538,0.0007185907,0.001000997,0.0006391911,0.0003164731,0.0006313171,0.001450743,0.001225784,0.002116167],"category_scores_gemma":[0.001422867,0.000359957,0.0007054909,0.00073874,0.0006555872,0.0006887222,0.0007931201,0.0006978379,0.0002710773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006852974,"about_ca_system_score_gemma":0.001003696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003682016,"about_ca_topic_score_gemma":0.003221347,"domain_scores_codex":[0.9997033,0.0001321274,0.000009198615,0.00003818447,0.00007840476,0.00003868148],"domain_scores_gemma":[0.9994975,0.000348721,0.0000476466,0.00002179123,0.0000609993,0.0000232653],"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.00002068075,0.00002295527,0.0001148666,0.00004125114,0.00002347556,0.00004547632,0.00002321397,0.9823067,0.000638537,0.005628641,0.0002367285,0.0108975],"study_design_scores_gemma":[0.000009675907,0.0000206467,0.00002480935,0.00000373845,0.000004468122,0.000006920006,0.000006920079,0.9980642,0.0001057194,0.001540947,0.0002096407,0.000002283204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01647466,0.000294058,0.9792859,0.000147763,0.00002848743,0.00004582953,0.00002213757,0.0001385437,0.003562608],"genre_scores_gemma":[0.5634224,0.0004839032,0.4304038,0.0002060308,0.00006129835,0.000445979,0.00008961077,0.0001043654,0.004782564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003682016,"threshold_uncertainty_score":0.007321179,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009525279,0.0009267732,0.0008895471,0.0007207762,0.0005236796,0.0008681758,0.0009698583,0.001031432,0.002718065],"category_scores_gemma":[0.003757344,0.0005909497,0.000902052,0.000903594,0.0007102546,0.0007422744,0.0005377277,0.001442605,0.0003830314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173242,"about_ca_system_score_gemma":0.001631683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008501755,"about_ca_topic_score_gemma":0.008661541,"domain_scores_codex":[0.9992319,0.000457201,0.00002330303,0.00009808716,0.0001159576,0.00007347566],"domain_scores_gemma":[0.9982851,0.001334121,0.0001197627,0.00009839108,0.0001004713,0.00006217235],"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.00004257532,0.00002306336,0.0001362176,0.00002926817,0.00001684361,0.00001453181,0.0000257501,0.9866167,0.0004319327,0.004217179,0.0004996702,0.007946243],"study_design_scores_gemma":[0.00001150312,0.00001710288,0.00006026486,0.000004564281,0.000005146098,0.000004716366,0.000006433218,0.9952992,0.0001949422,0.003751006,0.0006422357,0.00000285133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09968962,0.001589768,0.8805912,0.0008980543,0.0001415654,0.0002309402,0.0003657869,0.0008150212,0.01567804],"genre_scores_gemma":[0.5939101,0.0007936964,0.3985772,0.0002115359,0.00006206483,0.0004500921,0.0005860021,0.0002125497,0.005196781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008501755,"threshold_uncertainty_score":0.01690459,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240003,0.000942299,0.0009151145,0.001272132,0.0007514188,0.001118083,0.001545421,0.001479067,0.005818541],"category_scores_gemma":[0.002151374,0.0005039191,0.000871051,0.001268572,0.0006074804,0.0008953673,0.0008503923,0.0008936091,0.0005664123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207047,"about_ca_system_score_gemma":0.00220407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00642483,"about_ca_topic_score_gemma":0.005357624,"domain_scores_codex":[0.9994352,0.0002803348,0.00001813723,0.00007652155,0.00009301324,0.00009675722],"domain_scores_gemma":[0.9993655,0.000379753,0.00006284311,0.00004077212,0.00010946,0.00004164893],"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.00007300928,0.00008009536,0.000443718,0.00007857239,0.00005563833,0.00006020793,0.00007399652,0.9372612,0.001193922,0.01204535,0.001655256,0.046979],"study_design_scores_gemma":[0.00001956778,0.00004560814,0.00007191602,0.00001254437,0.00001235372,0.00001917752,0.00003414247,0.9957166,0.0002520781,0.002817626,0.0009942566,0.000004250483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03790787,0.0006398602,0.9511418,0.0003479377,0.00008267398,0.0002879286,0.0001547021,0.0005199452,0.008917285],"genre_scores_gemma":[0.3762212,0.0003589582,0.6183146,0.0002406615,0.00004362717,0.0005534243,0.0002920604,0.0001512436,0.003824231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00642483,"threshold_uncertainty_score":0.01946497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}