{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":82,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":82,"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":"f944c05b5d1a","filters":{"venue":"International Joint Conference on Artificial Intelligence"}},"results":[{"id":"W1558653343","doi":"","title":"Real-time strategy gaines: a new AI research challenge","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Operations research; Artificial intelligence; Human–computer interaction; Data science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2825745515600075,"gpt":0.4172919766152771,"spread":0.1347174250552695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002088602,0.0004961211,0.000450092,0.0008660622,0.0003796183,0.001296934,0.003034601,0.0002665444,0.003656499],"category_scores_gemma":[0.001641151,0.0004895495,0.0002252641,0.001049963,0.0004680361,0.001107802,0.0003864516,0.001027488,0.01210177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003580123,"about_ca_system_score_gemma":0.00117845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006525937,"about_ca_topic_score_gemma":0.0001917918,"domain_scores_codex":[0.993602,0.0005925188,0.001276699,0.001443699,0.001999651,0.001085395],"domain_scores_gemma":[0.9954255,0.0006379319,0.0002742166,0.001319262,0.001824112,0.0005189358],"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.00003313965,0.0003114199,0.000008505881,0.000004461287,0.00003357447,0.00008795116,0.0009965312,0.000975009,0.009780004,0.8548912,0.001802191,0.131076],"study_design_scores_gemma":[0.00003751408,0.0004950916,0.00002369573,0.0001440923,0.000004341533,0.00003548972,0.0007804939,0.1029759,0.1285156,0.7609929,0.005446172,0.0005486684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007116401,0.00005911917,0.6477711,0.02305132,0.002726901,0.0008318864,0.00001461665,0.0006636843,0.317765],"genre_scores_gemma":[0.9828783,0.0003997008,0.0100552,0.0004828861,0.0005144072,0.00007466639,0.000008878534,0.00004574683,0.005540227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9757619,"threshold_uncertainty_score":0.9997556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573425638","doi":"","title":"Distraction-based neural networks for modeling documents","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Automatic summarization; Computer science; Distraction; GRASP; Artificial neural network; Representation (politics); Artificial intelligence; Natural language processing; Traverse; Information retrieval; Machine learning; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1398677867114096,"gpt":0.3404630588579287,"spread":0.2005952721465191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003115437,0.0002030557,0.0001629959,0.0001580984,0.0001299348,0.0003428679,0.001043647,0.00008102733,0.0001531627],"category_scores_gemma":[0.0002422338,0.0001576956,0.0001360724,0.000104351,0.00005272922,0.0005691026,0.0001063011,0.0001405072,0.00009468026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001495774,"about_ca_system_score_gemma":0.00008880372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004760019,"about_ca_topic_score_gemma":0.0000317321,"domain_scores_codex":[0.9979714,0.00004021625,0.0005746608,0.0006239751,0.0004459714,0.0003438058],"domain_scores_gemma":[0.9985791,0.0002374888,0.0001661125,0.0004440826,0.0004571044,0.0001160734],"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.00004227126,0.00006573751,0.00002293974,0.000002194937,0.00001245929,0.000003574144,0.00002926405,0.2124639,0.001530853,0.473153,0.00002291078,0.312651],"study_design_scores_gemma":[0.00006358532,0.00006938197,0.00001097953,0.00007660041,0.000002862962,0.000002563669,0.00001778565,0.9050566,0.00663205,0.08776002,0.0001147802,0.0001928223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005457317,0.000005052526,0.979928,0.01093332,0.002386573,0.0002496396,0.00001181902,0.0001558842,0.0008724429],"genre_scores_gemma":[0.9827872,0.000009129488,0.01608544,0.0005505535,0.0003199113,0.00008270427,0.000006687403,0.00001241124,0.0001459515],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9773299,"threshold_uncertainty_score":0.6430639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W105409620","doi":"","title":"Planning with loops","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":78,"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":"Planner; Computer science; Strengths and weaknesses; Iterative method; Work (physics); Automated theorem proving; Theoretical computer science; Algorithm; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1145712606826355,"gpt":0.3172324644868931,"spread":0.2026612038042576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003372635,0.0002246544,0.0001723805,0.0002338197,0.0001660284,0.0004889778,0.001102344,0.00007127498,0.0003461747],"category_scores_gemma":[0.00008729518,0.0001922424,0.00005863658,0.0002358084,0.00008780668,0.0005751471,0.0001310476,0.0003495588,0.001014456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008953448,"about_ca_system_score_gemma":0.0001472777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003712381,"about_ca_topic_score_gemma":0.00002701686,"domain_scores_codex":[0.9980563,0.00005140116,0.0004193847,0.0005382781,0.0005897627,0.0003448981],"domain_scores_gemma":[0.9988463,0.000141263,0.0001757139,0.0003957392,0.0003071533,0.0001338272],"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.0000533474,0.0001029643,0.0002277127,0.000003315452,0.00002910293,0.0000565269,0.001072613,0.02855326,0.001130393,0.7087829,0.0003806533,0.2596073],"study_design_scores_gemma":[0.00008495749,0.0004064783,0.0004142515,0.0004691948,0.000006956486,0.00008294704,0.0002793793,0.8724402,0.0683325,0.04791871,0.008938551,0.0006259196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009655631,0.00002584396,0.9416199,0.01258386,0.0005156281,0.0001203268,0.00000586046,0.0002731387,0.03519977],"genre_scores_gemma":[0.9509874,0.000006969231,0.04705975,0.001128702,0.0002771903,0.00001849339,0.000008928511,0.00001183578,0.0005007116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9413318,"threshold_uncertainty_score":0.9997634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W182596629","doi":"","title":"Temporal difference learning applied to a high-performance game-playing program","year":2001,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Task (project management); Temporal difference learning; Artificial intelligence; Class (philosophy); Function (biology); Sequential game; Machine learning; Game design; Reinforcement learning; Game theory; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09513926961760284,"gpt":0.3262099561051989,"spread":0.231070686487596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006388062,0.0005936211,0.0005077993,0.0006947907,0.0003933024,0.001188571,0.002981506,0.0001950571,0.0006445402],"category_scores_gemma":[0.0004697356,0.0005846684,0.0001467276,0.001107186,0.0002563161,0.0006565018,0.0007102067,0.0008644276,0.004036595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002812037,"about_ca_system_score_gemma":0.0002123794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002344312,"about_ca_topic_score_gemma":0.000145955,"domain_scores_codex":[0.9948238,0.0001224489,0.001267592,0.001424592,0.001380285,0.0009813416],"domain_scores_gemma":[0.9973082,0.0002343626,0.0003985288,0.0008981341,0.0007356917,0.0004250838],"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.0001140111,0.0003175821,0.0009423667,0.000006290578,0.00002800787,0.00004291904,0.0008677747,0.008346178,0.00984059,0.3299933,0.00003408394,0.6494669],"study_design_scores_gemma":[0.00008863163,0.001381142,0.006412697,0.0003566622,0.0000121714,0.00007313331,0.0007697775,0.7492551,0.1617557,0.07353584,0.004808409,0.001550796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3712018,0.000006750897,0.6070241,0.003646167,0.001664013,0.0007811009,0.000004422758,0.0008809793,0.01479064],"genre_scores_gemma":[0.9693337,0.00007157143,0.02793289,0.0009317478,0.0003951338,0.0003803303,0.00001763353,0.00004238584,0.0008946257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7409089,"threshold_uncertainty_score":0.9998483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W119782953","doi":"10.5591/978-1-57735-516-8/ijcai11-099","title":"A uniform approach for generating proofs and strategies for both true and false QBF formulas","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":60,"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":"Correctness; Mathematical proof; Computer science; Conjunctive normal form; Falsity; True quantified Boolean formula; Simple (philosophy); Solver; Algorithm; Representation (politics); Computation; Theoretical computer science; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.266406923665083,"gpt":0.3559615866280027,"spread":0.0895546629629197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351393,0.0002132471,0.0002012739,0.0001767797,0.0002004768,0.000513707,0.0005743617,0.0000942914,0.00001270375],"category_scores_gemma":[0.0002827257,0.0001956953,0.00006133151,0.0001043073,0.0001579993,0.0009459741,0.0001392559,0.000130361,0.000004006277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004679905,"about_ca_system_score_gemma":0.0001229337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004454437,"about_ca_topic_score_gemma":0.00002909728,"domain_scores_codex":[0.9983508,0.00004144392,0.0005202749,0.000569533,0.0002370747,0.000280886],"domain_scores_gemma":[0.9988729,0.0001157938,0.0002316537,0.0002840828,0.000399059,0.00009647889],"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.00006523313,0.00006897729,0.00000916365,0.00002760572,0.00001567316,4.599198e-7,0.001508757,0.0001563323,0.002933252,0.7947174,0.000006842671,0.2004903],"study_design_scores_gemma":[0.000058103,0.000296637,0.00006370813,0.00002907736,0.000005311598,0.00001096795,0.0007099372,0.6981547,0.03428996,0.2660585,0.0001364799,0.0001866401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008031922,0.00002151,0.98623,0.0002270286,0.0004064922,0.0008226845,0.0000246435,0.00008743598,0.004148242],"genre_scores_gemma":[0.4757617,0.00001626911,0.523738,0.0001066933,0.00007157677,0.0002412528,0.000007869084,0.000008625979,0.00004807651],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6979983,"threshold_uncertainty_score":0.7980222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W131525165","doi":"","title":"Dual lookups in pattern databases","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Lookup table; Protein Data Bank (RCSB PDB); Heuristic; Table (database); Cube (algebra); Extension (predicate logic); Dual (grammatical number); Tree (set theory); Database; Combinatorics; Programming language; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1547039293367191,"gpt":0.3363811980348475,"spread":0.1816772686981283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005036861,0.0002211963,0.000190991,0.0003543682,0.00008718351,0.0003129934,0.0009411455,0.00006063922,0.000625667],"category_scores_gemma":[0.000189709,0.0002198373,0.00006827995,0.0002475395,0.00007461959,0.0006901206,0.0002481731,0.000381615,0.001546893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001210371,"about_ca_system_score_gemma":0.0001370662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003362203,"about_ca_topic_score_gemma":0.000641763,"domain_scores_codex":[0.9977829,0.00008775043,0.0006151254,0.0006005195,0.0005437492,0.0003699184],"domain_scores_gemma":[0.9988896,0.0001987611,0.000158167,0.0004530542,0.0001882323,0.0001121768],"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.00001865176,0.0001928008,0.0007234822,0.000004162325,0.00001172253,0.00007870941,0.0007006336,0.005459068,0.001184181,0.4203508,0.0003818297,0.5708939],"study_design_scores_gemma":[0.00009093294,0.0001369914,0.001393349,0.0003908076,0.000003317843,0.00004168101,0.0001928955,0.9104501,0.05248129,0.02782656,0.006437738,0.0005543453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02303146,0.00003200008,0.9487725,0.01570414,0.001001099,0.0001584277,0.00003256237,0.0001833741,0.01108441],"genre_scores_gemma":[0.9858645,0.00002756417,0.01216579,0.00135152,0.0003002652,0.0000221218,0.00002891674,0.00001030649,0.0002290072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.962833,"threshold_uncertainty_score":0.9992305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2574227367","doi":"","title":"Monte Carlo tree search in continuous action spaces with execution uncertainty","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":49,"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; Set (abstract data type); Fidelity; Machine learning; Tree (set theory); Action (physics); Artificial intelligence; Monte Carlo method; Kernel (algebra); Domain (mathematical analysis); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1274409482000282,"gpt":0.3388143823562566,"spread":0.2113734341562284,"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.0007291627,0.000401137,0.0003812599,0.0006601332,0.0001400185,0.0005470954,0.001578386,0.0001650034,0.0003241542],"category_scores_gemma":[0.0003630774,0.0002860048,0.0001220434,0.0006064886,0.0004207474,0.001231009,0.0002515546,0.0003949125,0.0008356245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005361977,"about_ca_system_score_gemma":0.0002856308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001222838,"about_ca_topic_score_gemma":0.003800967,"domain_scores_codex":[0.9960181,0.0002190041,0.0008817129,0.00106677,0.001149573,0.0006648289],"domain_scores_gemma":[0.9975919,0.0003819852,0.0002836057,0.0007176228,0.0008311545,0.0001937731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002853809,0.0002582356,0.0007406359,0.00000517758,0.00003274597,0.00009253422,0.0010631,0.006276251,0.02138546,0.3994014,0.00006966415,0.5703894],"study_design_scores_gemma":[0.0002530162,0.001343192,0.003553318,0.001142768,0.00001384795,0.00008605075,0.003920529,0.3975709,0.4916044,0.09766763,0.001498162,0.00134609],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3718368,0.0000178476,0.601288,0.01789185,0.00146352,0.0005480458,0.00001900984,0.0002978016,0.006637093],"genre_scores_gemma":[0.9956497,0.0001233486,0.002930027,0.0002179043,0.0002063122,0.00008645521,0.00000243487,0.00002348251,0.0007603215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6238129,"threshold_uncertainty_score":0.9999592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912387951","doi":"","title":"Solving checkers","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Value (mathematics); Simple (philosophy); Space (punctuation); Artificial intelligence; Theoretical computer science; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1273764187861364,"gpt":0.3387486621145042,"spread":0.2113722433283677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006217316,0.0003871353,0.0003041614,0.0004526346,0.0002399168,0.0008476148,0.002690539,0.0001516278,0.001617485],"category_scores_gemma":[0.0005334717,0.0003853845,0.0002143865,0.0004439668,0.0002636662,0.001309261,0.0004571406,0.0005001216,0.007807428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002903492,"about_ca_system_score_gemma":0.0001960658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000755375,"about_ca_topic_score_gemma":0.0001405912,"domain_scores_codex":[0.9962464,0.00009259931,0.001034205,0.000958303,0.001033143,0.0006353724],"domain_scores_gemma":[0.9977371,0.0001965947,0.0003047612,0.0008700014,0.0006407854,0.0002508241],"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.00001517681,0.000136224,0.00001855024,0.000001618052,0.00002024847,0.00001460406,0.0006206158,0.001875666,0.005218231,0.5968045,0.0003777265,0.3948968],"study_design_scores_gemma":[0.00002336725,0.0001257465,0.00009496399,0.00009160557,0.000004870969,0.00002644876,0.0004211501,0.5241276,0.3061761,0.1581296,0.01025758,0.0005209943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00710079,0.00003007685,0.8857418,0.03354484,0.00248794,0.0002786227,0.000008221014,0.0005365015,0.07027122],"genre_scores_gemma":[0.9556392,0.00007334553,0.04057692,0.00200906,0.0007196667,0.00004785537,0.000006068302,0.00002450427,0.0009033142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9485385,"threshold_uncertainty_score":0.9998598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2574075402","doi":"","title":"Predicting confusion in information visualization from eye tracking and interaction data","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":43,"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":"Confusion; Visualization; Computer science; Focus (optics); Human–computer interaction; Information visualization; Data visualization; Eye tracking; Random forest; User satisfaction; Tracking (education); Data science; Artificial intelligence; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1565846372061156,"gpt":0.3893210314244875,"spread":0.232736394218372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004431077,0.0001543582,0.0001445514,0.0003771779,0.00007562419,0.0006325255,0.0008946952,0.00007405107,0.000208992],"category_scores_gemma":[0.0008249981,0.000126851,0.00002181222,0.0002417654,0.00006270061,0.004431931,0.0004825903,0.000119569,0.0001892423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009293894,"about_ca_system_score_gemma":0.00006629489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002488962,"about_ca_topic_score_gemma":0.0002601773,"domain_scores_codex":[0.9981412,0.0000839143,0.0006970858,0.0004536488,0.000452779,0.0001713614],"domain_scores_gemma":[0.9986892,0.0001705051,0.0002927083,0.0004662681,0.0003072979,0.00007398229],"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.00002966678,0.0000794708,0.002419821,0.000004002813,0.00001216581,0.000003821779,0.0008844788,0.0001109268,0.005402787,0.509456,0.00005737057,0.4815395],"study_design_scores_gemma":[0.0001025562,0.00004968177,0.003598081,0.0003906449,0.00000377009,0.000002688887,0.0004663022,0.9539047,0.01416005,0.02573994,0.001378432,0.0002031238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04679868,0.000004470409,0.9470658,0.003719497,0.0008735662,0.000136498,0.00009096036,0.0001070216,0.001203472],"genre_scores_gemma":[0.9973936,0.0001637758,0.001591005,0.0004712204,0.0001001005,0.000006328521,0.0002392143,0.000006233603,0.00002851955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9537938,"threshold_uncertainty_score":0.6099458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2248999929","doi":"","title":"A reputation management approach for resource constrained trustee agents","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":40,"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":"Reputation; Reputation management; Computer science; Constraint (computer-aided design); Control (management); Work (physics); Trust management (information system); Resource (disambiguation); Computer security; Resource management (computing); Risk analysis (engineering); Multi-agent system; Business; Distributed computing; Law; Engineering; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1450471926422882,"gpt":0.3607568540229891,"spread":0.2157096613807009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005505393,0.0001764906,0.0001847373,0.000202526,0.0004035771,0.0005408642,0.000565654,0.0001015567,0.002244384],"category_scores_gemma":[0.0003294468,0.0001715731,0.0001290074,0.0001753257,0.0003192955,0.0003738025,0.000061141,0.0001423323,0.0004224463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001397206,"about_ca_system_score_gemma":0.00008360676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005177702,"about_ca_topic_score_gemma":0.00008406878,"domain_scores_codex":[0.9978905,0.0001090115,0.0005229541,0.0004677346,0.000644657,0.0003651917],"domain_scores_gemma":[0.9987761,0.0001423008,0.0002190084,0.0001919161,0.0005265474,0.0001441056],"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.00005593267,0.0001448499,0.00002475066,0.000007677401,0.0000495845,0.000002707344,0.00125293,0.000453522,0.00009279032,0.7513539,0.0007573327,0.245804],"study_design_scores_gemma":[0.0004359106,0.0002591716,0.001206905,0.000169649,0.00006630575,0.00000440072,0.04681274,0.3311746,0.002556185,0.5745426,0.04184154,0.0009300367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.005762489,0.000007134275,0.4357693,0.009151272,0.0007084062,0.00171791,0.00002944632,0.0001563142,0.5466977],"genre_scores_gemma":[0.9881191,0.000027787,0.006580533,0.0007875913,0.0003519539,0.0005089941,0.00006447635,0.00001423863,0.003545379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9823565,"threshold_uncertainty_score":0.9986677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W25763866","doi":"10.1371/journal.pone.0115657","title":"Regret-based utility elicitation in constraint-based decision problems","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Toronto","funders":"","keywords":"Regret; Preference elicitation; Mathematical optimization; Computer science; Preference; Heuristic; Constraint (computer-aided design); Minimax; Binary decision diagram; Optimization problem; Product (mathematics); Artificial intelligence; Machine learning; Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1005012886310663,"gpt":0.3222350740173838,"spread":0.2217337853863176,"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.0006891488,0.0002563807,0.000221778,0.0006448349,0.0001089805,0.0003840632,0.0007297554,0.0001321856,0.001204183],"category_scores_gemma":[0.0005467143,0.0002612934,0.0001136295,0.0005104582,0.0002079016,0.0006045604,0.00004985746,0.000336008,0.0004643339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002676599,"about_ca_system_score_gemma":0.0003958298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007204872,"about_ca_topic_score_gemma":0.0007772833,"domain_scores_codex":[0.9972034,0.0001239002,0.0009202197,0.0006941757,0.0007407755,0.0003175193],"domain_scores_gemma":[0.9982501,0.000342146,0.0002673289,0.0004512287,0.0005577967,0.0001314038],"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.00004995949,0.0002191441,0.0004491184,0.000004080511,0.000004769136,0.000006337623,0.0001586703,0.07582363,0.0009781494,0.2468519,0.00003742821,0.6754168],"study_design_scores_gemma":[0.0001575299,0.00008523933,0.002578448,0.0001895856,0.000002099013,0.000004246266,0.00008774938,0.9500656,0.02095854,0.02496977,0.0006378036,0.0002634025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009845957,0.000006176235,0.9667054,0.01429523,0.0007074375,0.0003751332,0.00001411672,0.000189925,0.007860587],"genre_scores_gemma":[0.9209086,0.00000820427,0.07760141,0.001303223,0.00006914775,0.00004571666,0.00002574788,0.000009876737,0.00002805528],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9110627,"threshold_uncertainty_score":0.9999839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294581381","doi":"10.5591/978-1-57735-516-8/ijcai11-027","title":"Social distance games","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Closeness; Stability (learning theory); Computer science; Context (archaeology); Mathematical economics; Transferable utility; Perspective (graphical); Social Welfare; Measure (data warehouse); Microeconomics; Game theory; Economics; Mathematics; Artificial intelligence; Machine learning; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.2965024916787837,"gpt":0.3082783851999703,"spread":0.01177589352118652,"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.00056586,0.0001872146,0.0002916771,0.0002041907,0.0001297953,0.0001235534,0.0005274612,0.0000948631,0.004410337],"category_scores_gemma":[0.0001998597,0.0002089743,0.0001435097,0.0001392493,0.0001821834,0.0002031105,0.00006107517,0.0002185421,0.005886663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008358472,"about_ca_system_score_gemma":0.00001942256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001487194,"about_ca_topic_score_gemma":0.00003302559,"domain_scores_codex":[0.9982957,0.00003322663,0.00082278,0.0004712616,0.0001001017,0.0002769502],"domain_scores_gemma":[0.9991406,0.00003775931,0.0003970269,0.0002269748,0.0001249755,0.00007266312],"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.00006472734,0.0001504198,0.0006602476,0.000005514214,0.00003297793,0.000008158385,0.002031114,0.000007605523,0.000132203,0.9886453,0.0001739878,0.008087745],"study_design_scores_gemma":[0.00003863238,0.00008824821,0.002248933,0.00004992117,0.000002585255,0.00000519728,0.0005957379,0.003878516,0.007577054,0.979553,0.005640057,0.0003221011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0711785,0.00006163119,0.1987492,0.002472833,0.003150084,0.0002758963,0.0001486545,0.00019297,0.7237703],"genre_scores_gemma":[0.9969404,0.00001757983,0.0003895531,0.0002692998,0.0003279388,0.00002981597,0.000009519566,0.00001874729,0.001997156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9257619,"threshold_uncertainty_score":0.9964998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W26274488","doi":"10.1111/vcp.12275","title":"Lambda depth-first proof number search and its application to go","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"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":"Depth-first search; Computer science; Search algorithm; Proof of concept; Search tree; Iterative deepening depth-first search; Theoretical computer science; Space (punctuation); Beam stack search; Combinatorial search; Breadth-first search; Algorithm; Search problem; Mathematics; Beam search; Best-first search","retraction":null,"screen_n_in":null,"score":{"opus":0.1110297032690316,"gpt":0.3652190956948882,"spread":0.2541893924258566,"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.001261699,0.0003536636,0.0002840591,0.0004097194,0.0002580044,0.0005230651,0.001711082,0.0001601578,0.0002902797],"category_scores_gemma":[0.0004745507,0.0003581573,0.00009554522,0.0006659995,0.0001646385,0.0006570386,0.0005814396,0.0004230823,0.005968035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001839906,"about_ca_system_score_gemma":0.0001280325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001771354,"about_ca_topic_score_gemma":0.001486115,"domain_scores_codex":[0.9961627,0.00006645239,0.0009479497,0.001086699,0.001065105,0.0006710701],"domain_scores_gemma":[0.9974682,0.0003088751,0.0001632652,0.0006307667,0.001015571,0.0004133559],"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.00005742675,0.0001522861,0.0002991241,0.000007527186,0.00001731346,0.00002140695,0.001138561,0.0009981468,0.007342458,0.6852599,0.000076064,0.3046297],"study_design_scores_gemma":[0.00002929858,0.0001982146,0.001452644,0.0001324055,0.000005619646,0.00004603138,0.0004473856,0.2526209,0.65978,0.08104368,0.003673786,0.0005699739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04967362,0.00001611475,0.9158943,0.01091979,0.00102762,0.0007564267,0.000009008111,0.0002162318,0.02148688],"genre_scores_gemma":[0.9885159,0.00003558604,0.009386129,0.0009603772,0.0003257241,0.00008466064,0.000006551635,0.00002584925,0.0006592423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9388422,"threshold_uncertainty_score":0.999887,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914998942","doi":"","title":"Goal change","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Situation calculus; Action (physics); Belief revision; Computer science; Calculus (dental); Contraction (grammar); Mathematical economics; Artificial intelligence; Epistemology; Mathematics; Philosophy; Linguistics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1718701374104723,"gpt":0.3329877338590056,"spread":0.1611175964485333,"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.0003316235,0.0002443089,0.0002020367,0.00024208,0.0001357229,0.0004526992,0.001586695,0.00009960107,0.001017578],"category_scores_gemma":[0.0001915071,0.0002217314,0.0001340584,0.0002409582,0.0001165807,0.0007941241,0.0003090653,0.0002836114,0.005882373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001471419,"about_ca_system_score_gemma":0.0001004737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006245802,"about_ca_topic_score_gemma":0.0001610863,"domain_scores_codex":[0.997871,0.00006143066,0.0004861385,0.0006157952,0.0005744185,0.0003912286],"domain_scores_gemma":[0.9986731,0.00008622643,0.0001666323,0.0004783437,0.0004255563,0.0001701229],"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.000009627407,0.0001307777,0.00002880206,0.00000133072,0.00001023238,0.00001099546,0.0006935626,0.00004153953,0.0007935556,0.6383772,0.000239685,0.3596627],"study_design_scores_gemma":[0.0001093132,0.0003679735,0.001598719,0.0001549015,0.000008520612,0.0000632806,0.0002448043,0.5950457,0.1016991,0.2515027,0.04831318,0.0008917816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007439197,0.0000724374,0.7975042,0.0239387,0.003512559,0.0003493102,0.00001187283,0.0004531504,0.1667185],"genre_scores_gemma":[0.9882779,0.00007629304,0.007665653,0.001692243,0.001191797,0.00006178173,0.000007015461,0.00001143551,0.001015948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9808387,"threshold_uncertainty_score":0.9998956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397939602","doi":"","title":"Controlling the hypothesis space in probabilistic plan recognition","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada; Université de Sherbrooke","funders":"","keywords":"Plan (archaeology); Computer science; Probabilistic logic; Heuristic; Sequence (biology); Artificial intelligence; Machine learning; Space (punctuation); Execution time; Combinatorial explosion; Theoretical computer science; Distributed computing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1571855741428569,"gpt":0.2803320152353006,"spread":0.1231464410924437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006136616,0.000192934,0.0001794367,0.0002108967,0.0001389639,0.0006370081,0.001005986,0.00007617442,0.0004665576],"category_scores_gemma":[0.0007526763,0.0001474485,0.00007075749,0.0002595524,0.00009902343,0.0004272537,0.0001024546,0.0003620244,0.001737077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000983351,"about_ca_system_score_gemma":0.0001037873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006613657,"about_ca_topic_score_gemma":0.0001505164,"domain_scores_codex":[0.9981062,0.0001595823,0.0005298178,0.0004558239,0.0004271743,0.0003214267],"domain_scores_gemma":[0.9982266,0.0008256561,0.0001929412,0.0003488053,0.0003283322,0.00007768502],"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.00004703801,0.000175754,0.0003231401,0.00001005369,0.00002814873,0.00002427263,0.001668206,0.009021821,0.003226794,0.5183826,0.0002785076,0.4668137],"study_design_scores_gemma":[0.00004549861,0.00008385615,0.001152812,0.0002102727,0.000002959747,0.000009911255,0.0002498198,0.5564623,0.008012949,0.4334268,0.000124632,0.000218168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1403356,0.00003782138,0.7851725,0.05067074,0.00171403,0.001113206,0.00002087395,0.0002774165,0.02065778],"genre_scores_gemma":[0.9918261,0.00001677788,0.007022541,0.0007446037,0.000120496,0.0001352374,0.000007173281,0.000009073153,0.0001179906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8514904,"threshold_uncertainty_score":0.9990402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889093876","doi":"","title":"Predicting Glycemia in Type 1 Diabetes Patients: Experiments with XG-Boost.","year":2018,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Diabetes Management and Research","field":"Medicine","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Diabetes mellitus; Type 2 diabetes; Medicine; Computer science; Intensive care medicine; Endocrinology","retraction":null,"screen_n_in":null,"score":{"opus":0.09958495237028905,"gpt":0.3561212640888013,"spread":0.2565363117185122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002037312,0.0001788258,0.000214668,0.0003592953,0.00006706049,0.0001122398,0.0002566006,0.00006629524,0.001784617],"category_scores_gemma":[0.0003189362,0.0001420304,0.00004140596,0.0003160131,0.0002667658,0.0001746154,0.0001194444,0.0002260031,0.0006777663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001447641,"about_ca_system_score_gemma":0.00009106998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003201525,"about_ca_topic_score_gemma":0.00007555757,"domain_scores_codex":[0.9980704,0.00003521187,0.0004052403,0.0004066024,0.0007160878,0.0003664733],"domain_scores_gemma":[0.998716,0.00005328867,0.0001038595,0.0002329514,0.0007784235,0.0001154931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.005787132,0.003521588,0.4515004,0.0001000041,0.0004326445,0.00009847711,0.002387507,0.0001004672,0.0207587,0.117687,0.001212694,0.3964133],"study_design_scores_gemma":[0.002099675,0.01444326,0.1322826,0.004452247,0.00008683592,0.000003382387,0.003067506,0.1711135,0.6403052,0.02541252,0.005321004,0.001412253],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9464566,0.00001050942,0.0007159746,0.001268644,0.0007675216,0.0004430687,0.000005853962,0.0000593418,0.05027253],"genre_scores_gemma":[0.9978165,0.00001534592,0.0003741185,0.0004598681,0.0002851832,0.00003535453,0.00004511606,0.00001977701,0.0009487196],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6195465,"threshold_uncertainty_score":0.9991279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W70833783","doi":"","title":"Central clustering of categorical data with automated feature weighting","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":28,"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":"Categorical variable; Cluster analysis; Computer science; Weighting; Artificial intelligence; Data mining; Kernel (algebra); Pattern recognition (psychology); Feature (linguistics); Clustering high-dimensional data; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1255337164547048,"gpt":0.3539444780504479,"spread":0.2284107615957432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002453391,0.0002396787,0.000258221,0.0002420349,0.0001012797,0.0004200768,0.002989181,0.0000879519,0.0002297644],"category_scores_gemma":[0.0002470035,0.0001965759,0.0000447906,0.0004131958,0.0001783976,0.001470135,0.001209624,0.0004204407,0.0002019152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001332399,"about_ca_system_score_gemma":0.0001871981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003178281,"about_ca_topic_score_gemma":0.00005266486,"domain_scores_codex":[0.997202,0.00007650597,0.0005123416,0.0007599784,0.0009387027,0.0005104095],"domain_scores_gemma":[0.9976496,0.0001572724,0.0002394143,0.001041424,0.0007285735,0.0001837004],"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.0001036843,0.0004135435,0.0001179716,0.00004678198,0.000134028,0.0001346649,0.001000992,0.02628035,0.02145676,0.2889513,0.0006255986,0.6607343],"study_design_scores_gemma":[0.00004641497,0.0001490548,0.0005011721,0.0001099959,0.000002604393,0.00004706313,0.0001568278,0.9700027,0.01967414,0.008955808,0.0001342786,0.0002199489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002991617,0.000008706082,0.9873973,0.005594166,0.000586588,0.0002958044,0.00001503193,0.000346871,0.002763891],"genre_scores_gemma":[0.8759317,0.00001790449,0.123551,0.0001272109,0.0001152452,0.00002611018,0.00002958971,0.00001627972,0.0001850335],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9437224,"threshold_uncertainty_score":0.8016133,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403069539","doi":"","title":"Learning finite Beta-Liouville mixture models via variational bayes for proportional data clustering","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Mixture model; Expectation–maximization algorithm; Computer science; Inference; Bayesian inference; Artificial intelligence; Data point; Algorithm; Pattern recognition (psychology); Mathematics; Bayesian probability; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1644953914173749,"gpt":0.3381483742376632,"spread":0.1736529828202883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008707523,0.0003255044,0.0003017624,0.0002743198,0.000286276,0.0007748762,0.002157921,0.0001597832,0.0006954233],"category_scores_gemma":[0.0003350882,0.000299814,0.0001381964,0.0002240208,0.00009877857,0.001810803,0.0007075439,0.0004340439,0.0002717375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008730435,"about_ca_system_score_gemma":0.0002245937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001088006,"about_ca_topic_score_gemma":0.00003406915,"domain_scores_codex":[0.996754,0.0001392168,0.0008359174,0.001059443,0.0007741168,0.0004373123],"domain_scores_gemma":[0.9972303,0.0004255341,0.0003643329,0.0007692049,0.001035072,0.0001755645],"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.00002218233,0.0001112654,0.000005514562,0.000009151901,0.0000570556,0.000003396626,0.0002774483,0.02041846,0.001572972,0.7096043,0.0004646308,0.2674536],"study_design_scores_gemma":[0.00003651711,0.0000807416,0.00003001922,0.00003856503,0.000005747712,0.000008900915,0.00002418096,0.5929768,0.001721783,0.404358,0.0005073812,0.000211328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001002726,0.00001992954,0.9822357,0.01001759,0.001334659,0.0006168775,0.00006869724,0.0001684625,0.005437853],"genre_scores_gemma":[0.4779496,0.00003418637,0.5199432,0.000651481,0.0004151943,0.0001738821,0.0002042199,0.00002171261,0.000606454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5725584,"threshold_uncertainty_score":0.9999454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W49807964","doi":"","title":"A simple feature selection method for text classification","year":2001,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","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é Laval","funders":"","keywords":"Feature selection; Computer science; Information gain; Feature (linguistics); Simple (philosophy); Set (abstract data type); Artificial intelligence; Selection (genetic algorithm); Pattern recognition (psychology); Data mining; Feature extraction; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1510900227271396,"gpt":0.3835078255874474,"spread":0.2324178028603078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294358,0.0002243549,0.0001898155,0.0003890519,0.0002160705,0.0005579018,0.001211665,0.0001662892,0.0002508794],"category_scores_gemma":[0.0004357975,0.0002130757,0.0001310681,0.0005185675,0.00007544675,0.000615337,0.0001189899,0.0002535256,0.0003496277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001763135,"about_ca_system_score_gemma":0.0001081762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003000382,"about_ca_topic_score_gemma":0.00005887542,"domain_scores_codex":[0.9980019,0.00006280678,0.0004736558,0.0006989729,0.0004494225,0.0003132412],"domain_scores_gemma":[0.9982961,0.0002062664,0.0002849587,0.0004565737,0.0006754443,0.00008068897],"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.0000318615,0.00008534625,0.00005186684,0.000002036264,0.00001337399,0.000001070502,0.00007666352,0.0001168624,0.0157699,0.6268655,0.001189392,0.3557961],"study_design_scores_gemma":[0.00004645118,0.0001492551,0.0007683095,0.00001948851,0.000004662375,0.00001413243,0.0002564202,0.546196,0.06476967,0.3614761,0.02607468,0.0002247993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009265626,0.000008568831,0.9591491,0.0315516,0.0006988092,0.0004118876,0.00001064887,0.00055733,0.006685445],"genre_scores_gemma":[0.8898557,0.00006470622,0.1076037,0.0006159761,0.0001813968,0.0002411114,0.00003488724,0.00001362386,0.001388859],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8889292,"threshold_uncertainty_score":0.8688976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1552684655","doi":"","title":"Using linear programming for Bayesian exploration in Markov decision processes","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":25,"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":"Markov decision process; Computer science; Bellman equation; Reinforcement learning; Mathematical optimization; Markov process; Linear programming; Machine learning; Representation (politics); Artificial intelligence; Markov chain; Key (lock); Bayesian probability; Partially observable Markov decision process; Markov model; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2143689443380605,"gpt":0.3942220206217933,"spread":0.1798530762837328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096714,0.0002063185,0.0001853076,0.0005098616,0.0001228865,0.0003920841,0.0008631855,0.00009992422,0.00003922663],"category_scores_gemma":[0.00135866,0.0002088903,0.00006751872,0.0005514615,0.00006652463,0.0009552589,0.0001460838,0.0002244475,0.00004868241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002109111,"about_ca_system_score_gemma":0.0002121952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003725875,"about_ca_topic_score_gemma":0.0002087822,"domain_scores_codex":[0.9975551,0.00003150483,0.0008522841,0.0005238088,0.0006356875,0.0004015567],"domain_scores_gemma":[0.9981309,0.0004177777,0.0002841508,0.0002984485,0.0007758776,0.00009280629],"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.0001515707,0.0001434433,0.0001790877,0.00002630882,0.00001243828,0.00002025599,0.0009005344,0.2799692,0.001970978,0.2238199,0.00001534535,0.492791],"study_design_scores_gemma":[0.00006143513,0.000167439,0.00005498284,0.0002708112,0.000002578771,0.000005763115,0.0003053287,0.9341963,0.03173863,0.03232767,0.0006380738,0.000231001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002407519,0.000006063945,0.9935604,0.001157994,0.001040565,0.0005269353,0.000001750407,0.0001044195,0.001194326],"genre_scores_gemma":[0.6714817,0.00001425085,0.3280916,0.0001732124,0.0001417479,0.00002705025,0.000008788706,0.00001179147,0.00004987633],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6690741,"threshold_uncertainty_score":0.8518301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W143659154","doi":"","title":"Evaluating a decision-theoretic approach to Tailored example selection","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Selection (genetic algorithm); Probabilistic logic; Mechanism (biology); Process (computing); Artificial intelligence; Machine learning; Management science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2154223549669306,"gpt":0.3802068011370155,"spread":0.1647844461700849,"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.00262566,0.0002948598,0.0002610716,0.0005918984,0.0002746767,0.0006208719,0.001283514,0.0001080864,0.0001933337],"category_scores_gemma":[0.0009521199,0.0002800201,0.0001331532,0.0006431278,0.00006196671,0.0003812329,0.0002708751,0.000403415,0.001185238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003017132,"about_ca_system_score_gemma":0.0001276771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002522844,"about_ca_topic_score_gemma":0.00004221101,"domain_scores_codex":[0.9962881,0.0001201157,0.0009121876,0.0009316928,0.00119473,0.0005531879],"domain_scores_gemma":[0.9976916,0.0004030002,0.0002581154,0.0004498186,0.0009596389,0.0002378809],"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.00006463889,0.0001246415,0.0000438502,0.00000379892,0.00001740722,0.000006215817,0.001082267,0.007790595,0.009580261,0.7644732,0.00003305274,0.2167801],"study_design_scores_gemma":[0.00007343444,0.0006573177,0.0009287224,0.000332146,0.0000077589,0.0000623942,0.00103088,0.7187415,0.1128784,0.1606546,0.003938443,0.0006942884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03399796,0.000005680637,0.9418373,0.0004650695,0.001830172,0.0003836131,0.000001510132,0.000220199,0.02125849],"genre_scores_gemma":[0.8711298,0.000003244487,0.1270784,0.0003532842,0.0004027521,0.00003783622,0.000004167495,0.00001895189,0.0009715863],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8371319,"threshold_uncertainty_score":0.9999652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W126088545","doi":"","title":"Iterated belief change: a transition system approach","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":24,"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":"Belief revision; Iterated function; Interpretation (philosophy); Computer science; Transition (genetics); Set (abstract data type); Operator (biology); Transition system; Artificial intelligence; Theoretical computer science; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1373754609918432,"gpt":0.3023690247565112,"spread":0.1649935637646681,"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.0004186502,0.0002868521,0.000258701,0.0003086086,0.0001748441,0.0005720417,0.001184152,0.0001321867,0.0001843928],"category_scores_gemma":[0.00006593342,0.0002607715,0.0001423255,0.0003676132,0.00009492396,0.0008323531,0.0001318336,0.0002976306,0.001578488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000247274,"about_ca_system_score_gemma":0.00009760571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006959348,"about_ca_topic_score_gemma":0.00004105181,"domain_scores_codex":[0.9975742,0.0001154047,0.0005995079,0.0007168883,0.0006091108,0.0003849273],"domain_scores_gemma":[0.998565,0.00005593513,0.0001842123,0.0004404765,0.000590744,0.0001636632],"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.00002575386,0.0002719972,0.000006366297,0.00001242889,0.00002244134,0.00001444473,0.002962433,0.0004549734,0.001138027,0.8207507,0.00009484949,0.1742456],"study_design_scores_gemma":[0.00007473996,0.0001586069,0.0001497391,0.0001728172,0.000007640177,0.00007117652,0.0004869203,0.9656603,0.0214293,0.009531489,0.001859002,0.000398212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004082895,0.0000450691,0.9188846,0.004769594,0.001288642,0.0003671288,0.00001496517,0.000452528,0.07009455],"genre_scores_gemma":[0.9870409,0.00002966138,0.01086278,0.0007687085,0.0008560142,0.0001236374,0.00003082463,0.00001416027,0.0002733569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.982958,"threshold_uncertainty_score":0.9999844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2464078358","doi":"","title":"Misrepresentation in district voting","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":24,"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":"Misrepresentation; Probabilistic logic; Voting; Representation (politics); Computer science; Accountability; Political science; Law; Artificial intelligence; Politics","retraction":null,"screen_n_in":null,"score":{"opus":0.1865305051284422,"gpt":0.3116819358125312,"spread":0.125151430684089,"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.0008510279,0.0001344959,0.0002210142,0.0003096523,0.00004134338,0.0001087203,0.0003320393,0.00007569629,0.002014295],"category_scores_gemma":[0.001039816,0.0001202265,0.00008104258,0.0001639581,0.00005373391,0.0002259517,0.00004867113,0.0001271653,0.004469774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002520532,"about_ca_system_score_gemma":0.00001667336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002211153,"about_ca_topic_score_gemma":0.00008587714,"domain_scores_codex":[0.9983143,0.00004207551,0.0008643875,0.0004272041,0.0001015308,0.000250558],"domain_scores_gemma":[0.9990827,0.0002107112,0.0003753851,0.0001853905,0.00008776997,0.00005808813],"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.00003741926,0.00008212128,0.01737784,0.000003599415,0.00001359506,0.000007533857,0.0001747002,0.0000963085,0.001608491,0.9546257,0.00005555581,0.02591717],"study_design_scores_gemma":[0.0002034898,0.0001313705,0.02122621,0.0004537292,0.000002591526,0.000009644879,0.0004035727,0.01911827,0.03340625,0.9210768,0.003396297,0.0005717242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6132745,0.00004237138,0.2360239,0.0152724,0.003805357,0.0003734062,0.0001476465,0.000126542,0.1309339],"genre_scores_gemma":[0.9970641,0.00002507589,0.0001101221,0.0001247348,0.0001887181,0.00002475445,0.000004516953,0.00001150812,0.002446543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3837896,"threshold_uncertainty_score":0.998898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W96574868","doi":"","title":"Inferring complex agent motions from partial trajectory observations","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Trajectory; Path (computing); Inference; Heuristic; Graph; Artificial intelligence; Motion planning; Markov chain; Motion (physics); Machine learning; Algorithm; Theoretical computer science; Robot","retraction":null,"screen_n_in":null,"score":{"opus":0.3282678335686683,"gpt":0.355972819707533,"spread":0.02770498613886468,"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.0005947829,0.0003063954,0.0002565315,0.0003157712,0.0002762859,0.000537892,0.001479938,0.0001333802,0.0006414275],"category_scores_gemma":[0.000251795,0.0003187932,0.0001623256,0.0003775025,0.0001584446,0.0005946023,0.0002584084,0.000445634,0.0008204702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000188669,"about_ca_system_score_gemma":0.0001802329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006293643,"about_ca_topic_score_gemma":0.000535504,"domain_scores_codex":[0.9969272,0.00007917627,0.0009499506,0.0007628169,0.0007782963,0.0005025409],"domain_scores_gemma":[0.9980822,0.0002138349,0.0002436066,0.0006295788,0.0005654215,0.0002653419],"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.00001812612,0.0002543797,0.0001768175,0.000002012487,0.00004000002,0.00002820062,0.0007511064,0.003185562,0.02586654,0.8511285,0.0001688219,0.11838],"study_design_scores_gemma":[0.0000783463,0.0001404906,0.01758396,0.0001364627,0.00001289421,0.000009799478,0.0003346763,0.745618,0.05028567,0.1837847,0.001404857,0.0006100753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04494323,0.00001234633,0.9411419,0.003451359,0.001943239,0.0001743285,0.00003971913,0.0003779168,0.007915975],"genre_scores_gemma":[0.9595144,0.00003123839,0.03874686,0.001070911,0.0004070908,0.00002454641,0.00005725236,0.00001599589,0.0001317253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9145712,"threshold_uncertainty_score":0.9999575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2270172784","doi":"","title":"Reasoning about continuous uncertainty in the situation calculus","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"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":"Formalism (music); Situation calculus; Computer science; Countable set; Action (physics); Theoretical computer science; Artificial intelligence; Calculus (dental); Algorithm; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06629843824728475,"gpt":0.3025074020353032,"spread":0.2362089637880185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007886696,0.0002435784,0.0002270737,0.0002253589,0.0001630994,0.0009426313,0.0018025,0.000103502,0.000517251],"category_scores_gemma":[0.000717354,0.0001778465,0.0001131441,0.0003973508,0.0001451225,0.0006205116,0.0001883787,0.0004029512,0.00190811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001534413,"about_ca_system_score_gemma":0.0001420795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001151494,"about_ca_topic_score_gemma":0.0005943179,"domain_scores_codex":[0.9975001,0.0002139234,0.0006275567,0.0005734948,0.0006732631,0.0004116697],"domain_scores_gemma":[0.9982712,0.0002845486,0.0002303829,0.0005159221,0.0006046307,0.00009334229],"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.00000892358,0.0001420687,0.0001355625,0.000002181813,0.000009647106,0.00001815196,0.00276624,0.0007965435,0.0008800155,0.823458,0.0003172996,0.1714654],"study_design_scores_gemma":[0.00007812178,0.0001623269,0.006314888,0.0001495685,0.000004263619,0.00003066135,0.001522846,0.7642715,0.004736994,0.2213933,0.0009671958,0.0003683133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09854816,0.00005937207,0.7759551,0.01365108,0.002221234,0.0008612659,0.000005870737,0.0002189254,0.108479],"genre_scores_gemma":[0.9966279,0.00003819594,0.001517905,0.001092154,0.0002189186,0.0001376501,0.00001132114,0.000008591591,0.0003473185],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8980798,"threshold_uncertainty_score":0.998869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W29265412","doi":"10.1111/1346-8138.14192","title":"Multiple agents moving target search","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Search problem; Search algorithm; Bidirectional search; State (computer science); Multi-agent system; Incremental heuristic search; Artificial intelligence; Mathematical optimization; Beam search; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1572151320510519,"gpt":0.3316735627996419,"spread":0.17445843074859,"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.0007961813,0.0002365723,0.0001917631,0.0002770596,0.0002339131,0.000535318,0.001181811,0.0000936172,0.0009262673],"category_scores_gemma":[0.0006523248,0.0002351887,0.0001054619,0.0002966617,0.0000841414,0.0004477195,0.000165586,0.0004086577,0.001347376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001141416,"about_ca_system_score_gemma":0.0002156883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001038357,"about_ca_topic_score_gemma":0.00001525335,"domain_scores_codex":[0.9974644,0.0001866226,0.0005230724,0.0006388255,0.0007316823,0.0004554001],"domain_scores_gemma":[0.9985418,0.0002765937,0.0001387236,0.0004686921,0.0003963352,0.0001778088],"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.00001898283,0.0001561809,0.001069519,0.000006593131,0.00003023166,0.00005773974,0.0009661611,0.01315841,0.00324608,0.9322715,0.0003728004,0.04864582],"study_design_scores_gemma":[0.00005797454,0.0001237908,0.0003319589,0.0001410225,0.000002563336,0.00002157694,0.0002633633,0.7646964,0.1300853,0.1000917,0.003789254,0.0003951067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01133231,0.00001923263,0.9521996,0.002473633,0.001613475,0.0001744309,0.00001245537,0.0001993754,0.03197549],"genre_scores_gemma":[0.9480729,0.00001408907,0.05055745,0.0006301357,0.00009241448,0.00001925209,0.0000120059,0.00001345745,0.0005883078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9367406,"threshold_uncertainty_score":0.999987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W175472853","doi":"","title":"Coalitional bargaining with agent type uncertainty","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":21,"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":"Negotiation; Heuristic; Mathematical economics; Bayesian probability; Computer science; Bayesian game; Mathematical optimization; Type (biology); Game theory; Rational agent; Bargaining problem; Economics; Artificial intelligence; Mathematics; Repeated game","retraction":null,"screen_n_in":null,"score":{"opus":0.1938340754753523,"gpt":0.3125534067218377,"spread":0.1187193312464854,"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.001445508,0.0001898404,0.0002590093,0.0002715909,0.0001185663,0.0001495672,0.0003485866,0.00008370542,0.002692282],"category_scores_gemma":[0.0002965348,0.0001882689,0.00007623143,0.0002109715,0.0001462683,0.0001497047,0.00004535259,0.0002432636,0.003037014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001708753,"about_ca_system_score_gemma":0.00004635803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001864854,"about_ca_topic_score_gemma":0.0001132486,"domain_scores_codex":[0.9982097,0.00002544228,0.0008149109,0.0004630373,0.0001603401,0.0003265312],"domain_scores_gemma":[0.9988822,0.0001415641,0.0003561652,0.0002367229,0.0002643745,0.0001189781],"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.0002151084,0.00010903,0.001041143,0.000004172495,0.00004895692,0.00002281055,0.0004052453,0.00126705,0.0004033322,0.9920643,0.00006037782,0.004358465],"study_design_scores_gemma":[0.0001507888,0.0005723448,0.00373505,0.0002626073,0.000006830157,0.00004733483,0.001831307,0.02937572,0.009320608,0.9442916,0.009701954,0.0007038332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1933271,0.00005635213,0.4154736,0.002062029,0.003321398,0.0003515179,0.0001340658,0.0001676662,0.3851063],"genre_scores_gemma":[0.9972762,0.00001254888,0.0007438844,0.0004908104,0.0003409546,0.000009470256,0.00004029849,0.0000184636,0.001067376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8039491,"threshold_uncertainty_score":0.9982194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W184141742","doi":"","title":"Adaptive error-correcting output codes","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Multiclass classification; Class (philosophy); Generalization; Subspace topology; Binary number; Set (abstract data type); External Data Representation; Pattern recognition (psychology); Support vector machine; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1593352712391407,"gpt":0.3339572235064923,"spread":0.1746219522673516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003706691,0.0002228414,0.0001878097,0.0002564203,0.0001784005,0.0007505384,0.001307847,0.0000809169,0.0007337134],"category_scores_gemma":[0.0005369282,0.0002059204,0.00008703041,0.0002488883,0.0001021337,0.0008314638,0.0002477299,0.0004005511,0.005193075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009953812,"about_ca_system_score_gemma":0.00009725622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006021186,"about_ca_topic_score_gemma":0.00006427063,"domain_scores_codex":[0.9978172,0.0001252579,0.0005363565,0.0006455019,0.0005663476,0.0003093184],"domain_scores_gemma":[0.9982592,0.0002041271,0.0002674364,0.0005338629,0.0005998994,0.000135446],"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.000007869997,0.00005651586,0.00008927961,0.00000147165,0.00001326764,0.000003466713,0.0003539828,0.0004203161,0.001356187,0.5057963,0.000358707,0.4915426],"study_design_scores_gemma":[0.00002790985,0.0001482627,0.002283907,0.00008114432,0.000003106529,0.00001860682,0.0006908451,0.8683043,0.01638203,0.1107862,0.0009578721,0.000315768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008267308,0.000008309931,0.9389206,0.01124099,0.001579306,0.0002373451,0.000008236283,0.0003008971,0.03943699],"genre_scores_gemma":[0.9825305,0.00001247935,0.01555653,0.0006387217,0.000192866,0.00006880655,0.00002223775,0.00001133476,0.000966557],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9742631,"threshold_uncertainty_score":0.9955815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571941834","doi":"","title":"Generalized dictionary for multitask learning with boosting","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"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":"Multi-task learning; Artificial intelligence; Computer science; Boosting (machine learning); Machine learning; Gradient boosting; Feature learning; Task (project management)","retraction":null,"screen_n_in":null,"score":{"opus":0.09497000881405422,"gpt":0.2954169608255133,"spread":0.2004469520114591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001017745,0.0001650163,0.0001370773,0.0001311719,0.00008556837,0.0000722499,0.000185462,0.00005603521,0.0001934104],"category_scores_gemma":[0.000130421,0.0001186227,0.00005985503,0.00006048206,0.00007287724,0.0001402567,0.00002654308,0.0001198019,0.00008723859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007865428,"about_ca_system_score_gemma":0.00002238414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002111948,"about_ca_topic_score_gemma":0.00002746223,"domain_scores_codex":[0.9990355,0.00001973845,0.0002823667,0.0002432237,0.0002160359,0.0002030949],"domain_scores_gemma":[0.9993133,0.0001474426,0.00006460074,0.0001335714,0.0002871639,0.00005390245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002253381,0.00006197648,0.0002109188,0.000007204769,0.000111162,0.00001784385,0.0001541791,0.02357852,0.3363366,0.2450409,0.0005855424,0.3936697],"study_design_scores_gemma":[0.0001065252,0.0002284003,0.0001392576,0.000470355,0.00001142619,0.0000171665,0.000118117,0.3152776,0.6440959,0.03521937,0.003956771,0.0003591313],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08366203,0.00001561551,0.9076875,0.001112006,0.0006756835,0.0002458238,0.00002210935,0.0007645452,0.005814649],"genre_scores_gemma":[0.9902973,0.00007009537,0.00895857,0.00008041173,0.0002267469,0.00006445299,0.00001078646,0.00002916377,0.0002624411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9066353,"threshold_uncertainty_score":0.4837292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W182621935","doi":"","title":"Flexible execution of partial order plans with temporal constraints","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"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":"Computer science; Plan (archaeology); Schedule; Executor; Generalization; Variety (cybernetics); State (computer science); Order (exchange); Distributed computing; Operations research; Artificial intelligence; Programming language; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08728091937032868,"gpt":0.2954974309334702,"spread":0.2082165115631415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002752514,0.0002022952,0.0002109226,0.000203372,0.0000959001,0.0002666625,0.0007606377,0.00008218486,0.001097936],"category_scores_gemma":[0.0001081234,0.0001703526,0.00005552685,0.0002767022,0.0002738651,0.0005109588,0.00009725077,0.0002417624,0.0005248281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004440732,"about_ca_system_score_gemma":0.000243748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004708932,"about_ca_topic_score_gemma":0.00003445747,"domain_scores_codex":[0.9980996,0.00006759869,0.0005482032,0.0004383689,0.000554663,0.0002916001],"domain_scores_gemma":[0.9984369,0.0001234268,0.000276761,0.0003365361,0.0007105995,0.0001157459],"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.00006589026,0.0001926039,0.001159595,0.00001161673,0.00005012444,0.00001837812,0.0007915349,0.004127157,0.005410474,0.8365106,0.000372357,0.1512897],"study_design_scores_gemma":[0.0001751905,0.0009289703,0.00148207,0.0006299018,0.0000124665,0.00007741628,0.0007275477,0.5555013,0.3330284,0.1059642,0.0007680613,0.0007044359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02431121,0.00000579394,0.9593503,0.003415458,0.0005431604,0.0002443727,0.00002196109,0.0001397309,0.01196804],"genre_scores_gemma":[0.9756579,0.000004758994,0.0237269,0.0002497293,0.00007825124,0.00003744218,0.00002369211,0.000008707246,0.0002126116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9513467,"threshold_uncertainty_score":0.9998152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W140552972","doi":"","title":"Solving 8x8 Hex.","year":2009,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1120449328600894,"gpt":0.3244736612575101,"spread":0.2124287283974208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004718254,0.0002152929,0.0002021537,0.0002914539,0.0002043554,0.0009595422,0.001375495,0.0000712437,0.0003835347],"category_scores_gemma":[0.0003427385,0.0002047121,0.0001017073,0.000254446,0.00006253551,0.001079856,0.0001515831,0.0002566803,0.001007871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008573746,"about_ca_system_score_gemma":0.0001254926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001023659,"about_ca_topic_score_gemma":0.000004279389,"domain_scores_codex":[0.9977958,0.00003429313,0.0007927435,0.0003972824,0.0006556665,0.0003242684],"domain_scores_gemma":[0.9985082,0.00008220717,0.0003403431,0.000418823,0.0005289621,0.0001215188],"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.000003891742,0.00007491131,0.000002796341,0.000004165401,0.000005660645,0.000004869295,0.001006059,0.0004155218,0.0009981247,0.7016649,0.0001962511,0.2956229],"study_design_scores_gemma":[0.00002169711,0.00007960296,0.00008654869,0.0001255327,0.000001534839,0.00001661976,0.0001564565,0.566572,0.03340126,0.3986919,0.000633744,0.0002130784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002468386,0.000009529139,0.8947545,0.006874005,0.001076262,0.000113345,0.000001609671,0.0002614293,0.09444091],"genre_scores_gemma":[0.9629761,0.0000175804,0.03402587,0.00242796,0.0002047881,0.000005356007,0.000004311522,0.000005965989,0.0003320828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9605077,"threshold_uncertainty_score":0.99977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W110110163","doi":"","title":"An action description language for iterated belief change","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":12,"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":"Ontic; Action (physics); Iterated function; Epistemology; Computer science; Semantics (computer science); Projection (relational algebra); Sequence (biology); Philosophy of language; Cognitive science; Mathematics; Algorithm; Philosophy; Programming language; Psychology; Metaphysics","retraction":null,"screen_n_in":null,"score":{"opus":0.2624631747405078,"gpt":0.3886631209659038,"spread":0.126199946225396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000756685,0.0002113724,0.0001680466,0.0003208972,0.0001681776,0.0005252429,0.0008562302,0.0001201912,0.0001652689],"category_scores_gemma":[0.0001936605,0.0001995192,0.00009984263,0.0002556848,0.00006650866,0.001094324,0.00007505472,0.0001897712,0.0003113833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001613611,"about_ca_system_score_gemma":0.00006410913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001407589,"about_ca_topic_score_gemma":0.0005579299,"domain_scores_codex":[0.9981574,0.00005347695,0.0004660571,0.000564086,0.0003862203,0.0003726952],"domain_scores_gemma":[0.9985123,0.000103361,0.0001966469,0.0003704494,0.0006601262,0.0001571243],"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.00007336311,0.0002265867,0.00005449661,0.000005064205,0.00001213454,0.00001204674,0.002490918,0.0000240486,0.03872909,0.5656414,0.00004966502,0.3926812],"study_design_scores_gemma":[0.0001478622,0.0009610161,0.003692504,0.0001373439,0.0000113005,0.00003283083,0.001589573,0.4818244,0.4045728,0.1038558,0.002519381,0.0006552726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05211361,0.00002033822,0.9383733,0.000952777,0.002637068,0.0003878862,0.00001347857,0.000253104,0.005248386],"genre_scores_gemma":[0.9896594,0.00002209805,0.008473966,0.000605459,0.0008058987,0.0000696447,0.00005419461,0.00001336937,0.000295934],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9375458,"threshold_uncertainty_score":0.8136157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W167512791","doi":"10.1519/jsc.0b013e31822600c9","title":"A Description Logic of Change.","year":2006,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Undecidable problem; Computer science; Description logic; Dynamic logic (digital electronics); Modal logic; Decidability; Satisfiability; Linear temporal logic; Temporal logic; Multimodal logic; EXPTIME; Boolean satisfiability problem; Modal; Theoretical computer science; Artificial intelligence; Algorithm; Computational complexity theory","retraction":null,"screen_n_in":null,"score":{"opus":0.3215270559872621,"gpt":0.339487671271858,"spread":0.01796061528459586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002268385,0.000145747,0.0001803872,0.000235693,0.00004993468,0.000161682,0.0008813097,0.0000685577,0.0001662922],"category_scores_gemma":[0.000112993,0.0001297374,0.00009084618,0.0002051,0.0001273494,0.0004277451,0.0001420641,0.0001173285,0.0002591747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004946618,"about_ca_system_score_gemma":0.00004771586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005617222,"about_ca_topic_score_gemma":0.0001762841,"domain_scores_codex":[0.9984631,0.00004563199,0.0004935923,0.0003542723,0.000436081,0.0002073508],"domain_scores_gemma":[0.9989845,0.00006950988,0.0002112818,0.0003220951,0.0003756659,0.00003692647],"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.00001397647,0.000135576,0.0001621186,0.000003674853,0.000006840297,0.00001140541,0.0001451492,0.000102831,0.0095069,0.9149134,0.00008860391,0.07490952],"study_design_scores_gemma":[0.00003176397,0.0001593681,0.005707459,0.00008561482,0.000003637724,0.00001353306,0.0001534901,0.09880047,0.1269771,0.767556,0.000312412,0.0001991551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02727722,0.00003778347,0.9411064,0.006861861,0.001630615,0.0001872415,0.000006389261,0.0001539564,0.02273846],"genre_scores_gemma":[0.9881561,0.00002892131,0.01108922,0.0003426949,0.0001938162,0.00002629535,0.000005827016,0.00000470896,0.0001524066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9608789,"threshold_uncertainty_score":0.5290539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W15018536","doi":"10.1021/ic035133a","title":"Compiling control knowledge into preconditions for planning in the situation calculus","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"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":"Situation calculus; Computer science; Calculus (dental); Domain (mathematical analysis); Control (management); Action (physics); Plan (archaeology); Transformation (genetics); Domain knowledge; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1388539723988244,"gpt":0.3607942404534089,"spread":0.2219402680545845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130188,0.0001842188,0.0001770172,0.0002627145,0.0002872568,0.0004085778,0.0008670391,0.00007886625,0.00006455375],"category_scores_gemma":[0.0006647562,0.0001566198,0.00009284327,0.0002694157,0.00007095085,0.0003430216,0.0000339397,0.0003006695,0.0001288292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001075455,"about_ca_system_score_gemma":0.0001899006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004835557,"about_ca_topic_score_gemma":0.0001128557,"domain_scores_codex":[0.9981744,0.0002361176,0.0005536551,0.0004345515,0.0003069133,0.0002943068],"domain_scores_gemma":[0.9981292,0.001003099,0.0001760358,0.0002977414,0.0003339506,0.00005998374],"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.00002209378,0.0001437509,0.0001554738,0.000007944912,0.00001589164,0.000007229693,0.005330787,0.01991255,0.0009512255,0.9470363,0.000168168,0.02624861],"study_design_scores_gemma":[0.0001190942,0.0001419324,0.0002740055,0.0001847728,0.00000580754,0.00001190265,0.0008362976,0.7362582,0.007382358,0.2533167,0.001246732,0.0002221867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007698413,0.00004797758,0.9790526,0.003618504,0.0009327747,0.0004367145,0.0000143117,0.00007316376,0.008125515],"genre_scores_gemma":[0.9888145,0.00000389154,0.01019204,0.0006242846,0.0001049291,0.0001632186,0.00002539653,0.000008202656,0.00006356457],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9811161,"threshold_uncertainty_score":0.6386771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W23186342","doi":"10.1021/ac3032146","title":"Exchanging reputation information between communities: a payment-function approach","year":2009,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Payment; Function (biology); Honesty; Information exchange; Business; Computer science; Multi-agent system; Focus (optics); Internet privacy; Finance; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.3099019691943408,"gpt":0.4082486194065966,"spread":0.09834665021225586,"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.001858647,0.0002023567,0.000234382,0.0006727452,0.0003980884,0.0008282239,0.0008282698,0.0001065364,0.001325083],"category_scores_gemma":[0.0006865312,0.0001784512,0.0001332459,0.0006275989,0.0001383284,0.00146254,0.00007424294,0.0003168586,0.002163846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173549,"about_ca_system_score_gemma":0.00006677095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004432098,"about_ca_topic_score_gemma":0.000007969428,"domain_scores_codex":[0.9967493,0.0002112561,0.001197573,0.0003205329,0.001284079,0.0002372328],"domain_scores_gemma":[0.9974245,0.0003872836,0.0005727391,0.0005240071,0.0009800531,0.0001113726],"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.00005371843,0.00007873071,0.00004883939,8.816321e-7,0.00001162229,2.405897e-7,0.001528629,0.002565922,0.0002380804,0.567913,0.0002246826,0.4273356],"study_design_scores_gemma":[0.00005348863,0.0001999515,0.002416257,0.00003780572,0.00001241831,0.000006195659,0.01416713,0.08572444,0.00455056,0.8868051,0.0057697,0.0002569653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0245942,0.000003078773,0.9178706,0.005255137,0.0005481012,0.0003031603,0.0000422427,0.000137998,0.05124544],"genre_scores_gemma":[0.9964038,0.00001154288,0.001420767,0.001213685,0.0002814312,0.00004865642,0.0001980953,0.00000608197,0.0004159806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9718096,"threshold_uncertainty_score":0.9995878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563879233","doi":"","title":"Topological mapping through distributed, passive sensors","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Probabilistic logic; Computer science; Wireless sensor network; Navigability; Maximization; Topology (electrical circuits); Graph; occam; Network topology; Theoretical computer science; Distributed computing; Artificial intelligence; Mathematical optimization; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.1108811833227111,"gpt":0.3200244180757382,"spread":0.2091432347530271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005189175,0.0003289514,0.0002868585,0.0002294759,0.0002163963,0.000390512,0.001566977,0.0001945014,0.0004112197],"category_scores_gemma":[0.0002923081,0.0003033036,0.0001709117,0.0005515988,0.0002840435,0.0004251932,0.0003815994,0.0005138424,0.0006723877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002270235,"about_ca_system_score_gemma":0.00007118341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008687006,"about_ca_topic_score_gemma":0.00006299345,"domain_scores_codex":[0.9966368,0.00009428094,0.000866398,0.0008512671,0.0008795467,0.0006716942],"domain_scores_gemma":[0.9979684,0.0004064732,0.0003083389,0.0005682328,0.0005675438,0.0001810046],"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.00003102566,0.0001778518,0.00003887768,0.000001836397,0.00002651337,0.000185361,0.0004328415,0.02090987,0.001864248,0.8965023,0.0001413971,0.07968792],"study_design_scores_gemma":[0.0001109393,0.0002970589,0.001133795,0.0002346692,0.00000772268,0.0001220415,0.001604458,0.5788139,0.1844644,0.2217177,0.01046162,0.001031619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03323322,0.0000112506,0.9383684,0.006820427,0.002206816,0.0001661905,0.00001722353,0.0003052478,0.01887119],"genre_scores_gemma":[0.9655043,0.00004541803,0.03288814,0.0009056426,0.0004024094,0.00001188234,0.00003176211,0.00001401395,0.0001963568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9322711,"threshold_uncertainty_score":0.9999419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576517076","doi":"","title":"Strong-Cyclic Planning when Fairness is Not a Valid Assumption.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"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":"Computer science; Fairness measure; Max-min fairness; Mathematical optimization; Microeconomics; Economics; Mathematics; Computer network; Resource allocation","retraction":null,"screen_n_in":null,"score":{"opus":0.1960748712451184,"gpt":0.3507000163299686,"spread":0.1546251450848502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000460941,0.0003325161,0.0002920295,0.0003081018,0.0001858323,0.0005744196,0.001872118,0.0001395229,0.001684514],"category_scores_gemma":[0.0003823508,0.000246323,0.0001818631,0.0001796827,0.0001843097,0.000825423,0.0003974391,0.0002512761,0.004452211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002036669,"about_ca_system_score_gemma":0.0001786839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005552285,"about_ca_topic_score_gemma":0.00002390817,"domain_scores_codex":[0.9969723,0.0001103219,0.0006875374,0.000893199,0.0008357976,0.0005008517],"domain_scores_gemma":[0.9980238,0.0002820677,0.0003014041,0.0005990412,0.00058871,0.0002049398],"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.00004059616,0.0001539102,0.0002661195,0.000004242407,0.00004043286,0.00003416713,0.001426058,0.00004658114,0.01027347,0.8178059,0.0007130391,0.1691955],"study_design_scores_gemma":[0.0002367241,0.000453958,0.002076067,0.0007283276,0.00001789895,0.00007584866,0.0003658098,0.08992092,0.3625507,0.5334772,0.008943805,0.001152748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01186746,0.00002026995,0.9413316,0.01028244,0.002312581,0.0001956835,0.00003103869,0.0002751279,0.03368377],"genre_scores_gemma":[0.9927718,0.00003555643,0.003517063,0.0008160683,0.0004068463,0.0000469432,0.000005850211,0.00001740642,0.002382442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9809043,"threshold_uncertainty_score":0.9999989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2579792020","doi":"","title":"Dynamic task allocation algorithm for hiring workers that learn","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","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 Waterloo","funders":"","keywords":"Crowdsourcing; Computer science; Task (project management); Automation; Competence (human resources); Machine learning; Work (physics); Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07856348913146355,"gpt":0.3072318620184597,"spread":0.2286683728869962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233234,0.0002371464,0.0001956885,0.0002470421,0.0001859086,0.0004412157,0.0009441689,0.00009707779,0.00008877722],"category_scores_gemma":[0.0002268887,0.0001896016,0.0001415479,0.0001654563,0.000132223,0.000498421,0.0001554499,0.0001503463,0.0003887525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002219115,"about_ca_system_score_gemma":0.0001252892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004160947,"about_ca_topic_score_gemma":0.00004431499,"domain_scores_codex":[0.9978719,0.0000615186,0.0004636129,0.0007064067,0.0005043359,0.0003922489],"domain_scores_gemma":[0.9984304,0.0002850321,0.0002268174,0.0004876611,0.0004476833,0.00012237],"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.00001563529,0.00005251647,0.00002345699,0.000002831887,0.00002300699,0.000005252201,0.0001854495,0.0003063162,0.0176252,0.1217892,0.00009395248,0.8598772],"study_design_scores_gemma":[0.00008994166,0.0001380393,0.0002280831,0.0003865196,0.000006651032,0.00001492425,0.0002749266,0.8138487,0.1056624,0.07710005,0.00185279,0.0003970115],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005805142,0.00001175967,0.9812655,0.009010093,0.00188356,0.00026866,0.00001394272,0.0002235516,0.00151778],"genre_scores_gemma":[0.9445249,0.00003219656,0.05375579,0.0002770568,0.0001320695,0.00006390147,0.000007741779,0.00001886991,0.001187501],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9387197,"threshold_uncertainty_score":0.7731727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2575405755","doi":"","title":"The complexity of learning acyclic CP-nets","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","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 Regina","funders":"","keywords":"Computer science; Dimension (graph theory); Concept class; Theoretical computer science; Tree (set theory); Computational complexity theory; Core (optical fiber); Mistake; Upper and lower bounds; VC dimension; Artificial intelligence; Algorithm; Mathematics; Machine learning; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.1408938287173567,"gpt":0.3353116497484666,"spread":0.1944178210311099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033003,0.0001637718,0.0001682253,0.0001184816,0.0002425698,0.0002228399,0.001512412,0.00004883449,0.0002388528],"category_scores_gemma":[0.0007580284,0.00009600614,0.0001087684,0.0001767264,0.0005268257,0.0002302642,0.0002926045,0.0002759081,0.00048218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005072318,"about_ca_system_score_gemma":0.00007922391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007901213,"about_ca_topic_score_gemma":0.00004068375,"domain_scores_codex":[0.9980291,0.0001727571,0.0005340531,0.0003908071,0.0005953471,0.0002780102],"domain_scores_gemma":[0.9983842,0.0004281458,0.0003032383,0.0004144429,0.0003863687,0.00008360271],"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.00001258953,0.00003496039,0.00008280458,9.649914e-7,0.0000122045,0.000002763395,0.0001213917,0.0001289332,0.005614086,0.6068393,0.00004099325,0.387109],"study_design_scores_gemma":[0.00007748022,0.0003164956,0.001940057,0.000223381,0.000003729997,0.00001769694,0.0001845871,0.2675444,0.1258022,0.5935677,0.009984616,0.0003375039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01015696,0.00001563243,0.9353281,0.03910778,0.001457464,0.0001163851,0.000005472608,0.0001447194,0.01366752],"genre_scores_gemma":[0.9952258,0.00008020768,0.00329326,0.0001291385,0.0001290022,0.00001138426,0.000001551844,0.000007742869,0.001121851],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9850689,"threshold_uncertainty_score":0.6197609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W17380902","doi":"","title":"Symmetric component caching","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","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 Toronto","funders":"","keywords":"Decomposition; Overhead (engineering); Homogeneous space; Pruning; Computer science; Constraint (computer-aided design); Mathematical optimization; Component (thermodynamics); Decomposition method (queueing theory); Space (punctuation); Mathematics; Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09724514953681351,"gpt":0.3221370999008255,"spread":0.2248919503640119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007335767,0.0001879124,0.0001559648,0.0006567199,0.0001568162,0.0003800704,0.0007812475,0.00007664354,0.0005156772],"category_scores_gemma":[0.000255489,0.0001885623,0.00009739081,0.0005099197,0.00008387331,0.0004527954,0.0001546036,0.0002878304,0.0007516315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001784996,"about_ca_system_score_gemma":0.00008337457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007843808,"about_ca_topic_score_gemma":0.00008355697,"domain_scores_codex":[0.9978946,0.00004812625,0.0006198316,0.0004735661,0.0006501209,0.0003137705],"domain_scores_gemma":[0.9987277,0.0001891789,0.0002006198,0.0003396821,0.0003854008,0.0001573967],"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.00001140283,0.00006435179,0.00007880651,0.000001083212,0.00001000939,0.00001722144,0.0001312697,0.00124245,0.001841093,0.612491,0.00002632641,0.384085],"study_design_scores_gemma":[0.0001036349,0.0001848793,0.009950401,0.0001168393,0.000007142543,0.00008290058,0.0004342569,0.7706945,0.1011821,0.1142843,0.002261775,0.000697242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006664277,0.000006351758,0.9398107,0.004210592,0.002200481,0.0001478989,0.000003923299,0.0002163035,0.04673947],"genre_scores_gemma":[0.9801382,0.00002535988,0.01876114,0.0007552139,0.0001510631,0.000006002117,0.000009367692,0.000008479404,0.0001452114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9734739,"threshold_uncertainty_score":0.9660953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2252001768","doi":"","title":"Decidable reasoning in a logic of limited belief with introspection and unknown individuals","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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":"Decidability; Introspection; Semantics (computer science); Computer science; Identity (music); Artificial intelligence; Epistemology; Theoretical computer science; Programming language; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.0531541692446631,"gpt":0.2781331706778161,"spread":0.224979001433153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628388,0.0002057039,0.0002689308,0.000385582,0.00007370803,0.0003382809,0.0006207709,0.00009262386,0.0002602103],"category_scores_gemma":[0.0003649138,0.0001667053,0.00004302531,0.0004516721,0.0001758117,0.0006013363,0.0002113626,0.0002539434,0.0001431117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007505698,"about_ca_system_score_gemma":0.000109528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004090408,"about_ca_topic_score_gemma":0.0004075158,"domain_scores_codex":[0.9981627,0.0000763924,0.0005332453,0.0005196966,0.0004214258,0.0002865585],"domain_scores_gemma":[0.9986268,0.0001584117,0.0002649706,0.0002859978,0.000562539,0.0001013288],"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.00002103102,0.0002073664,0.004141186,0.000006360149,0.00002036753,0.000007762031,0.0009901955,0.0002881999,0.002512082,0.9411039,0.00002786249,0.05067367],"study_design_scores_gemma":[0.0002793878,0.001170341,0.05613522,0.0006869311,0.00001148307,0.00007063467,0.00071687,0.3506262,0.07656531,0.5127571,0.0003082844,0.0006722673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4418403,0.00006891389,0.5230374,0.002754438,0.0005980802,0.0006118528,0.000004737911,0.0001390527,0.0309453],"genre_scores_gemma":[0.9860967,0.00006940783,0.01336373,0.0001701025,0.00006014498,0.00006228705,0.000004250152,0.000008249987,0.0001650637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5442565,"threshold_uncertainty_score":0.6798047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W301099071","doi":"","title":"Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"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":"Heuristics; Clique problem; Satisfiability; Monotone polygon; Clique; Computer science; Time complexity; Random graph; Local search (optimization); Mathematics; Boolean satisfiability problem; Graph; Theoretical computer science; Mathematical optimization; Algorithm; Combinatorics; Line graph; Pathwidth","retraction":null,"screen_n_in":null,"score":{"opus":0.09141986618334437,"gpt":0.3564744036721659,"spread":0.2650545374888216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004524473,0.0001335135,0.0001658196,0.0003444695,0.00007589818,0.0001223886,0.0003482124,0.00005305394,0.000110119],"category_scores_gemma":[0.0001800033,0.0001316873,0.00004445102,0.0003543435,0.0001161514,0.0002972113,0.00008740664,0.0001884884,0.00002431033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001025665,"about_ca_system_score_gemma":0.0001295617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005104057,"about_ca_topic_score_gemma":0.0004118757,"domain_scores_codex":[0.9985495,0.00008789967,0.000628841,0.0003836068,0.0001764154,0.0001737319],"domain_scores_gemma":[0.9989244,0.0001776467,0.0001045488,0.0002518389,0.0004371607,0.0001044157],"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.00001551215,0.0002597558,0.0001546583,0.000004507134,0.000004814066,4.216086e-7,0.001909207,0.005792379,0.009029129,0.5308443,0.000005023321,0.4519804],"study_design_scores_gemma":[0.0001751306,0.0002577206,0.003891988,0.0001297086,0.000002532878,0.00001412495,0.0005673896,0.8173297,0.06507365,0.1122025,0.0001116389,0.000243895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07368656,0.000003109246,0.9024662,0.01981597,0.00009042734,0.00034337,0.00004861418,0.00004312941,0.003502589],"genre_scores_gemma":[0.9451873,0.00001760295,0.05443461,0.0002599064,0.00003348131,0.00004064585,0.000008315342,0.000005110941,0.00001298467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8715008,"threshold_uncertainty_score":0.5370054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1581425933","doi":"","title":"A general framework for scheduling in a stochastic environment","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"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":"Computer science; Scheduling (production processes); Schedule; Machine learning; Theoretical computer science; Artificial intelligence; Distributed computing; Industrial engineering; Mathematical optimization; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0940925670022517,"gpt":0.3325678346717465,"spread":0.2384752676694948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625916,0.0001613518,0.0001457381,0.000357113,0.00007649515,0.0001939903,0.000487301,0.00009545689,0.0002806712],"category_scores_gemma":[0.0003461442,0.0001715228,0.0000791467,0.0001811755,0.00007086791,0.0002533765,0.00008730528,0.0002309298,0.0001557997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001909702,"about_ca_system_score_gemma":0.00007811026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002284707,"about_ca_topic_score_gemma":0.00006013638,"domain_scores_codex":[0.9982842,0.00002536325,0.0005606688,0.0004592153,0.000368635,0.0003018806],"domain_scores_gemma":[0.9991118,0.0002600573,0.0001512169,0.0002449357,0.0001340456,0.00009789449],"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.00003548926,0.00007399776,0.00004236246,0.000001285632,0.000006687847,0.000005364526,0.0002653854,0.07786922,0.0008597723,0.7386476,0.000002216895,0.1821906],"study_design_scores_gemma":[0.00004563616,0.00006600063,0.0006477971,0.00006584631,0.000001564681,0.000005758532,0.0001398507,0.7151018,0.00712853,0.2765596,0.0000680414,0.0001696016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009489438,0.000005478242,0.9848375,0.003272171,0.001042615,0.0003133658,0.000005793996,0.00007010499,0.0009635849],"genre_scores_gemma":[0.7426237,0.000009679706,0.256803,0.000354731,0.0001247292,0.00003170874,0.000005654241,0.000006798395,0.00003999459],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7331343,"threshold_uncertainty_score":0.6994498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576239431","doi":"","title":"Action selection for hammer shots in curling","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":9,"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":"Delaunay triangulation; Curling; Hammer; Computer science; Action (physics); Selection (genetic algorithm); Artificial intelligence; State space; Triangulation; Computer vision; Mathematical optimization; Algorithm; Mathematics; Engineering; Geometry; Statistics; Structural engineering; Mechanical engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1744397893897128,"gpt":0.359484580898046,"spread":0.1850447915083333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003361085,0.0001951641,0.0001729439,0.0003635285,0.00009368579,0.0002907247,0.0007606802,0.00009713192,0.0002415912],"category_scores_gemma":[0.0002905425,0.0001509366,0.0000858426,0.0003079616,0.00006359111,0.0008362359,0.00008793987,0.000148444,0.0002690715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001866038,"about_ca_system_score_gemma":0.0001592043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006450654,"about_ca_topic_score_gemma":0.0003666283,"domain_scores_codex":[0.9981022,0.00003920148,0.0005392948,0.0006114038,0.0003634041,0.0003444385],"domain_scores_gemma":[0.9988975,0.0001703138,0.0001871145,0.0002328288,0.000427153,0.00008508457],"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.000036578,0.00007683483,0.0001406096,0.000005127222,0.000006450133,0.000001892797,0.0001079247,0.00008195061,0.01785287,0.5899582,0.00004730385,0.3916843],"study_design_scores_gemma":[0.000110842,0.0002277107,0.0008452256,0.0003260554,0.000002974579,0.00001482402,0.00009111226,0.2148276,0.2495158,0.5321574,0.001515343,0.0003650164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008219464,0.000004566833,0.9761778,0.01126165,0.001348821,0.0002426748,0.000007795823,0.000110592,0.002626624],"genre_scores_gemma":[0.9871933,0.00005469407,0.01181157,0.0003018421,0.0001945051,0.00010081,0.000002667587,0.00001073542,0.0003298927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9789738,"threshold_uncertainty_score":0.6155018,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2578463151","doi":"","title":"Linear arithmetic satisfiability via strategy improvement","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"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":"Satisfiability modulo theories; Quantifier elimination; Satisfiability; Fragment (logic); Computer science; Modulo; Intuition; Automated theorem proving; Computability; Algorithm; Theoretical computer science; Arithmetic; Mathematics; Programming language; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1021667144782425,"gpt":0.3182398034035272,"spread":0.2160730889252847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006307961,0.000258229,0.0002396677,0.0001717423,0.0001092966,0.0003124965,0.001243569,0.0001037209,0.0005896741],"category_scores_gemma":[0.0002306473,0.0001776919,0.0001322955,0.0001943644,0.0001841989,0.0004397621,0.000252013,0.0001772976,0.001749879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001813614,"about_ca_system_score_gemma":0.0001588458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000246456,"about_ca_topic_score_gemma":0.0001295546,"domain_scores_codex":[0.9973003,0.00009822718,0.0007408585,0.0007580452,0.0007025578,0.0004000176],"domain_scores_gemma":[0.9982219,0.0001515531,0.0002516996,0.0006525606,0.0005554853,0.0001668104],"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.00001019125,0.0001093784,0.00006151907,0.000003362374,0.00001585508,0.000009334544,0.00007308326,0.00002654089,0.01042437,0.5365375,0.00002135169,0.4527076],"study_design_scores_gemma":[0.00007651656,0.0006031779,0.0004876331,0.00003155822,0.000004688463,0.00001558626,0.00007340407,0.0576358,0.131068,0.8081581,0.001461979,0.0003835682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004526088,0.000008723468,0.9798967,0.004453306,0.001927679,0.0003284926,0.000005867803,0.0002031753,0.008649922],"genre_scores_gemma":[0.9959137,0.00002189213,0.002868606,0.0002580814,0.000275826,0.00006078008,0.000003402328,0.00001092839,0.0005868165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9913876,"threshold_uncertainty_score":0.9990274,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1540266240","doi":"","title":"Accelerated robust point cloud registration in natural environments through positive and unlabeled learning","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Robustness (evolution); Computer science; Artificial intelligence; Point cloud; Pairwise comparison; Computer vision; Image registration; Robot; Machine learning; Mobile robot; Pattern recognition (psychology); Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.06487840364842372,"gpt":0.2634298915574278,"spread":0.1985514879090041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001071373,0.0001843585,0.0001547463,0.0001215657,0.0000605255,0.0002227702,0.0001183042,0.00008628823,0.000367841],"category_scores_gemma":[0.0001001355,0.0001889302,0.0000308178,0.0001253536,0.00007524397,0.0003793686,0.0000284291,0.0003353619,0.0001933331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001492937,"about_ca_system_score_gemma":0.00001579323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002747201,"about_ca_topic_score_gemma":0.00009330165,"domain_scores_codex":[0.9987523,0.00005452276,0.0004522806,0.0002761026,0.0002604287,0.0002043402],"domain_scores_gemma":[0.9996003,0.00006119171,0.00007951282,0.0001016379,0.0001068271,0.00005051937],"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.00004395055,0.0001028268,0.0003218387,0.00001078594,0.00004337442,0.0000170133,0.0009585816,0.786855,0.06503657,0.1156938,0.00009060483,0.03082553],"study_design_scores_gemma":[0.00006376513,0.00006472955,0.002732671,0.00009889352,0.000003598414,0.000004647676,0.0004291545,0.9281756,0.0580483,0.01010454,0.00005955399,0.0002144838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6230611,0.00004486731,0.3660317,0.001795723,0.0010695,0.0004790842,0.000007630904,0.0001256016,0.007384729],"genre_scores_gemma":[0.9984008,0.0001899291,0.0009079605,0.0001305891,0.00008501091,0.00002195503,0.00007865496,0.00001902355,0.0001660924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3753396,"threshold_uncertainty_score":0.770435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W186506571","doi":"","title":"Using core beliefs for point-based value iteration","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Simplex; Computer science; Mathematical optimization; Partially observable Markov decision process; Set (abstract data type); Heuristic; Core (optical fiber); Simplex algorithm; Bellman equation; Point (geometry); Value (mathematics); Function (biology); Algorithm; Artificial intelligence; Mathematics; Linear programming; Machine learning; Markov chain; Combinatorics; Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.29352949057106,"gpt":0.3825340826528269,"spread":0.08900459208176686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004334475,0.0002402967,0.0002023096,0.0003433076,0.0002542258,0.0005450162,0.001103836,0.00008889975,0.0002330649],"category_scores_gemma":[0.0002080259,0.0002467603,0.0001835336,0.0002418654,0.0001239449,0.0006444494,0.0001322455,0.0002097815,0.0001701384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000171587,"about_ca_system_score_gemma":0.0001873816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004442518,"about_ca_topic_score_gemma":0.00005793877,"domain_scores_codex":[0.997847,0.00004663568,0.000623484,0.0006063021,0.0005437071,0.0003328382],"domain_scores_gemma":[0.9984443,0.000209261,0.0002191127,0.0004474477,0.0005660261,0.0001139143],"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.00002933751,0.0001686477,0.000007026274,0.000004739683,0.00001428294,0.000003132307,0.0002135752,0.01905247,0.006039739,0.8221349,0.00008277533,0.1522494],"study_design_scores_gemma":[0.00005692265,0.0001161175,0.00002614039,0.00008345601,0.000003619523,0.000007271732,0.00003203328,0.7385575,0.06264061,0.1968682,0.001391747,0.0002162995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004009743,0.00001109305,0.9829428,0.009032901,0.001452843,0.0003493046,0.0000370921,0.0001622168,0.002002032],"genre_scores_gemma":[0.7434235,0.000005268105,0.2542687,0.001639721,0.0004985285,0.00003994625,0.0000246482,0.00001210507,0.00008761346],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7394137,"threshold_uncertainty_score":0.9999985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W46433006","doi":"","title":"Learning algorithms for software agents in uncertain and untrusted market environments","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Blockchain Technology Applications and Security","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":"University of Waterloo","funders":"","keywords":"Computer science; Reputation; Reinforcement learning; Order (exchange); Software; Software agent; Multi-agent system; Intelligent agent; Algorithm; Artificial intelligence; Computer security; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.08983223663751178,"gpt":0.3175322691727702,"spread":0.2277000325352584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004886672,0.0001635988,0.0001591671,0.0002343415,0.0001291922,0.0001273166,0.0005469237,0.0001218158,0.0001607215],"category_scores_gemma":[0.0004474537,0.0001708828,0.00004280548,0.0001961451,0.0001251941,0.000151076,0.0001181967,0.0002755103,0.00004201548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000093346,"about_ca_system_score_gemma":0.00004762092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003062437,"about_ca_topic_score_gemma":0.00002835909,"domain_scores_codex":[0.9984953,0.00008220808,0.0003890693,0.0005395536,0.0002340353,0.0002597818],"domain_scores_gemma":[0.9992922,0.0001713784,0.0001280406,0.0002634692,0.00007807666,0.00006683142],"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.00001352578,0.0001414873,0.0004975838,0.000003858934,0.00001324725,0.000007127475,0.0002498701,0.0003952082,0.0003076946,0.7612489,0.00005251335,0.237069],"study_design_scores_gemma":[0.0001218188,0.0001631516,0.00142149,0.00005478364,0.000003302866,0.00001435584,0.00031089,0.5562444,0.01565791,0.4183436,0.007370804,0.0002934571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01702194,0.0000182055,0.9782532,0.002192933,0.0003112528,0.0003820306,0.000009433771,0.00008728346,0.001723688],"genre_scores_gemma":[0.9497398,0.00008602735,0.04936585,0.0002385707,0.00002004215,0.0001600844,0.000007647145,0.000008696637,0.0003732867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9327179,"threshold_uncertainty_score":0.6968397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W11533555","doi":"","title":"Towards cooperative negotiation for decentralized resource allocation in autonomic computing systems","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Software Engineering Methodologies","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":"University of Toronto","funders":"","keywords":"Autonomic computing; Negotiation; Computer science; Resource allocation; Distributed computing; Resource management (computing); Resource (disambiguation); Computer network; Cloud computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.157422937616512,"gpt":0.3588051013070076,"spread":0.2013821636904956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050503,0.0002156556,0.0002605699,0.0002807023,0.0000912162,0.0003105976,0.000668915,0.00009296207,0.00001654085],"category_scores_gemma":[0.00271563,0.0002241653,0.00006670748,0.0002811621,0.00005972145,0.0003969006,0.00007301471,0.0002070533,0.00003922152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004295153,"about_ca_system_score_gemma":0.0001978059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004123968,"about_ca_topic_score_gemma":0.00001963581,"domain_scores_codex":[0.9978895,0.0002555943,0.000683644,0.0005486586,0.0002961899,0.0003264096],"domain_scores_gemma":[0.9983412,0.0006579849,0.0002236114,0.0003055664,0.0004032156,0.0000684133],"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.00001658224,0.00003825071,0.00001112282,0.000004538639,0.000008844029,0.000001836704,0.0004836013,0.3738867,0.001564683,0.59539,0.00001295851,0.02858095],"study_design_scores_gemma":[0.00011048,0.0001070171,0.0002134223,0.0001330479,0.000002667818,0.000007872239,0.0004226717,0.857897,0.05363101,0.08617955,0.0009978438,0.0002974472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004775814,0.00003471478,0.9904801,0.001225729,0.001756012,0.0005173098,0.000006408807,0.0002145951,0.0009892768],"genre_scores_gemma":[0.8236631,0.00002117652,0.1759988,0.0001247676,0.0000537862,0.00006630037,0.0000130441,0.00001256606,0.00004643037],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8188873,"threshold_uncertainty_score":0.9141196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966910741","doi":"","title":"Semi-supervised learning of visual classifiers from web images and text","year":2009,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Generative model; Machine learning; Probabilistic logic; Object (grammar); Image (mathematics); Visualization; Generative grammar; Supervised learning; Information retrieval; Pattern recognition (psychology); Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.06446601243891999,"gpt":0.3204279420706577,"spread":0.2559619296317377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590884,0.0001917267,0.0002276398,0.0002309037,0.00009295392,0.0002854072,0.0007014677,0.00009369421,0.0002277459],"category_scores_gemma":[0.0002693249,0.0001799384,0.00008272263,0.0002431252,0.00017583,0.0004478411,0.0001198532,0.0002976453,0.00009034667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005000105,"about_ca_system_score_gemma":0.000106039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004555601,"about_ca_topic_score_gemma":0.000003249179,"domain_scores_codex":[0.9981703,0.00008751093,0.0005490849,0.0004911895,0.0004999442,0.0002019697],"domain_scores_gemma":[0.9988271,0.0001472681,0.0002387616,0.0002497518,0.0004360947,0.0001010245],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003047311,0.0001182533,0.00006762072,0.000002194191,0.00001237936,0.000005529594,0.0002394821,0.00001305419,0.2487582,0.2779401,0.00004230572,0.4727704],"study_design_scores_gemma":[0.00004090919,0.000299474,0.001480957,0.0000929468,0.000004449922,0.000003895234,0.0002734439,0.3041332,0.6199489,0.07312359,0.000393384,0.0002049301],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03106266,0.00004522732,0.9514324,0.00687243,0.0003106903,0.0001555048,0.00001421138,0.0002325782,0.00987427],"genre_scores_gemma":[0.9912582,0.0002502516,0.007809529,0.0003482207,0.000078407,0.000007231024,0.00001067659,0.000006540463,0.0002309318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9601955,"threshold_uncertainty_score":0.7337674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}