{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37310275,0.0005453672,0.61361426,0.001655493,0.0003359006,0.000072356524,0.00021323202,0.001638371,0.008822209],"genre_scores_gemma":[0.8614869,0.00024002024,0.13078801,0.00069855066,0.00010989001,0.00009229719,0.000262935,0.00032635435,0.0059950952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988422,0.0002536853,0.00011651337,0.00032632853,0.00027435497,0.00018690605],"domain_scores_gemma":[0.99178386,0.005460843,0.0004804117,0.0016370871,0.0003645158,0.00027333043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009481045,0.00048060084,0.0007237538,0.0005927046,0.0005576796,0.0016827334,0.0013946414,0.0013971013,0.00315025],"category_scores_gemma":[0.009575078,0.0004714895,0.0007301198,0.0006415133,0.0016599954,0.005019042,0.0030543706,0.002425677,0.0008142103],"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.0015894421,0.00039718853,0.0032817216,0.00066995306,0.00014531754,0.0007706978,0.00071852515,0.049102604,0.15668188,0.39347145,0.003954111,0.3892172],"study_design_scores_gemma":[0.000115754934,0.00023190177,0.00047831933,0.00008482553,0.000049957558,0.00043233903,0.00022803522,0.27723595,0.08327513,0.6328239,0.004992994,0.0000509508],"about_ca_topic_score_codex":0.00023504527,"about_ca_topic_score_gemma":0.0005224917,"teacher_disagreement_score":0.00315025,"about_ca_system_score_codex":0.0004206193,"about_ca_system_score_gemma":0.000739165,"threshold_uncertainty_score":0.010538638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090224534,0.0009052102,0.71266305,0.0032086722,0.00045534348,0.00014636609,0.0001976748,0.0008825384,0.19131657],"genre_scores_gemma":[0.78108156,0.0006239561,0.18751301,0.00043625841,0.00012711326,0.00016514755,0.000264277,0.0001425726,0.029646149],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990503,0.00043274055,0.000026230036,0.00018914863,0.00023984944,0.00006175524],"domain_scores_gemma":[0.9977792,0.0013334536,0.00012560148,0.00035282306,0.00019451832,0.00021448295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010174758,0.00039765125,0.000310742,0.00027334507,0.0005304367,0.0010074611,0.0011889006,0.0007025784,0.020601876],"category_scores_gemma":[0.007947139,0.00019299996,0.00039661926,0.0003237891,0.0007540477,0.0021074854,0.0016253137,0.0016983988,0.0022461347],"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.0006821821,0.00070940185,0.0025136487,0.00043778605,0.000054180367,0.00013340608,0.0012258989,0.027580867,0.012122057,0.4135302,0.029143414,0.51186705],"study_design_scores_gemma":[0.00017498809,0.0006347051,0.0029997376,0.00016978699,0.00005585088,0.00035144982,0.0008031394,0.18185814,0.015723884,0.7191676,0.07801438,0.000046390847],"about_ca_topic_score_codex":0.00066896435,"about_ca_topic_score_gemma":0.0019164124,"teacher_disagreement_score":0.020601876,"about_ca_system_score_codex":0.0007114412,"about_ca_system_score_gemma":0.0007857393,"threshold_uncertainty_score":0.068920135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011877771,0.00060868723,0.972937,0.0019071709,0.00019707806,0.00006094315,0.0001395897,0.00070059526,0.011571147],"genre_scores_gemma":[0.6486618,0.0008741747,0.33444518,0.0017532808,0.00063559064,0.00037460812,0.0005176997,0.00080342044,0.011934162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904218,0.004308736,0.00058723113,0.0019690292,0.0019947777,0.00071845495],"domain_scores_gemma":[0.9519128,0.036217492,0.001298997,0.0078738015,0.001821826,0.00087506673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014328751,0.0012509765,0.0023197534,0.0027912904,0.0023370874,0.0063328245,0.005003528,0.0046691056,0.011508258],"category_scores_gemma":[0.06327005,0.001603654,0.0027221953,0.0022323914,0.01351695,0.026510064,0.010760858,0.011307446,0.0015801234],"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.00011349718,0.000027228882,0.00018036996,0.00006480073,0.000021523432,0.00003486249,0.00013862072,0.0055549885,0.0004892081,0.97382337,0.000917187,0.018634247],"study_design_scores_gemma":[0.000012141479,0.000014328114,0.000030492745,0.000016267993,0.000009097408,0.000014842494,0.000013467272,0.01903206,0.00032897497,0.97998613,0.0005315796,0.000010588148],"about_ca_topic_score_codex":0.0015409536,"about_ca_topic_score_gemma":0.002231548,"teacher_disagreement_score":0.014328751,"about_ca_system_score_codex":0.0030896096,"about_ca_system_score_gemma":0.0026525739,"threshold_uncertainty_score":0.075778544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22652458,0.0011605063,0.7408971,0.0025417404,0.00036344692,0.00026457646,0.0009007502,0.0018878455,0.02545941],"genre_scores_gemma":[0.9591431,0.00014987566,0.03096581,0.00021666131,0.00010164642,0.000108790904,0.00039000675,0.00011531128,0.008808791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986927,0.00040052182,0.000087247514,0.00033830115,0.00019794545,0.0002831976],"domain_scores_gemma":[0.99601305,0.0019871835,0.0003957868,0.00053853827,0.00046609205,0.0005993279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022055327,0.001018826,0.0016744081,0.0010351154,0.0008141622,0.0015829349,0.0024952579,0.0018851669,0.01267777],"category_scores_gemma":[0.011298286,0.00035064478,0.00062055537,0.0007303419,0.0010009817,0.002744642,0.0035644784,0.0017061537,0.0015826968],"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.002112124,0.0010725172,0.006285552,0.0004478259,0.00028303562,0.0003170816,0.00024816682,0.4052444,0.0044846847,0.122131206,0.024016077,0.4333573],"study_design_scores_gemma":[0.000050591905,0.00012477975,0.0009348402,0.0000228564,0.000023445802,0.000046738533,0.000028456563,0.9216676,0.00085797213,0.075359225,0.0008647746,0.00001882059],"about_ca_topic_score_codex":0.002649185,"about_ca_topic_score_gemma":0.0032771698,"teacher_disagreement_score":0.01267777,"about_ca_system_score_codex":0.00092049816,"about_ca_system_score_gemma":0.0014225222,"threshold_uncertainty_score":0.042411327},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046102935,0.010255146,0.97112817,0.0048960084,0.0006118642,0.000051373572,0.00031730352,0.00020405736,0.007925733],"genre_scores_gemma":[0.40760022,0.021875735,0.5214196,0.004410915,0.006920069,0.0008289725,0.0011911173,0.00038187776,0.03537153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99124956,0.005785652,0.00023509246,0.0010303967,0.0014096203,0.0002896533],"domain_scores_gemma":[0.9729337,0.019150726,0.000953911,0.005106527,0.0014440529,0.00041096497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0132121565,0.0012636376,0.0016230869,0.0022854828,0.0012362936,0.0019144525,0.00267704,0.0018777436,0.005505837],"category_scores_gemma":[0.047805846,0.0008362306,0.0009261012,0.0044499026,0.0038867486,0.0065436214,0.0034508232,0.0059432886,0.0018402],"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.000089986446,0.00006037672,0.0011561295,0.00024857666,0.00010015687,0.000030554686,0.00012859784,0.008564204,0.00026561652,0.9078033,0.009694945,0.071857624],"study_design_scores_gemma":[0.00004076565,0.000040998915,0.0004938137,0.0001000079,0.000037981317,0.00005980436,0.000032664066,0.052366365,0.00041428828,0.93276954,0.0136292,0.000014610056],"about_ca_topic_score_codex":0.0015834633,"about_ca_topic_score_gemma":0.0017676651,"teacher_disagreement_score":0.0132121565,"about_ca_system_score_codex":0.002350259,"about_ca_system_score_gemma":0.0019477635,"threshold_uncertainty_score":0.06987339},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04979363,0.00040054266,0.94376445,0.0010849957,0.000042108644,0.00009904213,0.0003150279,0.00028464475,0.0042154486],"genre_scores_gemma":[0.8241048,0.00043046428,0.16440642,0.00057338283,0.00014424077,0.00044790647,0.0008929382,0.00016205721,0.008837879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996203,0.0016218687,0.00016110521,0.0009992967,0.0006090203,0.00040571782],"domain_scores_gemma":[0.9696751,0.023941137,0.0031181376,0.001655061,0.00072218874,0.00088826625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006423134,0.002039708,0.00432569,0.0014222601,0.000684702,0.0028252043,0.0035363382,0.004752644,0.0067330366],"category_scores_gemma":[0.039965335,0.0012604989,0.001383373,0.0016986649,0.0030331553,0.004582913,0.003822386,0.0044215447,0.0011820501],"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.00027394458,0.000108045,0.0017330449,0.00015303251,0.000109879365,0.00015667308,0.00009826648,0.8777383,0.00051975186,0.09848912,0.0012429099,0.019377002],"study_design_scores_gemma":[0.00003728606,0.0000736126,0.00020600951,0.000027145647,0.000012962986,0.000029334817,0.000015632977,0.91077423,0.00023827453,0.08824668,0.0003219295,0.000016805343],"about_ca_topic_score_codex":0.0018889343,"about_ca_topic_score_gemma":0.0016695736,"teacher_disagreement_score":0.0067330366,"about_ca_system_score_codex":0.0014456448,"about_ca_system_score_gemma":0.0018221863,"threshold_uncertainty_score":0.033969164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062790155,0.0062456205,0.8308516,0.008317406,0.00046227247,0.0000935668,0.00053574506,0.0003496374,0.09035393],"genre_scores_gemma":[0.8732202,0.0049626203,0.09555941,0.0015486804,0.0014656474,0.0003800554,0.0011414179,0.00027355572,0.021448418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964457,0.0015344352,0.00019438734,0.0006308303,0.0008511511,0.00034358737],"domain_scores_gemma":[0.966079,0.028931389,0.0007656344,0.0023059098,0.0012662085,0.0006517752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040245284,0.0008743331,0.001180151,0.002025799,0.0011705885,0.0031294639,0.0015643835,0.0019776847,0.008459911],"category_scores_gemma":[0.042123366,0.00052776485,0.0010236874,0.001484046,0.0060086083,0.01251983,0.004249364,0.005661682,0.0010353975],"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.000025565178,0.000016785187,0.00035081294,0.00008173737,0.000017062854,0.000028369626,0.00011987422,0.004496818,0.00014942451,0.98077285,0.0016805162,0.012260109],"study_design_scores_gemma":[0.000007028171,0.000009845496,0.00011935379,0.000022534372,0.0000041803823,0.000021157235,0.000019511659,0.010759193,0.000097749864,0.98771393,0.0012221134,0.0000033770575],"about_ca_topic_score_codex":0.0013702856,"about_ca_topic_score_gemma":0.001136569,"teacher_disagreement_score":0.008459911,"about_ca_system_score_codex":0.0017066379,"about_ca_system_score_gemma":0.0009989071,"threshold_uncertainty_score":0.02830118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02190312,0.0015764337,0.9512273,0.002306941,0.00034665718,0.00009753908,0.00036272738,0.00067558454,0.021503717],"genre_scores_gemma":[0.8115832,0.0018763987,0.15158033,0.0028869128,0.0010248619,0.00052825705,0.0013779232,0.00092131156,0.028220795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923981,0.0018730193,0.0004061616,0.001063232,0.0033619439,0.000897624],"domain_scores_gemma":[0.8839206,0.09158503,0.0023976667,0.008966644,0.010748076,0.0023820184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010508643,0.0010504654,0.0015771774,0.0020775818,0.0014267009,0.0046928967,0.003806385,0.0023572105,0.017162418],"category_scores_gemma":[0.11079897,0.0009179509,0.0012711581,0.0022581427,0.0036954277,0.010713864,0.0051018586,0.008240258,0.003214427],"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.00034575138,0.00021205052,0.0027141613,0.00029922574,0.00009350296,0.00016104929,0.00030386975,0.04219532,0.0018163485,0.8655409,0.011593554,0.074724175],"study_design_scores_gemma":[0.000029116594,0.000056504738,0.0003544226,0.0000669505,0.00002772018,0.00009530144,0.000032540633,0.2586025,0.00088286854,0.73792654,0.0019034557,0.000022180478],"about_ca_topic_score_codex":0.0019402768,"about_ca_topic_score_gemma":0.002331158,"teacher_disagreement_score":0.017162418,"about_ca_system_score_codex":0.0026652706,"about_ca_system_score_gemma":0.0024457416,"threshold_uncertainty_score":0.057413995},"labels":[],"label_agreement":null}]}