{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":618,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":618,"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":"3ade09b83c66","filters":{"topic":"AI-based Problem Solving and Planning"}},"results":[{"id":"W2141312052","doi":"10.1007/978-3-031-23161-2_300700","title":"Knowledge Representation and Reasoning","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Computer Graphics and Games","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":826,"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":"Representation (politics); Computer science; Knowledge representation and reasoning; Cognitive science; Artificial intelligence; Psychology; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.01383945672128755,"gpt":0.2470559699430973,"spread":0.2332165132218097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002700819,0.000298632,0.0003899583,0.0003808684,0.00009273032,0.0001837574,0.000306585,0.0002222077,0.000004694026],"category_scores_gemma":[0.000008677673,0.0002806066,0.0001053663,0.0001091333,0.000131833,0.0001786458,0.0004504854,0.0004055747,0.000007107757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006738408,"about_ca_system_score_gemma":0.0000594972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001784659,"about_ca_topic_score_gemma":0.00000678831,"domain_scores_codex":[0.9986112,0.00002323336,0.0003583887,0.0006241459,0.0002007503,0.0001822986],"domain_scores_gemma":[0.9989117,0.0003079797,0.0001887262,0.0003862771,0.00009488026,0.0001104466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002491548,0.000006305587,0.0003110951,0.0002374844,0.00007550869,0.00003273048,0.001612705,0.000008674589,4.941903e-7,0.9117304,0.004747689,0.08123442],"study_design_scores_gemma":[0.000264375,0.0002574427,0.0009570001,0.002227764,0.0001123437,0.0001031101,0.00000858592,0.07204878,0.00000776365,0.350383,0.5729198,0.0007099978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0008189859,0.06577384,0.1451776,0.0006984245,0.002372842,0.0003879028,0.00003294601,0.0003836788,0.7843537],"genre_scores_gemma":[0.03321263,0.09230337,0.2120878,0.000722222,0.003354485,0.00004271613,0.0001809899,0.0003119122,0.6577839],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5681722,"threshold_uncertainty_score":0.9999646,"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":"W1550696814","doi":"10.48550/arxiv.1304.3848","title":"Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (1995)","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":554,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Eleventh; Computer science; Artificial intelligence; Operations research; Political science; Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.1187578523081883,"gpt":0.2035867998666089,"spread":0.08482894755842064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003885177,0.0002601194,0.0002926818,0.00021044,0.000106291,0.0001114537,0.002460369,0.0002381909,0.00002742362],"category_scores_gemma":[0.00006495894,0.0002286477,0.000135623,0.0007007461,0.0001471987,0.0002125874,0.001229901,0.0008494442,0.0000420869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001575711,"about_ca_system_score_gemma":0.0002537175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005570963,"about_ca_topic_score_gemma":0.00005939838,"domain_scores_codex":[0.9983708,0.00006854442,0.000291373,0.0007974287,0.0001412386,0.0003305657],"domain_scores_gemma":[0.9985992,0.000130062,0.0003893808,0.0005756144,0.0002241956,0.00008157382],"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.00002322516,0.00008105484,0.003016038,0.00007922522,0.0000171395,0.00001190203,0.0007340424,0.2478997,0.00009106081,0.7462322,0.0001426883,0.001671812],"study_design_scores_gemma":[0.00006061259,0.00006598074,0.001066546,0.0005953029,0.00001248435,0.000001079414,0.0001818316,0.7138989,0.001096995,0.2827028,0.00004139927,0.0002760927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9077348,0.00001838856,0.08551117,0.0004753596,0.0005061251,0.000513853,0.00001183727,0.0001077524,0.005120765],"genre_scores_gemma":[0.9988418,0.00002466496,0.0006327584,0.00006841409,0.00002804369,0.000001852042,0.000002358696,0.00000853244,0.0003915309],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4659992,"threshold_uncertainty_score":0.9323983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883445328","doi":"10.1007/s10462-018-9646-y","title":"40 years of cognitive architectures: core cognitive abilities and practical applications","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":516,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Air Force Office of Scientific Research; Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Cognition; Cognitive architecture; Variety (cybernetics); Set (abstract data type); Cognitive science; Perception; Field (mathematics); Selection (genetic algorithm); Data science; Rational analysis; Artificial intelligence; Psychology; Neuroscience","retraction":null,"screen_n_in":null,"score":{"opus":0.107634902286158,"gpt":0.3884198155905721,"spread":0.2807849133044141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623032,0.0001167674,0.0002494993,0.00005903648,0.0001213674,0.00004433208,0.000190403,0.00004624333,0.00005790913],"category_scores_gemma":[0.001303226,0.0001093541,0.00005641689,0.000403604,0.0005091046,0.0001106166,0.0001171275,0.0001681884,0.0001418612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008716725,"about_ca_system_score_gemma":0.0001184391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003454191,"about_ca_topic_score_gemma":0.00001691677,"domain_scores_codex":[0.998755,0.0001185057,0.0003912032,0.0003445189,0.0001859754,0.0002048208],"domain_scores_gemma":[0.9971657,0.002038407,0.0001708228,0.0002282387,0.0003090693,0.0000877419],"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.00001640493,0.00006195303,0.00011192,0.0004239384,0.00002457675,0.000005352186,0.002001385,0.000001423818,0.00003488502,0.04818442,0.00007383349,0.9490599],"study_design_scores_gemma":[0.0002647479,0.004273181,0.002715918,0.06861424,0.0009892581,0.0007213988,0.005987074,0.03700252,0.04958268,0.8011093,0.02581914,0.00292055],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00838437,0.01747724,0.9711869,0.0008930709,0.00007282548,0.0007969663,0.00002295681,0.00007574125,0.001089906],"genre_scores_gemma":[0.984309,0.004020938,0.01043848,0.0009838203,0.00010793,0.0001018765,0.000008153311,0.000009008994,0.00002082795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9759246,"threshold_uncertainty_score":0.445933,"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":"W1576718874","doi":"10.48550/arxiv.1304.3842","title":"Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence (2000)","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial intelligence; Operations research; Engineering; Computer science; Library science","retraction":null,"screen_n_in":null,"score":{"opus":0.1024295809606266,"gpt":0.1996275815539112,"spread":0.09719800059328461,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003769468,0.0002678194,0.0002970824,0.000218486,0.0001105086,0.0001254137,0.002476066,0.000244608,0.00003671572],"category_scores_gemma":[0.00006875713,0.0002118757,0.0001291487,0.0007516325,0.0001651808,0.0002212289,0.001220087,0.000848969,0.00004682891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001990208,"about_ca_system_score_gemma":0.000370585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006935208,"about_ca_topic_score_gemma":0.00005468369,"domain_scores_codex":[0.9983283,0.00006781345,0.0002930184,0.000821957,0.0001445363,0.0003443637],"domain_scores_gemma":[0.9985427,0.0001412168,0.0003790472,0.0005979865,0.0002522362,0.00008686462],"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.0000257751,0.00008559879,0.003216418,0.00008276273,0.00001774762,0.00001355525,0.00106753,0.3679281,0.00006608334,0.6250871,0.0001579758,0.002251261],"study_design_scores_gemma":[0.00006470328,0.00006849625,0.00111634,0.0005854437,0.00001359063,0.000001080041,0.000199713,0.7788074,0.0009159655,0.2178723,0.00005888686,0.0002960984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.897972,0.00002482046,0.09242235,0.0007261804,0.0006442679,0.0006529724,0.00001674627,0.0001431889,0.00739748],"genre_scores_gemma":[0.9986197,0.00002678278,0.000615773,0.00007528006,0.0000299368,0.000001756669,0.000002398802,0.000008679953,0.0006196891],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4108793,"threshold_uncertainty_score":0.8640041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160927913","doi":"10.1613/jair.1696","title":"Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators","year":2005,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macro; Computer science; Artificial intelligence; Software engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1124290222437872,"gpt":0.4091690585784714,"spread":0.2967400363346842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006285138,0.0002213508,0.0003589571,0.0006869818,0.0006320009,0.001083751,0.001675184,0.0001392208,0.0001094186],"category_scores_gemma":[0.000706595,0.0001678598,0.0001160561,0.001216351,0.0002351464,0.001259711,0.0002731478,0.00187984,0.0001994506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000208488,"about_ca_system_score_gemma":0.0009604084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005179384,"about_ca_topic_score_gemma":0.00001969106,"domain_scores_codex":[0.9955497,0.0004587042,0.0009752273,0.000398743,0.001653129,0.000964433],"domain_scores_gemma":[0.9966688,0.0009030298,0.0003133184,0.0004687639,0.001229929,0.0004161903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003381265,0.0002626529,0.001545077,0.00008248341,0.00009123896,0.0007465443,0.007960279,0.0741058,0.01691009,0.02454153,0.001624019,0.8717921],"study_design_scores_gemma":[0.0001503973,0.002174328,0.0002001757,0.0006316257,0.00001675962,0.0005585414,0.001512004,0.8741157,0.1043401,0.01205184,0.003754448,0.0004940341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1160047,0.0004403629,0.87398,0.008454273,0.0002131702,0.0001776158,0.000001169943,0.00008542241,0.0006433482],"genre_scores_gemma":[0.892694,0.00001962502,0.1062974,0.0002589551,0.0005371549,0.000004538226,5.598604e-7,0.00002388831,0.0001638365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8712981,"threshold_uncertainty_score":0.9999532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155992093","doi":"10.1613/jair.4171","title":"Enhanced Partial Expansion A*","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; A priori and a posteriori; Heuristic; Benchmark (surveying); Node (physics); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1483667407816816,"gpt":0.4088555009411715,"spread":0.2604887601594899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007639063,0.0001067275,0.000218507,0.0004216057,0.0003219177,0.0003240113,0.001270846,0.00008999485,0.00006392901],"category_scores_gemma":[0.001332272,0.00008683373,0.0001092552,0.000775842,0.0001262197,0.000541907,0.0001811181,0.0008169856,0.0002355185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006126242,"about_ca_system_score_gemma":0.0002782725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002709601,"about_ca_topic_score_gemma":0.000005711721,"domain_scores_codex":[0.9967772,0.000630787,0.000664647,0.0002369298,0.001156681,0.0005337721],"domain_scores_gemma":[0.9971391,0.001082448,0.0002199669,0.000385796,0.0009297839,0.0002428838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009908002,0.0001325082,0.00005389429,0.00001901005,0.00001597755,0.00003978623,0.002385088,0.005172248,0.08693942,0.08648396,0.001077267,0.8175818],"study_design_scores_gemma":[0.00004287922,0.001118846,0.0000402992,0.0001838831,0.000003589791,0.00004278234,0.0003459743,0.196679,0.7180071,0.07924316,0.004124704,0.0001677598],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0644659,0.0001121183,0.9321118,0.001730285,0.0005669022,0.00006658628,2.44286e-7,0.0000252639,0.0009208857],"genre_scores_gemma":[0.9780781,0.00003777465,0.02111089,0.00006272644,0.0006177493,0.000002292936,2.611667e-7,0.000008068331,0.00008211638],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9136122,"threshold_uncertainty_score":0.3549441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W204258288","doi":"","title":"Extending the knowledge-based approach to planning with incomplete information and sensing","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Representation (politics); Knowledge representation and reasoning; Range (aeronautics); Knowledge-based systems; Complete information; Artificial intelligence; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02122293856793146,"gpt":0.2360273122433418,"spread":0.2148043736754103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004451768,0.000119229,0.00009519282,0.0001317554,0.0004122118,0.0003907553,0.0002582863,0.00002992119,5.939812e-7],"category_scores_gemma":[0.00002223772,0.00007369254,0.00001404963,0.0003982286,0.0000288781,0.0005740477,0.0001031933,0.0001336051,0.0000150818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000383944,"about_ca_system_score_gemma":0.00009618824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008302265,"about_ca_topic_score_gemma":0.000004806458,"domain_scores_codex":[0.9992537,0.00003610284,0.0001503296,0.0001759411,0.0001532525,0.0002307095],"domain_scores_gemma":[0.9994291,0.0001251201,0.00005769323,0.0002500027,0.00005379874,0.0000842536],"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.00004055896,0.00003673382,0.00233571,0.0001055842,0.000027778,0.000009390861,0.02530552,0.7801628,0.0001872173,0.07058131,0.0005003251,0.1207071],"study_design_scores_gemma":[0.0009373046,0.0002007887,0.003468304,0.0003484966,0.000009559178,0.0001196893,0.0006021229,0.9840221,0.0007281638,0.001083948,0.008067138,0.0004123464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01553369,0.00007059922,0.9724419,0.0008019628,0.00004370102,0.0001558822,5.897965e-7,0.0001782903,0.01077338],"genre_scores_gemma":[0.6593041,2.115083e-7,0.3398921,0.0007610466,0.00001845292,0.000002970785,0.000003639532,0.000003668201,0.00001375426],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6437705,"threshold_uncertainty_score":0.3768062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1550791699","doi":"10.1007/978-94-010-0874-7_5","title":"The Berkeley UNIX Consultant Project","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"RTDS Technologies (Canada)","funders":"Office of Naval Research; Space and Naval Warfare Systems Command; Advanced Research Projects Agency; National Science Foundation","keywords":"Computer science; Unix; Knowledge representation and reasoning; Programming language; Component (thermodynamics); Artificial intelligence; Knowledge base; Human–computer interaction; Natural language; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.01969993678959101,"gpt":0.2282638383409312,"spread":0.2085639015513402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993357,0.0003075111,0.0002306899,0.00008722817,0.000453351,0.0003598272,0.001316272,0.0002252118,0.0001765627],"category_scores_gemma":[0.00001980059,0.0001913164,0.0001078199,0.00006557734,0.0001031105,0.0001057684,0.0001754389,0.0005032363,0.0005719999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003807582,"about_ca_system_score_gemma":0.0004342379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009176388,"about_ca_topic_score_gemma":0.00003591013,"domain_scores_codex":[0.9984908,0.00003408044,0.0003103226,0.0004753067,0.0003374776,0.0003520189],"domain_scores_gemma":[0.9982103,0.0005815462,0.0001456757,0.0009060861,0.00008766298,0.00006874572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006489941,0.000003250198,0.00000296239,0.000008156025,0.0000432847,0.00004252189,0.0001827022,0.00001645427,0.000001143486,0.8423227,0.05402733,0.103343],"study_design_scores_gemma":[0.00009800268,0.00006174093,0.000001645241,0.0001271311,0.00001126399,0.0000357444,0.000003130472,0.002834368,0.00001277231,0.03718263,0.9593267,0.000304846],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000001590577,0.001430566,0.01056731,0.001028348,0.0002815665,0.0002770236,0.00001261851,0.0003630394,0.9860379],"genre_scores_gemma":[0.0002840409,0.0006223326,0.007995694,0.0006023365,0.0001279518,0.00001048203,0.00001741898,0.00003091259,0.9903088],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9052994,"threshold_uncertainty_score":0.7801657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167994996","doi":"","title":"Partial pathfinding using map abstraction and refinement","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Pathfinding; Computer science; Heuristic; Domain (mathematical analysis); Process (computing); Path (computing); Function (biology); Motion planning; Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Programming language; Mathematics; Shortest path problem; Robot","retraction":null,"screen_n_in":null,"score":{"opus":0.1908300048191129,"gpt":0.3618077080581525,"spread":0.1709777032390396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020961,0.0001369859,0.0001082739,0.0001506978,0.0003047046,0.0002869339,0.0002643669,0.00007478159,0.0001296878],"category_scores_gemma":[0.0001030239,0.0001395699,0.00002982535,0.0001693964,0.0000488965,0.0004351197,0.00006393177,0.0002177938,0.0001924998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125068,"about_ca_system_score_gemma":0.0001756344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003824419,"about_ca_topic_score_gemma":0.00001974616,"domain_scores_codex":[0.9984971,0.00005267314,0.0003337686,0.0003795312,0.0005022947,0.0002345825],"domain_scores_gemma":[0.9992464,0.0001561051,0.0001357597,0.0001419869,0.0002323063,0.00008742409],"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.00002017558,0.00006894961,0.0000820284,0.000007458731,0.000007959638,0.0000038191,0.0005553389,0.02238016,0.004778466,0.7219204,0.0001142854,0.2500609],"study_design_scores_gemma":[0.0000267854,0.00007355007,0.0002017848,0.00006967636,0.000003519275,0.000008403925,0.00006339703,0.9318553,0.02677323,0.03836534,0.00235012,0.0002089332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04485276,0.00005637815,0.9451666,0.005632508,0.0004412541,0.0001463107,0.000008560251,0.000134902,0.003560674],"genre_scores_gemma":[0.9670293,0.000007858142,0.0322697,0.0003685495,0.0002305802,0.000007698942,0.000005924791,0.000005347178,0.00007501959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9221765,"threshold_uncertainty_score":0.5691494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601278281","doi":"10.48550/arxiv.1301.4608","title":"Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (2002)","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Artificial intelligence; Engineering; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1056014890786719,"gpt":0.1983157434440623,"spread":0.09271425436539042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000357705,0.0002701867,0.0002992175,0.0002255616,0.0001137394,0.0001246215,0.002500331,0.0002471661,0.00005600253],"category_scores_gemma":[0.00005770988,0.0002324275,0.0001298752,0.0007405218,0.0001649618,0.0002254689,0.001228885,0.0008444451,0.0000637437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499776,"about_ca_system_score_gemma":0.0002501348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005306592,"about_ca_topic_score_gemma":0.00004784202,"domain_scores_codex":[0.9983234,0.00006644471,0.0002948297,0.0008256909,0.0001461623,0.0003434396],"domain_scores_gemma":[0.9985399,0.0001305979,0.0003856572,0.0005998857,0.0002573944,0.00008658033],"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.00002307401,0.00008193067,0.002632714,0.0000773576,0.00001742502,0.00001300649,0.0006004192,0.2070486,0.00005751478,0.7877516,0.000351374,0.001345024],"study_design_scores_gemma":[0.0000712109,0.00007094534,0.001143882,0.0006368824,0.00001513904,0.00000118006,0.0001599236,0.8144333,0.001135795,0.1819342,0.00007440776,0.0003230521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8784969,0.00004419627,0.1052649,0.0005845192,0.0007251267,0.0007029118,0.00001714086,0.0001533216,0.01401098],"genre_scores_gemma":[0.9986246,0.00004592226,0.0007009372,0.00007017759,0.00003072123,0.000001788241,0.000001948793,0.000008677764,0.0005152392],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6073848,"threshold_uncertainty_score":0.9478118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1621585639","doi":"10.1613/jair.740","title":"Partial-Order Planning with Concurrent Interacting Actions","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Planner; Computer science; Order (exchange); Plan (archaeology); Representation (politics); Task (project management); Action (physics); Simple (philosophy); Control (management); Distributed computing; Artificial intelligence; Engineering; Systems engineering; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.328713626214809,"gpt":0.4722555756749504,"spread":0.1435419494601414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003450575,0.0001357567,0.0002244513,0.0005457481,0.0005286296,0.0005403721,0.0009203306,0.00006662449,0.0000955862],"category_scores_gemma":[0.0008006478,0.0001042508,0.00007401509,0.001434555,0.0001345827,0.0009439102,0.000148917,0.001362032,0.00008099977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001155131,"about_ca_system_score_gemma":0.0004463054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005682752,"about_ca_topic_score_gemma":0.00001540958,"domain_scores_codex":[0.9971448,0.0003450814,0.0006491666,0.0002533457,0.001000157,0.000607432],"domain_scores_gemma":[0.9964641,0.001411087,0.0003203015,0.0002813433,0.001275545,0.0002475842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003982786,0.0004778474,0.006557595,0.00003967575,0.0001503666,0.001480694,0.01175857,0.09565782,0.005208951,0.03339171,0.002105069,0.8427734],"study_design_scores_gemma":[0.0002727204,0.00441494,0.0004212783,0.002843173,0.00004078317,0.003204652,0.01502498,0.80771,0.08076125,0.0146547,0.06973782,0.0009137247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0692778,0.0003211819,0.9258031,0.002462589,0.0006398152,0.00009966575,5.015937e-7,0.00003474967,0.001360573],"genre_scores_gemma":[0.9816054,0.00005813855,0.01771579,0.00003971046,0.0004472051,0.000004359264,5.544414e-7,0.00001180221,0.0001170583],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9123276,"threshold_uncertainty_score":0.5917426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W269605412","doi":"10.1609/icaps.v22i1.13520","title":"Improved Non-Deterministic Planning by Exploiting State Relevance","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relevance (law); Planner; Probabilistic logic; State (computer science); Computer science; Observable; Work (physics); Theoretical computer science; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Engineering; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.03166301535650045,"gpt":0.2840752904139964,"spread":0.252412275057496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478953,0.0002508074,0.0002396115,0.000137567,0.0003096579,0.0003800715,0.001054913,0.00009021149,0.000004248237],"category_scores_gemma":[0.0003941914,0.0002048106,0.00005602117,0.0001986013,0.00006591032,0.0007681923,0.0003084067,0.0004271627,0.000004183517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004540395,"about_ca_system_score_gemma":0.00005534843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001414782,"about_ca_topic_score_gemma":5.785938e-8,"domain_scores_codex":[0.9983092,0.0000149325,0.0004253042,0.0003715545,0.000423151,0.0004558651],"domain_scores_gemma":[0.9987249,0.0002457559,0.0005153993,0.0001294047,0.0002489907,0.0001354849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002841107,0.0002689758,0.1322929,0.0004969759,0.0003663013,0.00001195613,0.02511745,0.007758783,0.7862602,0.03017949,0.005063578,0.01189931],"study_design_scores_gemma":[0.0003344654,0.00008236597,0.001748579,0.001539847,0.00001135318,0.00003601685,0.0005362814,0.9589117,0.0356483,0.000704371,0.0001503328,0.0002964282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9790848,0.0002939337,0.01372756,0.0008847297,0.0006850679,0.0001596787,0.0000165062,0.0005333481,0.004614405],"genre_scores_gemma":[0.9817498,0.00001061775,0.01767656,0.0002620879,0.00007313248,0.00001614081,0.000005301787,0.00001830419,0.0001880782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9511529,"threshold_uncertainty_score":0.8351932,"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":"W2143380318","doi":"10.1061/(asce)0887-3801(2002)16:2(104)","title":"Case-Based Reasoning System for Modeling Infrastructure Deterioration","year":2002,"lang":"en","type":"article","venue":"Journal of Computing in Civil Engineering","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Reuse; Computer science; Case-based reasoning; Representation (politics); Component (thermodynamics); Decomposition; Knowledge representation and reasoning; Extensibility; Adaptation (eye); Data modeling; Software engineering; Data mining; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01542376768750179,"gpt":0.2112121119190748,"spread":0.195788344231573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009366884,0.0001569982,0.0002714603,0.0003563976,0.0001115787,0.0001740323,0.0003362093,0.00008338422,0.000001142302],"category_scores_gemma":[0.0001513388,0.0001564539,0.00009731824,0.0003270297,0.000004057913,0.0003344506,0.00003944847,0.0003425818,4.889305e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001756433,"about_ca_system_score_gemma":0.00004185766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004910361,"about_ca_topic_score_gemma":0.00000276693,"domain_scores_codex":[0.9986976,0.00003862349,0.0006033838,0.0001634934,0.000205726,0.0002911921],"domain_scores_gemma":[0.9989959,0.0003037294,0.0003021457,0.0001677261,0.0001505775,0.00007992859],"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.000003168138,0.000006084143,0.0002941953,0.0001449152,0.000008997074,0.0003270136,0.0007938684,0.9952363,0.0003611195,0.0002482967,0.00002589296,0.002550117],"study_design_scores_gemma":[0.0005149036,0.00008061042,0.00004420612,0.001146261,0.000007714387,0.002288572,0.00003703463,0.9955016,0.0001425071,0.00001660155,0.00006295315,0.0001570009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2047396,0.0002501513,0.7943243,0.000040294,0.0004616372,0.00006739773,5.1266e-7,0.00008175619,0.00003424703],"genre_scores_gemma":[0.7321007,7.984415e-7,0.267716,0.00001597597,0.0001512543,9.737649e-7,3.138824e-7,0.0000131807,8.378925e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.527361,"threshold_uncertainty_score":0.6380004,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387937021","doi":"10.1007/s10514-023-10136-2","title":"Large language models for chemistry robotics","year":2023,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; Artificial Intelligence in Medicine (Canada); University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robotics; Executable; Robot; Task (project management); Artificial intelligence; Natural language; Workspace; Human–computer interaction; Software engineering; Programming language; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02230099062276004,"gpt":0.2621864641874539,"spread":0.2398854735646939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003807522,0.0001513029,0.0001683827,0.00005630732,0.00021591,0.0001255167,0.0006648402,0.0001033017,0.00001056728],"category_scores_gemma":[0.00003731923,0.0001559605,0.00008742537,0.0003336757,0.00001329695,0.0002545313,0.0002069516,0.0001310744,0.000137138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004149878,"about_ca_system_score_gemma":0.0001164305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001364604,"about_ca_topic_score_gemma":0.000002791169,"domain_scores_codex":[0.9987287,0.00001810457,0.0001921028,0.0003795117,0.0001423682,0.0005392027],"domain_scores_gemma":[0.9990864,0.0001747578,0.00007272201,0.0005178881,0.00004538183,0.0001028208],"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.000003697316,0.00003754207,0.00007118376,0.0000913484,0.00002650789,0.00004798746,0.003320699,0.9562873,0.001381868,0.02092614,0.01139214,0.006413648],"study_design_scores_gemma":[0.0003054758,0.00002352561,0.00003511244,0.00002718762,0.000006445906,0.000008241261,0.00008493609,0.9894836,0.001668052,0.005987175,0.002150505,0.000219753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003280757,0.0002049203,0.9909833,0.001201768,0.0002533904,0.000169761,0.00002444411,0.001136142,0.002745499],"genre_scores_gemma":[0.8311322,0.00001172311,0.1552387,0.0005896582,0.0002351626,0.00008759343,0.0001634821,0.0000492853,0.0124922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8357446,"threshold_uncertainty_score":0.6359885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1848921964","doi":"","title":"Planning with first-order temporally extended goals using heuristic search","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Nondeterministic algorithm; Heuristic; Parameterized complexity; Benchmark (surveying); Correctness; Heuristics; Domain (mathematical analysis); Plan (archaeology); Representation (politics); Automaton; Exploit; Mathematical optimization; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02488262853350111,"gpt":0.2607719619028757,"spread":0.2358893333693745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004050627,0.0001968826,0.0001892406,0.0001447331,0.0003968375,0.000323803,0.0005459227,0.0000667206,0.00003971398],"category_scores_gemma":[0.00002228211,0.0001549849,0.00003255175,0.0005698792,0.00004748866,0.0003834273,0.0001382182,0.0002027815,0.0000359482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004347517,"about_ca_system_score_gemma":0.0002284922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001040813,"about_ca_topic_score_gemma":0.00005465131,"domain_scores_codex":[0.9983232,0.00006690556,0.000246811,0.0004612244,0.0003962981,0.0005055832],"domain_scores_gemma":[0.9989871,0.0002629779,0.00007809854,0.0004415894,0.0001342774,0.00009594738],"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.00008088355,0.0002415471,0.2273952,0.0002216598,0.00007628401,0.001051749,0.001718409,0.7224589,0.001369765,0.02920418,0.01373509,0.002446292],"study_design_scores_gemma":[0.0007681167,0.0002592594,0.01431645,0.0003825944,0.00001495781,0.000176765,0.00007289941,0.9779729,0.0009302882,0.002076077,0.002364748,0.0006649099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04930841,0.0002208322,0.9391914,0.0004963577,0.00007815057,0.0001350974,0.000001601998,0.0003699089,0.01019822],"genre_scores_gemma":[0.6736434,6.168724e-7,0.3249312,0.0001514132,0.00006836884,0.000003732024,0.000006046198,0.00001479573,0.001180483],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6243349,"threshold_uncertainty_score":0.6320102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078022838","doi":"10.1080/08839510701492579","title":"A KEYHOLE PLAN RECOGNITION MODEL FOR ALZHEIMER'S PATIENTS: FIRST RESULTS","year":2007,"lang":"en","type":"article","venue":"Applied Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi; Université de Sherbrooke","funders":"","keywords":"Computer science; Plan (archaeology); Keyhole; Artificial intelligence; Cognitive impairment; Set (abstract data type); Cognition; Cognitive model; Machine learning; Cognitive psychology; Psychology; Programming language; Psychiatry","retraction":null,"screen_n_in":null,"score":{"opus":0.1183931115383861,"gpt":0.2878337376253449,"spread":0.1694406260869588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950902,0.0001976376,0.0001643065,0.0001283186,0.0004136198,0.0001539378,0.0006128114,0.0001260691,0.000005084127],"category_scores_gemma":[0.0001138468,0.000203055,0.00006717457,0.0003234975,0.00005411561,0.0002285146,0.00009644582,0.0001762561,0.0002108755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003527332,"about_ca_system_score_gemma":0.00004892424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000380175,"about_ca_topic_score_gemma":0.0001213403,"domain_scores_codex":[0.9980192,0.00001275459,0.0006041612,0.0005836809,0.0002583456,0.0005219194],"domain_scores_gemma":[0.9985472,0.0005425359,0.0001996957,0.0004086018,0.0001636017,0.000138348],"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.0005613366,0.0002799759,0.00004151144,0.00002312195,0.00004195522,0.000004124141,0.005530654,0.03195594,0.0003203478,0.092415,0.002655278,0.8661708],"study_design_scores_gemma":[0.0001332721,0.0001545673,0.00002565682,0.00004706326,0.00002082194,0.000001104613,0.0001234972,0.8122419,0.04819616,0.1368407,0.001787137,0.0004282318],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004442834,0.0000334408,0.9906029,0.0003206896,0.0002914617,0.0005137919,0.00006538406,0.0002388772,0.003490646],"genre_scores_gemma":[0.8879379,0.000003610343,0.1112837,0.000411489,0.0001315066,0.00005824128,0.0001307815,0.00001626534,0.00002656007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.883495,"threshold_uncertainty_score":0.8280345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W121593559","doi":"","title":"Generalizing GraphPlan by formulating planning as a CSP","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Implementation; Encoding (memory); Computer science; Automated planning and scheduling; Graph; Set (abstract data type); Simple (philosophy); Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01597510617832052,"gpt":0.2519783742469103,"spread":0.2360032680685898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000480668,0.000162829,0.0001403642,0.00009974686,0.0003582446,0.0002438546,0.0004056947,0.00007050953,0.00004322728],"category_scores_gemma":[0.00006863871,0.0001479774,0.00005643362,0.0003356698,0.0000127007,0.0004300634,0.0000619736,0.000172417,0.00005044424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002007543,"about_ca_system_score_gemma":0.00004935876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001171953,"about_ca_topic_score_gemma":0.000001754765,"domain_scores_codex":[0.9986579,0.00008007685,0.0002273422,0.0003607739,0.0002249919,0.0004489032],"domain_scores_gemma":[0.9992742,0.0001547104,0.00008471229,0.0003266771,0.00003006338,0.0001296406],"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.00001008235,0.00008559791,0.09360259,0.00006615127,0.00009796376,0.000164232,0.007412795,0.01572467,0.018371,0.7521164,0.09097762,0.02137092],"study_design_scores_gemma":[0.002489011,0.0006575485,0.0009031764,0.0005620038,0.00003565958,0.0006436637,0.000781155,0.5630813,0.08445697,0.06949449,0.2739002,0.002994833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0650671,0.0007926826,0.8551047,0.0002282219,0.0002248626,0.00009282779,0.000001311874,0.000491914,0.07799634],"genre_scores_gemma":[0.8282833,0.000002486053,0.1693424,0.001167831,0.00002612413,0.000006730997,0.000007147004,0.00001256393,0.001151395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7632162,"threshold_uncertainty_score":0.6034343,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129975315","doi":"","title":"HTN planning with preferences","year":2009,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Planner; Heuristics; Computer science; Preference; Task (project management); Set (abstract data type); Domain (mathematical analysis); Quality (philosophy); Control (management); Automated planning and scheduling; Range (aeronautics); Extension (predicate logic); Competition (biology); Artificial intelligence; Operations research; Mathematics; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02053908511863492,"gpt":0.2401396641766325,"spread":0.2196005790579975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001227456,0.00008147729,0.00007572796,0.00004583881,0.0001055927,0.0001419152,0.000401006,0.00002739178,0.00001874053],"category_scores_gemma":[0.000005724734,0.00005419153,0.00001279423,0.0001788853,0.00001004676,0.0002983523,0.00002337017,0.00009173295,0.00003049316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005975139,"about_ca_system_score_gemma":0.0000402374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001346003,"about_ca_topic_score_gemma":0.000001470333,"domain_scores_codex":[0.9993547,0.00001881847,0.00007991702,0.0002050129,0.000147961,0.0001936139],"domain_scores_gemma":[0.9996129,0.0000542625,0.00003306684,0.0002183877,0.0000227916,0.00005853753],"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.00007674,0.0001905356,0.08694272,0.00003421012,0.00006490588,0.0002989018,0.01276267,0.02499653,0.0007764759,0.3076281,0.03086638,0.5353618],"study_design_scores_gemma":[0.003827566,0.00941866,0.2796875,0.00172764,0.00005385145,0.0005199598,0.001112278,0.464312,0.02179361,0.1445474,0.06875311,0.004246382],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04080715,0.0001868738,0.828306,0.001339102,0.0000458526,0.00005660467,2.551917e-7,0.0004714828,0.1287867],"genre_scores_gemma":[0.8787533,9.355378e-7,0.1197881,0.0007191675,0.0000192875,0.000001280202,0.000001059209,0.0000017367,0.0007151495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8379461,"threshold_uncertainty_score":0.2209866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1557519121","doi":"10.1613/jair.2293","title":"Graph Abstraction in Real-time Heuristic Search","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"University of Alberta; Western Canada Research Grid","keywords":"Computer science; Abstraction; Incremental heuristic search; Heuristic; Graph; Maxima and minima; Theoretical computer science; Pathfinding; Class (philosophy); Situated; Beam search; Artificial intelligence; Search algorithm; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1599400188619807,"gpt":0.4311293688593298,"spread":0.2711893499973491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01941097,0.0001109318,0.0002192197,0.001531033,0.0002249931,0.0002657706,0.001029896,0.0001175646,0.00007408169],"category_scores_gemma":[0.0006767864,0.0001002098,0.00009457166,0.001927722,0.0001427957,0.0005793924,0.0001219779,0.001381841,0.0002630583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002022089,"about_ca_system_score_gemma":0.0003854085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004245291,"about_ca_topic_score_gemma":0.00007439489,"domain_scores_codex":[0.9963234,0.0003830417,0.0009273931,0.0002512821,0.001359686,0.0007551763],"domain_scores_gemma":[0.9964144,0.001978656,0.0001816657,0.0003016041,0.0008705085,0.0002532028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006638227,0.0007207816,0.003919245,0.00008410973,0.00004587058,0.002697017,0.006474966,0.02763581,0.1090301,0.03759545,0.00144831,0.8096845],"study_design_scores_gemma":[0.0002774872,0.003837665,0.01953203,0.001327051,0.00001500204,0.000934381,0.005159153,0.2802083,0.404863,0.2813379,0.001523885,0.0009840402],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3777869,0.000182844,0.6173208,0.001119923,0.0003866613,0.0001518227,7.660321e-7,0.00003222615,0.00301805],"genre_scores_gemma":[0.9835452,0.0001479187,0.0158708,0.0000144983,0.0002852159,9.510731e-7,5.379702e-7,0.000009965436,0.0001249206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8087005,"threshold_uncertainty_score":0.6727492,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965569070","doi":"10.1609/icaps.v29i1.3529","title":"Learning Interpretable Models Expressed in Linear Temporal Logic","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Artificial intelligence; Computer science; Linear temporal logic; Oracle; Classifier (UML); Machine learning; Relevance (law); Set (abstract data type); Feature learning; Temporal logic; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03469309263076131,"gpt":0.2746181787677578,"spread":0.2399250861369965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094693,0.0001710577,0.0002185737,0.0002093691,0.00009388377,0.0002346463,0.000980353,0.00009863582,0.00001196056],"category_scores_gemma":[0.0001161379,0.0001348767,0.0000467667,0.0002216577,0.00003140702,0.0005794755,0.000306872,0.0004998436,0.000007781716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003523999,"about_ca_system_score_gemma":0.00006164364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004468288,"about_ca_topic_score_gemma":3.510207e-7,"domain_scores_codex":[0.9986811,0.00001962529,0.0003283138,0.0003779216,0.0003572413,0.0002358501],"domain_scores_gemma":[0.9992529,0.0001158698,0.0002807706,0.00009901668,0.000204027,0.00004746944],"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.0002037775,0.0001109005,0.2122028,0.0002076209,0.00009449525,0.000008791258,0.009092001,0.5188761,0.07368477,0.1837224,0.0001976394,0.001598751],"study_design_scores_gemma":[0.0003266842,0.00008998576,0.0008246133,0.001394768,0.000002813471,0.000008960975,0.0004902803,0.9859009,0.004195221,0.006576291,0.00003259948,0.000156828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9809986,0.00007080512,0.004011892,0.001064565,0.0003581318,0.0001422957,0.000002916045,0.0003539987,0.01299677],"genre_scores_gemma":[0.9825515,0.000009315697,0.0169172,0.00013964,0.00001864758,0.000007187342,0.000003467959,0.000009773821,0.0003432868],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4670249,"threshold_uncertainty_score":0.5500113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406423292","doi":"10.1609/aaai.v25i1.7845","title":"Preferred Explanations: Theory and Generation via Planning","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exploit; Computer science; Domain (mathematical analysis); Artificial intelligence; Characterization (materials science); Dynamical systems theory; Theoretical computer science; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.173450729752352,"gpt":0.2962124010431704,"spread":0.1227616712908184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538896,0.0001572189,0.0001468967,0.0001182457,0.000264859,0.0001549393,0.0008667798,0.00007500967,0.00003762206],"category_scores_gemma":[0.0002544848,0.000120147,0.00004133972,0.0002904593,0.0001312437,0.0004819162,0.0001859308,0.0002033287,0.00001988222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657954,"about_ca_system_score_gemma":0.00004564037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002294431,"about_ca_topic_score_gemma":0.000002624019,"domain_scores_codex":[0.9987925,0.00003709098,0.0003433317,0.0003586282,0.0002495605,0.0002188775],"domain_scores_gemma":[0.9990966,0.0001136459,0.0002573336,0.0001946044,0.0002727063,0.00006506329],"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.00004176572,0.00004544568,0.0006595783,0.00001751973,0.00001213112,4.735664e-7,0.007821449,0.0000448456,0.0177895,0.9299949,0.0001059896,0.0434664],"study_design_scores_gemma":[0.00002706738,0.0001897167,0.0005865553,0.0002143665,0.00001349109,0.000009804214,0.0005668197,0.1326769,0.4336383,0.4318036,0.00003920222,0.0002342691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2765002,0.0001743715,0.6983963,0.000939096,0.0005598369,0.0004792569,0.000004420016,0.0002096108,0.02273692],"genre_scores_gemma":[0.9894584,0.00001269723,0.01015914,0.0001608625,0.00004819849,0.00002136742,7.964019e-7,0.000007613184,0.0001309518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7129582,"threshold_uncertainty_score":0.4899454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W105409620","doi":"","title":"Planning with loops","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Planner; Computer science; Strengths and weaknesses; Iterative method; Work (physics); Automated theorem proving; Theoretical computer science; Algorithm; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1145712606826355,"gpt":0.3172324644868931,"spread":0.2026612038042576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003372635,0.0002246544,0.0001723805,0.0002338197,0.0001660284,0.0004889778,0.001102344,0.00007127498,0.0003461747],"category_scores_gemma":[0.00008729518,0.0001922424,0.00005863658,0.0002358084,0.00008780668,0.0005751471,0.0001310476,0.0003495588,0.001014456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008953448,"about_ca_system_score_gemma":0.0001472777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003712381,"about_ca_topic_score_gemma":0.00002701686,"domain_scores_codex":[0.9980563,0.00005140116,0.0004193847,0.0005382781,0.0005897627,0.0003448981],"domain_scores_gemma":[0.9988463,0.000141263,0.0001757139,0.0003957392,0.0003071533,0.0001338272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000533474,0.0001029643,0.0002277127,0.000003315452,0.00002910293,0.0000565269,0.001072613,0.02855326,0.001130393,0.7087829,0.0003806533,0.2596073],"study_design_scores_gemma":[0.00008495749,0.0004064783,0.0004142515,0.0004691948,0.000006956486,0.00008294704,0.0002793793,0.8724402,0.0683325,0.04791871,0.008938551,0.0006259196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009655631,0.00002584396,0.9416199,0.01258386,0.0005156281,0.0001203268,0.00000586046,0.0002731387,0.03519977],"genre_scores_gemma":[0.9509874,0.000006969231,0.04705975,0.001128702,0.0002771903,0.00001849339,0.000008928511,0.00001183578,0.0005007116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9413318,"threshold_uncertainty_score":0.9997634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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":"W1857953989","doi":"10.1609/aimag.v29i4.2204","title":"Planning with Preferences","year":2008,"lang":"en","type":"article","venue":"AI Magazine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Automated planning and scheduling; Computer science; Task (project management); Quality (philosophy); Set (abstract data type); Preference; State (computer science); Representation (politics); Artificial intelligence; Operations research; Human–computer interaction; Management science; Engineering; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02754505654107807,"gpt":0.2408190002446912,"spread":0.2132739437036132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001074284,0.0001084262,0.0001107426,0.00006161305,0.0001860307,0.00005558803,0.0004169588,0.00003361503,0.0000238764],"category_scores_gemma":[0.00001196712,0.00008063833,0.00001782052,0.0002534954,0.00004222695,0.0003528791,0.00007005696,0.0001529193,0.0001936669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000836083,"about_ca_system_score_gemma":0.00007795644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001300275,"about_ca_topic_score_gemma":0.000002546706,"domain_scores_codex":[0.9991856,0.00002740349,0.0001072949,0.0002494504,0.0001953351,0.0002349129],"domain_scores_gemma":[0.9994687,0.00007295446,0.00004825009,0.0002908333,0.00004782533,0.00007137374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001093837,0.0001948297,0.676106,0.00009576278,0.0001269133,0.001972565,0.0124983,0.01721878,0.001323175,0.0203632,0.2239251,0.04606602],"study_design_scores_gemma":[0.003411602,0.003010388,0.4916531,0.0009461147,0.00004260605,0.002583715,0.00008491985,0.1576424,0.004888413,0.01011553,0.3231474,0.002473784],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1934882,0.0006350351,0.7545616,0.002611227,0.0002150544,0.0001336607,0.000002438537,0.0006896296,0.04766317],"genre_scores_gemma":[0.9502776,0.00000609586,0.04729263,0.0008561938,0.00005516687,0.000006465735,0.000004735112,0.000006771221,0.001494361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7567894,"threshold_uncertainty_score":0.3288336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105263699","doi":"10.1139/l11-016","title":"Cost estimation model for building projects using case-based reasoning","year":2011,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Estimation; Cost estimate; Computer science; Model building; Engineering; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.06934836077658472,"gpt":0.2470057902140135,"spread":0.1776574294374288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605822,0.0001328771,0.0001657858,0.0004614107,0.0001873837,0.0001225835,0.000311194,0.00006345606,0.000004099827],"category_scores_gemma":[0.0002350048,0.0001435765,0.00007579572,0.0002359879,0.00001090373,0.0005169484,0.000009693099,0.0001936592,3.020691e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002140884,"about_ca_system_score_gemma":0.00123745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008775876,"about_ca_topic_score_gemma":0.004404324,"domain_scores_codex":[0.9990782,0.00001437986,0.0002857286,0.0001340564,0.0001056557,0.0003819441],"domain_scores_gemma":[0.9990218,0.00008796422,0.0001791507,0.0001597014,0.0001664389,0.000384939],"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.000002544673,0.000002297266,0.0001902393,0.00004352861,0.00001242162,0.0003984425,0.001491909,0.9948223,0.0001589991,0.001578902,0.00007957994,0.001218846],"study_design_scores_gemma":[0.000237061,0.00004271271,0.00001946675,0.0004356475,0.00001774458,0.001246459,0.00001823503,0.996923,0.0006148616,0.0002082464,0.00007311405,0.0001634966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01471584,0.0001970177,0.9844971,0.000030974,0.0003094603,0.0001298209,0.000004785786,0.00003284675,0.00008214231],"genre_scores_gemma":[0.5660885,1.732247e-7,0.4338332,0.00002475847,0.00003523708,0.000002597807,4.498486e-7,0.0000122723,0.000002812598],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5513727,"threshold_uncertainty_score":0.5854879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604825101","doi":"10.1609/aaai.v31i1.11058","title":"Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear temporal logic; Planner; Domain (mathematical analysis); Observable; Computer science; Automaton; Finite-state machine; State (computer science); Theoretical computer science; Finite state; Point (geometry); Mathematics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.07026156845158368,"gpt":0.3090788379014295,"spread":0.2388172694498459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006168204,0.0002964139,0.0003298381,0.0001244993,0.0008381868,0.001203597,0.002206123,0.0001053986,0.00001556081],"category_scores_gemma":[0.0004664308,0.0002076806,0.00006195664,0.0001830865,0.0004812183,0.0008408743,0.0004512884,0.000389178,0.00001785519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001637915,"about_ca_system_score_gemma":0.0001340298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007146729,"about_ca_topic_score_gemma":0.000008974448,"domain_scores_codex":[0.9981135,0.00001394275,0.0004533448,0.0005831107,0.0004405605,0.0003955012],"domain_scores_gemma":[0.9979834,0.0002338651,0.0008045743,0.0005249743,0.0003262334,0.0001269394],"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.000957502,0.0004375479,0.0821475,0.0006034264,0.0001782278,0.00006046268,0.02285423,0.001320081,0.02901739,0.6291819,0.0006180932,0.2326237],"study_design_scores_gemma":[0.0003181683,0.002134278,0.0438701,0.004932228,0.00008816364,0.0000551552,0.001253443,0.623574,0.1450791,0.1767404,0.00046179,0.001493222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9262111,0.0000911676,0.04432632,0.004059232,0.0004814847,0.0006856394,0.00001496561,0.0001879207,0.02394213],"genre_scores_gemma":[0.993945,0.00001650563,0.005490925,0.0001991797,0.00005731434,0.00001946805,4.864436e-7,0.00001546503,0.0002556322],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6222539,"threshold_uncertainty_score":0.9998332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W92128319","doi":"10.5591/978-1-57735-516-8/ijcai11-159","title":"Generalized planning: synthesizing plans that work for multiple environments","year":2011,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Recursively enumerable language; Formalism (music); Constructive; Mathematics; Finite set; Sequence (biology); Computer science; Set (abstract data type); Theoretical computer science; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1044019419713759,"gpt":0.2441648993010664,"spread":0.1397629573296904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003127287,0.0001688031,0.0001635969,0.0000694408,0.0002175055,0.00007587407,0.0006678712,0.00008304767,0.000046022],"category_scores_gemma":[0.00003684244,0.0001459943,0.00007653919,0.00009276134,0.00002299131,0.0002686396,0.0001173069,0.00009156905,0.00005366177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002197756,"about_ca_system_score_gemma":0.00001726388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004500944,"about_ca_topic_score_gemma":0.000002042795,"domain_scores_codex":[0.9988238,0.00004658903,0.0001750293,0.0003880965,0.0001626382,0.0004038999],"domain_scores_gemma":[0.9990181,0.0003570086,0.00008849844,0.0004186042,0.000006858336,0.0001108963],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002795304,0.0002646663,0.9075016,0.00006266488,0.0002066043,0.00008410202,0.01705024,0.00326023,0.002533802,0.01773186,0.01850033,0.03252441],"study_design_scores_gemma":[0.00760027,0.0008292522,0.1951646,0.0009549576,0.0001430337,0.00007803818,0.0008607197,0.317738,0.2750452,0.01313243,0.1841015,0.004352009],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03478708,0.0001400532,0.961161,0.00008902874,0.0002660012,0.0002243963,0.000005837562,0.0002411251,0.003085532],"genre_scores_gemma":[0.6598579,0.00000266048,0.3386531,0.0003173657,0.00003617334,0.00004229894,0.000006945972,0.00001350797,0.001070015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.712337,"threshold_uncertainty_score":0.5953473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133180954","doi":"10.1613/jair.1676","title":"Decision-Theoretic Planning with non-Markovian Rewards","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Australian Government; National ICT Australia","keywords":"Markov decision process; Computer science; Markov process; Partially observable Markov decision process; Heuristic; Probabilistic logic; Planner; Mathematical optimization; Decision problem; Process (computing); Function (biology); Artificial intelligence; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.06525791475197834,"gpt":0.3788264025247418,"spread":0.3135684877727634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006385134,0.0001642231,0.0002835183,0.0007851908,0.0004616969,0.0005846304,0.001540025,0.0001046401,0.00005384284],"category_scores_gemma":[0.0005118882,0.0001197943,0.0001038976,0.001420383,0.0002656936,0.0005773912,0.000177951,0.00108028,0.00008317517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001235439,"about_ca_system_score_gemma":0.0005819289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001092044,"about_ca_topic_score_gemma":0.00002068085,"domain_scores_codex":[0.9962333,0.0002828832,0.0007902759,0.0003122714,0.001687048,0.0006942073],"domain_scores_gemma":[0.9960357,0.00185099,0.0002816543,0.000451644,0.001153259,0.0002267338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001218662,0.0005490212,0.006628259,0.00009486771,0.00009006105,0.003586655,0.005005226,0.1536491,0.005537347,0.1296755,0.01201518,0.6819502],"study_design_scores_gemma":[0.000227387,0.004041043,0.001423906,0.002548963,0.00002438655,0.001049885,0.001907746,0.2935932,0.07134192,0.6181481,0.004946143,0.0007472781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1009229,0.000370972,0.8945156,0.00102339,0.0002887651,0.00010881,8.693661e-7,0.00002542631,0.002743301],"genre_scores_gemma":[0.9057747,0.00001896761,0.09360936,0.00003298072,0.0004271007,0.000002766715,5.627056e-7,0.00001534808,0.0001181803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8048518,"threshold_uncertainty_score":0.5637604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129900375","doi":"10.1109/ccece.1997.614837","title":"Computational intelligence in software engineering","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computational intelligence; Software engineering; Software development; Social software engineering; Software construction; Search-based software engineering; Software; Software quality; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01835559352484022,"gpt":0.2137201887761001,"spread":0.1953645952512599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001051392,0.0000588549,0.00005564877,0.0000895125,0.00002848241,0.00005374106,0.0002838562,0.0000241627,0.00009854756],"category_scores_gemma":[0.00005261067,0.00005804716,0.00001539783,0.000269077,0.000005419279,0.0001911034,0.0000546778,0.00009417304,0.000138909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001760541,"about_ca_system_score_gemma":0.000007281169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001453461,"about_ca_topic_score_gemma":0.000001552606,"domain_scores_codex":[0.9994718,0.00001002677,0.000115205,0.0001508436,0.0001056177,0.0001465531],"domain_scores_gemma":[0.9996204,0.0001967932,0.00001496801,0.0001143984,0.00001711604,0.00003626883],"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":[2.321887e-7,0.00001681652,0.00608355,0.000008045058,0.000001936913,0.00001847956,0.0006101108,0.9263141,0.000002724316,0.02680525,0.0007685497,0.03937018],"study_design_scores_gemma":[0.00003177563,0.00001136721,0.001307716,0.00002227708,2.112422e-7,0.000007991879,0.000003582799,0.9967641,0.00004517818,0.001210507,0.0005139805,0.0000813529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001482746,0.0001309462,0.9969228,0.0002721403,0.00008006327,0.00002814309,3.026685e-7,0.0001995957,0.0008832496],"genre_scores_gemma":[0.549342,0.000001572414,0.4503284,0.00015211,0.000009613007,0.000002065121,7.441456e-7,0.000002367297,0.0001611166],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5478593,"threshold_uncertainty_score":0.2367095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293119400","doi":"10.1609/aaai.v26i1.8137","title":"Partial-Expansion A* with Selective Node Generation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Node (physics); A priori and a posteriori; Computer science; Yield (engineering); Branching (polymer chemistry); Domain (mathematical analysis); Pathfinding; Mathematics; Mathematical optimization; Algorithm; Theoretical computer science; Graph; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0722721480175147,"gpt":0.2760375100654326,"spread":0.203765362047918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509695,0.0001852876,0.0001971288,0.00006645446,0.0002967401,0.0002822063,0.0007888458,0.00007868574,0.00003301876],"category_scores_gemma":[0.0002057618,0.0001323727,0.00006391604,0.0007672808,0.0001066492,0.00039779,0.0001802321,0.0002842172,0.00003989069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003987433,"about_ca_system_score_gemma":0.0002783625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003196726,"about_ca_topic_score_gemma":0.00001587026,"domain_scores_codex":[0.9983822,0.00003067742,0.0003350288,0.0005136816,0.0004442593,0.0002941375],"domain_scores_gemma":[0.9983206,0.00007286285,0.0002608247,0.0002747533,0.0009972611,0.00007369516],"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.00006469123,0.0001657818,0.0008981589,0.00003638637,0.00002978679,0.000004108773,0.003344356,0.001936255,0.2894551,0.657002,0.0006607122,0.04640265],"study_design_scores_gemma":[0.0000230404,0.0001488152,0.00008747067,0.000184854,0.00001006267,0.00001121824,0.0001827696,0.1703743,0.8148531,0.01386774,0.00009325913,0.0001633791],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4495823,0.00009703535,0.520464,0.01233701,0.0007257387,0.0005123089,0.000007466901,0.0002701335,0.01600404],"genre_scores_gemma":[0.9869663,0.0000154545,0.01231669,0.0003475372,0.00008753764,0.00001896855,0.000001656887,0.00001007672,0.0002357542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6431342,"threshold_uncertainty_score":0.5398004,"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":"W1546235996","doi":"","title":"Fuzzy Reasoning in JESS: The Fuzzyj Toolkit and Fuzzyjess.","year":2001,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Sandia National Laboratories","keywords":"Computer science; Fuzzy logic; Programming language; Artificial intelligence; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01365037072099916,"gpt":0.2290748992369409,"spread":0.2154245285159418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007122665,0.0001258087,0.0001334534,0.00007809334,0.0002084265,0.000218655,0.0005784829,0.00006179334,0.00002337151],"category_scores_gemma":[0.00008037114,0.00009352046,0.00002722704,0.0004148122,0.0000499353,0.0003228197,0.0001961523,0.0002709755,0.00003502573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002453112,"about_ca_system_score_gemma":0.00004942582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008401289,"about_ca_topic_score_gemma":0.00003935628,"domain_scores_codex":[0.9988517,0.0001044866,0.00017867,0.0003171814,0.0001968577,0.0003510647],"domain_scores_gemma":[0.9991671,0.0002615891,0.00005960687,0.0004134046,0.00002706206,0.00007124015],"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.00004940845,0.00009857558,0.1804207,0.00005251622,0.00003543661,0.0004314987,0.01145887,0.0009917603,0.001894954,0.3321891,0.0202571,0.45212],"study_design_scores_gemma":[0.002779993,0.0004060486,0.135113,0.0009964064,0.00003363128,0.0008305155,0.00103508,0.1593726,0.0008180419,0.566104,0.130783,0.001727695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5442213,0.001872361,0.04217955,0.01514281,0.0005053402,0.0003434954,0.000002905371,0.0003568773,0.3953753],"genre_scores_gemma":[0.9781772,0.00007856156,0.02029009,0.000694054,0.00007881986,0.00001482245,0.00000148423,0.000008347971,0.0006565539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4503923,"threshold_uncertainty_score":0.3813654,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1585557683","doi":"10.1609/icaps.v22i1.13505","title":"Planning Modulo Theories: Extending the Planning Paradigm","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Planner; Computer science; Modular design; Heuristic; Scope (computer science); Syntax; Answer set programming; Automated planning and scheduling; Programming language; Theoretical computer science; Artificial intelligence; Set (abstract data type); Mathematics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04438401684249059,"gpt":0.3012732997910121,"spread":0.2568892829485215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556415,0.0003160551,0.0002754887,0.0002036296,0.0007289774,0.0006347615,0.001798864,0.0001333058,0.0000102821],"category_scores_gemma":[0.0003824864,0.000205713,0.00009315091,0.0003452545,0.0001354277,0.0008988867,0.0004576585,0.000648117,0.000006570303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005560907,"about_ca_system_score_gemma":0.00006673038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611643,"about_ca_topic_score_gemma":6.48956e-8,"domain_scores_codex":[0.9978535,0.00003917639,0.0004673054,0.0004099391,0.0006721712,0.0005578747],"domain_scores_gemma":[0.9984699,0.0004514495,0.0005326263,0.0002140687,0.0001976166,0.0001343748],"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.0001015674,0.00007173033,0.1509589,0.00009404849,0.0002180063,0.000006225696,0.02133107,0.02298848,0.00945764,0.7920606,0.0009114282,0.001800332],"study_design_scores_gemma":[0.0003933276,0.00008021648,0.01431891,0.002508637,0.0000317426,0.0001358736,0.002874925,0.9580395,0.006884391,0.01377862,0.0005132091,0.0004406698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9594037,0.001579435,0.01590888,0.004165377,0.001536473,0.0002678655,0.0000107957,0.0009174102,0.01621005],"genre_scores_gemma":[0.9911872,0.00001291784,0.008051583,0.0003767099,0.0002076922,0.00002085966,0.000004163641,0.00002084526,0.0001180369],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.935051,"threshold_uncertainty_score":0.8388734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1262127546","doi":"","title":"Exploiting procedural domain control knowledge in state-of-the-art planners","year":2007,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Heuristics; Exploit; Domain (mathematical analysis); Automated planning and scheduling; Heuristic; Compiler; Planner; Plan (archaeology); Programming language; Software engineering; Artificial intelligence; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01006548637271815,"gpt":0.2388836938946008,"spread":0.2288182075218826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001211407,0.0001088832,0.0001450653,0.0001104647,0.00008207359,0.00003790286,0.0005590299,0.00003739151,0.000005273928],"category_scores_gemma":[0.00004965128,0.00007956594,0.00004727685,0.0004330437,0.00003612581,0.0002184091,0.00009117644,0.0001737116,0.00002416056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004017437,"about_ca_system_score_gemma":0.0001047924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003445749,"about_ca_topic_score_gemma":0.0001959792,"domain_scores_codex":[0.9988541,0.00006332728,0.0003215302,0.0002176991,0.0001616269,0.0003817339],"domain_scores_gemma":[0.9992035,0.0003454664,0.0001003748,0.0002405319,0.0000463775,0.00006375458],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003752984,0.0006940434,0.4885214,0.0005608056,0.0001286221,0.0002343201,0.06367253,0.01674785,0.01742877,0.115578,0.04015825,0.2559001],"study_design_scores_gemma":[0.019012,0.001280459,0.1585937,0.003435678,0.00003865059,0.0002972566,0.006171855,0.5448433,0.1203726,0.06086529,0.08105897,0.004030291],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.340387,0.0001204384,0.6414306,0.0006826121,0.0002545852,0.0002094834,0.000001576675,0.0001167709,0.0167969],"genre_scores_gemma":[0.9814223,4.727972e-7,0.01760299,0.0003491936,0.00002371363,0.000005743088,7.685068e-7,0.000005278953,0.0005895633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6410353,"threshold_uncertainty_score":0.3244605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W52011011","doi":"","title":"Monitoring plan optimality during execution","year":2007,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Plan (archaeology); Computer science; Imperfect; Look-ahead; Face (sociological concept); Mathematical optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02255633776098078,"gpt":0.2568103548043802,"spread":0.2342540170433994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212752,0.000080757,0.00006888332,0.00006654084,0.0001920444,0.00009297387,0.0003227211,0.00004709127,0.000008998694],"category_scores_gemma":[0.00001617971,0.00007601597,0.0000281538,0.0001779794,0.000009967003,0.0003310529,0.00009820864,0.0001193584,0.00004007692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004296086,"about_ca_system_score_gemma":0.00001636358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007419972,"about_ca_topic_score_gemma":0.000002080905,"domain_scores_codex":[0.9991438,0.00001809017,0.0001528373,0.000222018,0.0001682934,0.0002949745],"domain_scores_gemma":[0.9995066,0.00007501983,0.00004094172,0.0002626191,0.00002752798,0.00008732294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00008198391,0.0001468471,0.7957825,0.0001420816,0.00005822943,0.0004157739,0.005514931,0.007371777,0.04597368,0.04461998,0.0007805949,0.09911162],"study_design_scores_gemma":[0.0006559837,0.00009741691,0.5867454,0.0001896885,0.000006585553,0.00008856676,0.0002273979,0.02185624,0.3867447,0.001453078,0.001275743,0.0006591897],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4091151,0.0000588418,0.5809423,0.00009175217,0.0002786946,0.00003311283,2.093614e-7,0.0003174058,0.009162526],"genre_scores_gemma":[0.8909743,0.000002282797,0.1084649,0.00002492537,0.0001237,0.000001116493,6.133841e-7,0.000003512612,0.0004046437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4818592,"threshold_uncertainty_score":0.3099841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122411895","doi":"10.1609/aimag.v25i1.1749","title":"Applications of case-based reasoning in molecular biology","year":2004,"lang":"en","type":"article","venue":"AI Magazine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Scientific reasoning; Domain (mathematical analysis); Computer science; Case-based reasoning; Artificial intelligence; Management science; Model-based reasoning; Data science; Knowledge representation and reasoning; Engineering; Mathematics education; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007530868579034015,"gpt":0.2666576103586232,"spread":0.2591267417795892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002122343,0.00007481052,0.0001137494,0.0001338203,0.00003716993,0.0000146437,0.000263772,0.00005086146,0.000005480718],"category_scores_gemma":[0.00002592547,0.00007545968,0.00002864098,0.0004841816,0.00003278548,0.00006785512,0.00004942534,0.0001142004,0.00002920425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002503813,"about_ca_system_score_gemma":0.0001006669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001698225,"about_ca_topic_score_gemma":0.0000321404,"domain_scores_codex":[0.9993526,0.00003603304,0.0001736645,0.00021004,0.00005841663,0.0001692544],"domain_scores_gemma":[0.9994468,0.00006213198,0.00006383796,0.0003430935,0.00004536875,0.00003875501],"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.00001807025,0.0003407574,0.02007607,0.0001305485,0.00003418823,0.001839502,0.0009208363,0.1178475,0.05146089,0.745779,0.0005233517,0.06102927],"study_design_scores_gemma":[0.01189047,0.001782504,0.006706347,0.001265806,0.00008787492,0.002630892,0.00008459417,0.4138101,0.1764887,0.3125209,0.07015797,0.002573835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01098257,0.0002638164,0.9860968,0.001462922,0.00002520857,0.0001118606,0.000003465743,0.00006353907,0.0009898091],"genre_scores_gemma":[0.7888493,9.851641e-7,0.2105904,0.0005000014,0.000008762851,0.00002403762,0.00000807819,0.000004555801,0.00001395307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7778667,"threshold_uncertainty_score":0.3077157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2274199420","doi":"10.1609/icaps.v22i1.13515","title":"Resource-Constrained Planning: A Monte Carlo Random Walk Approach","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Planner; Suite; Computer science; Resource (disambiguation); Monte Carlo method; Feature (linguistics); Random walk; Operations research; Function (biology); Mathematical optimization; Artificial intelligence; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04241536260847029,"gpt":0.2743744785948414,"spread":0.2319591159863711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097537,0.0002616477,0.0002918963,0.0002175834,0.0002992938,0.0003662645,0.001194407,0.0001386543,0.000005950621],"category_scores_gemma":[0.0003121681,0.0001982241,0.00009123974,0.0002526742,0.00009849834,0.0005365153,0.0002964469,0.0004664791,0.000003195063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003992168,"about_ca_system_score_gemma":0.00006455607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001876727,"about_ca_topic_score_gemma":4.855714e-8,"domain_scores_codex":[0.9981924,0.00002846033,0.0004073429,0.0003793223,0.0005651216,0.0004273261],"domain_scores_gemma":[0.9988661,0.0001956757,0.0004018756,0.0001468786,0.0002379742,0.0001514754],"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.001331569,0.0007137256,0.3493752,0.0006700107,0.001174429,0.00002092423,0.07246166,0.0943426,0.05645728,0.4063071,0.009137493,0.008008076],"study_design_scores_gemma":[0.0008767197,0.00005709864,0.002760997,0.0009368078,0.00002160487,0.0000949174,0.001345559,0.9893411,0.003468832,0.0004576184,0.0003527643,0.0002860102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9442941,0.0005237681,0.0064017,0.001857646,0.0005027756,0.0002637426,0.00001241532,0.0008547973,0.04528904],"genre_scores_gemma":[0.9742941,0.000003781474,0.02512818,0.0002243155,0.0001121769,0.00001738687,0.000004352319,0.00001512391,0.0002005566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8949985,"threshold_uncertainty_score":0.8083345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008536450","doi":"10.1016/s1350-4533(00)00078-3","title":"Clinical decision-support systems for intensive care units using case-based reasoning","year":2000,"lang":"en","type":"article","venue":"Medical Engineering & Physics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Carleton University; University of Ottawa","funders":"Medical Research Council","keywords":"Intensive care; Medicine; Matching (statistics); Neonatal intensive care unit; Work (physics); Decision support system; Intensive care unit; Medical emergency; Expert system; Intensive care medicine; Computer science; Artificial intelligence; Pediatrics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03309167810542692,"gpt":0.3006811901368823,"spread":0.2675895120314554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007639431,0.0002359004,0.0003883798,0.0000542274,0.0001815995,0.0001195261,0.0005474124,0.0002049629,0.00001918419],"category_scores_gemma":[0.001265014,0.0002244328,0.000127911,0.0004768625,0.00004261646,0.0001754894,0.00007313793,0.0004753394,0.00001727616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007439596,"about_ca_system_score_gemma":0.000499375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007029014,"about_ca_topic_score_gemma":9.668142e-7,"domain_scores_codex":[0.9979632,0.00005608717,0.0005250951,0.0004566238,0.0005235233,0.0004754579],"domain_scores_gemma":[0.9970824,0.001410453,0.00008805901,0.0004825765,0.0005482667,0.0003882697],"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.00002037605,0.00002171779,0.0003561439,0.0001911664,0.00004689717,0.001185577,0.001130425,0.7502148,0.000006638557,0.001834096,0.001510771,0.2434815],"study_design_scores_gemma":[0.0005987128,0.0001266091,0.00001503315,0.0007994454,0.00002322988,0.0002808046,0.0001096772,0.9865616,0.00003153096,0.00003177345,0.01115363,0.0002679641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04660109,0.0004248679,0.9512759,0.0000615379,0.001030742,0.0002031363,0.0000143992,0.000330114,0.00005825247],"genre_scores_gemma":[0.8665203,0.000012916,0.1317761,0.0006553394,0.0008806483,0.00002996819,0.00003968436,0.00005157846,0.00003345592],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8199192,"threshold_uncertainty_score":0.9152104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W131525165","doi":"","title":"Dual lookups in pattern databases","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Lookup table; Protein Data Bank (RCSB PDB); Heuristic; Table (database); Cube (algebra); Extension (predicate logic); Dual (grammatical number); Tree (set theory); Database; Combinatorics; Programming language; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1547039293367191,"gpt":0.3363811980348475,"spread":0.1816772686981283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005036861,0.0002211963,0.000190991,0.0003543682,0.00008718351,0.0003129934,0.0009411455,0.00006063922,0.000625667],"category_scores_gemma":[0.000189709,0.0002198373,0.00006827995,0.0002475395,0.00007461959,0.0006901206,0.0002481731,0.000381615,0.001546893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001210371,"about_ca_system_score_gemma":0.0001370662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003362203,"about_ca_topic_score_gemma":0.000641763,"domain_scores_codex":[0.9977829,0.00008775043,0.0006151254,0.0006005195,0.0005437492,0.0003699184],"domain_scores_gemma":[0.9988896,0.0001987611,0.000158167,0.0004530542,0.0001882323,0.0001121768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001865176,0.0001928008,0.0007234822,0.000004162325,0.00001172253,0.00007870941,0.0007006336,0.005459068,0.001184181,0.4203508,0.0003818297,0.5708939],"study_design_scores_gemma":[0.00009093294,0.0001369914,0.001393349,0.0003908076,0.000003317843,0.00004168101,0.0001928955,0.9104501,0.05248129,0.02782656,0.006437738,0.0005543453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02303146,0.00003200008,0.9487725,0.01570414,0.001001099,0.0001584277,0.00003256237,0.0001833741,0.01108441],"genre_scores_gemma":[0.9858645,0.00002756417,0.01216579,0.00135152,0.0003002652,0.0000221218,0.00002891674,0.00001030649,0.0002290072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.962833,"threshold_uncertainty_score":0.9992305,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140994944","doi":"10.1613/jair.2241","title":"Compressed Pattern Databases","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Table (database); Set (abstract data type); Uncompressed video; Database; Heuristic; Merge (version control); Domain (mathematical analysis); Algorithm; Data mining; Theoretical computer science; Information retrieval; Programming language; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3046764847256089,"gpt":0.4608203706218097,"spread":0.1561438858962008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01072664,0.0001106618,0.0002062011,0.000635125,0.0003008555,0.0002745924,0.001520345,0.00005562113,0.00008059816],"category_scores_gemma":[0.0006793815,0.00009209257,0.00009390027,0.0009222138,0.0001501045,0.0006412326,0.0002721449,0.0009494028,0.0001474752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007333916,"about_ca_system_score_gemma":0.0002552839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001452855,"about_ca_topic_score_gemma":0.00005235935,"domain_scores_codex":[0.9967976,0.000279301,0.0007764463,0.0002251327,0.001274925,0.0006465612],"domain_scores_gemma":[0.9961248,0.001933028,0.0002355363,0.0004309152,0.000999447,0.0002762801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009457978,0.000228855,0.001855917,0.00003169729,0.00003200604,0.0007242956,0.001687622,0.001453942,0.01149055,0.02170089,0.003177576,0.9575221],"study_design_scores_gemma":[0.0001628342,0.001886245,0.001879017,0.0009122363,0.00001652468,0.0006010008,0.003267954,0.1880978,0.7181883,0.05183376,0.03244727,0.0007070716],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02813777,0.0004136102,0.9689415,0.001223391,0.000467289,0.00007782086,0.00000219356,0.00002524397,0.0007112438],"genre_scores_gemma":[0.9709154,0.00004837374,0.02840744,0.00009337181,0.0004677589,7.238e-7,0.000001102079,0.000009017145,0.00005685362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.956815,"threshold_uncertainty_score":0.4124736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043379547","doi":"10.1017/s0890060405050080","title":"Functional reasoning theories: Problems and perspectives","year":2005,"lang":"en","type":"article","venue":"Artificial intelligence for engineering design analysis and manufacturing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Chiba University; University of Winnipeg","keywords":"Ascription; Function (biology); Computer science; Artificial intelligence; Artifact (error); Cognitive science; Epistemology; Representation (politics); Defeasible reasoning; Philosophy of science; Property (philosophy); Management science; Psychology; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0366648073150374,"gpt":0.2346097804040785,"spread":0.197944973089041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000655988,0.0001848957,0.0002208778,0.0003187191,0.0002661687,0.0003313894,0.0001701705,0.00005860606,0.00001243567],"category_scores_gemma":[0.00007548075,0.0001734175,0.0000936183,0.0002617853,0.00003600087,0.0004062231,0.00006298305,0.0001260336,0.000003440478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003181777,"about_ca_system_score_gemma":0.00001370825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003070947,"about_ca_topic_score_gemma":0.0000107726,"domain_scores_codex":[0.9988284,0.00002463476,0.0002651482,0.0004498328,0.0001326804,0.000299313],"domain_scores_gemma":[0.9992003,0.0003900045,0.00006938691,0.0001917635,0.00004670193,0.0001018805],"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.00001286315,0.00001897178,0.00006042637,0.00002704644,0.0002740351,0.000001238028,0.003540136,0.787921,0.000896971,0.1101901,0.00001239061,0.09704483],"study_design_scores_gemma":[0.00002529221,0.0000569822,0.00026582,0.00002935199,0.0001086579,0.000005592249,0.000244298,0.9428058,0.04777666,0.007971088,0.000465672,0.0002447487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01154879,0.0007885234,0.9868712,0.0003999215,0.00005777022,0.0001496368,0.000001829861,0.0001608115,0.00002154402],"genre_scores_gemma":[0.8249364,0.00005253217,0.1747962,0.00002320763,0.0001017489,0.00002843992,0.000003170874,0.00000976235,0.00004851531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8133876,"threshold_uncertainty_score":0.7071761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145271296","doi":"10.1109/taes.2011.6034643","title":"Hierarchical Fault Diagnosis and Fuzzy Rule-Based Reasoning for Satellites Formation Flight","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Spacecraft; Fault (geology); Fuzzy logic; Computer science; Hierarchy; Fault detection and isolation; Real-time computing; Satellite; Control engineering; Fuzzy rule; Space exploration; Reliability engineering; Engineering; Fuzzy control system; Artificial intelligence; Aerospace engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02140223082424079,"gpt":0.2293630962373694,"spread":0.2079608654131287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004154242,0.0001965214,0.0002154017,0.0001352184,0.000461217,0.0001871516,0.0001742788,0.0001248492,0.000002595736],"category_scores_gemma":[0.000006975256,0.0001778763,0.00006441047,0.0001984068,0.00004278221,0.0003275821,0.00000178242,0.0002533797,0.000005998343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000713936,"about_ca_system_score_gemma":0.00007816403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001360768,"about_ca_topic_score_gemma":0.0000430663,"domain_scores_codex":[0.9986615,0.00009291817,0.0002317793,0.0003686851,0.0001575627,0.0004875807],"domain_scores_gemma":[0.9991575,0.0003223169,0.00009374914,0.0002461512,0.00005356458,0.0001266961],"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.002131079,0.002036131,0.008837865,0.004436559,0.001188897,0.00005328815,0.05223655,0.05717878,0.01968828,0.2059957,0.004046758,0.6421701],"study_design_scores_gemma":[0.003964306,0.003604336,0.0005197497,0.001406314,0.0001965692,0.0002024449,0.0004845068,0.8493531,0.1258354,0.003285636,0.009629203,0.001518348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05703812,0.001815558,0.9397325,0.0003940138,0.0002349762,0.0004330397,0.00001134484,0.0001603676,0.000180114],"genre_scores_gemma":[0.9908166,0.0003302291,0.008209634,0.0001063875,0.00003403929,0.0003173469,0.000003770102,0.00001634844,0.0001656365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9337785,"threshold_uncertainty_score":0.7253584,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064770256","doi":"10.1147/sj.402.0394","title":"Intelligent decision support for protein crystal growth","year":2001,"lang":"en","type":"article","venue":"IBM Systems Journal","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Princess Margaret Cancer Centre; Queen's University; University Health Network; Ontario Institute for Cancer Research","funders":"University of Pittsburgh","keywords":"Correctness; Computer science; Software; Protein crystallization; Crystallization; Component (thermodynamics); Process (computing); Artificial intelligence; Algorithm; Engineering; Programming language; Chemical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02873250277522924,"gpt":0.2692422154708109,"spread":0.2405097126955817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001710261,0.0001600312,0.0002191583,0.000182951,0.0003875958,0.000662272,0.0006977037,0.00008830328,0.00003293224],"category_scores_gemma":[0.0001381354,0.0001290188,0.0001294747,0.0002224682,0.00001509242,0.0004767582,0.00007780553,0.0002690333,0.00005715074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009820854,"about_ca_system_score_gemma":0.0001840705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002664197,"about_ca_topic_score_gemma":0.000002020342,"domain_scores_codex":[0.9982671,0.0001018549,0.0005438959,0.0002654477,0.0003848187,0.0004368905],"domain_scores_gemma":[0.9988101,0.0001513443,0.0002767168,0.0002365819,0.0002860087,0.0002392644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001099785,0.0009489173,0.04609323,0.001090794,0.0006386407,0.003711378,0.01099062,0.0277347,0.02249144,0.09155937,0.2585766,0.5350646],"study_design_scores_gemma":[0.003360025,0.002820512,0.0009870064,0.002643623,0.0000460279,0.02440785,0.0004696145,0.3808038,0.003387942,0.02383791,0.5556548,0.00158091],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01545419,0.0003245296,0.9808676,0.000268929,0.001410967,0.000375317,0.000003876709,0.00009015368,0.001204389],"genre_scores_gemma":[0.9493099,0.00001541755,0.04851379,0.00008023422,0.000676579,0.00003587049,0.000003049105,0.00001790457,0.001347214],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9338558,"threshold_uncertainty_score":0.6386304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1819804398","doi":"10.1186/1472-6947-4-19","title":"Case-based medical informatics","year":2004,"lang":"en","type":"review","venue":"BMC Medical Informatics and Decision Making","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Computer science; Knowledge representation and reasoning; Data science; Context (archaeology); Analytic reasoning; Artificial intelligence; Terminology; Health informatics; Domain knowledge; Knowledge management; Health care; Reasoning system","retraction":null,"screen_n_in":null,"score":{"opus":0.0744431214151241,"gpt":0.3649893685409816,"spread":0.2905462471258575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041917,0.0006465776,0.001670032,0.0006341545,0.0004381051,0.0007841609,0.001974113,0.001263565,0.000178413],"category_scores_gemma":[0.001723557,0.0004558204,0.0004047058,0.0008197781,0.0001671816,0.0005974296,0.001159683,0.001502808,0.0001970407],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001320095,"about_ca_system_score_gemma":0.00631335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006614132,"about_ca_topic_score_gemma":0.00001412037,"domain_scores_codex":[0.9925233,0.0001431272,0.003195328,0.0002848476,0.003164576,0.0006887916],"domain_scores_gemma":[0.9893871,0.007333212,0.001175521,0.0009963143,0.0001267045,0.0009811301],"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.000002642169,0.00002040788,0.000001733475,0.01520155,0.00002186031,0.0007360827,0.0003307727,0.0002098168,7.713952e-11,0.003065515,0.0008286506,0.9795809],"study_design_scores_gemma":[0.0005179385,0.0000622436,6.213872e-8,0.07457817,0.00007073854,0.008017356,0.00006422806,0.6540209,1.847246e-8,0.001310276,0.260871,0.0004870469],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004761696,0.3866653,0.6119897,0.000007480825,0.0003897493,0.0002321952,0.000008321379,0.0001443144,0.000558162],"genre_scores_gemma":[0.00001236403,0.4223788,0.5766627,0.0007703831,0.0001005045,0.00002164588,0.00002679932,0.00002151558,0.000005299491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9790939,"threshold_uncertainty_score":0.9997894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1938618045","doi":"","title":"A fuzzy case-based system for weather prediction","year":2002,"lang":"en","type":"article","venue":"Dialnet (Universidad de la Rioja)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Measure (data warehouse); Construct (python library); Similarity (geometry); Fuzzy logic; Similarity measure; Weather prediction; Data mining; Artificial intelligence; Weather forecasting; Weather patterns; Machine learning; Meteorology","retraction":null,"screen_n_in":null,"score":{"opus":0.01413757788221626,"gpt":0.2147345997281199,"spread":0.2005970218459037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004263991,0.0001469144,0.0001538262,0.0001937413,0.0003489554,0.0001632589,0.000376581,0.0001612007,0.00002438128],"category_scores_gemma":[0.00002695994,0.0001610474,0.0001068253,0.0003389315,0.00004186934,0.0003154602,0.00004293106,0.00014718,0.0000493872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001720294,"about_ca_system_score_gemma":0.00005995101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001391332,"about_ca_topic_score_gemma":0.0000136555,"domain_scores_codex":[0.9988784,0.0001640679,0.0001235981,0.0003354822,0.0001587664,0.0003397461],"domain_scores_gemma":[0.9988856,0.000454636,0.00009483263,0.00037311,0.00005841852,0.0001334221],"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.0002949203,0.0007288698,0.01856088,0.001405768,0.0005015775,0.01483998,0.0358896,0.05810204,0.003011518,0.4620888,0.2404812,0.1640949],"study_design_scores_gemma":[0.002044597,0.0002636991,0.0004740283,0.0001684554,0.00005831219,0.0007591128,0.0004781224,0.9514094,0.0003300763,0.0007795001,0.0428611,0.0003736095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04477235,0.0002804619,0.917022,0.0008060554,0.0004907235,0.0004066526,0.00008137113,0.0008914217,0.03524896],"genre_scores_gemma":[0.9664819,0.000002626146,0.03238992,0.0001478886,0.0001182336,0.00001865269,0.00001071191,0.00001732361,0.0008127798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9217095,"threshold_uncertainty_score":0.6567323,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}