{"meta":{"query_hash":"d17634a7629d","filters":{"venue":"ACM Transactions on Evolutionary Learning and Optimization"},"cohort_total":8,"direct_labels_cover":0,"predictions_cover":8,"exported":8,"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/d17634a7629d","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Evolutionary+Learning+and+Optimization"},"results":[{"id":"W3194234892","doi":"10.1145/3468857","title":"Emergent Tangled Program Graphs in Partially Observable Recursive Forecasting and ViZDoom Navigation Tasks","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Compute Canada","keywords":"Computer science; Modularity (biology); Representation (politics); Process (computing); Theoretical computer science; Theme (computing); Graph; Artificial intelligence; Task (project management); State (computer science); Programming language; Systems engineering","score_opus":0.02006204693976415,"score_gpt":0.2547973784544936,"score_spread":0.23473533151472942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194234892","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.6301133,0.00022240648,0.36510533,0.00032328643,0.000021502487,0.00008557501,0.00028280923,0.0008474181,0.0029983115],"genre_scores_gemma":[0.9344031,0.00006947496,0.06377899,0.000037150297,0.000005625639,0.00007928034,0.00032286666,0.000070574955,0.0012327251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947375,0.0002348034,0.000025125479,0.00015446909,0.000053073138,0.000058828795],"domain_scores_gemma":[0.9965754,0.002487846,0.00034374138,0.00026853415,0.00013405527,0.00019042958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039578,0.00048021937,0.000388129,0.00046349675,0.0003586891,0.00066565856,0.0008556719,0.00073968957,0.002775865],"category_scores_gemma":[0.007445902,0.00024430268,0.00043692856,0.00040132224,0.0007357249,0.0022268868,0.0009928468,0.00081054796,0.00018490336],"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.00040301663,0.00022267809,0.010543304,0.0002467656,0.000065694076,0.00048178967,0.0012626778,0.8104281,0.004874809,0.051328566,0.0014438605,0.1186988],"study_design_scores_gemma":[0.000025553725,0.00007826041,0.001475574,0.000012030628,0.000011136193,0.00003842776,0.00014535246,0.9324676,0.0010706596,0.06378095,0.00088162156,0.000012840192],"about_ca_topic_score_codex":0.0067833625,"about_ca_topic_score_gemma":0.007592075,"teacher_disagreement_score":0.0067833625,"about_ca_system_score_codex":0.0007155109,"about_ca_system_score_gemma":0.00072223076,"threshold_uncertainty_score":0.013487756},"labels":[],"label_agreement":null},{"id":"W4294237904","doi":"10.1145/3558774","title":"AutoML Loss Landscapes","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Oracle (Canada); University of British Columbia","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Set (abstract data type); Convexity; Bayesian probability; Biology","score_opus":0.008214584684334612,"score_gpt":0.23148625471691617,"score_spread":0.22327167003258155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294237904","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.13634048,0.0055875094,0.8120055,0.0047275904,0.00024043028,0.0003920779,0.001500054,0.0018362604,0.037370052],"genre_scores_gemma":[0.78026485,0.001755595,0.1999508,0.00211926,0.00018744425,0.0010437417,0.003072708,0.0012896826,0.010315999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578744,0.0019159016,0.00022102264,0.00061291916,0.0011310106,0.00033160666],"domain_scores_gemma":[0.98206204,0.013119583,0.0010503305,0.0015117599,0.0017287899,0.0005274515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008143367,0.0019908026,0.0018301499,0.0026471487,0.0011324837,0.0041599735,0.0022986685,0.0029228271,0.005469622],"category_scores_gemma":[0.03614955,0.00067744794,0.0010787803,0.0011502205,0.002348041,0.0038007533,0.0033829971,0.0033280174,0.0011851494],"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.00037630837,0.00027227923,0.0073897825,0.0006186503,0.00022053439,0.0003489233,0.00024243059,0.72732866,0.003482257,0.13579468,0.021497075,0.10242836],"study_design_scores_gemma":[0.000029990679,0.00019424112,0.0018993325,0.00013600831,0.0000318866,0.00027799778,0.00011738959,0.8878391,0.0014174783,0.10169959,0.006311655,0.00004534672],"about_ca_topic_score_codex":0.0013412648,"about_ca_topic_score_gemma":0.0012397919,"teacher_disagreement_score":0.008143367,"about_ca_system_score_codex":0.0026279544,"about_ca_system_score_gemma":0.0011265181,"threshold_uncertainty_score":0.04306674},"labels":[],"label_agreement":null},{"id":"W4318477412","doi":"10.1145/3582276","title":"The Generation of Visually Credible Adversarial Examples with Genetic Algorithms","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":5,"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":"Adversarial system; Computer science; Artificial intelligence; MNIST database; Artificial neural network; Similarity (geometry); Machine learning; Perspective (graphical); Quality (philosophy); Perception; Image (mathematics); Psychology","score_opus":0.021469433226095777,"score_gpt":0.25957791831143495,"score_spread":0.23810848508533916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318477412","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.123487726,0.0004740393,0.8670696,0.0006619119,0.0000796644,0.00022043,0.000090423935,0.00092305837,0.006993087],"genre_scores_gemma":[0.6454132,0.00021742967,0.35133383,0.00033484594,0.000030307016,0.00023518836,0.00016497792,0.00014878353,0.0021213696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889284,0.00047387637,0.00004741227,0.00019706548,0.00029997074,0.00008889234],"domain_scores_gemma":[0.9941889,0.004220827,0.000420154,0.00061626616,0.0004401266,0.000113702336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022971062,0.001119116,0.0007671118,0.0009796073,0.0005694871,0.0009511477,0.0013916834,0.0015729317,0.00140299],"category_scores_gemma":[0.011515665,0.00048515882,0.0007576675,0.0004849022,0.001656697,0.0011623905,0.0015065868,0.0015508934,0.00029753408],"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.00007696269,0.0000562293,0.0010743819,0.00006508136,0.000038099588,0.00009870564,0.00011771963,0.93810886,0.0024891614,0.01352773,0.0010827153,0.043264322],"study_design_scores_gemma":[0.000016013102,0.000032279713,0.00012291185,0.00001621806,0.000008323697,0.000037316287,0.000023879189,0.9874938,0.0013364368,0.010266234,0.0006378472,0.000008734898],"about_ca_topic_score_codex":0.0027136663,"about_ca_topic_score_gemma":0.0028747332,"teacher_disagreement_score":0.0027136663,"about_ca_system_score_codex":0.001219443,"about_ca_system_score_gemma":0.0008655178,"threshold_uncertainty_score":0.01214838},"labels":[],"label_agreement":null},{"id":"W4390751793","doi":"10.1145/3637065","title":"Evolutionary Optimization with a Simplified Helper Task for High-Dimensional Expensive Multiobjective Problems","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":8,"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 British Columbia","funders":"Guangdong Provincial Pearl River Talents Program; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Human multitasking; Task (project management); Surrogate model; Computer science; Curse of dimensionality; Dimension (graph theory); Evolutionary algorithm; Dimensionality reduction; Artificial intelligence; Machine learning; Convergence (economics); Mathematical optimization; Optimization problem; Algorithm; Mathematics; Engineering","score_opus":0.009643095064869094,"score_gpt":0.24360168410106506,"score_spread":0.23395858903619596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390751793","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.03962944,0.00037808204,0.9561446,0.00025899097,0.0000728007,0.00009367285,0.000049185997,0.0003487452,0.0030244167],"genre_scores_gemma":[0.53297824,0.0003296864,0.46134865,0.00030650303,0.00008299542,0.0005368595,0.00034846007,0.0001660476,0.0039026495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921477,0.00036829597,0.000044362714,0.00011652582,0.00018109959,0.00007507032],"domain_scores_gemma":[0.99840945,0.0009248551,0.00011961229,0.0002141192,0.00023451848,0.000097579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020467434,0.001309047,0.0014221497,0.0006335721,0.00049524225,0.0008965868,0.0014194754,0.0014405684,0.0022257026],"category_scores_gemma":[0.0043172184,0.0005236594,0.001098043,0.00059074163,0.00076169195,0.0009551839,0.0015223091,0.0017246603,0.00042475865],"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.000046344776,0.000077848104,0.0004970945,0.00006813364,0.000037907008,0.00007889077,0.000043736054,0.9664215,0.0014944719,0.004700392,0.00073321094,0.025800604],"study_design_scores_gemma":[0.000009864816,0.0000293426,0.00006304688,0.0000039021515,0.0000049408322,0.000013320392,0.0000061693713,0.9980021,0.00023769875,0.0011968688,0.0004296096,0.0000031612403],"about_ca_topic_score_codex":0.002104349,"about_ca_topic_score_gemma":0.0021895429,"teacher_disagreement_score":0.0022257026,"about_ca_system_score_codex":0.00044343062,"about_ca_system_score_gemma":0.0009606947,"threshold_uncertainty_score":0.010824382},"labels":[],"label_agreement":null},{"id":"W4405245753","doi":"10.1145/3707465","title":"An Evolutionary Algorithm for Expensive Mixed-Integer Black-Box Optimization with Explicit Constraints","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Black box; Mathematical optimization; Integer (computer science); Evolutionary algorithm; Set (abstract data type); Algorithm; Exploit; Computer science; Constraint (computer-aided design); Function (biology); Optimization problem; Integer programming; Constrained optimization problem; Process (computing); Mathematics; Artificial intelligence","score_opus":0.014629037312522528,"score_gpt":0.2775491560978298,"score_spread":0.2629201187853073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405245753","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.007421163,0.000110936126,0.9896041,0.00012224488,0.00003104213,0.000052705036,0.00001749879,0.00019204839,0.0024483392],"genre_scores_gemma":[0.11143462,0.00011281348,0.8847524,0.00012275945,0.000024197147,0.00030298083,0.00006872535,0.00008446923,0.0030969896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944276,0.00018446802,0.000024626319,0.00009256565,0.00019166333,0.000063800435],"domain_scores_gemma":[0.99881506,0.0008430149,0.000076601515,0.00007485359,0.00013612956,0.00005446608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014913197,0.0009915291,0.001040317,0.00064475054,0.0006201394,0.0009100288,0.001449854,0.0018087942,0.003575488],"category_scores_gemma":[0.0034638415,0.0006190806,0.00080190477,0.00073052006,0.0008384415,0.00093421194,0.0014107756,0.001789942,0.0004957538],"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.000057431786,0.00007615851,0.00036767861,0.000059756185,0.00004146365,0.00008745659,0.00006171341,0.8872455,0.0024654109,0.03245998,0.0012772696,0.07580017],"study_design_scores_gemma":[0.000019390236,0.000015870784,0.0000291465,0.0000057282514,0.0000049795494,0.00001562221,0.00000417806,0.9952047,0.0002702281,0.00382766,0.00059886405,0.0000036814158],"about_ca_topic_score_codex":0.0023367216,"about_ca_topic_score_gemma":0.0027311747,"teacher_disagreement_score":0.003575488,"about_ca_system_score_codex":0.0007431662,"about_ca_system_score_gemma":0.001411129,"threshold_uncertainty_score":0.011961162},"labels":[],"label_agreement":null},{"id":"W4405639190","doi":"10.1145/3709013","title":"Data Mining-Driven Shift Enumeration for Accelerating the Solution of Large-Scale Personnel Scheduling Problems","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Scheduling (production processes); Scale (ratio); Computer science; Operations research; Operations management; Engineering; Mathematics; Geography; Cartography","score_opus":0.11201870965983116,"score_gpt":0.3617451143697751,"score_spread":0.24972640470994392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405639190","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.13211381,0.00093404285,0.8574968,0.00092034525,0.00021696043,0.00035865686,0.00078377617,0.0024479215,0.0047276965],"genre_scores_gemma":[0.28249246,0.00025234724,0.71405554,0.00017371721,0.00005166864,0.0002724168,0.001363708,0.00016028018,0.0011777938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994155,0.00019164715,0.0000388335,0.00013232237,0.00013609207,0.0000856474],"domain_scores_gemma":[0.9986137,0.00077994366,0.00014908842,0.00012788098,0.00022483166,0.0001045341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012167153,0.0012065363,0.0009333832,0.0010577132,0.00059046695,0.0008199794,0.0013445575,0.0008311717,0.002718334],"category_scores_gemma":[0.0036123951,0.00060943654,0.0013100829,0.0013755516,0.0003785365,0.0010367093,0.00088388816,0.0015257028,0.0005564661],"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.0001682121,0.0003575639,0.002898036,0.00029869573,0.0000814829,0.00011361141,0.0001273214,0.8586963,0.003629577,0.0051188488,0.00336914,0.12514126],"study_design_scores_gemma":[0.00002897266,0.000043695578,0.00021286582,0.000009625899,0.0000091569,0.000016256576,0.00005035647,0.9948566,0.0009171919,0.002844701,0.0010064567,0.0000040756836],"about_ca_topic_score_codex":0.006478704,"about_ca_topic_score_gemma":0.0074613146,"teacher_disagreement_score":0.006478704,"about_ca_system_score_codex":0.00072879175,"about_ca_system_score_gemma":0.002183859,"threshold_uncertainty_score":0.012881994},"labels":[],"label_agreement":null},{"id":"W4407410817","doi":"10.1145/3716862","title":"Dynamic Task Allocation in Intelligent Warehouses with Hybrid Workforce of Automated Guided Vehicles and Human Pickers","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Workforce; Task (project management); Computer science; Operations research; Manufacturing engineering; Industrial engineering; Engineering; Economics; Systems engineering","score_opus":0.007638214342185424,"score_gpt":0.24413293970073485,"score_spread":0.23649472535854943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407410817","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.44504425,0.0005578506,0.54652923,0.00064318645,0.00009960485,0.00011298554,0.00012304484,0.00020172684,0.006688126],"genre_scores_gemma":[0.97799075,0.000095701515,0.019781187,0.000072130446,0.000013752861,0.00006474994,0.000037144062,0.000012924325,0.0019315706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994085,0.0002033418,0.000019328792,0.000122067504,0.00005587251,0.00019099133],"domain_scores_gemma":[0.999111,0.0004703669,0.00012787966,0.00004600626,0.00007907197,0.00016565183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012742771,0.0007165007,0.00091634947,0.00041052615,0.0005185869,0.001167088,0.0011236811,0.0011706131,0.0023443387],"category_scores_gemma":[0.0024669794,0.00044957336,0.00049047923,0.0004577918,0.0007180041,0.00095157634,0.0012263698,0.0007014972,0.00027710845],"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.00012212952,0.000058561236,0.0007439112,0.000027220729,0.000022802367,0.000097426346,0.000052212265,0.98837054,0.0005769257,0.00212177,0.00027862386,0.007527922],"study_design_scores_gemma":[0.000014594144,0.00005900643,0.00024373338,0.0000041093604,0.000006665145,0.000012623641,0.000051344643,0.9975915,0.00011220703,0.0016758476,0.00022442894,0.0000039833576],"about_ca_topic_score_codex":0.007745218,"about_ca_topic_score_gemma":0.005244784,"teacher_disagreement_score":0.007745218,"about_ca_system_score_codex":0.00083004707,"about_ca_system_score_gemma":0.001229318,"threshold_uncertainty_score":0.015400231},"labels":[],"label_agreement":null},{"id":"W4411022335","doi":"10.1145/3742796","title":"Gradient Boosted Programming for Low Cardinality Classification","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Computer science; Artificial intelligence; Data mining","score_opus":0.012232340414358186,"score_gpt":0.270142507485868,"score_spread":0.2579101670715098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411022335","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.0038434714,0.00013028926,0.99463165,0.00011400472,0.000020439627,0.000026024698,0.000025922347,0.00024697222,0.00096113497],"genre_scores_gemma":[0.23267451,0.00035413945,0.76120925,0.00028363895,0.00016225179,0.0004109608,0.0003244544,0.0002486996,0.0043320693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985259,0.00064098486,0.00005121689,0.00022755044,0.0004252791,0.0001291432],"domain_scores_gemma":[0.9978289,0.0013977229,0.00012587251,0.00022322068,0.00033830298,0.0000860548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00339865,0.00086151285,0.0014633128,0.00080451666,0.0005245844,0.0011717264,0.0015574672,0.0012714874,0.002305802],"category_scores_gemma":[0.006178228,0.0005230333,0.0009213366,0.0011344629,0.0008185734,0.0014998021,0.0013074017,0.002845433,0.00077781576],"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.000077632794,0.000105216415,0.0009479634,0.000096308315,0.0000630673,0.00006766269,0.00007203439,0.8114957,0.0017525823,0.050136186,0.0034007712,0.13178483],"study_design_scores_gemma":[0.0000036680674,0.00001454854,0.000045265202,0.000004303121,0.0000034812458,0.000009659537,0.0000029019736,0.98032045,0.00030516667,0.018721875,0.0005664114,0.0000024082492],"about_ca_topic_score_codex":0.0014406211,"about_ca_topic_score_gemma":0.0017969382,"teacher_disagreement_score":0.00339865,"about_ca_system_score_codex":0.0007472813,"about_ca_system_score_gemma":0.0013087922,"threshold_uncertainty_score":0.017974019},"labels":[],"label_agreement":null}]}