{"meta":{"query_hash":"3e328a8c3ad1","filters":{"venue":"Algorithmic Learning Theory"},"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/3e328a8c3ad1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Algorithmic+Learning+Theory"},"results":[{"id":"W2771084866","doi":"","title":"Erasing Pattern Languages Distinguishable by a Finite Number of Strings","year":2017,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.006884749596829058,"score_gpt":0.2788451375763609,"score_spread":0.27196038797953187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771084866","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.9764548,0.0002453289,0.013215843,0.000037980182,0.000090304464,0.00005719847,0.000011308393,0.000025247256,0.009862007],"genre_scores_gemma":[0.9958035,0.00003079934,0.0007573952,0.00007383244,0.00024674012,0.0000026127268,0.000059826583,0.000016241052,0.0030090902],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999161,0.00012913256,0.00015287429,0.0002585353,0.000077832396,0.00022061648],"domain_scores_gemma":[0.999303,0.000085504,0.00022569703,0.00029438245,0.000048868376,0.000042550993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047625854,0.00012162149,0.00014481561,0.000010376226,0.0002880279,0.00005189613,0.00032101377,0.00010791888,0.000053981516],"category_scores_gemma":[0.0011170714,0.000102085476,0.00007434394,0.00001805818,0.00013547338,0.000004250912,0.00026533537,0.0001674518,0.0000146102975],"study_design_candidate":"bench_or_experimental","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.00007797133,0.000090837326,0.23005417,0.000052920725,0.0001328556,0.000020150184,0.00021738064,0.00007313527,0.28877205,0.00028152048,0.00063995854,0.47958705],"study_design_scores_gemma":[0.0059860144,0.0021354337,0.112511955,0.00086038857,0.00024235902,0.00018855798,0.002787833,0.008096768,0.5879699,0.006599295,0.26927722,0.0033442716],"about_ca_topic_score_codex":0.00008304948,"about_ca_topic_score_gemma":0.0000011413815,"teacher_disagreement_score":0.47624278,"about_ca_system_score_codex":0.0000058538476,"about_ca_system_score_gemma":0.000013831507,"threshold_uncertainty_score":0.4162925},"labels":[],"label_agreement":null},{"id":"W2773427878","doi":"","title":"Preference-based Teaching of Unions of Geometric Objects.","year":2017,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Regina","funders":"","keywords":"Preference; Computer science; Computer vision; Artificial intelligence; Computer graphics (images); Human–computer interaction; Mathematics; Statistics","score_opus":0.016312891082607497,"score_gpt":0.2234733306023899,"score_spread":0.2071604395197824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773427878","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.34043297,0.0003823419,0.611134,0.000019467048,0.00038190564,0.00018612185,0.000009173669,0.00032396283,0.04713004],"genre_scores_gemma":[0.99307615,0.00004713619,0.006358182,0.000002602919,0.000034872814,0.000005298472,0.000008417281,0.000024969188,0.00044235945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937063,0.00006824375,0.00018797362,0.00010832453,0.00012353914,0.00014128129],"domain_scores_gemma":[0.99927133,0.00017843652,0.00016600208,0.000308324,0.000044006094,0.00003189965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052202406,0.00010330146,0.00017679723,0.00021364953,0.00018730626,0.00002532229,0.0002850417,0.00006731157,0.00004858059],"category_scores_gemma":[0.0004599892,0.00009896744,0.000049042,0.00006855169,0.000064431195,0.00011559635,0.000039674112,0.00028863043,0.000003681724],"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.000014715738,0.000034479795,0.0020080146,0.00035417368,0.00006206056,0.0000011377838,0.0008191082,0.8247087,0.00041738444,0.0027659265,0.000024305149,0.16879],"study_design_scores_gemma":[0.0017840007,0.00028436008,0.033609547,0.00063946994,0.00013940874,0.000003901587,0.000667639,0.87753,0.07697591,0.004846629,0.0028096,0.00070956],"about_ca_topic_score_codex":0.000031746924,"about_ca_topic_score_gemma":6.5200436e-7,"teacher_disagreement_score":0.6526432,"about_ca_system_score_codex":0.000020609103,"about_ca_system_score_gemma":0.000023805933,"threshold_uncertainty_score":0.40357748},"labels":[],"label_agreement":null},{"id":"W2798447324","doi":"","title":"On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference","year":2018,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Learnability; Inference; Inductive reasoning; Bounded function; Shot (pellet); Computer science; Comparator; Artificial intelligence; Mathematics; Engineering; Electrical engineering; Mathematical analysis","score_opus":0.02605099024266741,"score_gpt":0.2997311155748661,"score_spread":0.27368012533219865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798447324","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.77556616,0.00003107029,0.22277632,0.000606714,0.0000954706,0.00034452436,0.0000030482372,0.000034703266,0.00054196746],"genre_scores_gemma":[0.9972474,0.000008726719,0.002484634,0.00011134723,0.000044933127,0.000041218103,7.482771e-7,0.0000054761654,0.000055546716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905396,0.0002466407,0.00015403477,0.00026457346,0.000111692476,0.00016910674],"domain_scores_gemma":[0.998309,0.001201932,0.000093340415,0.0002774107,0.00008305991,0.000035217297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094827294,0.00009126451,0.00013913277,0.000041639116,0.00022276415,0.00004562875,0.0003341672,0.000038575905,0.0000086697055],"category_scores_gemma":[0.00022319173,0.00006568478,0.000031400003,0.00024708957,0.00038584933,0.00010987021,0.00010354369,0.00023374088,0.000002888516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.0000718961,0.00004483108,0.0014148179,0.000008550214,0.000019537942,3.9374726e-7,0.0026608566,0.00043857604,0.0004538294,0.95919955,0.0001593296,0.035527855],"study_design_scores_gemma":[0.0009304679,0.0009692225,0.0154567715,0.00008961555,0.000013636848,0.0000027637573,0.0015348402,0.110242225,0.00305272,0.8599806,0.007379094,0.00034804858],"about_ca_topic_score_codex":0.000020865251,"about_ca_topic_score_gemma":0.000006840449,"teacher_disagreement_score":0.22168119,"about_ca_system_score_codex":0.0000359249,"about_ca_system_score_gemma":0.000060781273,"threshold_uncertainty_score":0.26785475},"labels":[],"label_agreement":null},{"id":"W2798705462","doi":"","title":"Multi-task {K}ernel {L}earning Based on {P}robabilistic {L}ipschitzness.","year":2018,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.02632089831741377,"score_gpt":0.224098277679742,"score_spread":0.19777737936232823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798705462","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.19139652,0.00075373234,0.66766626,0.0005046613,0.0028211398,0.00060052186,0.000117640724,0.00068490487,0.13545464],"genre_scores_gemma":[0.9799263,0.000028101147,0.008479591,0.0007085717,0.000680394,0.00004161564,0.000030847714,0.000110051165,0.009994543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755615,0.00017449031,0.0006936918,0.00087352656,0.000054964345,0.00064715603],"domain_scores_gemma":[0.9981203,0.00052663573,0.00047476866,0.0006476071,0.000060208124,0.00017049145],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002437836,0.0003499263,0.0005517444,0.0003055444,0.000522012,0.00012342863,0.0004776804,0.00019842568,0.0017097393],"category_scores_gemma":[0.000983771,0.00039629114,0.00021320564,0.00021083532,0.00037051577,0.00018868998,0.000114136295,0.0006231411,0.004885266],"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.00024277906,0.0002667725,0.0063327565,0.00004612099,0.00013238544,0.000015750706,0.0022213182,0.025432657,0.00008209537,0.950026,0.0003310969,0.014870272],"study_design_scores_gemma":[0.0026754935,0.00072583917,0.0040044375,0.000093696246,0.000026646134,0.000012401531,0.0004623708,0.67789793,0.00010105196,0.20049217,0.11239591,0.0011120271],"about_ca_topic_score_codex":0.00009138086,"about_ca_topic_score_gemma":0.0000052677224,"teacher_disagreement_score":0.78852975,"about_ca_system_score_codex":0.00021260195,"about_ca_system_score_gemma":0.00005319301,"threshold_uncertainty_score":0.9998489},"labels":[],"label_agreement":null},{"id":"W2941668132","doi":"","title":"Old Techniques in Differentially Private Linear Regression.","year":2019,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Survey Sampling and Estimation Techniques","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear regression; Computer science; Statistics; Mathematics","score_opus":0.029171362033690015,"score_gpt":0.3203901574777243,"score_spread":0.2912187954440343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941668132","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.8303974,0.0000650436,0.16159315,0.000095597985,0.0002284336,0.00056715147,0.0000025612578,0.0018639725,0.005186648],"genre_scores_gemma":[0.75386363,0.00008247158,0.23286404,0.00010191553,0.00015728254,0.000077202814,0.000026074698,0.0001081511,0.012719245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812824,0.0006010485,0.00039402622,0.00033131248,0.00023955185,0.00030583655],"domain_scores_gemma":[0.9980303,0.0012317057,0.00020109939,0.00042476924,0.000060636576,0.000051469466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024361424,0.00021852013,0.000338155,0.00024223719,0.0000792551,0.00003326262,0.00028663594,0.000186488,0.00033163585],"category_scores_gemma":[0.0011919212,0.00018003632,0.000086525826,0.00021562968,0.00005049894,0.00012725702,0.0001244281,0.0006318568,0.00015137994],"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.000428797,0.00071597093,0.056481067,0.00065815577,0.00016522125,0.000059101865,0.0055077,0.00016297722,0.017830323,0.4248807,0.0014233807,0.49168658],"study_design_scores_gemma":[0.0009414415,0.0003097004,0.0047497423,0.0014321477,0.00003378985,0.000029029605,0.0003023038,0.0104023125,0.04290889,0.9285349,0.009489298,0.0008664074],"about_ca_topic_score_codex":0.000026972499,"about_ca_topic_score_gemma":0.0000014852266,"teacher_disagreement_score":0.50365424,"about_ca_system_score_codex":0.000072570685,"about_ca_system_score_gemma":0.00002852172,"threshold_uncertainty_score":0.7341668},"labels":[],"label_agreement":null},{"id":"W2963067765","doi":"","title":"Structured Best Arm Identification with Fixed Confidence","year":2017,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"University of Alberta","funders":"","keywords":"Minimax; Sample complexity; Computer science; Tree (set theory); Action (physics); Identification (biology); Set (abstract data type); Sample (material); Tree structure; Mathematical optimization; Upper and lower bounds; Artificial intelligence; Mathematics; Algorithm; Theoretical computer science; Combinatorics; Binary tree","score_opus":0.02116394259325816,"score_gpt":0.2317819381336895,"score_spread":0.21061799554043134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963067765","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.8659249,0.0012201073,0.078460254,0.0005838245,0.0012263537,0.0003561012,0.000053012423,0.0001253719,0.052050054],"genre_scores_gemma":[0.98127425,0.00021742644,0.00045918152,0.000056502915,0.00018841657,0.000011531308,0.000017494773,0.000027042948,0.017748136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998983,0.000014837825,0.00034028085,0.00037171197,0.000052903124,0.0002372416],"domain_scores_gemma":[0.9984406,0.000041330066,0.0007313181,0.00066966977,0.000052985266,0.00006408848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717006,0.00014285927,0.0002471316,0.0001009646,0.000678312,0.00033846693,0.0004481571,0.00007503453,0.00075471954],"category_scores_gemma":[0.00017824264,0.00013858665,0.000056579345,0.00005712178,0.0001844796,0.00035241048,0.000056020715,0.00027641133,0.00059390505],"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.00008636688,0.00008265067,0.15218663,0.00004141316,0.00017804121,0.000027673419,0.0012619614,0.003001234,0.00009620898,0.81646127,0.00021018444,0.026366347],"study_design_scores_gemma":[0.0021397022,0.00046931955,0.5195154,0.00015547202,0.00007542138,0.00006904357,0.0009194135,0.09760875,0.000698153,0.25794742,0.11899651,0.0014054247],"about_ca_topic_score_codex":0.00022483547,"about_ca_topic_score_gemma":0.000018676701,"teacher_disagreement_score":0.5585139,"about_ca_system_score_codex":0.000042750355,"about_ca_system_score_gemma":0.000022302665,"threshold_uncertainty_score":0.826365},"labels":[],"label_agreement":null},{"id":"W3037679484","doi":"","title":"On Learnability wih Computable Learners.","year":2020,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Waterloo","funders":"","keywords":"Learnability; Computer science; Artificial intelligence","score_opus":0.013372520359430193,"score_gpt":0.22632398920355495,"score_spread":0.21295146884412475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037679484","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.024679145,0.00009235175,0.95711464,0.009108271,0.00016373135,0.00021650834,8.033764e-7,0.0008371487,0.0077873818],"genre_scores_gemma":[0.98375595,0.000018510354,0.01126528,0.0034066974,0.00026492044,0.000017437273,0.0000040468135,0.000021786393,0.0012453556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983111,0.00039039648,0.0001896321,0.00056074164,0.00022141341,0.00032673884],"domain_scores_gemma":[0.9987697,0.00051626895,0.00009107666,0.0003987801,0.000039301092,0.0001848545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005339548,0.0001631031,0.00018305576,0.000031637388,0.0003072385,0.00013109249,0.0008012282,0.000060429327,0.00008296266],"category_scores_gemma":[0.00016847331,0.00014786859,0.00008918913,0.0004412184,0.000080149184,0.00020198575,0.00027454848,0.0006743379,0.00070380437],"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.000026010928,0.000078631936,0.00015661542,0.000012921018,0.000026150365,0.000017122755,0.0012643251,0.110017546,0.00032426015,0.61368346,0.0035063913,0.27088654],"study_design_scores_gemma":[0.00041707364,0.00036775973,0.00028373147,0.000015742904,0.000008055627,0.000010914154,0.00011197017,0.83747405,0.00026438685,0.08454124,0.076161094,0.00034400768],"about_ca_topic_score_codex":0.0000074952113,"about_ca_topic_score_gemma":1.3156526e-7,"teacher_disagreement_score":0.9590768,"about_ca_system_score_codex":0.000033451524,"about_ca_system_score_gemma":0.000043343374,"threshold_uncertainty_score":0.9046216},"labels":[],"label_agreement":null},{"id":"W3125798464","doi":"","title":"An Exponential Tail bound for Lq Stable Learning Rules.","year":2019,"lang":"en","type":"article","venue":"Algorithmic Learning Theory","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Exponential function; Mathematics; Upper and lower bounds; Stability (learning theory); Mathematical optimization; Computer science; Applied mathematics; Machine learning; Mathematical analysis","score_opus":0.0061748898356533246,"score_gpt":0.24255154468119505,"score_spread":0.23637665484554174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125798464","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.1640578,0.0002790009,0.82831997,0.00019996412,0.0013733415,0.00048370095,0.000003872246,0.0011788091,0.004103546],"genre_scores_gemma":[0.83051586,0.000041316496,0.11947201,0.00031434043,0.001198711,0.00011446832,0.00013350155,0.00016293734,0.04804683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959652,0.001045567,0.0004298384,0.0010854341,0.0005036027,0.00097038824],"domain_scores_gemma":[0.9976723,0.0007407088,0.00030904583,0.0008580284,0.0001680475,0.00025182246],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031613887,0.0004094112,0.0004597099,0.00025797606,0.00081323757,0.0006604522,0.0014666404,0.00019565028,0.0003567927],"category_scores_gemma":[0.00032559116,0.0004031949,0.00022189545,0.00033417382,0.00009546623,0.0010699474,0.00031414648,0.0012255536,0.00087974535],"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.00018389845,0.00034129736,0.0034510163,0.00016033388,0.00022777247,0.000042556236,0.00706206,0.06082353,0.009168512,0.1667878,0.0005145709,0.7512366],"study_design_scores_gemma":[0.0017167011,0.0010330089,0.0006184878,0.00006013973,0.000029613779,0.000049489005,0.0006004707,0.85523474,0.0006989055,0.016820319,0.12233186,0.00080625253],"about_ca_topic_score_codex":0.00008415195,"about_ca_topic_score_gemma":0.0000011054947,"teacher_disagreement_score":0.79441124,"about_ca_system_score_codex":0.000102997044,"about_ca_system_score_gemma":0.0001737787,"threshold_uncertainty_score":0.9998982},"labels":[],"label_agreement":null}]}