{"meta":{"query_hash":"73559aed91bd","filters":{"venue":"AI Communications"},"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/73559aed91bd","api":"https://metacan.xera.ac/api/v1/cohort?venue=AI+Communications"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03477795111232695,"score_gpt":0.27896515777156766,"score_spread":0.2441872066592407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587152077","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.08873915,0.009963987,0.8842345,0.006928207,0.000208558,0.00038024486,0.000034163157,0.00052195485,0.008989238],"genre_scores_gemma":[0.96371007,0.00014230672,0.03568923,0.000304463,0.000006069203,0.000016410444,0.000025116782,0.000009954068,0.000096367236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986746,0.00049572147,0.00026685192,0.00022035862,0.00014862034,0.00019390478],"domain_scores_gemma":[0.995775,0.0016114956,0.00014971945,0.002235506,0.00012901129,0.00009930557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007627644,0.00013784264,0.00023130694,0.00013864931,0.00049814844,0.00007294574,0.0016097617,0.000074590534,0.000004598605],"category_scores_gemma":[0.00026938043,0.00011729454,0.00008867399,0.00028048278,0.00022157417,0.00017679494,0.00066915544,0.00025555014,0.0000030471065],"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.00003715736,0.00018952688,0.014482527,0.000044187214,0.00013999271,0.0000037848893,0.013550835,0.00067541096,0.00087523984,0.90998554,0.0031851602,0.05683064],"study_design_scores_gemma":[0.0042224242,0.00069728337,0.060512573,0.001153764,0.0002603488,0.00017046413,0.0012793296,0.21450245,0.0032414019,0.64641565,0.06598319,0.0015610958],"about_ca_topic_score_codex":0.00009997125,"about_ca_topic_score_gemma":0.000011645988,"teacher_disagreement_score":0.8749709,"about_ca_system_score_codex":0.000008699293,"about_ca_system_score_gemma":0.000061659215,"threshold_uncertainty_score":0.47831327},"labels":[],"label_agreement":null},{"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,"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; 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","score_opus":0.019225722596182975,"score_gpt":0.2832288327520398,"score_spread":0.2640031101558568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1788316346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028288987,0.00021794759,0.9938354,0.0025738943,0.00009148264,0.0023172903,0.000005243455,0.00017005976,0.0005058021],"genre_scores_gemma":[0.78720146,0.000076361895,0.21173654,0.00010756485,0.0000026360779,0.00083261967,0.000016922397,0.000008594373,0.000017296048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875563,0.00011009571,0.00058982737,0.00021034456,0.00015075126,0.00018334453],"domain_scores_gemma":[0.99767035,0.00041734788,0.00023097273,0.0015759778,0.00005326059,0.000052103114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055288104,0.00013481425,0.00029374214,0.00020444988,0.00021667349,0.00012164722,0.0010243767,0.00006810201,0.000005180284],"category_scores_gemma":[0.00014739296,0.00013527022,0.00007969988,0.00023213755,0.00013095896,0.0003750301,0.00023201384,0.00014306887,0.000027030123],"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.00005096486,0.0016829954,0.0007844015,0.100159004,0.00053454103,0.00001523341,0.016073648,0.01499924,0.0031500056,0.8515123,0.00009923438,0.010938403],"study_design_scores_gemma":[0.004006236,0.0003010866,0.00084978674,0.036773216,0.00015756408,0.00007483975,0.0019574345,0.94468325,0.00046222113,0.00979632,0.00004723925,0.0008907972],"about_ca_topic_score_codex":0.000041331878,"about_ca_topic_score_gemma":0.00028844495,"teacher_disagreement_score":0.92968404,"about_ca_system_score_codex":0.00038473585,"about_ca_system_score_gemma":0.00011374902,"threshold_uncertainty_score":0.55161595},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09288807929691535,"score_gpt":0.3745368120801877,"score_spread":0.28164873278327235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923876550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022649167,0.000112066125,0.8946649,0.09780261,0.0002275121,0.00035791734,0.0000036148742,0.00026506837,0.0043013906],"genre_scores_gemma":[0.64864886,0.00013452453,0.34962538,0.0010189869,0.000038006292,0.00025117444,0.000008540302,0.000007349704,0.0002671448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991292,0.00013747,0.00019089623,0.00019799208,0.00014284713,0.00020162849],"domain_scores_gemma":[0.99534094,0.0017627857,0.00011205744,0.002557317,0.00017817377,0.000048724985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043652856,0.00009712588,0.00010301299,0.00003642818,0.00089399755,0.0003215351,0.0015447709,0.00005133577,0.000013254691],"category_scores_gemma":[0.00073060184,0.00006307608,0.000050606377,0.00030411754,0.00022435277,0.00060590834,0.0003570716,0.00042450632,0.000046202324],"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.000009028427,0.0001040596,0.00134918,0.000002490463,0.00002555009,0.0000012634528,0.00030274995,0.000010986234,0.00012058954,0.98220074,0.013046492,0.0028268816],"study_design_scores_gemma":[0.001258982,0.0002040883,0.041996382,0.00006805091,0.00019621257,0.00088768464,0.0016916055,0.29785115,0.00079703116,0.06420455,0.590211,0.0006332935],"about_ca_topic_score_codex":0.00031029366,"about_ca_topic_score_gemma":0.0008520987,"teacher_disagreement_score":0.91799617,"about_ca_system_score_codex":0.000017571514,"about_ca_system_score_gemma":0.00016519663,"threshold_uncertainty_score":0.68759966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Drug discovery; Artificial intelligence; Machine learning; Data science; Bioinformatics","score_opus":0.22658872554517523,"score_gpt":0.4043587369984684,"score_spread":0.1777700114532932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958457774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018481669,0.00023297842,0.99187964,0.004622268,0.00007384236,0.0002838323,0.000012823729,0.000060233662,0.0009862018],"genre_scores_gemma":[0.28558445,0.000039537965,0.71331894,0.00065963215,0.0000047375356,0.00008003834,0.000011345105,0.000010111131,0.00029121182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979179,0.0013603444,0.000268325,0.0001903913,0.00012557709,0.0001374571],"domain_scores_gemma":[0.9874425,0.009957218,0.0001660323,0.0022541403,0.00014870951,0.000031378404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012163608,0.00010513092,0.0001414765,0.00008906338,0.00033660047,0.00010843076,0.0024703986,0.000024379162,0.0000061774235],"category_scores_gemma":[0.0009514376,0.00007881247,0.00012121227,0.00030587832,0.00013696226,0.00076163525,0.0010170778,0.00026119628,0.000004416994],"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.000009651946,0.00013230284,0.00009253803,0.000004485927,0.000032477732,5.0716768e-8,0.0024869535,0.0110546425,0.00015773576,0.93311447,0.00031363193,0.052601084],"study_design_scores_gemma":[0.00008332447,0.000030234172,0.0005555083,0.0000143268035,0.00000964079,0.0000010318787,0.000015710102,0.7712494,0.0007790137,0.21954443,0.0076401853,0.00007720903],"about_ca_topic_score_codex":0.00016997803,"about_ca_topic_score_gemma":0.000030155346,"teacher_disagreement_score":0.7601948,"about_ca_system_score_codex":0.00002449896,"about_ca_system_score_gemma":0.00007523894,"threshold_uncertainty_score":0.45906562},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Pruning; Artificial intelligence; Machine learning; Information retrieval","score_opus":0.08222466232108644,"score_gpt":0.3340013739461056,"score_spread":0.25177671162501913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139801213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007290998,0.00010778494,0.9837636,0.009807671,0.00012891817,0.00027500873,0.0000024515564,0.00033730958,0.004848174],"genre_scores_gemma":[0.36520967,0.000004125619,0.6339485,0.00058418576,0.000020072475,0.00007006336,0.000012077225,0.000008991648,0.00014230006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989334,0.00021514138,0.00022164648,0.00019737902,0.0001734003,0.00025904315],"domain_scores_gemma":[0.99585646,0.00094176055,0.00007021215,0.0029105572,0.00013795604,0.00008305799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006837046,0.0000937753,0.00012728763,0.00009315835,0.00043428454,0.00016775716,0.002860392,0.000042644137,0.0000032570977],"category_scores_gemma":[0.00025181848,0.00009613895,0.00005197332,0.00028901393,0.00007621615,0.00025314366,0.0007542867,0.00017208129,0.00008938855],"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.0000015064076,0.00052155816,0.0008353008,0.000070299306,0.00008016864,0.0000013476839,0.007662577,0.008795546,0.0031064786,0.40763387,0.004950296,0.56634104],"study_design_scores_gemma":[0.0001697306,0.0000608242,0.0009934652,0.00004103857,0.000006569492,0.00000903155,0.000032504173,0.987151,0.00027058474,0.0028136263,0.008336591,0.00011501099],"about_ca_topic_score_codex":0.000024861738,"about_ca_topic_score_gemma":0.0000021788928,"teacher_disagreement_score":0.97835547,"about_ca_system_score_codex":0.000060200884,"about_ca_system_score_gemma":0.000059589085,"threshold_uncertainty_score":0.53153676},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07529695712954541,"score_gpt":0.34994830056176207,"score_spread":0.27465134343221664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159458954","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.000010771623,0.00011672741,0.8139994,0.16953957,0.000059650152,0.0004914213,0.00001295811,0.00022408087,0.015545376],"genre_scores_gemma":[0.95107734,0.000047441245,0.043743927,0.003661614,0.000028589047,0.00041874262,0.000038748083,0.000009672287,0.0009739034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924546,0.00013286989,0.00016340018,0.00014744878,0.0001797094,0.00013108383],"domain_scores_gemma":[0.9971524,0.00054641656,0.0000778975,0.0019149084,0.00024567472,0.00006272191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054649444,0.00009107735,0.00008307464,0.000052440846,0.00037482675,0.00017690445,0.001731601,0.000052536074,0.0000049393448],"category_scores_gemma":[0.0001617882,0.00006221641,0.00008254304,0.00023846337,0.000095028816,0.0003226263,0.00006417651,0.00020212127,0.000021060543],"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.000042241372,0.00023240202,0.000016295355,0.000007518513,0.00001850698,2.2944302e-7,0.0007690352,0.000010027111,0.0020931216,0.8215939,0.05482991,0.12038682],"study_design_scores_gemma":[0.0008342163,0.00030856152,0.0015564096,0.000045294957,0.000025783705,0.000004985051,0.00024801507,0.19474994,0.05961914,0.06893382,0.67336184,0.00031200165],"about_ca_topic_score_codex":0.000030491357,"about_ca_topic_score_gemma":0.000030633655,"teacher_disagreement_score":0.9510666,"about_ca_system_score_codex":0.000054747652,"about_ca_system_score_gemma":0.0001187505,"threshold_uncertainty_score":0.32177743},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06033374970487245,"score_gpt":0.35273007519386257,"score_spread":0.29239632548899014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895868736","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.21113451,0.0001759715,0.7025282,0.054818287,0.0008473094,0.00031115214,0.00000760298,0.000111500136,0.03006551],"genre_scores_gemma":[0.9882972,0.00004750728,0.01077001,0.0007691044,0.000052552565,0.000021981068,0.000011865948,0.0000031224154,0.000026616408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924886,0.00012162443,0.00023930309,0.00010873424,0.00017258641,0.00010886037],"domain_scores_gemma":[0.9982231,0.00024957128,0.00008762544,0.0012490483,0.00017593111,0.000014671703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042579096,0.000058354188,0.00006817948,0.00010863202,0.00017535537,0.00006130847,0.003502191,0.000030458654,0.000020739397],"category_scores_gemma":[0.000045093282,0.00004869464,0.000022611353,0.00028043578,0.00031100138,0.0004668516,0.00039926392,0.00020457161,0.00005271826],"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.000024859899,0.0005037351,0.11587823,0.000017021901,0.000041283598,0.0000016254218,0.030318426,0.039893653,0.0006069683,0.7613787,0.016873265,0.034462214],"study_design_scores_gemma":[0.000056354063,0.000056030054,0.020329827,0.00007769473,0.0000026499936,0.000008715906,0.0005658553,0.961843,0.000976935,0.0018900363,0.014099609,0.00009325703],"about_ca_topic_score_codex":0.00006873473,"about_ca_topic_score_gemma":0.00012693803,"teacher_disagreement_score":0.9219494,"about_ca_system_score_codex":0.00002468249,"about_ca_system_score_gemma":0.000042517477,"threshold_uncertainty_score":0.65080005},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1187793596545258,"score_gpt":0.41343810745346654,"score_spread":0.29465874779894075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084274250","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.08590584,0.00014159927,0.89712745,0.014973707,0.00003802368,0.00021424206,0.0000451648,0.001110752,0.00044322756],"genre_scores_gemma":[0.9088363,0.000021182126,0.09000828,0.0006433725,0.000021428164,0.000036433863,0.00041895584,0.000009430235,0.0000045987645],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833256,0.00034675395,0.0005451019,0.00036430053,0.00022174254,0.00018952721],"domain_scores_gemma":[0.9965079,0.00040945702,0.000251466,0.0024010595,0.00026645433,0.0001636654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612394,0.00012407682,0.00033754163,0.0002623897,0.00041611437,0.00012775123,0.0024579042,0.00007804103,0.0000033762417],"category_scores_gemma":[0.0002047392,0.000119580494,0.00015509847,0.0025104443,0.00008207529,0.00047292726,0.0004402257,0.00022287024,0.000012370004],"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.000112635506,0.0013176627,0.60180795,0.0006992234,0.0025535112,0.000001798713,0.023682654,0.15995449,0.0049569015,0.08164036,0.004357252,0.118915536],"study_design_scores_gemma":[0.00015264214,0.00005625178,0.055414952,0.00001835554,0.00023934337,0.0000010730167,0.00015398285,0.9388547,0.00010916003,0.000010097971,0.0048677456,0.00012172976],"about_ca_topic_score_codex":0.00003743908,"about_ca_topic_score_gemma":0.000015594664,"teacher_disagreement_score":0.82293046,"about_ca_system_score_codex":0.000047185127,"about_ca_system_score_gemma":0.000093494236,"threshold_uncertainty_score":0.4876351},"labels":[],"label_agreement":null}]}