{"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":"3e328a8c3ad1","filters":{"venue":"Algorithmic Learning Theory"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Linear regression; Computer science; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02917136203369002,"gpt":0.3203901574777243,"spread":0.2912187954440343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002436142,0.0002185201,0.000338155,0.0002422372,0.0000792551,0.00003326262,0.0002866359,0.000186488,0.0003316358],"category_scores_gemma":[0.001191921,0.0001800363,0.00008652583,0.0002156297,0.00005049894,0.000127257,0.0001244281,0.0006318568,0.0001513799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007257069,"about_ca_system_score_gemma":0.00002852172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000269725,"about_ca_topic_score_gemma":0.000001485227,"domain_scores_codex":[0.9981282,0.0006010485,0.0003940262,0.0003313125,0.0002395519,0.0003058366],"domain_scores_gemma":[0.9980303,0.001231706,0.0002010994,0.0004247692,0.00006063658,0.00005146947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000428797,0.0007159709,0.05648107,0.0006581558,0.0001652213,0.00005910187,0.0055077,0.0001629772,0.01783032,0.4248807,0.001423381,0.4916866],"study_design_scores_gemma":[0.0009414415,0.0003097004,0.004749742,0.001432148,0.00003378985,0.0000290296,0.0003023038,0.01040231,0.04290889,0.9285349,0.009489298,0.0008664074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8303974,0.0000650436,0.1615932,0.00009559798,0.0002284336,0.0005671515,0.000002561258,0.001863973,0.005186648],"genre_scores_gemma":[0.7538636,0.00008247158,0.232864,0.0001019155,0.0001572825,0.00007720281,0.0000260747,0.0001081511,0.01271924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5036542,"threshold_uncertainty_score":0.7341668,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02116394259325816,"gpt":0.2317819381336895,"spread":0.2106179955404313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717006,0.0001428593,0.0002471316,0.0001009646,0.000678312,0.0003384669,0.0004481571,0.00007503453,0.0007547195],"category_scores_gemma":[0.0001782426,0.0001385866,0.00005657935,0.00005712178,0.0001844796,0.0003524105,0.00005602072,0.0002764113,0.000593905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004275035,"about_ca_system_score_gemma":0.00002230267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002248355,"about_ca_topic_score_gemma":0.0000186767,"domain_scores_codex":[0.998983,0.00001483782,0.0003402809,0.000371712,0.00005290312,0.0002372416],"domain_scores_gemma":[0.9984406,0.00004133007,0.0007313181,0.0006696698,0.00005298527,0.00006408848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00008636688,0.00008265067,0.1521866,0.00004141316,0.0001780412,0.00002767342,0.001261961,0.003001234,0.00009620898,0.8164613,0.0002101844,0.02636635],"study_design_scores_gemma":[0.002139702,0.0004693196,0.5195154,0.000155472,0.00007542138,0.00006904357,0.0009194135,0.09760875,0.000698153,0.2579474,0.1189965,0.001405425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8659249,0.001220107,0.07846025,0.0005838245,0.001226354,0.0003561012,0.00005301242,0.0001253719,0.05205005],"genre_scores_gemma":[0.9812742,0.0002174264,0.0004591815,0.00005650291,0.0001884166,0.00001153131,0.00001749477,0.00002704295,0.01774814],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5585139,"threshold_uncertainty_score":0.826365,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006174889835653325,"gpt":0.2425515446811951,"spread":0.2363766548455417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003161389,0.0004094112,0.0004597099,0.0002579761,0.0008132376,0.0006604522,0.00146664,0.0001956503,0.0003567927],"category_scores_gemma":[0.0003255912,0.0004031949,0.0002218954,0.0003341738,0.00009546623,0.001069947,0.0003141465,0.001225554,0.0008797453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000102997,"about_ca_system_score_gemma":0.0001737787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008415195,"about_ca_topic_score_gemma":0.000001105495,"domain_scores_codex":[0.9959652,0.001045567,0.0004298384,0.001085434,0.0005036027,0.0009703882],"domain_scores_gemma":[0.9976723,0.0007407088,0.0003090458,0.0008580284,0.0001680475,0.0002518225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001838984,0.0003412974,0.003451016,0.0001603339,0.0002277725,0.00004255624,0.00706206,0.06082353,0.009168512,0.1667878,0.0005145709,0.7512366],"study_design_scores_gemma":[0.001716701,0.001033009,0.0006184878,0.00006013973,0.00002961378,0.000049489,0.0006004707,0.8552347,0.0006989055,0.01682032,0.1223319,0.0008062525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1640578,0.0002790009,0.82832,0.0001999641,0.001373342,0.0004837009,0.000003872246,0.001178809,0.004103546],"genre_scores_gemma":[0.8305159,0.0000413165,0.119472,0.0003143404,0.001198711,0.0001144683,0.0001335016,0.0001629373,0.04804683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7944112,"threshold_uncertainty_score":0.9998982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.006884749596829058,"gpt":0.2788451375763609,"spread":0.2719603879795319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004762585,0.0001216215,0.0001448156,0.00001037623,0.0002880279,0.00005189613,0.0003210138,0.0001079189,0.00005398152],"category_scores_gemma":[0.001117071,0.0001020855,0.00007434394,0.00001805818,0.0001354734,0.000004250912,0.0002653354,0.0001674518,0.0000146103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005853848,"about_ca_system_score_gemma":0.00001383151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008304948,"about_ca_topic_score_gemma":0.000001141382,"domain_scores_codex":[0.999161,0.0001291326,0.0001528743,0.0002585353,0.0000778324,0.0002206165],"domain_scores_gemma":[0.999303,0.000085504,0.000225697,0.0002943825,0.00004886838,0.00004255099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007797133,0.00009083733,0.2300542,0.00005292072,0.0001328556,0.00002015018,0.0002173806,0.00007313527,0.288772,0.0002815205,0.0006399585,0.479587],"study_design_scores_gemma":[0.005986014,0.002135434,0.112512,0.0008603886,0.000242359,0.000188558,0.002787833,0.008096768,0.5879699,0.006599295,0.2692772,0.003344272],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9764548,0.0002453289,0.01321584,0.00003798018,0.00009030446,0.00005719847,0.00001130839,0.00002524726,0.009862007],"genre_scores_gemma":[0.9958035,0.00003079934,0.0007573952,0.00007383244,0.0002467401,0.000002612727,0.00005982658,0.00001624105,0.00300909],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4762428,"threshold_uncertainty_score":0.4162925,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Waterloo","funders":"","keywords":"Learnability; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01337252035943019,"gpt":0.226323989203555,"spread":0.2129514688441247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005339548,0.0001631031,0.0001830558,0.00003163739,0.0003072385,0.0001310925,0.0008012282,0.00006042933,0.00008296266],"category_scores_gemma":[0.0001684733,0.0001478686,0.00008918913,0.0004412184,0.00008014918,0.0002019857,0.0002745485,0.0006743379,0.0007038044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003345152,"about_ca_system_score_gemma":0.00004334337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007495211,"about_ca_topic_score_gemma":1.315653e-7,"domain_scores_codex":[0.9983111,0.0003903965,0.0001896321,0.0005607416,0.0002214134,0.0003267388],"domain_scores_gemma":[0.9987697,0.0005162689,0.00009107666,0.0003987801,0.00003930109,0.0001848545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002601093,0.00007863194,0.0001566154,0.00001292102,0.00002615036,0.00001712275,0.001264325,0.1100175,0.0003242602,0.6136835,0.003506391,0.2708865],"study_design_scores_gemma":[0.0004170736,0.0003677597,0.0002837315,0.0000157429,0.000008055627,0.00001091415,0.0001119702,0.837474,0.0002643869,0.08454124,0.07616109,0.0003440077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02467914,0.00009235175,0.9571146,0.009108271,0.0001637314,0.0002165083,8.033764e-7,0.0008371487,0.007787382],"genre_scores_gemma":[0.9837559,0.00001851035,0.01126528,0.003406697,0.0002649204,0.00001743727,0.000004046814,0.00002178639,0.001245356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9590768,"threshold_uncertainty_score":0.9046216,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0163128910826075,"gpt":0.2234733306023899,"spread":0.2071604395197824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005220241,0.0001033015,0.0001767972,0.0002136495,0.0001873063,0.00002532229,0.0002850417,0.00006731157,0.00004858059],"category_scores_gemma":[0.0004599892,0.00009896744,0.000049042,0.00006855169,0.00006443119,0.0001155963,0.00003967411,0.0002886304,0.000003681724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000206091,"about_ca_system_score_gemma":0.00002380593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003174692,"about_ca_topic_score_gemma":6.520044e-7,"domain_scores_codex":[0.9993706,0.00006824375,0.0001879736,0.0001083245,0.0001235391,0.0001412813],"domain_scores_gemma":[0.9992713,0.0001784365,0.0001660021,0.000308324,0.00004400609,0.00003189965],"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.00001471574,0.0000344798,0.002008015,0.0003541737,0.00006206056,0.000001137784,0.0008191082,0.8247087,0.0004173844,0.002765927,0.00002430515,0.16879],"study_design_scores_gemma":[0.001784001,0.0002843601,0.03360955,0.0006394699,0.0001394087,0.000003901587,0.000667639,0.87753,0.07697591,0.004846629,0.0028096,0.00070956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.340433,0.0003823419,0.611134,0.00001946705,0.0003819056,0.0001861218,0.000009173669,0.0003239628,0.04713004],"genre_scores_gemma":[0.9930761,0.00004713619,0.006358182,0.000002602919,0.00003487281,0.000005298472,0.000008417281,0.00002496919,0.0004423595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6526432,"threshold_uncertainty_score":0.4035775,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02605099024266741,"gpt":0.2997311155748661,"spread":0.2736801253321987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009482729,0.00009126451,0.0001391328,0.00004163912,0.0002227642,0.00004562875,0.0003341672,0.0000385759,0.000008669705],"category_scores_gemma":[0.0002231917,0.00006568478,0.0000314,0.0002470896,0.0003858493,0.0001098702,0.0001035437,0.0002337409,0.000002888516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000359249,"about_ca_system_score_gemma":0.00006078127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002086525,"about_ca_topic_score_gemma":0.000006840449,"domain_scores_codex":[0.999054,0.0002466407,0.0001540348,0.0002645735,0.0001116925,0.0001691067],"domain_scores_gemma":[0.998309,0.001201932,0.00009334042,0.0002774107,0.00008305991,0.0000352173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000718961,0.00004483108,0.001414818,0.000008550214,0.00001953794,3.937473e-7,0.002660857,0.000438576,0.0004538294,0.9591995,0.0001593296,0.03552786],"study_design_scores_gemma":[0.0009304679,0.0009692225,0.01545677,0.00008961555,0.00001363685,0.000002763757,0.00153484,0.1102422,0.00305272,0.8599806,0.007379094,0.0003480486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7755662,0.00003107029,0.2227763,0.000606714,0.0000954706,0.0003445244,0.000003048237,0.00003470327,0.0005419675],"genre_scores_gemma":[0.9972474,0.000008726719,0.002484634,0.0001113472,0.00004493313,0.0000412181,7.482771e-7,0.000005476165,0.00005554672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2216812,"threshold_uncertainty_score":0.2678548,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02632089831741377,"gpt":0.224098277679742,"spread":0.1977773793623282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002437836,0.0003499263,0.0005517444,0.0003055444,0.000522012,0.0001234286,0.0004776804,0.0001984257,0.001709739],"category_scores_gemma":[0.0009837711,0.0003962911,0.0002132056,0.0002108353,0.0003705158,0.00018869,0.0001141363,0.0006231411,0.004885266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000212602,"about_ca_system_score_gemma":0.00005319301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009138086,"about_ca_topic_score_gemma":0.000005267722,"domain_scores_codex":[0.9975561,0.0001744903,0.0006936918,0.0008735266,0.00005496434,0.000647156],"domain_scores_gemma":[0.9981203,0.0005266357,0.0004747687,0.0006476071,0.00006020812,0.0001704914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002427791,0.0002667725,0.006332756,0.00004612099,0.0001323854,0.00001575071,0.002221318,0.02543266,0.00008209537,0.950026,0.0003310969,0.01487027],"study_design_scores_gemma":[0.002675493,0.0007258392,0.004004437,0.00009369625,0.00002664613,0.00001240153,0.0004623708,0.6778979,0.000101052,0.2004922,0.1123959,0.001112027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1913965,0.0007537323,0.6676663,0.0005046613,0.00282114,0.0006005219,0.0001176407,0.0006849049,0.1354546],"genre_scores_gemma":[0.9799263,0.00002810115,0.008479591,0.0007085717,0.000680394,0.00004161564,0.00003084771,0.0001100512,0.009994543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7885298,"threshold_uncertainty_score":0.9998489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}