{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032464538,0.0007401174,0.9637584,0.0021772294,0.00014093636,0.0003600673,0.0000076065767,0.00023438656,0.00011670384],"genre_scores_gemma":[0.4017018,0.0010883302,0.59641993,0.000055560355,0.000028394765,0.00024278648,0.00016326134,0.000016649445,0.00028324994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985522,0.00015583582,0.0003055679,0.0005254079,0.000208873,0.00025211298],"domain_scores_gemma":[0.999186,0.00014544412,0.00010435143,0.0002558028,0.00020674962,0.000101670754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018761732,0.0001616309,0.0001469144,0.00015282987,0.00071088277,0.000095349365,0.00014562563,0.00010791907,0.000027220669],"category_scores_gemma":[0.000076528966,0.00018474432,0.00004859773,0.00096971856,0.00006384083,0.00063328835,0.000028188175,0.00031193014,0.0000031544887],"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.000013742058,0.0002987018,0.0014435222,0.000019333287,0.000020025886,0.000010402793,0.00034749875,0.9309284,0.00011293084,0.002779801,0.000025820184,0.0639998],"study_design_scores_gemma":[0.00052667933,0.00017751365,0.0064691426,0.000095309144,0.000019312261,0.000087147,0.0002622335,0.9858091,0.000109471046,0.005199471,0.0010213235,0.0002233303],"about_ca_topic_score_codex":0.000040402905,"about_ca_topic_score_gemma":0.00002995603,"teacher_disagreement_score":0.36923727,"about_ca_system_score_codex":0.00007984966,"about_ca_system_score_gemma":0.00010154207,"threshold_uncertainty_score":0.75336546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010148191,0.00018451312,0.99393195,0.0035950795,0.00018934591,0.000085868574,0.000008674211,0.00045898918,0.0005307753],"genre_scores_gemma":[0.85606575,0.00021184991,0.14160857,0.00013865728,0.00002813091,0.00007276235,0.0001372413,0.000013741171,0.0017233017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987604,0.00027320674,0.0001579118,0.0003693434,0.0002779271,0.000161233],"domain_scores_gemma":[0.99933547,0.0001487235,0.00008320537,0.0003280418,0.00004351637,0.00006105239],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00025590204,0.000110711044,0.00008981292,0.00022079624,0.001575696,0.00007295084,0.00034092792,0.000037980717,0.00024212108],"category_scores_gemma":[0.000059443068,0.00012085168,0.000038576894,0.00047851616,0.000025363048,0.0003669528,0.000040927363,0.00045787438,0.000017588445],"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.000015155654,0.00007490767,0.0007088503,0.000004128099,0.0000094340485,0.0000020151963,0.00020505715,0.9571798,0.00000987456,0.0018470674,0.00010688115,0.03983682],"study_design_scores_gemma":[0.0002952391,0.00018774456,0.0023086849,0.0000046624245,0.000009063186,0.00006695333,0.0001156131,0.961547,0.000004702531,0.00034270488,0.034970056,0.00014753405],"about_ca_topic_score_codex":0.000023026912,"about_ca_topic_score_gemma":0.0000014026572,"teacher_disagreement_score":0.8550509,"about_ca_system_score_codex":0.00007609163,"about_ca_system_score_gemma":0.000052253727,"threshold_uncertainty_score":0.9997241},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030248298,0.00009635789,0.9955476,0.0005724279,0.0002445879,0.00015321888,0.0000019694419,0.00026934478,0.000089695626],"genre_scores_gemma":[0.44878688,0.00066490093,0.5497985,0.000018288958,0.00012279663,0.00003735143,0.000035731133,0.000023291408,0.00051223865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868727,0.00021216617,0.00022692728,0.0003218038,0.00034522754,0.0002066241],"domain_scores_gemma":[0.99894756,0.00042169867,0.00013567632,0.00029717662,0.00014855096,0.00004933564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003056439,0.00013371912,0.00011519235,0.00019511762,0.00117685,0.00008208941,0.00030755304,0.00007372663,0.000013259492],"category_scores_gemma":[0.00014472606,0.000106565516,0.000037648613,0.00081984326,0.00011366814,0.00036453435,0.000027117623,0.00025566472,0.000006557946],"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.00003054986,0.000019152825,0.00023484603,0.000005463058,0.000026081458,0.0000016913181,0.0002597001,0.95798445,0.000070231465,0.0006034123,0.000030551953,0.04073386],"study_design_scores_gemma":[0.00043584543,0.00027706305,0.0022090198,0.00001891815,0.000020644862,0.000011915206,0.0001512556,0.99574035,0.000045898796,0.00021068496,0.0007529069,0.00012546763],"about_ca_topic_score_codex":0.00003758391,"about_ca_topic_score_gemma":0.0000071195877,"teacher_disagreement_score":0.44576207,"about_ca_system_score_codex":0.00004281075,"about_ca_system_score_gemma":0.00009668427,"threshold_uncertainty_score":0.9051498},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012053815,0.0006455549,0.995406,0.0011283898,0.0004184194,0.0011969344,0.00006155934,0.0009557869,0.00006685432],"genre_scores_gemma":[0.1494789,0.0002475998,0.8481442,0.0001303551,0.0000880841,0.00057573605,0.0003263638,0.000076624405,0.0009321751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731857,0.00018728513,0.00041578014,0.0011701531,0.00047302956,0.00043521292],"domain_scores_gemma":[0.9977592,0.0006888144,0.00015655262,0.0004011117,0.00082986295,0.00016444598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019574953,0.00042488487,0.00029534067,0.0006258183,0.0012042271,0.00021483871,0.00027472767,0.00021174873,0.00006359908],"category_scores_gemma":[0.00016982765,0.0004040877,0.00010395743,0.0011017696,0.00017605527,0.0018200629,0.00003497979,0.00046834393,0.000015445765],"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.00015212577,0.00017042602,0.000012111749,0.000046297333,0.00011834945,0.0000069437506,0.0005087099,0.98793876,0.00007345345,0.0013690024,0.00007588744,0.009527943],"study_design_scores_gemma":[0.0013960737,0.00069464365,0.000132401,0.00018861196,0.00006620721,0.00013084426,0.00017876507,0.9952179,0.000094509,0.0009235364,0.0004688405,0.0005076769],"about_ca_topic_score_codex":0.000030390236,"about_ca_topic_score_gemma":0.0000037386194,"teacher_disagreement_score":0.14935836,"about_ca_system_score_codex":0.00041406768,"about_ca_system_score_gemma":0.00028130907,"threshold_uncertainty_score":0.9998411},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024419236,0.00039461168,0.99609846,0.0010961244,0.00043542075,0.00081881136,0.00006828701,0.00085956533,0.00020430054],"genre_scores_gemma":[0.031779356,0.0005949206,0.9656926,0.00009250573,0.00012722694,0.00028731913,0.00037044034,0.00007589939,0.0009797462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969026,0.00034319473,0.00046751538,0.0011269266,0.0006569723,0.0005027985],"domain_scores_gemma":[0.9974801,0.00070973777,0.00011933435,0.00060185714,0.0007992046,0.00028977793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043860194,0.00038955823,0.0003016589,0.0007806774,0.00094561133,0.00047924477,0.00050410355,0.00022255597,0.00028775996],"category_scores_gemma":[0.00016346155,0.00037408032,0.00010881765,0.0011529566,0.00031572132,0.0018003287,0.000028219474,0.00053239695,0.000029378074],"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.00004367092,0.00016039913,0.000008814065,0.00003746413,0.00008572525,0.000013205871,0.00036956064,0.916205,0.0000100803145,0.0016643918,0.00022411467,0.08117758],"study_design_scores_gemma":[0.0007607612,0.0007922386,0.000029878449,0.0001331239,0.000059055532,0.00015020315,0.0004786323,0.9957651,0.000059342918,0.00031375204,0.0010141217,0.00044379005],"about_ca_topic_score_codex":0.000014279715,"about_ca_topic_score_gemma":0.0000012385555,"teacher_disagreement_score":0.08073379,"about_ca_system_score_codex":0.0002412519,"about_ca_system_score_gemma":0.00038651994,"threshold_uncertainty_score":0.99987113},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010836715,0.001302443,0.98287094,0.0036102189,0.00052124506,0.00039375515,0.00021149061,0.000183561,0.00006960988],"genre_scores_gemma":[0.69607484,0.00014374491,0.30284983,0.00003189614,0.00013556829,0.000058002013,0.00024780125,0.000024169396,0.00043412714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735475,0.00029995004,0.0006519059,0.0007410953,0.00063127495,0.00032102683],"domain_scores_gemma":[0.99630123,0.002413418,0.00021199166,0.000660349,0.0003389856,0.00007399394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027871071,0.00019280294,0.00023116876,0.00041288635,0.002047703,0.0003770955,0.00056405785,0.00015420183,0.000103759005],"category_scores_gemma":[0.0019666788,0.00014922325,0.0001298467,0.0010337455,0.00013452486,0.0009461117,0.00004338008,0.00039603357,0.000015241125],"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.000031461106,0.00007319859,0.0002769162,0.000028371334,0.000051599116,2.045883e-7,0.0028235218,0.98537123,0.0001237217,0.00025141743,0.00013999899,0.010828384],"study_design_scores_gemma":[0.00032718523,0.00013474558,0.0002565973,0.00014210764,0.000117991294,0.000010839943,0.0032540907,0.99238396,0.0000311576,0.0007780619,0.0024015887,0.00016167042],"about_ca_topic_score_codex":0.000027926646,"about_ca_topic_score_gemma":0.00005843226,"teacher_disagreement_score":0.6852381,"about_ca_system_score_codex":0.000057790363,"about_ca_system_score_gemma":0.00018519853,"threshold_uncertainty_score":0.9992515},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05688932,0.00028645943,0.9420363,0.00007314029,0.00004058923,0.00014870972,0.0000041296207,0.00042067378,0.000100683515],"genre_scores_gemma":[0.9259369,0.000945078,0.07286422,0.000007883583,0.0000022706827,0.000020734897,0.00007221273,0.00001868344,0.00013201745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935573,0.0000354955,0.00022797253,0.00018150039,0.00008049852,0.000118791584],"domain_scores_gemma":[0.999669,0.00008764379,0.000046082438,0.0001172876,0.000053114938,0.00002687684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006521513,0.00013073364,0.00013239609,0.0003070495,0.00016973117,0.000015530071,0.000049881648,0.00006081921,0.000004483896],"category_scores_gemma":[0.00003304044,0.0001364527,0.000014519699,0.00025104362,0.000079083526,0.0001357683,0.000004178914,0.00017116005,3.383114e-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.000028370107,0.00003299682,0.00079591974,0.000062706364,0.000023125138,6.2132096e-7,0.00011226925,0.99352044,0.0000904507,0.00008699529,0.000007602344,0.0052384958],"study_design_scores_gemma":[0.0003735071,0.00007802778,0.004426171,0.00018055853,0.00002929848,0.000003881428,0.00016379514,0.99392426,0.0004499948,0.00017193257,0.00007001117,0.00012855047],"about_ca_topic_score_codex":0.000030510077,"about_ca_topic_score_gemma":0.000018876357,"teacher_disagreement_score":0.8691721,"about_ca_system_score_codex":0.00010682223,"about_ca_system_score_gemma":0.000018363822,"threshold_uncertainty_score":0.55643797},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005906331,0.00019499181,0.9954191,0.0025775568,0.00030026695,0.0003209235,0.0000032167045,0.00036998297,0.00022332765],"genre_scores_gemma":[0.46497944,0.000117445365,0.5327802,0.00008736325,0.000036016216,0.0001718594,0.00006085676,0.000011152771,0.0017557272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988717,0.00014347112,0.00021442017,0.00042336044,0.00014447613,0.00020261238],"domain_scores_gemma":[0.9991957,0.00022491108,0.000083569576,0.00028234863,0.00015740773,0.000056080924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002925416,0.00013575434,0.00013156944,0.000232065,0.0009167998,0.000112196,0.00021467484,0.000087916625,0.0000054743386],"category_scores_gemma":[0.00014954034,0.00014046107,0.00007849212,0.00051516615,0.000046187477,0.00026770763,0.000012119884,0.00025969476,0.0000025114775],"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.000028888322,0.00009004724,0.00037721783,0.000037511243,0.000027257096,2.817562e-7,0.00012957049,0.73524827,0.000015471167,0.0024908078,0.000048455146,0.26150623],"study_design_scores_gemma":[0.00044753883,0.000176809,0.0025251715,0.00006006541,0.00002598855,0.000005268397,0.000087346234,0.98643875,0.000027512895,0.000639894,0.0094257,0.00013997765],"about_ca_topic_score_codex":0.000018282135,"about_ca_topic_score_gemma":0.000001781682,"teacher_disagreement_score":0.4643888,"about_ca_system_score_codex":0.000092497154,"about_ca_system_score_gemma":0.000066944376,"threshold_uncertainty_score":0.70513755},"labels":[],"label_agreement":null}]}