{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":8,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":8,"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"},"query_hash":"d17634a7629d","filters":{"venue":"ACM Transactions on Evolutionary Learning and Optimization"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008214584684334612,"gpt":0.2314862547169162,"spread":0.2232716700325816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000255902,0.000110711,0.00008981292,0.0002207962,0.001575696,0.00007295084,0.0003409279,0.00003798072,0.0002421211],"category_scores_gemma":[0.00005944307,0.0001208517,0.00003857689,0.0004785162,0.00002536305,0.0003669528,0.00004092736,0.0004578744,0.00001758845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007609163,"about_ca_system_score_gemma":0.00005225373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002302691,"about_ca_topic_score_gemma":0.000001402657,"domain_scores_codex":[0.9987604,0.0002732067,0.0001579118,0.0003693434,0.0002779271,0.000161233],"domain_scores_gemma":[0.9993355,0.0001487235,0.00008320537,0.0003280418,0.00004351637,0.00006105239],"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.00001515565,0.00007490767,0.0007088503,0.000004128099,0.000009434048,0.000002015196,0.0002050571,0.9571798,0.00000987456,0.001847067,0.0001068811,0.03983682],"study_design_scores_gemma":[0.0002952391,0.0001877446,0.002308685,0.000004662425,0.000009063186,0.00006695333,0.0001156131,0.961547,0.000004702531,0.0003427049,0.03497006,0.0001475341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001014819,0.0001845131,0.9939319,0.00359508,0.0001893459,0.00008586857,0.000008674211,0.0004589892,0.0005307753],"genre_scores_gemma":[0.8560658,0.0002118499,0.1416086,0.0001386573,0.00002813091,0.00007276235,0.0001372413,0.00001374117,0.001723302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8550509,"threshold_uncertainty_score":0.9997241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02006204693976415,"gpt":0.2547973784544936,"spread":0.2347353315147294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876173,0.0001616309,0.0001469144,0.0001528299,0.0007108828,0.00009534937,0.0001456256,0.0001079191,0.00002722067],"category_scores_gemma":[0.00007652897,0.0001847443,0.00004859773,0.0009697186,0.00006384083,0.0006332883,0.00002818817,0.0003119301,0.000003154489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007984966,"about_ca_system_score_gemma":0.0001015421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004040291,"about_ca_topic_score_gemma":0.00002995603,"domain_scores_codex":[0.9985522,0.0001558358,0.0003055679,0.0005254079,0.000208873,0.000252113],"domain_scores_gemma":[0.999186,0.0001454441,0.0001043514,0.0002558028,0.0002067496,0.0001016708],"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.00001374206,0.0002987018,0.001443522,0.00001933329,0.00002002589,0.00001040279,0.0003474987,0.9309284,0.0001129308,0.002779801,0.00002582018,0.0639998],"study_design_scores_gemma":[0.0005266793,0.0001775136,0.006469143,0.00009530914,0.00001931226,0.000087147,0.0002622335,0.9858091,0.000109471,0.005199471,0.001021323,0.0002233303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03246454,0.0007401174,0.9637584,0.002177229,0.0001409364,0.0003600673,0.000007606577,0.0002343866,0.0001167038],"genre_scores_gemma":[0.4017018,0.00108833,0.5964199,0.00005556035,0.00002839476,0.0002427865,0.0001632613,0.00001664944,0.0002832499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3692373,"threshold_uncertainty_score":0.7533655,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009643095064869094,"gpt":0.2436016841010651,"spread":0.233958589036196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001957495,0.0004248849,0.0002953407,0.0006258183,0.001204227,0.0002148387,0.0002747277,0.0002117487,0.00006359908],"category_scores_gemma":[0.0001698276,0.0004040877,0.0001039574,0.00110177,0.0001760553,0.001820063,0.00003497979,0.0004683439,0.00001544576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004140677,"about_ca_system_score_gemma":0.0002813091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003039024,"about_ca_topic_score_gemma":0.000003738619,"domain_scores_codex":[0.9973186,0.0001872851,0.0004157801,0.001170153,0.0004730296,0.0004352129],"domain_scores_gemma":[0.9977592,0.0006888144,0.0001565526,0.0004011117,0.000829863,0.000164446],"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.0001521258,0.000170426,0.00001211175,0.00004629733,0.0001183495,0.000006943751,0.0005087099,0.9879388,0.00007345345,0.001369002,0.00007588744,0.009527943],"study_design_scores_gemma":[0.001396074,0.0006946436,0.000132401,0.000188612,0.00006620721,0.0001308443,0.0001787651,0.9952179,0.000094509,0.0009235364,0.0004688405,0.0005076769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001205381,0.0006455549,0.995406,0.00112839,0.0004184194,0.001196934,0.00006155934,0.0009557869,0.00006685432],"genre_scores_gemma":[0.1494789,0.0002475998,0.8481442,0.0001303551,0.0000880841,0.000575736,0.0003263638,0.0000766244,0.0009321751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1493584,"threshold_uncertainty_score":0.9998411,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02146943322609578,"gpt":0.259577918311435,"spread":0.2381084850853392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003056439,0.0001337191,0.0001151923,0.0001951176,0.00117685,0.00008208941,0.000307553,0.00007372663,0.00001325949],"category_scores_gemma":[0.0001447261,0.0001065655,0.00003764861,0.0008198433,0.0001136681,0.0003645344,0.00002711762,0.0002556647,0.000006557946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004281075,"about_ca_system_score_gemma":0.00009668427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003758391,"about_ca_topic_score_gemma":0.000007119588,"domain_scores_codex":[0.9986873,0.0002121662,0.0002269273,0.0003218038,0.0003452275,0.0002066241],"domain_scores_gemma":[0.9989476,0.0004216987,0.0001356763,0.0002971766,0.000148551,0.00004933564],"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.00003054986,0.00001915283,0.000234846,0.000005463058,0.00002608146,0.000001691318,0.0002597001,0.9579844,0.00007023146,0.0006034123,0.00003055195,0.04073386],"study_design_scores_gemma":[0.0004358454,0.0002770631,0.00220902,0.00001891815,0.00002064486,0.00001191521,0.0001512556,0.9957404,0.0000458988,0.000210685,0.0007529069,0.0001254676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00302483,0.00009635789,0.9955476,0.0005724279,0.0002445879,0.0001532189,0.000001969442,0.0002693448,0.00008969563],"genre_scores_gemma":[0.4487869,0.0006649009,0.5497985,0.00001828896,0.0001227966,0.00003735143,0.00003573113,0.00002329141,0.0005122387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4457621,"threshold_uncertainty_score":0.9051498,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007638214342185424,"gpt":0.2441329397007349,"spread":0.2364947253585494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006521513,0.0001307336,0.0001323961,0.0003070495,0.0001697312,0.00001553007,0.00004988165,0.00006081921,0.000004483896],"category_scores_gemma":[0.00003304044,0.0001364527,0.0000145197,0.0002510436,0.00007908353,0.0001357683,0.000004178914,0.00017116,3.383114e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001068222,"about_ca_system_score_gemma":0.00001836382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003051008,"about_ca_topic_score_gemma":0.00001887636,"domain_scores_codex":[0.9993557,0.0000354955,0.0002279725,0.0001815004,0.00008049852,0.0001187916],"domain_scores_gemma":[0.999669,0.00008764379,0.00004608244,0.0001172876,0.00005311494,0.00002687684],"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.00002837011,0.00003299682,0.0007959197,0.00006270636,0.00002312514,6.21321e-7,0.0001122692,0.9935204,0.0000904507,0.00008699529,0.000007602344,0.005238496],"study_design_scores_gemma":[0.0003735071,0.00007802778,0.004426171,0.0001805585,0.00002929848,0.000003881428,0.0001637951,0.9939243,0.0004499948,0.0001719326,0.00007001117,0.0001285505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05688932,0.0002864594,0.9420363,0.00007314029,0.00004058923,0.0001487097,0.000004129621,0.0004206738,0.0001006835],"genre_scores_gemma":[0.9259369,0.000945078,0.07286422,0.000007883583,0.000002270683,0.0000207349,0.00007221273,0.00001868344,0.0001320174],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8691721,"threshold_uncertainty_score":0.556438,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1120187096598312,"gpt":0.3617451143697751,"spread":0.2497264047099439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002787107,0.0001928029,0.0002311688,0.0004128864,0.002047703,0.0003770955,0.0005640578,0.0001542018,0.000103759],"category_scores_gemma":[0.001966679,0.0001492233,0.0001298467,0.001033745,0.0001345249,0.0009461117,0.00004338008,0.0003960336,0.00001524112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005779036,"about_ca_system_score_gemma":0.0001851985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002792665,"about_ca_topic_score_gemma":0.00005843226,"domain_scores_codex":[0.9973547,0.00029995,0.0006519059,0.0007410953,0.0006312749,0.0003210268],"domain_scores_gemma":[0.9963012,0.002413418,0.0002119917,0.000660349,0.0003389856,0.00007399394],"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.00003146111,0.00007319859,0.0002769162,0.00002837133,0.00005159912,2.045883e-7,0.002823522,0.9853712,0.0001237217,0.0002514174,0.000139999,0.01082838],"study_design_scores_gemma":[0.0003271852,0.0001347456,0.0002565973,0.0001421076,0.0001179913,0.00001083994,0.003254091,0.992384,0.0000311576,0.0007780619,0.002401589,0.0001616704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01083671,0.001302443,0.9828709,0.003610219,0.0005212451,0.0003937552,0.0002114906,0.000183561,0.00006960988],"genre_scores_gemma":[0.6960748,0.0001437449,0.3028498,0.00003189614,0.0001355683,0.00005800201,0.0002478012,0.0000241694,0.0004341271],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6852381,"threshold_uncertainty_score":0.9992515,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01462903731252253,"gpt":0.2775491560978298,"spread":0.2629201187853073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004386019,0.0003895582,0.0003016589,0.0007806774,0.0009456113,0.0004792448,0.0005041035,0.000222556,0.00028776],"category_scores_gemma":[0.0001634615,0.0003740803,0.0001088177,0.001152957,0.0003157213,0.001800329,0.00002821947,0.000532397,0.00002937807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002412519,"about_ca_system_score_gemma":0.0003865199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001427972,"about_ca_topic_score_gemma":0.000001238555,"domain_scores_codex":[0.9969026,0.0003431947,0.0004675154,0.001126927,0.0006569723,0.0005027985],"domain_scores_gemma":[0.9974801,0.0007097378,0.0001193343,0.0006018571,0.0007992046,0.0002897779],"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.00004367092,0.0001603991,0.000008814065,0.00003746413,0.00008572525,0.00001320587,0.0003695606,0.916205,0.00001008031,0.001664392,0.0002241147,0.08117758],"study_design_scores_gemma":[0.0007607612,0.0007922386,0.00002987845,0.0001331239,0.00005905553,0.0001502032,0.0004786323,0.9957651,0.00005934292,0.000313752,0.001014122,0.00044379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002441924,0.0003946117,0.9960985,0.001096124,0.0004354207,0.0008188114,0.00006828701,0.0008595653,0.0002043005],"genre_scores_gemma":[0.03177936,0.0005949206,0.9656926,0.00009250573,0.0001272269,0.0002873191,0.0003704403,0.00007589939,0.0009797462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08073379,"threshold_uncertainty_score":0.9998711,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01223234041435819,"gpt":0.270142507485868,"spread":0.2579101670715098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002925416,0.0001357543,0.0001315694,0.000232065,0.0009167998,0.000112196,0.0002146748,0.00008791663,0.000005474339],"category_scores_gemma":[0.0001495403,0.0001404611,0.00007849212,0.0005151661,0.00004618748,0.0002677076,0.00001211988,0.0002596948,0.000002511478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009249715,"about_ca_system_score_gemma":0.00006694438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001828213,"about_ca_topic_score_gemma":0.000001781682,"domain_scores_codex":[0.9988717,0.0001434711,0.0002144202,0.0004233604,0.0001444761,0.0002026124],"domain_scores_gemma":[0.9991957,0.0002249111,0.00008356958,0.0002823486,0.0001574077,0.00005608092],"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.00002888832,0.00009004724,0.0003772178,0.00003751124,0.0000272571,2.817562e-7,0.0001295705,0.7352483,0.00001547117,0.002490808,0.00004845515,0.2615062],"study_design_scores_gemma":[0.0004475388,0.000176809,0.002525171,0.00006006541,0.00002598855,0.000005268397,0.00008734623,0.9864388,0.0000275129,0.000639894,0.0094257,0.0001399777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005906331,0.0001949918,0.9954191,0.002577557,0.000300267,0.0003209235,0.000003216704,0.000369983,0.0002233276],"genre_scores_gemma":[0.4649794,0.0001174454,0.5327802,0.00008736325,0.00003601622,0.0001718594,0.00006085676,0.00001115277,0.001755727],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4643888,"threshold_uncertainty_score":0.7051376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}