{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":109,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":109,"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":"6ec81676fb52","filters":{"venue":"Artificial Intelligence"}},"results":[{"id":"W1983690667","doi":"10.1016/s0004-3702(02)00191-1","title":"Learning Bayesian networks from data: An information-theory based approach","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":803,"is_retracted":false,"has_abstract":false,"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; Carnegie Mellon University; University of Washington","keywords":"Bayesian network; Computer science; Conditional independence; Machine learning; Artificial intelligence; Bayesian probability; Independence (probability theory); Variable-order Bayesian network; Data mining; Bayesian inference; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09874819574461036,"gpt":0.2791029661627809,"spread":0.1803547704181706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099904,0.0002054096,0.0001812016,0.000109836,0.0003314247,0.00071732,0.002327131,0.0001320882,0.000191215],"category_scores_gemma":[0.0001879919,0.0002050216,0.00004389922,0.0005119735,0.0001012371,0.003061542,0.0003040365,0.0004465013,0.0004080354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002412006,"about_ca_system_score_gemma":0.00003915205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001450084,"about_ca_topic_score_gemma":0.00001679648,"domain_scores_codex":[0.9979308,0.0002620078,0.0005009362,0.0005797857,0.0003204571,0.0004060351],"domain_scores_gemma":[0.9978563,0.0002489146,0.0001444764,0.001429976,0.0001190372,0.0002013603],"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.000007735311,0.0001007135,0.00004065937,0.000003347555,0.000008710183,0.000002894601,0.001137817,0.2197247,0.00002437962,0.1462506,0.0001418757,0.6325565],"study_design_scores_gemma":[0.0000177502,0.00007111989,0.00001801567,0.00001343082,0.000007153348,0.000002062553,0.0002063778,0.9675561,0.0003551639,0.03086028,0.0006331733,0.000259445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008167216,0.00007910019,0.9957353,0.0002295862,0.0003099444,0.0001102725,0.000008188528,0.0003776363,0.002333237],"genre_scores_gemma":[0.8958138,0.0000186177,0.103141,0.0006752023,0.0001704895,0.00001074624,0.0001192138,0.00001013882,0.00004080522],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8949971,"threshold_uncertainty_score":0.8360538,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079680557","doi":"10.1016/j.artint.2010.04.018","title":"Positive approximation: An accelerator for attribute reduction in rough set theory","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":652,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Rough set; Reduct; Reduction (mathematics); Heuristic; Attribute domain; Feature selection; Computer science; Set (abstract data type); Consistency (knowledge bases); Set theory; Data mining; Process (computing); Algorithm; Artificial intelligence; Feature (linguistics); Selection (genetic algorithm); Reduction strategy; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.08146691489297207,"gpt":0.3294955834650333,"spread":0.2480286685720612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009863079,0.0001332107,0.000137633,0.00009526542,0.0001806881,0.0001941029,0.0006437841,0.0001066812,0.00002709125],"category_scores_gemma":[0.0001342725,0.0001224825,0.00005123853,0.0004387513,0.00008418876,0.001021049,0.00008021743,0.0002197763,0.0000569652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002816703,"about_ca_system_score_gemma":0.00005783709,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004313851,"about_ca_topic_score_gemma":0.00009817699,"domain_scores_codex":[0.998666,0.0001019185,0.0003292823,0.0004564151,0.0001488459,0.0002975566],"domain_scores_gemma":[0.9990788,0.0001532083,0.00008992637,0.0004507327,0.0001468252,0.00008057262],"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.00003269155,0.0001148191,0.00003486034,0.000004102375,0.000003788422,0.000003043345,0.002351079,0.000310214,0.005336646,0.7751657,0.00004155303,0.2166015],"study_design_scores_gemma":[0.00004161826,0.0002369544,0.0005874944,0.00001062224,0.000004690536,0.00001841677,0.0005948915,0.136322,0.1444223,0.7170666,0.0003996147,0.0002948134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1341799,0.00001514041,0.8626994,0.000976928,0.001103296,0.0004362616,0.00001488552,0.00009800454,0.0004761372],"genre_scores_gemma":[0.9489469,0.00000381554,0.05045161,0.0001713346,0.0003042993,0.00007153168,0.00002356131,0.000008209262,0.000018756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8147669,"threshold_uncertainty_score":0.4994693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141088850","doi":"10.1016/s0004-3702(99)00071-5","title":"Using temporal logics to express search control knowledge for planning","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":556,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; University of Toronto","funders":"","keywords":"Computer science; Forward chaining; Domain (mathematical analysis); Domain knowledge; Planner; Automated planning and scheduling; Plan (archaeology); Control (management); Artificial intelligence; Range (aeronautics); Modularity (biology); Theoretical computer science; Machine learning; Expert system; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2188542455742783,"gpt":0.3932797970025497,"spread":0.1744255514282714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800703,0.0001826951,0.0002120462,0.0001241639,0.0004269026,0.0002865926,0.0008665408,0.00009039648,0.00007563254],"category_scores_gemma":[0.00008396434,0.0001807006,0.00007999114,0.0004508841,0.0000506827,0.0002937247,0.0000816348,0.0001801494,0.0002676731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004790725,"about_ca_system_score_gemma":0.0001207696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001169535,"about_ca_topic_score_gemma":0.00001024556,"domain_scores_codex":[0.998219,0.0001034469,0.0003861293,0.0005124293,0.0001989091,0.0005800568],"domain_scores_gemma":[0.9987136,0.0004889029,0.00004841445,0.0004049713,0.0001504273,0.000193685],"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.0001628974,0.0001277288,0.001037557,0.00003695842,0.00002304614,0.00002819526,0.008645399,0.5621808,0.005504815,0.03033849,0.0007157386,0.3911984],"study_design_scores_gemma":[0.00004758646,0.0002084196,0.00002459216,0.0001054921,0.000006664851,0.000008261299,0.000149753,0.9616513,0.02247983,0.009198193,0.005814473,0.0003054321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04408639,0.0001876956,0.953585,0.0003809789,0.0002922266,0.0003963502,0.00001128664,0.0001726328,0.0008874675],"genre_scores_gemma":[0.8532366,0.000001268971,0.1459043,0.000365493,0.0002087395,0.00002598283,0.000003280173,0.00001402186,0.0002403031],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8091503,"threshold_uncertainty_score":0.7368757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062205093","doi":"10.1016/s0004-3702(00)00031-x","title":"ConGolog, a concurrent programming language based on the situation calculus","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":496,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Concurrency; Programming language; Computer science; Axiom; Rotation formalisms in three dimensions; Situation calculus; Process calculus; Semantics (computer science); Operational semantics; Pi calculus; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04249999969817588,"gpt":0.2945950837513873,"spread":0.2520950840532114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004602241,0.0001414918,0.0001152619,0.00004504739,0.0002474463,0.0002260654,0.0006977887,0.00005622669,0.000457622],"category_scores_gemma":[0.0001977483,0.00009506336,0.0000786523,0.0003953166,0.0001285374,0.0001318904,0.00004820349,0.0001712094,0.001423533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004014642,"about_ca_system_score_gemma":0.00006562571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009661425,"about_ca_topic_score_gemma":0.0001226708,"domain_scores_codex":[0.9987012,0.0001372632,0.0002406394,0.0003543532,0.0002466197,0.000319939],"domain_scores_gemma":[0.9989998,0.0003348567,0.00006269055,0.0004543365,0.00007269608,0.00007558332],"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.000006420127,0.0001049255,0.00002624244,0.000002537881,0.000003511132,0.00001099905,0.0025368,0.0005337514,0.0001794219,0.2289893,0.0001149634,0.7674912],"study_design_scores_gemma":[0.00003864379,0.0002685634,0.0001769674,0.00003710843,0.000008433713,0.000005670474,0.0004133317,0.9469504,0.03813849,0.005427385,0.008262656,0.0002723456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08359794,0.0001651913,0.8981801,0.002315505,0.0005928445,0.0005297983,0.000002064958,0.0003272445,0.01428932],"genre_scores_gemma":[0.9978868,0.000005648832,0.0009915842,0.0006736718,0.0001211618,0.00004861385,0.000003273624,0.000006366547,0.0002628267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9464167,"threshold_uncertainty_score":0.9993539,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109409153","doi":"10.1016/j.artint.2007.04.010","title":"The Carneades model of argument and burden of proof","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":395,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Argumentation theory; Burden of proof; Premise; Argument (complex analysis); Dialectic; Computer science; Persuasion; Proof of concept; Epistemology; Psychology; Social psychology; Law; Medicine; Philosophy; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.06968742521884552,"gpt":0.3039494755120507,"spread":0.2342620502932052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008135465,0.0000592804,0.00009343086,0.00003911876,0.00007776413,0.00002748123,0.0002988454,0.00002923534,0.000001393939],"category_scores_gemma":[0.00005031272,0.00004165277,0.00002859021,0.0001361141,0.00008650367,0.0001113487,0.00007882169,0.00004073786,0.000003020524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001069808,"about_ca_system_score_gemma":0.00002294715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002233852,"about_ca_topic_score_gemma":0.0001226251,"domain_scores_codex":[0.999105,0.00002431121,0.0003863462,0.0001457025,0.0002025681,0.0001360724],"domain_scores_gemma":[0.9993135,0.0001396946,0.0001591517,0.0002515051,0.0001019826,0.00003410866],"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.00001890608,0.00005367508,0.0002449321,0.00003768459,0.00001530437,7.892511e-7,0.008994219,0.01379715,0.08677007,0.564131,0.00002098815,0.3259152],"study_design_scores_gemma":[0.000007090296,0.00003275885,0.00009463742,0.00001483734,0.000002024855,6.169807e-7,0.0003040885,0.5126845,0.4734483,0.01333075,0.00004169803,0.00003870458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1799961,0.0002009346,0.8190691,0.0001891318,0.0001150059,0.0001510388,8.104669e-7,0.000009659434,0.0002681987],"genre_scores_gemma":[0.9955726,0.00002685295,0.004287656,0.000008768744,0.0000293298,0.000003035084,1.732108e-7,0.000002530829,0.00006905197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8155765,"threshold_uncertainty_score":0.1698551,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964281761","doi":"10.1016/j.artint.2013.10.003","title":"Algorithm runtime prediction: Methods & evaluation","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parameterized complexity; Generalization; Range (aeronautics); Algorithm; Variety (cybernetics); Machine learning; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08348968459179722,"gpt":0.3889034969418591,"spread":0.3054138123500618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001184904,0.0002127731,0.0001878255,0.0001866782,0.0002735624,0.0003213013,0.0007379566,0.000100397,0.001056012],"category_scores_gemma":[0.0006330753,0.0002125312,0.0000803121,0.0009723053,0.0001194554,0.001663271,0.0002261963,0.000201754,0.002801978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001784026,"about_ca_system_score_gemma":0.0001164241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008416187,"about_ca_topic_score_gemma":0.000009044423,"domain_scores_codex":[0.9974608,0.0003661382,0.0005443257,0.0006720205,0.0005770108,0.0003797175],"domain_scores_gemma":[0.9973858,0.0002582312,0.0001726527,0.0007593464,0.001265186,0.0001587749],"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.000001018361,0.00007014555,0.00000800626,0.000001503168,0.00001248437,6.297952e-7,0.0004829114,0.01903312,0.001320599,0.009583506,0.000145095,0.969341],"study_design_scores_gemma":[0.00002716182,0.0000367587,0.0001773276,0.000006955845,0.000008521979,0.0000107861,0.00007823665,0.8379694,0.02046714,0.1394547,0.001574186,0.0001888555],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009763319,0.0001127671,0.9948069,0.000794411,0.001333629,0.0007689967,0.000004485031,0.0003767938,0.001704357],"genre_scores_gemma":[0.006005083,0.00002228281,0.9926552,0.0003096788,0.0002083691,0.0002627957,0.00001407167,0.00001855101,0.0005040326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9691521,"threshold_uncertainty_score":0.9998572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997477668","doi":"10.1016/s0004-3702(00)00033-3","title":"Stochastic dynamic programming with factored representations","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":365,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Markov decision process; Computer science; Representation (politics); Dynamic programming; Generalization; Decision tree; State space; Computation; Influence diagram; Exploit; Stochastic programming; State (computer science); Dynamic Bayesian network; Dynamic decision-making; Mathematical optimization; Bayesian network; Theoretical computer science; Artificial intelligence; Markov process; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04257783472299416,"gpt":0.3077484925454908,"spread":0.2651706578224967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001287153,0.0001470922,0.0001234909,0.00006837487,0.0002100498,0.0002945182,0.0006321924,0.00004709756,0.0001587918],"category_scores_gemma":[0.00002918012,0.0001262671,0.00004078446,0.0005541858,0.0001151889,0.0004185124,0.00004387207,0.0001639479,0.000479123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002791105,"about_ca_system_score_gemma":0.000075064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001290058,"about_ca_topic_score_gemma":0.0001226236,"domain_scores_codex":[0.9986147,0.00004105796,0.0002754044,0.0004657032,0.0002590182,0.0003441499],"domain_scores_gemma":[0.9991296,0.0000842823,0.00005102249,0.0005195706,0.00009610877,0.0001194358],"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.00001369107,0.00007304455,0.00001672461,0.000002816869,0.000009571366,0.00001153538,0.001015788,0.02875926,0.0002262696,0.05607498,0.000008744263,0.9137876],"study_design_scores_gemma":[0.00002331899,0.0001861238,0.0001725001,0.00004329152,0.0000101789,0.00003213372,0.0002058398,0.9336369,0.002686636,0.06252094,0.000157263,0.0003248836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03201635,0.0000349957,0.9660396,0.0005613202,0.00008745508,0.000173135,0.000001534468,0.0002879844,0.0007976373],"genre_scores_gemma":[0.9481677,0.000006277146,0.05137221,0.00008773051,0.00002537235,0.00003403551,0.000003422335,0.00000986024,0.0002933305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9161514,"threshold_uncertainty_score":0.6158317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070368455","doi":"10.1016/s0004-3702(02)00365-x","title":"Knowledge, action, and the frame problem","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":276,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Action (physics); Computer science; GRASP; Frame (networking); Frame problem; Knowledge representation and reasoning; Artificial intelligence; Object (grammar); Affect (linguistics); Successor cardinal; Cognitive science; Knowledge management; Mathematics; Programming language; Psychology; Communication","retraction":null,"screen_n_in":null,"score":{"opus":0.06070968582728412,"gpt":0.3073802869727568,"spread":0.2466706011454727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007901231,0.0001378017,0.0001487994,0.00005083952,0.0003554943,0.0002804772,0.0005425801,0.00006820034,0.00005116957],"category_scores_gemma":[0.0003544445,0.00008957816,0.00005890813,0.0004637805,0.0003151837,0.0002802049,0.0001272369,0.0001916131,0.0005470905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002124241,"about_ca_system_score_gemma":0.00008214718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003500573,"about_ca_topic_score_gemma":0.0001375377,"domain_scores_codex":[0.9987569,0.0002007963,0.0002614121,0.0003625982,0.0001308585,0.0002874264],"domain_scores_gemma":[0.9989159,0.0003603835,0.00007439051,0.0004179459,0.0001432332,0.0000882191],"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.000005608028,0.00004860659,0.00007262434,0.000005156349,0.000006758592,0.000001257147,0.002547898,0.00001310424,0.0001164204,0.9068983,0.0002801461,0.09000407],"study_design_scores_gemma":[0.00006394892,0.00005873701,0.00007871917,0.00001525475,0.00000938523,0.0000362045,0.0004008251,0.02371877,0.02668262,0.9072629,0.04144915,0.0002235058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003266797,0.001336011,0.9192292,0.0008510193,0.0007617224,0.0002673501,2.820621e-7,0.0001483311,0.07413927],"genre_scores_gemma":[0.9916534,0.000131566,0.006848569,0.0001855467,0.0001001669,0.00003133971,2.171239e-7,0.000007079922,0.001042138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9883866,"threshold_uncertainty_score":0.7031925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101861158","doi":"10.1016/s0004-3702(01)00130-8","title":"The challenge of poker","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":271,"is_retracted":false,"has_abstract":false,"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":"Computer science; Exploit; Construct (python library); Deception; Artificial intelligence; Probabilistic logic; Adversary; Class (philosophy); Perfect information; Machine learning; Task (project management); Computer security; Engineering; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.100451595296851,"gpt":0.3046174899691713,"spread":0.2041658946723203,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005815466,0.0001789416,0.0001896646,0.0000851409,0.0003642337,0.0001728118,0.002130489,0.00008138403,0.0002667081],"category_scores_gemma":[0.0003224119,0.000130444,0.0001346629,0.0006495375,0.0004617577,0.0004077732,0.000309619,0.000214462,0.001466701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002866025,"about_ca_system_score_gemma":0.00002115032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007655875,"about_ca_topic_score_gemma":0.0001314985,"domain_scores_codex":[0.9978036,0.0001016634,0.0007348367,0.0004232253,0.000463569,0.0004731255],"domain_scores_gemma":[0.9976128,0.0006851865,0.0002079866,0.001154828,0.0002380208,0.0001011868],"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.000002633477,0.00006737241,0.0000100918,0.000002348033,0.000007747047,0.000004002032,0.001448611,0.0001753022,0.0004223652,0.5897261,0.000230224,0.4079033],"study_design_scores_gemma":[0.000006001456,0.0001650641,0.00001773881,0.0000198909,0.000005129044,0.000005694927,0.0005142293,0.1200536,0.1651384,0.704482,0.009353995,0.0002382576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005037296,0.002131496,0.950096,0.01332469,0.001503078,0.0003233779,0.000002065084,0.0002414725,0.02734058],"genre_scores_gemma":[0.9946568,0.0005837333,0.003991951,0.0001332822,0.000126406,0.00002073285,1.758451e-7,0.00001228201,0.0004746542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9896195,"threshold_uncertainty_score":0.9993108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994685255","doi":"10.1016/s0004-3702(01)00152-7","title":"Games solved: Now and in the future","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":253,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Exploit; State (computer science); Space (punctuation); State space; Domain (mathematical analysis); Combinatorial game theory; Brute force; Game complexity; Game theory; Sequential game; Computational complexity theory; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Mathematical economics; Worst-case complexity; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.05601123108821538,"gpt":0.288640933092087,"spread":0.2326297020038717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006563566,0.0002206578,0.0001925263,0.0001601799,0.0002198438,0.0004433803,0.001609325,0.0001089299,0.0001573961],"category_scores_gemma":[0.0001233177,0.0001641922,0.00006768054,0.0009067923,0.0002790058,0.0006450514,0.000220306,0.0003632396,0.0008813222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002777685,"about_ca_system_score_gemma":0.00001605931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004187228,"about_ca_topic_score_gemma":0.001195606,"domain_scores_codex":[0.9978709,0.0001620786,0.0005083233,0.0005622673,0.0003969125,0.0004995533],"domain_scores_gemma":[0.9985563,0.0004095238,0.00009404228,0.000778372,0.00007426018,0.00008751871],"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.00000682551,0.000165485,0.0009766718,0.000007467623,0.000006031364,0.00006455004,0.008065276,0.0002295595,0.0004528014,0.2878086,0.001613179,0.7006036],"study_design_scores_gemma":[0.00002946287,0.0002462987,0.002156415,0.00006065955,0.00001220831,0.0001360575,0.008764655,0.4709544,0.04161439,0.4342968,0.04085386,0.0008747182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2202587,0.006603092,0.6940303,0.06412666,0.0027986,0.001088482,0.000004917239,0.000480515,0.0106088],"genre_scores_gemma":[0.9921971,0.0006120502,0.005134101,0.001503475,0.0003644145,0.000036144,4.380273e-7,0.00001105728,0.0001412447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7719384,"threshold_uncertainty_score":0.9998966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977070092","doi":"10.1016/s0004-3702(02)00378-8","title":"On the undecidability of probabilistic planning and related stochastic optimization problems","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":241,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Alberta","funders":"","keywords":"Undecidable problem; Probabilistic logic; Markov decision process; Computer science; Partially observable Markov decision process; Markov chain; Class (philosophy); Mathematical optimization; State (computer science); Decision problem; Mathematics; Markov process; Artificial intelligence; Theoretical computer science; Decidability; Markov model; Algorithm; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.05360566751266353,"gpt":0.2694234057961437,"spread":0.2158177382834802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065946,0.0001193153,0.0001280857,0.00006019153,0.0002147254,0.00008505073,0.0003097351,0.00006080426,0.00003780094],"category_scores_gemma":[0.00137552,0.00008780354,0.00002948837,0.0004467982,0.0001522645,0.0001337454,0.00004715837,0.0001843467,0.0000126646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002439322,"about_ca_system_score_gemma":0.0000655177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001699008,"about_ca_topic_score_gemma":0.000002738314,"domain_scores_codex":[0.9987026,0.0002000484,0.0003784761,0.0003230828,0.0001948612,0.0002009606],"domain_scores_gemma":[0.9979774,0.001348518,0.0001490435,0.0003766626,0.00009677036,0.00005165335],"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.000003883408,0.00002523405,0.00005924074,0.000009003177,0.000004012402,7.26627e-7,0.0007607871,0.5743716,0.00004171914,0.423344,0.000005462266,0.001374272],"study_design_scores_gemma":[0.00001128562,0.0001143984,0.00003417648,0.00008647182,0.00000444626,0.000005194679,0.00007623654,0.6151718,0.001432207,0.382975,0.00000398459,0.00008479357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02582436,0.0001116652,0.9720697,0.0003974023,0.0001558374,0.0003288565,0.000001109285,0.00006455543,0.00104655],"genre_scores_gemma":[0.9900802,0.000001200576,0.009817971,0.00005219369,0.000005387605,0.00001736902,0.000001040883,0.000006216857,0.00001840748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9642559,"threshold_uncertainty_score":0.3580525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913781869","doi":"10.1016/j.artint.2019.103216","title":"The Hanabi challenge: A new frontier for AI research","year":2019,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada)","funders":"","keywords":"Computer science; Domain (mathematical analysis); Imperfect; Artificial intelligence; Frontier; Perfect information; State (computer science); Cognitive science; Data science; Human–computer interaction; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1628522236355365,"gpt":0.4126734209769778,"spread":0.2498211973414413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002765794,0.000253343,0.000262685,0.000196698,0.0008912323,0.0009740415,0.003472166,0.0001591959,0.000123467],"category_scores_gemma":[0.0009832397,0.0001946937,0.0001948225,0.0009770301,0.0003808465,0.0007468685,0.0005891784,0.0005724311,0.004550911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001242969,"about_ca_system_score_gemma":0.0004391061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003982185,"about_ca_topic_score_gemma":0.0007186105,"domain_scores_codex":[0.9960883,0.0002253092,0.0007192388,0.000915184,0.0008693484,0.001182573],"domain_scores_gemma":[0.9951604,0.001989497,0.0001276239,0.001693155,0.0007774605,0.0002518506],"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.00003150698,0.00004253442,0.00002560789,0.000005404961,0.00001288802,0.000002306102,0.001264079,0.0002442219,0.0004088903,0.572634,0.007207241,0.4181213],"study_design_scores_gemma":[0.00001535025,0.0003210878,0.0000125952,0.00002486476,0.000003441431,0.00000326619,0.001098072,0.1147192,0.05819198,0.6767836,0.1485765,0.0002500766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00263411,0.0009457857,0.9543387,0.03294761,0.002969794,0.001383758,0.000002450182,0.000210242,0.004567596],"genre_scores_gemma":[0.9664052,0.0002411984,0.01938433,0.0007999935,0.000939672,0.0002081724,0.00000205841,0.00005163611,0.0119678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.963771,"threshold_uncertainty_score":0.9962242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1471542436","doi":"10.1016/j.artint.2016.04.003","title":"ASlib: A benchmark library for algorithm selection","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":213,"is_retracted":false,"has_abstract":false,"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; Microsoft","keywords":"Computer science; Selection (genetic algorithm); Benchmark (surveying); Exploit; Task (project management); Set (abstract data type); Variety (cybernetics); Data mining; Selection algorithm; Range (aeronautics); Algorithm; Machine learning; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03557090669313157,"gpt":0.2896685730587838,"spread":0.2540976663656522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002515002,0.0001031763,0.00008998041,0.00009371611,0.0001673865,0.0001752378,0.0005738222,0.00005737556,0.00009852841],"category_scores_gemma":[0.0001813281,0.00007481756,0.00005431535,0.0003639259,0.000041376,0.001015928,0.00009440875,0.00006722178,0.0003174016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001947534,"about_ca_system_score_gemma":0.00006029993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001304582,"about_ca_topic_score_gemma":0.000006431769,"domain_scores_codex":[0.9989007,0.00005807035,0.0002506633,0.0004095168,0.0001397089,0.0002413086],"domain_scores_gemma":[0.9991292,0.0003036216,0.00008939322,0.0003409073,0.00005987201,0.00007701524],"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.000005419018,0.00001888919,0.0001010307,0.000002392183,0.000003092917,3.635946e-7,0.00005350524,0.000005301852,0.002409447,0.2513175,0.001362617,0.7447205],"study_design_scores_gemma":[0.00004508579,0.0002651616,0.0006474656,0.00003848242,0.000006659929,0.00001069785,0.00003085025,0.3954738,0.1803393,0.2778217,0.1449877,0.0003330878],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004473719,0.00002938727,0.9918479,0.005884524,0.0003681216,0.0001658798,0.00001370161,0.0004050903,0.0008379957],"genre_scores_gemma":[0.5623511,0.000055587,0.4345994,0.0004863816,0.0005113457,0.0001101284,0.00003027309,0.00002565991,0.001830121],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7443874,"threshold_uncertainty_score":0.4079662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978078764","doi":"10.1016/j.artint.2006.05.003","title":"Generating and evaluating evaluative arguments","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Speech and dialogue systems","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Argumentation theory; Argument (complex analysis); Computer science; Process (computing); Computational linguistics; Test (biology); Natural (archaeology); Computational model; Natural language; Artificial intelligence; Natural language generation; Selection (genetic algorithm); Management science; Psychology; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.08029450825717041,"gpt":0.3471274194884037,"spread":0.2668329112312333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000927122,0.0001286998,0.0001328063,0.00007371054,0.0002390492,0.0002892721,0.0003263114,0.00004521676,0.00002016137],"category_scores_gemma":[0.0002071317,0.0001209483,0.00003381617,0.0002990687,0.00005967163,0.0003447075,0.0001452578,0.00008288884,0.0001905016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003508128,"about_ca_system_score_gemma":0.00005747499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004598313,"about_ca_topic_score_gemma":0.0001138814,"domain_scores_codex":[0.9983996,0.0001424714,0.0003850263,0.0004117101,0.0003684509,0.000292726],"domain_scores_gemma":[0.9992285,0.0001630954,0.0001142038,0.0002886542,0.0001393128,0.00006620207],"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.00001110821,0.00008178495,0.0008602143,0.00001158971,0.00001315747,0.00001457136,0.00124628,0.005625843,0.09426244,0.3060574,0.0002170078,0.5915986],"study_design_scores_gemma":[0.00003074382,0.0001278134,0.000573109,0.00002159412,0.000005502135,0.00001256846,0.0001525392,0.7222403,0.1102535,0.1663069,0.00007020021,0.0002052065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3477447,0.0002701132,0.6484743,0.0002188122,0.0005083913,0.0002209679,0.000001291973,0.0001082742,0.002453182],"genre_scores_gemma":[0.9436316,0.00000258421,0.05583405,0.0001221414,0.0002773973,0.00002257292,0.000002606815,0.000006439644,0.000100584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7166144,"threshold_uncertainty_score":0.4932127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913764096","doi":"10.1016/s0004-3702(01)00121-7","title":"Computer Go","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":180,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Representation (politics); Artificial intelligence; Data science; Human–computer interaction; Management science; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0945553412646733,"gpt":0.3002023316696072,"spread":0.2056469904049339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003454274,0.0002784473,0.0002511888,0.0001926283,0.0002840432,0.0004307094,0.002011514,0.0001214643,0.001093733],"category_scores_gemma":[0.0001226404,0.0002731487,0.0001528206,0.000929493,0.0002832101,0.0008968255,0.0004248821,0.0002845253,0.01780146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006135398,"about_ca_system_score_gemma":0.00001957817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000479636,"about_ca_topic_score_gemma":0.00003879013,"domain_scores_codex":[0.9972997,0.0001002809,0.0006889181,0.0007587783,0.0004824606,0.0006699185],"domain_scores_gemma":[0.9980785,0.0002885909,0.0001361903,0.001089001,0.0001871434,0.000220582],"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.000001782442,0.000115467,0.00005219465,0.000002914472,0.000008481426,0.00003031975,0.001045961,0.0008307474,0.0004209525,0.4114733,0.00243738,0.5835806],"study_design_scores_gemma":[0.000007466982,0.0001441305,0.00003638755,0.00001797616,0.00000460797,0.00003180769,0.00007459451,0.7747851,0.07367004,0.1383178,0.01249804,0.0004120765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004395775,0.0002163029,0.9793222,0.003070298,0.001638596,0.0002103353,0.000001594869,0.0006073275,0.01053757],"genre_scores_gemma":[0.922681,0.00006762069,0.07469707,0.001246871,0.00050413,0.0000242231,8.96572e-7,0.00002243321,0.0007557137],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9182853,"threshold_uncertainty_score":0.999972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519196800","doi":"10.1016/s0004-3702(02)00209-6","title":"Learning cost-sensitive active classifiers☆☆This extends the short conference paper [19].","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":164,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Machine learning; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.0815979204633624,"gpt":0.3055369991129953,"spread":0.2239390786496329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000567401,0.0002726226,0.0002363999,0.00009913158,0.0008106562,0.0004300268,0.001088717,0.0001126614,0.0009394268],"category_scores_gemma":[0.0005289872,0.0002050944,0.0001293666,0.0006568098,0.0003432813,0.0005659686,0.0003044081,0.001012352,0.001338886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006664373,"about_ca_system_score_gemma":0.00004871639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002439927,"about_ca_topic_score_gemma":0.00006124699,"domain_scores_codex":[0.9974682,0.0003959344,0.0003879243,0.0006903132,0.0004829713,0.00057468],"domain_scores_gemma":[0.9982096,0.0006073795,0.0001206509,0.0006257695,0.0002437025,0.0001929279],"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.000009237981,0.00006067799,0.0000711493,0.00000260585,0.00002210851,0.00004333413,0.006772919,0.001478774,0.0008297494,0.07999275,0.0006167981,0.9100999],"study_design_scores_gemma":[0.00002450529,0.0002144511,0.0003626425,0.00002945295,0.00001489091,0.00005551875,0.00204995,0.9418425,0.01747693,0.007669316,0.02982787,0.0004319684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005762571,0.0001306219,0.9348206,0.009754586,0.0009635849,0.0003894438,0.00000398019,0.0004653013,0.04770934],"genre_scores_gemma":[0.9926005,0.0001153051,0.002716369,0.00103137,0.0002526861,0.00003818273,0.000002847406,0.00001762943,0.003225112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9868379,"threshold_uncertainty_score":0.9999738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145996207","doi":"10.1016/j.artint.2006.02.003","title":"Constraint-based optimization and utility elicitation using the minimax decision criterion","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; University of Waterloo; University of Toronto","funders":"","keywords":"Regret; Minimax; Computer science; Mathematical optimization; Preference elicitation; Exploit; Set (abstract data type); Constraint (computer-aided design); Function (biology); Preference; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04697374374933979,"gpt":0.3001038880978434,"spread":0.2531301443485036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003799741,0.0001163784,0.0000918544,0.0001039604,0.0003494831,0.0003023098,0.0001943976,0.00006035927,0.00007635585],"category_scores_gemma":[0.0001272355,0.00009785039,0.00003791524,0.0004160394,0.000225807,0.0004285803,0.00004676208,0.00008384424,0.000008499415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003472082,"about_ca_system_score_gemma":0.00006944623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001596411,"about_ca_topic_score_gemma":0.0001018215,"domain_scores_codex":[0.9988384,0.0000928186,0.0003739248,0.0003126227,0.0002172389,0.0001649657],"domain_scores_gemma":[0.9991047,0.0002943814,0.0001179375,0.0002618068,0.000179823,0.00004132939],"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.00001635119,0.0000437549,0.0006868857,0.00000486298,0.000002534964,0.000002068257,0.0002064427,0.4560592,0.002199073,0.05856085,0.0000254329,0.4821925],"study_design_scores_gemma":[0.00002763626,0.00002122821,0.0009486803,0.00001635043,0.000005651892,0.000009067332,0.0001273572,0.9742193,0.01122184,0.01323608,0.00005780737,0.0001090174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04211002,0.00003750501,0.9562141,0.0008598503,0.0002727958,0.0001959406,0.000002712527,0.00008873617,0.0002183162],"genre_scores_gemma":[0.7805293,0.00000586517,0.2192339,0.0001784535,0.00003522352,0.000004094633,0.000005361921,0.000004388748,0.000003458746],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7384193,"threshold_uncertainty_score":0.3990223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295870642","doi":"10.1016/j.artint.2015.06.003","title":"Optimal social choice functions: A utilitarian view","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":144,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Social choice theory; Maximization; Social welfare function; Context (archaeology); Class (philosophy); Probabilistic logic; Social Welfare; Computer science; Mathematical economics; Mathematics; Mathematical optimization; Artificial intelligence; Welfare; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2206779366908321,"gpt":0.3080420153050835,"spread":0.08736407861425138,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001356774,0.000145201,0.0003006422,0.0001165259,0.0002057166,0.0001030564,0.0002696148,0.0001064291,0.0005144987],"category_scores_gemma":[0.0005531057,0.0001700107,0.0001119536,0.0003548049,0.0001198874,0.0002301931,0.00005427877,0.0001716284,0.009844102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008108933,"about_ca_system_score_gemma":0.00003160827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005783389,"about_ca_topic_score_gemma":0.00008364506,"domain_scores_codex":[0.9984944,0.00005090908,0.0006992652,0.0003799017,0.0000523079,0.0003232344],"domain_scores_gemma":[0.9992591,0.00009068112,0.0002028891,0.0002487309,0.00007101676,0.0001275879],"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.00003424596,0.0001126999,0.001889516,0.00001540995,0.0000286609,0.000002982816,0.002523348,0.0003810175,0.00001397755,0.9826269,0.001213312,0.01115799],"study_design_scores_gemma":[0.0001362774,0.0003310186,0.001500884,0.00004551521,0.00002030745,0.00001882234,0.005783486,0.01609632,0.0007341877,0.6054857,0.3689836,0.0008637847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6147351,0.003530668,0.255878,0.003189006,0.0057774,0.0006894582,0.0001530311,0.000416628,0.1156306],"genre_scores_gemma":[0.9970292,0.000005862305,0.0003713965,0.0001727806,0.000670924,0.00002794609,0.000008466373,0.0000191055,0.001694341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3822941,"threshold_uncertainty_score":0.9909269,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1863869622","doi":"10.1016/s0004-3702(01)00166-7","title":"World-championship-caliber Scrabble☆☆SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the USA by Hasbro Inc., in Canada by Hasbro Canada Corporation, and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc.","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Championship; Corporation; Intellectual property; Computer science; Operations research; Advertising; Engineering; Business; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.08528845174103022,"gpt":0.2779775682452863,"spread":0.1926891165042561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001484654,0.0004334274,0.0006228986,0.0002418797,0.0002542924,0.0001718928,0.002243144,0.0001140132,0.00007629303],"category_scores_gemma":[0.0008802172,0.0002279485,0.00006217267,0.002810688,0.0008260583,0.0003746612,0.0004156235,0.0007752719,0.00000751165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003077584,"about_ca_system_score_gemma":0.0005633758,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.9640157,"about_ca_topic_score_gemma":0.9996327,"domain_scores_codex":[0.9947277,0.001094377,0.001753791,0.0007747891,0.0009791916,0.0006701743],"domain_scores_gemma":[0.9949433,0.002656589,0.0006960008,0.001344992,0.0002154819,0.0001436014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00102541,0.001597646,0.1834137,0.0002704209,0.0002162086,0.00009652704,0.184902,0.002771493,0.01145841,0.009207872,0.5683075,0.03673275],"study_design_scores_gemma":[0.0010422,0.0006955852,0.04588496,0.002845495,0.0001708626,0.0001407729,0.0305744,0.1762767,0.3934809,0.03190029,0.3132114,0.003776493],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9489109,0.001089157,0.002722859,0.0444956,0.0003182585,0.001891026,0.0002759569,0.00001533816,0.0002809327],"genre_scores_gemma":[0.9961819,0.0001370419,0.0001931158,0.002598599,0.00003397443,0.00008357159,0.00001053472,0.00002260732,0.0007386657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3820225,"threshold_uncertainty_score":0.9295469,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971508608","doi":"10.1016/j.artint.2004.11.004","title":"Partition-based logical reasoning for first-order and propositional theories","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Soundness; Axiom; Computer science; Theoretical computer science; Completeness (order theory); Propositional calculus; Propositional formula; Automated reasoning; Satisfiability; Propositional variable; Mathematics; Algorithm; Description logic; Intermediate logic; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0351189575418359,"gpt":0.2849085808585126,"spread":0.2497896233166767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064404,0.0001432666,0.0001361565,0.00005013764,0.0004709354,0.0002335074,0.0003219577,0.00007517128,0.00003677664],"category_scores_gemma":[0.0003942029,0.0001182486,0.00006047268,0.0002658741,0.0002369781,0.0002694794,0.00007585249,0.00009380431,0.00007021648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004120724,"about_ca_system_score_gemma":0.0001344518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000251138,"about_ca_topic_score_gemma":0.0001169535,"domain_scores_codex":[0.9988458,0.00002995745,0.0002377821,0.0004134126,0.0001665758,0.0003065345],"domain_scores_gemma":[0.9990992,0.0002918594,0.00006581628,0.0002192451,0.0002208805,0.0001030059],"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.00002322636,0.0001103356,0.0001629362,0.00001244197,0.000005514824,0.000005127655,0.0005507009,0.0021038,0.0001552803,0.9871186,0.00002445314,0.009727564],"study_design_scores_gemma":[0.00006900971,0.0002635277,0.0002489824,0.000046166,0.000007188963,0.0000111712,0.00007792222,0.07026698,0.03075523,0.897495,0.0005452987,0.0002135485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01115305,0.0001588544,0.984601,0.002375712,0.0002605132,0.0002676199,0.000004590949,0.0001417889,0.001036864],"genre_scores_gemma":[0.9314735,0.00000925173,0.06788866,0.0003486792,0.0001501712,0.00008710659,0.000006935243,0.000006858597,0.00002885925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9203205,"threshold_uncertainty_score":0.4822039,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039987681","doi":"10.1016/j.artint.2014.03.007","title":"On our best behaviour","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Clearance; Computer science; Epistemology; Context (archaeology); Cognitive science; Artificial intelligence; Artificial general intelligence; Psychology; Data science; Philosophy; History","retraction":null,"screen_n_in":null,"score":{"opus":0.05246896499110883,"gpt":0.3039279630235122,"spread":0.2514589980324033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003965579,0.000163768,0.0001530674,0.0000886005,0.0001978498,0.000208507,0.001017985,0.00007922139,0.00003631191],"category_scores_gemma":[0.0002958544,0.0001422285,0.00008521682,0.0003175166,0.00003927807,0.0002145413,0.0001693942,0.0001817276,0.005757063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003075236,"about_ca_system_score_gemma":0.00003599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007594478,"about_ca_topic_score_gemma":0.00008904487,"domain_scores_codex":[0.9986047,0.00008202311,0.0002634475,0.0004682058,0.0002122325,0.0003693829],"domain_scores_gemma":[0.9989179,0.0001268007,0.00007599498,0.0006302624,0.000105211,0.0001438802],"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.000003905186,0.0001471134,0.0002417523,0.000001969928,0.000002594844,0.000004923684,0.0003958633,0.0001094728,0.0002308815,0.8130439,0.0005151495,0.1853025],"study_design_scores_gemma":[0.00005477064,0.001212725,0.0009235966,0.00007005421,0.00001808184,0.00002555242,0.0004330256,0.1305547,0.1314179,0.7271287,0.007318646,0.0008422564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04309573,0.00003599436,0.9231673,0.0009529438,0.001536251,0.0001213176,9.062776e-7,0.0002275796,0.03086195],"genre_scores_gemma":[0.9951158,0.000006139389,0.003376288,0.0004036054,0.000269268,0.00001159158,0.000001006699,0.000009870496,0.0008064462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.95202,"threshold_uncertainty_score":0.9950171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971439026","doi":"10.1016/s0004-3702(01)00109-6","title":"Sokoban: Enhancing general single-agent search methods using domain knowledge","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Exploit; Computer science; Domain (mathematical analysis); Search algorithm; Domain knowledge; Artificial intelligence; Machine learning; Genetic programming; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1859338231043957,"gpt":0.4076501574258188,"spread":0.2217163343214231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00231115,0.0002656519,0.0002731626,0.0002357477,0.0005470171,0.0004214053,0.001045372,0.0001285879,0.00009511221],"category_scores_gemma":[0.0001347584,0.0002682488,0.0001250236,0.001123805,0.0001118381,0.0004702348,0.0003868607,0.0003568735,0.0003327486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001939415,"about_ca_system_score_gemma":0.0002048133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000269073,"about_ca_topic_score_gemma":0.000108016,"domain_scores_codex":[0.9969739,0.0005726987,0.0006120668,0.0007066926,0.0003220712,0.0008126177],"domain_scores_gemma":[0.9983186,0.0004808255,0.0001162183,0.000663203,0.0001905555,0.0002306474],"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.0000225658,0.0002141911,0.0002893782,0.00002608001,0.00002968866,0.0001064192,0.007415156,0.02138928,0.2603466,0.07931235,0.00009348032,0.6307548],"study_design_scores_gemma":[0.00002164263,0.0001169516,0.00001772218,0.00008551352,0.000008388375,0.00007282623,0.0002974916,0.5625128,0.4034798,0.02899559,0.004007576,0.0003837097],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1083106,0.0005781307,0.8874222,0.0004438768,0.00090764,0.0001572417,0.000001055201,0.0002254973,0.001953776],"genre_scores_gemma":[0.466241,0.00001198438,0.5330067,0.0001557669,0.0003219796,0.000006442948,0.000002048762,0.00001857201,0.0002354312],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6303712,"threshold_uncertainty_score":0.999977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3187649900","doi":"10.1016/j.artint.2021.103574","title":"Pairwise symmetry reasoning for multi-agent path finding search","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pairwise comparison; Scalability; Bounded function; Computer science; Variety (cybernetics); Context (archaeology); Homogeneous space; Theoretical computer science; Node (physics); Path (computing); Symmetry (geometry); Combinatorial explosion; Combinatorial search; Algorithm; Mathematics; Search algorithm; Artificial intelligence; Combinatorics; Beam search; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1819009405321721,"gpt":0.3722673903453196,"spread":0.1903664498131475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009542813,0.000195618,0.0002296825,0.0001203615,0.0003682233,0.0003401921,0.0008321822,0.00009926865,0.00002023731],"category_scores_gemma":[0.0009166424,0.0002064538,0.0001338612,0.0007902639,0.00006173679,0.0003181955,0.0003512213,0.0002476175,0.0002539151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001002685,"about_ca_system_score_gemma":0.000229082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004465256,"about_ca_topic_score_gemma":0.000007047141,"domain_scores_codex":[0.9976305,0.0001389028,0.0004436033,0.0007489939,0.0003873965,0.0006505778],"domain_scores_gemma":[0.9982713,0.0004505417,0.00009013442,0.0006938155,0.0003042376,0.0001899077],"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.0000175494,0.0004344759,0.001621929,0.00008214155,0.00006461637,0.0005525146,0.005365774,0.02025989,0.008251363,0.3008036,0.0005013739,0.6620448],"study_design_scores_gemma":[0.00003597705,0.00006493938,0.0002947971,0.00009679991,0.000007304865,0.0000339792,0.0005156669,0.8733076,0.1215825,0.0035318,0.0002761421,0.0002525249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008395867,0.0002767456,0.9890167,0.0005005398,0.001158528,0.0002348581,0.000008468245,0.0002173353,0.000191002],"genre_scores_gemma":[0.2900825,0.00001627395,0.7091469,0.0002082074,0.0001602142,0.00003360232,0.00000915397,0.00001809436,0.000325082],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8530477,"threshold_uncertainty_score":0.8418943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984853564","doi":"10.1016/s0004-3702(01)00151-5","title":"Local search characteristics of incomplete SAT procedures","year":2001,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Weighting; Local search (optimization); Descent (aeronautics); Computer science; Mathematical optimization; Linear search; Mathematics; Algorithm; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05189737654584579,"gpt":0.2973862910330178,"spread":0.2454889144871721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001883961,0.00008786216,0.0001230636,0.0001085497,0.00008542923,0.00006629685,0.0003619337,0.00004344547,0.0001586185],"category_scores_gemma":[0.00009104061,0.00008724732,0.00004109109,0.0004676417,0.0001584132,0.000237102,0.0001003477,0.00009530167,0.0001687763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002591616,"about_ca_system_score_gemma":0.0001037994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005286291,"about_ca_topic_score_gemma":0.00008575604,"domain_scores_codex":[0.9989676,0.00004008409,0.0003496692,0.0002235099,0.0002313965,0.0001877731],"domain_scores_gemma":[0.9993275,0.00008068798,0.00007876271,0.0002564258,0.0001868955,0.00006976198],"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.00001739539,0.00005878888,0.003964273,0.00001451618,0.000006502678,0.000009593444,0.0006018879,0.002663611,0.002330594,0.1814992,0.00002012699,0.8088135],"study_design_scores_gemma":[0.00003693921,0.0001749712,0.03147284,0.00006165062,0.000007316013,0.00007438603,0.0004710605,0.873495,0.07085121,0.0222414,0.000764386,0.0003488098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05780605,0.00001091671,0.9404442,0.0007069555,0.0001944858,0.000101238,0.000002479107,0.00007244054,0.0006612394],"genre_scores_gemma":[0.9889168,0.00004196765,0.0108244,0.0001294394,0.00003765797,0.000003557601,0.000003785309,0.000004809631,0.0000376481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9311107,"threshold_uncertainty_score":0.3557843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985813166","doi":"10.1016/s0004-3702(02)00361-2","title":"Approximate inference in Boltzmann machines","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Belief propagation; Boltzmann constant; Inference; Boltzmann machine; Mathematics; Applied mathematics; Energy (signal processing); Boltzmann distribution; Statistical physics; Order (exchange); Mathematical optimization; Physics; Quantum mechanics; Algorithm; Computer science; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.08489014672356088,"gpt":0.3214881698387175,"spread":0.2365980231151567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004090358,0.0001829501,0.0001839474,0.0002460994,0.00009533291,0.000180444,0.00130247,0.00007866979,0.0001038219],"category_scores_gemma":[0.0005055718,0.0001820224,0.00005371639,0.0009545133,0.00007916403,0.000418383,0.0003101831,0.000286656,0.0005101363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005050382,"about_ca_system_score_gemma":0.00001470595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002714321,"about_ca_topic_score_gemma":0.0003950034,"domain_scores_codex":[0.9982949,0.00008340986,0.0004477435,0.0005091917,0.0002506095,0.0004141851],"domain_scores_gemma":[0.9987686,0.0002968838,0.00009694506,0.0006877548,0.00007486792,0.00007500857],"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.000003583916,0.0001936209,0.002498191,0.0000123441,0.000003163578,0.00004803154,0.002808116,0.0006131789,0.002779621,0.2900946,0.0001483933,0.7007972],"study_design_scores_gemma":[0.000009530394,0.0000623563,0.0001896672,0.00003950902,0.00000124073,0.000008324891,0.00004211861,0.8127038,0.04102938,0.1453922,0.000266687,0.0002552496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03657854,0.0001708215,0.9544384,0.001058279,0.0004760947,0.0002164843,7.754959e-7,0.000653057,0.006407482],"genre_scores_gemma":[0.9570478,0.00004559886,0.04245543,0.0002316601,0.00004653596,0.00003480531,3.582179e-7,0.00001136011,0.0001265073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9204692,"threshold_uncertainty_score":0.7422659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158118484","doi":"10.1016/j.artint.2011.08.001","title":"Learning heuristic functions for large state spaces","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Bootstrapping (finance); Computer science; Process (computing); Mathematical optimization; Sequence (biology); Hyper-heuristic; Null-move heuristic; Set (abstract data type); State (computer science); Consistent heuristic; Algorithm; Mathematics; Incremental heuristic search; Artificial intelligence; Machine learning; Search algorithm; Beam search","retraction":null,"screen_n_in":null,"score":{"opus":0.08500217590443197,"gpt":0.2862445155951895,"spread":0.2012423396907575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558223,0.0001252299,0.000118478,0.00009099769,0.0004650623,0.0001523351,0.0004442078,0.00004335334,0.00007660942],"category_scores_gemma":[0.0002323649,0.0001227817,0.00006501489,0.0002943572,0.00003337911,0.0002852925,0.00009302125,0.0001842962,0.0004177672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001619461,"about_ca_system_score_gemma":0.00005413885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001094719,"about_ca_topic_score_gemma":0.00006243891,"domain_scores_codex":[0.9987867,0.00006101521,0.0002605595,0.0003499852,0.0001286553,0.000413048],"domain_scores_gemma":[0.9991273,0.0002916688,0.0000999226,0.000268696,0.0001192791,0.00009315954],"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.0001049284,0.0003061695,0.005141036,0.00006629466,0.0000613257,0.00003777775,0.02879848,0.008506713,0.001011301,0.5760999,0.001986995,0.3778791],"study_design_scores_gemma":[0.00005870625,0.0009328905,0.0004231152,0.00008366421,0.00002444813,0.00001288659,0.001460953,0.6960374,0.0345079,0.2415164,0.02428939,0.0006523678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00969482,0.00008545187,0.9874814,0.0001876958,0.0005601117,0.0001481605,0.000007509776,0.000274131,0.00156079],"genre_scores_gemma":[0.9624804,0.000006547982,0.03621656,0.0001081201,0.00006791179,0.00003080867,0.000005762988,0.00001132669,0.001072523],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9527856,"threshold_uncertainty_score":0.5369692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089730874","doi":"10.1016/j.artint.2008.11.003","title":"Practical solution techniques for first-order MDPs","year":2008,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Arity; Generality; Computer science; Markov decision process; Theoretical computer science; Probabilistic logic; Domain (mathematical analysis); Answer set programming; First-order logic; Domain theory; Mathematical optimization; Logic programming; Artificial intelligence; Markov process; Programming language; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1361000294054425,"gpt":0.349719729616963,"spread":0.2136197002115205,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044435,0.0001289972,0.0001269768,0.00007948294,0.000555497,0.00008616017,0.0004021752,0.00009913143,0.00002196184],"category_scores_gemma":[0.000455188,0.0001261315,0.00006297619,0.0003526666,0.00012474,0.0004658166,0.00009475487,0.0001653293,0.0001463954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003531975,"about_ca_system_score_gemma":0.0001310698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007459019,"about_ca_topic_score_gemma":0.00003737381,"domain_scores_codex":[0.9987353,0.00004222388,0.0003012724,0.0003728014,0.0001954282,0.0003529529],"domain_scores_gemma":[0.9988122,0.0004578495,0.00009335816,0.000349738,0.0002040368,0.00008280759],"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.00007546754,0.0002968658,0.0004110873,0.00004452235,0.00002549569,0.00006996693,0.003155779,0.0008822137,0.002554714,0.7449472,0.02711193,0.2204248],"study_design_scores_gemma":[0.0000248995,0.0004070215,0.0000504741,0.00006185134,0.000009978397,0.0001308859,0.00005780235,0.6712165,0.1839717,0.1066716,0.03694557,0.0004516554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006043845,0.00005016002,0.9905338,0.007173088,0.0002922951,0.0002515698,0.000002368317,0.0003804076,0.0007119349],"genre_scores_gemma":[0.5304516,0.0000228826,0.4688674,0.0003275244,0.0001437092,0.00005578026,0.00000381119,0.00000857127,0.0001187361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6703343,"threshold_uncertainty_score":0.5143494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134275439","doi":"10.1016/j.artint.2010.04.003","title":"Iterated belief change in the situation calculus","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Belief revision; Situation calculus; Introspection; Computer science; Iterated function; Formalism (music); Action (physics); Artificial intelligence; Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.07049695495656967,"gpt":0.3167840827131049,"spread":0.2462871277565353,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918695,0.0001146697,0.0000976463,0.00008918031,0.0001537956,0.0002507198,0.0009813224,0.00008206977,0.00006184946],"category_scores_gemma":[0.0002066872,0.00008036628,0.00004271474,0.0007529966,0.00007322735,0.0004221619,0.0001056678,0.0002991913,0.0006185859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001525679,"about_ca_system_score_gemma":0.00003669244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004043483,"about_ca_topic_score_gemma":0.003624707,"domain_scores_codex":[0.9988641,0.00009248611,0.0002455325,0.0003043685,0.0002093617,0.0002841469],"domain_scores_gemma":[0.9991615,0.0001580739,0.00006136795,0.0004642896,0.0001045564,0.00005024394],"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.000003518492,0.0001227938,0.0005311249,0.000002535634,0.000001836741,0.00001838541,0.0170776,0.0000126434,0.003563885,0.6974657,0.00006758366,0.2811324],"study_design_scores_gemma":[0.00007535872,0.0002841499,0.0215123,0.00003829013,0.00001056482,0.00006067139,0.0007395741,0.6804764,0.08604488,0.2007046,0.009349379,0.0007037523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4426852,0.0001710704,0.5381221,0.004703021,0.002688037,0.0006675034,0.000001989455,0.0002274638,0.01073366],"genre_scores_gemma":[0.997677,0.000009787212,0.001185484,0.0007265732,0.0002986409,0.00004973882,0.000002783222,0.000004664841,0.00004536713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6804638,"threshold_uncertainty_score":0.7950876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012061263","doi":"10.1016/s0004-3702(01)00165-5","title":"Games, computers, and artificial intelligence","year":2002,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"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; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Artificial intelligence; Computer science; Artificial Sweetener; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.08793558553946206,"gpt":0.2975744220529197,"spread":0.2096388365134576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008379681,0.000632952,0.0005791581,0.0004589724,0.000619312,0.001077062,0.002458892,0.0002794924,0.0006680625],"category_scores_gemma":[0.0005219692,0.0006478434,0.0002085098,0.001552814,0.0008783804,0.001456878,0.0009309169,0.0006392334,0.00347864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123052,"about_ca_system_score_gemma":0.00005323443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001824829,"about_ca_topic_score_gemma":0.0001470998,"domain_scores_codex":[0.9945994,0.0002373391,0.001513786,0.00160166,0.0008298823,0.001217933],"domain_scores_gemma":[0.9964821,0.0008334204,0.0003291804,0.001512736,0.000323223,0.0005193254],"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.000008021105,0.0001632465,0.00004179598,0.00001026541,0.00001760267,0.0000490008,0.00177246,0.00049411,0.0006774617,0.4495963,0.0004430857,0.5467266],"study_design_scores_gemma":[0.000007943509,0.0002457774,0.00003604279,0.00005789486,0.00001550728,0.00009144581,0.0006711804,0.5346528,0.08217529,0.3778071,0.003492168,0.0007468557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01035527,0.001153327,0.9761832,0.005939893,0.001923509,0.0005214951,0.000007679502,0.0007625979,0.003153006],"genre_scores_gemma":[0.9435133,0.0004744229,0.05411265,0.001055362,0.0004896672,0.00004971852,0.000003126576,0.00004893848,0.0002527869],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.933158,"threshold_uncertainty_score":0.9999599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185085875","doi":"10.1016/j.artint.2015.11.002","title":"SATenstein: Automatically building local search SAT solvers from components","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmark (surveying); Solver; Parameterized complexity; Boolean satisfiability problem; Local search (optimization); Satisfiability; Task (project management); Theoretical computer science; State (computer science); Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1141609460867904,"gpt":0.3091856572084594,"spread":0.195024711121669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003682791,0.000141126,0.0001565335,0.0001108219,0.0001322193,0.0002611647,0.0005532837,0.00007746703,0.0001119783],"category_scores_gemma":[0.0001077332,0.0001422252,0.00005569291,0.00039275,0.0001789644,0.0004864654,0.0002150413,0.0001684811,0.001017963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233394,"about_ca_system_score_gemma":0.0001379134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004778503,"about_ca_topic_score_gemma":0.00008531598,"domain_scores_codex":[0.9983195,0.0001030296,0.0003829749,0.0003975425,0.0004855087,0.0003114316],"domain_scores_gemma":[0.9989125,0.0001653205,0.00006208868,0.0003811704,0.0002020717,0.0002768374],"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.00002693945,0.00009209018,0.001146676,0.000004569478,0.00002652698,0.00003827766,0.002428401,0.07228913,0.004901001,0.1915883,0.0002235618,0.7272345],"study_design_scores_gemma":[0.00003987183,0.00004585366,0.0007377854,0.00002123285,0.000004508575,0.000007304021,0.0004681119,0.947593,0.02320391,0.02747157,0.0002246278,0.0001821629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07649842,0.00001856364,0.9204543,0.001157324,0.000697527,0.0001253476,0.000003305362,0.00026344,0.0007818172],"genre_scores_gemma":[0.8804225,0.000003928373,0.1191966,0.000277973,0.00006131485,0.000003448703,0.000008256258,0.000007663519,0.00001831983],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8753039,"threshold_uncertainty_score":0.9997599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976639815","doi":"10.1016/s0004-3702(00)00049-7","title":"Expressing preferences in default logic","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Default logic; Default; Default rule; Non-monotonic logic; Preference; Computer science; Context (archaeology); Mathematical economics; Representation (politics); Artificial intelligence; Mathematics; Economics; Multimodal logic; Autoepistemic logic; Microeconomics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.07587255919728449,"gpt":0.3066760791920676,"spread":0.2308035199947832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003219276,0.0001568215,0.0001710023,0.00009682329,0.0001389558,0.0002551609,0.001022363,0.00008657289,0.0005805079],"category_scores_gemma":[0.0001003944,0.0001333566,0.0000559804,0.0005729496,0.0001062139,0.0005145587,0.0001101024,0.0001827312,0.001445415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003436736,"about_ca_system_score_gemma":0.00006252006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002033064,"about_ca_topic_score_gemma":0.0003653979,"domain_scores_codex":[0.9984263,0.0001009797,0.0003626503,0.0004857669,0.0002050213,0.0004193425],"domain_scores_gemma":[0.9992387,0.0001474462,0.00005543124,0.0004156879,0.00005308149,0.00008960322],"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.000009724455,0.0001263467,0.0006699209,0.00000509692,0.000002683618,0.00002654413,0.002608533,0.0009339082,0.0006246011,0.1793204,0.00007443935,0.8155978],"study_design_scores_gemma":[0.00003931339,0.000157358,0.002436547,0.00009264892,0.000004072288,0.00001905373,0.000325888,0.1218396,0.06007349,0.811586,0.002902733,0.000523348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3709047,0.0008669365,0.5014852,0.000541523,0.0006575129,0.0002779995,0.000001223543,0.0003795906,0.1248853],"genre_scores_gemma":[0.9914672,0.00006974011,0.007690926,0.0001854118,0.00009370198,0.00001686817,8.9626e-7,0.000005795691,0.0004694257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8150744,"threshold_uncertainty_score":0.9993321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100308419","doi":"10.1016/s0004-3702(00)00035-7","title":"Constraint-directed techniques for scheduling alternative activities","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Schedule; Constraint programming; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03535660262591858,"gpt":0.2865996582321427,"spread":0.2512430556062241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001256921,0.000134028,0.0001325433,0.00007391552,0.00009780614,0.00007141638,0.0001308181,0.00007132056,0.0004469537],"category_scores_gemma":[0.00005764272,0.0001439866,0.00005669543,0.0001735497,0.00008980292,0.0001409369,0.000005936693,0.0001155419,0.00005629892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003372485,"about_ca_system_score_gemma":0.00001218622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001421552,"about_ca_topic_score_gemma":0.000009687492,"domain_scores_codex":[0.9992536,0.00001401334,0.0002426195,0.0001699262,0.00009391298,0.000225874],"domain_scores_gemma":[0.9995958,0.000143902,0.00002137019,0.0001222507,0.0000620103,0.00005469997],"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.00001970751,0.00002327024,0.000003695803,0.0000133006,0.00002855321,0.000001640469,0.0005545035,0.2518945,0.001770303,0.003300983,0.0000488995,0.7423406],"study_design_scores_gemma":[0.0000103419,0.00002219247,8.217268e-7,0.00002237424,0.000005621127,0.000002371114,0.0002974642,0.6385434,0.3558256,0.004577777,0.0005564491,0.0001355233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04319161,0.0001034846,0.950395,0.0001269298,0.0003570584,0.0002856867,0.00002534175,0.001632662,0.003882156],"genre_scores_gemma":[0.6871153,0.0001094548,0.3121665,0.00009519869,0.0002670305,0.00008032668,0.0000128791,0.0000327051,0.0001205736],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7422051,"threshold_uncertainty_score":0.5871605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028246200","doi":"10.1016/s0004-3702(03)00111-5","title":"A consistency-based approach for belief change","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief revision; Disjoint sets; Computer science; Knowledge base; Sentence; Consistency (knowledge bases); Theoretical computer science; Implementation; Artificial intelligence; Natural language processing; Programming language; Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1367035714510194,"gpt":0.3043874597105095,"spread":0.1676838882594901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005737065,0.0001844667,0.0002031213,0.00009690876,0.0002783007,0.0001604101,0.0006882597,0.00009495104,0.00003250769],"category_scores_gemma":[0.0003930659,0.000165682,0.0001421376,0.0004655912,0.0001282897,0.0002409362,0.00005586268,0.0001065496,0.0001588287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003647694,"about_ca_system_score_gemma":0.0001512776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002998464,"about_ca_topic_score_gemma":0.00003131649,"domain_scores_codex":[0.9984038,0.00008486493,0.000312435,0.0005477384,0.0001874262,0.0004637586],"domain_scores_gemma":[0.9987915,0.0002261914,0.00009478709,0.0005512748,0.0002017742,0.0001345362],"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.000007052035,0.0002098026,0.00009802264,0.0000205347,0.000006919384,0.000002885166,0.0007845825,0.0001002559,0.0002202063,0.9435861,0.0001685015,0.05479521],"study_design_scores_gemma":[0.0001328509,0.0005457199,0.00007769981,0.00003398783,0.00002709263,0.00002164997,0.0004194283,0.5455819,0.1546405,0.2679626,0.02969837,0.0008581789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004246388,0.0003877113,0.9783598,0.000241456,0.0005476163,0.0005328815,0.000003361841,0.0001741514,0.01932839],"genre_scores_gemma":[0.8480442,0.0000077111,0.1506854,0.0006821096,0.0001347263,0.0002575288,0.000004617939,0.00001233508,0.0001713298],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8476196,"threshold_uncertainty_score":0.6756317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172181603","doi":"10.1016/j.artint.2007.02.002","title":"Inductive situation calculus","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Calculus (dental); Situation calculus; Rotation formalisms in three dimensions; Inductive logic programming; Many-valued logic; Monotone polygon; Inductive reasoning; Representation (politics); Algebra over a field; Computer science; Artificial intelligence; Pure mathematics; Description logic","retraction":null,"screen_n_in":null,"score":{"opus":0.05741505432868664,"gpt":0.3118936394500684,"spread":0.2544785851213818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007238376,0.0001242288,0.000115426,0.0001113466,0.0001815055,0.0001213815,0.0006086341,0.00008514807,0.0000446966],"category_scores_gemma":[0.0002336418,0.0001126334,0.00006091085,0.0006166914,0.00008989765,0.0004361222,0.0001511085,0.0001558741,0.001131254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007042546,"about_ca_system_score_gemma":0.00005949931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001320714,"about_ca_topic_score_gemma":0.0003605408,"domain_scores_codex":[0.9986737,0.000039432,0.0003036643,0.0003764197,0.0002373008,0.0003695316],"domain_scores_gemma":[0.9990742,0.0001644438,0.00008756288,0.00036511,0.0001893826,0.000119354],"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.000005470915,0.00005609874,0.0001094094,0.000001419291,0.000004381392,0.00001394755,0.002656494,0.00002939996,0.002361899,0.6263527,0.00006181124,0.368347],"study_design_scores_gemma":[0.00003124912,0.0002100138,0.002791266,0.00001787624,0.000009253298,0.00002258437,0.0009751295,0.05348992,0.5454494,0.3927253,0.003792689,0.0004853894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04034494,0.00007025765,0.9393356,0.000247314,0.0008892915,0.0001193658,3.290504e-7,0.0001666456,0.01882624],"genre_scores_gemma":[0.9895404,0.000006273064,0.009778916,0.0001726724,0.0002652512,0.000004644214,0.000001158458,0.000006083215,0.000224625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9491954,"threshold_uncertainty_score":0.9996465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102323131","doi":"10.1016/j.artint.2011.02.001","title":"Inconsistent heuristics in theory and practice","year":2011,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Social heuristics; Consistency (knowledge bases); Computer science; Node (physics); Reduction (mathematics); Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1022982046015955,"gpt":0.3197567451938249,"spread":0.2174585405922294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782145,0.00009610586,0.00009933258,0.00008866416,0.00008976783,0.00007832976,0.0003430027,0.000050209,0.00002061056],"category_scores_gemma":[0.001252772,0.00009263246,0.00001832501,0.0002600936,0.00009160527,0.000346034,0.0001515671,0.0001704238,0.00009019148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001621969,"about_ca_system_score_gemma":0.00004730579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001964276,"about_ca_topic_score_gemma":0.00004671147,"domain_scores_codex":[0.9988185,0.0002955849,0.0002689412,0.00028158,0.0001181542,0.0002172344],"domain_scores_gemma":[0.9981576,0.001343935,0.00007904937,0.0002826879,0.00006631765,0.00007038482],"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.00005217372,0.00007186571,0.0005853942,0.000006521458,0.000005036862,0.0000772155,0.007275033,0.00006992018,0.0001048536,0.8672982,0.0000336916,0.12442],"study_design_scores_gemma":[0.00003123328,0.000246994,0.001196028,0.00009347242,0.00001391327,0.0001186993,0.00209591,0.03861583,0.01268179,0.9430125,0.001504045,0.0003895395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008558936,0.0003764917,0.9780405,0.0005013697,0.0002619791,0.00009567418,9.129607e-7,0.00008330468,0.01208083],"genre_scores_gemma":[0.9233776,0.0000310926,0.07599267,0.0005173261,0.00002233638,0.000005430677,4.180462e-7,0.000004952971,0.00004811116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9148187,"threshold_uncertainty_score":0.3777442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114629047","doi":"10.1016/j.artint.2006.09.002","title":"Maximizing over multiple pattern databases speeds up heuristic search","year":2006,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Heuristic; Database; Computer science; Data mining; Table (database); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.09349248129293128,"gpt":0.3108650183312667,"spread":0.2173725370383354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005437884,0.0002083443,0.0001822502,0.0001521033,0.0003306273,0.0003225168,0.0008516914,0.00005459379,0.0001242993],"category_scores_gemma":[0.0001285713,0.0002077641,0.00007345084,0.0004991978,0.00009208771,0.0004784417,0.0003137227,0.0002811894,0.0006454432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004340318,"about_ca_system_score_gemma":0.00007345706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004457968,"about_ca_topic_score_gemma":0.0004214317,"domain_scores_codex":[0.997875,0.000110364,0.000443814,0.0005764015,0.0004162548,0.000578121],"domain_scores_gemma":[0.9984103,0.0006142697,0.00008986646,0.0006774967,0.0001001783,0.0001078346],"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.00005578502,0.0003843265,0.07416477,0.00009888349,0.00003910879,0.0003924695,0.002363565,0.05438896,0.01089514,0.1354475,0.006228985,0.7155405],"study_design_scores_gemma":[0.00005196972,0.00007739229,0.002772516,0.0001213515,0.000009819516,0.00002443254,0.000127416,0.8823533,0.09834344,0.01229837,0.003296794,0.0005232177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06681743,0.0001775827,0.9308485,0.0003665076,0.0006907716,0.0001314962,0.00002090068,0.0002505525,0.0006962089],"genre_scores_gemma":[0.9830717,0.000007372309,0.01607514,0.0002367701,0.000276266,0.000007437985,0.00003375181,0.00001743375,0.0002741067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9162543,"threshold_uncertainty_score":0.8472374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139771194","doi":"10.1016/s0004-3702(99)00087-9","title":"Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes)","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto","keywords":"Circumscription; Axiom; Successor cardinal; State (computer science); Mathematics; Computer science; Frame problem; Class (philosophy); Set (abstract data type); Frame (networking); Theoretical computer science; Artificial intelligence; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04401351160811035,"gpt":0.2909212580944951,"spread":0.2469077464863847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000602569,0.0001442317,0.0001196777,0.00008240565,0.0005179676,0.0003641517,0.000519487,0.00004885214,0.0001358103],"category_scores_gemma":[0.0001319035,0.0001042074,0.00004572755,0.0006344491,0.0001920433,0.0004393327,0.00008969186,0.0001896647,0.0007402372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005722425,"about_ca_system_score_gemma":0.00007654669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001575673,"about_ca_topic_score_gemma":0.0004651057,"domain_scores_codex":[0.9986616,0.00008576219,0.0003446454,0.0004055306,0.0001765983,0.0003258312],"domain_scores_gemma":[0.9991424,0.0001558383,0.00007906124,0.0003787277,0.0001312068,0.0001127369],"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.000006379736,0.00004010528,0.00002013782,0.000003036843,0.000005934851,8.998633e-7,0.005359842,0.0002124196,0.001174743,0.1706526,0.0001403946,0.8223835],"study_design_scores_gemma":[0.00008465033,0.0005461776,0.00144789,0.0001416946,0.00003076576,0.0001010576,0.002286453,0.5476993,0.06418791,0.3396098,0.04298883,0.0008754769],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03258339,0.00008305204,0.9512725,0.003121957,0.0002144044,0.0004663998,0.000004057515,0.0001732907,0.01208094],"genre_scores_gemma":[0.9809843,0.00006845891,0.0179081,0.0002794232,0.0000856669,0.00005640796,0.000002522243,0.000007038932,0.0006081387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9484009,"threshold_uncertainty_score":0.9514499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068627087","doi":"10.1016/j.artint.2007.01.003","title":"Multi-agent learning for engineers","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Position paper; Appeal; Position (finance); Management science; Engineering; Economics; World Wide Web; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.2702281220202754,"gpt":0.4568198104691339,"spread":0.1865916884488585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003505992,0.00008221751,0.0001040419,0.0001375493,0.000324745,0.00009145772,0.0003679517,0.00005115015,0.0003628757],"category_scores_gemma":[0.002841352,0.00006965244,0.00009783934,0.0005595012,0.00009788085,0.0001198839,0.00003460149,0.0001152893,0.001584871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002225566,"about_ca_system_score_gemma":0.0000171613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007913448,"about_ca_topic_score_gemma":0.00003730333,"domain_scores_codex":[0.9985796,0.00003713383,0.0005267111,0.0003105813,0.0003056723,0.0002402722],"domain_scores_gemma":[0.9977105,0.001583128,0.0001203906,0.0002530159,0.0002319527,0.0001009681],"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.00004629935,0.00008833701,0.0001939766,0.000001361079,0.000006812837,0.000001168586,0.001374225,0.02297242,0.01215147,0.2746671,0.0003499003,0.6881469],"study_design_scores_gemma":[0.00003711123,0.00009930192,0.0006929577,0.000006058428,0.00001096181,0.000005244985,0.01442539,0.1351523,0.3316014,0.3617004,0.1559727,0.0002961624],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03261343,0.00002415545,0.9655777,0.0003734571,0.0004031564,0.0002030601,0.000002311155,0.0000694502,0.0007332943],"genre_scores_gemma":[0.9831682,0.000002653727,0.0138078,0.0001149768,0.0001640275,0.00002343872,0.000002241176,0.000008054536,0.002708641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9517699,"threshold_uncertainty_score":0.9991925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156474728","doi":"10.1016/j.artint.2014.08.006","title":"Belief revision in Horn theories","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"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":"Belief revision; French horn; Horn clause; Iterated function; Mathematics; Representation (politics); Inference; Relevance (law); Logic programming; Algorithm; Computer science; Algebra over a field; Artificial intelligence; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02850185044916365,"gpt":0.2806735463121939,"spread":0.2521716958630302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008671384,0.0001348304,0.0001710354,0.0001048365,0.0001269335,0.0001726552,0.0008524597,0.00007065123,0.00004934217],"category_scores_gemma":[0.0005275026,0.0001129115,0.00005696179,0.0005405787,0.0001012931,0.0003289104,0.0002292991,0.000157653,0.0009806454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002901433,"about_ca_system_score_gemma":0.00003359112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006840188,"about_ca_topic_score_gemma":0.0001824164,"domain_scores_codex":[0.9986147,0.0001357418,0.0003267242,0.0004107076,0.0001866797,0.0003254528],"domain_scores_gemma":[0.9989839,0.0002648046,0.00006908738,0.0005206353,0.00008310391,0.00007842118],"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.000003293143,0.0000369721,0.0002198833,0.000003610479,9.668336e-7,0.000002664233,0.0009722889,0.00005383415,0.0002103328,0.6649149,0.00005697321,0.3335243],"study_design_scores_gemma":[0.00001985257,0.0001591582,0.0005962176,0.00005347914,0.000002229203,0.000005681316,0.0001332537,0.06947108,0.04176351,0.8769263,0.01060994,0.0002593022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01894778,0.0002342251,0.9564272,0.0006160294,0.0007093106,0.0001165365,3.074809e-7,0.0001447739,0.02280381],"genre_scores_gemma":[0.994113,0.00005200029,0.005208598,0.0002371981,0.0001768321,0.000006096563,7.37753e-7,0.000006620972,0.0001989654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9751652,"threshold_uncertainty_score":0.9997972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058792175","doi":"10.1016/j.artint.2005.09.002","title":"Finding optimal satisficing strategies for and-or trees","year":2005,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Probabilistic logic; Tree (set theory); Set (abstract data type); Node (physics); Computer science; Outcome (game theory); Satisficing; Class (philosophy); Mathematical optimization; Task (project management); Mathematics; Test (biology); Algorithm; Artificial intelligence; Combinatorics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1111722750895888,"gpt":0.3551924202138077,"spread":0.2440201451242189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003602173,0.0001272604,0.0001289918,0.00009536944,0.0002307749,0.0003140036,0.0003998347,0.0000515634,0.00001523974],"category_scores_gemma":[0.0004386803,0.0001090343,0.00003829261,0.0002128182,0.0000723921,0.0005480224,0.000114428,0.00008312765,0.00001567183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002326712,"about_ca_system_score_gemma":0.00006881064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006946571,"about_ca_topic_score_gemma":0.0001259093,"domain_scores_codex":[0.9989613,0.00002134842,0.000283408,0.000336716,0.0001191445,0.0002780771],"domain_scores_gemma":[0.9986823,0.0008580944,0.00007423992,0.0002593611,0.00006576593,0.00006021692],"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.00001534905,0.00002793228,0.0001200726,0.00001042266,0.000005115665,0.000002387009,0.001779728,0.001404379,0.0006412611,0.236921,0.0008986727,0.7581737],"study_design_scores_gemma":[0.00002079747,0.0002795601,0.0001168659,0.0000755281,0.00000664238,0.00002377041,0.0002296201,0.6461015,0.04040637,0.3111406,0.001304193,0.0002945654],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02578747,0.00009097969,0.9704144,0.0006043756,0.0001303257,0.0001529909,0.00000147139,0.00258504,0.0002329651],"genre_scores_gemma":[0.5816385,0.000007863377,0.4180861,0.00009256414,0.0001006717,0.00002149832,4.25616e-7,0.000006025655,0.00004637353],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7578791,"threshold_uncertainty_score":0.444629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170052858","doi":"10.1016/s0004-3702(00)00034-5","title":"Applying MDL to learn best model granularity","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; European Commission; University of Waterloo; York University; Office of Naval Research; Harvard University","keywords":"Minimum description length; Algorithm; Computer science; Granularity; Model selection; Artificial intelligence; Set (abstract data type); Mathematics; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.08122447488248963,"gpt":0.3113414049876533,"spread":0.2301169301051637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006331649,0.0002656844,0.0002741318,0.0001334991,0.0003424193,0.0003794497,0.001812883,0.0001059929,0.0002598397],"category_scores_gemma":[0.0001174629,0.0002758951,0.0001309268,0.001013067,0.0001155681,0.000486431,0.0004387241,0.0003181393,0.003788523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009308034,"about_ca_system_score_gemma":0.0000934182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003841862,"about_ca_topic_score_gemma":0.0001862154,"domain_scores_codex":[0.9972292,0.00009696973,0.0005487453,0.000958233,0.0005160045,0.000650905],"domain_scores_gemma":[0.9982058,0.0001556799,0.00005359088,0.001125386,0.0001585146,0.0003010265],"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.000009800346,0.0001845135,0.00004656092,0.000005169855,0.000004221007,0.00001164686,0.0008210417,0.1413401,0.0005301568,0.0448814,0.00006497453,0.8121005],"study_design_scores_gemma":[0.00001195304,0.00009973093,0.00003341744,0.00001134101,0.000004186118,0.000009589708,0.00004350496,0.8015871,0.008968265,0.1861591,0.002769652,0.0003021215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04203867,0.00005093511,0.9510322,0.001302248,0.0003552495,0.0006442316,0.000004654496,0.000360466,0.004211409],"genre_scores_gemma":[0.836331,0.00001524502,0.1617459,0.001003038,0.0001772668,0.0001406899,0.000002087207,0.00001866348,0.0005661395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8117983,"threshold_uncertainty_score":0.9999693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104290979","doi":"10.1016/s0004-3702(99)00099-5","title":"Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Heuristic; Mathematical optimization; Scheduling (production processes); Constraint (computer-aided design); Exploit; Job shop scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01929389070529535,"gpt":0.284133776847167,"spread":0.2648398861418716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001812325,0.0001782516,0.0002273256,0.0002468223,0.0002606487,0.0002778303,0.0004015882,0.0001020662,0.001676056],"category_scores_gemma":[0.0001798988,0.0001839534,0.000158699,0.001517491,0.0001197946,0.0002713547,0.00003209625,0.000139904,0.00009373482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006242887,"about_ca_system_score_gemma":0.0001276433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006233496,"about_ca_topic_score_gemma":0.0003906713,"domain_scores_codex":[0.9984469,0.00005469691,0.0004665142,0.000504991,0.0002157037,0.0003112359],"domain_scores_gemma":[0.9989468,0.0002226058,0.00011193,0.0003698332,0.0002311292,0.0001176903],"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.00002183713,0.00003955368,0.0001516773,0.000009861627,0.00013958,0.000004337381,0.0006048332,0.1798216,0.0007817317,0.0719979,0.00001259107,0.7464145],"study_design_scores_gemma":[0.00002356548,0.00004714685,0.0001906922,0.00001251517,0.00009276268,0.00001086149,0.0001085193,0.9565501,0.00410415,0.03838088,0.0002554359,0.0002234225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02490659,0.00002543656,0.9726424,0.0007479201,0.0001620928,0.0003334049,0.00004018288,0.0003473318,0.0007946577],"genre_scores_gemma":[0.6876032,0.00002141068,0.3120263,0.0001716371,0.00002013307,0.00001404868,0.00002116158,0.000007457021,0.0001145901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7767285,"threshold_uncertainty_score":0.9992365,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155364832","doi":"10.1016/j.artint.2009.11.013","title":"Cortical hierarchies, sleep, and the extraction of knowledge from memory","year":2009,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Sleep (system call); Artificial intelligence; Artificial neural network; Adaptive memory; Neuroscience; Psychology; Cognition","retraction":null,"screen_n_in":null,"score":{"opus":0.1304011309793749,"gpt":0.3550060960699627,"spread":0.2246049650905877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003016745,0.0001094228,0.0001710853,0.00004351132,0.0002057857,0.00003352612,0.0002235951,0.00005136879,0.0001718887],"category_scores_gemma":[0.0009315829,0.00007501807,0.0000525744,0.00020656,0.0004346429,0.0001407182,0.00004116561,0.0002407354,0.00009690219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007322736,"about_ca_system_score_gemma":0.00001487625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001764132,"about_ca_topic_score_gemma":0.00001808308,"domain_scores_codex":[0.9987118,0.0002999225,0.0003423433,0.0003020626,0.0001664687,0.0001773597],"domain_scores_gemma":[0.9981471,0.001423413,0.0000911794,0.0002427218,0.00002630883,0.00006932044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002612083,0.00007316167,0.00000166585,0.000002042154,0.000001201965,0.000005727362,0.0007029834,0.00001105862,0.7182513,0.1507133,0.00001104887,0.1299654],"study_design_scores_gemma":[0.00003978625,0.00009880118,0.0001199584,0.000009456405,0.00001033753,0.000010101,0.0001328346,0.008284802,0.8059191,0.1852566,0.00004937033,0.00006883532],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9841167,0.0001399091,0.01101907,0.0009452972,0.0005133318,0.0002387348,0.00000645506,0.00004443398,0.002976039],"genre_scores_gemma":[0.9989886,0.00008525273,0.0001805377,0.0005050717,0.0001232846,0.000005458961,5.922405e-7,0.000005327552,0.0001058629],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1298965,"threshold_uncertainty_score":0.3059148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052020474","doi":"10.1016/j.artint.2014.07.005","title":"Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules","year":2014,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Rensselaer Polytechnic Institute; Australian Research Council; Alexander von Humboldt-Stiftung; Agence Nationale de la Recherche; National Science Foundation","keywords":"Voting; Heuristic; Computer science; Computational complexity theory; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1840062627102795,"gpt":0.2990024360764078,"spread":0.1149961733661283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001328955,0.00006585804,0.0002162395,0.00004570629,0.0001008621,0.00002230765,0.00009463635,0.00003730147,0.00001298391],"category_scores_gemma":[0.0003073254,0.00005915071,0.00003676223,0.00006131053,0.0002374239,0.00006384213,0.00002827287,0.00004051861,0.000005809832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004742635,"about_ca_system_score_gemma":0.000002387437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003016874,"about_ca_topic_score_gemma":0.00005124876,"domain_scores_codex":[0.9992353,0.00002450271,0.0004547439,0.0001605018,0.00002131397,0.0001036804],"domain_scores_gemma":[0.9990667,0.00044523,0.0003092031,0.0001203026,0.00003858872,0.00002002703],"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.00001391719,0.00001390362,0.004887562,0.00006103236,0.00001056871,2.096954e-8,0.0005349107,0.0001583029,0.0001497855,0.9668338,0.000003225263,0.02733296],"study_design_scores_gemma":[0.00003892695,0.0001052049,0.01344084,0.00003859117,0.00000862055,0.000001531078,0.000435993,0.4019779,0.006588459,0.5765177,0.0007397468,0.0001065044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5915862,0.000480056,0.4068998,0.0002297677,0.0001588128,0.0001948129,0.00004152276,0.00000819912,0.0004007476],"genre_scores_gemma":[0.9979415,0.00001892827,0.001915609,0.00001639799,0.00006700368,0.000005900632,0.000002247039,0.000006502873,0.00002588874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4063553,"threshold_uncertainty_score":0.2412096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025270539","doi":"10.1016/j.artint.2010.04.005","title":"A semantic characterization of a useful fragment of the situation calculus with knowledge","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Situation calculus; Correctness; Fragment (logic); Calculus (dental); Embedding; Determinacy; Mathematics; Computer science; Algebra over a field; Artificial intelligence; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.023592062439281,"gpt":0.2558285231445378,"spread":0.2322364607052568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002794861,0.0001040409,0.0001461604,0.0000614695,0.0000902387,0.00003747828,0.0006263343,0.00005877891,0.00002583445],"category_scores_gemma":[0.0001058569,0.00006678567,0.00005790862,0.000571395,0.0001588577,0.0001995392,0.0001455862,0.0001313757,0.00003897657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001301038,"about_ca_system_score_gemma":0.0001210211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000482354,"about_ca_topic_score_gemma":0.000514823,"domain_scores_codex":[0.9990308,0.00005704384,0.0003182739,0.0002291123,0.000207547,0.0001572157],"domain_scores_gemma":[0.9988629,0.00007136408,0.000230923,0.0004990014,0.0002945035,0.00004136889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001765638,0.0003422824,0.002907355,0.00003985345,0.00001648901,0.000001116108,0.008992702,0.00005636629,0.5280662,0.3832191,0.00000612109,0.07633483],"study_design_scores_gemma":[0.00002771069,0.0001239275,0.0155047,0.00005567081,0.00001386795,0.000005907628,0.00007223616,0.07402309,0.904272,0.00556939,0.0002093879,0.0001221239],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5738916,0.000009251605,0.4248202,0.0001152377,0.0003803532,0.0001528877,0.000001093254,0.00002088222,0.0006085695],"genre_scores_gemma":[0.9987569,0.000004474223,0.001049007,0.00002100989,0.0000590612,0.00001047457,0.000001530182,0.000005647406,0.00009185125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4248654,"threshold_uncertainty_score":0.2723441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2747118187","doi":"10.1016/j.artint.2017.05.004","title":"MM: A bidirectional search algorithm that is guaranteed to meet in the middle","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Incremental heuristic search; Bidirectional search; Beam search; Heuristic; Best-first search; Search algorithm; Algorithm; Computer science; Disjoint sets; Node (physics); Search problem; Depth-first search; Iterative deepening depth-first search; Null-move heuristic; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2313199868634884,"gpt":0.3798248892331862,"spread":0.1485049023696978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002083552,0.0001639766,0.0001837835,0.000281236,0.0007357533,0.001339925,0.003672909,0.00006810561,0.0002228585],"category_scores_gemma":[0.0006161369,0.0001287785,0.00007463485,0.0007070611,0.0001931245,0.0004613886,0.0005772788,0.0002362593,0.0007999309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005589284,"about_ca_system_score_gemma":0.0001463932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000801578,"about_ca_topic_score_gemma":0.0002689199,"domain_scores_codex":[0.9971876,0.000248088,0.0003607073,0.0005975965,0.00107941,0.0005266719],"domain_scores_gemma":[0.9976963,0.0003532955,0.00008573457,0.001484352,0.0002407317,0.0001395457],"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.00002920851,0.000363583,0.0005586339,0.00001362713,0.00003090124,0.0001337419,0.01354572,0.002430582,0.0003328074,0.1785863,0.002970337,0.8010045],"study_design_scores_gemma":[0.00004133646,0.00009605529,0.0009173176,0.00003231498,0.000003559592,0.00002778662,0.0006478056,0.9402025,0.02684878,0.02798004,0.002954981,0.0002474858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002879347,0.00004150385,0.9801928,0.01123407,0.0005919303,0.0004713835,0.0000123763,0.00005455123,0.004522062],"genre_scores_gemma":[0.7651695,0.00004574263,0.2305206,0.002741026,0.0003252587,0.0001336079,0.000002260894,0.0000241084,0.001037869],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.937772,"threshold_uncertainty_score":0.9999781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966851629","doi":"10.1016/j.artint.2007.10.019","title":"Duality in permutation state spaces and the dual search algorithm","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Duality (order theory); Dual (grammatical number); Heuristic; Permutation (music); State (computer science); Mathematics; Algorithm; Class (philosophy); Symmetry (geometry); Search algorithm; Mathematical optimization; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04617088111170319,"gpt":0.3192080088219094,"spread":0.2730371277102062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003781391,0.00009112179,0.0001081603,0.00009192432,0.0001859943,0.0002365386,0.0002605869,0.00003674179,0.00000662544],"category_scores_gemma":[0.0001132467,0.00006820273,0.0000226244,0.0004357324,0.0001976832,0.0002628836,0.0001155233,0.000219975,0.0000376092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002282642,"about_ca_system_score_gemma":0.00004648318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001204266,"about_ca_topic_score_gemma":0.0005220774,"domain_scores_codex":[0.9986933,0.0001763205,0.0003026082,0.0002731249,0.0002475842,0.000307046],"domain_scores_gemma":[0.9987649,0.0008459803,0.00005441915,0.0002083268,0.00006681159,0.00005957007],"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.00004807291,0.00002801271,0.001221608,0.000007825295,0.000005144883,0.00004728763,0.02102297,0.002595825,0.0001502622,0.1089396,0.00001426578,0.8659191],"study_design_scores_gemma":[0.00009708782,0.00007701322,0.00538684,0.00003961038,0.000003177742,0.00002452673,0.001966539,0.81436,0.02643365,0.1512085,0.0001797609,0.0002232482],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2056761,0.0001535614,0.7920583,0.001532126,0.0001333895,0.0001233117,0.000001566213,0.00004346162,0.0002781076],"genre_scores_gemma":[0.9801557,0.00001987568,0.01953451,0.0001759578,0.00004438972,0.000003652642,0.000001540772,0.000003980409,0.00006040793],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8656959,"threshold_uncertainty_score":0.2781227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2228999052","doi":"10.1016/j.artint.2016.04.006","title":"Bounded situation calculus action theories","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Provincia autonoma di Bolzano - Alto Adige; Sapienza Università di Roma","keywords":"Decidability; Bounded function; Situation calculus; Action (physics); Extension (predicate logic); Action theory (sociology); Mathematics; Object (grammar); Calculus (dental); Tuple; Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Artificial intelligence; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.06660637544232685,"gpt":0.3137446923820261,"spread":0.2471383169396993,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003605584,0.0001229195,0.0001092531,0.0000700695,0.0002300996,0.0001888961,0.0005194712,0.00007069055,0.0001082033],"category_scores_gemma":[0.0003337691,0.00008122114,0.00006345562,0.0003145796,0.0001344296,0.0007213292,0.0001185585,0.0000656439,0.001592921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007620882,"about_ca_system_score_gemma":0.00007302329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005287568,"about_ca_topic_score_gemma":0.0002395517,"domain_scores_codex":[0.9988251,0.00008039269,0.0002442489,0.0003578835,0.0002105808,0.0002818221],"domain_scores_gemma":[0.9990564,0.0002158334,0.00008844798,0.000402835,0.0001559352,0.00008053939],"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.000005802018,0.0000264971,0.00003710348,0.000001475225,0.00000352114,0.000002083102,0.0007998088,0.000003930545,0.007118454,0.6395037,0.00005351453,0.3524441],"study_design_scores_gemma":[0.00001766908,0.00007233631,0.0002368245,0.00001501361,0.000003715018,0.000006530881,0.0001317152,0.006766836,0.314371,0.6764714,0.0017482,0.0001587539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02799688,0.00004468492,0.9631725,0.001172793,0.001116495,0.0001027995,8.261579e-7,0.0002328339,0.006160174],"genre_scores_gemma":[0.9965777,0.00003637452,0.002250171,0.0001041847,0.0002257264,0.00001435188,7.236166e-7,0.000006251334,0.0007845255],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9685808,"threshold_uncertainty_score":0.9991844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973749650","doi":"10.1016/j.artint.2012.04.006","title":"Reinforcement learning with limited reinforcement: Using Bayes risk for active learning in POMDPs","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Reinforcement learning; Computer science; Markov decision process; Task (project management); Artificial intelligence; Machine learning; Action (physics); Variety (cybernetics); Bayes' theorem; Bayesian probability; Markov chain; Markov process; Markov model; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06131471456678903,"gpt":0.3031917075469479,"spread":0.2418769929801589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001282506,0.0003881283,0.0003617155,0.0004226545,0.0006247291,0.0002793201,0.0007702283,0.0001450013,0.00004995654],"category_scores_gemma":[0.0007286512,0.0003687327,0.0001142639,0.001044237,0.0001011791,0.001700354,0.0003287406,0.0008035433,0.0000954072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000348397,"about_ca_system_score_gemma":0.0001370843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002330473,"about_ca_topic_score_gemma":0.00002381136,"domain_scores_codex":[0.9965747,0.0002139363,0.0008403509,0.0005583704,0.0006031219,0.001209536],"domain_scores_gemma":[0.997772,0.0006275699,0.0006263431,0.0005108825,0.0002428961,0.0002202446],"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.0001093132,0.00004930527,0.005010305,0.0000251837,0.00005222577,0.000003151679,0.005890025,0.9379852,0.0004746804,0.02871855,0.000004299323,0.02167775],"study_design_scores_gemma":[0.000147603,0.0006545802,0.0003231009,0.0001086025,0.00003595111,0.000008079205,0.001278036,0.9719432,0.02290166,0.0004377677,0.001668146,0.0004932586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03559246,0.00005415967,0.961449,0.00008047197,0.000351202,0.0007710181,4.16968e-7,0.0003313165,0.001369968],"genre_scores_gemma":[0.9481544,0.00006331709,0.05106556,0.00009206697,0.0001708481,0.00007032926,0.00001340384,0.0000419812,0.0003280685],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.912562,"threshold_uncertainty_score":0.9998764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398436144","doi":"10.1016/j.artint.2016.05.004","title":"Automatic construction of parallel portfolios via algorithm configuration","year":2016,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"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; Algorithm; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02348581171794199,"gpt":0.2612301690845495,"spread":0.2377443573666075,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001764596,0.00009694565,0.0001253648,0.0001265698,0.00007147615,0.00004186545,0.0002189339,0.00005740469,0.0005347106],"category_scores_gemma":[0.00007082419,0.00007607998,0.00005116789,0.0003071888,0.0001544046,0.0005380462,0.00003316223,0.00004185382,0.0001753795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003168948,"about_ca_system_score_gemma":0.00006494566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002498911,"about_ca_topic_score_gemma":0.00001101693,"domain_scores_codex":[0.998897,0.00005016688,0.0004627858,0.0002337198,0.0002081013,0.0001482409],"domain_scores_gemma":[0.9991736,0.0001010885,0.000210746,0.0002740048,0.0001816275,0.00005894968],"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.000001721835,0.00001688866,0.00009619377,0.00000247149,0.000005661672,0.000001197995,0.00009896601,0.0000891229,0.00379683,0.16316,0.00001196369,0.832719],"study_design_scores_gemma":[0.00005140491,0.00008111536,0.0009669988,0.00004298907,0.000007763975,0.00004492465,0.00009446415,0.7163196,0.1825424,0.09952412,0.0001290268,0.0001952904],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003942852,0.000009519394,0.9937965,0.0008781057,0.0004871576,0.0001496232,0.000002527665,0.0001418446,0.0005918191],"genre_scores_gemma":[0.7879332,0.00002488279,0.2119132,0.00004930202,0.00003335359,0.000008621793,0.00000160187,0.000004152127,0.0000317291],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8325236,"threshold_uncertainty_score":0.5854707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}