{"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":"73559aed91bd","filters":{"venue":"AI Communications"}},"results":[{"id":"W1788316346","doi":"","title":"Systematic versus non systematic techniques for solving temporal constraints in a dynamic environment","year":2004,"lang":"en","type":"article","venue":"AI Communications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint (computer-aided design); Mathematical optimization; Local consistency; Completeness (order theory); Constraint learning; Binary constraint; Process (computing); Constraint satisfaction; Constraint logic programming; Artificial intelligence; Mathematics; Probabilistic logic","retraction":null,"screen_n_in":null,"score":{"opus":0.01922572259618298,"gpt":0.2832288327520398,"spread":0.2640031101558568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000552881,0.0001348143,0.0002937421,0.0002044499,0.0002166735,0.0001216472,0.001024377,0.00006810201,0.000005180284],"category_scores_gemma":[0.000147393,0.0001352702,0.00007969988,0.0002321376,0.000130959,0.0003750301,0.0002320138,0.0001430689,0.00002703012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003847358,"about_ca_system_score_gemma":0.000113749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004133188,"about_ca_topic_score_gemma":0.0002884449,"domain_scores_codex":[0.9987556,0.0001100957,0.0005898274,0.0002103446,0.0001507513,0.0001833445],"domain_scores_gemma":[0.9976704,0.0004173479,0.0002309727,0.001575978,0.00005326059,0.00005210311],"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.00005096486,0.001682995,0.0007844015,0.100159,0.000534541,0.00001523341,0.01607365,0.01499924,0.003150006,0.8515123,0.00009923438,0.0109384],"study_design_scores_gemma":[0.004006236,0.0003010866,0.0008497867,0.03677322,0.0001575641,0.00007483975,0.001957434,0.9446833,0.0004622211,0.00979632,0.00004723925,0.0008907972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002828899,0.0002179476,0.9938354,0.002573894,0.00009148264,0.00231729,0.000005243455,0.0001700598,0.0005058021],"genre_scores_gemma":[0.7872015,0.0000763619,0.2117365,0.0001075648,0.000002636078,0.0008326197,0.0000169224,0.000008594373,0.00001729605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.929684,"threshold_uncertainty_score":0.551616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139801213","doi":"10.3233/aic-140605","title":"Automatic move pruning for single-agent search","year":2014,"lang":"en","type":"article","venue":"AI Communications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":14,"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":"Computer science; Pruning; Artificial intelligence; Machine learning; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.08222466232108644,"gpt":0.3340013739461056,"spread":0.2517767116250191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006837046,0.0000937753,0.0001272876,0.00009315835,0.0004342845,0.0001677572,0.002860392,0.00004264414,0.000003257098],"category_scores_gemma":[0.0002518185,0.00009613895,0.00005197332,0.0002890139,0.00007621615,0.0002531437,0.0007542867,0.0001720813,0.00008938855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006020088,"about_ca_system_score_gemma":0.00005958909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002486174,"about_ca_topic_score_gemma":0.000002178893,"domain_scores_codex":[0.9989334,0.0002151414,0.0002216465,0.000197379,0.0001734003,0.0002590432],"domain_scores_gemma":[0.9958565,0.0009417605,0.00007021215,0.002910557,0.000137956,0.00008305799],"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.000001506408,0.0005215582,0.0008353008,0.00007029931,0.00008016864,0.000001347684,0.007662577,0.008795546,0.003106479,0.4076339,0.004950296,0.566341],"study_design_scores_gemma":[0.0001697306,0.0000608242,0.0009934652,0.00004103857,0.000006569492,0.00000903155,0.00003250417,0.987151,0.0002705847,0.002813626,0.008336591,0.000115011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007290998,0.0001077849,0.9837636,0.009807671,0.0001289182,0.0002750087,0.000002451556,0.0003373096,0.004848174],"genre_scores_gemma":[0.3652097,0.000004125619,0.6339485,0.0005841858,0.00002007248,0.00007006336,0.00001207722,0.000008991648,0.0001423001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9783555,"threshold_uncertainty_score":0.5315368,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1923876550","doi":"10.3233/aic-2010-0456","title":"Practical reasoning with qualified number restrictions: A hybrid Abox calculus for the description logic 𝒮ℋ𝒬","year":2010,"lang":"en","type":"article","venue":"AI Communications","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Semantic reasoner; Axiom; Satisfiability; Consistency (knowledge bases); Answer set programming; Calculus (dental); Set (abstract data type); Theoretical computer science; Programming language; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.09288807929691535,"gpt":0.3745368120801877,"spread":0.2816487327832723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365286,0.00009712588,0.000103013,0.00003642818,0.0008939976,0.0003215351,0.001544771,0.00005133577,0.00001325469],"category_scores_gemma":[0.0007306018,0.00006307608,0.00005060638,0.0003041175,0.0002243528,0.0006059083,0.0003570716,0.0004245063,0.00004620232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001757151,"about_ca_system_score_gemma":0.0001651966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003102937,"about_ca_topic_score_gemma":0.0008520987,"domain_scores_codex":[0.9991292,0.00013747,0.0001908962,0.0001979921,0.0001428471,0.0002016285],"domain_scores_gemma":[0.9953409,0.001762786,0.0001120574,0.002557317,0.0001781738,0.00004872499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009028427,0.0001040596,0.00134918,0.000002490463,0.00002555009,0.000001263453,0.0003027499,0.00001098623,0.0001205895,0.9822007,0.01304649,0.002826882],"study_design_scores_gemma":[0.001258982,0.0002040883,0.04199638,0.00006805091,0.0001962126,0.0008876846,0.001691606,0.2978511,0.0007970312,0.06420455,0.590211,0.0006332935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002264917,0.0001120661,0.8946649,0.09780261,0.0002275121,0.0003579173,0.000003614874,0.0002650684,0.004301391],"genre_scores_gemma":[0.6486489,0.0001345245,0.3496254,0.001018987,0.00003800629,0.0002511744,0.000008540302,0.000007349704,0.0002671448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9179962,"threshold_uncertainty_score":0.6875997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2895868736","doi":"10.3233/aic-170537","title":"Performance robustness of AI planners in the 2014 International Planning Competition","year":2018,"lang":"en","type":"article","venue":"AI Communications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Agile software development; Solver; Computer science; Robustness (evolution); Software; Benchmark (surveying); Competition (biology); Homogeneous; Software engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.06033374970487245,"gpt":0.3527300751938626,"spread":0.2923963254889901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000425791,0.00005835419,0.00006817948,0.000108632,0.0001753554,0.00006130847,0.003502191,0.00003045865,0.0000207394],"category_scores_gemma":[0.00004509328,0.00004869464,0.00002261135,0.0002804358,0.0003110014,0.0004668516,0.0003992639,0.0002045716,0.00005271826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002468249,"about_ca_system_score_gemma":0.00004251748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006873473,"about_ca_topic_score_gemma":0.000126938,"domain_scores_codex":[0.9992489,0.0001216244,0.0002393031,0.0001087342,0.0001725864,0.0001088604],"domain_scores_gemma":[0.9982231,0.0002495713,0.00008762544,0.001249048,0.0001759311,0.0000146717],"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.0000248599,0.0005037351,0.1158782,0.0000170219,0.0000412836,0.000001625422,0.03031843,0.03989365,0.0006069683,0.7613787,0.01687326,0.03446221],"study_design_scores_gemma":[0.00005635406,0.00005603005,0.02032983,0.00007769473,0.000002649994,0.000008715906,0.0005658553,0.961843,0.000976935,0.001890036,0.01409961,0.00009325703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2111345,0.0001759715,0.7025282,0.05481829,0.0008473094,0.0003111521,0.00000760298,0.0001115001,0.03006551],"genre_scores_gemma":[0.9882972,0.00004750728,0.01077001,0.0007691044,0.00005255256,0.00002198107,0.00001186595,0.000003122415,0.00002661641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9219494,"threshold_uncertainty_score":0.6508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3084274250","doi":"10.3233/aic-200630","title":"Empirical scaling analyzer: An automated system for empirical analysis of performance scaling","year":2020,"lang":"en","type":"article","venue":"AI Communications","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scaling; Function (biology); Empirical research; Algorithm; Key (lock); Spectrum analyzer; Data mining; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1187793596545258,"gpt":0.4134381074534665,"spread":0.2946587477989407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612394,0.0001240768,0.0003375416,0.0002623897,0.0004161144,0.0001277512,0.002457904,0.00007804103,0.000003376242],"category_scores_gemma":[0.0002047392,0.0001195805,0.0001550985,0.002510444,0.00008207529,0.0004729273,0.0004402257,0.0002228702,0.00001237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004718513,"about_ca_system_score_gemma":0.00009349424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003743908,"about_ca_topic_score_gemma":0.00001559466,"domain_scores_codex":[0.9983326,0.0003467539,0.0005451019,0.0003643005,0.0002217425,0.0001895272],"domain_scores_gemma":[0.9965079,0.000409457,0.000251466,0.002401059,0.0002664543,0.0001636654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001126355,0.001317663,0.601808,0.0006992234,0.002553511,0.000001798713,0.02368265,0.1599545,0.004956902,0.08164036,0.004357252,0.1189155],"study_design_scores_gemma":[0.0001526421,0.00005625178,0.05541495,0.00001835554,0.0002393434,0.000001073017,0.0001539829,0.9388547,0.00010916,0.00001009797,0.004867746,0.0001217298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08590584,0.0001415993,0.8971274,0.01497371,0.00003802368,0.0002142421,0.0000451648,0.001110752,0.0004432276],"genre_scores_gemma":[0.9088363,0.00002118213,0.09000828,0.0006433725,0.00002142816,0.00003643386,0.0004189558,0.000009430235,0.000004598764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8229305,"threshold_uncertainty_score":0.4876351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1587152077","doi":"10.3233/aic-140603","title":"Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions","year":2014,"lang":"en","type":"article","venue":"AI Communications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Computer science; Satisficing; Branching (polymer chemistry); Homogeneous; Graph; Theoretical computer science; Mathematics; Artificial intelligence; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03477795111232695,"gpt":0.2789651577715677,"spread":0.2441872066592407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007627644,0.0001378426,0.0002313069,0.0001386493,0.0004981484,0.00007294574,0.001609762,0.00007459053,0.000004598605],"category_scores_gemma":[0.0002693804,0.0001172945,0.00008867399,0.0002804828,0.0002215742,0.0001767949,0.0006691554,0.0002555501,0.000003047106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008699293,"about_ca_system_score_gemma":0.00006165922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009997125,"about_ca_topic_score_gemma":0.00001164599,"domain_scores_codex":[0.9986746,0.0004957215,0.0002668519,0.0002203586,0.0001486203,0.0001939048],"domain_scores_gemma":[0.995775,0.001611496,0.0001497194,0.002235506,0.0001290113,0.00009930557],"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.00003715736,0.0001895269,0.01448253,0.00004418721,0.0001399927,0.000003784889,0.01355083,0.000675411,0.0008752398,0.9099855,0.00318516,0.05683064],"study_design_scores_gemma":[0.004222424,0.0006972834,0.06051257,0.001153764,0.0002603488,0.0001704641,0.00127933,0.2145025,0.003241402,0.6464157,0.06598319,0.001561096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08873915,0.009963987,0.8842345,0.006928207,0.000208558,0.0003802449,0.00003416316,0.0005219548,0.008989238],"genre_scores_gemma":[0.9637101,0.0001423067,0.03568923,0.000304463,0.000006069203,0.00001641044,0.00002511678,0.000009954068,0.00009636724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8749709,"threshold_uncertainty_score":0.4783133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1958457774","doi":"10.3233/aic-2010-0487","title":"On the use of machine learning methods for modern drug discovery","year":2011,"lang":"en","type":"article","venue":"AI Communications","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Drug discovery; Artificial intelligence; Machine learning; Data science; Bioinformatics","retraction":null,"screen_n_in":null,"score":{"opus":0.2265887255451752,"gpt":0.4043587369984684,"spread":0.1777700114532932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216361,0.0001051309,0.0001414765,0.00008906338,0.0003366005,0.0001084308,0.002470399,0.00002437916,0.000006177424],"category_scores_gemma":[0.0009514376,0.00007881247,0.0001212123,0.0003058783,0.0001369623,0.0007616353,0.001017078,0.0002611963,0.000004416994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002449896,"about_ca_system_score_gemma":0.00007523894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000169978,"about_ca_topic_score_gemma":0.00003015535,"domain_scores_codex":[0.9979179,0.001360344,0.000268325,0.0001903913,0.0001255771,0.0001374571],"domain_scores_gemma":[0.9874425,0.009957218,0.0001660323,0.00225414,0.0001487095,0.0000313784],"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.000009651946,0.0001323028,0.00009253803,0.000004485927,0.00003247773,5.071677e-8,0.002486954,0.01105464,0.0001577358,0.9331145,0.0003136319,0.05260108],"study_design_scores_gemma":[0.00008332447,0.00003023417,0.0005555083,0.0000143268,0.00000964079,0.000001031879,0.0000157101,0.7712494,0.0007790137,0.2195444,0.007640185,0.00007720903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001848167,0.0002329784,0.9918796,0.004622268,0.00007384236,0.0002838323,0.00001282373,0.00006023366,0.0009862018],"genre_scores_gemma":[0.2855844,0.00003953796,0.7133189,0.0006596321,0.000004737536,0.00008003834,0.00001134511,0.00001011113,0.0002912118],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7601948,"threshold_uncertainty_score":0.4590656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159458954","doi":"10.3233/aic-140620","title":"Features extraction based on the Discrete Hartley Transform for closed contour","year":2015,"lang":"en","type":"article","venue":"AI Communications","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Victoria","keywords":"Computer science; Extraction (chemistry); Artificial intelligence; Discrete Hartley transform; Computer vision; Pattern recognition (psychology); Fourier transform; Mathematics; Fractional Fourier transform; Chromatography","retraction":null,"screen_n_in":null,"score":{"opus":0.07529695712954541,"gpt":0.3499483005617621,"spread":0.2746513434322166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005464944,0.00009107735,0.00008307464,0.00005244085,0.0003748267,0.0001769044,0.001731601,0.00005253607,0.000004939345],"category_scores_gemma":[0.0001617882,0.00006221641,0.00008254304,0.0002384634,0.00009502882,0.0003226263,0.00006417651,0.0002021213,0.00002106054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005474765,"about_ca_system_score_gemma":0.0001187505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003049136,"about_ca_topic_score_gemma":0.00003063366,"domain_scores_codex":[0.9992455,0.0001328699,0.0001634002,0.0001474488,0.0001797094,0.0001310838],"domain_scores_gemma":[0.9971524,0.0005464166,0.0000778975,0.001914908,0.0002456747,0.00006272191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004224137,0.000232402,0.00001629535,0.000007518513,0.00001850698,2.29443e-7,0.0007690352,0.00001002711,0.002093122,0.8215939,0.05482991,0.1203868],"study_design_scores_gemma":[0.0008342163,0.0003085615,0.00155641,0.00004529496,0.00002578371,0.000004985051,0.0002480151,0.1947499,0.05961914,0.06893382,0.6733618,0.0003120016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00001077162,0.0001167274,0.8139994,0.1695396,0.00005965015,0.0004914213,0.00001295811,0.0002240809,0.01554538],"genre_scores_gemma":[0.9510773,0.00004744124,0.04374393,0.003661614,0.00002858905,0.0004187426,0.00003874808,0.000009672287,0.0009739034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9510666,"threshold_uncertainty_score":0.3217774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}