{"meta":{"query_hash":"85ae120c64e9","filters":{"venue":"ALIFE"},"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/85ae120c64e9","api":"https://metacan.xera.ac/api/v1/cohort?venue=ALIFE"},"results":[{"id":"W4417124673","doi":"10.1162/isal.a.858","title":"Genetic Encoding and Shared Knowledge in Reinforcement Learning with Structured Memory","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Evolutionary Algorithms and Applications","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":"McMaster University","funders":"","keywords":"Reinforcement learning; Encoding (memory); Genetic programming; Reinforcement; Constant (computer programming); Control (management)","score_opus":0.011801822491799889,"score_gpt":0.2528365909080778,"score_spread":0.2410347684162779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417124673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25542507,0.011665365,0.7070535,0.0026961064,0.0005688108,0.0013076318,0.0000055820738,0.00014105487,0.021136925],"genre_scores_gemma":[0.981603,0.00026974984,0.014715812,0.00018060057,0.00007298535,0.00006884246,0.000004760657,0.000008474994,0.0030757517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984314,0.00008578105,0.00038727256,0.0005743354,0.0001729481,0.00034825626],"domain_scores_gemma":[0.99920934,0.00010379904,0.000109600456,0.00037943007,0.000092981056,0.000104818486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019885875,0.00020824649,0.00021932201,0.00021952495,0.00039215072,0.00017816985,0.00040101237,0.00008244018,0.000054325177],"category_scores_gemma":[0.00002334314,0.0002024549,0.000025826504,0.0009342845,0.000117463365,0.0002566543,0.00040864656,0.00028994653,0.000014445211],"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.000109681336,0.0004591974,0.06325524,0.0008285777,0.0003977518,0.00009131465,0.024502927,0.36259255,0.0037119866,0.18724209,0.0035184657,0.35329023],"study_design_scores_gemma":[0.0011065251,0.00015365292,0.13304007,0.00037595304,0.00003167776,0.000017119466,0.0004651843,0.8570592,0.00025248286,0.0009642278,0.0062047094,0.000329203],"about_ca_topic_score_codex":0.00010859534,"about_ca_topic_score_gemma":0.000096968484,"teacher_disagreement_score":0.72617793,"about_ca_system_score_codex":0.000105929044,"about_ca_system_score_gemma":0.00033123905,"threshold_uncertainty_score":0.8255871},"labels":[],"label_agreement":null},{"id":"W4417133642","doi":"10.1162/isal.a.905","title":"COGENT: Co-design of Robots with Generative Flow Networks","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Tree traversal; Robot; Task (project management); Graph; Process (computing); Suite; Generator (circuit theory); Sample (material); Design process; Range (aeronautics)","score_opus":0.01933843956013918,"score_gpt":0.24801037463318412,"score_spread":0.22867193507304495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417133642","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.0007659282,0.006482023,0.9872884,0.00013665183,0.0006984021,0.00056839356,0.000018325807,0.000058366302,0.0039835214],"genre_scores_gemma":[0.96088326,0.0022890328,0.03415539,0.0004201969,0.000250784,0.00004594028,0.000025967734,0.00006773357,0.0018616937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980772,0.00014237857,0.000597427,0.0004153943,0.00027585996,0.000491701],"domain_scores_gemma":[0.99886405,0.00016806048,0.00011136248,0.0005480618,0.00017493173,0.00013352332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029726388,0.0003961365,0.00056917395,0.00013029655,0.00012893061,0.000063493935,0.00033319384,0.00021897275,0.0004605531],"category_scores_gemma":[0.000029313198,0.00035775226,0.000104459185,0.00051512447,0.00015218687,0.00010336777,0.00005325525,0.00031667936,0.000039485643],"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.00008543236,0.000068281544,0.00027511708,0.00012611166,0.0006383979,0.000023962873,0.00045403972,0.97646326,0.0006683857,0.0035349405,0.006550947,0.011111146],"study_design_scores_gemma":[0.0003821921,0.00019343967,0.0001426628,0.0004080376,0.00015855662,0.000004821075,0.00008138382,0.96297526,0.03352487,0.0001376471,0.0016291287,0.00036199024],"about_ca_topic_score_codex":0.000057714118,"about_ca_topic_score_gemma":0.000015110081,"teacher_disagreement_score":0.96011734,"about_ca_system_score_codex":0.00007447335,"about_ca_system_score_gemma":0.00014181116,"threshold_uncertainty_score":0.99988747},"labels":[],"label_agreement":null},{"id":"W4417133656","doi":"10.1162/isal.a.897","title":"Integrating Neuroplasticity into Genetic Programming Agents for Adaptive Decision Making","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Evolutionary Algorithms and Applications","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":"McMaster University","funders":"","keywords":"Reinforcement learning; Core (optical fiber); Memetics; Path (computing); Genetic programming; Adaptation (eye); Reinforcement; Order (exchange); Ant colony","score_opus":0.02546671363974189,"score_gpt":0.3179001603880881,"score_spread":0.2924334467483462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417133656","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.01237415,0.00080366136,0.9833854,0.0007009424,0.0011661694,0.0011844735,0.0000128990305,0.00009876744,0.00027357778],"genre_scores_gemma":[0.47905296,0.00002635227,0.5198884,0.00046987174,0.00015351626,0.00023022274,0.0000025790794,0.000012270765,0.00016384225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973794,0.00010005466,0.0007059048,0.00094488193,0.00033713563,0.0005326048],"domain_scores_gemma":[0.9975575,0.0010813632,0.00023917944,0.0006016095,0.00039747375,0.00012288043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033050534,0.00030865433,0.00028555765,0.00019676267,0.0011791338,0.00040008238,0.0009945795,0.00012255287,0.0000136665285],"category_scores_gemma":[0.0005151623,0.00031724683,0.00018620775,0.0011420514,0.00013229836,0.00031601012,0.00071439095,0.0002611579,0.000032860575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.000028320264,0.0001965093,0.0006476119,0.0000532731,0.00005230327,0.0000055699898,0.0006442634,0.002806419,0.000056886864,0.079077944,0.0011614122,0.9152695],"study_design_scores_gemma":[0.0004058877,0.00021490664,0.0065318523,0.00062259723,0.00006523482,0.0000071809604,0.00021523888,0.94628805,0.000056708013,0.021697005,0.023611972,0.00028334776],"about_ca_topic_score_codex":0.000058218353,"about_ca_topic_score_gemma":0.000048877275,"teacher_disagreement_score":0.9434816,"about_ca_system_score_codex":0.000160915,"about_ca_system_score_gemma":0.00035119324,"threshold_uncertainty_score":0.99992794},"labels":[],"label_agreement":null},{"id":"W7109950625","doi":"10.1162/isal.a.890","title":"A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Centre","funders":"Advanced Scientific Computing Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Evolvability; Scalability; Key (lock); Testbed; Speedup; Evolutionary algorithm; Locality; Scope (computer science); Evolutionary computation; Pipeline (software)","score_opus":0.008706684595981949,"score_gpt":0.2636518959754561,"score_spread":0.2549452113794741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109950625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7204519,0.025697596,0.24922925,0.00031578777,0.0010002103,0.000812302,0.0010546296,0.000006033618,0.0014322617],"genre_scores_gemma":[0.9834019,0.0008408498,0.01318916,0.00012592987,0.00032426766,0.000112441274,0.00013818587,0.000032582404,0.0018347136],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99772483,0.00004760275,0.00073972094,0.0007776179,0.00019235146,0.0005178644],"domain_scores_gemma":[0.9986049,0.0000566398,0.00028919967,0.00059122726,0.00035957556,0.00009849342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020748093,0.000376706,0.0006329051,0.00012391846,0.00026006636,0.000072888135,0.00033508264,0.00028453983,0.000013806473],"category_scores_gemma":[0.00008620046,0.00040197038,0.00043990402,0.0003438504,0.00022713447,0.0000046770333,0.000402939,0.000072332485,0.0000032339478],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00032415913,0.0008640769,0.0073562916,0.0002524674,0.004664605,0.0000011785498,0.00023128076,0.00038452668,0.87447256,0.001522509,0.00461943,0.105306916],"study_design_scores_gemma":[0.0035519977,0.000783253,0.001763696,0.00011850238,0.00090212247,0.0000018446021,0.0007908983,0.003669453,0.9348778,0.0031087664,0.04974431,0.00068733364],"about_ca_topic_score_codex":0.00014557519,"about_ca_topic_score_gemma":0.000010505945,"teacher_disagreement_score":0.26294994,"about_ca_system_score_codex":0.000092138755,"about_ca_system_score_gemma":0.00026228937,"threshold_uncertainty_score":0.99984324},"labels":[],"label_agreement":null},{"id":"W7110053102","doi":"10.1162/isal.a.834","title":"Using Dynamical Systems Theory to Quantify Complexity in Asymptotic Lenia","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Cellular Automata and Applications","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Dynamical systems theory; Attractor; Lyapunov exponent; Covariant transformation; Fractal; Chaotic; Dynamical system (definition); Measure (data warehouse); Fractal dimension","score_opus":0.10016932677256382,"score_gpt":0.35628269138924556,"score_spread":0.25611336461668177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110053102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20836748,0.00062588614,0.78570265,0.0018031077,0.001051958,0.0006973395,0.00002251331,0.000097230906,0.0016318519],"genre_scores_gemma":[0.98963684,0.000008959108,0.008713951,0.0008266938,0.00006643607,0.00003677339,0.000008742947,0.000014855,0.00068672874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969878,0.000488345,0.000765585,0.0008414613,0.00033231682,0.0005844657],"domain_scores_gemma":[0.9979639,0.00033843107,0.000120979144,0.0012825913,0.00009285617,0.00020121664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010066328,0.00028024625,0.0004677799,0.00035762886,0.0002946572,0.000547371,0.0013318235,0.00015343181,0.0000284703],"category_scores_gemma":[0.00010145318,0.00030741148,0.00011939917,0.0019104921,0.00018779494,0.00023566128,0.0008363106,0.00029395684,0.000303977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.0000111929685,0.00021477816,0.0015107258,0.000114879396,0.000036111007,0.000016944263,0.0003304435,0.004268028,0.0024092863,0.9876289,0.00023006981,0.0032286649],"study_design_scores_gemma":[0.00032611043,0.000024562936,0.013328304,0.00039909128,0.000036929934,0.000017546054,0.00012865692,0.9711823,0.00019187076,0.009183806,0.0048604636,0.00032038082],"about_ca_topic_score_codex":0.0011488887,"about_ca_topic_score_gemma":0.00017486722,"teacher_disagreement_score":0.97844505,"about_ca_system_score_codex":0.00027600696,"about_ca_system_score_gemma":0.00039867562,"threshold_uncertainty_score":0.9999378},"labels":[],"label_agreement":null},{"id":"W7110060432","doi":"10.1162/isal.a.888","title":"Energy Costs and Neural Complexity Evolution in Changing Environments","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"University of Cape Town","keywords":"Artificial neural network; Energy (signal processing); Cognition; Reinforcement learning; Key (lock); Efficient energy use","score_opus":0.020688039422258175,"score_gpt":0.2517305875269306,"score_spread":0.23104254810467245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110060432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02382361,0.00085715554,0.9703449,0.0012408696,0.0010247268,0.00017110219,0.0000014628637,0.00003163598,0.0025045401],"genre_scores_gemma":[0.99397135,0.00015931528,0.0012235795,0.0012873154,0.000052931402,0.000009178359,0.000006158745,0.000009076505,0.0032810979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782467,0.0002267799,0.00044613495,0.00054251234,0.00034587784,0.0006140285],"domain_scores_gemma":[0.9991269,0.00011060078,0.0001552271,0.00048814836,0.000015620592,0.00010350139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039224944,0.00023762659,0.00026001717,0.0005978809,0.0002547374,0.00019294837,0.00050355453,0.0001154678,0.000021789463],"category_scores_gemma":[0.00005593817,0.00028271074,0.000045989265,0.0009890461,0.00022942685,0.00042654097,0.0010489253,0.00023567518,0.000016007698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00003580889,0.00012656873,0.09956957,0.00008988719,0.000084054314,0.000039639603,0.0014559039,0.39354736,0.0004922404,0.45759767,0.00035133166,0.046609957],"study_design_scores_gemma":[0.00060974545,0.00006533593,0.05749254,0.0001464529,0.000013305365,0.0000037648092,0.0000735214,0.9381367,0.000113603666,0.0005860642,0.0025489088,0.00021004118],"about_ca_topic_score_codex":0.0003506516,"about_ca_topic_score_gemma":0.000036448386,"teacher_disagreement_score":0.9701477,"about_ca_system_score_codex":0.000458457,"about_ca_system_score_gemma":0.00006380338,"threshold_uncertainty_score":0.9999625},"labels":[],"label_agreement":null},{"id":"W7110289622","doi":"10.1162/isal.a.887","title":"ProtoCell: a computational protocell model implemented using <i>String</i>","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Origins and Evolution of Life","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Protocell; Ribozyme; String (physics); Encoding (memory); Factory (object-oriented programming); Soundness; Code (set theory); Computational model","score_opus":0.02977239781397752,"score_gpt":0.3417751044939986,"score_spread":0.3120027066800211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110289622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10739817,0.00016294804,0.83969486,0.002141918,0.0007546948,0.01949932,0.0012012195,0.0001411417,0.029005751],"genre_scores_gemma":[0.9816341,0.0000026270925,0.00948943,0.0008105621,0.000545323,0.0015149596,0.00017543948,0.000047682002,0.005779879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711597,0.0000874467,0.0009569526,0.00066835055,0.0004335478,0.0007377134],"domain_scores_gemma":[0.9986295,0.000054488264,0.0003652543,0.00040811938,0.00032134153,0.00022129812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030205154,0.00046111792,0.00047525362,0.00019431327,0.00047059444,0.00023291481,0.0003407111,0.0001124335,0.000481786],"category_scores_gemma":[0.000007120004,0.00050643267,0.00031190095,0.0005482886,0.00012836586,0.0002659645,0.00025952086,0.00035284366,0.000099326026],"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.00028735973,0.0017143737,0.05923789,0.0006585525,0.00095919135,0.000004387729,0.00039799573,0.50694823,0.0011319709,0.35353723,0.07283804,0.002284796],"study_design_scores_gemma":[0.0025500788,0.000069194815,0.00012275665,0.0003072483,0.00014691304,8.359941e-7,0.0001998167,0.86747724,0.0010415087,0.016192516,0.1114166,0.00047526785],"about_ca_topic_score_codex":0.00030169135,"about_ca_topic_score_gemma":0.0000025221016,"teacher_disagreement_score":0.8742359,"about_ca_system_score_codex":0.00018296824,"about_ca_system_score_gemma":0.0017307126,"threshold_uncertainty_score":0.99973875},"labels":[],"label_agreement":null},{"id":"W7110436880","doi":"10.1162/isal.a.871","title":"Causal Leverage Density: A Universal Framework for Semantic Information","year":2025,"lang":"","type":"article","venue":"ALIFE","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Semtech (Canada)","funders":"Space Telescope Science Institute; John Templeton Foundation; National Aeronautics and Space Administration","keywords":"Leverage (statistics); Meaning (existential); Information theory; Rule-based machine translation; Limiting; Function (biology); Semantics (computer science)","score_opus":0.012761669134392526,"score_gpt":0.29475351964402813,"score_spread":0.2819918505096356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110436880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53982174,0.0011192674,0.38699147,0.025252042,0.006978082,0.0023940976,0.000104331506,0.0002770147,0.03706193],"genre_scores_gemma":[0.99166363,0.00014718756,0.0007065086,0.0031144675,0.00038837668,0.000011766807,0.000041607575,0.0000041228973,0.0039223554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879044,0.0001092459,0.00027533478,0.00017204761,0.00027842305,0.00037449558],"domain_scores_gemma":[0.9991645,0.00019964951,0.00014020508,0.00016194308,0.00024187434,0.00009183435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385203,0.00014484157,0.00019330681,0.000078833764,0.00085912,0.00020780413,0.0002085622,0.00031388568,0.00020195288],"category_scores_gemma":[0.00064537005,0.00013698844,0.00013892761,0.0005846208,0.00014148159,0.0010889584,0.00006786279,0.00017496111,0.00015548008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.000115003364,0.000051958054,0.0009979316,0.00017137847,0.00017427703,0.000005196328,0.06027249,0.000033796103,0.00006209248,0.88988537,0.029728908,0.01850158],"study_design_scores_gemma":[0.0023990031,0.00028349223,0.011636341,0.0009870087,0.00094307243,0.0000037933341,0.16911112,0.0049993494,0.00090745714,0.13470645,0.672917,0.0011058911],"about_ca_topic_score_codex":0.0027731895,"about_ca_topic_score_gemma":0.0010508635,"teacher_disagreement_score":0.7551789,"about_ca_system_score_codex":0.00023421999,"about_ca_system_score_gemma":0.0003806459,"threshold_uncertainty_score":0.6607743},"labels":[],"label_agreement":null}]}