{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":23,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":23,"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":"6a96cabb7b09","filters":{"venue":"International Conference on Artificial Intelligence"}},"results":[{"id":"W2230033167","doi":"","title":"Adversarial hierarchical-task network planning for complex real-time games","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":77,"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":"Monte Carlo tree search; Computer science; Adversarial system; Task (project management); Tree (set theory); Theoretical computer science; Artificial intelligence; Combinatorial game theory; Point (geometry); Machine learning; Game theory; Sequential game; Monte Carlo method; Mathematics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2196141500131067,"gpt":0.3844458776644416,"spread":0.1648317276513349,"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.001122579,0.0004352031,0.0004443931,0.0002876491,0.0002823348,0.0007771936,0.003000899,0.0001997914,0.0003769785],"category_scores_gemma":[0.0009957586,0.0004368837,0.000218917,0.000469747,0.0003571826,0.0007294715,0.0004633765,0.0003843583,0.001472822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002374428,"about_ca_system_score_gemma":0.000423598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001135411,"about_ca_topic_score_gemma":0.00003964802,"domain_scores_codex":[0.9958414,0.0001839089,0.001038989,0.001059732,0.001058321,0.0008175834],"domain_scores_gemma":[0.9965402,0.0007817853,0.0003635438,0.0007657153,0.001118627,0.0004300509],"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.0003970435,0.0001665197,0.00006069941,0.000004699281,0.00006120111,0.00002713535,0.001735777,0.02577572,0.003959497,0.8764124,0.008610667,0.08278864],"study_design_scores_gemma":[0.00005760931,0.0003553838,0.00003467972,0.00007741375,0.000007981005,0.000009313992,0.0002896855,0.5718582,0.006375813,0.4119817,0.008559006,0.0003931655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00332312,0.0000197209,0.9400339,0.006757567,0.003843905,0.0006365278,0.00004328124,0.000488513,0.04485352],"genre_scores_gemma":[0.9125475,0.00003035927,0.08324226,0.0009664151,0.001946631,0.0001492454,0.00007346783,0.00004284741,0.001001219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9092245,"threshold_uncertainty_score":0.9998083,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2290243003","doi":"","title":"Using a recursive neural network to learn an agent's decision model for plan recognition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Plan (archaeology); Artificial intelligence; Benchmark (surveying); Machine learning; A priori and a posteriori; Key (lock); Artificial neural network; Decision model; State (computer science); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.4943415044693059,"gpt":0.4136130999912715,"spread":0.08072840447803431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698927,0.0001935304,0.0001612136,0.0001846723,0.0001886393,0.0004852446,0.001022196,0.00009193793,0.00002696842],"category_scores_gemma":[0.0003939327,0.0001984216,0.00006418958,0.0002409839,0.00003230038,0.0006101783,0.0001354253,0.0002014941,0.00014699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001349253,"about_ca_system_score_gemma":0.0002058624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007224689,"about_ca_topic_score_gemma":0.00009504009,"domain_scores_codex":[0.9980918,0.00008253581,0.0004082029,0.0005788105,0.0004795826,0.0003590635],"domain_scores_gemma":[0.9982651,0.0002103013,0.0001520906,0.0003045258,0.0007765539,0.0002913612],"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.0003038864,0.00005499991,0.00002418603,0.000001756652,0.00000874896,0.000006709621,0.001578677,0.6843535,0.0002957577,0.0929039,0.0005116263,0.2199562],"study_design_scores_gemma":[0.00003639131,0.0002844071,0.000003646863,0.0001038817,0.000003622162,0.000006465128,0.0001337852,0.7103404,0.001201148,0.2875575,0.0001475587,0.0001811826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0336757,0.00000910497,0.9622842,0.001267278,0.00156449,0.0003069588,0.00003423813,0.0001119516,0.0007460897],"genre_scores_gemma":[0.750757,0.000002462655,0.24782,0.0009468147,0.0003130109,0.00003058329,0.00004597706,0.00001274172,0.00007130764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7170814,"threshold_uncertainty_score":0.8091398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293616274","doi":"","title":"Maximizing the coverage of information propagation in social networks","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Submodular set function; Computer science; Node (physics); Maximization; Set (abstract data type); Popularity; Theoretical computer science; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0992775265964285,"gpt":0.3408353436913399,"spread":0.2415578170949114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004278056,0.00009512083,0.0001200781,0.0001283456,0.00006051225,0.0001017263,0.000342279,0.00003020531,0.0002621349],"category_scores_gemma":[0.00003174046,0.00007809948,0.00005801547,0.0002526339,0.00007177333,0.0002852392,0.00007119997,0.0001806517,0.00003431558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005734562,"about_ca_system_score_gemma":0.00006324516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002698887,"about_ca_topic_score_gemma":0.00005400853,"domain_scores_codex":[0.9989423,0.000064196,0.0004493114,0.0001092082,0.0003000664,0.0001348789],"domain_scores_gemma":[0.999234,0.00005218414,0.0002310317,0.000113732,0.0003432025,0.00002589111],"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.00005500895,0.00005166894,0.001370456,8.836553e-7,0.00001496667,2.184508e-7,0.0006019184,0.01357504,0.00005698668,0.8021387,0.0001405325,0.1819936],"study_design_scores_gemma":[0.00004665949,0.00004412773,0.000753136,0.00003821506,0.000006956003,2.643975e-7,0.001268321,0.6153225,0.004121193,0.3777121,0.000562095,0.0001244999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0398089,0.000003722064,0.8954582,0.001284936,0.0002546053,0.0002391522,0.0000113284,0.00002844328,0.06291074],"genre_scores_gemma":[0.9993763,0.000003446701,0.0002092622,0.000068574,0.0002349032,0.00002916741,0.0000498752,0.000004018659,0.00002443579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9595674,"threshold_uncertainty_score":0.3184805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2265246327","doi":"","title":"On the empirical time complexity of random 3-SAT at the phase transition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","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 British Columbia","funders":"","keywords":"Satisfiability; DPLL algorithm; Scaling; Exponential function; Context (archaeology); Computer science; Boolean satisfiability problem; Solver; Time complexity; Constant (computer programming); Function (biology); Algorithm; Mathematics; Theoretical computer science; Mathematical optimization; Jitter","retraction":null,"screen_n_in":null,"score":{"opus":0.3905235528133467,"gpt":0.397099776394029,"spread":0.006576223580682272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006053225,0.0001360031,0.0001353419,0.00008835355,0.0001570842,0.0001513256,0.0007919194,0.00004923665,0.001809635],"category_scores_gemma":[0.0003145398,0.00008447043,0.00009082298,0.0002208489,0.0004316933,0.0001809497,0.00008728573,0.0001836602,0.0008578119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001037108,"about_ca_system_score_gemma":0.0001166683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002345771,"about_ca_topic_score_gemma":0.00005194578,"domain_scores_codex":[0.9983341,0.000215174,0.0003912608,0.0002799604,0.000638618,0.0001408889],"domain_scores_gemma":[0.9985436,0.0004363608,0.000161205,0.0003549046,0.0004260259,0.00007793371],"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.0004307224,0.0002119581,0.000008897613,0.000001111373,0.00002314604,0.000003067146,0.001920383,0.006158304,0.001421215,0.9505467,0.001365922,0.0379086],"study_design_scores_gemma":[0.0002137733,0.0002182696,0.00004203534,0.00002823104,0.000005146046,0.000009786028,0.0002169667,0.810227,0.02462835,0.1638185,0.0004746515,0.0001173214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06834313,0.000005260257,0.8633815,0.05361163,0.0007468738,0.0003156225,0.00003756429,0.00006861489,0.01348979],"genre_scores_gemma":[0.9975836,0.000006900592,0.0006304573,0.001466377,0.00005980247,0.00001655662,0.00002394643,0.000004800297,0.0002075984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9292404,"threshold_uncertainty_score":0.9999201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2200051882","doi":"","title":"Data sparseness in linear SVM","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Support vector machine; Computer science; Inference; Machine learning; Convergence (economics); Artificial intelligence; Data mining; Bayes' theorem; Pattern recognition (psychology); Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.3493317464406938,"gpt":0.4170538751309196,"spread":0.06772212869022581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007793381,0.0001570964,0.0001510886,0.0002264389,0.00004323593,0.0002695803,0.003298782,0.000061656,0.0001277705],"category_scores_gemma":[0.0005261524,0.0001493741,0.00002709439,0.0003371828,0.00006573142,0.000567861,0.0006599154,0.0003433328,0.00103413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006566132,"about_ca_system_score_gemma":0.0002059132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003071783,"about_ca_topic_score_gemma":0.000270233,"domain_scores_codex":[0.9980454,0.0001025653,0.0003947896,0.0006216738,0.0005865798,0.0002489199],"domain_scores_gemma":[0.9985629,0.00009305102,0.0001026077,0.000839043,0.0002618054,0.0001405681],"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.00003174973,0.000175034,0.000369695,0.000002031058,0.000008455731,0.00006799668,0.0004754019,0.006262293,0.0001350361,0.7434086,0.0003312304,0.2487324],"study_design_scores_gemma":[0.0000402301,0.00006853374,0.0001256183,0.00004354199,9.329747e-7,0.000009421628,0.0001526614,0.9182143,0.001342249,0.07453032,0.005298213,0.0001740426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007771687,0.00002254687,0.9505879,0.01045649,0.003809076,0.0001292744,0.00003033694,0.00017366,0.02701907],"genre_scores_gemma":[0.9813822,0.00001827869,0.01732401,0.0004025855,0.0003101499,0.000008450164,0.00004353058,0.000008543234,0.0005022811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9736105,"threshold_uncertainty_score":0.9997437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293319454","doi":"","title":"Correcting covariate shift with the Frank-Wolfe algorithm","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":10,"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":"Covariate; Kernel (algebra); Matching (statistics); Computer science; Algorithm; Mathematics; Statistics; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.1779524532938985,"gpt":0.3415912475879936,"spread":0.1636387942940951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007815921,0.000199833,0.0001467893,0.0001357426,0.0002200288,0.0007910318,0.001542962,0.00005853357,0.0002678996],"category_scores_gemma":[0.0002327968,0.0001413444,0.00005252285,0.0003851583,0.0001526039,0.0004716445,0.0001700797,0.0004088647,0.0008837957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008647762,"about_ca_system_score_gemma":0.0002419432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001708326,"about_ca_topic_score_gemma":0.0001035115,"domain_scores_codex":[0.9979071,0.0001407625,0.0003360912,0.0004646216,0.0008570382,0.0002943835],"domain_scores_gemma":[0.9984577,0.0002445073,0.0002036754,0.0003892864,0.0005416984,0.0001630962],"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.0000445347,0.00005174179,0.00003169285,7.419229e-7,0.00002222447,0.00002177493,0.002979902,0.003433993,0.00005207106,0.5707343,0.0001651227,0.422462],"study_design_scores_gemma":[0.0001019908,0.0002832592,0.0002310035,0.00005726778,0.000005927642,0.00004773446,0.002693791,0.927393,0.00354471,0.05924593,0.006062551,0.0003328772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002066965,0.00001405099,0.9585082,0.01053694,0.001548441,0.0001565941,0.000003797426,0.0001701474,0.02699484],"genre_scores_gemma":[0.9745465,0.000005556364,0.02326917,0.001400033,0.0002122454,0.00002663043,0.000006203727,0.00001248285,0.0005211597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9724795,"threshold_uncertainty_score":0.9998941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2217140526","doi":"","title":"Modular systems with preferences","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rotation formalisms in three dimensions; Modular design; Formalism (music); Computer science; Preference; Theoretical computer science; Programming language; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1857159101851297,"gpt":0.3284845900494835,"spread":0.1427686798643538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004025068,0.0002335407,0.000206475,0.0001767388,0.0000939775,0.0007644868,0.001839832,0.00008437965,0.00008952783],"category_scores_gemma":[0.0001750397,0.0001757191,0.00004914276,0.0002909465,0.0001390415,0.0005738629,0.0001842931,0.0002220782,0.00105607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001106459,"about_ca_system_score_gemma":0.000306766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001704036,"about_ca_topic_score_gemma":0.0001033997,"domain_scores_codex":[0.9978253,0.00009611261,0.0003655581,0.0005872956,0.0008113168,0.0003144005],"domain_scores_gemma":[0.9980987,0.00007991788,0.0001646502,0.0004752135,0.0009425877,0.0002389792],"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.00004900921,0.0001223805,0.0001810327,0.000003578797,0.00002686368,0.00002845208,0.0008915993,0.002696176,0.0002028456,0.9693423,0.0001574751,0.02629829],"study_design_scores_gemma":[0.00009099526,0.0007338932,0.0001993024,0.0001503795,0.000007503865,0.00005051824,0.001109385,0.733997,0.008084605,0.2513595,0.003708932,0.0005080592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01680531,0.00008275609,0.8155465,0.001250728,0.00246674,0.0002393873,0.000006487299,0.0002592536,0.1633429],"genre_scores_gemma":[0.9955771,0.00002443919,0.003012189,0.000125623,0.0002506471,0.0000468443,0.000007082323,0.000009883068,0.0009462227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9787717,"threshold_uncertainty_score":0.9997217,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W16563081","doi":"10.1521/pedi.2006.20.1.81","title":"Evolutionary Computing for Fuzzy System Optimization in Intelligent Control.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Fuzzy control system; Intelligent control; Fuzzy logic; Evolutionary computation; Control (management); Distributed computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06437064323099818,"gpt":0.3006360433241824,"spread":0.2362654000931843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005830593,0.0002516689,0.0003005313,0.0003363996,0.0001560536,0.0002998628,0.001326791,0.0001264393,0.00001406747],"category_scores_gemma":[0.0001894187,0.0002462054,0.0001335064,0.0003364872,0.0000773676,0.0003976003,0.0001072058,0.0002081041,0.0001541601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006170139,"about_ca_system_score_gemma":0.0002153797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001769475,"about_ca_topic_score_gemma":0.0000611853,"domain_scores_codex":[0.9974763,0.00009003341,0.0008491508,0.0006615075,0.0005207466,0.0004022193],"domain_scores_gemma":[0.9985066,0.0002173442,0.0002506261,0.0003558958,0.0005609622,0.0001085729],"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.00006761366,0.00009574625,0.00004000705,0.000009568849,0.00001415734,0.00001010469,0.0001873876,0.3769626,0.0001391987,0.6124916,0.000008738858,0.009973297],"study_design_scores_gemma":[0.000235102,0.0001822752,0.0000965386,0.0002394587,0.000003862058,0.0000163998,0.0004661673,0.8359201,0.0008158495,0.1617286,0.00005188409,0.0002437597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001292525,0.00005095628,0.9757844,0.003334377,0.00218307,0.0006996951,0.00001796168,0.0002057677,0.01643125],"genre_scores_gemma":[0.9743148,0.00001450798,0.02486164,0.0003408974,0.0002894662,0.0001126876,0.00001658787,0.00001302025,0.00003635944],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9730223,"threshold_uncertainty_score":0.999999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2274259390","doi":"","title":"Center-based initialization for large-scale black-box problems","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Ontario Tech University","funders":"","keywords":"Initialization; Population; Computer science; Mathematical optimization; Benchmark (surveying); Latin hypercube sampling; Differential evolution; Particle swarm optimization; Algorithm; Monte Carlo method; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1344271892125133,"gpt":0.3802287657734609,"spread":0.2458015765609476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085897,0.0002250404,0.00020173,0.0003801279,0.0001752434,0.0006734375,0.001553237,0.0001006095,0.0004397509],"category_scores_gemma":[0.0004584453,0.0002262533,0.0001110894,0.0004544793,0.00007643276,0.0004442206,0.00008707345,0.0001976652,0.000317511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00010932,"about_ca_system_score_gemma":0.0002107044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006084541,"about_ca_topic_score_gemma":0.00002194021,"domain_scores_codex":[0.9973545,0.0001055103,0.0006185113,0.0006616646,0.0008425651,0.00041723],"domain_scores_gemma":[0.9977185,0.0001670285,0.0001967662,0.0004847509,0.001269374,0.0001636264],"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.00006172807,0.0006105954,0.00001773965,0.000009482887,0.00001218695,0.000004722439,0.0004088564,0.02061627,0.0007193859,0.9010997,0.0002702839,0.07616899],"study_design_scores_gemma":[0.0001274611,0.0003035397,0.00002971083,0.00005821129,0.000002632506,0.000001881527,0.00004989821,0.8652788,0.01502721,0.1168616,0.002049377,0.000209643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002293839,0.000004670576,0.9790244,0.009318966,0.0008388709,0.0006024409,0.00006723712,0.0001800285,0.00973398],"genre_scores_gemma":[0.8838123,0.00002443154,0.1136888,0.001596984,0.0002179863,0.00007525568,0.0001360369,0.00001544623,0.0004327431],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8835829,"threshold_uncertainty_score":0.9226343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W89723526","doi":"","title":"The AntSynNet Algorithm: Network Syntheses Using Ant Colony Optimization.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Heuristics; Metaheuristic; Routing (electronic design automation); Heuristic; Mathematical optimization; Domain (mathematical analysis); Ant colony; Process (computing); Set (abstract data type); Parallel metaheuristic; Algorithm; Artificial intelligence; Meta-optimization; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.07995878778245127,"gpt":0.3109012267291485,"spread":0.2309424389466973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001601845,0.0002104184,0.0001524328,0.0000677259,0.000263287,0.000217272,0.0006768507,0.0001098531,0.0001168349],"category_scores_gemma":[0.0003216735,0.0001719782,0.00005451292,0.0002811834,0.0003013159,0.0001808448,0.00009100236,0.0003130575,0.0001128506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002220638,"about_ca_system_score_gemma":0.0000443473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001343964,"about_ca_topic_score_gemma":0.00004573321,"domain_scores_codex":[0.9986376,0.00001924051,0.0003645578,0.0002552031,0.0003233701,0.0004000824],"domain_scores_gemma":[0.9991103,0.0002961991,0.00006668935,0.0002653984,0.0001988706,0.00006256562],"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.00001231484,0.00001575631,0.000002838908,0.00000111962,0.00002241643,0.000008260988,0.0000178238,0.6835271,0.0001178757,0.2200038,0.00002923611,0.09624151],"study_design_scores_gemma":[0.00001526164,0.00004177832,0.000003762665,0.0001083783,0.000005376957,0.000008128964,0.0001558636,0.8803294,0.003219243,0.1152038,0.0007225006,0.0001864793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001942251,0.0001590218,0.9899006,0.001274775,0.00168204,0.0001887199,0.00001591538,0.0004788091,0.004357844],"genre_scores_gemma":[0.8009028,0.00105417,0.197442,0.00009464166,0.0003952565,0.00003348183,0.00000696575,0.00003484297,0.00003582092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7989606,"threshold_uncertainty_score":0.7013069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W194540509","doi":"","title":"A Modeling for the Total Tardiness SMSDST Problem Using Constraint Programming.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","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":"Université du Québec à Chicoutimi; Université du Québec","funders":"","keywords":"Tardiness; Constraint programming; Computer science; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Concurrent constraint logic programming; Constraint logic programming; Programming language; Job shop scheduling; Stochastic programming; Mathematics; Artificial intelligence; Embedded system; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.1200230154725008,"gpt":0.3461662791720779,"spread":0.2261432636995771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004242765,0.0001812572,0.0001279705,0.0001351074,0.000312268,0.0007114011,0.0008435586,0.00008615825,0.0002318348],"category_scores_gemma":[0.0002036213,0.0001454681,0.0001102174,0.0002071206,0.0001763919,0.0003859648,0.0001114033,0.0003253579,0.00003443876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004852053,"about_ca_system_score_gemma":0.0002209285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009795476,"about_ca_topic_score_gemma":0.0001703657,"domain_scores_codex":[0.9984654,0.00002601664,0.0004327566,0.0004331424,0.0003767093,0.0002659507],"domain_scores_gemma":[0.9985967,0.0001686896,0.0001224154,0.0003219307,0.0007071781,0.00008307422],"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.00001842289,0.00004060465,0.00001109971,0.000002516931,0.00001734449,0.000001204776,0.0002150145,0.09124373,0.003913176,0.6184903,0.000003992481,0.2860426],"study_design_scores_gemma":[0.00004086669,0.00004110631,0.00001229963,0.00002585848,0.000006847022,0.00003654994,0.0002674717,0.9645073,0.003587562,0.0311032,0.0001933745,0.0001775758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009422014,0.00000376845,0.9818527,0.00456352,0.00223901,0.0005651997,0.00001378107,0.0001299667,0.001210103],"genre_scores_gemma":[0.8836192,0.00000550263,0.1158702,0.000144141,0.0002112572,0.00008546425,0.000007031337,0.000009508149,0.00004769015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8741972,"threshold_uncertainty_score":0.6860058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36478636","doi":"10.1002/cphc.202200731","title":"A Matrix Based Approach For Modeling Robotic Swarm Behavior.","year":2006,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Computer science; Matrix (chemical analysis); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07657845565800311,"gpt":0.3338920032185947,"spread":0.2573135475605917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000191318,0.0001898237,0.0001513859,0.0001140755,0.00009558046,0.00009647978,0.0004117171,0.0001264545,0.00007559266],"category_scores_gemma":[0.00004247871,0.0001968521,0.00018945,0.0001008638,0.00006488679,0.000006103943,0.00004656457,0.00008542163,0.00002569293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003982678,"about_ca_system_score_gemma":0.00009333386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005985376,"about_ca_topic_score_gemma":0.00007261434,"domain_scores_codex":[0.9985767,0.00003464674,0.000381303,0.0004958566,0.0002658937,0.0002455763],"domain_scores_gemma":[0.9991649,0.00001415212,0.0001013708,0.0002863164,0.0003753698,0.00005792418],"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.0001204865,0.0002365541,0.0001409399,0.000005388034,0.00003323831,0.000001287596,0.000005926555,0.8938645,0.06682716,0.03582088,0.0001121399,0.002831509],"study_design_scores_gemma":[0.00004639941,0.00009484772,0.00001825351,0.000009262215,0.00003455414,0.000002243353,0.00005113145,0.8881384,0.1069256,0.004284265,0.0001929644,0.000202132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09689573,0.00005027964,0.9003918,0.0002215771,0.0002314959,0.0002683799,0.00002005943,0.00002295046,0.001897784],"genre_scores_gemma":[0.984829,0.000009958138,0.01337548,0.00009321735,0.0004967063,0.000158088,0.0004769111,0.00002392681,0.0005367227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8879333,"threshold_uncertainty_score":0.8027397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2266817871","doi":"","title":"An expectation-maximization algorithm to compute a stochastic factorization from data","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Stochastic matrix; Markov chain; Factorization; Algorithm; Matrix (chemical analysis); Computer science; Matrix decomposition; Matrix multiplication; Probabilistic logic; Mathematical optimization; Markov decision process; Markov process; Mathematics; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.6099591275582319,"gpt":0.5389729520319333,"spread":0.0709861755262986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001136442,0.0002538388,0.0002780459,0.0006525925,0.0001586941,0.001147391,0.003833291,0.0001044908,0.001321793],"category_scores_gemma":[0.006456654,0.0002301564,0.00004192468,0.0009842662,0.0001289115,0.001683002,0.0004796842,0.0002624553,0.002967587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00023283,"about_ca_system_score_gemma":0.0003574072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000324218,"about_ca_topic_score_gemma":0.0003244036,"domain_scores_codex":[0.9937623,0.0002783758,0.0009449242,0.001293513,0.003386667,0.0003342435],"domain_scores_gemma":[0.9939064,0.0008321519,0.0002830703,0.001396331,0.003061334,0.0005207506],"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.0002027686,0.0002694578,0.00006843404,3.511273e-7,0.00002409525,0.00001406467,0.002332915,0.2461927,0.0006929807,0.01552535,0.0006375157,0.7340394],"study_design_scores_gemma":[0.00005594363,0.0001969607,0.0001906415,0.00001999667,0.0000033973,0.000001676585,0.002517435,0.796276,0.002113035,0.1979406,0.0004686054,0.0002156557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004406544,0.000006089437,0.9896874,0.001941061,0.002301759,0.0003800312,0.0006195767,0.0001078332,0.0005496826],"genre_scores_gemma":[0.9475125,0.000004008583,0.05028101,0.0002439077,0.0007880368,0.00003060234,0.0009362191,0.00002466695,0.0001790449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9431059,"threshold_uncertainty_score":0.9998895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W153785916","doi":"","title":"Using Encyclopaedic Knowledge for Query Classification.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Information retrieval; Natural language processing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2987819629349078,"gpt":0.4204165625896202,"spread":0.1216345996547124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003739734,0.0001739711,0.0001524213,0.0002159014,0.000175232,0.0003387,0.001626095,0.000117094,0.0001813471],"category_scores_gemma":[0.0005178287,0.0001627022,0.0001018174,0.0001973155,0.0001609875,0.0003906583,0.0001337545,0.0002684826,0.0002616253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004804103,"about_ca_system_score_gemma":0.0002377333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003872504,"about_ca_topic_score_gemma":0.0002185211,"domain_scores_codex":[0.9984835,0.00003373071,0.0004162369,0.0005085243,0.0002851074,0.000272839],"domain_scores_gemma":[0.9984199,0.0002959316,0.0001463015,0.000461697,0.0005862666,0.00008992384],"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.0000153169,0.0001021755,0.00008266109,0.000003687301,0.00001019795,0.000001950932,0.0002497529,0.00002998925,0.03447199,0.8462817,0.0001014316,0.1186491],"study_design_scores_gemma":[0.0000310167,0.00006023746,0.0003741277,0.00002862961,0.000004369088,0.0000116227,0.000210789,0.6549356,0.03703841,0.3036484,0.003444423,0.0002123767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02199613,0.00001687349,0.9446753,0.003469713,0.005345717,0.0002428495,0.000009170333,0.0001761328,0.02406811],"genre_scores_gemma":[0.949638,0.00001761788,0.04942181,0.0002161832,0.0003982041,0.00004851042,0.000005977069,0.000009113733,0.0002445878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9276419,"threshold_uncertainty_score":0.6634805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W152011799","doi":"","title":"Arabic Handwriting Descriptor Using Gaussian Steerable Filters.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Handwritten Text Recognition Techniques","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":"New York Institute of Technology","funders":"","keywords":"Handwriting; Computer science; Artificial intelligence; Arabic; Gaussian; Pattern recognition (psychology); Speech recognition; Physics; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1202223762983931,"gpt":0.344228098910508,"spread":0.224005722612115,"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.0004899346,0.000257068,0.0002054306,0.0003584567,0.0002466101,0.0009800972,0.001738306,0.0001469581,0.001413159],"category_scores_gemma":[0.0002913236,0.0002592474,0.0001117674,0.0003174223,0.0001613905,0.0009629861,0.0002275881,0.0006365651,0.000506955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008369925,"about_ca_system_score_gemma":0.0001561785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001879416,"about_ca_topic_score_gemma":0.0002077014,"domain_scores_codex":[0.9977038,0.00007080378,0.0005690719,0.0006470617,0.000601257,0.0004080055],"domain_scores_gemma":[0.9984893,0.0001130565,0.0001924299,0.000524063,0.000507681,0.0001734613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001394854,0.00008647685,0.00006835589,0.000004181575,0.00001421135,0.00002287978,0.0002233254,0.00002417252,0.1625899,0.643945,0.00009225936,0.1929153],"study_design_scores_gemma":[0.00004157732,0.0001133763,0.00009976321,0.000146052,0.000005265711,0.00006175607,0.0001763095,0.3449836,0.4931193,0.1595985,0.001215874,0.0004386127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05940042,0.000005228566,0.9126602,0.002517794,0.002053381,0.0002299092,0.00001515586,0.0004270718,0.02269082],"genre_scores_gemma":[0.9214683,0.00001332108,0.07729939,0.0005645248,0.0003086029,0.00003370042,0.000007035608,0.00001715491,0.0002879764],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8620679,"threshold_uncertainty_score":0.999986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W49892756","doi":"","title":"Exploratory Analysis of Transaction Data","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Database transaction; Computer science; Transaction data; Transaction processing; Asset (computer security); Financial transaction; Point (geometry); Data science; Data visualization; Grid; Visualization; Data modeling; Computer security; Industrial organization; Data mining; Business; Database; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.2323307498745459,"gpt":0.3481484468204088,"spread":0.1158176969458629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003002625,0.0001428211,0.0002374763,0.0008870702,0.00007760652,0.0001975295,0.0008880232,0.00005609372,0.0008181855],"category_scores_gemma":[0.0001175017,0.0001367673,0.0001142863,0.001317379,0.00008736033,0.001226915,0.00008879588,0.000122479,0.0002216795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003105676,"about_ca_system_score_gemma":0.00005143942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006523367,"about_ca_topic_score_gemma":0.0008390615,"domain_scores_codex":[0.9985152,0.000005867894,0.000463129,0.0004104487,0.0004660799,0.0001392721],"domain_scores_gemma":[0.9986187,0.00002049257,0.0002552737,0.0004306557,0.000662597,0.00001228849],"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.0001490449,0.0004781337,0.000438118,0.00003304781,0.0007385024,0.000006632558,0.000149664,0.2079482,0.003551552,0.7068806,0.00002734962,0.07959916],"study_design_scores_gemma":[0.00005549104,0.00001033288,0.000257396,0.00008220159,0.0006047782,2.698667e-7,0.0009073784,0.8996477,0.004077116,0.09373861,0.0003722489,0.000246541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.141801,0.00002475912,0.8433568,0.005001121,0.0007540617,0.00009704586,0.00005372307,0.0001227701,0.008788683],"genre_scores_gemma":[0.9987308,0.00004006088,0.0002893506,0.0003753125,0.0002816624,0.000006934168,0.0002445937,0.00001017158,0.00002110131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8569298,"threshold_uncertainty_score":0.8958558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2478686883","doi":"","title":"Plenary lecture 8: towards opposition and center-based sampling for high-dimensional search spaces","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","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":"Ontario Tech University","funders":"","keywords":"Opposition (politics); Computer science; Population; Computational intelligence; Particle swarm optimization; Differential evolution; Artificial intelligence; Evolutionary computation; Algorithm; Machine learning; Sociology; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.1643328675132108,"gpt":0.3920872015279786,"spread":0.2277543340147678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005058412,0.000205806,0.0001870325,0.0003441211,0.0002188531,0.0006874585,0.0008317992,0.00009305825,0.0002264851],"category_scores_gemma":[0.0002970785,0.0001945299,0.00006229133,0.0002555668,0.0001063728,0.0003552733,0.0001124644,0.0002493984,0.00004316385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000937826,"about_ca_system_score_gemma":0.0002441261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003182033,"about_ca_topic_score_gemma":0.000008777807,"domain_scores_codex":[0.9977146,0.00009920887,0.0003897744,0.0006319653,0.0008254846,0.0003389141],"domain_scores_gemma":[0.9983314,0.000248896,0.00009629682,0.0002928478,0.0008612314,0.0001693577],"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.0001409222,0.0002150159,0.000007789828,0.000007855455,0.00001570484,0.00000839204,0.0001110258,0.01884008,0.003889904,0.5830807,0.00006114141,0.3936215],"study_design_scores_gemma":[0.0001036343,0.0004248149,0.0001660656,0.00006718887,0.00000292197,0.000008681429,0.0000211549,0.8701782,0.03968703,0.08902707,0.0001225053,0.0001907829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005164538,0.00002027396,0.9709474,0.02201578,0.0005564195,0.0003695682,0.00005016095,0.00009648011,0.0007793117],"genre_scores_gemma":[0.8308585,0.00002243999,0.1679036,0.000892152,0.0001463964,0.00002449026,0.00007573344,0.000008535213,0.00006818705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8513381,"threshold_uncertainty_score":0.7932701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115815646","doi":"","title":"The confluence of human capital management and human resource management and the benefits of knowledge engineering","year":2006,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Knowledge Management and Sharing","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Knowledge management; Human resource management; Competitive advantage; Human resource management system; Business; Context (archaeology); Human capital; Resource management (computing); Computer science; Marketing; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.05989098378268026,"gpt":0.3223248523561671,"spread":0.2624338685734869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000901065,0.0001250712,0.0001463005,0.000130359,0.0004875162,0.0001697072,0.0005883979,0.00003609559,0.00004676358],"category_scores_gemma":[0.00003615183,0.00009296663,0.00004718493,0.0001502211,0.0008528151,0.00008806284,0.0002628256,0.0001069802,0.000007818017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003360218,"about_ca_system_score_gemma":0.000008372666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006703542,"about_ca_topic_score_gemma":0.001752606,"domain_scores_codex":[0.9986688,0.00007429651,0.0004439779,0.0002358382,0.0003808073,0.0001962544],"domain_scores_gemma":[0.9992662,0.0001969547,0.0001636193,0.000176004,0.0001628819,0.00003433479],"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.00003007359,0.00004500782,0.000447005,0.00002518158,0.00004489413,0.000001229115,0.002327792,0.0001175578,0.0001303625,0.9782989,0.00003505739,0.01849695],"study_design_scores_gemma":[0.000944088,0.0003125045,0.05440178,0.001435303,0.0002320411,0.000002332609,0.0573107,0.01400269,0.01388654,0.8270503,0.0293757,0.001046002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5429969,0.0005473406,0.001033064,0.0009541475,0.0003035093,0.0006184298,0.000006330088,0.00003924909,0.453501],"genre_scores_gemma":[0.9959658,0.0002079893,0.00006850719,0.00001306838,0.00009843856,0.00002798798,0.000002865266,0.000007041515,0.003608301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4529688,"threshold_uncertainty_score":0.3791069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W21360298","doi":"10.1007/s10654-011-9560-y","title":"Solving Temporal Constraints Using Neural Networks.","year":2002,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","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":"University of Lethbridge","funders":"","keywords":"Travelling salesman problem; Artificial neural network; Computer science; Mathematical optimization; Constraint (computer-aided design); Constraint satisfaction problem; Hopfield network; Optimization problem; Focus (optics); Computation; Constraint satisfaction; Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1587728586955939,"gpt":0.3267786207031929,"spread":0.168005762007599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001882244,0.0002063318,0.000155152,0.0002288506,0.0001972973,0.0005637417,0.0008306479,0.00008765304,0.003841102],"category_scores_gemma":[0.0001154936,0.0002157827,0.00009080074,0.0003072351,0.0002197119,0.0006721452,0.0001298295,0.0002728802,0.0002325845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001043018,"about_ca_system_score_gemma":0.00003641148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003501057,"about_ca_topic_score_gemma":0.00003490024,"domain_scores_codex":[0.9982052,0.0000724229,0.0004875203,0.0004847038,0.0004419316,0.0003082471],"domain_scores_gemma":[0.9989782,0.00008895709,0.0001833403,0.0003077527,0.0003099879,0.0001317435],"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.000008275985,0.00007423393,0.0004128498,0.00000141853,0.00001668595,0.00002470217,0.0002492562,0.07209103,0.0003599755,0.5199147,0.00006770665,0.4067792],"study_design_scores_gemma":[0.00003382645,0.00004294781,0.00008052506,0.0000319045,0.000002919857,0.00004195965,0.000106754,0.9910805,0.0009345064,0.007321035,0.00009608331,0.0002270345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005148747,0.00001528514,0.975944,0.002642992,0.002096646,0.0001430841,0.000005291218,0.0001933924,0.01381056],"genre_scores_gemma":[0.9835947,0.00003429233,0.01544761,0.000607268,0.0001847456,0.000006791197,0.000005884216,0.00001005645,0.0001086381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9784459,"threshold_uncertainty_score":0.9970695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36524623","doi":"10.1016/j.scitotenv.2021.145866","title":"Blending e-learning and knowledge management for optimizing learning paths","year":2008,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut National de Santé Publique du Québec","keywords":"Computer science; Process (computing); Path (computing); Quality (philosophy); Knowledge acquisition; Order (exchange); Artificial intelligence; Knowledge management; Machine learning; Human–computer interaction","retraction":null,"screen_n_in":null,"score":{"opus":0.1169658852890127,"gpt":0.3397907915041923,"spread":0.2228249062151796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005486794,0.0002465565,0.0002173874,0.0003148687,0.0006777769,0.0003487852,0.0006866692,0.00007544617,0.00005536698],"category_scores_gemma":[0.0001733073,0.0002519479,0.00009854821,0.000195184,0.00008114106,0.0003884684,0.0002908929,0.0004190252,0.0001609832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001066937,"about_ca_system_score_gemma":0.00005278046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001598388,"about_ca_topic_score_gemma":0.000003593315,"domain_scores_codex":[0.9980131,0.0001083515,0.0004668507,0.0006625316,0.0003564605,0.0003927017],"domain_scores_gemma":[0.9989114,0.0002622487,0.0001952571,0.0001689146,0.0003512804,0.0001108392],"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.00002560373,0.0000505076,0.0001896796,0.00001881582,0.00003939084,0.00002842887,0.001968907,0.003245718,0.001111759,0.889137,0.0000162906,0.1041679],"study_design_scores_gemma":[0.0001416327,0.0005651709,0.0001395382,0.0006124532,0.00001331116,0.00009279556,0.004412033,0.8818538,0.02034769,0.01851193,0.07251478,0.0007948641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005726493,0.00008063644,0.9468198,0.000390246,0.001262713,0.0002879649,0.000001350713,0.0002397251,0.04519102],"genre_scores_gemma":[0.9652528,0.000333541,0.02432028,0.00004650475,0.0002542607,0.00007046689,0.000005240046,0.00002076251,0.009696139],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9595263,"threshold_uncertainty_score":0.9999933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W118337989","doi":"","title":"Generalized semi-infinite optimization and its application in robotics' path planning problem","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","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 Toronto","funders":"","keywords":"Motion planning; Robotics; Artificial intelligence; Computer science; Mathematical optimization; Path (computing); Optimization problem; Robot; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08382174438595084,"gpt":0.3290489713069911,"spread":0.2452272269210402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003443508,0.0002084764,0.0001838941,0.0003107193,0.00009617296,0.0002746097,0.0007747442,0.0001049268,0.00001506137],"category_scores_gemma":[0.0001051214,0.0002190669,0.00003184899,0.000379169,0.00004844379,0.0005099229,0.000151291,0.0002577511,0.0000884649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000146338,"about_ca_system_score_gemma":0.0001191456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008632523,"about_ca_topic_score_gemma":0.00001004549,"domain_scores_codex":[0.9981007,0.00005770388,0.000522203,0.0005973023,0.0004386405,0.0002834494],"domain_scores_gemma":[0.999119,0.0000764811,0.0001920345,0.0002555604,0.0002550707,0.0001018986],"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.000009803503,0.00005020407,0.00007857305,0.00000335077,0.000004807432,0.0000148708,0.0004952874,0.5749037,0.0008531687,0.4173847,0.000001678912,0.006199914],"study_design_scores_gemma":[0.00009548797,0.00007199335,0.0001245846,0.0001722163,0.00000227159,0.00001567024,0.00006973925,0.9178684,0.004788294,0.07655707,0.00001639475,0.0002179238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006126438,0.00004263124,0.9882168,0.002958758,0.0003764099,0.0003186444,0.000005268077,0.0001347783,0.001820304],"genre_scores_gemma":[0.782694,0.00005392479,0.2168178,0.0002372116,0.00007423011,0.00005526443,0.0000217986,0.00001093678,0.00003485888],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7765676,"threshold_uncertainty_score":0.893329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W282001120","doi":"","title":"Statistical Issues with Labeled Sample Size Analysis for Semi-Supervised Linear Discriminant Analysis.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Statistical Methods and Models","field":"Mathematics","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 Toronto","funders":"","keywords":"Linear discriminant analysis; Sample size determination; Statistical analysis; Artificial intelligence; Sample (material); Computer science; Statistics; Pattern recognition (psychology); Optimal discriminant analysis; Mathematics; Chromatography; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.298741371835398,"gpt":0.4893615187071724,"spread":0.1906201468717744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004238858,0.0002971719,0.0006329782,0.0002874932,0.0001479773,0.0001248948,0.0004271615,0.00008870831,0.001117854],"category_scores_gemma":[0.004653149,0.0002309476,0.0002279632,0.0007084951,0.0002129849,0.0001287252,0.00005264026,0.0002057228,0.00002533293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131278,"about_ca_system_score_gemma":0.0001002946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003259323,"about_ca_topic_score_gemma":0.001497333,"domain_scores_codex":[0.9975824,0.00008477001,0.0007040729,0.0006521509,0.0005980244,0.0003785346],"domain_scores_gemma":[0.9948421,0.003687351,0.0001951165,0.0003719912,0.0007265686,0.0001769067],"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.0004644717,0.0003608924,0.0001196356,0.00001801121,0.00130179,0.00001284204,0.0004385705,0.01530443,0.0008105093,0.9729629,0.000008571305,0.008197403],"study_design_scores_gemma":[0.0001069176,0.0002897801,0.0001708361,0.00003375315,0.001057114,8.099545e-7,0.0004031133,0.2112148,0.006896238,0.7794929,0.00006552698,0.0002681933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01154045,0.000005515305,0.9847639,0.001619871,0.000123321,0.000363581,0.001047464,0.00007106373,0.0004648492],"genre_scores_gemma":[0.5200741,0.00001557202,0.4794699,0.0001020501,0.00006601763,0.00006517777,0.00007583005,0.00001511838,0.0001162674],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5085337,"threshold_uncertainty_score":0.9997953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2443199731","doi":"","title":"Inapproximability of treewidth and related problems","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","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":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Graphical model; Tree decomposition; Combinatorics; Computer science; Mathematics; 1-planar graph; Inference; Discrete mathematics; Graph; Chordal graph; Theoretical computer science; Artificial intelligence; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1818545937339058,"gpt":0.3737240228359098,"spread":0.191869429102004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008374954,0.0001337515,0.0001663063,0.0002130728,0.00004300589,0.0001085156,0.001072858,0.00006395599,0.00007025305],"category_scores_gemma":[0.000574454,0.0001222083,0.00004250528,0.000374254,0.0003674854,0.0004455078,0.0003009449,0.0002273653,0.00007571125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006111022,"about_ca_system_score_gemma":0.0001311574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003595819,"about_ca_topic_score_gemma":0.00002105346,"domain_scores_codex":[0.9982125,0.0001235433,0.0004431432,0.0004442677,0.0005804764,0.0001961041],"domain_scores_gemma":[0.9984549,0.0001459792,0.0001440831,0.0004138488,0.0006858453,0.0001553106],"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.00003883191,0.0001194854,0.0002119492,0.000005303242,0.00001281962,0.000003781215,0.0008568929,0.0004521437,0.001683325,0.8976069,0.000008285831,0.09900025],"study_design_scores_gemma":[0.00004326793,0.000231415,0.0001499383,0.00003476041,0.000001202428,0.000009157118,0.0001764574,0.1479452,0.01788501,0.8333384,0.00007663423,0.0001084953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1233896,0.00008069753,0.8048034,0.005162706,0.0009673504,0.0005196997,0.00001505309,0.0001787467,0.06488273],"genre_scores_gemma":[0.9926159,0.0000205946,0.007087782,0.00003759974,0.00001798519,0.00001876718,0.000002807058,0.000006097141,0.0001924136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8692264,"threshold_uncertainty_score":0.498351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}