{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":116,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":116,"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":"7b44eacfed5d","filters":{"venue":"Journal of Artificial Intelligence Research"}},"results":[{"id":"W1662133657","doi":"10.1613/jair.2934","title":"From Frequency to Meaning: Vector Space Models of Semantics","year":2010,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":2883,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Semantics (computer science); Meaning (existential); Computer science; Context (archaeology); Space (punctuation); Perspective (graphical); Artificial intelligence; Programming language; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.2081680926678031,"gpt":0.4142808458992752,"spread":0.2061127532314721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003213811,0.0001176282,0.0002966262,0.0005455058,0.000113519,0.0002029921,0.002119904,0.0001140216,0.00007000169],"category_scores_gemma":[0.001232785,0.0001025442,0.0001204978,0.0008725387,0.0001227681,0.0006347563,0.000373881,0.001159121,0.00005990903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006027037,"about_ca_system_score_gemma":0.0004517125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005379259,"about_ca_topic_score_gemma":0.0001955649,"domain_scores_codex":[0.9967297,0.0001750543,0.0008508869,0.0002872933,0.001499836,0.0004572186],"domain_scores_gemma":[0.9964998,0.0005914351,0.0002454885,0.0006953375,0.001644908,0.000322985],"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.00003205932,0.0001407617,0.00008810333,0.00001268341,0.00002690838,0.00005958229,0.007730806,0.01119216,0.3854487,0.5441409,0.0001437419,0.05098359],"study_design_scores_gemma":[0.00001660492,0.000209433,0.00001778377,0.00006690537,0.000003495115,0.0000142826,0.0006188275,0.2786266,0.2547538,0.4654956,0.00008375358,0.00009292806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2848188,0.00004541676,0.7103081,0.003408977,0.0007623553,0.00009915532,0.000001380825,0.0000105386,0.0005452791],"genre_scores_gemma":[0.7964733,0.00001941509,0.2028827,0.00002013514,0.0005668564,0.000001277343,1.096644e-7,0.000009334332,0.00002687202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5116545,"threshold_uncertainty_score":0.5035867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150468603","doi":"10.1613/jair.3912","title":"The Arcade Learning Environment: An Evaluation Platform for General Agents","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1060,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Alberta Innovates; University of Alberta; Compute Canada","keywords":"Testbed; Benchmarking; Reinforcement learning; Benchmark (surveying); Imitation; Interface (matter)","retraction":null,"screen_n_in":null,"score":{"opus":0.2902597031161736,"gpt":0.4427010381262976,"spread":0.152441335010124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01036481,0.0001147353,0.0001458313,0.0002628453,0.0009449112,0.001006914,0.001638236,0.00007871621,0.0001490016],"category_scores_gemma":[0.001593545,0.00007997811,0.0001105602,0.0003240265,0.0001897001,0.001343404,0.0002195739,0.0008387021,0.0002262879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002630366,"about_ca_system_score_gemma":0.0002240434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002925329,"about_ca_topic_score_gemma":0.000003393742,"domain_scores_codex":[0.9958612,0.0004719288,0.0007582436,0.0002182003,0.002075787,0.0006146715],"domain_scores_gemma":[0.9968795,0.0009411229,0.0003592677,0.0003876486,0.001224912,0.000207604],"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.00002452238,0.00003875276,0.00006165066,0.000004599262,0.0000231304,0.00000178245,0.001141798,0.5649804,0.002540559,0.01724453,0.0003115633,0.4136267],"study_design_scores_gemma":[0.00004503443,0.0008589922,0.0002236359,0.0000164548,0.00000575325,0.00001097539,0.0008975657,0.9479652,0.008820786,0.03571634,0.005351497,0.00008775616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0776395,0.0001141506,0.9195682,0.001294114,0.0004011518,0.0006331351,1.521434e-7,0.00001266543,0.0003369687],"genre_scores_gemma":[0.9676027,0.0003382145,0.03057141,0.00004015376,0.0006171849,0.00006022278,0.000001990808,0.00001903796,0.0007490409],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8899633,"threshold_uncertainty_score":0.9709696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156413587","doi":"10.1613/jair.4272","title":"Sentiment Analysis of Short Informal Texts","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":890,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; SemEval; Task (project management); Lexicon; Sentiment analysis; Phrase; Natural language processing; Artificial intelligence; Variety (cybernetics); Word (group theory); Term (time); Set (abstract data type); Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1410959079151924,"gpt":0.4268329994839138,"spread":0.2857370915687214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007217932,0.0001002626,0.0004378361,0.002302445,0.0001408703,0.0002238107,0.001237115,0.00005862428,0.0001864888],"category_scores_gemma":[0.0003521981,0.00008003078,0.0004284105,0.003872633,0.0001361259,0.0005576493,0.0002733444,0.0003571259,0.00004132438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004369549,"about_ca_system_score_gemma":0.0001221729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002320993,"about_ca_topic_score_gemma":0.0000190418,"domain_scores_codex":[0.9962405,0.0002850119,0.001177809,0.0001885505,0.001728562,0.0003795446],"domain_scores_gemma":[0.9972973,0.0004860308,0.0003172211,0.0004309442,0.001288486,0.0001800061],"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.00007221759,0.0004317302,0.01015969,0.00001894182,0.001648374,0.00001826176,0.002890509,0.02407097,0.01236056,0.0981238,0.0004640892,0.8497409],"study_design_scores_gemma":[0.000028817,0.0005277306,0.003912264,0.00004936266,0.0001811171,0.000007125131,0.000841019,0.8474557,0.1414292,0.003621453,0.001797931,0.0001483217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2589856,0.0001092665,0.7387027,0.0004522035,0.0002406387,0.00006350721,5.921028e-7,0.000007264086,0.001438261],"genre_scores_gemma":[0.9913398,0.00005721714,0.008332551,0.000023209,0.0001536995,9.575153e-7,8.630357e-7,0.000004074527,0.00008762798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8495925,"threshold_uncertainty_score":0.326356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114660707","doi":"10.1613/jair.1234","title":"CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements","year":2004,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":878,"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; University of Toronto","funders":"","keywords":"Ceteris paribus; Preference; Outcome (game theory); Inference; Representation (politics); Computer science; Semantics (computer science); Set (abstract data type); Interpretation (philosophy); Artificial intelligence; Mathematical economics; Mathematics; Statistics; Epistemology; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.2770353824879733,"gpt":0.4600891532587523,"spread":0.183053770770779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00383516,0.000136348,0.0002368212,0.0003229777,0.0004110535,0.0006594817,0.0008162134,0.00008096778,0.000016183],"category_scores_gemma":[0.001012791,0.000119692,0.00008193379,0.0004795539,0.0001931398,0.001226591,0.0002568187,0.0005548393,0.00001341486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001184675,"about_ca_system_score_gemma":0.0004810802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000961976,"about_ca_topic_score_gemma":0.00001934837,"domain_scores_codex":[0.9971665,0.0001630394,0.0007992837,0.000369658,0.0009361965,0.0005653402],"domain_scores_gemma":[0.9974142,0.0004207251,0.0002883056,0.0002925716,0.00138395,0.0002002564],"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.0004302403,0.000523226,0.001267426,0.0001377542,0.0001516398,0.0001371179,0.006293748,0.01198202,0.02884177,0.5174263,0.0005035965,0.4323052],"study_design_scores_gemma":[0.0002570117,0.001341221,0.0007150653,0.0007829584,0.00001469052,0.0002333909,0.001129893,0.09030212,0.07790895,0.8265997,0.0003459183,0.0003691426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2344209,0.000130313,0.7640154,0.001007369,0.0001554807,0.0001767745,0.000005172547,0.0000159536,0.00007263399],"genre_scores_gemma":[0.8903816,0.000138569,0.1092153,0.000045195,0.0001630957,0.00001788063,0.000001475407,0.000009336969,0.00002759485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6559607,"threshold_uncertainty_score":0.6359397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950680102","doi":"10.1613/jair.2861","title":"ParamILS: An Automatic Algorithm Configuration Framework","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":868,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Computer science; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1317989993784504,"gpt":0.4330978139636827,"spread":0.3012988145852324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002695411,0.00009384088,0.0001720099,0.0005103695,0.0002411882,0.0005595533,0.0006928926,0.0001056194,0.0002152002],"category_scores_gemma":[0.0006998332,0.00008234097,0.00007489429,0.0009714768,0.0001069186,0.001285788,0.00002859926,0.0006489058,0.00009577684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001029833,"about_ca_system_score_gemma":0.0003120291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000784536,"about_ca_topic_score_gemma":0.000004490466,"domain_scores_codex":[0.9974569,0.0003788173,0.0006755476,0.0001878976,0.0009853191,0.0003155388],"domain_scores_gemma":[0.9977697,0.0003622062,0.000220992,0.0003085313,0.001117304,0.0002212619],"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.000007233642,0.0001059511,0.000007197234,0.000001857213,0.000005413895,0.00002504357,0.0008360335,0.001653283,0.000834292,0.09942779,0.00006404477,0.8970318],"study_design_scores_gemma":[0.00001999192,0.0007433739,0.0005695195,0.00005883939,0.000002742384,0.00008036155,0.0006867655,0.7412845,0.01279114,0.2435119,0.0001535925,0.00009727454],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006466527,0.00005869308,0.9893742,0.003154361,0.0003754575,0.000127318,4.553011e-7,0.00004130184,0.0004016993],"genre_scores_gemma":[0.7044448,0.00009123165,0.2950411,0.0001321056,0.000266373,0.00000127201,6.720128e-7,0.000004098448,0.00001830815],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8969346,"threshold_uncertainty_score":0.5395786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147148915","doi":"10.1613/jair.2490","title":"SATzilla: Portfolio-based Algorithm Selection for SAT","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":835,"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; Solver; Portfolio; Scalability; Selection (genetic algorithm); Set (abstract data type); Class (philosophy); Local search (optimization); Algorithm; Mathematical optimization; Machine learning; Artificial intelligence; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1824121673170033,"gpt":0.4086704943385303,"spread":0.226258327021527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107196,0.00009273928,0.0001731313,0.0007339581,0.0004460012,0.0001387892,0.0004478974,0.00008174893,0.0001145639],"category_scores_gemma":[0.0004454133,0.00008375545,0.0001461786,0.001120889,0.0001616295,0.0004885521,0.00003974252,0.000380913,0.00004062097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001678748,"about_ca_system_score_gemma":0.0007917904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002171155,"about_ca_topic_score_gemma":0.00001997106,"domain_scores_codex":[0.99787,0.0001627529,0.0005922227,0.0001983073,0.0008249019,0.0003518579],"domain_scores_gemma":[0.9970078,0.0004441606,0.0002104016,0.0001628064,0.002004867,0.0001699238],"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.00005704911,0.0001124508,0.0003217427,0.000007023882,0.00001637975,0.00002348089,0.0002561768,0.005787748,0.001698268,0.007841962,0.001297471,0.9825802],"study_design_scores_gemma":[0.00008654765,0.0007041182,0.0003852873,0.00002777508,0.000004302574,0.0003106717,0.0001938001,0.9229377,0.0597044,0.01222745,0.003283295,0.0001346403],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004628446,0.00007739657,0.9930465,0.001348724,0.0004608664,0.0002047826,0.000001609992,0.0000272447,0.0002044173],"genre_scores_gemma":[0.5725212,0.0002015908,0.4265145,0.00009308095,0.0004951037,0.000009896355,0.000001671485,0.00001253184,0.0001505274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9824456,"threshold_uncertainty_score":0.3430326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144913588","doi":"10.1613/jair.2567","title":"Online Planning Algorithms for POMDPs","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":515,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; McGill University","funders":"National Institute of Mental Health; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Partially observable Markov decision process; Computer science; Heuristic; Markov decision process; Mathematical optimization; Upper and lower bounds; Reduction (mathematics); Observable; Focus (optics); Computational complexity theory; Action (physics); Artificial intelligence; Machine learning; Markov process; Markov chain; Algorithm; Markov model; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.4539481331437369,"gpt":0.4870388551056944,"spread":0.0330907219619575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161627,0.0001193069,0.0002483997,0.0006251191,0.0004626185,0.0001813799,0.001643503,0.00008752154,0.00001869915],"category_scores_gemma":[0.001290521,0.0001021837,0.0001577771,0.0008386896,0.0001733774,0.0006108243,0.0002307723,0.0008163073,0.00004755243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001424861,"about_ca_system_score_gemma":0.0005033809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008837411,"about_ca_topic_score_gemma":8.872053e-7,"domain_scores_codex":[0.9968257,0.000170885,0.000840912,0.0002181855,0.001341275,0.0006030769],"domain_scores_gemma":[0.9963918,0.001072907,0.0002897877,0.0003483959,0.001682321,0.0002148163],"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.000167487,0.0007302961,0.0004819494,0.00005890309,0.0001337133,0.0006344534,0.008394283,0.7665037,0.003862735,0.0436602,0.004426053,0.1709463],"study_design_scores_gemma":[0.000070068,0.001535399,0.0001669656,0.00009343179,0.000004972575,0.0003390118,0.0007726636,0.9612532,0.01868797,0.00971067,0.007198069,0.0001675333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01414195,0.0001975009,0.9834687,0.001156918,0.0005757028,0.00019062,9.831576e-7,0.00003347589,0.0002341798],"genre_scores_gemma":[0.5305747,0.0002793267,0.4673403,0.00009028836,0.001237464,0.000006051502,0.000001624137,0.00002336433,0.0004469132],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5164327,"threshold_uncertainty_score":0.4166929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110962519","doi":"10.1613/jair.2078","title":"Anytime Point-Based Approximations for Large POMDPs","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":374,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Selection (genetic algorithm); Set (abstract data type); Mathematical optimization; Artificial intelligence; Simplex; Point (geometry); Robotics; Observable; Machine learning; Bellman equation; Markov chain; Markov process; Robot; Mathematics; Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.1885125475786514,"gpt":0.4559106252343577,"spread":0.2673980776557062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01002582,0.0001077385,0.0002007795,0.0007342934,0.0003790341,0.0003490532,0.001350514,0.00009502768,0.00003873184],"category_scores_gemma":[0.001364051,0.00009495563,0.0001697311,0.001215188,0.00009486289,0.0008794061,0.0001009776,0.0004656592,0.00007607314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001869153,"about_ca_system_score_gemma":0.000454759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001886661,"about_ca_topic_score_gemma":0.00001040818,"domain_scores_codex":[0.9969518,0.0003988706,0.0008784746,0.0002300099,0.0009783874,0.000562512],"domain_scores_gemma":[0.9962772,0.0008265962,0.000317549,0.0004579487,0.001995092,0.0001256417],"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.00006903701,0.0005824431,0.00003091204,0.00003993775,0.00001138545,0.000008223577,0.0002933925,0.001553824,0.01067532,0.9419853,0.001503923,0.04324627],"study_design_scores_gemma":[0.00006332541,0.0004450305,0.00007544181,0.00003362273,0.000004188712,0.00001913693,0.000220257,0.564523,0.22436,0.2039846,0.00616063,0.0001107465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003346506,0.00009638862,0.9930723,0.002006206,0.0003674389,0.0003481602,0.000005798602,0.00003976374,0.0007173977],"genre_scores_gemma":[0.2395005,0.00000727614,0.759962,0.00003922695,0.0003753645,0.0000215573,0.000001557891,0.00001088665,0.00008159452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7380007,"threshold_uncertainty_score":0.3872178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1480330138","doi":"10.1613/jair.4806","title":"Bayesian Optimization in a Billion Dimensions via Random Embeddings","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":374,"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":"Deutsche Forschungsgemeinschaft","keywords":"Bayesian optimization; Embedding; Computer science; Categorical variable; Curse of dimensionality; Solver; Bayesian probability; Artificial intelligence; Optimization problem; Mathematical optimization; Integer programming; Machine learning; Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07307959598059346,"gpt":0.3908340800060834,"spread":0.31775448402549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428349,0.0001380224,0.000277031,0.001407946,0.000191914,0.0001472164,0.0008460852,0.00009853821,0.0001023025],"category_scores_gemma":[0.002111295,0.00009285769,0.0001023252,0.002193552,0.0002055366,0.001515621,0.0002175529,0.0004424105,0.00005568787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003634111,"about_ca_system_score_gemma":0.0002552202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001983055,"about_ca_topic_score_gemma":0.00001914578,"domain_scores_codex":[0.9967365,0.0005124304,0.0009018873,0.0003307533,0.001010616,0.0005078327],"domain_scores_gemma":[0.9962897,0.001128117,0.0003029372,0.000339451,0.001717783,0.0002220708],"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.000255688,0.0003254128,0.0001031922,0.000005733094,0.00001691784,0.0001615057,0.001049142,0.5424291,0.01857056,0.006660887,0.00004707549,0.4303748],"study_design_scores_gemma":[0.0002698063,0.0002851624,0.000023443,0.0001657752,0.00000219592,0.00008555794,0.0002215547,0.9199374,0.04906081,0.02970387,0.0001013946,0.0001430549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001486479,0.00008448563,0.9953703,0.002303805,0.0003505851,0.0002565175,8.10027e-7,0.00002344383,0.0001236247],"genre_scores_gemma":[0.6037529,0.0004704751,0.3954897,0.00003349079,0.0001461191,0.000006876674,2.572945e-7,0.00001713059,0.00008312197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6022664,"threshold_uncertainty_score":0.3786627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3013772641","doi":"10.1613/jair.1.12162","title":"Mapping the landscape of Artificial Intelligence applications against COVID-19","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":338,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Science and Technology Facilities Council; Institut de Valorisation des Données; William and Flora Hewlett Foundation","keywords":"Multidisciplinary approach; Coronavirus disease 2019 (COVID-19); Applications of artificial intelligence; Pandemic; 2019-20 coronavirus outbreak","retraction":null,"screen_n_in":null,"score":{"opus":0.3617784450179333,"gpt":0.4770410701565926,"spread":0.1152626251386594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005337292,0.0002162117,0.0005938638,0.0007693036,0.000450004,0.0001448822,0.001023324,0.0001643882,0.0004931418],"category_scores_gemma":[0.009598647,0.0001590999,0.0003525989,0.003235199,0.0008610089,0.0001681343,0.0002598646,0.001617991,0.0002227525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003103053,"about_ca_system_score_gemma":0.002352409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008858205,"about_ca_topic_score_gemma":0.00003718227,"domain_scores_codex":[0.9948307,0.0004777758,0.001775026,0.0004119613,0.001893523,0.0006109605],"domain_scores_gemma":[0.9926332,0.003395257,0.0005929131,0.0005761737,0.001932229,0.0008702387],"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.002040974,0.001610888,0.001481612,0.001095151,0.000361477,0.0003838924,0.01884163,0.01936964,0.105897,0.01972396,0.01689786,0.8122959],"study_design_scores_gemma":[0.0002912793,0.004888791,0.0004717327,0.001275314,0.0002768728,0.0003385412,0.09337025,0.1313596,0.4370712,0.06382374,0.265926,0.0009066008],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07475907,0.00153955,0.5484348,0.3726371,0.0003225185,0.00175391,0.00002655255,0.00006491874,0.0004615821],"genre_scores_gemma":[0.9870201,0.00100988,0.002115224,0.008074558,0.001667717,0.0000435523,0.00000526927,0.00003890284,0.00002478177],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9122611,"threshold_uncertainty_score":0.998744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160927913","doi":"10.1613/jair.1696","title":"Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators","year":2005,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macro; Computer science; Artificial intelligence; Software engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1124290222437872,"gpt":0.4091690585784714,"spread":0.2967400363346842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006285138,0.0002213508,0.0003589571,0.0006869818,0.0006320009,0.001083751,0.001675184,0.0001392208,0.0001094186],"category_scores_gemma":[0.000706595,0.0001678598,0.0001160561,0.001216351,0.0002351464,0.001259711,0.0002731478,0.00187984,0.0001994506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000208488,"about_ca_system_score_gemma":0.0009604084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005179384,"about_ca_topic_score_gemma":0.00001969106,"domain_scores_codex":[0.9955497,0.0004587042,0.0009752273,0.000398743,0.001653129,0.000964433],"domain_scores_gemma":[0.9966688,0.0009030298,0.0003133184,0.0004687639,0.001229929,0.0004161903],"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.0003381265,0.0002626529,0.001545077,0.00008248341,0.00009123896,0.0007465443,0.007960279,0.0741058,0.01691009,0.02454153,0.001624019,0.8717921],"study_design_scores_gemma":[0.0001503973,0.002174328,0.0002001757,0.0006316257,0.00001675962,0.0005585414,0.001512004,0.8741157,0.1043401,0.01205184,0.003754448,0.0004940341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1160047,0.0004403629,0.87398,0.008454273,0.0002131702,0.0001776158,0.000001169943,0.00008542241,0.0006433482],"genre_scores_gemma":[0.892694,0.00001962502,0.1062974,0.0002589551,0.0005371549,0.000004538226,5.598604e-7,0.00002388831,0.0001638365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8712981,"threshold_uncertainty_score":0.9999532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2274912527","doi":"10.1613/jair.4787","title":"How Translation Alters Sentiment","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; National Research Council Canada","funders":"","keywords":"Sentiment analysis; Computer science; Focus (optics); Lexicon; Natural language processing; Annotation; Artificial intelligence; Arabic; Machine translation; Linguistics; Social media; Resource (disambiguation); World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.2633291444881119,"gpt":0.4243514885302698,"spread":0.1610223440421579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003293506,0.00008220005,0.0001684346,0.0006114721,0.0001498688,0.0004708143,0.0008231121,0.0000435983,0.00008524885],"category_scores_gemma":[0.0001819932,0.00005036455,0.0001741351,0.000752169,0.000105115,0.0009951501,0.00008202228,0.000198766,0.00008576074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008668641,"about_ca_system_score_gemma":0.0001098643,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004070282,"about_ca_topic_score_gemma":0.000003921489,"domain_scores_codex":[0.9974611,0.0002637291,0.0004868188,0.0001963717,0.001241912,0.0003500736],"domain_scores_gemma":[0.9982612,0.0004569554,0.0002005175,0.0002601817,0.0006658839,0.0001553226],"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.00002361289,0.00007050196,0.00009852061,0.000002997753,0.0000399631,0.00002221408,0.0005662635,0.00004790208,0.06834627,0.02191521,0.0004509054,0.9084156],"study_design_scores_gemma":[0.00013482,0.0007634017,0.0001254693,0.0002515013,0.00001725935,0.00004804167,0.001621605,0.04623342,0.8775336,0.05621316,0.01678928,0.0002684286],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01831877,0.0002756595,0.957945,0.02277,0.0003952751,0.00006951723,3.449772e-7,0.000009635021,0.0002158102],"genre_scores_gemma":[0.9793816,0.0002664197,0.01955865,0.00002499542,0.0003636738,0.000001556684,1.564297e-7,0.00000605592,0.0003969576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9610628,"threshold_uncertainty_score":0.4540073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3117215073","doi":"10.1613/jair.1.13673","title":"Towards Continual Reinforcement Learning: A Review and Perspectives","year":2022,"lang":"en","type":"review","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":180,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; McGill University","funders":"Canada Excellence Research Chairs, Government of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Scope (computer science); Artificial intelligence; Bridging (networking); Taxonomy (biology); Function (biology); Management science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3537488428002021,"gpt":0.4758490705427069,"spread":0.1221002277425048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01167099,0.0004019499,0.001920793,0.001212323,0.0005446997,0.0005758179,0.002878048,0.000173706,0.0008247282],"category_scores_gemma":[0.004848099,0.0003204127,0.000599543,0.00201187,0.0003637585,0.0005506512,0.001777283,0.004585868,0.0000898108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000670457,"about_ca_system_score_gemma":0.001834283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001694632,"about_ca_topic_score_gemma":7.451476e-7,"domain_scores_codex":[0.991866,0.002030564,0.002180656,0.0005497446,0.002603675,0.0007693485],"domain_scores_gemma":[0.994913,0.001465323,0.001499777,0.0006523895,0.001139064,0.0003304786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006593099,0.00004404091,1.560825e-7,0.006680058,0.0001705447,0.0001121582,0.001133247,0.002921728,2.790719e-7,0.02010213,0.000697781,0.9681313],"study_design_scores_gemma":[0.00001913925,0.001293918,1.013555e-7,0.008857085,0.0002132788,0.0003924475,0.00108381,0.003642684,0.000004018696,0.0005308807,0.983661,0.0003016187],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[1.006542e-7,0.7782069,0.21892,0.0005247617,0.0002594229,0.0006263192,5.310488e-7,0.00002235593,0.00143958],"genre_scores_gemma":[0.00002268204,0.9961339,0.00233357,0.00003572108,0.0002699145,0.00003875874,0.000002744795,0.00003634514,0.001126314],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9829633,"threshold_uncertainty_score":0.9999248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097113539","doi":"10.1613/jair.898","title":"Accelerating Reinforcement Learning through Implicit Imitation","year":2003,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of British Columbia","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Natural Sciences and Engineering Research Council of Canada","keywords":"Imitation; Reinforcement learning; Observability; Computer science; Convergence (economics); Action (physics); Space (punctuation); Artificial intelligence; State space; Reinforcement; Value (mathematics); Human–computer interaction; Machine learning; Psychology; Mathematics; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.2541885736812509,"gpt":0.4324161648659641,"spread":0.1782275911847133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00631117,0.0001536442,0.0002507791,0.0004431295,0.0005890947,0.0007183951,0.001111902,0.000095398,0.0001312823],"category_scores_gemma":[0.00374955,0.0001367928,0.0001367768,0.001279598,0.0001224546,0.001501859,0.0001908028,0.001396905,0.0001742293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002532483,"about_ca_system_score_gemma":0.0004110012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002620821,"about_ca_topic_score_gemma":0.00000234679,"domain_scores_codex":[0.9954541,0.0006783106,0.001170682,0.0002570804,0.001750634,0.0006891928],"domain_scores_gemma":[0.9964403,0.0009106894,0.0005219298,0.0003631251,0.001603974,0.0001599956],"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.00001358498,0.00002792562,0.00009031263,0.00001211117,0.00002187909,0.00002348281,0.002549058,0.7210429,0.006099456,0.2478757,0.000119119,0.02212445],"study_design_scores_gemma":[0.00009995599,0.001855639,0.0000452787,0.0001654187,0.000009800402,0.0001402498,0.006143613,0.7771646,0.1509272,0.05645241,0.006663742,0.0003321527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007117496,0.0001014125,0.9806769,0.0005295918,0.0004407492,0.0001755816,4.165879e-8,0.00002476661,0.0109334],"genre_scores_gemma":[0.9279053,0.0001594595,0.0712276,0.00005820607,0.0001818653,0.000004634013,5.258775e-7,0.00001494361,0.0004474337],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9207879,"threshold_uncertainty_score":0.69275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3092156990","doi":"10.1613/jair.1.12440","title":"Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Government of Canada; Canadian Institute for Advanced Research; Vector Institute; Microsoft Research","keywords":"Reinforcement learning; Computer science; Exploit; Counterfactual thinking; Function (biology); Artificial intelligence; Finite-state machine; Machine learning; Algorithm; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1113564636583909,"gpt":0.3745631904237698,"spread":0.2632067267653789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007680622,0.000173457,0.0003079037,0.001429012,0.000805173,0.0003705154,0.00171371,0.00007099303,0.0004823425],"category_scores_gemma":[0.001497566,0.0001667666,0.0001175067,0.002283619,0.00009991034,0.0008412846,0.001028001,0.003419774,0.00003401743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007225922,"about_ca_system_score_gemma":0.0004233338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008558952,"about_ca_topic_score_gemma":0.00001439829,"domain_scores_codex":[0.9937354,0.00110426,0.001332225,0.0003433353,0.002735107,0.0007496561],"domain_scores_gemma":[0.9975918,0.0005915556,0.0005737434,0.0004105511,0.0006643192,0.000168032],"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.0001468123,0.00003570172,0.0008341765,0.0000192612,0.00002008649,0.0001063135,0.002774453,0.9203317,0.003979521,0.01172592,0.0001459679,0.05988015],"study_design_scores_gemma":[0.0001137608,0.002815373,0.0001975151,0.0001026192,0.000006892068,0.0001379363,0.007290337,0.9629144,0.004042804,0.01653883,0.00557523,0.0002643098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06806064,0.0001578907,0.9287345,0.001028922,0.001010319,0.0002438727,3.459332e-7,0.00003746507,0.0007260342],"genre_scores_gemma":[0.9942685,0.00007585859,0.004872578,0.00007221857,0.0002984882,0.00001080453,0.000002357972,0.00002001484,0.0003791165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9262079,"threshold_uncertainty_score":0.9988794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110504071","doi":"10.1613/jair.1815","title":"Dynamic Local Search for the Maximum Clique Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":158,"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":"Clique problem; Vertex (graph theory); Benchmark (surveying); Clique; Mathematics; Generalization; Mathematical optimization; Computer science; Algorithm; Combinatorics; Graph; Chordal graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1249041833922344,"gpt":0.4055584359057617,"spread":0.2806542525135273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007878719,0.0001306616,0.00021896,0.0004856575,0.0006953015,0.0005404452,0.002524714,0.00009008148,0.00003243525],"category_scores_gemma":[0.0001409181,0.00008793006,0.0002500847,0.001338662,0.0006735318,0.00042846,0.000359891,0.001048112,0.00004464494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001617535,"about_ca_system_score_gemma":0.0004880032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002441328,"about_ca_topic_score_gemma":0.0002348562,"domain_scores_codex":[0.9965515,0.0003304983,0.0007889267,0.0002756492,0.001325693,0.000727761],"domain_scores_gemma":[0.9954527,0.002152234,0.0001518298,0.0004697648,0.001644518,0.0001289705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007634742,0.0001923622,0.00001572672,0.00002262247,0.00002184925,0.00003178425,0.0002881316,0.0103134,0.001038029,0.4180681,0.0006457413,0.5692859],"study_design_scores_gemma":[0.00003458874,0.0004752713,0.00006508361,0.00004140222,0.000003771293,0.00008445493,0.0006368437,0.3995648,0.01434222,0.581023,0.003634352,0.00009412937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003079841,0.0005467168,0.9878349,0.007297743,0.0003977502,0.0004122189,0.000003149366,0.00001987925,0.0004078431],"genre_scores_gemma":[0.9197697,0.000174871,0.07928893,0.00005652166,0.0004811092,0.00002405114,7.530057e-7,0.0000161402,0.0001879011],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9166899,"threshold_uncertainty_score":0.5347767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155992093","doi":"10.1613/jair.4171","title":"Enhanced Partial Expansion A*","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":151,"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; Computer science; A priori and a posteriori; Heuristic; Benchmark (surveying); Node (physics); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1483667407816816,"gpt":0.4088555009411715,"spread":0.2604887601594899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007639063,0.0001067275,0.000218507,0.0004216057,0.0003219177,0.0003240113,0.001270846,0.00008999485,0.00006392901],"category_scores_gemma":[0.001332272,0.00008683373,0.0001092552,0.000775842,0.0001262197,0.000541907,0.0001811181,0.0008169856,0.0002355185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006126242,"about_ca_system_score_gemma":0.0002782725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002709601,"about_ca_topic_score_gemma":0.000005711721,"domain_scores_codex":[0.9967772,0.000630787,0.000664647,0.0002369298,0.001156681,0.0005337721],"domain_scores_gemma":[0.9971391,0.001082448,0.0002199669,0.000385796,0.0009297839,0.0002428838],"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.00009908002,0.0001325082,0.00005389429,0.00001901005,0.00001597755,0.00003978623,0.002385088,0.005172248,0.08693942,0.08648396,0.001077267,0.8175818],"study_design_scores_gemma":[0.00004287922,0.001118846,0.0000402992,0.0001838831,0.000003589791,0.00004278234,0.0003459743,0.196679,0.7180071,0.07924316,0.004124704,0.0001677598],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0644659,0.0001121183,0.9321118,0.001730285,0.0005669022,0.00006658628,2.44286e-7,0.0000252639,0.0009208857],"genre_scores_gemma":[0.9780781,0.00003777465,0.02111089,0.00006272644,0.0006177493,0.000002292936,2.611667e-7,0.000008068331,0.00008211638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9136122,"threshold_uncertainty_score":0.3549441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391399751","doi":"10.1613/jair.1.15348","title":"Human-in-the-Loop Reinforcement Learning: A Survey and Position on Requirements, Challenges, and Opportunities","year":2024,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Austrian Science Fund; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; Canadian Institute for Advanced Research","keywords":"Human-in-the-loop; Reinforcement learning; Position (finance); Loop (graph theory); Computer science; Reinforcement; Artificial intelligence; Business; Psychology; Mathematics; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.4886989474982671,"gpt":0.4569376480713653,"spread":0.03176129942690176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01609841,0.0001747721,0.000245735,0.001040339,0.000399817,0.000978554,0.000853067,0.00009481851,0.00002484346],"category_scores_gemma":[0.0006215171,0.0001332765,0.00006062966,0.0006302557,0.000337882,0.001026968,0.0002422873,0.001157163,0.00003799869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000164014,"about_ca_system_score_gemma":0.0002109403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001747567,"about_ca_topic_score_gemma":0.0002119761,"domain_scores_codex":[0.9954813,0.001348796,0.0008657393,0.0003860165,0.001365256,0.0005529216],"domain_scores_gemma":[0.9973912,0.001399598,0.0001405991,0.0003223876,0.0005749958,0.0001712666],"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.00007418684,0.0001309756,0.00002582832,0.00008239266,0.00002895186,0.0006581799,0.008379174,0.0007639015,0.001902539,0.6098085,0.0002557014,0.3778896],"study_design_scores_gemma":[0.0002084123,0.01844046,0.003094118,0.003374224,0.00004051615,0.001221167,0.06385919,0.2636647,0.06693105,0.5611815,0.01660659,0.001378051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7477316,0.04249654,0.1380889,0.05591502,0.001609284,0.001782524,0.000004152223,0.0001609901,0.01221098],"genre_scores_gemma":[0.9889548,0.01029009,0.0001776831,0.0001011644,0.0001696334,0.00001189565,0.000001244325,0.00001348956,0.0002799479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3765116,"threshold_uncertainty_score":0.9436218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122128939","doi":"10.1613/jair.1789","title":"Learning in Real-Time Search: A Unifying Framework","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Computer science; Heuristic; Scalability; Completeness (order theory); Function (biology); Convergence (economics); Control (management); Machine learning; Mathematical optimization; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1779391985443843,"gpt":0.4233065913614683,"spread":0.245367392817084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01033623,0.0001455305,0.0003328918,0.001374863,0.0002705409,0.0004647128,0.001654898,0.0001604268,0.00004245384],"category_scores_gemma":[0.001649243,0.000133658,0.0001093362,0.002688331,0.0002070439,0.000637517,0.0003288063,0.002427391,0.0003123608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002888864,"about_ca_system_score_gemma":0.000558878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005258476,"about_ca_topic_score_gemma":0.000009373973,"domain_scores_codex":[0.9949518,0.001036638,0.0009982968,0.0003278861,0.001781988,0.0009033508],"domain_scores_gemma":[0.9962087,0.002142813,0.0002173681,0.0003776048,0.0008606186,0.0001928437],"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.0001388479,0.0006022715,0.004509574,0.00004811616,0.00003221434,0.00313568,0.006673924,0.5033144,0.03425399,0.103186,0.0004709832,0.343634],"study_design_scores_gemma":[0.00005930094,0.000882573,0.002348847,0.0006409806,0.000003238696,0.0002218366,0.001583286,0.8166136,0.02377272,0.1533879,0.0002019518,0.0002837951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1685371,0.0001776013,0.8265545,0.001891941,0.0003092291,0.0001659357,3.633494e-7,0.00006204361,0.002301385],"genre_scores_gemma":[0.7215489,0.0001218905,0.2773754,0.00001258082,0.0005903968,0.000002871073,4.874795e-7,0.00001938343,0.0003280975],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5530119,"threshold_uncertainty_score":0.9998741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1621585639","doi":"10.1613/jair.740","title":"Partial-Order Planning with Concurrent Interacting Actions","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Planner; Computer science; Order (exchange); Plan (archaeology); Representation (politics); Task (project management); Action (physics); Simple (philosophy); Control (management); Distributed computing; Artificial intelligence; Engineering; Systems engineering; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.328713626214809,"gpt":0.4722555756749504,"spread":0.1435419494601414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003450575,0.0001357567,0.0002244513,0.0005457481,0.0005286296,0.0005403721,0.0009203306,0.00006662449,0.0000955862],"category_scores_gemma":[0.0008006478,0.0001042508,0.00007401509,0.001434555,0.0001345827,0.0009439102,0.000148917,0.001362032,0.00008099977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001155131,"about_ca_system_score_gemma":0.0004463054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005682752,"about_ca_topic_score_gemma":0.00001540958,"domain_scores_codex":[0.9971448,0.0003450814,0.0006491666,0.0002533457,0.001000157,0.000607432],"domain_scores_gemma":[0.9964641,0.001411087,0.0003203015,0.0002813433,0.001275545,0.0002475842],"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.0003982786,0.0004778474,0.006557595,0.00003967575,0.0001503666,0.001480694,0.01175857,0.09565782,0.005208951,0.03339171,0.002105069,0.8427734],"study_design_scores_gemma":[0.0002727204,0.00441494,0.0004212783,0.002843173,0.00004078317,0.003204652,0.01502498,0.80771,0.08076125,0.0146547,0.06973782,0.0009137247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0692778,0.0003211819,0.9258031,0.002462589,0.0006398152,0.00009966575,5.015937e-7,0.00003474967,0.001360573],"genre_scores_gemma":[0.9816054,0.00005813855,0.01771579,0.00003971046,0.0004472051,0.000004359264,5.544414e-7,0.00001180221,0.0001170583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9123276,"threshold_uncertainty_score":0.5917426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1258972194","doi":"10.1613/jair.4726","title":"AutoFolio: An Automatically Configured Algorithm Selector","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Benchmark (surveying); Parameterized complexity; Set (abstract data type); Algorithm; Exploit; Hyperparameter; Variety (cybernetics); Selection (genetic algorithm); Range (aeronautics); State (computer science); Machine learning; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2320042108967314,"gpt":0.4389980739433883,"spread":0.2069938630466569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004610363,0.0001038374,0.0002064978,0.0006055731,0.0001548519,0.0005296979,0.0009162091,0.00009301355,0.0001688228],"category_scores_gemma":[0.001084271,0.00008896671,0.00007431196,0.001168406,0.0001818417,0.001098796,0.0000958219,0.000573651,0.0001717925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001759957,"about_ca_system_score_gemma":0.001236416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003206591,"about_ca_topic_score_gemma":0.00002494985,"domain_scores_codex":[0.9967655,0.0005134497,0.0007009537,0.0002092095,0.001407541,0.0004033814],"domain_scores_gemma":[0.9958146,0.0002620699,0.0001908997,0.0003086265,0.002851911,0.0005718495],"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.00002765334,0.0001703619,0.00002901121,0.000003716361,0.00001849187,0.00007037818,0.00151497,0.001668709,0.001404746,0.0763135,0.0006040996,0.9181744],"study_design_scores_gemma":[0.0000602312,0.0008408852,0.0001664333,0.00002616648,0.000003749448,0.0002033418,0.0009220534,0.9303192,0.01444951,0.05174135,0.001142715,0.0001243154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005495106,0.00004591129,0.9904596,0.001941539,0.0005630216,0.000127909,0.000001106044,0.00005614448,0.001309694],"genre_scores_gemma":[0.5792866,0.00003566895,0.419948,0.0000992832,0.0004735946,0.000003848543,0.000001192843,0.00001373464,0.0001379622],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9286506,"threshold_uncertainty_score":0.5107889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125592902","doi":"10.1613/jair.1509","title":"Learning From Labeled And Unlabeled Data: An Empirical Study Across Techniques And Domains","year":2005,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":97,"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":"Labeled data; Semi-supervised learning; Relevance (law); Independence (probability theory); Selection (genetic algorithm); Empirical research; Bivariate analysis; Process (computing); Selection bias","retraction":null,"screen_n_in":null,"score":{"opus":0.2839496994906822,"gpt":0.524008033142466,"spread":0.2400583336517838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008206872,0.000121466,0.0002443503,0.0002469594,0.0005251443,0.0008792608,0.00139676,0.00008331259,0.0000133933],"category_scores_gemma":[0.001129798,0.00009840656,0.00001966051,0.000552252,0.0002145713,0.001691398,0.0009282492,0.001243916,0.00001533494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005180987,"about_ca_system_score_gemma":0.0001243438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002181821,"about_ca_topic_score_gemma":0.0003532617,"domain_scores_codex":[0.9965844,0.001104177,0.000601707,0.0004972544,0.0008395939,0.000372914],"domain_scores_gemma":[0.9976065,0.00076932,0.0002122691,0.0006976732,0.000463475,0.0002507427],"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.0000959222,0.0004789958,0.01767422,0.000004650558,0.00002506583,0.00005771682,0.007070971,0.00004868398,0.004432799,0.0008270133,0.00009016633,0.9691938],"study_design_scores_gemma":[0.0005838975,0.009978671,0.03807912,0.0001810655,0.00004647127,0.0004018891,0.03539537,0.828493,0.02771812,0.01682809,0.04146965,0.0008246821],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9187421,0.0003125917,0.07779205,0.002840231,0.00004998219,0.0001687351,0.000004450316,0.00004600145,0.00004390362],"genre_scores_gemma":[0.9709637,0.0003237753,0.02813894,0.0000260184,0.0004920706,0.000003074904,0.000006676139,0.000009830418,0.00003593014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9683691,"threshold_uncertainty_score":0.8478733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942315111","doi":"10.1613/jair.1.13225","title":"Graph Kernels: A Survey","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":85,"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; Graph; Theoretical computer science; Data science","retraction":null,"screen_n_in":null,"score":{"opus":0.2937579756576601,"gpt":0.4530306973098932,"spread":0.1592727216522331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005932336,0.0001313063,0.0002923237,0.0005245474,0.0002471808,0.0004011359,0.001673191,0.0000953419,0.00007247613],"category_scores_gemma":[0.002417294,0.000113768,0.0001952814,0.003884023,0.0002445156,0.0008178765,0.0004490283,0.001252211,0.00009820436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007678657,"about_ca_system_score_gemma":0.0005069221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003182423,"about_ca_topic_score_gemma":0.0001489597,"domain_scores_codex":[0.9954671,0.001229742,0.0008241069,0.0003450659,0.001472941,0.0006610096],"domain_scores_gemma":[0.9936244,0.001825964,0.000230737,0.0005942302,0.003416764,0.0003079031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000191096,0.0006307015,0.002183001,0.00002463211,0.0001033111,0.002795389,0.001025244,0.008257848,0.02388133,0.1759886,0.003962173,0.7809566],"study_design_scores_gemma":[0.00007061201,0.00073601,0.003380781,0.0001638076,0.000006068954,0.0007620552,0.0007063636,0.03056114,0.2816873,0.6793451,0.002210115,0.0003706135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0593299,0.001484775,0.936141,0.001601682,0.000964521,0.0000914292,0.000001964303,0.00002496145,0.0003597436],"genre_scores_gemma":[0.9697821,0.000918965,0.02864277,0.0001110994,0.0003663133,0.000002479239,8.875746e-7,0.00001520837,0.0001602534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9104521,"threshold_uncertainty_score":0.5440301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1557519121","doi":"10.1613/jair.2293","title":"Graph Abstraction in Real-time Heuristic Search","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"University of Alberta; Western Canada Research Grid","keywords":"Computer science; Abstraction; Incremental heuristic search; Heuristic; Graph; Maxima and minima; Theoretical computer science; Pathfinding; Class (philosophy); Situated; Beam search; Artificial intelligence; Search algorithm; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1599400188619807,"gpt":0.4311293688593298,"spread":0.2711893499973491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01941097,0.0001109318,0.0002192197,0.001531033,0.0002249931,0.0002657706,0.001029896,0.0001175646,0.00007408169],"category_scores_gemma":[0.0006767864,0.0001002098,0.00009457166,0.001927722,0.0001427957,0.0005793924,0.0001219779,0.001381841,0.0002630583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002022089,"about_ca_system_score_gemma":0.0003854085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004245291,"about_ca_topic_score_gemma":0.00007439489,"domain_scores_codex":[0.9963234,0.0003830417,0.0009273931,0.0002512821,0.001359686,0.0007551763],"domain_scores_gemma":[0.9964144,0.001978656,0.0001816657,0.0003016041,0.0008705085,0.0002532028],"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.0006638227,0.0007207816,0.003919245,0.00008410973,0.00004587058,0.002697017,0.006474966,0.02763581,0.1090301,0.03759545,0.00144831,0.8096845],"study_design_scores_gemma":[0.0002774872,0.003837665,0.01953203,0.001327051,0.00001500204,0.000934381,0.005159153,0.2802083,0.404863,0.2813379,0.001523885,0.0009840402],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3777869,0.000182844,0.6173208,0.001119923,0.0003866613,0.0001518227,7.660321e-7,0.00003222615,0.00301805],"genre_scores_gemma":[0.9835452,0.0001479187,0.0158708,0.0000144983,0.0002852159,9.510731e-7,5.379702e-7,0.000009965436,0.0001249206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8087005,"threshold_uncertainty_score":0.6727492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149586740","doi":"10.1613/jair.4117","title":"Scalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Gatsby Charitable Foundation; Royal Society","keywords":"Computer science; Monte Carlo tree search; Machine learning; Reinforcement learning; Tree (set theory); Scalability; Bayesian probability; Artificial intelligence; Benchmark (surveying); Monte Carlo method; Mathematical optimization; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1097453708321637,"gpt":0.354419875162297,"spread":0.2446745043301333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005920767,0.0002316583,0.0003557622,0.001115288,0.0005681771,0.0009227186,0.00133085,0.0001230295,0.000210284],"category_scores_gemma":[0.001213522,0.0001894693,0.0001430999,0.001235439,0.0003529969,0.0005806473,0.0004591367,0.001896225,0.0003977752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000350236,"about_ca_system_score_gemma":0.0004203224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001783437,"about_ca_topic_score_gemma":0.000003472253,"domain_scores_codex":[0.9940898,0.0007208579,0.0009819152,0.0004229187,0.002825336,0.0009591772],"domain_scores_gemma":[0.9952742,0.001521527,0.0002982956,0.0005137672,0.001937616,0.0004546086],"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.0000963148,0.00009252336,0.0001536136,0.00001775933,0.00002373833,0.00003500092,0.0008457404,0.9359654,0.001206642,0.005470461,0.0002098635,0.0558829],"study_design_scores_gemma":[0.00009566033,0.002882672,0.0002285956,0.0001811446,0.000004763602,0.00001497066,0.001209834,0.982104,0.01236411,0.0005515331,0.0001849819,0.0001777486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04345198,0.00008065807,0.9511471,0.001706712,0.0002475839,0.0004875867,1.475204e-7,0.00003458473,0.002843666],"genre_scores_gemma":[0.987018,0.00006693841,0.01195211,0.00006725278,0.0001614995,0.00001319237,2.667204e-7,0.0000210606,0.0006996432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.943566,"threshold_uncertainty_score":0.8897796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3192223999","doi":"10.1613/jair.1.12895","title":"Ethics and Governance of Artificial Intelligence: Evidence from a Survey of Machine Learning Researchers","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Oxford; Open Philanthropy Project; Georgetown University; Canadian Institute for Advanced Research","keywords":"Relevance (law); Artificial intelligence; Corporate governance; Work (physics); Political science; Private sector; Public relations; Public sector; Psychology; Sociology; Computer science; Engineering; Management; Law; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.6323708808206586,"gpt":0.5702557216662416,"spread":0.06211515915441701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.06205151,0.0001775734,0.0006736229,0.0003111445,0.001038121,0.000381779,0.001009135,0.0005304973,0.0005237224],"category_scores_gemma":[0.2180514,0.0001711212,0.0002001431,0.00239434,0.003437992,0.000819451,0.0003658503,0.005437614,0.00001413761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002544941,"about_ca_system_score_gemma":0.00550289,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.07017352,"about_ca_topic_score_gemma":0.0587232,"domain_scores_codex":[0.9833886,0.009325834,0.001684185,0.000388393,0.004412431,0.0008005537],"domain_scores_gemma":[0.9584219,0.02679272,0.0009024559,0.0003206605,0.01306179,0.0005004374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002333069,0.001085788,0.0208197,0.0003304183,0.0003880592,0.0003019557,0.2309562,0.001400462,0.06431887,0.1931005,0.000244825,0.4847202],"study_design_scores_gemma":[0.00009323226,0.002352343,0.01412917,0.003528036,0.00008188368,0.00001405707,0.1783787,0.008441499,0.3519857,0.4387966,0.001501448,0.0006973528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9479226,0.01433876,0.01126213,0.02406687,0.0006960615,0.0003697998,0.00009125107,0.00001523537,0.001237262],"genre_scores_gemma":[0.9621266,0.03566548,0.001598487,0.00003621091,0.0003747833,0.000001637267,0.000002895583,0.0000215881,0.0001723137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4840229,"threshold_uncertainty_score":0.9992741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575452963","doi":"10.1613/jair.788","title":"Conflict-Directed Backjumping Revisited","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Look-ahead; Beam stack search; Constraint learning; Consistency (knowledge bases); Local consistency; Heuristic; Computer science; Constraint satisfaction problem; Focus (optics); Constraint (computer-aided design); Mathematical optimization; Algorithm; Contrast (vision); Constraint satisfaction; Search algorithm; Mathematics; Artificial intelligence; Incremental heuristic search; Beam search","retraction":null,"screen_n_in":null,"score":{"opus":0.2109980789570575,"gpt":0.4285933742557623,"spread":0.2175952952987048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989935,0.00009018095,0.0001892185,0.000730199,0.0002326174,0.0003755818,0.0007112829,0.00007277869,0.0004856511],"category_scores_gemma":[0.001010364,0.00007997937,0.00009865154,0.00189516,0.000134482,0.0007034949,0.0001102479,0.000584496,0.0001871228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125705,"about_ca_system_score_gemma":0.0002509718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001813125,"about_ca_topic_score_gemma":0.00001332352,"domain_scores_codex":[0.9975235,0.0003450253,0.0006872815,0.0001928906,0.0008900285,0.0003612088],"domain_scores_gemma":[0.9969949,0.0004433955,0.0002132012,0.0002744553,0.001873086,0.0002009813],"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.00008028609,0.0001112604,0.0006649866,0.000009885238,0.000031661,0.0001807167,0.001041329,0.001697137,0.00857255,0.05620814,0.001375079,0.9300269],"study_design_scores_gemma":[0.000182253,0.0009001982,0.002936948,0.0004223748,0.000015233,0.001387485,0.001960676,0.8437591,0.05555571,0.03990287,0.05244819,0.0005289305],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01539029,0.0002397966,0.9774647,0.00298875,0.0003790898,0.0001334424,4.799164e-7,0.00006162696,0.003341817],"genre_scores_gemma":[0.9570758,0.001439995,0.04060103,0.0001389024,0.0004286122,0.000002308865,8.479052e-7,0.0000114902,0.0003010365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9416855,"threshold_uncertainty_score":0.5317539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136791927","doi":"10.1613/jair.2486","title":"A General Theory of Additive State Space Abstractions","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Disjoint sets; Heuristics; Computer science; State (computer science); Space (punctuation); Heuristic; State space; Cube (algebra); Set (abstract data type); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1425791225320405,"gpt":0.4123511718843479,"spread":0.2697720493523074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003553945,0.00009228518,0.0002160419,0.0005382213,0.0002984925,0.00007056279,0.0008559627,0.00004627031,0.0001593986],"category_scores_gemma":[0.0007806726,0.00007450004,0.0001406391,0.0007414942,0.0003613017,0.0004179076,0.0001418988,0.001002502,0.0001041064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005784808,"about_ca_system_score_gemma":0.0004574082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000130402,"about_ca_topic_score_gemma":0.00001061241,"domain_scores_codex":[0.997286,0.000565259,0.0005886029,0.0001730534,0.001021654,0.0003654667],"domain_scores_gemma":[0.9970516,0.0009268462,0.0003040064,0.0002688285,0.001273875,0.000174836],"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.0001723589,0.0005441619,0.0002682123,0.00001589393,0.00008967794,0.0005479311,0.007541164,0.01600841,0.01023638,0.1303398,0.001402961,0.8328331],"study_design_scores_gemma":[0.0001609238,0.003119487,0.005095238,0.0002086719,0.00001492016,0.001710796,0.004335576,0.2078617,0.4306974,0.3353921,0.01090967,0.0004934971],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2723779,0.0001855546,0.724708,0.001024786,0.0003564429,0.00007800006,0.000004475707,0.00001500952,0.001249844],"genre_scores_gemma":[0.9700024,0.0004012767,0.02801303,0.00001524882,0.0003927709,0.000002032585,3.64393e-7,0.000008883191,0.001163993],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8323396,"threshold_uncertainty_score":0.4355428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133180954","doi":"10.1613/jair.1676","title":"Decision-Theoretic Planning with non-Markovian Rewards","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Australian Government; National ICT Australia","keywords":"Markov decision process; Computer science; Markov process; Partially observable Markov decision process; Heuristic; Probabilistic logic; Planner; Mathematical optimization; Decision problem; Process (computing); Function (biology); Artificial intelligence; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06525791475197834,"gpt":0.3788264025247418,"spread":0.3135684877727634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006385134,0.0001642231,0.0002835183,0.0007851908,0.0004616969,0.0005846304,0.001540025,0.0001046401,0.00005384284],"category_scores_gemma":[0.0005118882,0.0001197943,0.0001038976,0.001420383,0.0002656936,0.0005773912,0.000177951,0.00108028,0.00008317517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235439,"about_ca_system_score_gemma":0.0005819289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001092044,"about_ca_topic_score_gemma":0.00002068085,"domain_scores_codex":[0.9962333,0.0002828832,0.0007902759,0.0003122714,0.001687048,0.0006942073],"domain_scores_gemma":[0.9960357,0.00185099,0.0002816543,0.000451644,0.001153259,0.0002267338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001218662,0.0005490212,0.006628259,0.00009486771,0.00009006105,0.003586655,0.005005226,0.1536491,0.005537347,0.1296755,0.01201518,0.6819502],"study_design_scores_gemma":[0.000227387,0.004041043,0.001423906,0.002548963,0.00002438655,0.001049885,0.001907746,0.2935932,0.07134192,0.6181481,0.004946143,0.0007472781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1009229,0.000370972,0.8945156,0.00102339,0.0002887651,0.00010881,8.693661e-7,0.00002542631,0.002743301],"genre_scores_gemma":[0.9057747,0.00001896761,0.09360936,0.00003298072,0.0004271007,0.000002766715,5.627056e-7,0.00001534808,0.0001181803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8048518,"threshold_uncertainty_score":0.5637604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3115320986","doi":"10.1613/jair.1.12590","title":"Confronting Abusive Language Online: A Survey from the Ethical and Human Rights Perspective","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Unintended consequences; Perspective (graphical); Human rights; Transparency (behavior); Situational ethics; The Internet; Redress; Social media; Situation awareness","retraction":null,"screen_n_in":null,"score":{"opus":0.1474093345032763,"gpt":0.442678039612974,"spread":0.2952687051096977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00427583,0.00009120668,0.0001867794,0.000123749,0.000661343,0.0005328205,0.0006606026,0.000134832,0.0000579802],"category_scores_gemma":[0.001974262,0.00006209972,0.00007572509,0.0006778858,0.0002542134,0.0002207245,0.0002549838,0.001908943,0.00002552135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001018177,"about_ca_system_score_gemma":0.0002540604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00647423,"about_ca_topic_score_gemma":0.01068062,"domain_scores_codex":[0.9967787,0.001381043,0.0004069056,0.0002675127,0.0008488783,0.0003169776],"domain_scores_gemma":[0.9953158,0.001869274,0.0001417606,0.0002973015,0.002234097,0.0001417504],"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.0003404349,0.0008912832,0.002065325,0.00002052428,0.0004093459,0.003498883,0.07408594,0.000178264,0.1766137,0.530917,0.003422489,0.2075568],"study_design_scores_gemma":[0.000241645,0.001263279,0.02592947,0.0004581087,0.00003432899,0.0006415301,0.06810538,0.01526916,0.4523756,0.4309577,0.004143366,0.0005803964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9193776,0.0008550464,0.07257027,0.006483453,0.000344686,0.00009405902,0.000009152111,0.00001451217,0.0002511862],"genre_scores_gemma":[0.995526,0.00004819009,0.003697957,0.0001097193,0.0005119736,9.525344e-7,0.00000191407,0.00000586707,0.00009745482],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2757619,"threshold_uncertainty_score":0.9787143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167116921","doi":"10.1613/jair.1122","title":"Exploiting Contextual Independence In Probabilistic Inference","year":2003,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong University of Science and Technology","keywords":"Exploit; Conditional independence; Variable elimination; Inference; Independence (probability theory); Variable (mathematics); Representation (politics); Probabilistic logic","retraction":null,"screen_n_in":null,"score":{"opus":0.2762382946313396,"gpt":0.4383195104679956,"spread":0.162081215836656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009734759,0.0001618066,0.0003260907,0.0007556821,0.0001795689,0.0004291507,0.001607611,0.0001454327,0.00005925418],"category_scores_gemma":[0.007588032,0.0001425224,0.0000906719,0.00168082,0.0002649902,0.001009652,0.0001808064,0.001701062,0.0001006905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001964428,"about_ca_system_score_gemma":0.001175527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007433366,"about_ca_topic_score_gemma":0.00009412981,"domain_scores_codex":[0.995333,0.0008925783,0.00115566,0.000371756,0.00150294,0.0007440468],"domain_scores_gemma":[0.9958054,0.001485351,0.0002645256,0.0004250763,0.001752832,0.0002668099],"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.00003449831,0.0002745359,0.0005645981,0.00002330438,0.00000878949,0.000211099,0.002309345,0.004885624,0.004078178,0.8162969,0.0000300984,0.171283],"study_design_scores_gemma":[0.00009173021,0.0007904471,0.0001755325,0.000454265,0.000003356233,0.0002069844,0.003352027,0.1181802,0.04432532,0.8319033,0.00018403,0.0003328195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.13181,0.0002642486,0.8654202,0.0004282209,0.0003053051,0.0001577598,4.267388e-7,0.00001944001,0.001594368],"genre_scores_gemma":[0.9836258,0.000106435,0.0160933,0.00003967218,0.00008227013,0.000008835797,9.506e-8,0.000009279176,0.0000343099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8518158,"threshold_uncertainty_score":0.9084131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W256842657","doi":"10.1613/jair.4030","title":"Inapproximability of Treewidth and Related Problems","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Partial k-tree; Pathwidth; Combinatorics; Tree-depth; Graphical model; Tree decomposition; Mathematics; Chordal graph; Discrete mathematics; Computer science; Graph; 1-planar graph; Line graph; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.142345972613428,"gpt":0.382805798384195,"spread":0.240459825770767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008166771,0.00009223441,0.0002703027,0.0003428858,0.0001145509,0.0001313803,0.0008682967,0.00009461852,0.00001804787],"category_scores_gemma":[0.001196999,0.00007240948,0.0000749504,0.0007994699,0.0003929489,0.0004071852,0.0002102956,0.0006711581,0.00001238669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003819533,"about_ca_system_score_gemma":0.0001956339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004391098,"about_ca_topic_score_gemma":0.000008779103,"domain_scores_codex":[0.9973124,0.0005187082,0.0008452017,0.0002288936,0.0007734891,0.0003213672],"domain_scores_gemma":[0.9974067,0.0005864053,0.0002615641,0.0003571211,0.001208471,0.0001796922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002879851,0.0002162956,0.0003352184,0.0000594655,0.00001867627,0.000005005416,0.001728153,0.0008782649,0.01107477,0.2780133,0.00004459376,0.7075974],"study_design_scores_gemma":[0.0000374988,0.0009944633,0.0003288011,0.0001257961,0.000003980523,0.00005959644,0.0001978099,0.292876,0.03152817,0.6736307,0.0001238805,0.00009335026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1798343,0.0002368212,0.8172351,0.001319307,0.0001487264,0.0001018744,3.705655e-7,0.00001255715,0.001111044],"genre_scores_gemma":[0.984411,0.0001114738,0.01537368,0.000009208809,0.00005332656,0.000001599374,9.01411e-8,0.000005199523,0.00003439263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8045768,"threshold_uncertainty_score":0.2952773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127002961","doi":"10.1613/jair.3640","title":"Domain and Function: A Dual-Space Model of Semantic Relations and Compositions","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Domain (mathematical analysis); Function (biology); Similarity (geometry); Space (punctuation); Vector space model; Semantic space; Vector space; Semantic similarity","retraction":null,"screen_n_in":null,"score":{"opus":0.1732412730920352,"gpt":0.3904327719438797,"spread":0.2171914988518445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002317841,0.00006951109,0.0001764719,0.0003608944,0.00024079,0.0001009175,0.0002156426,0.00005881718,0.0000109697],"category_scores_gemma":[0.0001857868,0.00005656168,0.00004469289,0.0004381022,0.0003271257,0.0006848293,0.0001746312,0.000332687,0.00000956831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002665354,"about_ca_system_score_gemma":0.0001120802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002287545,"about_ca_topic_score_gemma":0.00001583661,"domain_scores_codex":[0.9985298,0.0001810568,0.000410207,0.0001126204,0.0004827359,0.0002835753],"domain_scores_gemma":[0.9984666,0.0005920797,0.0001393358,0.000182627,0.0004624453,0.0001569529],"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.00007092163,0.0002522396,0.00265629,0.00003558589,0.00004199204,0.00001082996,0.005894356,0.001538222,0.02965,0.9390948,0.0005967948,0.02015795],"study_design_scores_gemma":[0.0001080096,0.0007626217,0.005962556,0.0001900801,0.00003814804,0.0004700569,0.007321529,0.3613928,0.02801402,0.5950256,0.000491617,0.0002229312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3312164,0.0008811761,0.6646156,0.002808715,0.0001139684,0.00006415195,7.227195e-7,0.000006635024,0.0002925921],"genre_scores_gemma":[0.9574565,0.0001927316,0.04218687,0.00001504003,0.00009621424,0.000001560969,1.138522e-7,0.000003558333,0.00004745918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6262401,"threshold_uncertainty_score":0.2306518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2924816077","doi":"10.1613/jair.1.11418","title":"Modeling and Planning with Macro-Actions in Decentralized POMDPs","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Office of Naval Research; National Institute of Mental Health; Multidisciplinary University Research Initiative; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; National Institutes of Health; National Science Foundation","keywords":"Computer science; Partially observable Markov decision process; Macro; Markov decision process; Exploit; Action (physics); Class (philosophy); Mathematical optimization; Artificial intelligence; Markov chain; Markov process; Markov model; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.2096420685101475,"gpt":0.4311779567163518,"spread":0.2215358882062043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001855826,0.00008882488,0.0001891682,0.0005993817,0.000113843,0.000329079,0.0005844813,0.00005387374,0.00002527176],"category_scores_gemma":[0.0002294765,0.00007097164,0.0000334163,0.0007945243,0.00005758028,0.0006911795,0.0001494142,0.0008143232,0.00003485112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001229156,"about_ca_system_score_gemma":0.0002361396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004457747,"about_ca_topic_score_gemma":0.0000127904,"domain_scores_codex":[0.9978803,0.0001710247,0.0005053427,0.0001843807,0.000822575,0.0004363801],"domain_scores_gemma":[0.9987199,0.0003054283,0.0001126936,0.0002255002,0.0005032152,0.0001333042],"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.00008028805,0.00003609843,0.002733328,0.00001419418,0.00001463857,0.00006393358,0.002157933,0.977469,0.001455872,0.009273256,0.00000569837,0.006695802],"study_design_scores_gemma":[0.00006661425,0.0003639403,0.0001800383,0.0001727971,0.000002049137,0.00007099236,0.001689575,0.9930395,0.00195218,0.002272105,0.0001059367,0.00008421562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3627873,0.0001005013,0.6362987,0.0003076715,0.0001321058,0.0001061736,5.580359e-8,0.000009727021,0.0002577418],"genre_scores_gemma":[0.9662137,0.0001605808,0.03350972,0.00001623684,0.00005124862,0.000001379403,1.106683e-7,0.000007967464,0.00003903439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6034264,"threshold_uncertainty_score":0.3537874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169142063","doi":"10.1613/jair.3940","title":"Topic Segmentation and Labeling in Asynchronous Conversations","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Computer science; Asynchronous communication; Segmentation; Artificial intelligence; Conversation; Natural language processing; Exploit; Graph; Linguistics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1082659095785678,"gpt":0.424850168063926,"spread":0.3165842584853582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483233,0.00005607758,0.0001292637,0.0006173765,0.00009331142,0.0002190246,0.0004075541,0.00003963238,0.00005487368],"category_scores_gemma":[0.0003308776,0.00004950662,0.00003205341,0.000753769,0.00009904255,0.001067455,0.0001150136,0.0003548369,0.00003760059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001364216,"about_ca_system_score_gemma":0.0000981612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001492061,"about_ca_topic_score_gemma":0.00006485697,"domain_scores_codex":[0.9985737,0.0001609762,0.0004621408,0.0001356075,0.0004470028,0.0002206006],"domain_scores_gemma":[0.9986854,0.0003300168,0.0001209393,0.0001559603,0.0006273811,0.00008034636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005079478,0.00009118294,0.00166586,0.000009693793,0.00001290541,0.00002145948,0.002088136,0.0005984973,0.04945802,0.0401774,0.00006379978,0.905808],"study_design_scores_gemma":[0.00005879125,0.0004367064,0.001808388,0.0000965072,0.000004935979,0.00003980524,0.003578268,0.1695396,0.2807754,0.543384,0.0001115992,0.0001660705],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.214954,0.000177129,0.7828961,0.001651909,0.000049527,0.0001354386,8.147802e-8,0.00001141254,0.0001244048],"genre_scores_gemma":[0.8893526,0.0002283799,0.1103128,0.00002616236,0.00005024385,0.000007254876,1.301088e-7,0.000003137727,0.00001924419],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9056419,"threshold_uncertainty_score":0.2112059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125990606","doi":"10.1613/jair.2169","title":"Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Tabu search; Constructive; Set (abstract data type); Computer science; Guided Local Search; Mathematical optimization; Job shop scheduling; Benchmark (surveying); Scheduling (production processes); Beam search; Iterative deepening depth-first search; Search algorithm; Incremental heuristic search; Mathematics; Artificial intelligence; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.2050300271260984,"gpt":0.4302269118399463,"spread":0.2251968847138479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007815317,0.000145326,0.0002668506,0.0008291334,0.0002971517,0.0001495604,0.0003747689,0.0001572274,0.00009114465],"category_scores_gemma":[0.001173729,0.000137705,0.000166877,0.0008175306,0.0002758668,0.0002728733,0.00004714272,0.0009425461,0.00005311254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003020939,"about_ca_system_score_gemma":0.0002256661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001591687,"about_ca_topic_score_gemma":0.00002222108,"domain_scores_codex":[0.9973146,0.00009627658,0.0009699153,0.0001539241,0.0007375033,0.0007278101],"domain_scores_gemma":[0.9959591,0.0009765931,0.00008770228,0.0001729164,0.002503184,0.0003004727],"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.0003004738,0.0001587317,0.0003461987,0.0001005407,0.0001691344,0.00004832802,0.003263678,0.768321,0.03909793,0.0084909,0.0001973918,0.1795056],"study_design_scores_gemma":[0.0001109291,0.0001515328,0.00003606203,0.00008690978,0.000009077538,0.0000709361,0.009176262,0.7806533,0.207952,0.001564031,0.00004506043,0.0001438709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09277709,0.0003536294,0.9051772,0.000246067,0.000798632,0.0002620278,0.000004561111,0.00004527668,0.0003355008],"genre_scores_gemma":[0.637368,0.0001265854,0.3617501,0.000009756905,0.0006662591,0.000004588907,0.000001198723,0.00003282062,0.00004069141],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.544591,"threshold_uncertainty_score":0.5615448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167609405","doi":"10.1613/jair.2693","title":"The Latent Relation Mapping Engine: Algorithm and Experiments","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","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":"National Research Council Canada","funders":"Princeton University","keywords":"Analogy; Relation (database); Core (optical fiber); Set (abstract data type); Latent semantic analysis; Variety (cybernetics); Relational database; Raw data","retraction":null,"screen_n_in":null,"score":{"opus":0.2756728393136693,"gpt":0.4075134273255451,"spread":0.1318405880118758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002802339,0.00006350524,0.0001008891,0.0002104676,0.0005825163,0.0001829822,0.0006110411,0.00004369311,0.000005233038],"category_scores_gemma":[0.0002961662,0.00004366144,0.00004486589,0.0003969807,0.0001428204,0.0004213786,0.0001960297,0.0004813597,0.00001909515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007800399,"about_ca_system_score_gemma":0.000132142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001954957,"about_ca_topic_score_gemma":0.000001103009,"domain_scores_codex":[0.9980669,0.000181909,0.0004774265,0.0001463952,0.0008295553,0.0002978084],"domain_scores_gemma":[0.9986466,0.000398945,0.0001161981,0.0002307259,0.000493866,0.0001136482],"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.000009875154,0.0000381707,0.0001510797,0.000002789919,0.00001570207,0.00007693371,0.003766167,0.001115329,0.002806059,0.01389514,0.0001068994,0.9780158],"study_design_scores_gemma":[0.00003676464,0.0001973601,0.000733426,0.00005611327,0.000001376283,0.0003204475,0.001053914,0.9290766,0.03429125,0.03241746,0.001713158,0.0001021276],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08787469,0.001050761,0.9089587,0.00157949,0.000341218,0.00008251892,9.243689e-8,0.000009084917,0.0001034267],"genre_scores_gemma":[0.8989751,0.001304174,0.09923895,0.000018472,0.0003242186,0.000003093928,6.623928e-8,0.000005979722,0.0001299641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9779137,"threshold_uncertainty_score":0.4480304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1799762961","doi":"10.1613/jair.904","title":"Accelerating Reinforcement Learning by Composing Solutions of Automatically Identified Subtasks","year":2002,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Reinforcement learning; Exploit; Partition (number theory); Function (biology); Base (topology); State space; Reinforcement; Function approximation","retraction":null,"screen_n_in":null,"score":{"opus":0.2748869913500262,"gpt":0.396747064427609,"spread":0.1218600730775828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005513628,0.0001582135,0.0003574942,0.0006347562,0.0006490577,0.0006008826,0.001532451,0.0001035378,0.0002863946],"category_scores_gemma":[0.00198227,0.0001477241,0.0001695905,0.001206118,0.0003029009,0.0009707657,0.0004861951,0.001340429,0.0001176081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002024191,"about_ca_system_score_gemma":0.0001393467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003391218,"about_ca_topic_score_gemma":0.000001860025,"domain_scores_codex":[0.9945855,0.0005479954,0.001741448,0.000238769,0.002137171,0.0007491728],"domain_scores_gemma":[0.9959714,0.001067399,0.000760043,0.0004041972,0.001574001,0.0002229691],"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.00001844722,0.0001522497,0.00008921423,0.00005481222,0.00006559226,0.00002636038,0.002875281,0.840547,0.07357518,0.0358612,0.001861739,0.04487291],"study_design_scores_gemma":[0.00004797426,0.0006240203,0.00001583854,0.0001882794,0.000008033384,0.00003872816,0.0006874988,0.9460827,0.05035247,0.001466805,0.0003590491,0.0001286611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01075093,0.000221886,0.9853038,0.001087945,0.0003047289,0.0001803519,2.653346e-7,0.00003623838,0.002113923],"genre_scores_gemma":[0.9750773,0.0001424225,0.02402497,0.00002192062,0.0001155593,0.00000276163,9.130298e-7,0.00001436146,0.0005998358],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9643263,"threshold_uncertainty_score":0.6024014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140994944","doi":"10.1613/jair.2241","title":"Compressed Pattern Databases","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":53,"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":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Table (database); Set (abstract data type); Uncompressed video; Database; Heuristic; Merge (version control); Domain (mathematical analysis); Algorithm; Data mining; Theoretical computer science; Information retrieval; Programming language; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3046764847256089,"gpt":0.4608203706218097,"spread":0.1561438858962008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01072664,0.0001106618,0.0002062011,0.000635125,0.0003008555,0.0002745924,0.001520345,0.00005562113,0.00008059816],"category_scores_gemma":[0.0006793815,0.00009209257,0.00009390027,0.0009222138,0.0001501045,0.0006412326,0.0002721449,0.0009494028,0.0001474752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007333916,"about_ca_system_score_gemma":0.0002552839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001452855,"about_ca_topic_score_gemma":0.00005235935,"domain_scores_codex":[0.9967976,0.000279301,0.0007764463,0.0002251327,0.001274925,0.0006465612],"domain_scores_gemma":[0.9961248,0.001933028,0.0002355363,0.0004309152,0.000999447,0.0002762801],"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.00009457978,0.000228855,0.001855917,0.00003169729,0.00003200604,0.0007242956,0.001687622,0.001453942,0.01149055,0.02170089,0.003177576,0.9575221],"study_design_scores_gemma":[0.0001628342,0.001886245,0.001879017,0.0009122363,0.00001652468,0.0006010008,0.003267954,0.1880978,0.7181883,0.05183376,0.03244727,0.0007070716],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02813777,0.0004136102,0.9689415,0.001223391,0.000467289,0.00007782086,0.00000219356,0.00002524397,0.0007112438],"genre_scores_gemma":[0.9709154,0.00004837374,0.02840744,0.00009337181,0.0004677589,7.238e-7,0.000001102079,0.000009017145,0.00005685362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.956815,"threshold_uncertainty_score":0.4124736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170780172","doi":"10.1613/jair.3463","title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Benchmark (surveying); Constraint programming; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Search tree; Mathematical optimization; Local search (optimization); Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2126970487318262,"gpt":0.408101652300917,"spread":0.1954046035690908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006791956,0.0001167365,0.000199786,0.0005935691,0.0004010872,0.0003859244,0.0004163682,0.00009257729,0.00008539693],"category_scores_gemma":[0.001208196,0.0001063935,0.0001304176,0.0006852772,0.0002293018,0.0009162728,0.00006052179,0.0006252225,0.00003302514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002054427,"about_ca_system_score_gemma":0.0005300402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000036908,"about_ca_topic_score_gemma":0.00003714543,"domain_scores_codex":[0.9971641,0.0002968434,0.0007433028,0.0001752698,0.001010022,0.0006104134],"domain_scores_gemma":[0.996358,0.001170434,0.0002595477,0.0002194382,0.001723766,0.0002687798],"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.00007159277,0.000183141,0.003876985,0.00007937827,0.00003074871,0.00000477795,0.00154617,0.04255699,0.006048503,0.1174219,0.0002663295,0.8279135],"study_design_scores_gemma":[0.0001986534,0.0007225528,0.002627636,0.0002296893,0.00001683396,0.0001501035,0.00160333,0.9112295,0.05035222,0.03012172,0.002403871,0.0003438671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01438154,0.0001066208,0.9823598,0.001765804,0.0008410977,0.0003452369,0.000003996275,0.00002835685,0.0001675076],"genre_scores_gemma":[0.9055119,0.00004783325,0.09392729,0.00005551639,0.0004260031,0.000007325733,0.000001085191,0.00001091701,0.00001215186],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8911303,"threshold_uncertainty_score":0.4338601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754879180","doi":"10.1613/jair.5699","title":"Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents","year":2018,"lang":"en","type":"preprint","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Alberta Innovates; Alberta Innovates - Technology Futures; Alberta Machine Intelligence Institute; Compute Canada; DeepMind; National Science Foundation","keywords":"Variety (cybernetics); Computer science; Benchmark (surveying); Key (lock); Field (mathematics); Data science; Best practice; State (computer science); Management science; Artificial intelligence; Engineering; Computer security; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.4920271193673282,"gpt":0.5281472299857938,"spread":0.03612011061846554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.03811995,0.000342907,0.0006055817,0.0005078212,0.001165841,0.003567335,0.006081915,0.0003149891,0.0001345076],"category_scores_gemma":[0.004593722,0.0002526689,0.0002372065,0.0004792521,0.0007592599,0.000890793,0.005633087,0.002619629,0.00006736234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004838548,"about_ca_system_score_gemma":0.001053792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001097074,"about_ca_topic_score_gemma":0.00001270473,"domain_scores_codex":[0.9913915,0.002288778,0.001944042,0.0008708995,0.002637474,0.0008673542],"domain_scores_gemma":[0.993113,0.001514704,0.001519913,0.0009487123,0.002649259,0.000254399],"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.000138126,0.0001104691,0.000214429,0.0002063779,0.000111045,0.00001034977,0.005573101,0.03954709,0.001767489,0.01478282,0.0004670065,0.9370717],"study_design_scores_gemma":[0.00003873285,0.0006111695,0.00008206777,0.0009582578,0.00002930158,0.00003039407,0.0008029807,0.6208856,0.02188654,0.3445988,0.009816111,0.0002601043],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02801606,0.0008989503,0.9283075,0.008870284,0.0007574141,0.03242252,0.000007447307,0.00003238358,0.0006873907],"genre_scores_gemma":[0.721561,0.002449942,0.2374952,0.0002858971,0.01444474,0.0224015,0.00001970679,0.0002255563,0.001116586],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9368116,"threshold_uncertainty_score":0.9999925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2902729397","doi":"10.1613/jair.1.11263","title":"Grounding Language for Transfer in Deep Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","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 Regina","funders":"","keywords":"Reinforcement learning; Computer science; Variety (cybernetics); Transfer of learning; Representation (politics); Artificial intelligence; Task (project management); Differentiable function; Domain (mathematical analysis); Component (thermodynamics); Meaning (existential); Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1503297529386259,"gpt":0.4297375410971567,"spread":0.2794077881585307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006784916,0.0001218318,0.000236807,0.0009064999,0.0003003027,0.0003595669,0.001219722,0.00008679832,0.00008351458],"category_scores_gemma":[0.001443207,0.0001087328,0.0001216975,0.001085193,0.0002003744,0.000704085,0.0001497349,0.0008713073,0.00007713437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000260527,"about_ca_system_score_gemma":0.0002037926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000365328,"about_ca_topic_score_gemma":0.0000443362,"domain_scores_codex":[0.9968134,0.0002717424,0.000912776,0.0002266861,0.001082085,0.0006933144],"domain_scores_gemma":[0.9976851,0.0007932528,0.0001369741,0.0002678738,0.0009700863,0.0001467324],"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.0002624663,0.00008899708,0.0002900127,0.00005876012,0.0000413569,0.00007738389,0.0215409,0.6470612,0.01701873,0.1128169,0.00007751374,0.2006658],"study_design_scores_gemma":[0.0001018664,0.002064159,0.00004927946,0.0001373376,0.0000039044,0.00002520674,0.004052348,0.9231563,0.06543958,0.003648038,0.00117415,0.0001478479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02865824,0.00007677845,0.9691628,0.0004625104,0.0004422957,0.0002594348,5.030151e-8,0.00001716379,0.0009207677],"genre_scores_gemma":[0.9842557,0.00005766374,0.01480148,0.00003586334,0.0005320308,0.000008064632,4.87503e-7,0.00001397197,0.0002947912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9555974,"threshold_uncertainty_score":0.4433995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124464337","doi":"10.1613/jair.2497","title":"Dynamic Control in Real-Time Heuristic Search","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Háskólinn í Reykjavík; Ministrstvo za visoko šolstvo, znanost in tehnologijo","keywords":"Computer science; Incremental heuristic search; Heuristic; Completeness (order theory); Bounded function; Action (physics); Constant (computer programming); Search problem; Mathematical optimization; Time complexity; State (computer science); Search algorithm; Beam search; Algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1420727133656529,"gpt":0.4191170462261772,"spread":0.2770443328605243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008394702,0.0002522481,0.0006114891,0.001884234,0.0004116103,0.0002644245,0.003096625,0.0001925254,0.0002221446],"category_scores_gemma":[0.001954575,0.0002270913,0.000236755,0.002823522,0.0009317654,0.00106464,0.0003568068,0.001703919,0.001390308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005282728,"about_ca_system_score_gemma":0.001175755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003782847,"about_ca_topic_score_gemma":0.0001078273,"domain_scores_codex":[0.9926937,0.00121651,0.001829453,0.0005296021,0.002474807,0.001255879],"domain_scores_gemma":[0.9938601,0.002536848,0.0003009083,0.0007884111,0.002086584,0.0004270991],"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.001438455,0.003139749,0.005352716,0.0001055676,0.0001918984,0.01193009,0.02192574,0.05135221,0.2357161,0.105614,0.002671516,0.560562],"study_design_scores_gemma":[0.0001171733,0.001546281,0.001540631,0.0002224635,0.000007621471,0.0009356251,0.001584193,0.8520272,0.05703152,0.08409059,0.0004101032,0.0004865841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4688446,0.0003828358,0.524943,0.002991958,0.0005820617,0.0004804534,0.000003261178,0.00006395473,0.001707833],"genre_scores_gemma":[0.9863352,0.001032765,0.01200568,0.00005313924,0.0002079403,0.000009409006,4.299676e-7,0.00002734483,0.0003281569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.800675,"threshold_uncertainty_score":0.9993872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106654973","doi":"10.1613/jair.1332","title":"Existence of Multiagent Equilibria with Limited Agents","year":2004,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":42,"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":"U.S. Air Force; Advanced Research Projects Agency; Defense Advanced Research Projects Agency","keywords":"Nash equilibrium; Counterexample; Computer science; Perspective (graphical); Extension (predicate logic); Abstraction; Mathematical economics; Artificial intelligence; Mathematics; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.6119528539313067,"gpt":0.5618701263001141,"spread":0.05008272763119259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009205993,0.00009682703,0.0002808554,0.0007072411,0.0002328371,0.0001516598,0.001215027,0.00006500991,0.0006103946],"category_scores_gemma":[0.003922108,0.00006224961,0.0001399163,0.002360894,0.0007551798,0.0004265038,0.0001267084,0.0004857926,0.0003432986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000894465,"about_ca_system_score_gemma":0.000408674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003019812,"about_ca_topic_score_gemma":0.00002512082,"domain_scores_codex":[0.9948995,0.0003899483,0.001304595,0.0002487678,0.002837105,0.0003200658],"domain_scores_gemma":[0.9941069,0.001377114,0.0006251695,0.0004840004,0.003173794,0.0002329982],"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.00227693,0.001975312,0.0009811745,0.00002361458,0.0001212277,0.0001548986,0.007390438,0.03766352,0.1191633,0.4527429,0.0008743153,0.3766324],"study_design_scores_gemma":[0.0001007188,0.0009889748,0.000703779,0.0001150989,0.00001028813,0.00009598678,0.01204085,0.00179924,0.3385321,0.6433752,0.002123676,0.000114134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8207543,0.00007910196,0.1758601,0.001835935,0.0001489737,0.000187206,0.000004403718,0.000005992442,0.001123912],"genre_scores_gemma":[0.9931827,0.00005155784,0.006282405,0.00002405622,0.0001590231,0.000004403933,3.016148e-7,0.000008408841,0.0002871632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3765182,"threshold_uncertainty_score":0.6683393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2778562959","doi":"10.1613/jair.5530","title":"A Knowledge Level Account of Forgetting","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Computer science; Equivalence (formal languages); Rotation formalisms in three dimensions; Non-monotonic logic; Logical consequence; Set (abstract data type); Classical logic; Description logic; Relation (database); Knowledge representation and reasoning; Theoretical computer science; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.4105495774803021,"gpt":0.4803035970827368,"spread":0.06975401960243471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007555176,0.0001338879,0.0003611258,0.0004979016,0.0007794438,0.0006548726,0.003968607,0.0001108982,0.00005471674],"category_scores_gemma":[0.004337449,0.000103632,0.0002225141,0.0004157458,0.0004684836,0.001126393,0.0008984867,0.0007576357,0.0001431822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000119774,"about_ca_system_score_gemma":0.0007604454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009666546,"about_ca_topic_score_gemma":0.0001212705,"domain_scores_codex":[0.9970733,0.0002430912,0.0008632033,0.0002554315,0.0009779854,0.0005869743],"domain_scores_gemma":[0.9946392,0.000681184,0.0007277282,0.0008734679,0.002855976,0.0002224282],"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.00007007206,0.0004499334,0.001201439,0.00006628424,0.00005060809,0.00008261848,0.005022218,0.00004116675,0.01387441,0.2413326,0.001333221,0.7364754],"study_design_scores_gemma":[0.0001765163,0.001549023,0.005422757,0.0006663657,0.00001950664,0.0001867218,0.002435938,0.053691,0.6115654,0.3149735,0.008853558,0.000459644],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1720835,0.001817691,0.7877062,0.002512146,0.002310432,0.0003213014,0.000003647876,0.00002832538,0.03321675],"genre_scores_gemma":[0.9889829,0.0001517311,0.009757167,0.000007901499,0.0006409513,0.000002488722,9.27685e-8,0.00001011041,0.0004466307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8168994,"threshold_uncertainty_score":0.7374725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409258158","doi":"10.1613/jair.1.16665","title":"Detecting AI-Generated Text: Factors Influencing Detectability with Current Methods","year":2025,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"Ministère de la Défense Nationale","keywords":"Current (fluid); Computer science; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.2192959255969502,"gpt":0.498691993893544,"spread":0.2793960682965937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008975294,0.0001781402,0.0003485642,0.0009583941,0.0004507625,0.0005179428,0.001529566,0.00009549037,0.0000194739],"category_scores_gemma":[0.002589159,0.0001306269,0.0001243203,0.002561848,0.0001803074,0.0007245133,0.0004093162,0.001757587,0.00000745213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003955972,"about_ca_system_score_gemma":0.001145746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00013104,"about_ca_topic_score_gemma":0.000102032,"domain_scores_codex":[0.9957563,0.001130927,0.001035487,0.0004250958,0.001013752,0.0006384068],"domain_scores_gemma":[0.9952238,0.001424943,0.0002601029,0.0006019783,0.002282967,0.000206182],"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.00004944531,0.00009655602,0.003148183,0.00005027706,0.00003906231,0.00001640292,0.001930785,0.01041003,0.0443195,0.007041025,0.00000938407,0.9328893],"study_design_scores_gemma":[0.00004002972,0.0003056207,0.0005420648,0.0002673373,0.00001032639,0.00001921993,0.001589063,0.2578182,0.7080408,0.03087657,0.0003180967,0.0001727026],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3859554,0.0003538092,0.6127303,0.0003515363,0.0004148271,0.0001182336,1.942271e-7,0.00002309378,0.00005262137],"genre_scores_gemma":[0.8724082,0.00002741606,0.1274147,0.00002253703,0.0001037128,0.000004198163,6.919904e-8,0.000008009612,0.00001125076],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9327167,"threshold_uncertainty_score":0.763594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1671111194","doi":"10.1613/jair.689","title":"On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback (Research Note)","year":2000,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","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 Toronto","funders":"","keywords":"Conditional independence; Uniqueness; Independence (probability theory); Separation (statistics); Pearl; Mathematics; Conditional expectation; Causal model; Mathematical economics; Discrete mathematics; Econometrics; Statistics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.1668487231968562,"gpt":0.4464364931101303,"spread":0.2795877699132742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006651617,0.000170301,0.0002803777,0.001127413,0.0003730574,0.0005598485,0.001459026,0.000179479,0.0005491367],"category_scores_gemma":[0.0004475158,0.0001392475,0.00007287013,0.002163403,0.000418413,0.000999813,0.0001009287,0.002617645,0.0004742034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000277254,"about_ca_system_score_gemma":0.001080429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008060032,"about_ca_topic_score_gemma":0.0004971211,"domain_scores_codex":[0.9937662,0.000962874,0.0008027856,0.0005029753,0.003194682,0.0007705062],"domain_scores_gemma":[0.9956915,0.001764792,0.0001343264,0.0004395239,0.001683583,0.0002863118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001243748,0.001019118,0.0004532689,0.00001591185,0.00004254877,0.0007180388,0.004836504,0.08805917,0.00999901,0.3205355,0.0006634461,0.5724137],"study_design_scores_gemma":[0.0001323201,0.001646719,0.001445252,0.0004430212,0.000003174357,0.00008270964,0.0005380769,0.1716028,0.03741862,0.7863653,0.00007726482,0.0002448406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5757058,0.00009521187,0.4215265,0.001202685,0.0001225356,0.0001677003,0.000004340497,0.00001511089,0.001160159],"genre_scores_gemma":[0.9911216,0.0001454708,0.008364606,0.00005911415,0.0002030345,0.00001057321,0.000002922059,0.00001258274,0.00008011417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5721689,"threshold_uncertainty_score":0.9996834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3166631396","doi":"10.1613/jair.1.13083","title":"Crossing the Conversational Chasm: A Primer on Natural Language Processing for Multilingual Task-Oriented Dialogue Systems","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Task (project management); Pipeline (software); Natural language processing; Focus (optics); Machine translation; Artificial intelligence; Modular design; Conversation; Point (geometry); Field (mathematics); Linguistics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.145382552456486,"gpt":0.4254142850814288,"spread":0.2800317326249428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005884531,0.0001100333,0.000185461,0.0003468843,0.001629759,0.0006769323,0.001209215,0.00003821816,0.00001218442],"category_scores_gemma":[0.001028498,0.00007944721,0.0001176111,0.0006539121,0.0002078981,0.0003375862,0.0003043529,0.001068419,0.000006392616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003066509,"about_ca_system_score_gemma":0.0009091321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001067419,"about_ca_topic_score_gemma":0.000009771731,"domain_scores_codex":[0.9965514,0.0004469851,0.0006419989,0.0002813986,0.001617715,0.0004605365],"domain_scores_gemma":[0.9973093,0.001031778,0.00031469,0.0002906695,0.0009617555,0.00009180516],"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.0006912717,0.0004541376,0.00007756854,0.0000938889,0.00007828425,0.0001482442,0.06045348,0.1571453,0.02254627,0.06588822,0.0003825515,0.6920408],"study_design_scores_gemma":[0.00008480641,0.0003240755,0.00001920013,0.00005759273,0.000004434552,0.00008835339,0.01060189,0.9774631,0.008208205,0.001468657,0.001577251,0.0001024304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3034882,0.001568456,0.6893972,0.00262949,0.002223924,0.000605649,0.000009059232,0.00002816441,0.00004981721],"genre_scores_gemma":[0.9947091,0.000003052107,0.004309894,0.00009109612,0.0007345512,0.00003392133,0.000002122697,0.00001146184,0.0001048308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8203178,"threshold_uncertainty_score":0.99967,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1037351197","doi":"10.1613/jair.4676","title":"Approximate Value Iteration with Temporally Extended Actions","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Landmark; Computer science; Convergence (economics); Bellman equation; Mathematical optimization; Reinforcement learning; Value (mathematics); Function (biology); Term (time); State space; Mathematics; Artificial intelligence; Machine learning; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.3129026095091614,"gpt":0.4403874809011682,"spread":0.1274848713920068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004761231,0.0001144486,0.0001872685,0.0005817218,0.0002310636,0.0007168989,0.001076493,0.00006657666,0.00001692381],"category_scores_gemma":[0.0007684708,0.00008539605,0.00006247008,0.001165231,0.0001700007,0.001377141,0.0001688524,0.0007882146,0.0001069165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002158679,"about_ca_system_score_gemma":0.0008286922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002482724,"about_ca_topic_score_gemma":0.000005977709,"domain_scores_codex":[0.9965006,0.0003703913,0.0006449328,0.0002041585,0.001859363,0.0004205733],"domain_scores_gemma":[0.9963797,0.0002477662,0.000311702,0.0004032837,0.002350853,0.0003067105],"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.000189924,0.0001830411,0.0001290981,0.00001576704,0.00004868655,0.0001390876,0.003012781,0.7680834,0.002802607,0.1740106,0.00100064,0.05038434],"study_design_scores_gemma":[0.00008520187,0.002237396,0.00005234099,0.0001020796,0.000007577873,0.0002406701,0.001833583,0.9334717,0.02851975,0.03039762,0.002877169,0.0001748637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00588956,0.00004413497,0.9890772,0.00234292,0.0003474538,0.0001678109,2.076644e-7,0.00002975476,0.002101019],"genre_scores_gemma":[0.8755842,0.00003247348,0.12358,0.00005334305,0.0003195096,0.000005194316,8.103513e-7,0.00001405908,0.0004104108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8696947,"threshold_uncertainty_score":0.6913072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2540405007","doi":"10.1613/jair.5128","title":"Optimal Partial-Order Plan Relaxation via MaxSAT","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Heuristic; Metric (unit); Order (exchange); Algorithm; Artificial intelligence; Mathematics; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.154734988145756,"gpt":0.3874821599405522,"spread":0.2327471717947962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005630549,0.0001241987,0.0002034849,0.0004866753,0.0003096478,0.0002665052,0.001149724,0.00011414,0.0001635284],"category_scores_gemma":[0.001062982,0.00008137616,0.00009546232,0.0008561151,0.0001657457,0.0008745661,0.0001822102,0.000584093,0.0004208913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001142522,"about_ca_system_score_gemma":0.0003721636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003376392,"about_ca_topic_score_gemma":0.000007403647,"domain_scores_codex":[0.9967722,0.0004572205,0.0007355089,0.0002681845,0.001172673,0.0005942505],"domain_scores_gemma":[0.9967875,0.001143523,0.0003082879,0.0003726224,0.001137619,0.0002504408],"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.0002427461,0.0001657391,0.0008837868,0.00001752894,0.00004521053,0.0002277571,0.001908496,0.005662408,0.03800736,0.03771637,0.002662319,0.9124603],"study_design_scores_gemma":[0.0002576144,0.003497135,0.0004642821,0.001020088,0.00002064813,0.0006033775,0.0008099165,0.2507563,0.5826594,0.1354214,0.02373241,0.0007574083],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04182516,0.0001780807,0.9511614,0.0058561,0.0004874595,0.00009522946,0.000001300269,0.00002968563,0.0003655208],"genre_scores_gemma":[0.9473227,0.0001011882,0.05163166,0.00004685421,0.0005406199,0.000003894603,4.603855e-7,0.00001303093,0.000339567],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9117029,"threshold_uncertainty_score":0.5409846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}