{"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":"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.031715795,0.00036971894,0.961794,0.00033140092,0.000087835964,0.00011022216,0.00008016615,0.000110385314,0.00540042],"genre_scores_gemma":[0.6257204,0.0005182352,0.3673272,0.0001361517,0.00008715961,0.0003867041,0.00020470803,0.000027375398,0.0055920454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997185,0.00010684973,0.000011624634,0.000057115354,0.000070393326,0.000035379046],"domain_scores_gemma":[0.9996568,0.00021472493,0.000036715173,0.00001601601,0.00005358441,0.000022076625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095321,0.0007212486,0.0008999848,0.0005374034,0.0005092662,0.0009002172,0.0008119231,0.0018239192,0.001900332],"category_scores_gemma":[0.0015976081,0.00035905497,0.0006913827,0.00069944287,0.0005182123,0.00061821355,0.0005872703,0.0007535621,0.00016759888],"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.000029015713,0.000022417971,0.00021936755,0.000040839263,0.000014850067,0.000048522434,0.000023481825,0.9834313,0.00058462156,0.0047166036,0.00047986757,0.010389163],"study_design_scores_gemma":[0.000012958089,0.000018994335,0.000059282713,0.000003150603,0.0000034285488,0.000008165569,0.000004479622,0.9986035,0.00009642588,0.00089026405,0.00029667912,0.000002714617],"about_ca_topic_score_codex":0.007164138,"about_ca_topic_score_gemma":0.003156721,"teacher_disagreement_score":0.007164138,"about_ca_system_score_codex":0.00065519783,"about_ca_system_score_gemma":0.0010924372,"threshold_uncertainty_score":0.014244914},"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":"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.04237328,0.0011261108,0.9463798,0.0002922645,0.00008788362,0.00020982017,0.00012538065,0.0005484127,0.008857198],"genre_scores_gemma":[0.4714342,0.00085572794,0.5211944,0.0002763367,0.00006899206,0.0007723039,0.00035087686,0.0001858848,0.004861226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936634,0.00027284998,0.000045736604,0.00007937699,0.00016596064,0.00006975097],"domain_scores_gemma":[0.9986022,0.0010118654,0.00013148451,0.000083746105,0.00011984412,0.000050807514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013177759,0.0012134493,0.0012243242,0.0013581482,0.00048584468,0.0013861998,0.0019258471,0.0016760756,0.0024247158],"category_scores_gemma":[0.0032529286,0.0005305146,0.0013144936,0.0014636855,0.00089501764,0.0009615119,0.0008515165,0.0015081814,0.0004196235],"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.00004429851,0.000048351823,0.00038702457,0.00008853642,0.0000564984,0.00004751358,0.000041987852,0.96599567,0.00068076,0.0067843166,0.0004855045,0.025339393],"study_design_scores_gemma":[0.00001502616,0.000033286768,0.000060644546,0.000014626098,0.000013073431,0.000014515461,0.00001020707,0.995559,0.00026939934,0.0034232424,0.0005824295,0.0000045782817],"about_ca_topic_score_codex":0.002864725,"about_ca_topic_score_gemma":0.0028724624,"teacher_disagreement_score":0.002864725,"about_ca_system_score_codex":0.0012567388,"about_ca_system_score_gemma":0.0012715583,"threshold_uncertainty_score":0.009118259},"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":"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.01647466,0.00029405803,0.9792859,0.000147763,0.000028487426,0.000045829525,0.000022137567,0.00013854372,0.003562608],"genre_scores_gemma":[0.5634224,0.00048390325,0.4304038,0.00020603077,0.00006129835,0.000445979,0.000089610774,0.00010436542,0.0047825645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970335,0.00013212742,0.000009198615,0.00003818447,0.00007840476,0.000038681475],"domain_scores_gemma":[0.99949753,0.00034872096,0.000047646598,0.000021791226,0.000060999304,0.000023265296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000771538,0.00071859075,0.0010009968,0.00063919113,0.0003164731,0.00063131715,0.0014507434,0.001225784,0.0021161665],"category_scores_gemma":[0.0014228671,0.00035995705,0.00070549094,0.00073873997,0.00065558724,0.00068872224,0.00079312007,0.0006978379,0.00027107733],"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.000020680749,0.000022955272,0.00011486659,0.000041251136,0.00002347556,0.000045476325,0.000023213968,0.98230666,0.000638537,0.0056286408,0.00023672852,0.010897496],"study_design_scores_gemma":[0.000009675907,0.000020646698,0.000024809353,0.00000373845,0.000004468122,0.0000069200064,0.000006920079,0.9980642,0.0001057194,0.0015409472,0.00020964068,0.0000022832037],"about_ca_topic_score_codex":0.0036820162,"about_ca_topic_score_gemma":0.0032213465,"teacher_disagreement_score":0.0036820162,"about_ca_system_score_codex":0.00068529736,"about_ca_system_score_gemma":0.0010036955,"threshold_uncertainty_score":0.007321179},"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":"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.09968962,0.0015897682,0.8805912,0.0008980543,0.00014156537,0.00023094016,0.00036578692,0.0008150212,0.015678035],"genre_scores_gemma":[0.5939101,0.0007936964,0.39857715,0.00021153594,0.00006206483,0.0004500921,0.0005860021,0.00021254965,0.005196781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.00045720098,0.000023303031,0.00009808716,0.00011595758,0.00007347566],"domain_scores_gemma":[0.9982851,0.0013341208,0.000119762655,0.00009839108,0.000100471276,0.00006217235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009525279,0.00092677324,0.00088954705,0.0007207762,0.0005236796,0.0008681758,0.00096985826,0.0010314318,0.002718065],"category_scores_gemma":[0.0037573443,0.0005909497,0.00090205204,0.00090359396,0.0007102546,0.0007422744,0.0005377277,0.0014426049,0.00038303135],"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.000042575317,0.00002306336,0.00013621763,0.000029268173,0.00001684361,0.000014531805,0.000025750098,0.98661673,0.00043193268,0.0042171786,0.0004996702,0.007946243],"study_design_scores_gemma":[0.000011503121,0.000017102879,0.00006026486,0.0000045642805,0.0000051460984,0.000004716366,0.0000064332185,0.9952992,0.0001949422,0.0037510055,0.0006422357,0.0000028513302],"about_ca_topic_score_codex":0.008501755,"about_ca_topic_score_gemma":0.008661541,"teacher_disagreement_score":0.008501755,"about_ca_system_score_codex":0.0017324202,"about_ca_system_score_gemma":0.0016316825,"threshold_uncertainty_score":0.016904593},"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":"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.037907872,0.00063986017,0.95114183,0.0003479377,0.00008267398,0.0002879286,0.0001547021,0.0005199452,0.008917285],"genre_scores_gemma":[0.37622124,0.0003589582,0.6183146,0.0002406615,0.00004362717,0.0005534243,0.00029206037,0.00015124361,0.003824231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943525,0.00028033485,0.00001813723,0.00007652155,0.00009301324,0.00009675722],"domain_scores_gemma":[0.9993655,0.000379753,0.00006284311,0.000040772116,0.00010945995,0.000041648935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400027,0.000942299,0.00091511454,0.0012721319,0.0007514188,0.0011180834,0.0015454214,0.0014790666,0.005818541],"category_scores_gemma":[0.002151374,0.0005039191,0.00087105104,0.0012685723,0.0006074804,0.0008953673,0.00085039233,0.00089360913,0.0005664123],"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.00007300928,0.00008009536,0.000443718,0.00007857239,0.000055638327,0.000060207934,0.00007399652,0.9372612,0.0011939222,0.012045349,0.0016552558,0.046978995],"study_design_scores_gemma":[0.000019567777,0.000045608136,0.000071916016,0.000012544368,0.000012353724,0.00001917752,0.00003414247,0.99571663,0.0002520781,0.0028176256,0.0009942566,0.000004250483],"about_ca_topic_score_codex":0.00642483,"about_ca_topic_score_gemma":0.005357624,"teacher_disagreement_score":0.00642483,"about_ca_system_score_codex":0.0012070467,"about_ca_system_score_gemma":0.0022040703,"threshold_uncertainty_score":0.01946497},"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":"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.09968962,0.0015897682,0.8805912,0.0008980543,0.00014156537,0.00023094016,0.00036578692,0.0008150212,0.015678035],"genre_scores_gemma":[0.5939101,0.0007936964,0.39857715,0.00021153594,0.00006206483,0.0004500921,0.0005860021,0.00021254965,0.005196781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.00045720098,0.000023303031,0.00009808716,0.00011595758,0.00007347566],"domain_scores_gemma":[0.9982851,0.0013341208,0.000119762655,0.00009839108,0.000100471276,0.00006217235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009525279,0.00092677324,0.00088954705,0.0007207762,0.0005236796,0.0008681758,0.00096985826,0.0010314318,0.002718065],"category_scores_gemma":[0.0037573443,0.0005909497,0.00090205204,0.00090359396,0.0007102546,0.0007422744,0.0005377277,0.0014426049,0.00038303135],"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.000042575317,0.00002306336,0.00013621763,0.000029268173,0.00001684361,0.000014531805,0.000025750098,0.98661673,0.00043193268,0.0042171786,0.0004996702,0.007946243],"study_design_scores_gemma":[0.000011503121,0.000017102879,0.00006026486,0.0000045642805,0.0000051460984,0.000004716366,0.0000064332185,0.9952992,0.0001949422,0.0037510055,0.0006422357,0.0000028513302],"about_ca_topic_score_codex":0.008501755,"about_ca_topic_score_gemma":0.008661541,"teacher_disagreement_score":0.008501755,"about_ca_system_score_codex":0.0017324202,"about_ca_system_score_gemma":0.0016316825,"threshold_uncertainty_score":0.016904593},"labels":[],"label_agreement":null}]}