{"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":"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.0039799567,0.00050825684,0.98485106,0.0010083113,0.00005618783,0.000031030726,0.000099481156,0.0001650528,0.009300659],"genre_scores_gemma":[0.41638497,0.004199276,0.54737616,0.0015023971,0.00089306844,0.000604549,0.0006002263,0.00067613035,0.027763251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786323,0.0009545278,0.0000985072,0.0004494782,0.0004529693,0.00018124814],"domain_scores_gemma":[0.9913982,0.0057206587,0.0005512951,0.0010916727,0.0007933026,0.00044485604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037531897,0.0013817884,0.0013227855,0.0024911454,0.0012274389,0.0029636107,0.0027529383,0.002418522,0.009393827],"category_scores_gemma":[0.014418821,0.0011540448,0.0021192813,0.002903855,0.005336342,0.008616012,0.0034293972,0.005496232,0.0015874321],"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.000010750059,0.00001997524,0.00012206108,0.000035534373,0.000011981287,0.000024254392,0.00006736618,0.044184588,0.000099368954,0.9461278,0.0012687885,0.008027682],"study_design_scores_gemma":[0.0000045504034,0.000008327832,0.000032273325,0.000016568158,0.0000056016625,0.000009466451,0.000014059711,0.08754774,0.000055789216,0.9107676,0.0015310056,0.0000070206866],"about_ca_topic_score_codex":0.007093493,"about_ca_topic_score_gemma":0.007086732,"teacher_disagreement_score":0.009393827,"about_ca_system_score_codex":0.0028654416,"about_ca_system_score_gemma":0.0028271005,"threshold_uncertainty_score":0.031425536},"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":"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.0031409075,0.00014071845,0.99589074,0.0000579215,0.0000047782505,0.00006453746,0.000012785115,0.00011349221,0.0005740149],"genre_scores_gemma":[0.06471937,0.0005375315,0.9336829,0.00005311609,0.000012464486,0.0002683134,0.00007371999,0.00007601341,0.00057663163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974044,0.0011689714,0.00014801392,0.00021361581,0.00095551444,0.000109458],"domain_scores_gemma":[0.99279845,0.0053765634,0.00070123235,0.0007599185,0.00029803993,0.0000658423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026510365,0.0009688349,0.00075415836,0.001097698,0.0005711698,0.0010986039,0.0015444527,0.0010971925,0.002835602],"category_scores_gemma":[0.010208086,0.0007831193,0.001174552,0.0016839635,0.0016309959,0.0017825052,0.0014334216,0.0014339697,0.00040515972],"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.000094394796,0.00015360235,0.0013752508,0.0010614641,0.0002109798,0.000202546,0.00066895183,0.54558736,0.013945382,0.12538671,0.0014037132,0.30990967],"study_design_scores_gemma":[0.000046777488,0.00013366523,0.00038844324,0.00010408628,0.000064554966,0.00026388018,0.00017639805,0.93850654,0.006542505,0.048675843,0.0050699967,0.000027378539],"about_ca_topic_score_codex":0.0022274368,"about_ca_topic_score_gemma":0.0059758388,"teacher_disagreement_score":0.002835602,"about_ca_system_score_codex":0.00076070864,"about_ca_system_score_gemma":0.0021825025,"threshold_uncertainty_score":0.014020205},"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":"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.008294542,0.00014339181,0.98333687,0.00041103354,0.000089865905,0.00005762244,0.00009908279,0.00034547923,0.007222179],"genre_scores_gemma":[0.27489892,0.00034264298,0.7161778,0.00035570085,0.0001315422,0.0001647984,0.00025674325,0.00013830989,0.007533499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789536,0.000595531,0.00016603828,0.00030861667,0.00082114805,0.00021325472],"domain_scores_gemma":[0.9981687,0.0010842563,0.00008116871,0.00032463367,0.00022109714,0.000120162134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034151508,0.0005231009,0.00065509137,0.0010914796,0.0016275567,0.0033791296,0.0021326372,0.0012027812,0.0038099724],"category_scores_gemma":[0.0033053649,0.000740753,0.0019082087,0.00096947205,0.0040497654,0.007291204,0.0030376113,0.0022065444,0.0005604075],"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.000018192666,0.0000143966345,0.00010042888,0.000034463148,0.000012559111,0.00013102405,0.00032807956,0.0032933098,0.0011829295,0.98497885,0.00069016614,0.009215481],"study_design_scores_gemma":[0.00004317512,0.000025024998,0.00007860911,0.000033211025,0.000043329805,0.00016008691,0.00012972903,0.048423633,0.0024831865,0.92714065,0.021400543,0.00003884381],"about_ca_topic_score_codex":0.005194974,"about_ca_topic_score_gemma":0.0050739194,"teacher_disagreement_score":0.005194974,"about_ca_system_score_codex":0.0019740823,"about_ca_system_score_gemma":0.0017488885,"threshold_uncertainty_score":0.01806128},"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":"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.005737345,0.27266434,0.5931155,0.034463916,0.0036560057,0.00016568675,0.00040620402,0.0005187242,0.08927236],"genre_scores_gemma":[0.13400836,0.44816178,0.35658836,0.0124293035,0.015889863,0.00042404557,0.0006118052,0.00044522466,0.031441294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951343,0.0019276106,0.00020839152,0.0004765803,0.0020985417,0.00015446443],"domain_scores_gemma":[0.98637563,0.011422743,0.00026614114,0.0010609203,0.0007381164,0.0001365723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055167302,0.0017817477,0.0015155041,0.0027110518,0.0010173885,0.0037108988,0.0019517646,0.003023652,0.008376813],"category_scores_gemma":[0.012744492,0.00065389,0.0012147907,0.0029976103,0.006458791,0.006823309,0.0043365494,0.006424744,0.005056809],"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.00009702663,0.00011660752,0.00058362173,0.0012874232,0.00011712041,0.00017401898,0.00023112347,0.015930502,0.0013961119,0.6591475,0.02232946,0.2985895],"study_design_scores_gemma":[0.000033663444,0.00011627571,0.00048549852,0.0012141573,0.000043657437,0.00016887179,0.00006025778,0.03924123,0.0014632102,0.7777002,0.17938168,0.00009132305],"about_ca_topic_score_codex":0.0012362342,"about_ca_topic_score_gemma":0.0009536957,"teacher_disagreement_score":0.008376813,"about_ca_system_score_codex":0.0011451342,"about_ca_system_score_gemma":0.0011130511,"threshold_uncertainty_score":0.02917558},"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":"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.03105691,0.00054384524,0.9572527,0.00023172327,0.00007330045,0.0002320519,0.0001753729,0.0032059692,0.0072281267],"genre_scores_gemma":[0.3656181,0.0003219263,0.62873876,0.00015655506,0.000043137017,0.0005147783,0.0005695634,0.00034237123,0.0036947823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862266,0.00038989668,0.00007794343,0.0001912201,0.00056271144,0.00015549049],"domain_scores_gemma":[0.99764544,0.0013799927,0.00015967462,0.000489821,0.0002601529,0.00006493757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011213372,0.0008023863,0.00087637873,0.0011796604,0.0011799037,0.00096140656,0.0018124888,0.0012144042,0.004044607],"category_scores_gemma":[0.0053959154,0.000558191,0.00071685656,0.0010968681,0.0009532279,0.0017090695,0.0018990863,0.0016505419,0.0009706648],"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.0005697672,0.00025176196,0.0012180086,0.0004654719,0.00011534893,0.0005466808,0.00030009306,0.40656805,0.021802671,0.07620978,0.012409765,0.47954264],"study_design_scores_gemma":[0.00007788743,0.00007995469,0.00025161967,0.00003793777,0.000028536277,0.00010447379,0.000030750234,0.9494558,0.006390272,0.038211673,0.0053142738,0.000016896225],"about_ca_topic_score_codex":0.0029674387,"about_ca_topic_score_gemma":0.0063245967,"teacher_disagreement_score":0.004044607,"about_ca_system_score_codex":0.00062383106,"about_ca_system_score_gemma":0.0015053564,"threshold_uncertainty_score":0.013530493},"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":"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.011014605,0.00023742359,0.98745686,0.00007405491,0.00008573512,0.000031094794,0.000063003026,0.0002610457,0.000776185],"genre_scores_gemma":[0.3160356,0.0010791797,0.6765148,0.00019456168,0.00030492063,0.00010032844,0.00072483043,0.00024409719,0.0048016473],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996332,0.000040312978,0.000028925519,0.00007890933,0.00018653709,0.000032159285],"domain_scores_gemma":[0.9993662,0.00021670565,0.00009907193,0.00011476137,0.00016277688,0.00004049805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037876915,0.000489912,0.00087287725,0.0014727882,0.00022693884,0.0012823421,0.0006423169,0.00062282087,0.0017843599],"category_scores_gemma":[0.0013743804,0.00022380332,0.0006277131,0.0011785267,0.0005897611,0.002292366,0.0005966858,0.0009799929,0.00083221745],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024507585,0.00008904403,0.00079683814,0.0002132428,0.000050768376,0.00019735807,0.000084728505,0.020593261,0.19534044,0.02826163,0.0025864143,0.7515413],"study_design_scores_gemma":[0.00005653145,0.00051958236,0.0036090442,0.000039298066,0.00007820312,0.00097329536,0.00011571921,0.8035461,0.14458211,0.028307,0.018044317,0.00012890686],"about_ca_topic_score_codex":0.00049654895,"about_ca_topic_score_gemma":0.00033035077,"teacher_disagreement_score":0.0017843599,"about_ca_system_score_codex":0.00030479077,"about_ca_system_score_gemma":0.00031410297,"threshold_uncertainty_score":0.005969286},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93087685,0.0015521152,0.010877428,0.0018828802,0.00045402537,0.00017011483,0.0039658737,0.0020222445,0.04819842],"genre_scores_gemma":[0.97364646,0.0003312524,0.012818458,0.00030281892,0.00005574154,0.00013181286,0.009124649,0.00032651858,0.0032623454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995154,0.0015807896,0.0002799375,0.00095958315,0.0011187723,0.00090685213],"domain_scores_gemma":[0.98886967,0.0066458574,0.00060829736,0.0012088915,0.0013706821,0.0012965271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007297532,0.0011973133,0.0009855654,0.0017292282,0.001131337,0.002583896,0.0016142642,0.0014052457,0.004526457],"category_scores_gemma":[0.025483537,0.00056524796,0.0010254126,0.0019142522,0.001653791,0.0020608725,0.0023692448,0.0021676507,0.000926083],"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.0025287028,0.000731581,0.019492552,0.0003905089,0.0004114629,0.00015094437,0.00029297738,0.86488,0.0016338379,0.011304396,0.029734515,0.068448424],"study_design_scores_gemma":[0.0007575862,0.0018011341,0.024351584,0.00014025783,0.00015462033,0.00016366476,0.001127056,0.928846,0.0046359217,0.018432096,0.019486735,0.00010337782],"about_ca_topic_score_codex":0.026040511,"about_ca_topic_score_gemma":0.030990446,"teacher_disagreement_score":0.026040511,"about_ca_system_score_codex":0.0034619572,"about_ca_system_score_gemma":0.0047671255,"threshold_uncertainty_score":0.0517779},"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":"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.023766125,0.00024487625,0.73372144,0.00035039737,0.00019007412,0.00063570845,0.0040997285,0.2322445,0.004747104],"genre_scores_gemma":[0.3117428,0.00034035847,0.64193577,0.0005874508,0.00025772993,0.0034913588,0.00983176,0.028788976,0.0030238065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9867415,0.0037611504,0.0016077684,0.0023279944,0.0049556014,0.0006060974],"domain_scores_gemma":[0.9061289,0.048647754,0.006347018,0.02564092,0.011726613,0.0015087936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012272731,0.0032853507,0.0020232804,0.006447839,0.0008979637,0.0037158537,0.0032208946,0.0017201173,0.011608945],"category_scores_gemma":[0.08095558,0.0015841419,0.0013706583,0.003690298,0.001297756,0.0059794574,0.0036981022,0.0045925598,0.0069829337],"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.0018795782,0.0017968555,0.04128982,0.0015222891,0.0007307284,0.0007574743,0.0018554343,0.07160592,0.03781154,0.044803273,0.15621494,0.63973224],"study_design_scores_gemma":[0.00021663317,0.000288686,0.009451875,0.00015325272,0.000057305202,0.00026682543,0.00023476654,0.902712,0.027270166,0.034097143,0.025032429,0.0002189699],"about_ca_topic_score_codex":0.0020753834,"about_ca_topic_score_gemma":0.0018004031,"teacher_disagreement_score":0.012272731,"about_ca_system_score_codex":0.0012328892,"about_ca_system_score_gemma":0.0034031104,"threshold_uncertainty_score":0.06490517},"labels":[],"label_agreement":null}]}